code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2000,mod=1000000007;
int n,m,a[N+9];
void into(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i)
scanf("%d",&a[i]);
}
int c[N+9];
void Add(int p,int v){for (;p<=N;p+=p&-p) c[p]+=v;}
int Query(int p){int res=0;for (;p;p-=p&-p) res+=c[p];ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
int n;
ll k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j... | 1 | 85,243,653 |
#include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << fixed << T * 1.0 / X << endl;
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
std::cout << std::fixed << std::setprecision(10);
int T, X;
cin >> T >> X;
double ans = 0.0;
ans = (double)T / (double)X;
cout << ans << endl;
return (0);
} | 1 | 33,735,503 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
ll A, B, K;
cin >> A >> B >> K;
rep(i, K) {
if (i%2 == 0) {
if (A%2) A--;
B += A/2;
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 1 | 49,817,037 |
#include <iostream>
#include <string>
#include <vector>
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <iomanip>
#include... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll n;
cin >> n;
vll a(n);
... | 1 | 79,758,819 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 50005
int main()
{
_FastIO;
ll n , m;
cin >> n >> m;
if(n >= 2)
n -= 2;
if(m >= 2)
m -= 2;
ll ans = n... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
if (n == 1 && m == 1)
cout << "1\n";
else if (n == 1)
cout << max(0ll, m - 2) << '\n';
else if (m == 1)
cout << max(0ll, n - 2) << '\n';
else {
long long do... | 1 | 28,772,310 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()... | #include<bits/stdc++.h>
using namespace std;
#define maxn 100020
#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i... | 1 | 25,682,650 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int a,b,c,d,k;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>a>>b>>c>>d>>k;
cout<<max(0,c*60... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 1 | 29,059,128 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define BLACK 0
#define RED 1
#define MAN 2
int count;
int tile[20][20];
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};
int W,H;
int countdebug;
void hukasa(int width,int height);
int main(){
int height,width;
int i,j;
char s;
while(scanf("%d %d",&W,&H) && W... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int h,w;
char mp[111][111];
int xx[4]={0,1,0,-1};
int yy[4]={-1,0,1,0};
int sx,sy;
int tile(int y,int x){
if(y<h&&x<w&&y>=0&&x>=0&&mp[y][x]!='#'){
mp[y][x]='#';
int t=0;
for(int i=0;i<4;i++){
t+=tile(y+y... | 1 | 50,043,728 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int ar[3];
ar[0]=a;
ar[1]=b;
ar[2]=c;
sort(ar,ar+3);
cout << ar[0] << " " << ar[1] << " " << ar[2] << endl;
} | #include <iostream>
using namespace std;
int main(){
int num[3];
int tmp;
for(int n=0;n<3;n++)cin>>num[n];
for(int x=0;x<3;x++){
for(int y=2;y>0;y--){
if(num[y]<num[y-1]){
tmp=num[y];
num[y]=num[y-1];
num[y-1]=tmp;
}
}
}
cout<<num[0]<<" "<<num[1]<<" "<<num[2]<<endl;
return 0;
} | 1 | 56,823,900 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | #include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... | 1 | 89,315,073 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename K,typename V>
using umap = unordered_map<K,V>;
template <typename V>
using uset = unordered_set<V>;
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) ... | #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,... | 1 | 1,554,138 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n;
cin >> n;
unordered_map<string, int> frq;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += frq[s]+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
unordered_map<string, int> mp;
ll ans = 0;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin... | 1 | 22,911,954 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <bitset>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll mod = 100... | #include "bits/stdc++.h"
#include <numeric>
#define rep(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define llMIN numeric_limits<long long>::min()
#define intMIN numeric... | 1 | 22,674,803 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define PI 3.14159265359
using namespace std;
using ll = long long;
bool kaibun(string s){
string t(s.rbegin(), s.rend());
return s == t;
}
int main(){
string s;
cin >> s;
int n = s.size();
cout << (kaibun(s) && kaibun(s.substr(0,(n-1)/2)) &... | #include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | 1 | 70,362,206 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include<iostream>
#include<algorithm>
using namespace std;
#define MAX_N 10000
#define INF 10000000LL
long long n, j, x[MAX_N][MAX_N], p[MAX_N + 2], sum;
int matrix() {
for (int i = 0; i < n; i++) { x[i][i] = 0; }
for (int h = 2; h <= n; h++) {
for (int i = 1; i <= n - h + 1; i++) {
j = i + h - 1;
x[i][j] = ... | 1 | 76,663,871 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
#include<math.h>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a1, a2, a3, b1, b2, b3;
vector<int> town(5);
cin >>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<string>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : pa... | 1 | 67,826,103 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
long long ans = 0;
vector<long long> V(N);
for(int i = 0; i < N; i++) cin >> V[i];
int kosu = min(N, K);
for(int i = (kosu + 1) / 2; i <= kosu; i++){
for(int j = i - 1; j ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main(){
int n,k;cin>>n>>k;
vector<ll>v(n);
for (int i = 0; i ... | 1 | 38,689,427 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, h;
cin>>n>>h;
int a = 0;
vector<int> b(n);
for(int i = 0; i < n; i++){
int x; cin>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 1 | 51,187,585 |
#include <iostream>
using namespace std;
int num;
int fib(int n, int array[]) {
array[0] = 1;
array[1] = 1;
for (int i= 2; i <= n; i++) {
array[i] = array[i - 1] + array[i - 2];
}
cout << array[n] << endl;
}
int main(void) {
cin >> num;
int array[num] = {};
fib(num, array);
} | #include<cstdio>
int main(){
int fib[45],n;
fib[0] = 1;
fib[1] = 1;
for(int i=2;i<45;i++){
fib[i] = fib[i-1] + fib[i-2];
}
scanf("%d",&n);
printf("%d\n",fib[n]);
return 0;
} | 1 | 55,912,440 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K;
cin >>N>>K;
ll a,b,c;
cin >>a>>b>>c;
string T;
cin >> T;
ll ans=0;
for(int i=0;i<N;i++){
if(i<K){
if(T[i]=='r'){
ans+=c;
continue;
}
if(T[i]=='s'){
ans+=a;
continue;... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);
#de... | 1 | 91,542,521 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define sigma_size 30
#define max_size (int)(3e5+10)
#define MAX (int)(1e5+7)
int qread()
{
char c; int s=0,t=1; while ((c=getchar())<'0' || c>'9') (c=='-' && (t=-1));
do s=s*10+c-'0'; while ((c=getchar())>='0' && c<='9'); return s*t;
}
int a[max_size... | #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int n;
const int MAXN=300100;
int a[MAXN];
int num[MAXN],use[MAXN],p[MAXN];
int po[MAXN],mo[MAXN];
long long ans[MAXN];
int tot;
int deal(int i,int x)
{
int q=upper_bound(num+1,num+tot+1,x)-num;
if(po[q-1]+(tot-q+1)*1LL*x>=1LL*x*i) return 1... | 1 | 2,833,936 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
long long M = max({ A,B,C });
long long sum;
if (M % 2 == (A + B + C) % 2) {
sum = M - A + M - B + M - C;
}
else {
sum = M + 1 - A + M + 1 - B + M + 1 - C;
}
cout << sum / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
cout << (a[1] - a[0]) / 2 + ((a[1] - a[0]) % 2) * 2 +... | 1 | 19,695,448 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int w = n % 500;
if ((n < a) || (w < a) || ((w == 0) && (a == 0))) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A % 500;
if ( C <= B ) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 43,190,430 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D,T,S;
cin >> D >> T >> S;
if (D <= T*S) {
cout << "Yes";
}
else {
cout << "No";
}
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
double d,t,s;
cin>>d>>t>>s;
if((d/s)<=t)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 28,543,438 |
#include<bits/stdc++.h>
using namespace std;
namespace FastIO
{
static char c;
static int top,buf[22];
template<typename T>
inline void read(T& x)
{
x=0,c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
}
template<typename T>
inline void write(T x,int f=0)
{
top=0;
... | #include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 100005;
int N, M;
vector <int> E[MAXN];
int color[MAXN];
void load() {
scanf("%d%d", &N, &M);
while (M--) {
int u, v;
scanf("%d%d", &u, &v);
E[u].push_back(v);
E[v].push_back(u);
}
}
bool dfs(in... | 1 | 11,383,335 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
long long cnt=0,sum=0;
for(int i=0;i<s.size();i++){
if(s[i]=='W'){
sum+=(i-cnt);
cnt++;
}
}
cout<<sum;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x,val) x.erase(remove(all(x), val), x.end())
typedef long long ll;
typedef pair<int, int> P;
template... | 1 | 85,251,744 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
ll cnt[300005];
bool vis[300005];
int main() {
int n;
cin >> n;
vector<ll> nn;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
cnt[a]++;
if (!vis[a]) {
vis[a] = 1;
... | 1 | 5,255,591 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 1 | 94,145,889 |
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pr pair<int,int>
#define SZ(S) int(S.size())
#define REP(i,a,b) for(int i=a;i<b;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,b,a) for(int i=b;i>=a;--i)
#define CLR(A,x) mems... | #include<string.h>
#include<stdio.h>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,d;
int a[2111][2111];
int B=1010;
char ans[511][511];
int main()
{
int i,j,k;
cin>>n>>m>>d;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
int xx,yy;
... | 1 | 31,307,839 |
#include <iostream>
#include <set>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
n = (1 << n);
int maxi = 18;
int maxj = (1 << 18);
int a[n + 5];
std::multiset<int> seti[maxj + 5] = {};
for (int i = 0; i < n; ++i)
{
std::cin >> a[i];
seti[i].insert(a[i]);
... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#define INF 1e9+7
using name... | 1 | 85,284,617 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const i... | #include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin>>n>>m,n||m){
vector<P> v;
for(int i=0;i<n;++i){
int d,p;
cin >> d >> p;
v.push_back(P(p,d));
}
sort(v.begin(), v.end(), greater<P>(... | 1 | 26,996,028 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef array<int, 2> duo;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
templa... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int N, K; cin >> N >> K;
int cnt... | 1 | 11,142,804 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<long long> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LLi i = 0; i < (n); i++)
#define FOR(in) for(LLi i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | 1 | 73,968,969 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if (x > 3000) {
cout << 1;
return 0;
}
for (int i = 0; i < 30; i++)
for (int j = 0; j < 30; j++)
for (int k = 0; k < 30; k++)
for (int l = 0; l < 30; l++)
for (int n = 0; n < 30; n++)
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int num = N / 100;
int r = N % 100;
if (r > 5 * num) cout << 0 << endl;
else cout << 1 << endl;
} | 1 | 5,749,315 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
vector<ll> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
vector< vector<ll> > v1(n,vector<ll>(k+1));
for(int i=0;i<n;i++)
for(int j=0;j<=... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1][k + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
const int mod = 1e9 + 7;
for (int i = 1; i <= n... | 1 | 17,382,297 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100000 + 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 1 | 61,235,261 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << "\n";
}
else {
ll ans = a;
k -= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t K,A,B;
cin>>K>>A>>B;
if(B-A<=2){
cout<<1+K<<endl;
}
else{
if(K<=A){
cout<<1+K<<endl;
}
else{
int64_t S=A+((K-A+1)/2)*(B-A)+(K-A+1)%2;
cout<<max(1+K,S)<<endl;
}
}
} | 1 | 83,755,645 |
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 200000;
int n, m;
vector<vector<int>> G(MAX_N);
bool used[MAX_N];
int dfs(int v) {
used[v] = true;
int d = 1;
for (int i = 0; i < G[v].size(); i++) {
int next = G[v][i];
if (!used[next]) {
d += dfs(next);
}
}
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef vector<ll> VLL;
typedef vector<vector<ll>> VVLL;
typedef pair<ll, ll> Pair;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (l... | 1 | 29,866,970 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | #include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
using namespace std;
typedef long long ll;
int read() {
int X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
return X*w;
}
const char s... | 1 | 53,362,565 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<pii> ab(N);
vector<pii> cd(M);
r... | #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;
int main(){
int N,M; cin >>N >>M;
vector<int> a(N);
vector<int> b(N);
rep(i,0,N) cin >>a[i] >>b[i];
vector<int> c(M);
vector<int> d(M);
rep(i,0,M) cin >>c[i] ... | 1 | 91,781,106 |
#include <bits/stdc++.h>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
#define rrep(i,n,m) for(int i=((int)(n)-1);i>=m;i--)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
int main(){
string s;
cin>>s;
cout<<(... | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<iomanip>
#include<set>
#include<tuple>
#include<map>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typede... | 1 | 80,256,640 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define maxn 100005
const ll mod=1e9+7;
using namespace std;
ll x[maxn];
int n,m;
ll y[maxn];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&x[i]);
for(int i=1;i<=m;i++)
scan... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
map<pii,int>m;
vector<int>adjb[200005],adjr[200005];
#define MOD 1000000007
int main()
{
ll n,m,i,ANS=0,ans=0,ans2=0;
cin>>n>>m;
ll ara[n],arb[m];
for(i=0;i<n;i++) cin>>ara[i];
for(i=0;i<... | 1 | 28,132,553 |
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
template <typename A, typename B>
s... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | 1 | 39,388,305 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, p;
cin >> s;
cin >> p;
for (size_t i = 0; i < s.size(); ++i) {
bool m = true;
for (size_t j = 0; j < p.size(); ++j) {
int k = j + i;
if (j + i >= s.size()) {
k = j + i - s.size();
... | #include <iostream>
#include <cstdlib>
#include <string>
#include <cctype>
static bool Input(std::string &s, std::string &p)
{
if (0x00 == &s || 0x00 == &p) {
return false;
}
std::cin >> s;
std::cin >> p;
if ((0 < s.size() && 100 >= s.size()) &&
(0 < p.size() && 100 >= p.size())) {
return true;
}
return f... | 1 | 99,231,701 |
#include <iostream>
using namespace std;
int main() {
int A=0,B=0;
for(int i=0;i<4;i++){
int temp;
cin >> temp;
A+=temp;
}
for(int i=0;i<4;i++){
int temp;
cin >> temp;
B+=temp;
}
if(A<B)
cout << B << endl;
else
cout << A << endl;
return 0;
} | #include<stdio.h>
int main(){
int a=0,b=0,d;
for(int i=0;i<4;i++){
scanf("%d",&d);
a=a+d;
}
for(int i=0;i<4;i++){
scanf("%d",&d);
b=b+d;
}
if(a<=b) printf("%d\n",b);
else printf("%d\n",a);
return 0;
} | 1 | 50,445,099 |
#include<cstdio>
char a,b;
int main()
{
scanf("%c %c",&a,&b);
if(a^b)
putchar(a<b?'<':'>');
else
putchar('=');
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
char x,y;
cin>>x>>y;
if(x>y)
cout<<'>';
else if(x==y)
cout<<'=';
else
cout<<'<';
return 0;
} | 1 | 29,963,211 |
#include<bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll ,ll >
#define pii pair<int, int>
#define mod 1000000007
ll power(ll a,ll b){
ll res=1;
while(b>0){
if(b%2!=0) res=(res*a);
a=(a*a);
b/=2;
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<stdlib.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
return y == 0 ? x : gcd(y, x%y);
}
int main() {
ll x, n;
cin >> n >> x;
ll t = gcd(x, n);
ll u = n/t, v = 3*u-3;
cout << t*v;
return 0;... | 1 | 62,720,947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int h, w;
cin ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 1 | 72,074,534 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 100010;
int N, M;
vector<int> adj[MAXN];
int col[MAXN];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0);
cin >> N >> M;
for (int i = 0; i < M; i++) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push... | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
typedef long long ll;
using namespace std;
int M, a, b, t[100000], vis[100000], c[100000];
vector<int>v[100000];
ll res, A, B, C, N;
int T(int x) {
... | 1 | 86,719,713 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n;
cin>>n;
ll p[n];
ll a[n+1]={},b[n+1]={};
for(int i=0;i<n;i++){
cin>>p[i];
}
reverse(p,p+n);
for(int i=0;... | 1 | 97,062,596 |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 2e5 ;
const int INF = 1e9 + 1e5 + 2;
const int mod= 1e9+7;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define what_is(x) cerr << #x << " = " << x << endl;
#define eps 1e-15
#define F first
#define S second
typedef long long ll;
ll f... | #include <bits/stdc++.h>
#include <stdio.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main()... | 1 | 24,795,064 |
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <cfenv>
#include <cinttypes>
#include <cstdi... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
long double w, h, x, y; cin >> w >> h >> x >> y;
if(x * 2 == w && y * 2 == h)... | 1 | 7,751,182 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef int64_t Int;
using namespace std;
int main(){
int N, K; cin >> N >> K;
if(K > (N-1)*(N-2)/2){
cout << "-1" << endl;
return 0;
}
vector<pair<int,int>> edge;
rep(i, N-1) edge.push_back(make_pair(1, i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N, K;
int main(int argc, char **argv)
{
cin >> N >> K;
ll ma = (... | 1 | 77,729,100 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<double> x(n);
vector<string> u(n);
double ans=0,BTC=0;
for(int i=0;i<n;i++){
cin>>x.at(i)>>u.at(i);
if(u.at(i)=="JPY")
ans+=x.at(i);
else
BTC+=x.at(i);
}
ans+=BTC/1*3800... | #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 n;cin>>n;
long double ans = 0;
long double b = 380000.0;
rep(i,n){
long double x;cin>>x;
string s;cin>>s;
if(s=="JPY")ans+=x;
else ans+=b*x;... | 1 | 20,500,889 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
int main(void) {
int n;
cin >> n;
vector< vector< vector<int> > > a(4, vector< vector<int> >(3, vector<int>(10, 0)));
for(int i=0; i<n; i++){
int b, f, r, v;
cin >> b >> f >> r >> v;
a[b-1][f-... | #include<iostream>
using namespace std;
int main()
{
int n;
int b, f, r, v;
int room[4][30]={0};
int i, j;
cin >> n;
for(i=0;i<n;i++){
cin >> b >> f >> r >> v;
room[b-1][(f-1)*10+r-1]+=v;
}
for(i=0;i<4;i++){
for(j=0;j<30;j++){
cout << ' ' << room[i][j];
if(j==9||j==19)
cout << endl;
}
cout <... | 1 | 61,102,451 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1e+18;
int iINF = 1e9;
int
main()
{
ll N; cin >> N;
vector<pair<ll, ll>> arr;
ll ori = N;
for(ll i = 2; i * i <= N; ++i){
if(N % i ... | 1 | 70,239,462 |
#include<iostream>
using namespace std;
int main(){
int x, buf, i, j;
int top[3];
for(i = 0; i < 3; i++)
top[i] = 0;
for(i = 0; i < 10; i++){
cin >> x;
if(x > top[2]){
top[2] = x;
j = 2;
while(j > 0){
if(top[j-1] <top[j]){
buf = top[j-1];
top[j-1] = top[... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
vector<int> h(10);
for(int i=0;i<10;++i) cin>>h[i];
sort(begin(h),end(h),greater<int>());
for(int i=0;i<3;++i) cout<<h[i]<<endl;
return 0;
} | 1 | 39,775,283 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int,int>;
typedef long long ll;
#define pi 3;
int main()
{
int r;
cin >> r;
int x = 1;
int area = r*r*pi;
int xarea = x*x*pi;
cout << area / xar... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 1 | 65,947,038 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int rr = 0, gg = 0, bb = 0;
for (char c : s) {
if (c == 'R')
rr++;
if (c == 'G')
gg++;
if (c == 'B')
bb++;
}
ll res = (ll)rr * gg * bb;
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vecto... | 1 | 42,941,542 |
#include<iostream>
#include<sstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<numeric>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r) (r).begin()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
n = 1000 - n;
int a = n / 500;
n %= 500;
int b = n / 100;
n %= 100;
int c = n / 50;
n %= 50;
int d = n / 10;
n %= 10;
int e = n / 5;
int... | 1 | 47,405,071 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int dignum(ll n) {
int res = 0;
while(... | 1 | 69,668,619 |
#include <iostream>
#include <cmath>
using namespace std;
#define NUM 600
int main(){
long n;
while(cin >> n){
long a = NUM/n;
long b = 0;
for(long i=1;i<a;i++) b += n*n*n*i*i;
cout << b << endl;
}
} | #include<iostream>
using namespace std;
int main() {
int d, x, y, s = 0;
while (cin >> d) {
x = 600;
s = 0;
for (x -= d; x > 0; x -= d) {
y = x * x;
s += y * d;
}
cout << s << endl;
}
return 0;
} | 1 | 8,432,577 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #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 | 63,160,529 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#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
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A<=B){
for(int i=0;i<B;i++){
cout << A;
}
cout << endl;
}
else{
for(int i=0;i<A;i++){
cout << B;
}
cout << endl;
}
} | 1 | 88,857,846 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
bool have;
int ans;
cin >> a >> b >> c;
if(a == b){
if(b == c) ans = 1;
else ans = 2;
}
else if(a == c){
ans = 2;
}
else if(b == c) ans = 2;
else ans = 3;
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,b,c,sum=0;
cin>>a>>b>>c;
if(a==b&&b==c)
{
cout<<sum+1<<endl;
}
else if(a==b||b==c||c==a)
{
cout<<sum+2<<endl;
}
else
{
cout<<sum+3<<endl;
}
return 0;
} | 1 | 40,167,615 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() < 4) cout << "No\n";
else {
if (s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I') cout << "Yes\n";
else cout << "No\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin >> S;
int N = S.size();
string ans = "No";
if (N >= 4) {
if (S.at(0) == 'Y' && S.at(1) == 'A' && S.at(2) == 'K' && S.at(3) == 'I') {
ans = "Yes";
}
}
cout << ans << endl;
} | 1 | 55,486,848 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define F .first
#define S .second
using ll=long long;
using ld=long double;
using namespace std;
const ll mod=1e9+7;
tuple<ll,ll,ll>x[110000];
main(){
ll... | 1 | 71,926,706 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int A,B,C;cin>>A>>... | 1 | 43,902,727 |
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
vector<int> a;
a.resize(10);
for(int i=0;i<10;i++){
cin>>a[i];
}
sort(a.begin(),a.end());
cout<<a[9]<<endl<<a[8]<<endl<<a[7]<<endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n[10];
for(int i = 0; i < 10; i++)
{
cin >> n[i];
}
int max = 0;
for(int i = 0; i < 9; i++)
{
for(int j = i+1; j < 10; j++)
{
if(n[i] < n[j]) swap(n[i], n[j]);
}
}
cout << n[0] << endl;
cout << n[1] << endl;
cout << n[2... | 1 | 71,825,556 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
map<ll,i... | #include<iostream>
#include<algorithm>
#include<vector>
#include <iomanip>
#include <cmath>
#include <string.h>
#include <stdio.h>
using namespace std;
int findDigits(long long n){
int digits = 0;
while(n>0){
digits++;
n = n/10;
}
return digits;
}
int main(){
long long N;
cin >> N;
long long m... | 1 | 62,661,794 |
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
struct GamePoints {
int points;
};
int main() {
GamePoints Taro, Hanako;
int n;
while( cin >> n) {
string card_1, card_2;
Taro.points = 0;
Hanako.points = 0;
for(int i=0;i<n;i++) {
cin >> card_1 >> card_2;
if(card_1 == card_2 )
... | #include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int taroScore=0;
int hanakoScore=0;
for(int i=0;i<n;i++){
string taro;
string hanako;
cin >> taro;
cin >> hanako;
if(taro>hanako){
taroScore+=3;
}else if(taro<hanako)... | 1 | 75,872,960 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
long long x[n],y[n];
vector<pair<long long,long long>>p(n);
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
p[i]={x[i],y[i]};
}
sort(x,x+n);
sort(y,y+n);
long long m=5000000000000000000;
for(int l... | #include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return true;
}
return false;
}
int main() {
i... | 1 | 50,857,425 |
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 1 | 44,466,757 |
#include<iostream>
using namespace std;
int main(void){
int input,suma=0,sumb=0,i;
for(i=0;i<4;i++){
cin>>input;
suma+=input;
}
for(i=0;i<4;i++){
cin>>input;
sumb+=input;
}
cout<<((suma<sumb)?sumb:suma)<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
cin.tie(0);ios::sync_with_stdio(false);
int A = 0, B = 0;
for (int i = 0; i < 4;i++) {
int s; cin >> s;
A += s;
}
for (int i = 0; i < 4;i++) {
int s; cin >> s;
B += s;
}
cout << max(A, B) << endl;
} | 1 | 6,175,971 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
#define pb push_back
#define ppb pop_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> index... | #include<iostream>
using namespace std;
int T,N;
int arr[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
cin>>T;
cout<<arr[T-1]<<endl;
} | 1 | 37,615,814 |
#include <iostream>
#include <vector>
#include <limits.h>
using namespace std;
int main()
{
int i = 0, maxV = INT_MIN, A[30] = {};
for (int k; cin >> k; ) {
A[i++] = k;
if (maxV < k)
maxV = k;
}
int s = maxV + 1;
vector<long> vP(s, 0);
int c = 0, j;
for (int k = 2; k < s; ++k){
if (vP[k] == 0){
vP[k]... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int n,num[999999] = {0},i,j,ans;
while(cin >> n){
ans = 0;
for(i = 0;i <= n;i++){
num[i] = 1;
}
for(i = 2;i <= sqrt(n);i++){
if(num[i]){
for(j = 0;i * (j + 2) <= n;j++){... | 1 | 58,248,029 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct listnode{
int val;
listnode* next;};
vector<int> func( vector<int> a,vector<int>l,int sum){
vector<int>k,val;
for(int i=0;i<l.size();i++)
if(l[i]==0){
k.push_back(i);
val.push_back(a[i]);}
i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
cin>>s;
ll dp1[s+1];
memset(dp1,0,sizeof(dp1));
for(... | 1 | 15,353,762 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(),(v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main(){
int n, k;
cin >> n >> k;
if(n % k == 0) out(0);
else out(1);
} | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%b==0) cout<<'0';
else cout<<'1';
} | 1 | 26,615,033 |
#include <iostream>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
pii mx(pii a, pii b){
int i,ma1 = -1,ma2 = -1,c[4];
c[0] = a.first,c[1] = a.second,c[2] = b.first,c[3] = b.second;
for(i=0;i<4;i++){
if(ma1<c[i]){
ma2 = ma1; ma1 = c[i];
}else if(ma2<c[i]){
ma2 = c[i];
}
}
return {ma... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
ll dx[4]={0,1,-1,0};
ll dy[4]={1,0,0,-1};
signed main(){
ios::sync... | 1 | 46,718,404 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 0x7ffffff;
const int mod = 1000000007;
ll gcd(ll a, ... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
ll M = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
... | 1 | 84,007,708 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
ll n;
vector<bool> tobit(ll inp) {
vector<bool> v(n, 0);
int i = 0;
while(inp) {
v[i] = inp % 2;
inp /= 2;
i++;
}
return v;
}
int main() {
ll k... | #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> pp;
const ll INF = 1e14;
const int MOD = 1000000007;
int main() {
int n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = INF;
rep(i,pow(2,n)){
int cnt = 0;
... | 1 | 5,127,705 |
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
using namespace std;
class uni... | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <limits>
#include <cmath>
#include <numeric>
#include <string>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
#define rep(i, a, b) for(int i = (a); i < (b); ++i )
#define rrep(i, a, b) for(int i = (a... | 1 | 70,785,048 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long pw[11]; pw[0] = 1;
for (int i = 1; i <= 10; ++i) pw[i] = 1ll * pw[i - 1] * 10;
int num = 0;
for (int i = 1 ; i <= 10; ++i) {
cout << "? " << pw[i] << "\n";
cout.flush();
char c; cin >> c;
if(c == 'N') {
num = i;
break;
}
}
if(nu... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define Fast_IO ios::sync_with_stdio(false);
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getch... | 1 | 98,112,490 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | 1 | 40,994,094 |
#include<iostream>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
int a[n];
long long ans=0;
cin>>a[0];
for(int i=1;i<n;i++){
cin>>a[i];
if(a[i]-a[i-1]>t){
ans+=t;
}else{
ans+=a[i]-a[i-1];
}
}
ans+=t;
cout<<ans<<endl;
... | #include<iostream>
using namespace std;
int main(void){
int N,T;
cin>>N>>T;
int t[200000]={0};
for(int i(0);i<N;i++){
cin>>t[i];
}
long long total_time(0);
total_time = (long long)T*N;
for(int i(0);i<N-1;i++){
if(t[i+1]-t[i]<T)total_time -= T - t[i+1] + t[i];
}
co... | 1 | 29,520,170 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (auto &v : {111, 222, 333, 444, 555, 666, 777, 888, 999, 1111})
if (n <= v) {
cout << v << endl;
break;
}
} | #include<bits/stdc++.h>
using namespace std;
int d[1000001];
int main()
{
int n;cin>>n;
for(;;n++)if(n%10==((n/10)%10)&& n%10==(n/100)%10){cout<<n<<endl;return 0;}
} | 1 | 9,378,327 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const lo... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
string str;
while(1){
getline(cin,str);
stack<int> data;
if(str.at(0)=='.')break;
int flag=0;
for(int i=0;i<str.size();i++){
if(str.at(i) =='('){
data.push(1);
}
if(str.at(i) == '['){
data.push(2);
}
if(s... | 1 | 96,831,214 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 100005;
int n;
int a[N];
int main() {
FAST;
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 ... | 1 | 7,978,324 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n + 1, -1);
queue<int> q;
dp[0] = 0;
q.push(0);
while(!q.empty()) {
int temp = q.front();
q.pop();
if (temp + 1 <= n && dp[temp + 1] < 0) {
dp... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 1 | 67,203,173 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N, ans = -1;
cin >> N;
vector<string> s(N);
vector<int> t(N);
for (int i=0; i<N; i++) cin >> s[i] >> t[i];
string X... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 1 | 89,035,562 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18+7)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T,vector<T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, A, B, cnt = 0, c = 0;
cin >> N >> A >> B;
if (A + B - 1 > N || N > A*B){
cout << -1;
return 0;
}
vector<int> seq[300005];
for (int i = 1; i <= B; ++i){
do{
seq[i].push_bac... | 1 | 8,928,629 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 1 | 50,291,605 |
#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 x;
cin >> x;
cout << (x<1200?"ABC":"ARC") << '\n';
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#define debug1(x) debug(x) cout<<'\n';
#define debug2(x1... | 1 | 14,685,864 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,k; cin >> n >> k;
int ans = pow(k-1,n-1);
ans *= k;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb(s) push_back(s)
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
typedef long long ll;... | 1 | 30,801,626 |
#include<stdio.h>
#include<string.h>
int main(void)
{
int a,f,k,i,j,z=0;
char s[1000],d[1000],h[1000];
scanf("%s",s);
a=strlen(s);
scanf("%s",d);
f=strlen(d);
strcpy(h,s);
strcat(s,h);
k=strlen(s);
for(i=0;i<=k;i++){
for(j=0;j<=f;j++){
if(s[j+i]!=d[j])
break;
}
if(j==f){
z=1;
break;
}
}
... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main(){
string s, p;
cin >> s;
cin >> p;
int flag = 0;
s += s;
int s_length = s.length();
int p_length = p.length();
for (int i = 0; i < s_length - p_length; i++)
{
if (s.substr(i, p_length) == p){
flag = 1;
break;
}
}
... | 1 | 88,700,326 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
map<int, int> mp;
int a;
rep(i, N) {
cin >> a;
if (mp.count(a)) mp[a]++;
... | #include <iostream>
#include <map>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
map<int,int> mp;
for (int i = 0; i < n; i++)
{
int a; cin >> a;
mp[a]++;
}
int ans = 0;
for(auto it = mp.begin(); it != mp.end(); ++it){
... | 1 | 52,075,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(char &c){
int i;
for(;;){
i = getchar_unlocked();
if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
break;
}
}
c = i;
}
inline int rd(char c[]){
int i;
int sz = 0;
for(;;){
i = getchar_unlocked();... | 1 | 24,058,297 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, i, j, p, x, a[20009], b[20009];
cin >> n;
for(i = 0; i < n; i++)
a[i] = i+1;
for(i = n-1; i >= 0; i--)
b[i] = n-i;
for(i = 0; i < n; i++)
{
cin >> p;
a[p-1] += i;
for(j = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 1 | 3,716,857 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
clock_t cTimeStart, cTimeEnd;
cTimeStart = clock();
for(int i=1;i<10;++i){
for(int j=1;j<10;++j){
cout<<i<<"x"<<j<<"="<<i*j<<endl;
}
}
cTimeEnd = clock(); ... | #include<iostream>
using namespace std;
int main(){
for (long long i=1;i<=9;i++){
for (long long j=1;j<=9;j++){
cout << i << "x" << j << "=" << i*j << endl;
if (j==9){
break;}
}
}
return 0;
} | 1 | 52,846,150 |
#include <bits/stdc++.h>
#include <math.h>
int n,m,i,j,k,count1=0,count2=0;
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void){
ABC120();
}
v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
int main() {
int a, b, k;
vector<int> ans;
cin >> a >> b >> k;
int n = max(a, b);
rep2(i, n) {
if (a % i == 0 && b % i == 0) {
... | 1 | 22,259,219 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.