code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,m;
cin >> n >> m;
int count=0;
if(n<=1) cout << (m*(m-1))/2 << endl;
else if(m<=1) cout << (n*(n-1))/2 << endl;
else{
count += (n*(n-1))/2+(m*(m-1))/2;
cout << count << endl;
}
return 0;
} | #include <stdio.h>
int main(){
int N,M,C,D;
scanf("%d %d", &N, &M);
C=(N-1)*N/2;
D=(M-1)*M/2;
printf("%d", C+D);
return 0;
} | 1 | 64,734,449 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int t,n,m,l,k,j;
cin>>n>>m>>l>>k;
t=min(n,m);
j=min(l,k);
cout<<t+j;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 1 | 27,371,394 |
#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<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int l[n], ans = 0;
for(int i=0; i<n; ++i) cin >> l[i];
sort(l, l+n, greater<int>());
for(int i=0; i<k; ++i) ans += l[i];
cout << ans << endl;
} | 1 | 4,760,040 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
ll poll(pair<ll,ll> s,pair<ll,ll> g){
return abs(s.first-g.first)+abs(s.second-g.second);
}
int main(){
ll h,w,d;
cin >> h >> w >> d;
map<ll,pair<ll,ll>> mp;
map<pair<int,int>,int> dp;
map<pair<int,int>... | 1 | 28,941,923 |
#include <bits/stdc++.h>
#define ull unsigned long long
#define mem 26
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int c=0;
char t[2] = {'1','0'};
for(int i=0;s[i];i++) {
if(s[i]!=t[i&1])
c++;
}
int mc = c;
t[0] = '0';t[1... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define inf 1e18
#define pi acos(-1.0)
#define mod 998244353
int main(void)
{
fastio;
string s;
cin >> s;
int o=0,e=0,l=s.size(),i,m;
for(i=0;i<l;i++)
{
if(i%2... | 1 | 42,112,795 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int height[10];
for(int i = 0; i < 10; i++)
cin >> height[i];
sort(height, height + 10);
cout << height[9] << endl;
cout << height[8] << endl;
cout << height[7] << endl;
} | #include<iostream>
using namespace std;
int main(){
int a[10];
int temp;
for(int m=0; m<10; m++)
{
cin >> a[m];
}
temp=a[0];
for(int i=0; i<10; i++)
{
for(int j=0; j<10;j++)
{
if(a[i] > a[j])
{
temp=a[i];
... | 1 | 6,447,456 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
constexpr int di[] = { 0, 1, 0, -1 }, dj[] = { 1, 0, -1, 0 };
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((... | #include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
int n,l,t;
int pos[100005];
int dir[100005];
ii fin[100005];
int norm(long long i,int j){
i%=j;
if (i<0) i+=j;
return i;
}
main(){
scanf("%d%d%d",&n,&l,&t);
for (int x=0;x<n;x++){
scanf("%d%d",&pos[x],&dir[x]);
}
for (int x=0;x<n;x++){
if... | 1 | 79,883,793 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a, max(b,c)) - min(a, min(b,c)) << endl;
} | #include<stdio.h>
int main(void){
int a1,a2,a3;
int max,min;
scanf("%d %d %d",&a1,&a2,&a3);
if(a1>=a2){
max=a1;
min=a2;
}else if(a1<=a2){
max=a2;
min=a1;
}
if(max<=a3){
max=a3;
}
if(min>=a3){
min=a3;
}
int ans=max-min;
printf("%d",ans);
return 0;
} | 1 | 56,159,378 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n, k;
cin >> ... | 1 | 89,939,741 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <list>
using namespace std;
#define N 22369620
#define X 50
struct hush
{
list <int> a;
};
int main(void)
{
int n, sum = 0, x, f[1000000] = { 0 }, cou = 0;
char str[7], acgt[13];
hush H[N / X];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
sum ... | #include<iostream>
#include<string>
#include<cstring>
using namespace std;
const int MAXT=1000003;
const int MAXN=1000010;
int n;
string s;
int head[1000003],nex[MAXN],to[MAXN],top,top1,ans[MAXN];
void input()
{
cin>>n;
memset(head,-1,sizeof(head));
memset(nex,-1,sizeof(nex));
}
int jisuan(char c)
{
if(c=='A') retu... | 1 | 47,616,310 |
#include <stdio.h>
#include <string.h>
int main()
{
char s[1000000];
long long int i, j, p = 0, a, k;
scanf("%s",s);
a = strlen(s);
for (i = 0; i < a; i++)
{
p = p + (s[i] - '0');
p = p % 9;
}
if (p % 9 == 0)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 1 | 8,706,039 |
#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() {
int n, k; cin >> n >> k;
int r, s, p; cin >> r >> s >> p;
string t; cin >... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool c... | 1 | 47,063,932 |
#include<bits/stdc++.h>
using namespace std;
#define RI register int
int read() {
int q=0;char ch=' ';
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') q=q*10+ch-'0',ch=getchar();
return q;
}
typedef long long LL;
const int N=100005,M=200005;
int n,m,tot,js,k1,k2,k3;LL ans;
int h[N],ne[M<<1],to[M<<1],col... | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | 1 | 56,243,888 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const ll INF = 1061109567;
const double EPS = 1e-10;
int main(){
int a,b;
cin>>a>>b;
int c=a+b;
if(c%3==0||a%3==0||b%3==0){
cout<<"Possible"<<endl;
}else{
cout<<"Impossible"<<endl;
}
... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
... | 1 | 7,891,332 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i) cin >> a[i];
sort(a.begin(), a.end());
if (a.back() == a[0]) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define pll pai... | 1 | 96,258,457 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>
#include <set>
using namespace std;
using ll = long long;
typede... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 1 | 85,591,520 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main() {
ios
#ifndef ONLINE_JUDGE
in;
out;
#endif
int n;
cin>>n;
... | 1 | 15,645,475 |
#include <iostream>
using namespace std;
int main () {
int x ,i;
cin >> x;
i = 0;
while (x>0) {
i=i+1;
cout << "Case " << i << ": " << x << endl;
cin >> x;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int i=0;
int x;
while(1){
cin>>x;
if(x==0) break;
i++;
cout<<"Case"<<" "<<i<<":"<<" "<<x<<endl;
}
return 0;
} | 1 | 4,975,298 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge {
int to;
ll cost;
};
using Graph = vector<vector<Edge>>;
vector<ll> dist;
void bfs(const Graph &G, int s) {
const ll INF = 1e15;
dist.assign((int)G.size(), INF);
queue<int> que;
que.emplace(s);
dist[s] = 0... | #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 rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | 1 | 45,143,257 |
#include <iostream>
#include <stack>
using namespace std;
int main(){
int n;
stack <int> inp;
while(std::cin >> n){
if(n != 0){
inp.push(n);
} else {
std::cout << inp.top() << std::endl;
inp.pop();
}
}
} | #include <iostream>
#include <stack>
#include <cstdio>
using namespace std;
int main(){
stack<int> st;
int a;
while(cin>>a){
if(a)st.push(a);
else {printf("%d\n",st.top());
st.pop();
}
}
return 0;
} | 1 | 78,738,876 |
#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++)
typedef int64_t Int;
Int power(Int a, Int n){
Int MOD = 1e9+7;
if(a == 0) return 0;
if(n == 0) return 1;
Int res = 1;
while(n > 0){
if(n %... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | 1 | 77,807,498 |
#include<bits/stdc++.h>
#define rep(i,x) for(int i=0; i<x; i++)
typedef long long ll;
using namespace std;
int main(){
int h1,m1,h2,m2, k;
cin >> h1>>m1>> h2>>m2>>k;
int cost = (h2*60+m2) - (h1*60+m1);
int ans = max(0, cost-k);
cout << ans <<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int t;
if(a == c)
... | 1 | 2,035,543 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <iostream>
using namespace std;
void ABC130(void);
void ABC131(void);
void ABC132(void);
void ABC133(void);
void ABC134(void);
void ABC135(void);
void ABC136(void);
void ABC137(void);
void ABC138(void);
void ABC139(void);
int main(void){
ABC139();
}
void ABC139(){
int i,n=0;
string s,t;
cin>>s>... | 1 | 2,511,106 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
int main(){
ll n,k,x,y; cin>>n>>k>>x>>y;
if(n<=k)cout<<n*x<<endl;
else cout<<(n-k)*y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize ios::sync_with_stdio(0); cin.tie(0);
#define PI acos(-1.0)
#define pb push_back
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define RESET(a, b) memset(a, b, sizeof(a))
#define pii pair <int, int>
#de... | 1 | 45,796,845 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000000
int main(){
int N,K;
cin>>N>>K;
vector<long long> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
vector<long long> S(N+1,0),S_p(N+1,0);
for(int i=0;i<N;i++){
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56... | 1 | 65,107,449 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using P = pair<int, int>;
int main(){
ll n,m;
cin >> n >> m;
ll out;
if(n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
int main() {
ll N, M;
cin >> N >> M;
cout << abs((N - 2) * (M - 2)) << endl;
} | 1 | 42,111,699 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <iostream>
#include <cstdio>
int main() {
int x1, y1;
std::cin >> x1 >> y1;
int x2, y2;
std::cin >> x2 >> y2;
int x_offset = x2 - x1;
int y_offset = y2 - y1;
int x3 = x2 - y_offset, y3 = y2 + x_offset;
int x4 = x1 - y_offset, y4 = y1 + x_offset;
printf("%d %d %d %d\n", x3, y3, x4, y4);
retu... | 1 | 29,005,750 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
double c;
int d;
cin >> a >> b;
c = (a + b) / 2.0;
d = int(c);
if (c == d)
{
cout << d << endl;
}
else
{
cout << d + 1 << endl;
}
} | 1 | 3,804,027 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = long long;
int main() {
ll q, h, s, d, n; cin >> q >> h >> s >> d >> n;
ll c = min(q * 4, min(h * 2, s));
if (c * 2 <= d) cout << n * c << endl;
else cout << d * (n / 2) + c * (n % 2) << endl;
return 0... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
long Q,H,S,D;
long N;
long total=0;
cin>>Q>>H>>S>>D>>N;
total = (N/2)*min({8*Q,4*H,2*S,D})+(N%2)*min({4*Q,2*H,S});
cout<<total<<endl;
} | 1 | 88,641,249 |
#include <iostream>
using namespace std;
int main(){
int H , W;
int i, j;
while(1){
char fig1[301]={0};
char fig2[301]={0};
cin >> H >> W;
if(H==0 && W==0) break;
for(i=0 ; i<W ; i++){
fig1[i]='#';
}
fig2[0]='#';
fig2[W-1]='#';
for(i=1 ; i<W-1 ; i++){
fig2[i]='.';
}
cout << fig1 << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, i;
string topAndBottom, middleRow, middle;
while (true) {
topAndBottom = "";
middleRow = "";
middle = "";
cin >> H >> W;
if (H == 0 && W == 0)break;
for (i = 0; i < W; i++)topAndBottom += '#';
topAndBottom += '\n';
midd... | 1 | 52,790,124 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 1000000007;
ll modpow(ll x, ll n){
if(n == 0) return (ll)1;
if(n % 2 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll pow(ll a, ll b, ll c)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
{
res *= a;
res %= c;
}
a *= a;
a %= c;
b >>= 1;
}
return res;
}
main()
{
ll n, k;
cin... | 1 | 56,353,282 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e10 + 10;;
unsigned long long fac[1000010];
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long lon... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
return (a.second<b.seco... | 1 | 26,030,170 |
#include<bits/stdc++.h>
using namespace std;
int n, deg[101000];
vector<int>G[101000];
queue<int>q;
int main(){
cin.tie(0); int x,y;
cin>>n;
for (int i=n-1;i--;){
cin>>x>>y; ++deg[x]; ++deg[y];
G[x].push_back(y); G[y].push_back(x);
}
for (int i=1;i<=n;++i) if (deg[i]==1) q.push(i);
for (;!q.empty();... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const int MAXN = 100000 + 20, MAXM = 20, MOD = 1000 * 1000 * 1000 ... | 1 | 87,087,713 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
string max_s1;
string max_s2;
int max_len = 0;
int max_n = 0;
map<string, int> m;
while( cin >> s ) {
m[s] ++;
if( m[s] > max_n ) {
max_n = m[s];
max_s1 = s;
}
if( s.size() > max_len ) {
max_len = s.size(... | #include <iostream>
#include <map>
#include <string>
int main() {
std::string word, longest, freqest;
std::map<std::string, int> table;
while (std::cin >> word) ++table[word];
longest = table.begin()->first;
freqest = table.begin()->first;
for (std::map<std::string, int>::iterator it = table.begin(); it != table.... | 1 | 71,735,889 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;
const int INF = (int) 1e9;
const ll LINF = (ll) 4e18;
const ll ... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll N = pow(10,10);
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;cin>>n>>k;
int ans=0;
if(k==1){
ans =0;
}
else{
ans = n-k;
}
cout<<ans<<endl;
} | 1 | 52,806,311 |
#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 { \... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i += 2) {
int cnt = 0;
rep... | 1 | 90,287,855 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
ll keta(ll a, ll b)
{
int cnt_a = 0, cnt_b = 0;
while (a)
{
cnt_a+... | #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() {
ll n, ans = 10000000;
string sa, sb;
cin >> n;
for (ll i = 1; i * i <= n; ++i) {
ll j = n / i;
if (i * j == n)... | 1 | 42,933,499 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int L = -1;
int sl = s.length();
int tl = t.length();
for (int i = 0; i < sl-tl+1; i++) {
for (int j = 0; j < tl; j++) {
if (s[i+j] != t[j] && s[i+j] != '?') break;
else if (j == tl-1) L = i;
}
}
... | 1 | 41,464,464 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <algorithm>
int main()
{
int S, W;
std::cin >> S >> W;
std::cout << ((W >= S) ? "unsafe" : "safe") << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | 1 | 42,753,852 |
#include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ins insert
#define fi first
#define se second
#define _max max_element
#define _min min_element
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 1 | 65,032,558 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
deque<int> q;
rep(i,n) {
int a;
cin >> a;
if(i%2==0) q.push_back(a);
else q.... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
vector<int> ans(n);
if(n%2==0)
{
int mid=n/2;
for(int i=0;i<n;i+=2)
{
... | 1 | 93,419,014 |
#include<bits/stdc++.h>
using namespace std;
#define deb(x) cerr<<"["#x<<" : "<<x<<" ]\n";
int main()
{
int rating;
cin >> rating;
if(rating < 1200) {
puts("ABC");
} else if(rating < 2800) {
puts("ARC");
} else {
puts("AGC");
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int r;
cin >> r;
if(r<1200){
cout << "ABC";
}else if(1200<=r&&r<2800){
cout << "ARC";
}else{
cout << "AGC"... | 1 | 51,428,808 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int main(){
int N,M,K;
cin>>N>>M>>K;
for(int i(0);i<=N;i++){
for(int j(0);j<=M;j++){
int k = i*j+(N-i)*(M-j);
if(k == K){
cout << "Yes" << endl;
retu... | 1 | 89,314,093 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
#define PI 3.141592653589793238462643383... | 1 | 95,129,619 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
char L[SIZE];
ll dp[2][SIZE];
int main(){
scanf("%s",L);
int len;
for(len = 0; ... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
template<class T>bool chm... | 1 | 1,977,632 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#define _USE_MATH_DEFINES
#include <math.h>
#include <iomanip>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
using... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
int Par[1... | 1 | 81,121 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
ll a[55];
l... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 1 | 10,005,424 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, M, K;
cin >> N >> M >> K;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= M; ++j) {
if ((M - j) * i + (N - i) * j == K) {
printf("Yes\n");
return 0;
}
}
}
printf("No\n");
} | 1 | 68,375,759 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int a, b;
cin >> a >> b;
if (a + b <= 16 && a <= 8 && b <= 8)
cout << "Yay!\n";
else
cout << ":(\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int a,b;
cin>>a>>b;
if(a==b || abs(a-b)==1 || abs(b-a)==1){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<endl;
}
} | 1 | 49,471,839 |
#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 pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #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 | 18,663,365 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,temp;
cin>>n>>k;
temp=n;
while(n--){
int a[n];
cin>>a[n];
}
cout<<ceil((double)(temp-1)/(k-1));
} | #include<iostream>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
for(int i = 0; i < n; i++){
int a;
cin >> a;
}
if((n-1) % (k-1) != 0){
cout << ((n-1) / (k-1)) + 1<< endl;
}
else{
cout << (n-1) / (k-1) << endl;
}
return 0;
} | 1 | 96,828,246 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
bool is... | #pragma region header
#define _GLIBCXX_DEBUG
#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>... | 1 | 50,304,814 |
#include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(... | #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define range(i,l,h) for(int i=l;i<h;i++)
#define endl '\n'
#define I INT_MAX
#define L INT_MIN
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vi vector<int>... | 1 | 78,750,622 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make... | 1 | 97,246,296 |
#include <iostream>
#include <string>
#include <ctype.h>
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
string S;
getline(cin, S);
for (int i = 0; i < S.length(); i++) {
if (islower(S[i]))
S[i] = toupper(S[i]);
else
S[i] = tolower(S[i]);
}
cout << S << endl;
} | #include <cctype>
#include <string>
#include <iostream>
using namespace std;
int main()
{
string str;
getline(cin, str);
for(auto c : str) {
if(isalpha(c))
cout << (char) (isupper(c) ? tolower(c) : toupper(c));
else
cout << c;
}
cout << endl;
return 0;
} | 1 | 53,077,268 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool cek(string s, int n){
if(n%2) return false;
if(s.substr(0, n/2)==s.substr(n/2, n/2)) return true;
return false;
}
int main(){
cin>>s;
n=s.size();
s.erase(n-1, 1);
n--;
while(!cek(s, n)){
s.erase(n-1, 1);
n--;
}
cout<<n<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = 0;
for(int i = s.size()-1; ; i = s.size()-1) {
s.erase(i,1);
for(int j = 0; j < s.size()/2; j++) {
if(s.size() % 2 != 0) {
flag = 0;
... | 1 | 54,506,146 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define printYes() cout << "Yes" << endl;
#define printNo() cout << "No" << endl;
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int N;
cin >> N;
vector<pair<pair<int, int>, pair<int, str... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
int c=0;
vector<pair<int,int>> a(n);
v... | 1 | 74,786,165 |
#include <bits/stdc++.h>
#define FOR(i, c) for (int i = 0; i < c; i++)
#define MOD 1000000007
using namespace std;
int cb(int n, int i) {
int res = 1;
for (int j = 0; j < i; j++) {
res = res*(n-j)/(j+1);
}
return res;
}
int main() {
int n , m;
cin >> n >> m;
cout << cb(m, 2) + cb(n, 2) << endl;
ret... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,m;
cin>>n>>m;
n=(n*(n-1))/2;
m=(m*(m-1))/2;
cout<<n+m;
} | 1 | 63,415,650 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int time[3],p,q,r;
cin>>p>>q>>r;
time[0]=p;
time[1]=q;
time[2]=r;
sort(time,time+3);
cout<<time[0]+time[1]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
/*
if( a < 6 ){
cout << 0 << endl;
} else if (a < 13){
cout << b / 2 << endl;
... | 1 | 14,569,237 |
#include <iostream>
#include <iomanip>
#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<vector>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define INF 1000000000000
typedef long long ll;
int main() {
int n, one, ten, ... | 1 | 19,598,493 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int temp;
long long ans = 0;
for (int i = 1; i < n; ++i) {
temp = sqrt(n - i) + 1;
for (int j = 1; j < temp; ++j) {
if ((n - i) % j == 0) {
ans += 2;
if ((n ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fto(i, s, e) for (int i = (s); i <= (e); ++i)
#define fto1(i, s, e) for (int i = (s); i < (e); ++i)
#define fdto(i, s, e) for (int i = (s); i >= (e); --i)
#define fit(it, a) for (auto it = (a).begi... | 1 | 47,412,034 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace st... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
typedef long long LL;
int read()
{
int x=0,flag=1;
char c=getchar ();
while((c>'9' || c<'0') && c!='-') c=getchar();
if(c=='-') flag=0,c=getchar();
... | 1 | 11,180,517 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int64_t i = 0; i < n; i++)
#define REPR(i, n) for(int64_t i = n; i >= 0; i--)
#define FOR(i, m, n) for(int64_t i = m; i < n; i++)
#define FORR(i, m, n) for(int64_t i = m; i >= n; i--)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template<typ... | #include <bits/stdc++.h>
using namespace std;
long long f(long long yoko, long long tate) {
long long y = yoko, t = tate;
if (y < t) swap(y, t);
if (y % t == 0) {
return 2LL * y - t;
} else {
return f(y % t, t - y % t) + 2LL * y;
}
}
int main() {
long long n, x;
cin >> n >> ... | 1 | 86,126,321 |
#include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << en... | 1 | 100,748,907 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
using ll = long long;
using namespace std;
const ll INF = 10000000000000000;
const ll mod = 100000... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
wh... | 1 | 96,909,249 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string n;
while(cin >> n){
if(n == "#") break;
string QWERTY[2] = {"yuiophjklnm","qwertasdfgzxcvb"};
int judge[32] = {0};
int cnt = 0, count = 0;
for(int i = 0; i < (int)n.size(); i++){
for(int j = 0; j < (int)QWERTY[0].size(); j++)... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char str[33];
char l[15] = {'q', 'w', 'e', 'r', 't', 'a', 's', 'd', 'f', 'g', 'z', 'x', 'c', 'v', 'b'};
char r[11] = {'y', 'u', 'i', 'o', 'p', 'h', 'j', 'k', 'l', 'n', 'm'};
while(1){
cin >> str; if(str[0] == '#') break;
int counter = 0;
... | 1 | 15,541,984 |
#include <iostream>
using namespace std;
int main(){
int n;
int max;
int min;
int y[20] = { 0 };
n = 1;
int j = 0;
while (1){
cin >> n;
if (n == 0) break;
max = 0;
min = 1000;
for (int i = 0; i < n; i++){
int x[1000] = { 0 };
cin >> x[i];
if (max < x[i]) max = x[i];
if (min > x[i... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
int n;
while(cin>>n, n){
vector<int> v(n);
for(int i=0; i<n; i++)
cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for(int i=1; i<n-1; ... | 1 | 92,560,359 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,sto... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a=0;
string s;
cin>>s;
int n=s.size();
for(int i=0;i<n;i++){
if(s.at(i)!=s.at(n-1-i)){a=1;
cout<<"No"<<endl;
break;}
}
if(a==0){for(int i=0;i<=(n-3)/2;i++){
if(s.at(i)!=s.at(((n-3)/2)-i)){... | 1 | 28,154,162 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
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;
#define forn(i, n) for (int (i) = 0; (i) !... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 1 | 9,100,037 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x,n,c=0;
cin>>n;
int a[n+1]={};
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
if(a[a[i]]==i)c++;
}
co... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | 1 | 35,216,791 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,i,len1,h,t,cnt=0,cnt1=0,x,m,flag=0,k,h1=0,h2=0,od=0,ev=0,y,l;
double w;
cin>>n>>l;
ll a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=1;i<n;i++)
{
if(a[i]+a[i-1]>=l)
{
len1... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n"
#define X first
#define Y second
#define pii pair<int,int>
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define read freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout)
const in... | 1 | 35,752,927 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int f(int X) {
int cnt = 0;
for(int i = X/4*4; i <= X; i++) {
cnt^=i;
}
return cnt;
}
signed main() {
int A... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = unsigned long long;
ll f(ll x) {
x++;
ll res = 0;
if ((x/2) % 2 != 0) res += 1;
ll order = 1;
while (true) {
order++;
ll y = ((1ULL)<<order);
ll r = x%y;
y/=2;
i... | 1 | 87,429,040 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int sum = 0;
vector<int> A(N);
rep(i,0,N-1)
{
cin >> A[i];
sum += A[i];
}
sort(begin(A), end(A), greater<int>());
double required = sum / 4.0 / M;
bool ok = true;
... | 1 | 70,538,259 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
string s;
cin >> s;
int n = s.size();
bool ans = false;
rep(i, n + 1) {
... | 1 | 15,145,276 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std ;
int main(){
int n , i , s ;
string str ;
while( 1 ){
cin >> str ;
int num = 0 ;
if( str == "0" ) break ;
for( i=0 ; i<str.size() ; i++ ){
n = str[i] - '0' ;
num += n ;
}
cout << num << endl ;
}
} | #include<cstdio>
#include<cstring>
int main(){
char X[10000];
while(1){
int i,y=0;
scanf("%s",X);
if((X[0] == '0')&&(X[1] == '\0')) break;
for(i=0; i<10000; i++){
if(X[i] == '\0') break;
y += X[i] - '0';
}
printf("%d\n",y);
}
return 0;
} | 1 | 5,248,211 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string ans = "No";
cin >> N;
for (int i=0;i<26;i++) {
for (int j=0;j<15;j++) {
if (4 * i + 7 * j == N) {
ans = "Yes";
break;
}
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Mc = N/4+1;
int Md = N/7+1;
for(int i=0;i<Mc;i++){
for(int j=0;j<Md;j++){
if(i*4+j*7 == N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | 1 | 78,625,077 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int lis(const vector<int>& A) {
int n = A.size();
vector<int> L(n, 0);
L[0] = A[0];
int length = 1;
for (int i = 1; i < n; i++) {
if (L[length - 1] < A[i])
L[length++] = A[i];
else
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define MAX_P 100000
int a[MAX_P];
int P;
int getLIS(){
int dp[MAX_P];
fill(dp, dp + P, INT_MAX);
rep(i,P) *lower_bound(dp, dp+P, a[i]) = a[i];
return lower_bound(dp, dp+P, INT_MAX) - dp;
}
int main(void){
cin >> P;
rep(i,P)... | 1 | 38,083,462 |
#include<bits/stdc++.h>
using namespace std;
int sum_of_digits(int num)
{
int sum = 0;
while (num > 0)
{
sum += num%10;
num /= 10;
}
return sum;
}
int main()
{
int n,a,b; cin >>n>>a>>b;
int ans = 0;
for (int i = 1; i <= n; ++i)
{
int x = sum_of_digits(i);
if (a <= x && x <= b)
ans += i;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int define(int data){
int ans=0;
for (int i=0;i<5;i++){
ans += data % 10;
data /= 10;
}
return ans;
}
int main() {
int N;
int A,B;
int ans = 0;
cin >>N>>A>>B;
for (int i=1;i <= N ;i++){
int norm = 0;
norm = define(i);
if(A <= norm && ... | 1 | 92,947,509 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | 1 | 22,935,683 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | #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 a, b, c;
cin >> a >> b >>c;
int amari=a%b;
if (amari==0) {
cout << "NO" << endl;
return 0;
} else {
rep(i,b) {
... | 1 | 19,979,256 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.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()
{
double percent = 0.0... | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main() {
int n, k;
cin >> n >> k;
auto toss = vector<double>(n);
for (auto t = 0; t < n; ++t) {
auto first = t + ... | 1 | 7,767,067 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 1 | 70,335,397 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int d = a / b;
int r = a%b;
double f = a*1.000000 / b*1.000000;
cout << d << " " << r << " " << fixed << setprecision(5) << f << endl;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a, b;
double c, d;
cin >> a >> b;
c = a;
d = b;
printf("%d %d %.8lf\n", a/b, a%b, c/d);
} | 1 | 80,785,438 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
string S[55];
ll T[55];
int main() {
ll N;
cin... | #include <iostream>
#include<vector>
using namespace std;
int main()
{
int N;
cin >> N;
vector<string> S;
vector<int> T;
for (int i = 0; i < N; i++) {
string s;
int t;
cin >> s >> t;
S.push_back(s);
T.push_back(t);
}
string X;
cin >> X;
bool flag = false;
int total = 0;
for (int i = 0; i < N; i++) ... | 1 | 80,056,504 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#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(... | # include <bits/stdc++.h>
using namespace std;
using msi = map<string, int>;
int main() {
string s, t;
cin >> s >> t;
int a, b;
cin >> a >> b;
msi mp;
mp[s] = a;
mp[t] = b;
string u;
cin >> u;
mp[u]--;
printf("%d %d\n", mp[s], mp[t]);
return 0;
} | 1 | 14,323,149 |
#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;
vector<int> p(n), q(n);
rep(i, n) cin >> p.at(i);
rep(i, n) cin >> q.at(i);
vector<int> a(n);
... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> a(n), b(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
}
if(a > b) swap(a, b);
int ans = 0;
do {
if(a == b) break;
... | 1 | 59,023,831 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int left = 0, right = N - 1;
string ls, rs;
cout << left << endl;
cin >> ls;
if(ls == "Vacant") return 0;
cout << right << endl;
cin >> rs;
if(rs == "Vacant") return 0;
while(true) {
int mid = (le... | #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... | 1 | 16,141,345 |
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof a);
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef double db;
const db EPS = 1e-9;
using namespace std;
void dbg() {cout << "... | #include <iostream>
#include <iomanip>
#include <algorithm>
#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>
#include <numeric>
#include... | 1 | 26,933,024 |
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> cand({1, 2, 4, 8, 16, 32, 64});
cout << *(lower_bound(cand.begin(), cand.end(), N + 1) - 1) << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
solve(N);
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 1 | 93,201,213 |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int x,a,b;
cin >> x >> a >> b;
if(a>=b) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <typename T>
bool PN(T x){ if (x <= 1) return false; if (x == 2) return true; for (int i = 2; i < sqrt(x) + 1; i++) if (x % i == 0) return false; return true;}
const ll MOD = 1e9+7;
long long Comb(int n, int i){long long ans = 1; if(i == 0 || i... | 1 | 58,657,113 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
bool eval(string & s) {
int n=s.size();
for (int i=0; i<n/2; ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){
string s;
cin >> s;
int n = s.si... | 1 | 20,260,443 |
#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;
}
}
else
{
for(int i=0;i<a;i++)
{
cout<<b;
}
}
cout<<"\n";
return 0;} | #include<iostream>
using namespace std;
typedef long long ll;
const int N = 2000006;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a,b;
cin>>a>>b;
if( a < b){
for(int i=0;i<b;i++)cout<<a;
}else{
for(int i=0;i<a;i++)cout<<b;
}
return 0;
} | 1 | 94,997,560 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(N-1-i)){
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < (N-1)/2; i++) {
if (S.at(i) != S.at((N-1)/2 -1-i)){
cout << "No" <... | #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
void solve() {
string str; cin >> str;
bool b1= 1, b2= 1;
int n= str.size();
for (int i= 0; i< n/ 2; i++) {
if (... | 1 | 84,525,151 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int gcds(vector<int> as) {
int ans = as[0];
for (int i = 1; i < (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
#define MR 1000000
vector<ll> PN_chk(MR+1,1);
void init_eratosthenes(){
PN_chk[0]=0;PN_chk[1]=0;
for(int i=2;i<=sqrt(MR)+1;i++){
if(PN_chk[i]==1) {
for(int j=2;j<=MR/i;j++){
... | 1 | 20,706,199 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct UnionFind {
int *par, *rk;
UnionFind(int maxIndex) {
par = new int[maxIndex + 1];
rk = new int[maxIndex + 1];
for (int i = 0; i <= maxIndex; i++) {
par[i] = i;
rk[i] = 0;
}
}
int find(int a) {
if (par[a] =... | #include<iostream>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define MAX 10000
class Data
{
public:
Data* parent = this;
int height = 1;
void Find(Data* other)
{
Data* temp = this;
Data* temp_other = other;
while (1)
{
if (temp == temp->paren... | 1 | 45,540,114 |
#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() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
string ans = (s < t)... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
for (int i = 0; i < s.size() - 1; i++){
int min = i;
for (int j = i + 1; j < s.size(); j++){
if (s.at(j) < s.at(min)) {
min = j;
}
}
if (i != min){
char tem... | 1 | 52,372,913 |
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < n; i++)
#define ford(i, n) for (int i = n - 1; i > -1; i--)
#define forl(i, l, r) for (int i = l; i <= r; i++)
#define vc vector
#define f first
#define s second
#define pb(i) push_back(i)
#define mx(ar, n) (*max_element(ar, ar + n... | #include <bits/stdc++.h>
using namespace std;
bool a[1000000];
int main()
{
memset(a, true, sizeof(a));
for (int i = 2; i < 1000000; i += 1 + (i & 1)) {
if (!a[i]) continue;
for (int j = i*2; j < 1000000; j += i) a[j] = false;
}
int n;
while (~scanf("%d", &n)) {
int cnt = 0;
... | 1 | 55,371,773 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]){
while(1){
string inputstr;
cin >> inputstr;
if(inputstr == "-")break;
int count;
cin >> count;
string s = inputstr;
for(int i= 0; i< count; i++){
int h;
cin >> h;
int len = s.length();
s = s.substr(h ... | #include <iostream>
#include <string>
using namespace std;
int main(){
int h,mh;
string m;
while(1){
cin >> m ;
if(m=="-")break;
cin >> h ;
for(int i=0;i<h;i++){
cin >> mh ;
m=m.substr(mh)+m.substr(0,mh);
}
cout << m << endl ;
}
return 0;
} | 1 | 2,776,175 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
string a;
cin>>a;
if(a[0]=='Y'){
if(a[1]=='A'){
if(a[2]=='K'){
if(a[3]=='I') cout<<"Yes";
else cout<<"No";
}
else cout<<"No";
}
else cout<<"No";
}
else cout<<"No";
cout<<"\n";
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 1 | 85,563,820 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n>=1800)
cout<<"1"<<endl;
else if(n>=1600)
cout<<"2"<<endl;
else if(n>=1400)
cout<<"3"<<endl;
else ... | #include<iostream>
using namespace std;
int main(){
int x;
cin>>x;
if(x>1799){
cout<<"1"<<endl;
}
else if(x>1599){
cout<<"2"<<endl;
}
else if(x>1399){
cout<<"3"<<endl;
}
else if(x>1199){
cout<<"4"<<endl;
}
else if(x>999){
cout<<"5"<<endl;
}
else if(x>799){
cout<<"6"<<endl;
}
else if(x>599){
... | 1 | 75,602,793 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.