code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
const vi tbl = {1, 1, 2, 6, 24, 120, 720, 5040};
int main(void){
int n;
cin >> n;
vi P(n), Q(n);
for(int &p : P) cin >> p;
for(int &q : Q) cin >> q;
int p = 0, q = 0;
for(int i=0; i<n-1;... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> P(N, 0), Q(N, 0);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
for (int i = 0; i < N; ++i) {
cin >> Q[i];
}
vector<int> X;
for (int i = 1; i <= N; ++i) {
X.push_back(i);
... | 1 | 87,003,072 |
#include <bits/stdc++.h>
using namespace std;
vector<int> tsort_Kahn(const vector<vector<int>>& g) {
const int V = g.size();
vector<int> indeg(V,0);
stack<int> S;
for(auto& u_out_edges : g)
for(auto& v : u_out_edges)
indeg[v]++;
for(int i=0; i<V; ++i)
if( indeg[i] == 0 )
S.push(i);
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
#include <vector>
#include <list>
using namespace std;
static const int MAX = 10000;
static const bool DEBUG = false;
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void bfs(int s) {
queue<int> q;
q.push(s);
V[s] = true;
if... | 1 | 51,761,851 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int AA=0;
int BB=0;
string S;
cin>>S;
vector<char>A(S.size());
for(int X=0;X<S.size();X++){
if(X%2==0){
A.at(X)='1';
}
else{
A.at(X)='0';
}
}
for(int X=0;X<S.size();X++){
if(S.at(X)==A.at(X)){
AA++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define mp make_pair
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for(int ii = jj; ii < ll; ii += ss)
#define time cerr << '\n' << (double)clock()/CLOCKS_PER... | 1 | 85,736,220 |
#include<iostream>
using namespace std;
long long MOD=1000000007;
int main(){
long long N,M;
cin >> N >> M;
long long S[N+1], T[M+1];
long long i,j;
for(i=1; i<=N; i++){
cin >> S[i];
}
for(j=1; j<=M; j++){
cin >> T[j];
}
long long sum[N+1][M+1];
for(i=0; i<=N; i++... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | 1 | 53,369,287 |
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
typedef long long ll;
int main(){
string s, t;
cin >> s >> t;
int ans = 0;
for(int i = 0; i < s.length(); ++i){
if(s[i] == t[i]){
ans++;
}
}
cout << ans << "\n";
} | #include <iostream>
#include <string>
using namespace std;
int main (void){
int cnt = 0;
string s, t;
cin >> s >> t;
for(int i = 0; i < s.length(); i++){
if(s[i] == t[i]){
cnt++;
}else{
}
}
cout << cnt << endl;
return 0;
} | 1 | 75,706,558 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
string A, B, C;
cin >> A >> B >> C;
if (A[A.size() - 1] == B[0] && B[B.size() - 1] == C[0])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int main()
{
string a,b,c;
cin >> a >> b >> c;
if(a[a.size()-1] == b[0] && b[b.size()-1] == c[0]){
cout << "YES" << "\n";
}else{
cout << "NO"<< "\n";
}
} | 1 | 39,893,375 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
int sum = 0;
rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V.at(i);
int count = 0;
for (int j = 0; j < N; j++) {
for (int k = j + 1; k < N; k++)
count += V.at(j)*V.at(k);
}
cout << count << endl;
} | 1 | 97,664,086 |
#include <iostream>
using namespace std;
struct card{
char suit;
int value;
};
void selection(struct card a[], int n){
for (int i=0; i<n; i++){
int minj=i;
for (int j=i; j<n; j++){
if (a[j].value <a[minj].value){
minj=j;
}
}
swap(a[i],a... | #include <iostream>
#include <string>
#include <cmath>
#include<iomanip>
#include<algorithm>
#include<list>
using namespace std;
int main()
{
int n;
string a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
b[i] = a[i];
}
for (int i = 0; i < n; i++){
for (int j = n - 1; j > i; j--){
if (... | 1 | 38,388,996 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<limits.h>
using namespace std;
static const int n=1000;
static const int m=1000;
int lcs(string X,string Y){
int i,j,c[m+1][n+1];
int m=X.size();
int n=Y.size();
for (i=0;i<m+1;i++) c[i][0]=i;
for (j=0;j<n+1;j++) c[0][j]=j;
for (i=1... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <time.h>
using namespace std;
void solve(){
time_t start, end;
string A;
cin >> A;
string B;
cin >> B;
int n = A.size(), m = B.size();
vector<vector<int>> DP(n + 1, vector<int>(m + 1, 0));
start = clock();
f... | 1 | 87,489,219 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long int infLL = 9000000000000000000;
#define mem(a,b) memset(a, b, sizeof(a) )
#defin... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < (S.size() - 1)/2; i++) {
if (S.at(i) != S.at(S.size() - i - 1)) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < (S.size() - 1)/2; i++) {
if (S.at(i) != S.at((S.size()-1)/2 - i -... | 1 | 40,077,742 |
#include <iostream>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin>>n>>a>>b>>c>>x){
if(n==0) break;
int y[n];
for(int i=0;i<n;i++){
cin>>y[i];
}
int k=0;
for(int i=0;i<=10000;i++){
if(y[k]==x){
k++;
}
if(k==n){
cout<<i<<endl;
break;
}
x=(a*x+b)%c;
}
if(k<n){
... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include <functional>
using namespace std;
int INF = 10000000;
int main()
{
int n,a,b,c,x;
while(cin >> n >> a >> b >> c >> x && ( n || a || b || c || x))
{
int y[101];
for(int i = 0;i < n;i++)
{
cin >... | 1 | 5,338,411 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
int N;
cin >> N >> s;
int count = 1;
char now_s = s[0];
for(int i=1;i<N;i++){
if(s[i] != now_s){
now_s = s[i];
count++;
}
}
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | 1 | 95,859,106 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a;
cin >> a;
string big = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string sml = "abcdefghijklmnopqrstuvwxyz";
for(int i = 0; i < 26; i++){
if(big[i] == a){
cout << "A" << endl;
break;
}else if(sml[i] == a){
cout << "a" << endl;
... | #include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pii pair <int,int>
ll m=1000000007;
int main()
{
fast;
char x;cin>>x;
if(x-'a'>=0)
cout<<"a";
else
cout<<"A";
cout<<nl;
} | 1 | 25,027,148 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int k;
cin >> k;
vector<ll> a(k);
rep(i,k)cin >> a[i];
ll pre = a.bac... | #include<iostream>
using namespace std;
long long x=2,y=2;
int n,ans[100010];
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>ans[i];
}
for(int i=n; i>=1; i--)
{
x=((x-1)/ans[i]+1)*ans[i];
y=y/ans[i]*ans[i]+ans[i]-1;
}
if(x>y)
{
cout<<-1;
}
... | 1 | 4,353,047 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 18;
int sum[MAXN+1][1<<MAXN];
int boro[MAXN+1][1<<MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < (1<<n); i++) {
cin >> boro[0][i];
sum[0][i] = -1;
}
for (int p = 1; p <= n; p++) {
for (int msk = 0; msk < ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int n;
cin >> n;
int a[300000] {0};
for(int i = 0; i < (1 << n); i++) cin >> a[i];
int fir[300000];
int sec[300000];
bool looked[300000];
for(int i = 0; i < (1 << n); i++) fir[i] = i;
fill(sec... | 1 | 51,112,419 |
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main(void)
{
int i,is,ip;
string s,p,sp,ans="No";
cin >> s;
cin >> p;
ip = p.size();
is = s.size();
sp = s + s.substr(0,ip-1);
for(i = 0; i <= is-1; i++){
if(p == sp.substr(i,ip))
ans="Yes";
}
cout << ans << ... | #include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){ _;
string s,p;
cin>>s>>p;
stringstream ss;
ss<<s<<s;
if(strstr(ss.str().c_str(),p.c_str()))
cout<<"Yes"<<endl;
else
cout<<"No"<<e... | 1 | 24,199,557 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
string s, t;
cin >> N >> s >> t;
int ans = N * 2;
for( int i = 0; i < N; i++ ) {
string sub = s.substr( i, N - i );
if( sub == t.substr( 0, N - i ) ) {
ans = i + N;
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 1 | 85,082,030 |
#include<iostream>
using namespace std;
int main(){
int x;cin>>x;
if(x>=400&&x<=599)
cout<<8;
else if(x>=600&&x<=799)
cout<<7;
else if(x>=800&&x<=999)
cout<<6;
else if(x>=1000&&x<=1199)
cout<<5;
else if(x>=1200&&x<=1399)
cout<<4;
else if(x>=1400&&x<=1599)
cout<<3;
else if(x>=1600&&x<=1799)
cout<<2;
else if(x>=1800&&x<=... | #include<iostream>
using namespace std;
int main(){
int a;
cin >> a;
if(400<=a && a<=599){
cout << 8 << endl;
}else if(600<=a && a<=799){
cout << 7 << endl;
}else if(800<=a && a<=999){
cout << 6 << endl;
}else if(1000<=a && a<=1199){
cout << 5 << endl;
}else if(1200<=a && a<=1399){
cou... | 1 | 44,817,801 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <queue>
#include <stack>
#include <bitset>
#include <set>
#include <chrono>
#include <string>
#include <assert.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(0);
cin.tie... | #include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=1e5+10;
const int maxm=2e5+10;
struct node{int to,nxt;}e[maxm<<1];
int tot,p,c,d,flag,head[maxn],deg[maxn],vis[maxn],col[maxn];
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch==... | 1 | 39,878,215 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
using namespace std;
void printCoffo(double x1, double y1, double x5, double y5, int n){
if(n<=0){
return;
}
double x2,y2,x3,y3,x4,y4;
x2 = (2.0*x1+x5)/3.0;
y2... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iomanip>
typedef std::pair<double, double> point;
point hoge(point q2, point q4){
point q3;
point r = std::make_pair((q2.first + q4.first)/2, (q2.second + q4.second)/2);
point vec = std::make_pair(-(q4.second - q2.second), q4.fir... | 1 | 28,518,750 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int x,y,a,b,c;
int i,j,k;
scanf("%d %d %d %d %d",&x,&y,&a,&b,&c);
long long p[a],q[b],r[c],res[x+y+x+y];
for(i = 0;i < 2*x + 2*y ;i++)
res[i] = 0;
i = 0;
while(i < a)
scanf("%lld",&p[i++]);
sort(p,p+a);
j = a-1;
for(k = 0;k < x;k++)
... | 1 | 97,583,863 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int n, i, sum = 100000, count;
cin >> n;
for(i = 0;i < n;i++){
sum = sum * 1.05;
if(sum % 1000 != 0){
sum = sum / 1000;
sum = sum + 1;
sum = sum * 1000;
}
}
cout << sum << en... | #include<stdio.h>
int main(){
int i,n;
int sum = 100000;
scanf("%d", &n);
for(i=0;i<n;i++){
sum=sum*1.05;
if(sum%1000!=0)
{
sum=sum/1000;
sum=(sum+1)*1000;
}
}
printf("%d\n", sum);
return 0;
} | 1 | 14,817,403 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll s;
cin >> s;
int y2 = (s+1000000000-1)/1000000000;
int y1 = 1000000000*y2-s;
cout << "0 0 " << 1000000000 << " " << ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;
typedef pair <ll ,ll> pll;
typedef pair <int ,int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define print(a) {for (auto iiiiiiiiii : a) cout << iiiiiiiiii << ' '; cout << ... | 1 | 40,975,042 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
i... | #include <stdio.h>
int main(){
int N;
char S[N];
scanf("%d", &N);
scanf("%s", S);
int yes = 0, no = 0;
if(N % 2 == 0){
for(int i = 0; i < (N / 2); i++){
if(S[i] == S[i + (N / 2)]){
yes++;
}else{
no++;
}
}
if(yes == N / 2){
printf("Yes");
}else{
printf("No");
}
}else{
printf("No... | 1 | 84,634,296 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int main() {... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
int n;
while (cin >> n)... | 1 | 61,166,267 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | #include<bits/stdc++.h>
using namespace std;
#define NL '\n'
#define xx first
#define yy second
#define ll long long
#define mp make_pair
#define pb push_back
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)
#define asy... | 1 | 26,205,883 |
#include <iostream>
#define calc(x,y) (x*y)\
using namespace std;
int main(int argc, char **argv)
{
for(int i = 1; i <= 9; i++){
for(int j = 1; j <= 9; j++){
cout << i << "x" << j << "=" << calc(i,j) << endl;
}
}
return 0;
} | #include<stdio.h>
int main(){
int a,i,j;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){
printf("%dx%d=%d",i,j,i*j);
printf("\n");
}
return 0;
} | 1 | 40,467,648 |
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void wr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5+5;
int n, s[MAXN];
vector<int> g[MAXN];
int dfs(int v, int f = -1) {
for (int u : g[v])
if (u != f)
s[v] ^= (1 + dfs(u, v));
return s[v];
}
int main() {
cin >> n;
for (int i = 0; i < n-1; ++i) {
int a, b;
cin >> a >> b... | 1 | 22,974,599 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx=1e5+100;
const int INF=99999999;
const int MOD=1e9+7;
int main()
{
int n;
ll a,sum[maxx*2]={0};
cin>>n;
sum[0]=0;
for(int i=1; i<=n; i++){
cin>>a;
sum[i]=sum[i-1]+a;
}
ll minn=abs(sum[1]*2-sum[... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 200008
int n;
int a[N];
long long sum = 0;
void solve()
{
long long first = a[1];
long long minn = abs(sum-first-first);
for (int i = 2; i < n; i++)
{
first += (long long)a[i];
minn = mi... | 1 | 59,330,626 |
#include <iostream>
#include <algorithm>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int N, H;
cin >> N >> H;
int a[N], b[N];
rep(i, N)
cin >> a[i] >> b[i];
sort(b, b+N, greater<>() );
int a_max = 0;
rep(i, N)
if(a_max < a[i])
a_max = a[i];
int count = 0;
wh... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int n,h;
cin>>n>>h;
vector<int> a(n),b(n);
rep(i,n){
int A, B;
cin>>A>>B;
a[i]=A; b[i]=B;
}
sort(a.begin(),a.end(),greater<int>());
sort(... | 1 | 90,536,178 |
#include <iostream>
#include <vector>
using namespace std;
int ans = 0;
void selectionSort(vector<int>& vec)
{
for (int i = 0; i < vec.size() - 1; ++i)
{
int minj = i;
bool flag = false;
for (int j = i; j < vec.size(); ++j)
{
if (vec[j] < vec[minj])
{
minj = j;
flag = true;
}
}
if (flag)
... | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
void swap(int *,int *);
int main(){
int n,a[100],c=0,minj;
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj=j;
}
}
swap(&a[i],&a[minj]);
if(i!=minj)c... | 1 | 85,382,003 |
#include <atcoder/dsu>
#include "bits/stdc++.h"
using namespace std;
using namespace atcoder;
const int N=2e5+20;
int n,q,t,u,v,c;
int main()
{
scanf("%d%d",&n,&q);
auto dsa=dsu(n);
while(q--)
{
scanf("%d%d%d",&t,&u,&v);
if(t==0) dsa.merge(u,v);
else printf("%d\n",dsa.same(u,v));
}
} | #include <atcoder/all>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define LL long long
int main(){
int n,q;
cin>>n>>q;
auto uf = atcoder::dsu(n);
REP(i,q){
int m,u,v;
cin>>m>>u>>v;
if(m==0){... | 1 | 93,774,378 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9+7)
#define d(x) cerr<<... | #include <bits/stdc++.h>
using namespace std;
long long n, m, x[100004], y[100004];
const int mod = 1000000007;
long long mul(long long a, long long b){
long long ret = a * b;
return ret% mod;
}
long long sum(long long a, long long b){
return (a+b)%mod;
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NUL... | 1 | 84,851,007 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> n(3);
cin >> n[0] >> n[1] >> n[2];
sort(n.begin(), n.end());
int a;
a = n[0] + n[1] + n[2] * 10;
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b , c , d;
cin >> a >> b >> c;
d = max ( a, max ( b,c)) ;
cout << ( d==b ? a+10*b+c : d==a ?10*a + b + c : a+b+10*c ) <<endl;
} | 1 | 48,161,961 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 1 | 34,671,374 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
vector<ll> a, p;
ll dfs(ll n, ll x) {
if (n == 0)
return x <= 0 ? 0 : 1;
else if (x <= a[n - 1] + 1)
return dfs(n - 1, x - 1);
else
return p[n - 1] + 1 + dfs(n - 1, x - 2... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll W[55];
ll P[55];
ll patee(ll l, ll n){
ll whole = W[l];
ll pate = P[l];
if(l == 0){
return 1;
}
if(n == 1){
return 0;
}
if(n > 1 && n < (whole/2) + 1){
... | 1 | 35,041,167 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define FT() int t; scanf("%d",&t); while(t--)
#define pb push_back
#define nl printf("\n")
#define fi(i,start,end) for(int i=start; i < (int)end ; ++i)
#define ip(n) scanf("%d",&n)
#defi... | #include<iostream>
#include<queue>
#include<deque>
#include<vector>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<set>
#include<map>
#include<bitset>
#include<unordered_set>
#include<unordered_map>
#define pi 3.141592653
#define in freopen("entrada","r",stdin);
#de... | 1 | 57,666,776 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int... | 1 | 29,565,505 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
string a, b, c;
cin>>a>>b>>n>>m>>c;
if(a==c)
n--;
else if(b==c)
m--;
cout<<n<<" "<<m;
return 0;
} | #include <stdio.h>
#include <string.h>
int main()
{
char S[15], T[15], U[15];
int A, B;
scanf ("%s %s", S, T);
scanf ("%d %d", &A, &B);
scanf ("%s", U);
(strcmp (S,U) == 0) ? A-- : B--;
printf ("%d %d", A, B);
return 0;
} | 1 | 51,111,264 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
set<int> st;
int temp;
for(int i=1;i<=n;i++){
cin>>temp;
if(st.find(temp)!=st.end()){
cout<<"NO\n";
return 0;
}
st.insert(temp);
}
cout<<"YES\n";
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
void solve() {
int n;
cin >> n;
map<int, int> m;
bool flag = true;
for(int i = 0; i < n; ++i) {
int x;
cin >> x;
m[x]++;
if(m[x] > 1) ... | 1 | 63,650,409 |
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int ans = 0, a = 0, b = 0, c... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 1 | 28,336,937 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define deb... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 25,932,855 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
int n,j,sum,max1;
while(cin>>n,n){
vector<int> v;
for(int i=0;i<n;i++){
cin>>j;
v.push_back(j);
}
max1=v[0];
for(int i=0;i<n;i++){
sum=0;
for(int j=i;j<n;j++){
sum=sum+v[j];
max1=max(max1,sum);
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin >> n, n != 0){
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int minimum = 0;
int x = 0;
int maximum = -9999999;
for(int i=0... | 1 | 89,379,706 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int>DP(200000,int(1e9+7));
DP[0]=0;
vector<int>A{1,6,36,216,1296,7776,46656,9,81,729,6561,59049};
for(int i=0;i<N;i++)
for(int j=0;j<12;j++)
DP[i+A[j]]=min(DP[i+A[j]],DP[i]+1);
cout<<DP[N]<<endl;
} | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15... | 1 | 83,101,283 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
cout << min(A,B) + min(C,D) << endl;
} | #include<bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
... | 1 | 33,916,588 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp12 make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define FORN(i, x, y) for (int i = x; i <= y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define scan1(X) scanf("%d", &X)
#define scan2(X, Y) scanf("%d%d", &X, &Y)
#define scan3(X, Y, Z) scanf("%d%d%d", &X, &Y, &Z... | 1 | 58,522,643 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | #include <iostream>
using namespace std;
#define AMAX 17
int a,b,n;
int r[AMAX][AMAX];
void solve(){
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
if(r[i][j]==-1)continue;
if(r[i-1][j]!=-1)r[i][j]+=r[i-1][j];
if(r[i][j-1]!=-1)r[i][j]+=r[i][j-1];
}
}
cout<<r[b][a]<<endl;
}
int main(){
while(cin>>a>>b,a|... | 1 | 88,252,273 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
using namespace std;
int main() {
int H, W, i, j;
string str[26][26];
string s = "snuke";
char w;
cin >> H >> W;
for (i = 0; i < H; i+... | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | 1 | 56,731,143 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, j = 0;;
cin >> n;
for(int i = 1; i <= n; i++){
j+=i;
}
cout << j << endl;
} | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | 1 | 50,477,499 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | 1 | 2,900,322 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<set<int>> a(n);
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
a[b - 1].insert(c - 1);
a[c - 1].insert(b - 1);
}
deque<int> d;
vector<bool> seen;
int summ=0;
seen.assign(n, false);
int v... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | 1 | 67,711,429 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
map<ll,ll> mp;
ll n;
cin>>n;
for(int i=2;(long long)i*i<=... | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | 1 | 42,006,843 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 1 | 47,105,024 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
#define INF 100000000
int main()
{
int N;
cin >> N;
vi seq(N);
for (int n = 0; n < N; n++)
{
cin >> seq[n];
seq[n] -= (n+1);
}
sort(seq.begin(... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define sep cout<<"\n";
#define Yes cout<<"Yes\n";
#define No cout<<"No\n";
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
int main(){
long N,s =0;
cin>>N;
long A[N];
for(int i=0;i<N;i++){
cin>>A[i];
A[i] = A[i]-(i+1);
}
sort(A,A+N);
lo... | 1 | 83,762,352 |
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | 1 | 23,832,327 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 11,753,472 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_map>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>
#include<iomanip>
#include<bitset>
using namespace std;
#define ll long long int
ll const ... | #include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,h[110];
int main(){
read(n);
int mx=0;
for(int i=1;... | 1 | 74,536,291 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 ... | #include<iostream>
#include<cmath>
int main(){
int a,b,c,d;
std::cin >> a >> b >> c >> d;
if(std::abs(a - b) <= d && std::abs(b - c) <= d || std::abs(a-c) <= d) std::cout<<"Yes";
else std::cout<<"No";
} | 1 | 11,446,904 |
#include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 36,242 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,a,b;
scanf("%d%d%d",&x,&a,&b);
if((b-a)<=x)
{
if((b-a)<=0)
printf("delicious");
else
printf("safe");
}
else
printf("dangerous");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
long long Comb(int n, int i){long long ans = 1; if(i == 0 || i... | 1 | 21,349,122 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Sieve {
vector<int> f, primes;
Sieve(int N):f(N+1,0) {
f[0] = f[1] = -1;
for (int i = 2; i <= N; ++i) {
if (!f[i]==0){
continue;
}
primes.push_back(i);
f[i] = i;
if(i>sqrt(N)){
continue;... | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | 1 | 52,255,716 |
#include<stdio.h>
#include<ctype.h>
#include<string.h>
int main(){
int i,k,t,end=0,slen,plen,correct=0;
char static s[500];
char static p[500];
char static c[500];
scanf("%s",s);
scanf("%s",p);
slen=strlen(s);
plen=strlen(p);
for(i=0;i<slen;i++){
for(k=0;k<plen;k++){
if(k==0)t=i+k;
c[k... | #include<stdio.h>
#include<string.h>
int main(void)
{
char s[100],sc[100],p[100];
int sl,pl,f=0;
scanf("%s",s);
scanf("%s",p);
strcpy(sc,s);
sl=strlen(s);
pl=strlen(p);
for(int j=0;j<sl;j++){
sc[0]=s[sl-1];
for(int i=0;i<(sl-1);i++){
sc[i+1]=s[i];
}
if(strncmp(sc,p,pl)==0){
f=1;
break;
}
st... | 1 | 62,593,903 |
#include <iostream>
int main(int argc, char const *argv[])
{
int num1, num2;
while (1) {
std::cin >> num1 >> num2;
if (num1 == 0 && num2 ==0) {
break;
}
if (num1 < num2) {
std::cout << num1 << " " << num2 << std::endl;
}
else {
std::cout << num2 << " " << num1 << std::endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
while (true) {
int a,b;
cin >> a >> b;
if (a == 0 && b == 0) {
break;
}else{
if (a > b) {
cout << b << " " << a << endl;
}else{
cout << a << " " << b << endl;
... | 1 | 73,284,871 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main(void) {
int n = 0;
while (cin >> n) {
if (n == 0) {
break;
}
int A[1000];
for (int i = 0; i < 1000; i++) {
A[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n... | #include <iostream>
#include <cstdlib>
using namespace std;
int main(void){
int n,i,j,a[1000],s=0,min,l,c,d;
while(1){
min = 1000000;
cin >> n;
if (n == 0)
break;
for (i=0;i<n;i++){
cin >> l;
a[i] = l;
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
s = abs(a[i]... | 1 | 33,447,113 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N;
cin >> N;
map<int,int> mp;
rep(i, N) {
int a;
cin >> a;
+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
cons... | 1 | 3,409,349 |
#include <iostream>
int main() {
int a,b,c,res;
std::cin >> a >> b >> c;
if (a == b && b == c) {
res = 1;
} else if ( a == b || b == c || c == a) {
res = 2;
} else {
res = 3;
}
std::cout << res << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, ans;
ans = 1;
cin >> a >> b >> c;
if (a != b)
{
ans++;
}
if (a != c && b != c)
{
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 100,838,481 |
#include <bits/stdc++.h>
using namespace std;;
int main(){
string n;
cin >> n;
int ans = 0;
for (long long i = 0; i < n.size(); i++){
ans += n[i] - '0';
ans %= 9;
}
if (ans == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
#define int long long int
#define mod 998244353
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w", stdout);
#endif
string s;
cin>>s;
int n... | 1 | 1,907,838 |
#include<iostream>
using namespace std;
int N_MAX=200000;
typedef long long ll;
int main()
{
int n,i,j,x=0,s=0;
int a[N_MAX];
ll res=0;
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
for(i=0,j=0;i<n;i++){
for(;j<n;j++){
if(x!=s)
break;
x^=a[j];
s+=a[j];
}
if(x==s)
j=... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n); for (auto &&i : a) cin >> i;
int right = 1;
long long ans = 0;
long long sum = 0;
sum += a.at(0);
for (int left = 0; left < n; left++)
{
while (right < n && sum + a.at(right) == (sum ^ a.a... | 1 | 19,066,535 |
#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 10000000000;
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
#define dump(x) cout << #x << " = " << (x) << endl;
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<int,i... | 1 | 44,871,162 |
#include<bits/stdc++.h>
#define see(x) (cerr<<(#x)<<'='<<(x)<<endl)
using namespace std;
typedef long long ll;
typedef pair<int,int> pr;
const int maxn = 3e5+20;
const int inf = 0x3f3f3f3f;
const int modd = 1e9+7;
inline int read() {int x=0,f=1;char c=getchar();while(c!='-'&&(c<'0'||c>'9'))c=getchar();if(c=='-')f=-1,c=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | 1 | 62,480,152 |
#include<stdio.h>
#include<vector>
using namespace std;
const int V_MAX = 10000;
int main() {
int v, e;
int table[V_MAX] = { 0 };
vector<int> edge[V_MAX];
vector<int> ans;
scanf("%d %d", &v, &e);
for (int i = 0; i < e; i++) {
int s, t;
scanf("%d %d", &s, &t);
edge[s].push_back(t);
table[t]++;
}
for (int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a)... | 1 | 66,932,500 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
cin >> N;
int counter = 0;
for (int i = 1; i <= N; i++)
{
if (i < 10)
{
counter++;
}
else if (i >= 100 && i <= 999)
{
counter++;
}
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | 1 | 44,316,849 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int x, a;
cin >> x >> a;
if (x < a)
cout << "0\n";
else
cout << "10\n";
return 0;
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int X, A; cin >> X >> A;
if(X<A) cout << "0" << endl;
else cout << "10" << endl;
} | 1 | 56,835,591 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
cin>>n>>l;
string s[n];
for(int i=0;i<n;i++) {
cin>>s[i];
}
sort(s,s+n);
for(int i=0;i<n;i++) {
cout<<s[i];
}
return 0;
} | #include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define quit return 0
using namespace std;
void showmyDS(set<int> ds)
{
set<int... | 1 | 79,975,097 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
string b;
int cnt = 0;
cin >> s;
cin >> b;
rep(i, s.size()) {
if(s[i] != b[i]) {
cnt++;
}
... | #include <iostream>
using namespace std;
int main(){
string s;
string v;
int count = 0;
cin >> s >> v;
for(int i = 0; i < s.length(); i++){
if (s[i] != v[i]){
count++;
}
}
cout << count << endl;
return 0;
} | 1 | 3,267,379 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
for (int i = 0; i... | 1 | 59,482,609 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 2006
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout<<(a)<<endl
#define VECIN(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define MOD 1000000007
ll dp[N][N]... | 1 | 97,455,920 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int f(int i)
{
if (i % 2 == 0)
return i / 2;
else
return 3 * i + 1;
}
int main()
{
int s;
cin >> s;
vector<int> a;
for (int i = 1; i <= 10... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int hoge(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main() {
int s;
cin >> s;
set<int> cont;
cont.insert(s);
int last = s;
for (int i = 2;; ++i) {
last = hoge(last);
if (cont.find(last) == ... | 1 | 68,354,357 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define EPS (1e-9)
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N,K; cin >> N >> K;
vector<p... | 1 | 23,958,007 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int r;
cin >> r;
cout << pow(r,2);
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | 1 | 29,470,402 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+2;
map<int,int> idx;
vector<pair<int,int> > ans;
int n,ar[N],sz[N],sz1[N],ar1[N];
vector<int> adj[N];
void dfs(int x,int p){
sz[x]=1;
for(int i:adj[x]){
if(i!=p){
dfs(i,x);
sz[x]+=sz[i];
sz1[x]+=sz1[i]+sz[i];
}
}
}
void d... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 | 45,271,690 |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int W, H;
string s[30];
using P = pair<int, int>;
void solve() {
P init;
rep(i, H) rep(j, W) if (s[i][j] == '@') init = P... | #include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
#include <map>
#include <stack>
using namespace std;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int main() {
int yoko,tate,px,py;
while(cin>>yoko>>tate &&yoko){
int m[25][25];
string st;
for(int i=1;i<tate+1;i++){
cin>>st;... | 1 | 82,952,587 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
#include <vector>
#include <map>
int main(){
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i=0; i<N; i++){
std::cin >> A.at(i);
}
std::map<int, long long int> mp;
for (int i=0; i<N; i++){
mp[A.at(i)]++;
}
long long int sum = 0;
for (auto x : mp){
... | 1 | 2,123,852 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> Lucas(N + 1);
Lucas.at(0) = 2;
Lucas.at(1) = 1;
if ( N > 1 ) {
for ( int i = 2; i < N + 1; i++ ) {
Lucas.at(i) = Lucas.at(i-1) + Lucas.at(i-2);
}
}
cout << Lucas.at(N);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
if (N == 0) {
cout << 2 << endl;
return 0;
} else if (N == 1) {
cout << 1 << endl;
return 0;
}
vector<int64_t> lucas(N+1);
lucas.at(0) = 2;
lucas.at(1) = 1;
for (int64_t i = 2; i < N+1; i++) {
lucas.at(... | 1 | 65,988,408 |
#include <bits/stdc++.h>
using namespace std;
queue<pair<int,int> > qu;
vector<int> v[111];
int root;
int b;
int d[111];
pair<int, int> pa;
int g;
void wide(int num){
memset(d,-1,sizeof(d));
d[num] = 0;
qu.push(make_pair(num,d[1]));
while(!qu.empty()){
pa = qu.front();
qu.pop();
int id = pa.first;
... | #include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(auto i=0;i<n;i++)
#define s(c) static_cast<int>((c).size())
int main(){
int n;
cin >> n;
set<int> A[n+1];
int v1, v2, deg;
r(i, n){
cin >> v1 >> deg;
r(j, deg){
cin >> v2;
A[v1].insert(v2);
}
}
queue<int> s;
s.push(1);
int dist[n+1]{0... | 1 | 87,085,218 |
# include <iostream>
# include <cstring>
using namespace std;
const int mod = 1e9 + 7;
# define ll long long
ll mul(ll a, ll b){
return ((a%mod) * (b%mod)) % mod;
}
int main(){
int n;
cin >> n;
string s;
cin >> s;
int occ[26];
memset(occ, 0, sizeof(occ));
for(char c : s) occ[c-'a']++;
ll ans = 1;
fo... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 27,728,282 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include <iomanip>
using namespace std;
struct Point
{
double x;
double y;
};
struct Edge{
Point start;
Point end;
void make(Point start,Point end)
{
this->start=start;
this->end=end;
}
};
Point rot60(Point a,Point b)
{
Poi... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#define N 8
using namespace std;
struct point{
double x,y;
};
void koch(int d, point p1, point p2){
point s,u,t;
if (d==0) return;
s.x=(2.0*p1.x+p2.x)/3;
s.y=(2.0*p1.y+p2.y)/3;
t.x=(p1.x+2.0*p2.x)/3;
t.y=(p1.y+2... | 1 | 12,823,405 |
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#include <climits>
#include <bitset>
#include <cmath>
#include <map>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
string s,t;
cin >> s;
string ans;
reverse(s.begin(),s.end());
ll i=0;
while(1){
string u;
bool is=false;
if(i>=s.size()){
break;
}
u=s.substr(i,5);
... | 1 | 94,258,245 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long a;
cin >> a;
long long b;
cin >> b;
if(a>b) {
cout << "safe" << '\n';
} else {
cout << "unsafe" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
int S, W;
cin >> S >> W;
cout << ((W >= S)? "unsafe" : "safe") << '\n';
return 0;
} | 1 | 57,392,892 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#inc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
vector<int> B(N - 1);
for(int i = 0; i < N - 1; i++) {
cin >> B[i];
}
vector<int> A(N, 1000000);
for(int i = N - 2; i >= 0; i--) {
A[i + 1] = min(A[i + 1], B[i]);
A[i] = min(A... | 1 | 13,145,250 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
vector<int> array(n);
for (int i = 0; i < n; i++) {
cin >> array.at(i);
}
long max = array.at(0);
for (int j = 0; j < n; j++) {
long total = 0;
for (int k = 0; k < n - j; k++) {
... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fst first
#define snd se... | 1 | 27,873,033 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
rep(i, n-1) {
ans *= (k-1);
}
cout << ans << endl;
} | #include<iostream>
#include<cmath>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
cout << (int)round(K * pow(K-1,N-1)) << '\n';
} | 1 | 4,054,050 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
char c;
cin>>c;
if(c=='a' || c=='i' || c=='u' || c=='e' || c=='o'){
cout<<"vowel"<<endl;
}
else{
cout<<"consonant"<<endl;
}
} | 1 | 43,496,172 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
cons... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string a, b, S;
cin >> a >> b;
for (int i = 0; i < N; i++) {
char c_a = a.at(i);
char c_b = b.at(i);
S = S + c_a + c_b;
}
cout << S << endl;
} | 1 | 36,095,702 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
enum Loc{
Left,... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long doubl... | 1 | 93,249,017 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n)cin >> a[i];
vector<pair<int,int>>dataa(110000);
vector<pair<int,int>>datab(110000);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
#define ng 100010
typedef pair<ll,ll> pair;
int main(){
ll n;
cin >> n;
ll m = n / 2;
ll even[ng];
ll odd[ng];
ll max1,max2;
max1 = 0;max2 = 0;
ll maxeven,maxodd;
for(ll i = 0; i < ng; i++){
... | 1 | 99,018,109 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go(){
string s;cin>>s;
set<char> cnt;
for(char ch : s) cnt.insert(ch... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
string S;
cin >> S;
vector<int> vec(26, 0);... | 1 | 60,074,140 |
#include<bits/stdc++.h>
using namespace std;
int depth, s, n;
void solve(int d, int x, int sum){
if(d==0 && sum==s){n++; return;}
for(int i=x+1; i<10; i++){
solve(d-1, i, sum+i);
}
}
int main(){
while(cin>>depth>>s){
if(depth==0 && s==0)break;
n=0;
solve(depth, -1, 0);
cout<<n<<endl;
}
r... | #include <iostream>
using namespace std;
int n,k,count;
void dfs(int i,int sum,int num)
{
if(num == n)
{
if(sum == k)
{
count++;
}
return;
}
if(i == 10)
{
return;
}
dfs(i+1,sum,num);
dfs(i+1,sum+i,num+1);
}
int main()
{
while(cin >> n >> k)
{
if(n == 0 && k == 0) break;
count = 0;
dfs(0,0,0... | 1 | 28,890,760 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n)cin >> s.at(i);
map<char ,int > alph;
for(int i='... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 1 | 9,002,323 |
#include<iostream>
using namespace std;
int main(){
int a, b, c;
int A[10000] = { 0 };
int M;
int N = 0;
cin >> a >> b >> c;
for (int i = 0; i <= b - a; i++){
A[i] = a + i;
M = c%A[i];
if (M == 0){
N = N + 1;
}
}
cout << N << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a,b,c,d,i;
i=0;
cin >> a >> b >> c;
while(a<=b){
d=c%a;
if(d!=0){
}
else{
i++;
}
a++;
}
cout << i << endl;
} | 1 | 66,924,338 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.