code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rev2(i, s, n) for (int i = (int)(n) - 1; i >= (int)(s); i... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long do... | 1 | 3,758,130 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const int inf = 1e9+7;
const int mod = 1e9+7;
int main(){
int x;
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int x;
cin>>x;
int i=1;
while(true){
if(360*i%x==0){
break;
}
i++;
}
cout<<360*i/x;
} | 1 | 85,412,505 |
#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility>
#define rt "\n"
#define rep(i,n) for(int i... | 1 | 45,111,996 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
long long s,c,ans=0;
scanf("%lld%lld",&s,&c);
ans=min(s,c/2);
c-=(ans*2);
s-=ans;
ans+=c/4;
long l... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, M;
cin >> N >> M;
if (N >= M / 2) {
cout << (M / 2) << endl;
return;
}
long long ans = N;
M -= 2 * N;
ans += M / 4;
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecisio... | 1 | 40,225,309 |
#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,... | #include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
a=a+b;
c=c+d;
if(a>c)
{
cout<<"Left";
}
else if(a==c)
cout<<"Balanced";
else
cout<<"Right";
return 0;
} | 1 | 32,621,251 |
#include <iostream>
using namespace std;
int main(){
int in;
int num = 1;
while(1){
cin >> in;
if(in == 0){
break;
}
cout << "Case " << num << ": " << in << endl;
num++;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int x,i=1;
while(1){
cin>>x;
if(x==0){
break;
}
else{
cout<<"Case"<<" "<<i<<":"<<" "<<x<<endl;
i++;
}
}
return 0;
} | 1 | 62,720,564 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ty... | 1 | 53,690,482 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
vector<vector<int>> A(3, vector<int>(3));
rep(i, 3) {
rep(j, 3) {
cin >> A.at(i).at(j);
}
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int matrix[3][3];
map<int,pair<int,int>>map;
for(int i = 0;i < 3;i++){
for(int j = 0;j < 3;j++){
cin >> matrix[i][j];
map[matrix[i][j]] = pair<int,int>(i,j);
}
}
int t;
cin >> t;
while (t--){
... | 1 | 4,877,194 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
using vs=vector<string>;
int main() {
int N,A,B; cin >>N >>A >>B;
cout <<((B-A)%2=... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int inf =1000000000;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c = b - a;
if(c%2==0) cout << "Alice" << endl;
else cout << "Borys" << endl;
} | 1 | 68,569,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int a, b, c, d; cin >> a >> b >> c >> d;
if(a+b == c+d)cout << "Balanced" << endl;
else i... | 1 | 16,928,317 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
while (cin>>n) {
if (n==0) {
break;
} else {
std::deque<int> deq;
for (int i=0;i<n;i++) {
cin>>a;
deq.emplace_back(a);
}
int min=1000... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | 1 | 98,171,356 |
#include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll A, B;
cin >> A >> B;
vector<vector<char>> ans(100, vector<char>(100));
for (ll i = 0; i < 100; i++) {
for (ll j = 0; j < 100; j++) {
ans[i][j] = (i < 50 ? '#' : '.');
}
}
A--; B--;
fo... | #include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define BUF 50
using namespace std;
ll MOD = 1e9 + 7;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S;
ll ans = 0;
int main() {
cin >> A >> B;
A--; B--;
cout << 100 << " " << 100 << endl;
ll fr = A / 50;
for (int i = 0; i ... | 1 | 93,680,080 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;cin>>X>>Y;
char ans='x';
if(X+Y==15)ans='+';
else if(X*Y==15)ans='*';
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a+b==15){puts("+");return 0;}
if(a*b==15){puts("*");return 0;}
puts("x");
return 0;
} | 1 | 1,650,169 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin>>n;
vector<string> s(n);
rep(i,n){
cin>>s[i];
}
int m;
cin>>m;
vector<string> t(m);
rep(i,m){
cin>>t[i];
}
int max_ans=0;
for(auto x : s){
... | 1 | 94,209,397 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define in insert
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#de... | #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 | 93,206,577 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e18;
int main(){
ll N;
cin >> N;
ll ... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) a[i] = (n+1)*(i+1);
for(int i = 0; i < n; i++) b[i] = (n+1)*(n-i);
vector<int> r(n);
for(int i = 0; i < n; i++){
int x; cin >> x;
r[x-1]... | 1 | 46,158,559 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
typedef long long ll;
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int a=0,b=0,c=0;
rep(i,0,2){... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | 1 | 71,105,661 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int i=m;i<n;i++)
int main(){
long n,k;
cin >> n >> k;
vector<long> s(n+1,0),t(n+1,0);
rep(i,0,n) {
long a;
cin >> a;
s[i+1]=s[i]+a;
t[i+1]=t[i]+max(long(0),a);
}
long res=0;
rep(i,0,n-k+1){
res=max(res,t[i]+max(s[i+k]-s[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reps(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reps(i,0,n)
#define all(x) (x).begin(),(x).end()
#define INF (1000000001)
#define MOD (1000000007)
#define PI (acos(-1))
int main(){
int N,K;
cin >> N >> K;
int a[100010];
rep(i,N)... | 1 | 97,482,976 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pil = pair<pii,int>;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
int s,t;
s = max(a,c);
t = min(b,d);
if(t-s < 0)cout << 0 << endl;
else cout... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | 1 | 45,901,974 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a(n);
for (int i = ... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<int(n);i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using Pint = pair<int,int>;
const ll mod = 1e9+7;
int main(){
int n;
cin>>n;
v... | 1 | 37,973,753 |
#include <bits/stdc++.h>
using namespace std;
const long long md=1e9+7;
long long a[505][505],n,h,w;
void show(){
for(int i=0;i<h;++i,cout<<'\n')
for(int j=0;j<w;++j)
if(a[i][j]==1) cout<<'R';
else if(a[i][j]==2) cout<<'Y';
else if(a[i][j]==3) cout<<'G';
else if(a[i][j]==0) cout<<'B';
}
int main(){
long... | #include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
const char COLOR[4] = { 'R', 'G', 'B', 'Y' };
ll H, W, D;
char ans[500][500];
int main(void) {
cin >> H >> W >> D;
REP(i, 0, H) REP(j, 0, W) {
ll y = i + j + H, x = i - j + W;
ans... | 1 | 43,016,331 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
string act;
int status[2];
int pos=0;
int count=0;
status[0] =0;
status[1] =0;
cin >> n;
while(n)
{
pos = 0;
count =0;
status[0] = 0;
status[1] = 0;
for(int i=0;i<n;++i)
{
cin >> act;
if(act=="lu") status[0]=1;
else if(ac... | #include <stdio.h>
int main(){
int stay,i,a,cou;
char m1[3],m2[3];
while(1){
scanf("%d",&a);
if(a==0)break;
stay=0;
cou=0;
for(i=0;i<a/2;i++){
scanf("%s %s",m1,m2);
if(stay==0&&m1[1]=='u'&&m2[1]=='u'){
cou++;
stay=1;
}else if(stay==1&&m1[1]=='d'&&m2[1]=='d'){
cou++;
stay=... | 1 | 7,416,482 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N, K;
cin >> N;
vector<ll> P(N);
for (int i = 0; i < N; i++)
{
cin >> P[i];
}
ll res = 1;
ll mi=P[0];
for (int i = 1; i < N; i++)
{
mi = min(mi, P[i]);
if(P[i] == mi)res++;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using p = pair<int,int>;
static const long long INF = 1000000007;
int main(){
long long min = INF;
int ans = 0;
int n;
cin >> n;
vector<int> vec(n);
rep(i,n) cin >> vec[i];
rep(... | 1 | 20,627,364 |
#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;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) cin >> H.at(i);
int count = 0;
int countmax = 0;
for (int i = 0; i < N-1; i++) {
if (H.at(i) >= H.at(i+1)) {
count++;
if (countmax < count) countmax = count;
} ... | 1 | 58,440,263 |
#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define ... | 1 | 70,376,471 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
double a, b, c, d;
while(cin >> a >> b >> c >> d){
double ans = sqrt( (c-a) * (c-a) + (d-b) * (d-b));
printf("... | #include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
double Length(double x1, double y1, double x2, double y2) {
double X;
X = sqrt(pow((x2-x1), 2) + pow((y2-y1), 2));
return X;
}
int main () {
double x1, y1;
double x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double answer = Le... | 1 | 10,693,609 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int d1 = x2 - x1;
int d2 = y2 - y1;
cout << x2 - d2 << " " << y2 + d1 << " " << x1 -d2 << " " << y1 + d1 << endl;
} | 1 | 82,919,034 |
#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(){
ll a,b;
cin >> a >>b ;
cout << lcm(a,b) << endl;
} | #include<bits/stdc++.h>
#include<numeric>
#include <boost/math/common_factor.hpp>
#define int long long
using namespace std;
int32_t main()
{
int a,b;
cin>>a>>b;
cout<<boost::math::lcm(a,b);
} | 1 | 23,677,745 |
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, K;
cin >> N >> K;
unsigned long mx{0}, g{0};
for(unsigned long i{0}, A; i < N; ++i){
cin >> A;
mx = max(mx, A);
g = __gcd(g, A);
if(mx >= K && K % g == 0)return 0 & puts("POSSIBLE");
}
p... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int GCD(int x, int y) {if (x % y == 0) return y; return GCD(y, x % y);}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(... | 1 | 82,718,978 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(string s1 , string s2)
{
string temp1 = s1 + s2;
string temp2 = s2 + s1;
return temp1 < temp2;
}
int main()
{
int n , l;
cin>>n>>l;
std::vector<string> v;
for(int i = 0;i<n;i++)
{
string s;
cin>>s;
v.push_back(s);
... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 | 60,080,052 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(NULL);
#define fi first
#define se second
#define mp make_pair
#define pi 3.14159265359
#define MOD 1000000007
typedef long long ll;
#define mp make_pair
#define ALL(v) v.begin(), v.end()
#define F(i,s,n) for(i=s;i<n;++i)
#defi... | #include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G][3];
long long dp[G][3];
int maxx(int x, int y, int z) {
int max = x;
if (y > max) max = y;
if (z > max) max = z;
return max;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++){
for (int j = 0; j < 3; j++){
cin >> a[i]... | 1 | 14,490,301 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
vector<int> a(9);
rep(i,9) {
cin >> a[i];
}
int n;
cin >> n;
vector<int> b(n);
rep(i,n) {
cin >> b[i];
}
rep(i,9) {
rep(j,n) {
if(a[i] == b[j]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> v1;
typedef vector<v1> v2;
typedef vector<v2> v3;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
const ll INF = 1ll << 50;
const ll mod = 1000000007;
v2 a(3, v1(3, 0));
v2 c(3, v1(3, 0));
ll n;
ll b;
... | 1 | 44,807,804 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 100100;
ll w[MN];
int main() {
ios::sync_with_stdio(0);cin.tie(0);
ll n,m,v,p;
cin >> n >> m >> v >> p;
for(int i=0;i<n;i++) {
cin >> w[i];
}
sort(w,w+n);
ll st = 0,ed = n-1;
ll ls = n-1;
while(st <= ed) {
ll md = (st+ed)/2;... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 1 | 42,556,007 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int min = a[0], max = a[0];
for(int i = 0; i < n; i++){
if(min > a[i]){
min = a[i];
}
if(max < a[i]){
max = a[i];
}
}
cout << max - min << endl;... | 1 | 47,756,294 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
#include<bitset>
#include<queue>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
string S;
cin >> S;
int cnt=0;
for (int i=0; i<(int)S.size()-1; i++){
if (S.at(i)!=S.at(i+1... | #include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
string s;
cin >> s;
int n = s.size();
char now = s[0];
int ans = 0;
repi(i,n,1){
... | 1 | 35,596,165 |
#include <cstdio>
#include <vector>
using namespace std;
using Graph = vector< vector<int> >;
int dfs(Graph &G, int cur, int par=-1) {
int grundy = 0;
for(auto to : G[cur]) {
if(to == par) continue;
grundy ^= dfs(G, to, cur) + 1;
}
return grundy;
}
int main() {
int N; scanf("%d", &N)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | 1 | 81,004,984 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a==b&&b==c){cout<<1<<endl;}
else if(a!=b&&b!=c&&c!=a){cout<<3<<endl;}
else {cout<<2<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 1 | 17,787,591 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(0,min(b,d)-max(a,c))<<endl;
} | #include<iostream>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(a < c)
a = c;
if(b > d)
b = d;
if(b - a > 0)
cout << b - a;
else
cout << 0;
return 0;
} | 1 | 67,539,778 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
map<int, int> dict;
for (size_t i = 0; i < n; ++i) {
int a;
cin >> a;
if (dict.count(a)) {
++dict[a];
}
else {
... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 1 | 19,998,872 |
#include <iostream>
#include <string>
using namespace std;
int H, W;
string a[301][301];
int main() {
while(1){
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0; i < H*W; i++){
int x = i%W;
int y = i/W;
a[y][x] = "#";
cout << a[y][x];
if(x == W-1) cout << endl;
}
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H, W;
while (true) {
cin >> H >> W;
if (H == 0 && W == 0) return 0;
for (int h = H; h > 0; h--) {
for (int w = W; w > 0; w--) {
cout << '#';
}
cout << endl;
}
cout << endl;
}
} | 1 | 88,357,926 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)a[i]+=a[i-1];
vector<int> v;
for(int i=0;i<=n;i++){
for(i... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 1 | 70,226,823 |
#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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 1 | 40,681,583 |
#include <iostream>
#include <string>
using namespace std;
const int MAX_S = 8001;
bool dp_x[2][2*MAX_S];
bool dp_y[2][2*MAX_S];
int dx[MAX_S];
int dy[MAX_S];
int main() {
string s;
cin >> s;
s.append(1, 'T');
int x, y;
cin >> x >> y;
bool axis_change_flag = true;
int lx = 0, ly = 0;
for (unsigned long ... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
const int w=8000;
int n,x,y;bool f[2][2][20000];
char s[8010];
int main()
{
scanf("%s %d %d",s+1,&x,&y);x+=w;y+=w;
n=strlen(s+1);int t=0,i=1;
while(i<=n&&s[i]=='F') t++,i++;
int p=0,q=0;f[0][0][w+t]=true;f[1][0][w]=true;
w... | 1 | 13,840,871 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int now = 1;
for (int i = 0; i < n; i++) {
if (now < k) {
now = now * 2;
} else {
now += k;
}
}
cout << now << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int board = 1;
int N, K;
cin >> N >> K;
int i;
for(i = 0; i < N; i++){
if(board > K)
break;
board *= 2;
}
for(;i < N; i++)
board += K;
cout << board << endl;
} | 1 | 17,228,846 |
#include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x2-x1, y = y2-y1;
cout << x2-y << " " << y2+x << " " << x1-y << " " << y1+x <<... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
int p = c - a, q = d - b;
cout << c - q << " " << d + p << " " << a - q << " " << b + p << endl;
} | 1 | 100,178,939 |
#include<iostream>
using namespace std;
const int MOD=1000000007;
long long Sum(int N, int k){
return k*(N-k+1)+1;
}
int main(void){
long long N,K;
cin >> N >> K;
long long ans=0;
for (long long i=K; i<=N+1; i++){
ans += i*(N-i+1)+1;
}
cout << ans % MOD << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << f... | 1 | 1,749,650 |
#include <iostream>
#include <string>
using namespace std;
string t = "yuiophjklnm";
int main()
{
while(true){
string s;
cin >> s;
if(s == "#") break;
int n = s.size();
int ans = 0;
int lr = -1;
for(int i = 0; i < n; i++){
bool r = false;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include ... | 1 | 86,622,979 |
#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 n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int ans;
if ((n-1) % (k-1) == 0) ans = (n-1) / (k-1);
else ans = (n-1) / (k-1) +... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main()
{
ll N, K;
cin... | 1 | 73,694,831 |
#include<stdio.h>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int main() {
int n, i, j, h = 0, cnt = 0, m, p, k = 3, l[10], S, L, s[10], a[10];
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
int seki = i*j;
printf("%dx%d=%d\n", i, j,... | #include <iostream>
using namespace std;
int main() {
for (int l = 1; l < 10; l++) {
for (int r = 1; r < 10; r++) {
cout << l << 'x' << r << '=' << l * r << endl;
}
}
return 0;
} | 1 | 56,092,280 |
#include <iostream>
#include <string>
#include <list>
using namespace std;
#define C
#ifdef C
int main(void)
{
int f = 0, b= 0;
string T, H;
int rund;
cin >> rund;
for (size_t i = 0; i < rund; i++)
{
cin >> T >> H;
if (T == H) {
f++; b++;
}
else
for (size_t i = 0; i <= T.size() && i <= H.size(); i++... | #include <stdio.h>
#include<string.h>
int main(void){
int n,i,j,t=0,h=0;
scanf("%d",&n);
for(i=0;i<n;i++){
char a[101],b[101];
scanf("%s%s",a,b);
if(strcmp(a,b)==0){
t++;
h++;
}else{
int y,z=0;
y=strlen(a)<strlen(b)?strlen(a):strlen(b);... | 1 | 44,779,210 |
#include<stdio.h>
#include<string.h>
bool mark [1000000];
void sieve ()
{
int N = 1000000;
memset (mark, true, N + 2);
mark [0] = mark [1] = false;
for ( int i = 4; i < N + 2; i += 2 )
mark [i] = false;
for ( int i = 3; i * i <= N + 2; i += 2 ) {
if ( mark [i] == true ) {
... | #include "bits/stdc++.h"
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
int isPrime[1000000];
void era(){
for(int i=2;i<1000000... | 1 | 34,410,169 |
#include<iostream>
using namespace std;
int main()
{
int h,a,s=0,k;
cin>>h>>a;
for(int i=0;i<a;i++)
{ cin>>k;
s=s+k;
}
if(s>=h)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll h, n;
cin >> h >> n;
int hp=h;
for(int i=0; i<n; i++){
int a;
cin >> a;
hp -= a;
... | 1 | 46,851,671 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 1 | 6,354,853 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x[i];
}
vector<int> right(n);
for(int i=0; i<n-1; i++){
right[i] = x[i+1] - x[i];
}
right[n-1] = -1;
int klim = log... | #include <bits/stdc++.h>
const int N = 100005;
int n, l, q, x[N], p[N][17];
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n;
for (int i = 0; i < n; ++i) std::cin >> x[i];
std::cin >> l >> q;
for (int i = 0, j = 0; i < n; p[i++][0] = j)
while (j + 1 < n && x[j + 1] - x[i] <= l) ++j;
for... | 1 | 62,426,944 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(){
int m, nmin, nmax;
int p[201];
int gap;
int ans;
while(cin>>m>>nmin>>nmax&&m&&nmin&&nmax){
ans = -1;
gap = -1;
for(int i=0; i<201; i++){
p[i]=0;
}
for(int i=1; i<=m; i++){
cin >> p[i];
}
for(int i=nmin; i... | #include<iostream>
#include<algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int m,na,ni,ans;
while(cin>>m>>ni>>na,(m||ni)||na){
int p[m];
rep(i,m)cin>>p[i];
sort(p,p+m);
int gap=0;
loop(i,ni,na+1){
if(gap<=p[m-i]-p[m-i-1]){
ans=i;
... | 1 | 74,374,356 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll INF = 1001001001001001001;
int main(){
int n, k;
cin >> n >> k;
vector<int> p(n+1);
for(int i = 1; i <= n; i++) cin >> p[i];
vector<int> c(n+1);
for(int i = 1; i <= n; i++) cin >> c... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const ll MNA = -1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
#endif
ll n, k;
cin >> n >> k;
ll p[n+1], c[n+1];
for (int i=1; i<=n; i++) cin >> p[i];
for (int i=1; i<=n; i++)... | 1 | 76,339,544 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#define MN 100005
#define ll long long
using namespace std;
inline ll in(){
ll x=0;bool f=0;char c;
for (;(c=getchar())<'0'||c>'9';f=c=='-');
for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0');
return f?-x:x;
}
struct st{
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pii;
const int N = 1e5 + 100;
int d[N], sz[N], a[N];
vector<int> adj[N];
vector<pii> ans;
pii b[N];
int n, mx, val;
bool cmp(int x, int y) {
return d[x] > d[y];
}
inline int getPar(int v) {
int hp = d[v] - n + 2 * sz[v];
auto ... | 1 | 13,874,765 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
int main() {
ll n, m, i, j, k;
string s;
cin >> s;
cin >> n;
for(i=0;i<s.size();i+=n){
cout << s[i];
}
cout << endl;
return 0;
} | 1 | 80,778,010 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(i,... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const LL MOD = 1000000007LL;
bool dpX[2][16001];
bool dpY[2][16001];
int main() {
string s;
cin >> s;
int N = s.size();
int X, Y;
cin >> X >> Y;
int pos = 0;
while (pos < N && s[pos] == 'F') X--, pos++;
bool dir ... | 1 | 15,181,300 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int a, b, c;
int ans = 0;
fscanf(stdin, "%d %d %d", &a, &b, &c);
for (int i = a; i <= b; ++i) {
if (c % i == 0) { ++ans; }
}
fprintf(stdout, "%d", ans);
fprintf(stdout, "\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
int count = 0;
for(int i = a; i <= b; i++) {
if(c % i == 0) count++;
}
cout << count << "\n";
return 0;
} | 1 | 27,813,474 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,r,ans;
cin>>n>>r;
if(n<11) ans=r+100*(10-n);
else ans=r;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, r, d=0;
cin >> k >> r;
if(k >= 10)
cout << r;
else
cout << r+100*(10-k);
return 0;
} | 1 | 53,718,465 |
#include <bits/stdc++.h>
using namespace std;
int N;
const int M=1000001;
int cnt[M];
int gcd(int a,int b){return a?gcd(b%a,a):b;}
main()
{
cin>>N;
int g=0;
bool ok=true;
for(int i=0;i<N;++i){
int A;cin>>A;
g=gcd(g,A);
++cnt[A];
}
for(int i=2;i<M;++i){
int s=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
bool flag[1000002];
int main()
{
int n,a,cnt;
ll i,j;
bool mark=false;
scanf("%d",&n);
cnt=-1;
for(i=1; i<=n; i++)
{
scanf("%d",&a);
if(cnt==-1)cnt=a;
flag[a]=true;
cnt=__gcd(cnt,a);
}
i... | 1 | 15,075,833 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
cin >> s;
for (int i=0; i < s.size(); i++){
if (s.at(i)=='B'){
for (int j=0; j<i; j++){
if(s.at(i-j-1)!='B'){
s.at(i-j-1)='B';
break;
}
}
}
}
for (int i=0; i<s.size();i++){
if ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int n=s.length();
stack<char>s1;
for(int i=0;i<n;i++)
{
if(s[i]=='B')
{
if(!s1.empty())
{
s... | 1 | 98,785,365 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>> ;
using GraphEdge = vector<... | 1 | 91,839,536 |
#include <bits/stdc++.h>
using namespace std;
template <typename Container>
void print(const Container &c, char end = '\n', char sep = ' ')
{
for (const auto &x : c)
cout << x << sep;
cout << end;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
#define PI 3.14159265358979323846264338327950L
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const ... | 1 | 67,175,078 |
#include <iostream>
#include <vector>
using namespace std;
enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
class dice {
public:
dice() {
id[TOP] = 1; id[FRONT] = 2; id[LEFT] = 3;
id[RIGHT] = 4; id[BACK] = 5; id[BOTTOM] = 6;
}
dice(int top,int front,int right,int left,int back,int bottom) {
id[TOP... | #include <iostream>
using namespace std;
int main() {
int dice[6];
for (int i = 0;i < 6;++i) {
cin >> dice[i];
}
int n;
cin >> n;
while (n--) {
int top,front;
cin >> top >> front;
if (top == dice[0] || top == dice[2] || top == dice[3] || top == dice[5]) {
while (top != dice[0]) {
int temp = dice[0]... | 1 | 95,652,305 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 1 | 69,606,776 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define INCANT cin.ti... | 1 | 18,778,558 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
int cal_cost(vi& a , int p){
int ans = 0;
for(const auto & num... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | 1 | 73,727,477 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | #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++... | 1 | 3,844,135 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d, e, h1, m1, re;
cin >>a >> b >> c >> d >>e ;
h1 = (c - a)*60;
m1 = d - b;
re = h1 + m1;
cout << re - e << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int h1,h2,m1,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int minutes;
if(m1>m2){
minutes = m2+60-m1;
minutes += (h2-1-h1)*60;
}else{
minutes = m2-m1;
minutes += (h2-h1)*60;
}
cout<<minutes-k<<endl;
return 0;
} | 1 | 53,279,996 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int n; cin >> n;
string tmp;
vector<string> deck, copy;
for (int i = 0; i < n; i++) {
cin >> tmp;
deck.emplace_back(tmp);
}copy = deck;
for (int i = 0; i < deck.size(); i++) {
for (int j = deck.size()-... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(){
char A_symbol[36+1];
char A_symboltmp[36+1];
int A_num[36+1];
int A_numtmp[36+1];
int num;
char tmpstr[3];
cin >>num;
for(int i=0;i<num;i++){
scanf("%s",tmpstr);
A_symbol[i]=tmpstr[0];
A_symboltmp[i] = A_symbol[i];... | 1 | 53,001,407 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
int main() {
string s,t; cin >> s >> t;
int ans = 0;
rep(i,3) {
if (s[i] == t[i]) {
... | #pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include <unordered_map>
#include <map>
constexpr auto INF = 92233720368547758... | 1 | 14,384,773 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
ll prev2 = 2, prev = 1, L;
for (int i = 2; i <= N; i++) {
L = prev2 + prev;
prev2 = pre... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long LL;
typedef long long int int64;... | 1 | 51,591,942 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll Q, H, L, D, N;
cin >> Q >> H >> L >> D >> N;
H = min(H, Q * 2);
L = min(L, H * 2);
D = min(D, L * 2);
cout << N / 2 * D + (N % 2) * L << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 1 | 86,875,924 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
string a, b;
cin >> a >> b;
int k = 0;
for(int i = 0; i < a.si... | 1 | 66,466,449 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N, L;
std::cin >> N >> L;
std::vector<std::string> S(N);
for (int i=0; i<N; ++i){
std::cin >> S.at(i);
}
std::sort(S.begin(), S.end());
for (std::string s: S){
std::cout << s;
}
std::cout <... | 1 | 19,254,082 |
#include <iostream>
#include <string>
#include <vector>
#include <valarray>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <random>
#include <numeric>
#include <functional>
#include <chrono>
#include <bitse... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <set>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,b,n) for(int i=b;i<n;i++)
const float PI = 3.1415926;
static const int INFTY = (1<<30);
using namespace std;
typedef long lo... | 1 | 2,598,959 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2+5;
int n , k;
bool yes[N];
int main(){
scanf("%d%d" , &n , &k);
for(int i = 1; i <= k; i++){
int d;
scanf("%d" , &d);
for(int j = 1; j <= d; j++){
int x;
scanf("%d" , &x);
yes[x] = 1;
... | 1 | 97,047,078 |
#include<cstdio>
int main()
{
int x, t = 0;
while( scanf( "%d", &x ), x )
printf( "Case %d: %d\n", ++t, x );
return 0;
} | #include <stdio.h>
int main(void){
int x = 1;
for (int i = 1; x != 0; i++){
scanf("%d", &x);
if (x != 0) printf("Case %d: %d\n", i, x);
}
} | 1 | 6,461,481 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
string S;
cin >> S;
ll sum = 0;
ll app = 0;
int length = S.size();
for(int i = 0; i < length; i++){
if(S[i] == 'W'){
sum += (i - app);
app++;
}
}
cout << sum << end... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
string s;
cin>>s;
rever... | 1 | 1,285,120 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, tmp;
cin >> a >> b >> c;
int ary[3] = {a, b, c};
if (ary[0] > ary[1]) {
tmp = ary[0];
ary[0] = ary[1];
ary[1] = tmp;
}
if (ary[1] > ary[2]) {
tmp = ary[1];
ary[1] = ary[2];
ary[2] = tmp;
}
if (ary[0] > ary[1]) {
... | 1 | 87,743,993 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double v = a*a*b;
double ans = 0;
if (x >= 0.5*v){
ans = atan(2.0 * (v - x) / (a*a*a));
} else {
ans = atan(a*b*b / (2.0*x));
}
dou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
long double a, b, x;
void input() {
cin >> a >> b >> x;
}
long double f(long double a, long double b, long double theta) ... | 1 | 89,168,884 |
#include <stdio.h>
long long int ans[22] ;
void init ( ) ;
int main ( )
{
long long int s ;
init ( ) ;
while ( scanf ( "%lld" , &s ) == 1 ) {
printf ( "%lld\n" , ans[s] ) ;
}
return 0 ;
}
void init ( )
{
ans[0] = 0 ;
ans[1] = 1 ;
for ( long long int i = 2 ; i <= 20 ; i++ ) {
ans[i] = ans[i-1] * i ;
}
} | #include <iostream>
using namespace std;
unsigned long long factorial(int x) {
if(x != 1)
return x * factorial(x-1);
else if(x == 1)
return 1;
}
int main() {
int a;
cin >> a;
cout << factorial(a) << endl;
return 0;
} | 1 | 45,306,506 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG /GCC環境下で[]による配列要素参照のエラーを出す
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int64_t n;
cin>>n;
int64_t a =sqrt(n);
int64_t b;
for(int64_t i=a;i>0;i--){
if(n%i==0){
b=n/i;
break;
}... | #include <iostream>
#include <cmath>
using namespace std;
int cnt_digits(long long N) {
int digits = 0;
while(N > 0) {
N /= 10;
digits++;
}
return digits;
}
int main() {
long long N;
cin >> N;
int ans = cnt_digits(N);
for(long long A = 1; A*A <= N; A++) {
if(N%A !... | 1 | 27,662,913 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | #include<iostream>
int main()
{
int A, B;
scanf( "%d%d", &A, &B);
if((A*2<=B)&&(B<=A*4)&&(B%2==0))
printf("Yes");
else
printf("No");
} | 1 | 2,024,012 |
#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(){
ll s;
cin >> s;
ll x,y,z,w;
x=1000000000;
w=s/x;
++w;
ll sa;
sa=w*x-s;
y=sa;
z=1;
if(s==1000000000000000000){
z=0;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 56,512,955 |
#include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define PI 3.1415926535897932384626433832795
int MOD=1e9+7;
int powmod(int a,int l, int md){int res=1;while(l){if(l&1)res=res*a%md;l/=2;a=a*a%md;}return res;}
ty... | 1 | 72,366,442 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
const int N= 200001;
int freq[N];
void solve() {
int n; cin >> n;
vector<int> v(n);
for (auto& i: v) {
cin >> i;
... | #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 | 82,209,075 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x[2];
while (cin >> x[0], cin >> x[1], !(x[0] == 0 && x[1] == 0))
{
sort(x, x + 2);
cout << x[0] << " " << x[1] << "\n";
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a || b) {
if (a < b) cout << a << " " << b << endl;
else cout << b << " " << a << endl;
}
} | 1 | 11,710,608 |
#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 MOD 1000000007
#define ll long long int
#define pair <ll, ll> pi
#define vector <ll> vi
#define F first
#define S second
#define PB push_back
#define MP make_pa... | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<ioman... | 1 | 4,009,689 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | #include <bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include <vector>
#include <cstdlib>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false... | 1 | 90,855,132 |
#include<iostream>
using namespace std;
struct Card{char suit,value;};
int main()
{
int n=0;cin>>n;
Card a[100]={0},b[100]={0};
for(int i=0;i<n;i++)
{
cin>>a[i].suit>>a[i].value;
b[i]=a[i];
}
int f=1;
for(int j=0;f==1;j++)
{
f=0;
for(int i=n-1;i>j;i--)
{
if(a[i].value<a[i-1].value)
{
swap(a[... | #include <stdio.h>
#define X 36
typedef struct{
char mark;
int value;
int order;
}trump;
int main()
{
int N,i,minj,flag=1,j;
trump C1[X],C2[X],temp;
scanf("%d",&N);
if(N>=1 && N<=36){
for(i=0;i<=N-1;i++){
while(1){
scanf("%c",&C1[i].mark);
if(C1[i].mark!='D' && C1[i].mark!='C' && C1[i].mark!='... | 1 | 73,167,615 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
scanf("%d %d %d", &a,&b,&c);
if (a < b&&b < c)
printf("Yes\n", a, b, c);
else
printf("No\n", a, b, c);
} | #include <stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
(a < b && b < c) ? printf("Yes\n") : printf("No\n");
return 0;
} | 1 | 12,446,123 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define mod ((ull)1e9+7)
#define MAX ((ull... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
long MOD = 1000000007;
int main() {... | 1 | 38,242,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N; cin >> N;
cout << N / 3 << endl;
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N;
cin >> N;
ll ans = N / 3;
cout << ans << endl;
} | 1 | 1,059,907 |
#include<bits/stdc++.h>
using namespace std;
#define F(i,a,b) for(int i=a;i<=(b);++i)
#define ll long long
int k,a[100001],vis[100001];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > pq;
int c[100001];
int main(){
scanf("%d",&k);
memset(a,0x3f,sizeof a);
a[1]=1; pq.push(make_pair(1,1))... | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (long (i) = 0; (i) < (n); (i)++)
using namespace std;
int K;
bool searched[100000];
void solve() {
queue<pair<int, int>> q;
q.push(make_pair(1, 1));
while (1) {
auto x_and_ans = q.front();
q.pop();
int x = x_and_ans.first;
while (... | 1 | 86,511,686 |
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> a;
for(int i = 0; i < s.size(); i++){
a[s[i]]++... | 1 | 45,447,802 |
#include <bits/stdc++.h>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<bool> A(N, false);
for (int i = 0; i < K; i++) {
int num;
std::cin >> num;
for (int j = 0; j < num; j++) {
int ind;
std::cin >> ind;
A[ind-1] = true;
}
... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 1 | 3,238,228 |
#include <iostream>
#include <vector>
using namespace std;
class DisjointSet
{
public:
vector<int> rank, p;
DisjointSet() {}
DisjointSet(int size)
{
rank.resize(size, 0);
p.resize(size, 0);
for (int i = 0; i < size; ++i)
makeSet(i);
}
void makeSet(int x)
{... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class UnionFind {
public:
vector<int> par;
UnionFind() {}
UnionFind(int n) {
par.resize(n);
for (int i = 0; i < n; i++) par[i] = i;
}
int root(int a) {
if (par[a] == a)return a;
else return par[a] = root(par[a]);
}
void unite(in... | 1 | 31,180,262 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.