code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int N;
cin >> N;
if(N<=111) cout << 111 << endl;
else if(N<=... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define f(i, n) for (int i = 0; i < n; ++i)
#define INF 1e9 + 5
using namespace std;
int solve() {
int n;
cin >> n;
vector<int> d;
int k = n;
while (k) {
d.push_back(k % 10);
k /= 10;
}
... | 1 | 12,780,259 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
string a,b;
cin >> a >> b;
for (int i=0;i<max(a.length(),b.length());i++) {
if (a.length()>i) cout << a[i];
if (b.length()>i) cout << b[i];
}
} | 1 | 40,877,428 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, s... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >> N >> A >> B;
if(A>B){
cout << 0 << endl;
return 0;
}
if(N == 1 && A-B != 0){
cout << 0 << endl;
return 0;
}
if(N == 1){
cout << 1 << endl;
return 0;
}
cout << (N-1)*(B-A)+A-B+1 << endl;
} | 1 | 35,931,328 |
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dh[8] = {... | 1 | 42,229,988 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26);
for (char c : s) {
++cnt[c - 'a'];
}
int res = 1;
const int md = 1e9 + 7;
for (int i = 0; i < 26; i++) {
res = (long long) res * (cnt[i] + 1) % md;
}
cout << (res + md - 1... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
const int64_t MOD = 1000000007;
int main() {
int N; string S;
cin >> N >> S;
int64_t ans = 0;
map<char, int> mp;
for(auto &t : S) {
int64_t tmp = 1;
for(char c = 'a'; c <= 'z'; ++c) {
... | 1 | 88,029,099 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
ll sigma(ll N){
return (N*(N+1))/2;
}
int main(){
ll N; cin >> N;
ll ans = 0;
for(int i = 1; i <= N; i++){
ll num = N / i;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int n,i,j;
cin>>n;
int sum=(n*(n+1))/2;
for(i=2;i<=n;i++)
{
for(j=i;j<=n;j+=i) sum+=(j);
}
cout<<sum;
} | 1 | 62,654,994 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
int n; cin >> n;
string s; cin >> s;
int l = s.size();
if(l>n){
for(int i=0;i<n;i++){
... | #include<iostream>
using namespace std;
int main()
{
string s, p = "";
int k;
cin >> k >> s;
if(s.size() <= k)
cout << s;
else
{
for(int i = 0; i < k; i++)
{
p = p + s[i];
}
cout << p << "...";
}
return 0;
} | 1 | 94,814,638 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'a':
case 'i':
case 'u':
case 'e':
case 'o':
cout << "vowel" << endl;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin >> a;
if((a.at(0)=='a')||(a.at(0)=='i')||(a.at(0)=='u')||(a.at(0)=='e')||(a.at(0)=='o'))
cout << "vowel";
else
cout << "consonant";
} | 1 | 28,417,424 |
#include<bits/stdc++.h>
using namespace std;
bool dp[4001][16001];
int x,y,tx,ty,ax[4001],ay[4001];
void dfsx(int t,int n){
if(dp[t][n+8000]) return;
if(t<tx){
dfsx(t+1,n+ax[t]);
dfsx(t+1,n-ax[t]);
}
dp[t][n+8000]=1;
}
void dfsy(int t,int n){
if(dp[t][n+8000]) return;
if(t<ty){
dfsy(t+1,n+ay[t]);
dfsy(t+1... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 8005;
vector<int> arr;
int dp[MAXN][2*MAXN];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
string str;
cin >> str;
arr.push_back(0);
for (int i = 0; i < (int)str.length(); i++) {
if (str[i] == 'T') arr.push_back(0);
else arr.back()++;
}
int N... | 1 | 49,152,498 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n][26]={};
rep(i,n){
string s;
cin >>s;
int g=s.size();
rep(r,g){
a[i][(int)s[r]-97]++;
}
}
rep(i,26){
int an... | #include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
... | 1 | 5,479,978 |
#include "bits/stdc++.h"
using namespace std;
#define Fast_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
const int m = 1e9 + 7;
vector<vector<int>> adj;
vector<vector<int>> dp;
int dfs(int cur, int par, int col) {
if (~dp[cur][col])
return dp[cur][col];
int ans = 1;
if (co... | #include<bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define M1 (ll)1000000007
#define M2 (ll)998244353
#define Pi 3.141592653
#define exp 2.71828
#define ll long long
#define ull unsigned long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define di dequ... | 1 | 91,400,972 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int tot = 0;
for (char c : n) tot += (c - '0');
if (tot % 9 == 0) cout << "Yes\n";
else cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int sum=0;
for(int i=0;i<S.size();i++){
int A=S.at(i)-'0';
sum+=A;
}
if(sum%9==0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 26,356,101 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int n,now=1,ans=0;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
for(int i=0;i<n;i++){
if(a[i]==now){
now++;
}
else ans++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, a;
cin >> n;
vector<int> as(n);
rep(i, n) {
cin >> a;
a--;
as[i] = a;
}
int id = 0;
int ans = 0;
rep(i, n) {
if (as[i] != id) {
ans++;
} ... | 1 | 23,651,250 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int N, lim... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,d,h=0,MOD=998244353,ans=1; cin>>N>>d;
if(d!=0){cout<<0<<endl; return 0;}
vector<ll>D(N);
for(int i=1; i<N; i++){cin>>d; D[d]++; h=max(h,d);}
if(D[0]!=0){cout<<0<<endl; return 0;}
for(int i=1; i<h; i++){
for(int j=0; j<D[i... | 1 | 91,566,152 |
#include <iostream>
using namespace std;
int main()
{
int n,m;
cin>>n;
cin>>m;
n=n%500;
if(n>m)
cout<<"No";
else
cout<<"Yes";
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_std... | 1 | 29,062,449 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> map(H, vector<char>(W, 'a'));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> map.at(i).at(j);
}
}
vector<vector<char>> mapA(H, vector<char>(W, 'a'));
int height = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
rep(i,H) cin >> a[i];
vector<bool> row(H);
vector<bool> column(W);
rep(i, H) {
rep(j, W) {
if (a[i][j]=='#') {
... | 1 | 43,803,033 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
cin >> n;
int d[n];
rep(i,n)cin >> d[i];
sort(d,d+n);
if(d[n/2-1]==d[n/2]){
cout << 0 << endl;
return 0;
}else{
cout << d[n/2]-d[n/2-1] << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());... | 1 | 74,585,579 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
vector<int> in;
rep(i, 3) {
int t;
cin >> t;
in.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 1 | 86,211,113 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
for(int i = 0; i < n; i++){
string current = s.substr(0, n - i - 1);
int newsize = current.size();
if(newsize%2 == 0){
int mid = newsize/2;
string first = curre... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
bool isOK(string &s){
int n = s.size()/2;
for(int i = 0;i < n;i++){
if(s... | 1 | 77,514,888 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int M,N;
cin>>M>>N;
vector<pair<pair<int,int>,int>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first.second>>A[i].first.first;
A[i].second=i;
}
sort(A.begin(),A.end());
vector<int> B(M+1,1),C(N),D(N);
for(int i=0;i<N;i++){
C[A[i].second]=B... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 1 | 33,966,633 |
#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<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n, a, b; cin >> n >> a >> b;
if(b < a)cout << 0;
else if(n == 1 && b != a){
cout << 0;
}else if(n == 1 && b == a){
cout << 1;
}else{
cout << (n - 2) * b - (n - 2) * a + 1;
}
return 0;
} | 1 | 93,499,668 |
#include <iostream>
using namespace std;
int main(void){
int H,W;
while(1){
cin>> H >> W;
if(H==0 && W==0){
break;
}else{
for(int i=1;i<=H;i++){
for(int j=1;j<=W;j++){
if(i==1||j==1||i==H||j==W){
cout<<"#... | #include<iostream>
int main(void){
int H, W;
while(1){
std::cin >> H >> W;
if (H == 0 && W ==0) break;
for (int i = 1; i <= H; i++) {
if (i == 1 || i == H){
for (int j = 1; j <= W; j++) {
std::cout << '#';
}
std::cout << std::endl;
} else {
for (int j = 1; j <= W; j++) {
if (j ... | 1 | 11,823,999 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char ch;
cin>>ch;
if(ch-65>=0 && ch-65<26) cout<<'A';
else cout<<'a';
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char c;
char ans;
cin >> c;
if('a'<=c && c<='z'){
cout << 'a' << endl;
}else{
cout << 'A' << endl;
}
} | 1 | 38,362,549 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 1000000000;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int X;
cin>>X;
string ans = "0";
for(int i = 0; i <= X;i++){
if(100*i <= X && X <= 105*i)ans = "1";
}
cout<<ans<<endl;
} | 1 | 31,015,377 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | #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 | 6,602,760 |
#include <iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n,k;
int sum=0;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
for(int i=0;i<k;i++)
{
sum=sum+arr[i];
... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } retu... | 1 | 73,722,010 |
#include<bits/stdc++.h>
int main(){
int64_t n,m; std::cin>>n>>m;
std::cout<<std::abs((n-2)*(m-2));
} | #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... | 1 | 77,231,208 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <string>
#include <bitset>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef do... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loo... | 1 | 68,514,325 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N;
cin >> N;
int max = 0;
int count = 0;
for(int i = 0; i < N; i++){
int H;
cin >> H;
if(H >= max){
max = H;
count++;
}
}
cout <... | 1 | 87,162,644 |
#include <iostream>
using namespace std;
int main(){
int mon;
while(cin >> mon,mon){
int sum = 0;
mon = 1000 - mon;
sum += mon / 500;
mon %= 500;
sum += mon / 100;
mon %= 100;
sum += mon / 50;
mon %= 50;
sum += mon / 10;
mon %= 10;
sum += mon / 5;
mon %= 5;
cout <... | #include<iostream>
using namespace std;
#include<stdio.h>
int main(){
for(;;){
int a,b=0,c=0;
cin>>a;
if(a==0)break;
b=1000-a;
c=(b/500)+((b%500)/100)+(((b%500)%100)/50)+((((b%500)%100)%50)/10)+(((((b%500)%100)%50)%10)/5)+(((((b%500)%100)%50)%10)%5);
cout<<c<<endl;
}
return 0;
} | 1 | 49,511,221 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=2e9+7;
const ll longinf=1LL<<62;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | #include <bits/stdc++.h>
using namespace std;
const long longN = 1e2+5;
long long n;
long long k;
vector < pair < long long, long long> > xy;
long long getA(long long a , long long b , long long c , long long d){
long long X1 = min( min(xy[a].first , xy[b].first) , min(xy[c].first , xy[d].first));
long long X2 ... | 1 | 93,508,503 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
using namespace std;
typedef long long int lli;
const long long int MaxN=3005;
const lli mod=1e9+7;
#define fst first
#define snd second
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 1; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll n; cin >> n;
n--;
ll ans = n * (n + 1) / 2;
cout << ans << endl;
return 0;
} | 1 | 30,923,604 |
#include <bits/stdc++.h>
using namespace std;
char c;
int main(){
cin >> c;
if(c-'a'>=0){
cout << 'a';
}
else{
cout << 'A';
}
} | #include <cstdio>
using namespace std;
int main(int argc, char** argv)
{
char a = getchar();
if('a' <= a && a <= 'z') putchar('a');
else putchar('A');
return 0;
} | 1 | 29,944,599 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
ll n, k; cin >> n >> k;
k--;
vector<pair<ll, ll> > A;
loop(i,0,n) {
ll a, b; cin >> a >> b;
A.emplace_back(a, b);
}
sort(A.begin(), A.end());
... | 1 | 37,137,341 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t l0=2,l1=1,l2;
if ( N == 1 ) {
cout << l1;
} else {
for (int i = 2; i <= N; i++) {
l2 = l1 + l0;
l0 = l1;
l1 = l2;
}
cout << l2;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | 1 | 33,474,169 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i... | 1 | 37,616,205 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int>p(100);
vector<int>q(101);
for(int i=0;i<n;i++){
cin>>p[i];
q[p[i]]++;
}
for(int i=0;i<1000;i++){
... | #include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | 1 | 22,884,563 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 1 | 9,144,044 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int a, b;
cin >> a >> b;
if ( (a == 1 && b == 2) ||(a == 2 && b == 1)) cout << 3 << endl;
else if((a== 2 && b == 3)||(a== 3&& b==2))cout << 1 << endl;
else cout << 2 << endl;
} | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | 1 | 96,599,541 |
#include <iostream>
int main(int argc, char *argv[]) {
int a, b;
char o;
std::cin >> a >> b;
if (a > b) std::cout << "a > b" << std::endl;
else if (a < b) std::cout << "a < b" << std::endl;
else std::cout << "a == b" << std::endl;
return 0;
} | #include <iostream>
int main(){
int a,b;
std::cin >> a >> b;
std::cout << "a ";
if(a==b){
std::cout << "==";
}
else if(a<b){
std::cout << "<";
}
else{
std::cout << ">";
}
std::cout << " b" << std::endl;
return 0;
} | 1 | 29,193,560 |
#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... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main()
{
long long Q = 0, H = 0, S = 0, D = 0;
long long N = 0;
cin >> Q >> H >> S >> D;
cin >> N;
long long... | 1 | 42,718,727 |
#include <iostream>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
using ll = long long;
using namespace std;
const ll mod = 1000000007;
int main() {
ll n,m;
cin >> n >> m;
ll a = min(n,m/2);
ll b = (m - 2 * a) / 4;
cout << a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 1 | 11,572,939 |
#include <iostream>
using namespace std;
int main() {
int n, *a;
int ans, sum;
while (1) {
cin >> n;
if (n == 0)
break;
a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ans = a[0];
for (int i = 0; i < n; i++) {
sum = a[i];
ans = max(ans, sum);
for (int j = i + 1; j < n; j++) {
... | #include <iostream>
#include <vector>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int N;
while(cin >> N && N) {
vector<int> v(N);
rep(i, N) cin >> v[i];
ll mx = -1<<29;
rep(i, N) {
ll sum = 0;
REP(j, i, N) {
... | 1 | 43,326,722 |
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="... | 1 | 9,777,208 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
int n,a,b;
int main(){
cin >> n >> a >> b;
if((a-b)%2)puts("Borys");
else puts("Alice");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define per(i,j,n) for(int i=(int)(j);(int)(n)<=i;i--)
#define int long long
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define mp... | 1 | 96,589,012 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
rep(i, 10) rep(j, 10) rep(k, 10) {
int cnt = 0;
rep(l, N) {
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < 1000; i++)
{
int d1 = i/100;
int d2 = (i%100)/10;
int d3 = i%10;
int sel = 0;
for (int i = 0; i < N; i++)
... | 1 | 4,923,704 |
#include<string>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int c,i,t;
int l1,l2;
int d;
int sum,sum1,sum2,hozonn;
char mozi[4]={'m','c','x','i'};
string siki1,siki2;
cin>>c;
while(c--){
cin>>siki1>>siki2;
l1=siki1.size();
l2=siki2.size();
d=1000;
t=0;
sum=0;
sum1=0;
s... | #include <bits/stdc++.h>
using namespace std;
int A[128];
char B[1001];
int conv(const string &a) {
int res = 0;
for(int i = 0; i < a.size(); ++i) {
int d = 1;
if(isdigit(a[i])) {
d = a[i++] - '0';
}
res += d * A[a[i]];
}
return res;
}
string conv(const int x) {
string res;
for(int i =... | 1 | 86,844,958 |
#include<iostream>
using namespace std;
int main(){
int a,b,n,r,c;
while(1){
cin>>a>>b;
if(a==0)break;
int route[b+1][a+1];
for(int i=0;i<b+1;i++)
for(int j=0;j<a+1;j++)
route[i][j]=0;
cin>>n;
while(n--){
cin>>r>>c;
route[c][r]=-1;
}
route[1][1]=1;
for(int i=1;... | #include <iostream>
using namespace std;
int dx,dy,x,y,n,count;
int road[20][20];
void check(int i,int j){
if(i>dx||j>dy)return;
if(i==dx&&j==dy){
count++;
return;
}
if(road[i][j]==-1)return;
check(i,j+1);
check(i+1,j);
return;
}
int main(){
while(1){
cin >>dx >>dy;
if(dx==0&&dy==0)break;
for(int i=1;... | 1 | 25,597,189 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
using namespace std;
int main()
{
string op;
int num;
priority_queue<int>pq;
while (cin >> op)
{
if (op == "end") break;
if (op == "insert")
{
cin >> num;
pq.push(num);
}
else if (op == "extract")
{
cout << ... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 2000001
int heap_size=0;
int key[N];
int parent(int i){
return i/2;
}
int leftc(int i){
return 2*i;
}
int rightc(int i){
return 2*i+1;
}
void maxHeapify(int i){
int l,r,largest;
int st;
l=leftc(i);
r=rig... | 1 | 54,652,181 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a==b)
{
cout << "Draw\n";
}
else if(b==1 || (a!=1 && a<b))
{
cout << "Bob\n";
}
else
{
cout << "Al... | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A==1)
{
if(B==1)
cout<<"Draw";
else cout<<"Alice";
}
else if(B==1)
{
if(A==1)
cout<<"Draw";
else cout<<"Bob";
}
else {
if(A>B)
cout... | 1 | 39,334,972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int ans1,ans2;
int main(void){
string s; cin>>s;
for(int i=0;i<s.size();i++){
if(i%2==0){
if(s[i]!='0'){
ans1++;
}
}else{
if(s[i]=='0'){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(string s){
int c1 = 0,c2 = 0;
char num1 = '0' ,num2 = '1';
for(int i=0;i<s.size();i++){
if(s.at(i) != num1) c1++;
if(num1 == '0'){
num1 = '1';
}else{
num1 = '0';
}
}
... | 1 | 92,990,216 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using ll = long long;
int main()
{
ll N;
std::cin >> N;
std::vector< ll > vl(2 * N, 0LL);
for (ll i = 0; i < 2 * N; i++) {
std::cin >> vl[i];
}
std::sort(vl.begin(), vl.end(), std::less<>());
ll ans = 0LL;
for (ll i = 0; i ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long int n,ans=0;
cin>>n;
n*=2;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n,greater<int>());
for(int i=0;i<n;i++)
{
if(i%2!=0)
ans+=a[i];
}
cout<<ans;... | 1 | 90,242,595 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; r... | #include <bits/stdc++.h>
using namespace std;
const int N=1e6;
char p[N];
int S[N],P[N],n;
int main()
{
scanf("%d",&n);
scanf("%s",p);
int i,j;
for(i=0;p[i];i++)
{
if(p[i]=='o') P[i+1]=0;
else P[i+1]=1;
}
P[n+1]=P[1];
for(i=0;i<8;i++)
{
S[0]=i&1;
S[1]=(i>>1)&1;
S[2]=(i>>2)&1;
for(j=2;j<=n+1;j++)
... | 1 | 68,209,206 |
#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 N, L, Q;
cin >> N;
vector<int> x(N);
rep(i, N) cin >> x[i];
x.push_back(2e9);
cin >> L >> Q;
vector<int> a(Q), b(Q);
rep(i, Q) {
cin >> a[i] >> b[i];
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return tr... | 1 | 72,586,728 |
#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);
string s; cin>>s;
deque<char> dq;
for(auto ch : s){
if(dq.empty() || dq.back() == ch)dq.pus... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
const int maxn = 1e5 + 10;
stack<bool> s;
string a;
int main() {
int ans = 0;
cin >> a;
int n = a.size();
for (int i = 0; i < n; i++) {
if (s.empty()) s.push(a[i] - '0');
else if (a[i] - '0' != s.top()) {
... | 1 | 80,630,209 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MAX_N 100
using namespace std;
typedef pair<int, int> P;
int main(){
long x, y;
cin >> x >> y;
long ans = 1;
while(x * (long)(pow(2, ans)) <= y) ans++;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
long long x;
long long y;
cin >> x >> y;
int counter = 1;
long long tmp = x;
while(1){
tmp = tmp * 2;
if(tmp > y) break;
else counter ++;
}
cout << counter << endl;
return 0;
} | 1 | 46,265,425 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
int d[N];
vector<int> G[N];
bool bipartite;
bool c[2];
int cnt;
int m;
int a[N];
int b[N];
int t[N];
long long ans;
void dfs(int u) {
++cnt;
for (int v : G[u]) {
if (d[v] == -1) d[v] = (d[u] ^ 1), c[d[v]] = 1, dfs(v);
else if (d[v] == d[u]... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get... | 1 | 66,616,997 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,h,w;
cin>>n>>h>>w;
int a,b,ans=0;
for (int i = 0; i < n; ++i)
{
cin>>a>>b;
if (h<=a&&w<=b)
{
++ans;
}
}
cout<<ans<<endl;
return 0;
} | 1 | 78,118,978 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 200010
typedef long long ll;
struct Edge{
int v,nxt;
}e[maxn<<1];
int head[maxn],cnt_e;
void add(int u,int v){
e[++cnt_e].v=v;
e[cnt_e].nxt=head[u];
head[u]=cnt_e;
}
int n;
ll fa[maxn];
void dfs(int x){
for(int i=head[x];i;i=e[i].nxt){
int v=e[i].v; if(v... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back... | 1 | 64,515,077 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long inf = numeric_limits<long long>::max();
int main()
{
... | #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 n;
cin >> n;
cout << 1110 - n << endl;
return 0;
} | 1 | 26,490,062 |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll a, b, k;
cin >> a >> b >> k;
for(int i = 0; i < k; i++){
if(i % 2){
b /= 2;
a += b;
}
else{
a /= 2;
b += a;
}
}
cout << a << " " << b << endl... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++)
{
if (i % 2)
{
if (B % 2)
B--;
A += B / 2;
B /= 2;
}
else
{
if (A % 2)
A--;
B += A / 2;
A /= 2;
}
}
cout << ... | 1 | 12,996,643 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main(){
ll A,B,K;
cin >> A >> B >> K;
rep(i,K){
if(i%2==0){
if(A%2==1) A--;
A/=2;
B+=A;
}
else{
if(B%2==1) B--;
B/=2;
A+=B;
}
}
cout << A << " " << ... | 1 | 68,379,506 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
if((n-1)%(k-1)==0){
cout << (n-1)/(k-1) << endl;
}
else{
cout << (n-1)/(k-1)+1 << endl;
}
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>arr;
while(n--){
int a;
cin>>a;
arr.push_back(1);
}
int ret = 0;
while(arr.size()){
ret++;
for(int i=0; i<k && arr.size(); i++) arr.pop_back();
if(arr.size()) arr.push_back(1);
}
cout<<ret;
} | 1 | 63,466,086 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 1 | 84,315,708 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll k[15];
ll p[15];
int main(void) {
int n, m;
cin >> n;
cin >> m;
vect... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using P =pair<int,int>;
int main(){
int n,m;cin>>n>>m;
vector<vector<int>>s(m);
rep(i,m){
int k;cin>>k;
s[i].resize(k);
rep(j,k){
cin>>s[i][j];
--s[i][j];
... | 1 | 47,857,524 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,x; cin>>n;
ll tot_a=0, tot_b=0;
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[i]<b[i]){
int diff=b[i]-a[i];
if(diff%2){
tot_a+=(diff+1)/2;
tot_b++;
}
else... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
int a[n],b[n];
rep(i,n) cin>>a[i];
rep(i,n) cin>>b[i];
ll cnt=0;
rep... | 1 | 37,021,202 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
bool isPrime(int n){
if(n==1||n==1){
return false;
}
for(int i=2;i<n;++i){
if(n%i==0){
return false;
}
}
return true;
}
int fact(int n){
int ans = 1;
for(int i = 1; i<= n; ++i){
ans *... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long k,a[]= {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};
cin>>k;
cout<<a[k-1]<<endl;
return 0;
} | 1 | 22,714,217 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
struct UnionFind{
public:
UnionFind(int n): _n(n), parent_or_size(n, -1){}
void unite(int a, int b){
int x = root(a), y = root(b);
if(x ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0;i < (int)(n);i++)
int N, M;
vector<int> p, r;
void init(int n) {
rep(i, n) {
p[i] = i;
r[i] = 0;
}
}
int parent(int x) {
if(p[x] == x) return x;
else return p[x] = parent(p[x]);
}
void unite(int x, int y) {
x = parent(x), y ... | 1 | 43,580,947 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
const ll MOD = 1000000007;
int main(){
int n, i;
cin >> n >> i;
co... | 1 | 84,011,593 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(n, i) for(ll i = 0; i < n; ++i)
const ll MOD = 1e9+7;
void solve(){
ll n, m; cin >> n >> m;
vector<bool> damaged(n+1, false);
rep(m, i) {
ll ta; cin >> ta;
damaged[ta] = true;
}
vector<ll> dp(n+1, 0);
dp[0] = 1;
if (!d... | #include <bits/stdc++.h>
using namespace std;
long long INF=1e9+7;
int main(){
int N,K; cin>>N>>K;
vector<long long>A(K);
vector<long long>count(100001);
count[0]=1;
count[1]=1;
for(int i=2;i<100001;i++){count[i]=count[i-1]+count[i-2];count[i]%=INF;}
for(int i=0;i<K;i++){
cin>>A[i];
if(i!=0)if(A[i... | 1 | 86,267,370 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=1e9+7;
int ... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 1 | 65,766,641 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0LL;
int mx;
cin >> mx;
for (int i = 1; i < n; ++i) {
int x;
cin >> x;
ans += max(0, mx - x);
mx = max(x, mx);
}
cout << ans << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define T ll t; cin>>t; while(t--)
#define mod 1000000007
#define inf 1000000000000000000
#define mem(name,val) memset(name,val,sizeof(name))
#define f(n) for(ll i=0;i<n;i++)
#define rep(i,a,n) for(ll i=a;i<n;i+... | 1 | 347,736 |
#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++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
long long ans=0;
if(abs(x)==abs(y))ans=0+(x==-y && x!=0)*1;
else if(x>y)
{
ans+=abs(abs(x)-abs(y))-(x>=0 && y<=0) +2 ;
}
else if(x<y)
{
ans+=abs(abs(y)-abs(x))+(x<0 && y>0);
}
cout<<ans<<endl;
return 0;
} | 1 | 65,736,438 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, x, first;
cin >> n >> x >> first;
int ret = abs(x - first);
for (int i = 1; i < n; i++) {
int a;
cin >> a;
ret = __gcd(ret, abs(x - a));
}
cout << ret << endl;
return 0... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define pi (acos(-1))
using namespace std;
int main()
{
unsigned ll n, x;
cin >> n >> ... | 1 | 41,910,900 |
#include<iostream>
using namespace std;
int num[11111]={0};
int main(){
int a,b,c;
int t=0;
cin >> a >> b >> c;
for(int i=a;i<=b;i++){
if(c%i==0)t++;
}
cout << t << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <string>
#include <string.h>
#include <cstdlib>
#include <iomanip>
#include <stdio.h>
using namespace std;
int main(){
int a,b,c,d=0;
scanf("%d %d %d\n",&a,&b,&c);
for(int i=a;i<=b;i++){
if(c%i==0)
d++;
... | 1 | 22,376,365 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool compare( pair<ll,ll> a , pair<ll,ll> b)
{
return (a.first - a.second) < (b.first - b.second);
}
int main()
{
ll n;
cin>>n;
ll a[n] , b[n];
ll suma = 0 , sumb = 0;
pair<ll , ll > arr[n];
set<ll> s;
for(int i=0;i<n;i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define PB push_back
#define MP make_pair
#define MEMSET(v,... | 1 | 21,472,026 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a) {
if (a % 2 == 0) return a / 2 * (a + 1);
return (a + 1) / 2 * a;
}
int main() {
ll a; cin >> a;
ll ans = 0;
for (int i = 1; i <= a; i ++) {
ans += f(a / i) * i;
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#include <fstream>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 ... | 1 | 7,763,140 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
rep(i,n) {
cin >> a[i];
mp[a[i]]++;
}
ll all = 0;
for (auto x : mp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0;i<n;i++)
int main(){
long long n; cin >> n;
vector<long long> A(n+1);
vector<long long> p(n+1,0);
rep(i,n){
cin >> A[i+1];
p[A[i+1]]++;
}
long long sum=0;
for(long long i=1;i<=n;i++){
long long num=p[i];
sum+=... | 1 | 71,083,330 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod;
ll powimod(ll x,ll n,ll mod){
ll res=1;
while(n){
if(n&1) res=(res*x)%mod;
x=(x*x)%mod;
n>>=1;
}
return res;
}
ll powi(ll x,ll n){
ll res=1;
while(n){
if(n&1) res*=x;
x*=x;
... | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,m;
cin>>n;
ll sum=0;
ll arr[n];
for(i=0;i<n;i++) cin>>arr[i];
for(i=0;i<n;i++) for(j=0;j<n;j++)
{
if(i!=j)
... | 1 | 12,849,312 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string yea = S.substr(0,4);
int year = stoi(yea);
string mont = S.substr(5,2);
int month = stoi(mont);
if(month <=4){
cout << "Heisei" << endl;
}
else{
cout << "TBD" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
char x, xx;
int y, m, d;
cin >> y >> x >> m >> xx >> d;
if(m<=4){
cout << "Heisei";
}
else
{
cout << "TBD";
}
} | 1 | 13,374,842 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long int ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, z, w;
cin >> n >> z >> w;
vector<int> v(n);
rep(i, n)
{
cin >> v[i];
}
if (n >... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | 1 | 82,881,835 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
vector <int> B(N - 1);
rep(i,N - 1) cin >> B[i];
vector <int> A(N);
A[0] = ... | 1 | 21,089,280 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
for(int i = 0; i < n; i = i + 2){... | 1 | 14,806,090 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a <= 10){
int ans = b+100*(10-a);
cout << ans << endl;
}
else{
cout << b <<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | 1 | 76,859,784 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using na... | #include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<math.h>
#include<unordered_map>
using namespace std;
using vec = vector<int>;
using mat = vector<vec>;
using lst = list<int>;
class Event
{
public:
int add;
string time;
Event(int a)
{
add = a;
cin... | 1 | 96,797,103 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int kaunto = 0;
cin >> a >> b;
for (int i = 0; i < 10000000; i++) {
if (a < b) {
cout << a;
kaunto++;
if (kaunto >= b) {
break;
}
}
if (a > b) {
cout << b;
kaunto++;
if (kaunto >= a... | 1 | 673,518 |
#include <bits/stdc++.h>
#define INF 2000000001
#define MAX 502
using namespace std;
int main()
{
int H;
int heap[MAX];
cin >> H;
for (int i = 0; i < MAX; i++) {
if (i >= 1 && i <= H)
cin >> heap[i];
else
heap[i] = INF;
}
for (int i = 1; i <= H; i++) {
cout << "node " << i << ": ";
cout << "key = " ... | #include <stdio.h>
int main(){
int n,a[1000];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++){
printf("node %d: key = %d,",i,a[i]);
if(i>1)printf(" parent key = %d,",a[i/2]);
if(i*2<=n)printf(" left key = %d,",a[i*2]);
if(i*2+... | 1 | 61,872,449 |
#include <bits/stdc++.h>
#define pb push_back
#define PQ priority_queue
#define make_unique(x) sort((x).begin(), (x).end()); (x).erase(unique((x).begin(), (x).end()), (x).end())
typedef long long ll;
typedef long double ld;
using namespace std;
const int mod = 1e9 + 7;
ll add(ll a, ll b) {
ll res = a + b;
if (r... | #include <bits/stdc++.h>
using namespace std;
const int N = 1337;
const int MOD = 1e9+7;
char B[N][N];
int dp[N][N];
int main(){
int h,w; cin >> h >> w;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
cin >> B[i][j];
}
}
dp[1][1] = 1;
for(int i = 1; i <= h; i++)... | 1 | 24,875,579 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
template <class It> string join(It i1, It i2)
{
ostringstream ss;
for (auto it = i1; it != i2; ++it)
ss << ((it == i1) ? "" : ", ") << (*... | 1 | 98,516,158 |
#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"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
char c;
cin >> c;
char ans = 'G';
... | 1 | 5,590,766 |
#include<cstdio>
#include<algorithm>
#define MAX_N 100000
using namespace std;
int numbers[MAX_N + 5], L[MAX_N + 5];
int main()
{
int n, i, length = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &numbers[i]);
}
L[0] = numbers[0];
for (i = 1; i < n; i++) {
if (numbers[... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
int n;
int a[100000];
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", a + i);
}
int dp[100000];
fill(dp, dp + n + 1, INF);
dp[0] = -1;
for(int i = 0; i < n; i++){
int* ptr =... | 1 | 86,976,135 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int N,K;
cin>>N>>K;
vector<int>l(N);
rep(i,N){
cin>>l[i];
}
int ans=0;
sort(l.rbegin()... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
int n, k; cin >> n >> k;
vector<int> l(n);
rep(i,n) cin >> l[i];
sort(l.begin(), l.end(), greater<int>());
put(accumulate(l.begin(),... | 1 | 3,219,735 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M; cin >> N >> M;
int left = 1, right = N;
for (int i = 0; i < M; i++) {
int a, b; cin >> a >> b;
left = max(left, a);
right = min(right, b);
}
cout << max(right - left + 1, 0) << endl;
} | #include "bits/stdc++.h"
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(ll i=0;i<n;++i)
#define END(x) (*(x.end()-1))
#define INF (INT_MAX / 2)
using namespace std;
typedef long long ll;
template<typename T>
T gcd(T a, T b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
tem... | 1 | 21,351,684 |
#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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using P = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, m, k;
cin >> n >> m >> k;
bool ok = false;
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
int total =... | 1 | 94,513,345 |
#include <iostream>
using namespace std;
long long a[50],k;
int main(){
cin >> k;
long long i,x = k%50;
cout << 50 << endl;
for(i=0;i<50;i++){
a[i] = 50 - i;
}
for(i=0;i<50;i++){
if(i<x) a[i] += k/50;
else a[i] += (k/50-1LL);
cout << a[i] << " ";
}
cout <<... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 1 | 86,974,604 |
#include <iostream>
#include <algorithm>
using std :: cout;
using std :: cin;
using std :: endl;
using std :: swap;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a > b)
swap(a, b);
if(b > c) {
swap(b, c);
if(a > b)
swap(a, b);
}
cout << a << " " << b << " " << c << endl;
return 0;
} | #include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b >> c;
if (a>=b)
{
d = a;
a = b;
b = d;
}
if (c<=a)
{
cout << c << " " << a << " " << b << endl;
return 0;
}
if (b <= c)
{
cout << a << " " << b << " " << c << endl;
return 0;
}
if (a <= c && ... | 1 | 3,675,476 |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int N;cin >> N ;
int s[N];
int sum=0;
for(int i=0;i<N;i++){
cin >> s[i];
sum+=s[i];
}
int dif=abs(sum-2*s[0]);
for(int i=1;i<N-1;i++){
int sum1=0;
for(int j=0;j<=i;j++){
sum1+=s... | #include <bits/stdc++.h>
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++)
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; } ret... | 1 | 64,562,502 |
#include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<... | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n;
cin >> n;
vector <int> c(n),s(n),f(n),t(n,0);
rep(i,n-1){
cin >> c[i] >> s[i] >> f[i];
}
int tt,a;
rep(i,n-1){
tt=s[i];
... | 1 | 49,882,181 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | 1 | 4,662,620 |
#include <iostream>
using namespace std;
int main() {
int a, n;
cin >> n >> a;
if(n >= 10){
cout << a;
}else{
cout << a + 100 * (10 - n);
}
return 0;
} | #include<bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll,ll>>
#define pii pair<int,int>
#define rep(i,a) for(int (i)=0; (i)<(a); (i)++)
#define rrep(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define rep2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define ALL(v) ... | 1 | 29,179,788 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.