identifier
string | space
string | input
string | target
float64 | metric_type
string | metadata
string |
|---|---|---|---|---|---|
CDSS_5728242
|
CDSS
|
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
typedef unsigned long long ui64;
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
vi graph[5];
bool vis[5];
i64 coun=1;
bool flag;
void check(i64 i)
{
if(flag)
return;
// cout<<i<<" ";
vis[i]=true;
for(auto j:graph[i])
{
if(vis[j])
continue;
check(j);
}
flag=true;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// ifstream fin(".in");
// ofstream fout(".in");
forn(i,3)
{
i64 from,to;
cin>>from>>to;
graph[from].pb(to);
graph[to].pb(from);
}
bool is=true;
for1(i,4)
{flag=false;
memset(vis,false,sizeof(vis));
is=true;
check(i);
// cout<<"\n";
for1(j,4)
{
if(vis[j]==false)
is=false;
}
if(is)
{
cout<<"YES";
break;
}
}
if(!is)
cout<<"NO";
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's399021950', 'p_id': 'p03130', 'u_id': 'u114047445', 'date': '1549767749', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '1816'}
|
CDSS_10459953
|
CDSS
|
n = int(input())
ans = [0 for i in range(10**5)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
ans[x**2 + y**2 + z**2 + x*y + y*z + z*x] += 1
for i in range(1,n+1):
print(ans[i])
| 73,264 |
memory_bytes
|
{'s_id': 's607359372', 'p_id': 'p02608', 'u_id': 'u997036872', 'date': '1594523469', 'language': 'Python', 'original_language': 'PyPy3 (7.3.0)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '117', 'memory': '73264', 'code_size': '231'}
|
CDSS_7914220
|
CDSS
|
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
#define mk make_pair
#define pb push_back
#define eps 1e-12
#define MAXN 200009
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
vector<int> v;
int cnt=0;
for(int test=1;test<=64;test++)
{
int low=0,high=9;
if(test==1)
{
low=1;
}
while(low<high)
{
cnt++;
//cout<<low<<" "<<high<<"\n";
int mid=low+((high-low)/2);
vector<int> vv=v;
vv.pb(mid);
while(vv.size()!=11)
{
vv.pb(9);
}
ll num=0;
for(int i=0;i<vv.size();i++)
{
//cout<<vv[i]<<" ";
num=(num*10ll)+vv[i];
}
//cout<<"\n";
char ch;
cout<<'?'<<' '<<num<<endl;
cin>>ch;
//cout<<ch<<"\n";
if(ch=='Y')
{
high=mid;
}
else
{
low=mid+1;
}
}
if(low==0)
{
cnt++;
vector<int> vv=v;
vv.pb(0);
while(vv.size()!=11)
{
vv.pb(0);
}
ll num=0;
for(int i=0;i<vv.size();i++)
{
num=(num*10ll)+vv[i];
}
char ch;
cout<<'?'<<' '<<num<<endl;
cin>>ch;
if(ch=='Y')
{
break;
}
else
{
v.pb(low);
}
}
else
{
v.pb(low);
}
}
vector<int> v1;
v1.pb(1);
while(1)
{
if(v1.size()>10)
{
break;
}
cnt++;
vector<int> vv=v1;
ll num=0;
for(int i=0;i<vv.size();i++)
{
num=(num*10ll)+vv[i];
}
char ch;
cout<<'?'<<' '<<num<<endl;
cin>>ch;
if(ch=='Y')
{
v1.pb(0);
}
else
{
v1.pop_back();
break;
}
}
if(v1.size()>10)
{
v1.clear();
v1.pb(9);
while(1)
{
ll num=0;
for(int i=0;i<v1.size();i++)
{
num=num*10;
num+=v1[i];
}
char ch;
cout<<'?'<<' '<<num<<endl;
cin>>ch;
if(ch=='Y')
{
break;
}
else
{
v1.pb(9);
}
}
while(v.size()!=v1.size())
{
v.pb(0);
}
ll ans=0;
for(int i=0;i<v.size();i++)
{
ans=(ans*10)+v[i];
}
cout<<'!'<<' '<<ans<<endl;
return 0;
}
int len=v1.size();
while(v.size()!=len)
{
v.pb(0);
}
ll ans=0;
for(int i=0;i<v.size();i++)
{
ans=(ans*10)+v[i];
}
cout<<'!'<<' '<<ans<<endl;
}
| 596 |
memory_bytes
|
{'s_id': 's635314308', 'p_id': 'p03663', 'u_id': 'u972989019', 'date': '1500263329', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '5', 'memory': '596', 'code_size': '2152'}
|
CDSS_5804519
|
CDSS
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
bool n1=false;
bool n2=false;
bool n3=false;
bool n4=false;
for(int i=0;i<4;i++){
cin>>a;
if(a==1)n1=true;
else if(a==9)n2=true;
else if(a==7)n3=true;
else if(a==4)n4=true;
}
if(n1==true&&n2==true&&n3==true&&n4==true)
cout<<"YES";
else cout << "NO";
}
| 256 |
memory_bytes
|
{'s_id': 's156255423', 'p_id': 'p03149', 'u_id': 'u406647332', 'date': '1578943205', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '366'}
|
CDSS_3715679
|
CDSS
|
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>
#define rep(i,n) for(ll i=0; i<n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
int main(){
ll N,K;
cin >> N >> K;
ll M=N;
ll A=K;
ll i=1;
while(M>=A){
A*=K;
i++;
}
cout << i << endl;
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's450007147', 'p_id': 'p02766', 'u_id': 'u420528322', 'date': '1582423841', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '475'}
|
CDSS_6653689
|
CDSS
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
#define all(x) (x).begin(),(x).end()
#define _GLIBCXX_DEBUG
typedef long long ll;
using namespace std;
int main(){
ll p=1000000000+7;
ll n,k;
cin>>n>>k;
if(n>8||k>8){cout<<":("<<endl;}
else cout<<"Yay!"<<endl;
}
| 256 |
memory_bytes
|
{'s_id': 's226438394', 'p_id': 'p03323', 'u_id': 'u223857357', 'date': '1577605172', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '312'}
|
CDSS_11317241
|
CDSS
|
import itertools
n = int(input())
pn = tuple(map(int, input().split()))
qn = tuple(map(int, input().split()))
n_list = list(range(1, n+1))
counter = 1
for i in itertools.permutations(n_list, n):
if pn == i:
a = counter
if qn == i:
b = counter
counter += 1
print(abs(a-b))
| 3,060 |
memory_bytes
|
{'s_id': 's485107712', 'p_id': 'p02813', 'u_id': 'u086438369', 'date': '1587224788', 'language': 'Python', 'original_language': 'Python (3.4.3)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '27', 'memory': '3060', 'code_size': '292'}
|
CDSS_12546184
|
CDSS
|
N = input()
S = sum([int(num) for num in N])
print('Yes' if int(N) % S == 0 else 'No')
| 2,940 |
memory_bytes
|
{'s_id': 's750913091', 'p_id': 'p03316', 'u_id': 'u278832126', 'date': '1530042164', 'language': 'Python', 'original_language': 'Python (3.4.3)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '17', 'memory': '2940', 'code_size': '86'}
|
CDSS_5756149
|
CDSS
|
#include<bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
using namespace std;
typedef pair< int, int > P;
typedef pair< int, P > iP;
typedef long long LL;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const int MOD = (10^9 + 7);
int dx[] = {0, -1, 1, 0};
int dy[] = {-1, 0, 0, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[m];
for(int i = 0; i < m; ++i) cin >> a[i];
sort(a, a + m);
int s[m];
for(int i = 0; i < m; ++i) {
if(i) s[i] = a[i] - a[i - 1];
else s[i] = 0;
}
sort(s, s + m);
int ans = 0;
for(int i = 0; i <= m - n; ++i) {
ans += s[i];
}
cout << ans << endl;
return 0;
}
| 1,024 |
memory_bytes
|
{'s_id': 's976169403', 'p_id': 'p03137', 'u_id': 'u254187258', 'date': '1549246542', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '18', 'memory': '1024', 'code_size': '830'}
|
CDSS_8930579
|
CDSS
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, L;
cin >> N >> L;
string S[110];
rep(i, N) cin >> S[i];
sort(S, S + N);
string T;
rep(i, N) T += S[i];
cout << T << endl;
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's209276176', 'p_id': 'p04044', 'u_id': 'u965730380', 'date': '1551848248', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '642'}
|
CDSS_5228917
|
CDSS
|
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
using namespace std;
typedef long long int lli;
int gcd(int a, int b){
return b != 0 ? gcd(b, a%b) : a;
}
int lcm(int a, int b){
return a*b / gcd(a, b);
}
#define N_MAX 200000
#define MOD 1000000007
int N;
bool func(int width, int pos, char *S, char *T)
{
int left = 1, right = width;
for (int i = N - 1; i >= 0; i--){
if ('L' == T[i]){
right = min(width, right + 1);
}
else if ('R' == T[i]){
left = max(1, left - 1);
}
if ('L' == S[i]){
left++;
}
else if ('R' == S[i]){
right--;
}
if (left > right){
return false;
}
}
if (left <= pos && pos <= right){
return true;
}
return false;
}
void change(char *S)
{
for (int i = 0; i < N; i++){
if ('L' == S[i]){
S[i] = 'U';
}
else if ('R' == S[i]){
S[i] = 'D';
}
else if ('U' == S[i]){
S[i] = 'L';
}
else if ('D' == S[i]){
S[i] = 'R';
}
}
return;
}
void solv()
{
char S[N_MAX]; scanf("%s", S);
int len = strlen(S);
int cnt = 0; lli ret = 0;
for (int i = 0; i < len; i++){
if ('A' == S[i]){
cnt++;
}
else if ('B' == S[i]){
if ('C' == S[i + 1]){
ret += (lli)cnt;
i++;
}
else{
cnt = 0;
}
}
else if ('C' == S[i]){
cnt = 0;
}
}
printf("%lld", ret);
return;
}
int main()
{
FILE *fin = NULL, *fout = NULL;
//fin = freopen("input.txt", "r", stdin);
//fout = freopen("output.txt", "w", stdout);
solv();
//finalize
if (NULL != fin) fclose(fin);
if (NULL != fout) fclose(fout);
return 0;
}
| 384 |
memory_bytes
|
{'s_id': 's535433296', 'p_id': 'p03018', 'u_id': 'u103357948', 'date': '1577779017', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '2', 'memory': '384', 'code_size': '1663'}
|
CDSS_3435662
|
CDSS
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//name[i][j]-> vvl name(i,vl(j))
//map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
signed main(){
string s; cin>>s;
int n=s.size();
string t=s;
reverse(all(t));
if(s!=t){
cout<<"No"<<endl;
return 0;
}
int a=(n-1)/2;
int b=(n+3)/2-1;
string k,l;
rep(i,0,a){
k.push_back(s[i]);
}
rep(i,b,n){
l.push_back(s[i]);
}
// cout<<k<<endl<<l<<endl;
if(k==l)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 3,600 |
memory_bytes
|
{'s_id': 's786552715', 'p_id': 'p02730', 'u_id': 'u164181205', 'date': '1593741383', 'language': 'C++', 'original_language': 'C++ (GCC 9.2.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '7', 'memory': '3600', 'code_size': '938'}
|
CDSS_12674308
|
CDSS
|
a,b,c,d = int(input()),int(input()),int(input()),int(input())
ans = a if a<=b else b
ans += c if c<=d else d
print(ans)
| 2,940 |
memory_bytes
|
{'s_id': 's897388898', 'p_id': 'p03399', 'u_id': 'u063703408', 'date': '1586699720', 'language': 'Python', 'original_language': 'Python (3.4.3)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '17', 'memory': '2940', 'code_size': '119'}
|
CDSS_785923
|
CDSS
|
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using System.Numerics;
namespace AtCoder
{
class Program
{
private static Mod109 mod109 = new Mod109();
private static void Main(string[] args)
{
var s = Scanner.Integer();
if (s < 3)
{
Console.WriteLine("0");
return;
}
if (s < 6)
{
Console.WriteLine("1");
return;
}
s -= 5;
var array = new List<long>{1,1,1};
for (int i = 0; i < s; i++)
{
array.Add(mod109.Addition(array[^1] , array[^3]));
}
Console.WriteLine(array.Last());
}
#region Utility
static readonly StreamScanner Scanner = new StreamScanner(Console.OpenStandardInput());
/// <summary> 一括出力 </summary>
private static void OutAllLine(IEnumerable<dynamic> items)
{
var sb = new StringBuilder();
foreach (var result in items)
{
sb.Append(result.ToString() + "\n");
}
sb = sb.Remove(sb.Length - 1, 1);
Console.WriteLine(sb);
}
#endregion
}
#region Utility Class
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
private readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) throw new EndOfStreamException();
if (ptr >= len) {
ptr = 0;
if ((len = str.Read(buf, 0, 1024)) <= 0)
{
isEof = true;
return 0;
}
}
return buf[ptr++];
}
public char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanIncludeSpace()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 32 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public long Long()
{
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (int)Long(); }
public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
/// <summary> 数値読み込み </summary>
public List<long> ArrayLong(int count = 0)
{
var scan = new List<long>();
for (int i = 0; i < count; i++)
{
scan.Add(Long());
}
return scan;
}
/// <summary> 数値読み込み </summary>
public List<int> ArrayInt(int count = 0)
{
var scan = new List<int>();
for (int i = 0; i < count; i++)
{
scan.Add(Integer());
}
return scan;
}
}
public class LargeCalc
{
public IEnumerable<long> Surplus(long baseNum, long power, int division)
{
long value = 1;
for (int i = 1; i <= power; i++)
{
value = value * baseNum % division;
yield return value;
if (value == 0)
{
break;
}
}
}
}
public class Primer
{
/// <summary> 素数判定 </summary>
public bool IsPrime(long num)
{
if (num < 2) {return false;}
if (num == 2) {return true;}
if (num % 2 == 0) {return false;}
double sqrtNum = Math.Sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0) { return false; }
}
return true;
}
public IEnumerable<long> GetPrimeFactors(long n)
{
int i = 2;
long tmp = n;
while (i * i <= tmp)
{
if(tmp % i == 0){
tmp /= i;
yield return i;
if (IsPrime(tmp))
{
yield return tmp;
tmp = 1;
break;
}
}else{
i++;
}
}
if(tmp != 1) yield return tmp;
}
}
public class Mod109
{
public const int _7 = 1000000007;
public const int _9 = 1000000009;
public const int _3 = 998244353;
private readonly int ModValue;
public Mod109(int modValue = Mod109._7)
{
ModValue = modValue;
}
/// <summary> 和 </summary>
public long Addition(long start, params long[] nums)
{
return nums.Aggregate(start, (current, num) => ModifyPositive((current + num) % ModValue));
}
/// <summary> 差 </summary>
public long Subtraction(long start, params long[] nums)
{
return nums.Aggregate(start, (current, num) => ModifyPositive((current - num) % ModValue));
}
/// <summary> 積 </summary>
public long Multiplication(long start, params long[] nums)
{
return nums.Aggregate(start, (current, num) => ModifyPositive((current * num) % ModValue));
}
private long ModifyPositive(long value)
{
return value < 0 ? (value + ModValue) : value;
}
}
public class BitArrayMaker
{
public List<int> Integer(int bitValue, int length)
{
var list = new List<int>();
for (int i = 0; i < length; i++)
{
if (bitValue % 2 == 1)
{
list.Add(i);
}
bitValue /= 2;
}
return list;
}
public bool[] Boolean(int bitValue, int length)
{
var list = new bool[length];
for (int i = 0; i < length; i++)
{
list[i] = bitValue % 2 == 1;
bitValue /= 2;
}
return list;
}
}
#endregion
}
| 26,600 |
memory_bytes
|
{'s_id': 's237963488', 'p_id': 'p02555', 'u_id': 'u933432447', 'date': '1600114730', 'language': 'C#', 'original_language': 'C# (.NET Core 3.1.201)', 'filename_ext': 'cs', 'status': 'Accepted', 'cpu_time': '100', 'memory': '26600', 'code_size': '7262'}
|
CDSS_13088926
|
CDSS
|
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if c>=a:
if c<=b:
print('Yes')
else:
print('No')
else:
print('No')
| 2,940 |
memory_bytes
|
{'s_id': 's838689436', 'p_id': 'p03719', 'u_id': 'u071916806', 'date': '1585539465', 'language': 'Python', 'original_language': 'Python (3.4.3)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '17', 'memory': '2940', 'code_size': '129'}
|
CDSS_7405874
|
CDSS
|
#include<iostream>
using namespace std;
int main()
{
int n,a,b,m;
cin >> n >> a >> b;
m=a*n;
cout << min(m,b);
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's496074739', 'p_id': 'p03501', 'u_id': 'u620684847', 'date': '1513560889', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '122'}
|
CDSS_11836981
|
CDSS
|
def comb(n, r):
if r<0 or r>n:
return 0
r=min(r, n-r)
return g1[n]*g2[r]*g2[n-r]%MOD
MOD=10**9+7
MAXN=4000+10
g1=[1, 1]
g2=[1, 1]
inverse=[0, 1]
for i in range(2, MAXN+1):
g1.append((g1[-1]*i)%MOD)
inverse.append(-inverse[MOD%i]*(MOD//i)%MOD)
g2.append((g2[-1]*inverse[-1])%MOD)
def f(n, k):
if n<k:
return 0
if n==0 and k==0:
return 1
if k<1:
return 0
return f2(n-k, k)
def f2(n, k):
return comb(n+k-1, k-1)
N, K=map(int, input().split())
for i in range(1, K+1):
b=f(K, i)
r=f(N-K, i-1)+2*f(N-K, i)+f(N-K, i+1)
print((b*r)%MOD)
| 43,760 |
memory_bytes
|
{'s_id': 's152391858', 'p_id': 'p02990', 'u_id': 'u419877586', 'date': '1580664632', 'language': 'Python', 'original_language': 'PyPy3 (2.4.0)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '239', 'memory': '43760', 'code_size': '621'}
|
CDSS_5486625
|
CDSS
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b;cin>>a>>b;
print(max({a+b,a+a-1ll,b+b-1ll}));
return 0;
}
| 3,608 |
memory_bytes
|
{'s_id': 's428752310', 'p_id': 'p03071', 'u_id': 'u894339989', 'date': '1593897802', 'language': 'C++', 'original_language': 'C++ (GCC 9.2.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '7', 'memory': '3608', 'code_size': '559'}
|
CDSS_9025252
|
CDSS
|
package main
import (
"bufio"
"bytes"
"fmt"
"io"
"math/bits"
"os"
// "strconv"
// "strings"
)
// 長い入力を読む
func ReadLongLines(times int) ([]string, error) {
result := make([]string, times)
reader := bufio.NewReader(os.Stdin)
buffer := bytes.NewBuffer(make([]byte, 0))
readBytes := int64(2)
for i := 0; i < times; i++ {
for {
readBuf, isPrefix, err := reader.ReadLine()
// fmt.Printf("Reader.Read: %d\n", len(readBuf))
readBytes += int64(len(readBuf) + 1)
if err != nil {
if err == io.EOF {
fmt.Println("EOF")
break
} else {
return result, err
}
}
_, err = buffer.Write(readBuf)
if err != nil {
return result, err
}
// end of line
if !isPrefix {
result[i] = buffer.String()
buffer.Reset()
// reader = bufio.NewReader(os.Stdin)
break
}
}
}
// 先読みしてしまうようなので、戻しておく
os.Stdin.Seek(-int64(reader.Buffered()), os.SEEK_CUR)
return result, nil
}
// 出力 for 競プロ
type Console struct {
writer *bufio.Writer
}
func NewConsole() Console {
return Console{bufio.NewWriter(os.Stdout)}
}
func (this *Console) Printf(format string, a ...interface{}) {
fmt.Fprintf(this.writer, format, a...)
}
func (this *Console) Println(s string) {
fmt.Fprintln(this.writer, s)
}
func (this *Console) Close() {
this.Flush()
}
func (this Console) Flush() {
this.writer.Flush()
}
func PrintList(list []int) {
con := NewConsole()
defer con.Flush()
for i := range list {
if i == 0 {
con.Printf("%d", list[i])
} else {
con.Printf(" %d", list[i])
}
}
con.Println("")
}
func main() {
con := NewConsole()
defer con.Flush()
var n int
fmt.Scanf("%d", &n)
max := uint32(1)
for i := 0; i < n; i++ {
max = max * 2
}
for i := uint32(0); i < max; i++ {
con.Printf("%d:", i)
begin := bits.TrailingZeros32(i)
end := bits.LeadingZeros32(i)
for j := begin; j < 32-end; j++ {
//fmt.Printf("%d & 1<<%d (%d)\n",i, j, (i & (1 << uint32(j))))
if 0 < (i & (1 << uint32(j))) {
con.Printf(" %d", j)
}
}
con.Println("")
}
}
| 6,136 |
memory_bytes
|
{'s_id': 's577208035', 'p_id': 'p02427', 'u_id': 'u296792720', 'date': '1582680682', 'language': 'Go', 'original_language': 'Go', 'filename_ext': 'go', 'status': 'Accepted', 'cpu_time': '330', 'memory': '6136', 'code_size': '2091'}
|
CDSS_9261537
|
CDSS
|
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int r;
while((r = x % y) != 0){
x = y;
y = r;
}
System.out.println(y);
}
}
| 26,412 |
memory_bytes
|
{'s_id': 's065614948', 'p_id': 'p02256', 'u_id': 'u260130756', 'date': '1589206664', 'language': 'Java', 'original_language': 'JAVA', 'filename_ext': 'java', 'status': 'Accepted', 'cpu_time': '80', 'memory': '26412', 'code_size': '332'}
|
CDSS_5251179
|
CDSS
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const int mod = 1000003;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<mint> prod(mod), prodinv(mod);
prod[0]=1;
prodinv[mod-1]=-1;
rep2(i,1,mod)prod[i]=prod[i-1]*i;
//rep2(i,1,mod)prodinv[mod-i-1]=mint(mod-i)*prodinv[mod-i];
rep2(i,0,mod)prodinv[i]=prod[i].inv();
ll q;cin>>q;
rep(i,q){
ll x,d,n;cin>>x>>d>>n;
mint mx=mint(x),md=mint(d);
if(d==0){cout<<mx.pow(n).x<<endl;continue;}
mint l = mx/md;
mint r = (mx+md*(n-1))/md;
if(n>=mod||r.x<l.x){cout<<0<<endl;continue;}
cout<<(prod[r.x]*prodinv[l.x-1]*md.pow(n)).x<<endl;
}
return 0;
}
| 16,512 |
memory_bytes
|
{'s_id': 's955171315', 'p_id': 'p03027', 'u_id': 'u129667379', 'date': '1583951202', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '361', 'memory': '16512', 'code_size': '1823'}
|
CDSS_6853206
|
CDSS
|
#include<stdio.h>
#include<string.h>
using namespace std;
int f_min(int a, int b){
return a > b ? b : a;
}
int f_max(int a, int b){
return a < b ? b : a;
}
int main(){
int A, B, C, X, Y, ans;
scanf("%d %d %d %d %d", &A, &B, &C, &X, &Y);
int op1 = X*A + Y*B;
int op2 = 2*C*f_max(X, Y);
int op3;
if(X>Y){
op3 = 2*C*Y + ((X-Y)*A);
} else op3 = 2*C*X + ((Y-X)*B);
ans = f_min(f_min(op1, op2), op3);
printf("%d\n", ans);
}
| 128 |
memory_bytes
|
{'s_id': 's371907705', 'p_id': 'p03371', 'u_id': 'u944447976', 'date': '1524360888', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '128', 'code_size': '437'}
|
CDSS_6812426
|
CDSS
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
typedef long long ll;
using namespace std;
long long GCD(long long a, long long b){if(b==0)return a;return GCD(b,a%b);}
int main() {
int H, W; cin >> H >> W;
char s[H][W];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> s[i][j];
}
}
bool can = true;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (s[i][j] == '.') continue;
bool f = false;
if (i != 0) f |= s[i-1][j] == '#';
if (i != H-1) f |= s[i+1][j] == '#';
if (j != 0) f |= s[i][j-1] == '#';
if (j != W-1) f |= s[i][j+1] == '#';
can &= f;
}
}
if (can) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 256 |
memory_bytes
|
{'s_id': 's846449898', 'p_id': 'p03361', 'u_id': 'u600896094', 'date': '1556760416', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '874'}
|
CDSS_2333771
|
CDSS
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <string>
#include <limits>
using namespace std;
using i64 = int64_t;
using P = pair<i64, i64>;
i64 mod = 1000000007;
//i64 mod = 998244353;
int int_max = 2147483647;
i64 INF = 1e16;
int max_n = 1e5;
bool can_divide(const vector<i64>& v, i64 k, i64 val) {
for (i64 l : v) {
if (l > val)
k -= (l/val);
if (k < 0) return false;
}
return true;
}
int main(int argc, char **argv) {
i64 n, k;
cin >>n >> k;
vector<i64> v(n, 0);
i64 v_sum{0};
for(i64 i=0; i<n; ++i) {
cin >> v[i];
v_sum += v[i];
}
sort(v.begin(), v.end(), greater<i64>());
i64 left{0}, right{1000000001};
while (right - left > 1) {
//cout << left << " "<< right << endl;
i64 mid = (left+right) / 2;
if (can_divide(v, k, mid)) right = mid;
else left = mid;
}
cout << right << endl;
return 0;
}
| 4,712 |
memory_bytes
|
{'s_id': 's536819710', 'p_id': 'p02598', 'u_id': 'u603356062', 'date': '1596421064', 'language': 'C++', 'original_language': 'C++ (GCC 9.2.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '131', 'memory': '4712', 'code_size': '1134'}
|
CDSS_4281044
|
CDSS
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin>>n)
{
string a;
cin>>a;
if(n&1)
{
cout<<"No"<<endl;
}
else
{
string t1="";
string t2="";
for(int i=n/2;i<n;i++)
{
t1=t1+a[i];
}
for(int i=0;i<n/2;i++)
{
t2=t2+a[i];
}
if(t1==t2)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's005809507', 'p_id': 'p02860', 'u_id': 'u980041546', 'date': '1576821378', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '614'}
|
CDSS_6499380
|
CDSS
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
string convert_str(int n){
string str;
stringstream ss;
ss << n;
ss >> str;
return str;
}
string convert_nb(int n, int negBase){
if (n == 0)
return "0";
string converted = "";
while (n != 0){
int remainder = n % negBase;
n /= negBase;
if (remainder < 0) {
remainder += (-negBase);
n += 1;
}
converted = convert_str(remainder) + converted;
}
return converted;
}
int main() {
ll n;
cin>>n;
int negBase = -2;
cout << convert_nb(n, negBase)<<endl;
return 0;
}
| 256 |
memory_bytes
|
{'s_id': 's812830848', 'p_id': 'p03286', 'u_id': 'u353919145', 'date': '1585192370', 'language': 'C++', 'original_language': 'C++14 (GCC 5.4.1)', 'filename_ext': 'cpp', 'status': 'Accepted', 'cpu_time': '1', 'memory': '256', 'code_size': '627'}
|
CDSS_13531529
|
CDSS
|
# https://atcoder.jp/contests/abc112/tasks/abc112_d
require 'prime'
N, M = gets.split.map(&:to_i)
m = M
ary = []
# https://qiita.com/seinosuke/items/fde2e0471dcf937e5a09
class Integer
def my_divisor_list3
return [1] if self == 1
first, *rest = Prime.prime_division(self).map do |p, k|
(0..k).map{|i| p**i}
end
first.product(*rest).map do |a|
a.inject(&:*)
end.sort
end
end
p M.my_divisor_list3.select { |i| i <= M/N }.max
| 3,964 |
memory_bytes
|
{'s_id': 's342006185', 'p_id': 'p03241', 'u_id': 'u987208743', 'date': '1562819272', 'language': 'Ruby', 'original_language': 'Ruby (2.3.3)', 'filename_ext': 'rb', 'status': 'Accepted', 'cpu_time': '14', 'memory': '3964', 'code_size': '459'}
|
CDSS_11078825
|
CDSS
|
N , A ,B = map(int,input().split())
K = A+B
ans = (N//K)*A
ans += min(A,N%K)
print(ans)
| 3,064 |
memory_bytes
|
{'s_id': 's714598670', 'p_id': 'p02754', 'u_id': 'u948521599', 'date': '1583646118', 'language': 'Python', 'original_language': 'Python (3.4.3)', 'filename_ext': 'py', 'status': 'Accepted', 'cpu_time': '17', 'memory': '3064', 'code_size': '87'}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.