source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define ss second
#define ff first
#define int long long
#define double long double
#define pb push_back
const int N = 7e5 + 51, MOD = 1e9 + 7, mod = 998244353,INF = 2e18;
mt19937 Flash_new_51(515... | C++ | 5cb7ce7485c86ca73c0adfd27227adf9 | 912d3bbc07ca9601c6ec8d312b90820c | 2,400 | PASSED |
function toInt(v){ return parseInt(v); }
var _l = readline().split(' ');
var x0 = parseInt(_l[0]);
var y0 = parseInt(_l[1]);
var x1 = parseInt(_l[2]);
var y1 = parseInt(_l[3]);
var n = parseInt(readline());
var path = [];
var m = {};
for(var i=0; i<n; i++){
_l = readline().split(' ').map(toInt);
var x=_l[0];
for(... | Javascript | c3cbc9688594d6611fd7bdd98d9afaa0 | c0d303c7f11c25371dbba04339c81877 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>valid;
map<pair<int,int>,int>visited;
map<pair<int,int>,int>level;
int bfs(int x0,int y0,int x1,int y1)
{
queue<pair<int,int> >q;
q.push(make_pair(x0,y0));
visited[make_pair(x0,y0)]=1;
level[make_pair(x0,y0)]=0;
level[make_pair(x1,y1)]=... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | bb0075c2f4f13ef36ae2e44babbdad31 | 1,800 | PASSED |
#include "cstdio"
#include "iostream"
#include "cstdlib"
#include "map"
#include "vector"
#include "cstring"
#include "algorithm"
#include "queue"
using namespace std;
#define mp make_pair
typedef pair<int, int> pii;
map<pii, int> f;
deque<pii> q;
pii p0, p1;
int n;
const int ci[] = {-1, -1, -1, 1, 1, 1, 0, 0};
const... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | d5945cf4482e591dd70a1f04a3c6aa00 | 1,800 | PASSED |
#include <cstdio>
#include <map>
#include <utility>
#define mp make_pair
#define X first
#define Y second
using namespace std;
map< pair<int,int>,bool > a,b;
int n,x0,y0,x1,y1,dst[100100];
pair<int,int> lin[100100];
int main() {
scanf("%d%d%d%d",&x0,&y0,&x1,&y1);
scanf("%d",&n);
for (int i=1;i<=n;++i) {
int k,l,... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | 0dcf94955386a88dced66fc80a8bead3 | 1,800 | PASSED |
/*
Aditya Gourav
@adi_pearl / @aditya_pearl
*/
#include<bits/stdc++.h>
using namespace std;
//scanning
#define si(x) scanf("%d",&x)
#define si2(x,y) scanf("%d%d",&x,&y)
#define si3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define si4(x,y,z,a) scanf("%d%d%d%d",&x,&y,&z,&a)
#define ss(x) scanf("%s",x)
#define sd(x) scanf("%... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | 025de934e0c0c89dce610ba33ea1e706 | 1,800 | PASSED |
#include <cstdio>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MAXN 100000
set< pair<int, int> > valid,visited;
int dr[] = {-1,-1,-1,0,0,1,1,1};
int dc[] = {-1,0,1,-1,1,-1,0,1};
struct node{
int r,c,dist;
node(){}
node(int _r, int _c, int _dist):
r(_r), c(_c),... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | 50aaae2d182b68d9ba80bb8160308620 | 1,800 | PASSED |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <cstdlib>
#include <cstring>
#include <string>
#include <ctime>
#include <sstream>
#define clr(name,val) memset(name,val,sizeof(name));
#define EPS .0... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | 5b4630c923a23e49950abdc510fad27f | 1,800 | PASSED |
//Boleyn Su's Template for Codeforces
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | 972d8bec333991c2ba31fa4bcabc7ae7 | 1,800 | PASSED |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
#define pole(x,y) pole[(1000000000LL*(x)+y)]
#define was(x,y) was[(1000000000LL*(x)+y)]
int main()
{
//freopen("input.txt","r",stdin);
LL x0,y0,x1,y1;
LL n;
LL r,a,b;
map <LL, bool > pole;
map <LL, int > was;
/... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | fbad8ed8b51ffa4eac0aa9ccb60767a9 | 1,800 | PASSED |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
#define pole(x,y) pole[(1000000000LL*(x)+y)]
#define was(x,y) was[(1000000000LL*(x)+y)]
int main()
{
//freopen("input.txt","r",stdin);
LL x0,y0,x1,y1;
LL n;
LL r,a,b;
map <LL, bool > pole;
map <LL, int > was;
/... | C++ | c3cbc9688594d6611fd7bdd98d9afaa0 | ca74a2535c39c4098ac45a9d406efaff | 1,800 | PASSED |
lst=[]
t = int(input())
for i in range(t):
n=int(input())
lst.append(n)
for j in lst:
if j%4==0:
lst2=[]
lst1 = [k for k in range(2,j+1,2)]
for m in range(len(lst1)-1):
lst2.append(lst1[m]-1)
lst2.append(lst1[-1]+len(lst1)-1)
print('YES')
for f... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | b71988837c6670b9dd3e06ee32a90e7d | 800 | PASSED |
import math
t= int(input())
for i in range(t):
n = int(input())
print("YES" if n%4 == 0 else "NO")
if (n%4 ==0):
j = 1
for k in range(1,n//4+1,1):
print(2*j, 2*(j+1), end=' ')
j+=3
j = 1
for k in range(1,n//4+1,1):
print(2*j-1,2*(j+2)-1,end... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | 99963408110745578798ea36470c1648 | 800 | PASSED |
t=int(input())
a=[2*i for i in range(1,200000)]
b=[2*i+1 for i in range(200000)]
#print(a,b)
for i in range(t):
p=int(input())
if (p/2)%2==1:
print("NO")
else:
ansl=a[:int(p/2)]
ansr=b[:int(p/2)]
ansr[-1]+=int(p/2)
... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | 6a9bf551929e847c320005fec4d9826a | 800 | PASSED |
t=int(input())
for i in range(0,t):
n=int(input())
arr1=[]
arr2=[]
if n%4 != 0:
print('NO')
else:
print('YES')
for j in range(1,n+1):
if j%2==0:
arr1.append(j)
else:
arr2.append(j)
arr2[-1]=arr2[-1]+int(n/2)
... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | fb9d35c186c5ddbcd4c0cf1725082d77 | 800 | PASSED |
for i in range (int(input())):
n = int(input())
oddchk = n // 2
# print("oddchk", oddchk)
arr = []
for i in range (1, n + 1):
if i % 2 == 0:
arr.append(i)
# print(arr)
# print("sum of arr", sum(arr))
s = sum(arr)
odd = []
for i in range (n):
if i % 2... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | f741ecd5d71f261fc9e64c7d803cb3d9 | 800 | PASSED |
for _ in range(int(input())):
n=int(input())
if n%4==0:
print("YES")
for i in range(2,n+1,2):
print(i,end=" ")
for i in range(n-3,0,-2):
print(i,end=" ")
print(3*n//2-1)
else:
print("NO") | Python | 0c7e019e1e955cadacca55b4e823a3e5 | f60c06c0b46d5c3b083f03c32d7d144c | 800 | PASSED |
from math import log2
t = int(input())
for _ in range(t):
n = int(input())
half = n // 2
if half & 1:
print('NO')
continue
even = []
odd = []
for i in range(1, half+1):
even.append(2*i)
for i in range(1, n-1, 2):
odd.append(i)
odd.append(sum(even) - sum(odd))
print('YES')
print(*(even+odd), sep = ' ... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | cbb9c2283d07c6d0fbf51d97f95199b7 | 800 | PASSED |
t = int(input())
for i in range(t):
n = int(input())
if n%4 != 0:
print('NO')
else:
print('YES')
for i in range(2,n+1,2):
print(i, end=" ")
for i in range(1,n-2,2):
print(i, end=" ")
print(i + 2 + int(n/2))
| Python | 0c7e019e1e955cadacca55b4e823a3e5 | 3d4a43188c447e2816709461de83323e | 800 | PASSED |
l=[0 for i in range(2*(10**5))]
sol=[]
s=6
j=0
for i in range((10**5)//2):
while l[j]!=0:
j+=1
l[j]=1
if s-(2*j+1)<2*(10**5):
l[s//2-(j+1)]=1
sol.append(2*j+1)
sol.append(s-(2*j+1))
s+=8
t=int(input())
for i in range(t):
n=int(input())
if (n//2)%2!=0:
print(... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | a3815e897a7078b4cc0e8dfc612592cd | 800 | PASSED |
import math
for _ in range(int(input())):
n=int(input())
ans=[]
if (n//2)%2==1:
print("NO")
else:
odd=[]
even=[]
for i in range(n//2):
x=n-i-1
y=n+i+1
if x%2==0:
even.append(x)
else:
odd.appen... | Python | 0c7e019e1e955cadacca55b4e823a3e5 | f1de11aa99650c33af017e1093293825 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,i,sum=0,r;
cin>>n>>x;
int a[n];
for(i=0; i<n; i++)
{
cin>>a[i];
sum=sum+a[i];
r=abs(sum);
}
if(r==0)
{
cout<<0<<endl;
return 0;
}
else if(r<=x)
{
cout<<1<<endl;
... | C++ | 066906ee58af5163636dac9334619ea7 | 8888f84fb9d1e1c05b618d9e6d1548a6 | 800 | PASSED |
#include <iostream>
#include<cmath>
using namespace std;
int main()
{
int n,b;
cin>>n>>b;
int ar[n];
int s=0;
for(int i=0;i<n;i++){cin>>ar[i];s=s+ar[i];}
s=fabs(s);
if(s==0)cout<<0;
else if(s>b){
int r;
if((double)s/b>s/b)r=s/b+1;
else r=s/b;
cout<<r;
}
else cout<<1;
return 0;... | C++ | 066906ee58af5163636dac9334619ea7 | bdad7c80d847cfc66171d17dfdc338be | 800 | PASSED |
#include <iostream>
#include<cmath>
using namespace std;
int main()
{
int n,m,a;cin>>n>>m;long long r=0;
for(int i=0;i<n;i++)cin>>a,r+=a;
r=abs(r);
cout<<(r+m-1)/m;
return 0;
}
| C++ | 066906ee58af5163636dac9334619ea7 | a6dfa2373cf9c8d883b0aa5f5313470d | 800 | PASSED |
//ITOG
#include <bits/stdc++.h>
bool ch[100001]={0};
using namespace std;
int main()
{
int n,x ,ans=0;
int a[1000];
cin>>n>>x;
for(int i=0;i<n;i++)
cin>>a[i] , ans+=a[i];
if(ans==0) return cout<<"0"<<endl , 0;
if(abs(ans) <= x) return cout<<'1'<<endl , 0;
if(abs(ans)%x==0) return cout<<abs(ans)/x<<endl , 0;
... | C++ | 066906ee58af5163636dac9334619ea7 | acbbc6f13462370e10eea957606dd5e2 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int n , x , sum=0 , a=0 , j=0;
cin >>n >>x;
int v[n];
for ( int i=0; i < n; i++ )
{
cin >>v[i];
sum += v[i];
j = i;
}
if ( sum ==0 )
{
goto label;
a = 0;
}
if ( -sum <= x && -sum ... | C++ | 066906ee58af5163636dac9334619ea7 | 7298f16ffc56fd72ee3df64b0d487051 | 800 | PASSED |
#include<string.h>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
int a[1005];
int b[1002];
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d%d",&n,&m);
int sum=0;
int ans=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
... | C++ | 066906ee58af5163636dac9334619ea7 | 43058f4d42f09981010ff2cd8fbc076d | 800 | PASSED |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,m,a;
while(~scanf("%d%d",&n,&m))
{
int sum=0;
for(int i=0; i<n; i++)
{
scanf("%d",&a);
sum+=a;
}
if(sum==0)
printf("0\n");
else... | C++ | 066906ee58af5163636dac9334619ea7 | de1476067ef2d55a59d94717b6e31978 | 800 | PASSED |
# include <bits/stdc++.h>
using namespace std;
#define Jovid_Mahmudov main()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair < ll, ll > pll;
typedef pair < int, int > pii;
ll n,m,i,ans,k;
int main()
{
cin >> n >> m;
ll a[n + 1];
for(i = 1;i <= n;i++)
{
... | C++ | 066906ee58af5163636dac9334619ea7 | 108566396077cbeeb325e204189fc34c | 800 | PASSED |
# include <iostream>
using namespace std;
long long n,x,i,s,k;
int main()
{
cin >> n >> x;
long long a[n + 1];
for(i = 1;i <= n;i++)cin >> a[i],s += a[i];
if(s < 0)s = -s;
while(s > 0)
{
s -= x;
k++;
}
cout << k;
return 0;
}
| C++ | 066906ee58af5163636dac9334619ea7 | 72fb6982723dac7c2c17cb1b0c7e94b8 | 800 | PASSED |
#include <bits/stdc++.h>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main()
{
long long int i,n,m,d,t,sum=0;
cin >> n>>m;
for(i=0;i<n;i++)
{
cin >>d;
sum+=d;
}
sum=abs(sum);
t=sum/m;
if(sum>(t*m))
{
cout <... | C++ | 066906ee58af5163636dac9334619ea7 | ec71d34270103526553d0e3a17fb938a | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#define fup(i,a,b,c) for(int i=a;i<=b;i+=c)
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
ll a = 0, b = 0, temp = 0, result = 0;
string A = "";
vector<char>vec(27);
int main() {
cin >> a >> b;... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | ea478f82f125051ca7d903d65443d7b7 | 1,200 | PASSED |
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <string.h>
using namespace std;
int main()
{
int n,k;
long long sign=0,count=0;
int a[28];
memset(a,0,sizeof(a));
string s;
char tem;
scanf("%d%d",&n,&k);
getchar();
getline(cin,s);
s+='z'+1;
for(int i=0;i<... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | cdf225c28447b91157e0e9fb44de5db3 | 1,200 | PASSED |
#include<iostream>
#include<stdio.h>
#include <sstream>
#include <cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#in... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | 6259122182e48fdf16e03ebc6667c9a6 | 1,200 | PASSED |
//#include<bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
char str[200005];
cin>>str;
while(y--)
{
char s;
cin>>s;... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | b2ce528600130cdec5d62b7b67a4c27b | 1,200 | PASSED |
//#include<bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int s,t;
cin>>s>>t;
char str1[200005];
cin>>str1;
char x;
for(int j=0;j<t;j++)
{... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | ef0bb9e1bad9e38ae3845ad4c9a4449b | 1,200 | PASSED |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
typedef long long ll;
using namespace std;
int main()
{
ll n,k;
cin>>n>>k;
string str;
cin>>str;
ll sum=0;
ll p=0;
for(int i=0;i<k;i++)
{
... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | f53b7e280bcd57617cdc1707b2246964 | 1,200 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
bool visit[27] = { 0, };
long long int sum = 0;
long long int real = 0;
int n, k;
cin >> n >> k;
string tmp;
cin >> tmp;
for (int i = 0; i ... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | 1d8dc7188d2ca574e695034a1b5b3799 | 1,200 | PASSED |
#include <iostream>
#include<algorithm>
#include <string>
#include<sstream>
#include <iomanip>
#include <cmath>
#include <math.h>
#include <functional>
#include <ostream>
#include <set>
#include <iterator>
#include <vector>
#include <stack>
#include <cctype>
#include <deque>
#include <queue>
#include <map>
#include <c... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | 7f8d0686467b1d54812a61e93c89a9e3 | 1,200 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long int n, k, t, q = 0, sum=0;
cin >> n >> k;
string s;
cin >> s;
t = s.size();
vector <char> a;
a.resize(k);
for (int i = 0; i < k; i++)
{
cin >> a[i];
};
for (long long int j = 0; j < t; ... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | d229155ddd869bedfa3d2ec3c01810a0 | 1,200 | PASSED |
#include <iostream>
#include <string>
using namespace std;
string pstr;
int pcount;
int max(int a, int b)
{
if (a > b) return a; else return b;
}
int min(int a, int b)
{
if (a < b) return a; else return b;
}
long long decision(string str, int n, int *keys, int k)
{
long long curCount = 0;
long long result = ... | C++ | 4c260e7c6fd9c573ee4f3b1822f3c7c3 | 078ca7167e58a4f266f08c298ba29a40 | 1,200 | PASSED |
#include<cstdio>
#include<cstdlib>
#define ll long long
const ll mod=998244353;
int main()
{
int n;
scanf("%d",&n);
ll *a=(ll *) malloc((n+2)*sizeof(ll));
ll *cnt=(ll *) calloc(11,sizeof(ll));
for (int i=0;i<n;i++)
scanf("%lld",&a[i]);
for (int i=0;i<n;i++)
{
ll d=a[i],br... | C++ | b4cd60296083ee2ae8a560209433dcaf | 04d829d990ca0269894c27a0e53b3c3b | 1,800 | PASSED |
#include <iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<bitset>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<list>
#include<algorithm>
#include<time.h>
#include<sstream>
using namespace std;
long long GCD(long long a, long long b) { retur... | C++ | b4cd60296083ee2ae8a560209433dcaf | 477d73d094c61449712c19562ad3101a | 1,800 | PASSED |
#include<bits/stdc++.h>
#define pr(x) cerr << "\n" << (#x) << " is " << (x) << endl
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define Toggle(n,i) (n^(1<<i))
#define Check(n,i) (n&(1<<i))
#define Set(n,i) (n|(1<<i))
#define Reset(n,i) (n&(~(1<<i)))
... | C++ | b4cd60296083ee2ae8a560209433dcaf | 1922282787f81f6fb586cd5b873437e6 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define pr(x) cerr << "\n" << (#x) << " is " << (x) << endl
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define Toggle(n,i) (n^(1<<i))
#define Check(n,i) (n&(1<<i))
#define Set(n,i) (n|(1<<i))
#define Reset(n,i) (n&(~(1<<i)))
... | C++ | b4cd60296083ee2ae8a560209433dcaf | 0a04a68bbf786a63ba7b1f8ce46b0516 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
// #define ull long long
#define ull unsigned long long int
#define debug(x) cout<<#x<<'='<<(x)<<endl<<flush
#define N (ull)1.5e9+99
#define pb push_back
#define mod 998244353
// #define mod 1000000007
#define f(i,n) for(ull i=0;i<n;i++)
#define fab(i,a,... | C++ | b4cd60296083ee2ae8a560209433dcaf | 4eb5ce14890c8bfa155bf98f9e9ad3d8 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
string temp[100001];
long long mod=998244353;
long long ans=0;
long long s[20]={0};
long long c[25];
int main(){
cin>>n;
c[0]=1;
for(int i=1;i<=20;i++){
c[i]=(c[i-1]*10)%mod;
}
for(int i=1;i<=n;i++){
cin>>temp[i];
int sum=temp[i].size()-1;
s[sum+1]++;
long long... | C++ | b4cd60296083ee2ae8a560209433dcaf | f3f7f30c07c8ecd748cc3ccfe2eaec16 | 1,800 | PASSED |
#include<iostream>
using namespace std;
typedef long long LL;
LL read(){
#define cg (c=getchar())
LL x,f=1;char c;
while(cg<'0'||'9'<c)if(c=='-')f=-1;
for(x=(c^48);'0'<=cg&&c<='9';x=(x<<3)+(x<<1)+(c^48));
return x*f;
#undef cg
}
#define MAXL 20
const LL MOD=998244353;
LL N,powTen[MAXL+5],ans;
LL tot[MAXL+5],bas[M... | C++ | b4cd60296083ee2ae8a560209433dcaf | b1576d96c9397ea9b5a779d1f82b2e5a | 1,800 | PASSED |
#include<map>
#include<list>
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define il inline
#define ll long long
#define rl register ll
#define ri register int
#define rc register char
using namespace std;
il int read(){
rc c=' ';
ri v=0,x=1;
while((c<'0')||(c>'9')){if(c=... | C++ | b4cd60296083ee2ae8a560209433dcaf | 0462a41a4e373bc8809f148087382f39 | 1,800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int mod = 998244353;
int get_di(long long x) {
long long ans = 0;
while (x) {
ans++;
x /= 10;
}
return ans;
}
long long a[100004][14];
int cnt[14];
int main() {
long long n;
cin >> n;
long long x;
memset(cnt, 0, ... | C++ | b4cd60296083ee2ae8a560209433dcaf | f54e70a639a9232a178b9c0d6b6f4923 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100001, mod = 998244353;
int a[N], l[20], p[100], aux[20], aa[20];
int len(int x) {
int cnt = 0;
while(x) ++cnt, x /= 10;
return cnt;
}
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout... | C++ | b4cd60296083ee2ae8a560209433dcaf | e7f4732ccdae503a959d0ebf8debbf2e | 1,800 | PASSED |
/*
⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡎... | C++ | 35ecc1e8b87dc9a611f130992d387373 | 7b3d46c71ca8314c9ba5eab34428e320 | 2,800 | PASSED |
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ff first
#define ss second
#define ... | C++ | 35ecc1e8b87dc9a611f130992d387373 | b4348068af85f10a74d6cbefe4bb3bdc | 2,800 | PASSED |
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ff first
#define ss second
#define ... | C++ | 35ecc1e8b87dc9a611f130992d387373 | c6d5dbedd4f835bd26e96604214b810b | 2,800 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#define MAXN 600000+100
using namespace std;
struct Edge{
int u,v,w,next;
} E[MAXN*2];
int n,m,ss,tt;
int edge_cnt=0;
int head[MAXN];
int dfn[MAXN],low[MAXN];
bool instack[MAXN];
int block[MAXN];
int clock=0;
vector<pair<int,... | C++ | a65813fabe4110a3ee3d891f09302be1 | 24b4c58d620c970f0f56c5bc5b4a2a9b | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int a[7500][7500];
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
... | C++ | 5172d358f1d451b42efff1019219a54d | 5d4e5e7c1f6d61a71b7a9d0f4c7bbfe3 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int a[7900][7900];
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
... | C++ | 5172d358f1d451b42efff1019219a54d | 1e10ae2a8ddfe804ad9e29fa68f9ef76 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int a[8000][8000];
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
... | C++ | 5172d358f1d451b42efff1019219a54d | 155a8b27fe8cc9b4ad52c84daf6541df | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int a[7800][7800];
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
... | C++ | 5172d358f1d451b42efff1019219a54d | 85b964b22b7778ac572a2bbb28cf23cb | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
vector<ll>prime;
vector<int>graph[GNode];
///markers
bool pmark[PMax];
bool Dvis[GNode];
bool Bvis[GNode];
///Sieve
void sieve()
{
ll i,j;
pmark[1]=1;
for(i=4; i<=PMax; i+=2)
{
... | C++ | 5172d358f1d451b42efff1019219a54d | 7ff78689c0886f81b42bca7aa456609e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
}
... | C++ | 5172d358f1d451b42efff1019219a54d | 9f188bb7293e574ec93c049abd457535 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
///vector
int a[7000][7000];
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll l,r;
cin>>l>>r;
double x=floor(r/l);
if(x==1)
{
cout<<"YES"<<endl;
... | C++ | 5172d358f1d451b42efff1019219a54d | 486a88e38b6579478a6cc4909c30b1e6 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int t, l, r, i, n, team1, team2, d;
while(cin >> t){
for(i = 1; i <= t; i ++){
cin >> l >> r;
d = max(l, r - l + 1);
bool Find = false;
while(true){
team1 = (l / d) + 1;
team2 = l + d;
if((l / d + 1) % 2 == 0 && (l / d + 1) / 2 >= 1){
... | C++ | 5172d358f1d451b42efff1019219a54d | 603d8cb38781c64e2cbd0b7111c5d4e7 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define in cin >>
#define out cout <<
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b;i>=a;i--)
#define sz(a) int(a.size())
#define inarray(a,n) for(int i=0;i<n;i++)cin>>a[i];
#define fast ios_base::sync_with_stdio(false); ... | C++ | 5172d358f1d451b42efff1019219a54d | 4a4f1fdea19e1a61dd2a01bed4f82d1b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t;
cin>>t;
while(t--)
{
int l,r;
cin>>l>>r;
if(ceil((1.0*(r+1))/(1.0*2))<=l)
{
cout<<"YES"<<endl;
}
else cout<<"NO"<<endl;
}
} | C++ | 5172d358f1d451b42efff1019219a54d | 4b23f189af4b4153613e7518a8f934b8 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define dbg(var) cout<<#var<<"="<<var<<" "
#define nl cout<<"\n"
#define fr(i,n) for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define fast ios::sync_with_stdio(false);cin.tie(0);
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define fa(... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | e8dc014ea354479cd27b1b8b96731c93 | 2,100 | PASSED |
//CODE BY DAKSH
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define all(a) (a).begin(),(a).end()
#define F ... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 876c52e0e55779522a8975c21e9d004d | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,m;cin>>n>>m;
vector<pair<int,int> > a;
vector<int> v(n);
vector<int> b(m);
int minn=1e9;
for(int i=0;i<n;i++){
int x;cin>>x;
v[i]=x;
a.push_back({x,i});
minn=min(x,minn);
}
fo... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | b4d0333794c03a31013aedddd4423f8b | 2,100 | PASSED |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_upd... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 3242ea732681f8fbc0acd406f9080099 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
const int M=2e5+10;
const int inf=0x3f3f3f3f;
const ll mod=998244353;
const int bit=32;
int a[M],b[M];
map<int,int>mm;
struct node{
int l,r;
}w[M];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 3a4390fda3f17222dc121cea9349510a | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
const int M=2e5+10;
const int inf=0x3f3f3f3f;
const ll mod=998244353;
const int bit=32;
int a[M],b[M],l[M];
map<int,int>mm;
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 70989aa5a185ebffbbb6777a456ea3a5 | 2,100 | PASSED |
//
// Created by fssqawj on 2020/6/17.
//
#include <bits/stdc++.h>
using namespace std;
struct Node {
int value;
int idx;
public:
Node(int value, int idx) {
this->value = value;
this->idx = idx;
}
friend bool operator < (Node a, Node b)
{
if (a.value == b.value) {
... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 8dd5d969404e9b35adaaedb65d8ed046 | 2,100 | PASSED |
#include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 92b4fed367f74c1f43e2b25b81fef8cb | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
const int oo=1e9;
const int Mod=998244353;
const long long OO=1e18;
const int N=2e5+5;
int n, m, a[N], b[N];
map<int,int... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | 04e1b4794a345e365f095698e1c7ef51 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
const int N=2e5+5;
int n,m,trai[N],vitri[N], a[N], b[N];
map<int,int>mp;
const int oo=1e9;
const int Mod=998244353;
const long long OO=1e18;
void xuat()
{
cout << 0;
e... | C++ | 69a2b0f3f0f05ca3144dc0717c8fee09 | bc0efd98669ad01de29898900c22540a | 2,100 | PASSED |
import java.util.Scanner;
public class DoorsBreaking {
public static void main(String [] args)
{ Scanner s = new Scanner(System.in);
int n = s.nextInt();
int x = s.nextInt();
int y = s.nextInt();
int arr[] = new int[n];
for (int i = 0; i < n; i++) {// for reading array
arr[i] = s.nextInt();
}
i... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 29a54382d71eb71fdb252ca56928c7ef | 1,200 | PASSED |
import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 8008936106188faa8455fb230b3b41d8 | 1,200 | PASSED |
import java.util.*;
public class Main {
static class Data implements Comparable<Data> {
int data, index, color;
public Data(int d, int i) {
data = d;
index = i;
}
@Override
public int compareTo(Data o) {
if (this.data > o.data)
... | Java | c173e2695562dfa1f603e6a925a2e1f3 | ec1d1e1369de4f20dd689adc138f65e5 | 1,200 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
public class DoorBreakAndRep {
public static void main(String args[]) throws IOException {
FastReader in = new FastReader();
OutputStream outputStream = System.out;
PrintWriter out = new PrintWriter(outputStream);
Task.solve... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 95a6aae1d555864645ec8dd06f9fc332 | 1,200 | PASSED |
import java.util.Scanner;
public class walls {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
int ans = 0;
if (x > y) {
... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 7f04fc600d7cd2be5e57f1e03cbc2c24 | 1,200 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
public class DoorsBreakingAndRepairing {
public static void main(String [] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String [] params = br.readLine().trim().split... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 2bf626d1fced53dc46a065dbeacdd67a | 1,200 | PASSED |
import java.util.*;
import java.io.*;
import java.lang.*;
public class Solution
{
public static int findMinRec(int arr[], int i,
int sumCalculated,
int sumTotal)
{
if (i == 0)
return Math.abs((sumTotal-sumCalculated) -
sumCalculated);
return Math.min(findMinRec(arr... | Java | c173e2695562dfa1f603e6a925a2e1f3 | a828749f613939694147fb7683902ddf | 1,200 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
public class solving {
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
int destroy=scan.nextInt();
int make=scan.nextInt();
int ar[]=new int[n];
int once=0;
for(int i=0;i<n;i++)
{
ar[i]=scan.ne... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 936fad4c35d4c67b89b20278a2ec55b0 | 1,200 | PASSED |
import java.io.*;
import java.util.*;
import java.math.*;
import java.net.*;
import java.applet.*;
import java.awt.*;
import java.awt.event.*;
public class cf
{
public static void merge(int arr[], int l, int m, int r)
{
int n1 = m - l + 1;
int n2 = r - m;
int L[] = new int [n1];
... | Java | c173e2695562dfa1f603e6a925a2e1f3 | f1e68c5526c3e9c45ca4846f54063637 | 1,200 | PASSED |
import java.util.*;
import java.io.*;
public class P1102C {
private static void solve() {
int n = nextInt();
int x = nextInt();
int y = nextInt();
if (x > y) {
System.out.println(n);
return;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int a = nextInt();
if (a <... | Java | c173e2695562dfa1f603e6a925a2e1f3 | 11007c840d0e7cfca722f82becefa4d2 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define REP(i, a, b) for(int i = a; i <= b; i ++)
#define REPG(i, x) for(int i = head[x]; i; i = g[i].nxt)
#define clr(x, y) memset(x, y, sizeof(x))
using namespace std;
typedef long long LL;
typedef double LF;
LL Max(LL a, LL b){return a > b ? a : b;}
LL Min(LL a, LL b){return a < b ? a :... | C++ | c9c3fabde66856667c338d71e17f6418 | 341c3920add74a286d94f59633d89a2c | 1,800 | PASSED |
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
int gcd(int x,int y){
while(x%y){
int z=x%y;
x=y;
y=z;
}
return y;
}
int main(){
int n,k,i,x,y;
cin>>n>>k;
y=k;
for(i=0;i<n;i++){
scanf("%d",&x);
x%=k;
if(x) y=gcd(y,x);
}
cout<<k/y<<endl;
for(i=0;i<k/y;i++) cout<<i... | C++ | c9c3fabde66856667c338d71e17f6418 | 365fc3904a04087c1f6391c3c4e7996a | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#define MAXK 100000
using namespace std;
bool aRev[MAXK];
vector<int> factors;
bool dp[MAXK];
int gcd(int n1, int n2) {
return (n2 == 0) ? n1 : gcd(n2, n1 % n2);
}
int main() {
int n, k; scanf("%d %d\n", &n, &k);
for(int i = 0; i < n; i++) {
int ai; scanf("%d", &ai);
... | C++ | c9c3fabde66856667c338d71e17f6418 | 1cf6fcf9b74bd80ff34eb0cff4921a62 | 1,800 | PASSED |
#include <cstdio>
#define MAXK 100000
bool dp[MAXK];
int gcd(int n1, int n2) {
return (n2 == 0) ? n1 : gcd(n2, n1 % n2);
}
int main() {
int n, k; scanf("%d %d\n", &n, &k);
int aGcd = k;
for(int i = 0; i < n; i++) {
int ai; scanf("%d", &ai);
aGcd = gcd(aGcd, ai);
}
dp[0] = true;
int cnt = 1;
... | C++ | c9c3fabde66856667c338d71e17f6418 | dcef2e2d9e098770b2d2a12a153e97b1 | 1,800 | PASSED |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define MAXN 100000
#define MAXK 100000
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef long double ld;
int a[... | C++ | c9c3fabde66856667c338d71e17f6418 | f5bd06557d9832dbbc41378340baac3b | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n, k, a[100010];
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x%y);
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%... | C++ | c9c3fabde66856667c338d71e17f6418 | 51e687c852bd053c82a645b5ba6483a3 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int k;
int g;
cin>>n>>k;
g=k;
int a;
for(int i=0;i<n;i++)
{
cin>>a;
g=__gcd(a,g);
}
cout<<k/g<<endl;
for (int j=0;j<k;j=j+g)
{
cout<<j<<" ";
}
return 0;
}
| C++ | c9c3fabde66856667c338d71e17f6418 | ff02a63d5d7f09290587a78a300a8b4c | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int k;
int g;
cin>>n>>k;
g=k;
int a;
for(int i=0;i<n;i++)
{
cin>>a;
g=__gcd(a,g);
}
cout<<k/g<<endl;
for (int j=0;j<k;j=j+g)
{
cout<<j<<" ";
}
return 0;
}
| C++ | c9c3fabde66856667c338d71e17f6418 | 4f6873c6f21ab3fdeabe8f77966ea1b6 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int GCD(int x,int y){
if(x<y) swap(x,y);
while((x%=y)&&(y%=x));
return max(x,y);
}
int a[100010];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,k,ans,x;
cin>>n>>k;
ans=k;
for(int i=1;i<=n;i++){
cin>>x;
ans=GCD(ans,x);
... | C++ | c9c3fabde66856667c338d71e17f6418 | bfc6b5e3fbd81564505e6e526b64eaf3 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define INTMAX 0x7FFFFFFF
#define INTMIN -0x80000000
#define LONGMAX 0x7FFFFFFFFFFFFFFF
#define LONGMIN -0x8000000000000000
int gcd(int a, int b){
if(a==0)
return b;
return gcd(b%a, a);
}
int main(){
int n,k;
cin >> n >> k;
int a[n];
for(int i=0; i<n; i++){
ci... | C++ | c9c3fabde66856667c338d71e17f6418 | ac78afba8faf38e22e19e103cee9617f | 1,800 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
using namespace std;
int median(int x, int y, int z) {
return (x + y + z) / 2;
}
void updateValues(const vector<int>& a, vector<int>& b, int begin, int end) {
if ((end - begin) % 2... | C++ | 5da1c96b88b4ac0b698a37e4d2437ccb | 75c56db29f214f5ddde11c1fb6c6f9d4 | 1,700 | PASSED |
/*
/\ /\
| ).|.( |
| >-< |
=========
It's AdilkhanKo miaaaaaau
*/
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl "\n"
#define foreach(it, S) for(__typeof (S.begin()) it = S.begin(); it != S.end(); it++)
#define mp make_pair
#define f first
#define s second
#define name ""
... | C++ | 5da1c96b88b4ac0b698a37e4d2437ccb | f3b413ecaf599ca6d7247aed81b19283 | 1,700 | PASSED |
/*
* Problem:
* Author: SHJWUDP
* Created Time: 2015/10/25 星期日 17:04:57
* File Name: 1001.cpp
* State:
* Memo:
*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
int n, m;
bool judge(vector<int> & arr) {
int lt=arr[0]... | C++ | 5da1c96b88b4ac0b698a37e4d2437ccb | b0b78ca329fa785f047532e00ce9d60e | 1,700 | PASSED |
/*
* Problem:
* Author: SHJWUDP
* Created Time: 2015/10/25 星期日 17:04:57
* File Name: 1001.cpp
* State:
* Memo:
*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
int n, m;
bool judge(vector<int> & arr) {
int lt=arr[0]... | C++ | 5da1c96b88b4ac0b698a37e4d2437ccb | 516e6c798dac513a88dea00dd0c415ba | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#... | C++ | 5da1c96b88b4ac0b698a37e4d2437ccb | 457dd56bd14f66b41592a6f85b0da8a4 | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.