code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
map<ll,int> mp;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll x = -1,y = 0;
sort(a.rbegin(),a.rend());
rep(i,n-1){
if... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <queue>
#include <climits>
#include <set>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ve vector
#define umap unordered_map
#define iter i... | 1 | 99,107,154 |
#include <cstdio>
#include <iostream>
inline int counter(int n);
int main(){
std::ios::sync_with_stdio(false);
int data[50],n,i=0;
while(std::cin){
std::cin >> n;
data[i] = counter(n);
i++;
}
for (int j=0;j<i-1;j++){
std::cout << data[j] << "\n";
}
}
inline int counter(int n){
int count=0;
for (int i=0;... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans[5][37]={ 1 };
for(int i=1; i<=4; i++) {
ans[i][0]=ans[i-1][0];
for(int j=1; j<=36; j++) {
ans[i][j]=ans[i][j-1]+ans[i-1][j];
if(j>9) ans[i][j]-=ans[i-1][j-10];
... | 1 | 3,106,661 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int y=stoi(s.substr(0,4)),m=stoi(s.substr(5,2));
if(y*12+m>24232) cout<<"TBD"<<endl;
else cout<<"Heisei"<<endl;
return 0;
} | #include <iostream>
#include <string>
int main(){
std::string S, ans;
std::cin >> S;
std::string mon = S.substr(5, 2);
if(mon == "01" || mon == "02" || mon == "03" || mon == "04"){
ans = "Heisei";
}
else{
ans = "TBD";
}
std::cout << ans << std::endl;
return 0;
} | 1 | 74,896,356 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long LL;
typedef pair<int, int> P;
int p[100006];
int main() {
int n; cin >> n;
vector<P>V;
rep(i, n) {
cin >> p[i];
V.push_back(P(p[i], i));
}
sort(V.begin(), V.end());
LL ans = 0;
set<int>S1, S2;
S1.insert(V[n-... | #include <bits/stdc++.h>
/* S.size() s.substr(l,r=s.size()-l) -> l文字目からr文字分
__gcd() lower_bound(a+l,a+r,x)-a でindex
clock()/CLOCKS_PER_SEC で秒数
vector v.push_back(x),v.pop_back()
q.push(x),front()で先頭を返す,pop()で削除, size(),empty()
<deque>(push/pop)_(front/back)/fornt/back/insert/
priority_queue 宣言は priority_queue< Type, ve... | 1 | 88,528,584 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #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 h,w,a,b;
cin>>h>>w>>a>>b;
char ans[h][w];
rep(i,h){
rep(j,w){
if(i<b &&... | 1 | 60,162,347 |
#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<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(){
ll n;
cin>>n;
if(n%2==1){
cout<<0<<endl;
return 0;
}
n/=2;
ll ans=0;
... | 1 | 84,156,394 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s;
int x;
int size = s.size()-2;
vector<int> list(size);
for(int i=0; i<size; i++) {
t = s.substr(i,3);
x = atoi(t.c_str());
x = abs(753-x);
list.at(i) = x;
}
sort(list.begin(),list.end());
cout << list.at(0)... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
string s;
cin >> s;
int ans = 1000;
for(int i = 0;i < s.size() - 2;i++){
int t = stoi(s.substr(i,3));
ans = min(ans,abs(t - 753));
}
cout << ans << endl;
} | 1 | 61,746,849 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n;
cin >> n;
vector<long long 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];
long long int sum = 0;
for (int i = 0; i < n; i++) {
if(b[i] > a[i]) sum -= (b[i] - a[i... | 1 | 70,896,933 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
int main(void){
int N; cin >> N;
vector<int> h(N);
int i = 0;
int max = 0;
int ans = 0;
while (i < N) {
cin >> h[i];
if (h[i] >= max) ans++;
if (max < h[i]) max = h[i];
... | #include <math.h>
#include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846264338327950L
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
in... | 1 | 94,855,087 |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 2e5 ;
const int INF = 1e9 + 1e5 + 2;
const int mod= 1e9+7;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define what_is(x) cerr << #x << " = " << x << endl;
#define eps 1e-15
#define F first
#define S second
typedef long long ll;
ll f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
string tmp;
cin >> tmp;
long a, b, c, d;
a = stol(to_string(tmp.at(0) - '0'));
b = stol(to_string(... | 1 | 17,253,184 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
int* a = new int[n];
int max = -1000000, min = 1000000;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > max) max = a[i];
if (a[i] < min) min = a[i];
}
cout << min << " " << max <... | #include <iostream>
using namespace std;
int main(void){
int n, min = 1000000000, max = -1000000000;
long int total = 0;
int *num;
cin >> n;
num = new int[n];
for (int i = 0; i < n; i++){
cin >> num[i];
}
for (int i = 0; i < n; i++){
if (min > num[i]) min = num[i];
if (max < num[i]) max = num[i];
total ... | 1 | 4,517,363 |
#include <bits/stdc++.h>
#define pb push_back
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace st... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define eb emplace_back
#define ef emplace_front
#define rep(i, x, n) for (int i = x; i < n; ++i)
#define mp make_pair
#define fi first
#define se second
#define ii pair<i... | 1 | 61,307,731 |
#include<bits/stdc++.h>
using namespace std;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
typedef long long ll;
int main()
{
ll n,x,t;
cin>>n>>x>>t;
ll r = n/x;
if(n%x==0)
cout<<t*r<<endl;
else
cout<<(r+1)*t<<endl;
} | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int x, t, n;
cin >> n >> x >> t;
int ans;
int times;
if (n%x==0)
times = n/x;
else
times = n/x+1;
ans = times*t;
cout << ans;
}
int main()
{
solve();
cout << "\n";
} | 1 | 34,491,508 |
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
using namespace std;
int main()
{
int ans, A, B, K, itr;
int count = 0;
vector<int> N;
cin >> A >> B >> K;
for (int i = 1; i <= min(A, B); i++)
{
if (A % i == 0 && B % i == 0)
{
N.push_back(i);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < (int)n; ++n)
int main()
{
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
int mini = min(a, b);
for(int i = 1; i <= mini; ++i){
if(a % i == 0 && b % i == 0) {
v.push_back(i);
}
else continue;
}
sor... | 1 | 48,301,491 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stdio.h>
#include <string>
#include <string.h>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main (void)
{
string a;
cin >> a;
int k = 0;
k = a.size();
for (int i = k; i > 0... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str;
cin >> str;
reverse(str.begin(), str.end());
cout << str.c_str() << endl;
return 0;
} | 1 | 98,781,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n+1), B(n);
for (int i = 0; i < n + 1; ++i) cin >> A[i];
for(int i = 0; i < n; ++i) cin >> B[i];
long long int count=0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(A[i], B[i]... | #include<bits/stdc++.h>
#include<vector>
using namespace std;
#define lli long long int
#define test lli t;cin>>t;while(t-->0)
#define ainput int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define vec vector<lli>v;
vec
#define avinput int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];v.push_... | 1 | 98,775,945 |
#include <iostream>
uint32_t pow(uint32_t a, uint32_t p) {
uint32_t ans = 1;
for (size_t i = 0; i < p; i++) ans *= a;
return ans;
}
int main() {
uint32_t N = 0, K = 0;
std::cin >> N >> K;
std::cout << K * pow(K - 1, N - 1) << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N,K; cin >> N >> K;
ll ans =1;
for (int i =0; i<N; i++) {
if (i ==0) {
ans *= K;
} else {
ans *= K - 1;
}
}
cout << ans << endl;
} | 1 | 4,520,547 |
#include<stdio.h>
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a>b){
if(b>c){
printf("%d %d %d\n",c,b,a);
}
else if(b<c){
if(c<a)
printf("%d %d %d\n",b,c,a);
else
printf("%d %d %d\n",b,a,c);
}
else
printf("%d %d %d\n",b,c,a);
}else if(a<b){
if(b<c){
printf("%d %d %d\n",a,b,c);
}
else if(b>c){
if(c<a)
pri... | #include<stdio.h>
void swap(int*, int*);
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a > b || a > c) {
if (b > c) {
swap(&a, &c);
}
else {
swap(&a, &b);
}
}
if (b > c) {
swap(&b, &c);
}
printf("%d %d %d\n",a, b, c);
return 0;
}
void swap(int *a, int *b) {
int temp;
temp = *a;
*... | 1 | 12,480,370 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long N, A, B;
cin >> N >> A >> B;
if(A>B) cout << 0 << endl;
else if(N==1 && A!=B) cout << 0 << endl;
else cout << (N-2)*(B-A)+1 << endl;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;... | 1 | 88,562,190 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string O, E;
cin >> O >> E;
int NO = O.size();
int NE = E.size();
string ans;
for( int i = 0; i < max( NO, NE ); i++ ) {
ans += O[i];
if( i >= NE ) continue;
ans += E[i];
}
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string o,e;
cin>>o>>e;
int length=o.size()<e.size()? o.size():e.size();
for(int i=0;i<length;i++){
cout<<o[i]<<e[i];
}
if(o.size()<e.size())cout<<e[length];
else if(o.size()>e.size())cout<<o[length];
return 0;
} | 1 | 97,226,579 |
#include <iostream>
#include <string>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
int main(void) {
string a, b, c;
cin >> a >> b >> c;
if (a[a.length() - 1] == b[0] && b[b.length() - 1] == c[0]) {
cout << "YES" << endl;
} else {
cout << "NO" << en... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string A, B, C;
cin >> A >> B >> C;
if ... | 1 | 99,340,232 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool travel = true;
int a, b;
int tn, xn, yn, tp, xp, yp;
for(int i=0; i<n; i++) {
cin >> tn >> xn >> yn;
if(i==0) {
a = tn-(abs(xn)+abs(yn));
if(a<0 || a%2==1) travel = false;
}
else {
b = (tn-tp)-... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | 1 | 18,272,852 |
#include <iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int>demand(5);
rep(i,5)cin>>demand[i];
rep(i,4){
if(demand[i]%10){
if(demand[i+1]%10==0)swap(demand[i],demand[i+1]);
else if(demand[... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | 1 | 92,258,441 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_op(i, a, n) for (int i = a; i < n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
template <class T>
inli... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 1 | 40,669,381 |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for1(i, a, b) for (int i = (int)a; i < (int)(b); ++i)
#define rfor1(i, a, b) for (int i=b-1;i>=a;i--)
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<ll>
#define vii vector<pii>
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#d... | 1 | 61,232,053 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int N;
cin >> N;
vector<ll>A(N);
vector<ll>B(N);
vector<pair<ll, int>>C(N);
for (int i = 0; i < N; i ++) {
cin >> A[i] >> B[i];
C[i] = make_pair(A[i] + B[i], i);
}
sort(C.begin(), C.end());
ll ans = 0;
for (int ... | 1 | 18,168,375 |
#include<iostream>
#include<algorithm>
using namespace std;
int n, a[500000], maxn, sum;
int main() {
while (true) {
cin >> n; maxn = -1000000000;
if (n == 0) { break; }
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = i; j < n; j++) {
sum += a[j];... | #include <iostream>
using namespace std;
int main()
{
int num;
while( cin >> num ) {
if (num == 0 )
break;
long int tmpsum = 0;
long int currnum;
long int maxnum = -999999999;
for( int i = 0; i < num; i++ ) {
cin >> currnum;
if( currnum + tmpsum > maxnum ) {
maxnum = currnum + tmpsum;
}
i... | 1 | 90,658,640 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
string ans;
if(n<1200) ans = "ABC";
else if(n<2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n;
cin >> n;
if(n < 1200){
co... | 1 | 46,106,149 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
string N; cin >> N;
int su = 0;
for (int i = 0; i < N.size(); i++) {
int num = (int)(N[i] - '0');
su += num;
}
if (su%9 == 0 || su == 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | 1 | 24,511,946 |
#include<vector>
#include<iostream>
#include<fstream>
#include<string>
#include<cassert>
#include<algorithm>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef lo... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n,m,v,p;
cin... | 1 | 99,466,005 |
#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 <bits/stdc++.h>
using namespace std;
#define ll long long int
int main( )
{
ll n, m, s;
cin >> n >> m;
if (n > m) swap(n, m);
if (n == 1) {
if (m == 1) {
cout << "1\n";
return 0;
}
cout << max(m - 2, 0LL) << '\n';
}
else {
c... | 1 | 59,733,913 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
long long cycle = a+b;
long long ret = (n/cycle)*a;
n%=cycle;
if(n<a) ret+=n;
else ret+=a;
cout<<ret;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long n, a, b;
cin >> n >> a >> b ;
cout << n / (a + b) * a + min(a, n % (a + b)) << endl;
} | 1 | 96,694,192 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
char c;
cin >> c;
c++;
cout << c;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
char c;
cin >> c;
c = c + 1;
cout << c << endl;
return 0;
} | 1 | 71,798,674 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
string e,s;
e =" Eve";
s ="Christmas";
if(D == 25)cout << s <<endl;
if(D == 24)cout << s << e <<endl;
if(D == 23)cout << s << e << e <<endl;
if(D == 22)cout << s << e << e << e <<endl;
} | #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>;
static const double PI = acos(-1);
int main(){
int d;
cin >> d;
int n = 25-d;
cout << "Christmas" << " ";
REP(i,n){
cout << "Eve" << ... | 1 | 71,189,315 |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_set>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<ll> d(N + 1);
ll m = 1;
ll numberOfLeafNodes = 0;
for (int i = 0; i <= N; i++) {
cin >> d[i];
numberOfLeafN... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll i,j,k,l,m,n;
cin >> n;
ll ar[n+10],fir[n+10];
for(i= 0 ; i <= n; i++)
cin>>ar[i];
ll ekn = 0,sum = 0;
fir[n] = ar[n];
for(i = n-1 ; i >= 0 ; i--)fir[i] = ar[i] + fir[i+1];
for(i=0; i<=n; i++)
{... | 1 | 73,401,279 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i = 0; i < n; i++)
int main() {
int n,k;
cin >> n >> k;
double ans = 0;
for (int i = 0; i < n; i++) {
double cnt = 1.0/n;
ll score = i+1;
while (score < k) {
score *= 2;
cnt /= 2;
}
a... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int mylog2(int a, int k){
int i = 0;
int pow = a;
for(; pow < k; pow *= 2, i++);
return i;
}
int main(){
int n, k;
cin >> n >> k;
double ans = 0;
for(int i = n; i >= 1; i--){
int rep = mylog2(i, k);
... | 1 | 24,853,525 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
if (abs(a-c) <= d) cout << "Yes" << endl;
else if (abs(b-a) <= d && abs(b-c) <= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(c - a) <= d || (abs(b - a) <=d && abs(b - c) <= d)){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 1 | 44,372,858 |
#include<iostream>
using namespace std;
#define MAX_X 600
int main(void)
{
int d;
int s = 0;
while(1){
while(1){
cin >> d;
if( MAX_X % d == 0 ) break;
}
if( cin.eof() ) break;
for( int i = 0 ; i < MAX_X / d ; i++ )
{
int height = ( i * d ) * ( i * d );
int width = d;
s += height * width;
}... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int x){
return pow(x,2);
}
int main(){
int input(0);
int N(600);
int s(0);
while(cin >> input){
for (int i = 1; i < N / input -1; i++){
s += f(input * i) * input;
}
s += f(N -input) * input;
cout << s << endl;
s= ... | 1 | 79,323,391 |
#include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 1 | 78,018,527 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>> x(n,vector<int>(2));
rep(i,n)rep(j,2)cin >> x.at(i).at(j);
sort(x.begin(),x.end());
ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N = 0, M;
cin >> N >> M;
ll ans = 0;
vector<pair<ll, ll> > A(N);
for(ll i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
A.at(i) = make_pair(a, b);
}
sort(A.begin(),A.end());
for(ll i ... | 1 | 22,375,503 |
#include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) cout << (c == '1' ? '9' : '1');
cout << endl;
} | #include <iostream>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(string n) {
for (auto &c: n) {
if (c == '9') c = '1';
else c = '9';
}
cout << stoi(n) <<... | 1 | 86,665,336 |
#include <iostream>
#include <vector>
void OutputHeap(std::vector<int>& Heap)
{
int Count = Heap.size();
for(int i = 1; i <= Count; ++i){
std::cout << "node " << i << ": "
<< "key = " << Heap[i - 1] << ", ";
if(i > 1){
std::cout << "parent key = " << Heap[i / 2 - 1] << ", ";
}
if(2 * i <= Coun... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct Node {
int value;
};
int H;
Node heap[250];
int main(void) {
cin >> H;
for (int i = 0; i < H; ++i) {
scanf("%d", &heap[i].value);
}
for (int i = 0; i < H; ++i) {
printf("node %d: key = %d, ", i + 1, ... | 1 | 37,398,524 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.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;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s,t;
cin>>s>>t;
bool ans=false;
rep(i,s.size()){
char fir=s.back();
s.pop_back();
s=fir+s;
if(s==t){
ans=true;
}
}
if(ans){
cout<<"Yes"<<... | 1 | 49,537,069 |
#include "bits/stdc++.h"
using namespace std;
int N;
vector<int>to[200005];
vector<int> ans;
void dfs(int v, int p = -1) {
for (int e : to[v]) {
if (p == e) {
continue;
}
ans[e] += ans[v];
dfs(e, v);
}
}
int main() {
int N, Q;
cin >> N >> Q;
for (int n = 0; n < N - 1; ++n) {
int a, b;
cin >> a >> b;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#def... | 1 | 74,964,858 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long factorials[500001];
int pre_factorials(int n){
factorials[0] = 1;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | 1 | 30,840,468 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
string S , T ;
cin >> S >> T ;
string U ;
int N = S.size() ;
for(int i = 1 ; i <= N ; i++){
U = S.substr(N-i,i) + S.substr(0,N - i ) ;
if(U == T){
cout << "Yes" << endl;
return 0 ;
}
}
cout << "No" << endl ;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 51,333,256 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int n;
ll ans = 0;
cin >> n;
vector<int>a(n);
rep(i,0,n) cin >> a[i];
rep(i,0,n-1){
ans += a[i]/2;
a[i] %= 2;
if(a[i+1] > 0){
ans +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = ... | 1 | 23,991,446 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=(m); i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se sec... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int m, k;... | 1 | 25,153,305 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cctype>
#include <map>
#include <set>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int mai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int x; cin >> x;
int ans = 0;
for(int i = 1;... | 1 | 71,852,834 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__V... | 1 | 56,795,565 |
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int m, f, r;
while(cin>>m>>f>>r) {
if(m==-1 && f==-1 && r==-1) break;
if(m==-1 || f==-1) cout<<"F\n";
else if(m+f>=80) cout<<"A\n";
else if(m+f>=65) cout<<"B\n";
else if... | #include<iostream>
using namespace std;
int main()
{
int m[51], f[51], r[51];
int total;
int i = 0;
while (cin >> m[i] >> f[i] >> r[i], m[i] + f[i] + r[i] != -3) { i++; }
i = 0;
while (1)
{
if (m[i] == -1 && f[i] == -1 && r[i] == -1) break;
total = m[i] + f[i];
if (m[i] == -1 || f[i] == -1)
{
cout << ... | 1 | 19,290,924 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
uint64_t k;
cin >> n >> k;
vector<pair<uint64_t, int64_t>> nums(n);
int64_t ans = 0;
for (auto i : i... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | 1 | 87,146,116 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <string>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <map>
#include <bitset>
using namespace std;
#define len(n) (int)n.length()
#define dump cout
#define pb push_back
#define ll long long
bool isStable(vector<int> or... | #include <bits/stdc++.h>
using namespace std;
struct Card { int value; char c; };
bool comp(const Card& l, const Card& r){ return l.value < r.value; }
int N;
Card stable[36];
Card tmp[36];
Card C[36];
void Out() {
cout << C[0].c << C[0].value;
for (int i = 1; i < N; i++)
cout << ' ' << C[i].c << C[i].value;
cout <... | 1 | 97,237,821 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, k, dif, i;
cin>>n>>k;
if(k==1){
cout<<"0"<<endl;
}
else{
dif = n -k;
cout<<dif<<endl;
}
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<iterator>
#include<complex>
#include<stack>
using... | 1 | 45,769,400 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string bottan[]={
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int cnt[] = {0,5,3,3,3,3,3,4,3,4};
cin >> n;
while(n--){
string str; cin >> str;
int len = str.... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
string table[] = {
"",
".,!? ",
"ab... | 1 | 15,169,769 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(void)
{
string s;
cin>>s;
ll ans=INT_MAX;
for(int i=0;i<s.size()-2;i++)
{
string ss;
ss+=s[i];
ss+=s[i+1];
ss+=s[i+2];
ll x=stoi(ss);
ll ok=abs(753-x);
ans=min(ans,ok);
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
... | 1 | 13,789,914 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
string s, p;
cin >> s >> p;
s = s + s;
bool ret = false;
for (int i = 0; i <= s.size() - p.size(); i++) {
bool flag = tr... | #include <iostream>
using namespace std;
int main(){
std::string s;
std::string p;
std::string g;
cin >> s>> p;
int count = 0;
int i=0;
int j= 0;
int f = 0;
for(i = 0;i < s.length();i++){
int k = i;
for(j = 0;j < p.length();j++){
if(s[k] != p[j]){
count = 0;
break;
... | 1 | 65,000,695 |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | 1 | 94,161,410 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 1 | 66,969,957 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans = 0;
for (ll i = 0; i <= 99; i++){
if (a <= i && i < b && c <= i && i < d... | 1 | 93,327,349 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
vector<string> s(n);
for (int i=0; i<n; i++) cin >> s.at(i);
sort(s.begin(), s.end());
for (int i=0 ; i<n; i++) cout << s.at(i);
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n, l; cin >> n >> l;
vector<string> vec(n);
rep(i,n) cin >>... | 1 | 17,693,693 |
#include <cstdio>
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
#include <cmath>
#include <iomanip>
#include <regex>
#include <bits/stdc++.h>
#include <string>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using plong = pair<long,long>;
ll max(ll a,ll b,ll c){
return... | #include <iostream>
#include <algorithm>
using namespace std ;
using ll = long long ;
int main(){
ll h,w ;
cin >> h >> w ;
ll ans = 100000000000 ;
for(int i=1;i<h;i++){
ll a = i*w ;
ll b = ((h-i)*w%2==0?(h-i)*w/2:((h-i)*w+min(h-i,w))/2) ;
ll c = h*w-a-b ;
ans = min(ans,max(a,b)-min(a,c)) ;
}
for(int i=1;i... | 1 | 94,600,592 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 1 | 85,024,588 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W, D;
scanf("%d %d %d", &H, &W, &D);
vector<vector<int>> from_i(D, vector<int>(((H * W) / D) + 1, -1));
vector<vector<pair<int, int>>> loc(D, vector<pair<int, int>>(((H * W) / D) + 1, make_pair(-1, -1)));
for (int i = 0; i < H; i++)
{
for (int j ... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | 1 | 92,551,150 |
#include <bits/stdc++.h>
using namespace std;
vector<int> two(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N;
cin >> N;
vector<int> w(N);
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
int ans1 = 0, ans2 = 0, ans = 1000;
for (int i = 0; i < vec.size(); ++i) {
ans1 += vec[i];
for (int j = i + 1; j < vec.size()... | 1 | 18,451,784 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long int n,a,b,c,d,i;
cin>>n;
c = 9999999999;
d=0;
for(i=0;i<n;i++){
cin>>a;
c = min(a,c);
if(c==a)d++;}
cout<<d<<endl;} | 1 | 43,455,763 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 1 | 45,989,721 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<ll,ll>
typedef long long ll;
ll n,p,arr[55],memo[55][1005];
ll f(ll idx,ll sum){
if(idx==n+1){
if(sum==p) return 1;
return 0;
}
if(memo[idx][sum]!=-1) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
ll nck(ll n, l... | 1 | 67,348,344 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
... | 1 | 32,625,784 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | #include "bits/stdc++.h"
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" <... | 1 | 99,140,083 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int,int>;
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int findRoot(int x) {
if (d[x] < 0) return x;
return d[x] = findRoot(d[x]);
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
ll find(ll x, v... | 1 | 73,486,356 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,d,x;
cin >> n >> d >> x;
ll res = 0;
res += x;
for(int i = 0;i < n;i++)... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | 1 | 95,715,122 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int i, a, b;
cin >> a >> b;
if(a<b){
for(i=1; i<=b; i++){
cout << a;
}
cout << endl;
}
else{
for(i=1; i<=a; i++){
cout << b;
}
cout << endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iterator>
#include<set>
#include<sstream>
#define rep(i,n) for(i=0;i<n;i++);
#define endl "\n"
#define ll long long
#define N 200050
using namespace std;
int main()
{
int d,i,m,p=0,q=0,r=0,l;
int n,x,... | 1 | 25,770,414 |
#include <iostream>
using namespace std;
int main() {
int n,ban = 0;
while(true){
cin >> n;
ban += 1;
if(n == 0){
break;
}
cout << "Case " << ban << ":" << " " << n << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int i = 1;
int input = 1;
while(1) {
cin >> input;
if (!input) {
break;
}
cout << "Case " << i << ": " << input << endl;
i++;
}
return 0;
} | 1 | 44,706,132 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
fast_io;
ll n, l, t;
cin >> n >> l >> t;
ll cnt = 0;
vector <ll> v;
for(ll i = 0; i < n; i ++){
ll x, w;
cin >> x >> w;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int g[100010];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=... | 1 | 88,054,189 |
#include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
ll read() {
ll X=0,w=1; char c=getchar();
while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
while (c>='0'&&c<='9') X=X*10+c... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
if (abs(X-Y) <= 1) cout <<"Brown\n";
else cout << "Alice\n";
} | 1 | 8,830,568 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll N, Z, W;
cin >> N >> Z >> W;
vector<ll> A(N);
for(auto &a : A) cin >> a;
vector<vector<ll>> dp(N, vector<ll>(2));
for(int i=0;i<N;i++) dp[i][0] = LLONG_MIN;
for(int i=0;i<N;i++) dp[i][1] = LLONG_MAX;
for(int i=N-1;i>=0;i--) {... | 1 | 67,739,761 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a%b==0)cout << -1 <<endl;
else cout << a <<endl;
} | 1 | 28,977,250 |
#include <iostream>
#include <algorithm>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
int main()
{
string s;
int res = 99999;
cin >> s;
for (int i = 0; i < s.size() - 2; i++)
{
int diff = abs(753 - stoi(s.substr(i, 3)));
if (diff < re... | #pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | 1 | 47,115,314 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,to) for(int i=x;i<to;i++)
int sum(int n){
int a,b,c,d,ans = 0;
rep(a,0,10)
rep(b,0,10)
rep(c,0,10)
rep(d,0,10)
if(n==a+b+c+d) ans++;
return ans;
}
int main() {
int n;
while(cin >> n)
cout << sum(n) << endl;
return 0;
} | #include<cstdio>
#include<algorithm>
using namespace std;
int n;
int slv(int now, int t);
int main(){
while(scanf(" %d",&n) != EOF){
printf("%d\n",slv(0,0));
}
return 0;
}
int slv(int now, int t){
if(now == 4){
if(t == n)return 1;
return 0;
}
int ans = 0;
for(int i=0;i<10;i++){
ans += slv(... | 1 | 49,235,427 |
#include <stdio.h>
#include <string.h>
int main()
{
char S[255],T[255];
scanf("%s%s",S,T);
strcat(T,S);
printf("%s",T);
return 0;
} | #include <iostream>
#include<string>
using namespace std;
int main() {
string s,t;
cin>>s;
cin>>t;
for(int i = 0; t[i]!='\0'; i++)
{
cout<<t[i];
}
for(int i = 0; s[i]!='\0'; i++)
{
cout<<s[i];
}
return 0;
} | 1 | 70,234,064 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define r... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | 1 | 92,390,590 |
using namespace std;
#include <stdio.h>
int main()
{
char str[101], p[101];
int i, j, a, b, Bool = 0;
for (i = 0;; i++){ str[i] = getchar(); if (str[i] == '\n')break; }
a = i;
for (j = 0;; j++){ p[j] = getchar(); if (p[j] == '\n')break; }
b = j;
for (i = 0; i < a; i++){
for (j = 0; j < b; j++){
if (str[(i +... | #include <iostream>
#include <string>
using namespace std;
int main () {
int a;
string p,s;
cin >> p >> s;
p += p;
a=p.find(s);
if(a==-1)cout <<"No"<<endl;
else cout << "Yes"<<endl;
} | 1 | 9,278,094 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
getline(cin,s);
getline(cin,t);
t.pop_back();
if(s==t)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | 1 | 29,507,712 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0, 1, 0, -1};
int main(){
ll n, m;
cin >> n >> m;
ll a[n];
... | #include <iostream>
#include <map>
#include <vector>
#define rep(i,n) for(int (i)=0;(i)<(n);++(i))
using namespace std;
using ll = long long;
int main() {
int n;
ll m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> s(n + 1, 0);
rep(i, n) s[i + 1] = s[i] + a[i];
map<ll,... | 1 | 97,513,941 |
#include <cstdint>
#include <vector>
using namespace std;
#define GRAPH_SIZE 100
static vector<uint32_t> graph[GRAPH_SIZE];
void graph_to_matrix(vector<uint32_t> graph[], uint32_t matrix[][GRAPH_SIZE])
{
for(uint32_t i = 0; i < GRAPH_SIZE; i++){
for(uint32_t j = 0; j < GRAPH_SIZE; j++){
matrix[i][j] = 0;
... | #include <iostream>
using namespace std;
int main() {
int n,p,q,r;
cin>>n;
int a[100][100]={};
for (int i=0;i<n;i++){
cin>>q>>p;
if (p!=0){
for (int j=0;j<p;j++){
cin>>r;
a[i][r-1]=1;
}
}
}
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
cout<<a[i][j];
if (j!=n-1)cout... | 1 | 35,098,580 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<bool> vecbool;
typedef vector<int> vecint;
typede... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 1 | 97,813,677 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define MAXN 300003
#define MOD 1000000007
#define oo (1<<20)
#define mid ((a+b)/2)
#define pb push_back
#define sz size()
#define fastCpp() ios_base::sync_with_stdio( false ), cin.tie( NULL ), cout.tie( NULL )
using namespace std;
typedef long long ll;
typedef unsig... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MN = 1e6+5;
ii A[MN];
inline ii merge(ii a, ii b) {
if (a.f < b.f) swap(a, b);
return ii(a.f, max(a.s, b.f));
}
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), f... | 1 | 36,425,129 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if ( A.length() > B.length() ){
cout << "GREATER";
}
if ( A.length() < B.length() ){
cout << "LESS";
}
if ( A.length() == B.length() ){
char X = 'E';
for (int i = 0 ; i < A.length() ; i++ ){
if (A... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if (A.size() > B.size()) {
cout << "GREATER";
}
else if (A.size() < B.size()) {
cout << "LESS";
}
els... | 1 | 32,071,773 |
#include"bits/stdc++.h"
using namespace std ;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define bug( x ) cerr << #x << '=' << x << '\n' ;
long long H,W;
int main(){
IOS
cin >> H >> W ;
if(H == 1 || W == 1 )cout<<"1\n";
else cout << (H*W+1)/2 << '\n' ;
} | #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... | 1 | 51,248,977 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
char s[100], p[100];
string scp,s2,chk;
scanf("%s %s",&s,&p);
scp=s;
chk=p;
s2=scp+scp;
if(s2.find(p) != string::npos){
printf("Yes\n");
}... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main(){
string s, p;
cin >> s;
cin >> p;
int flag = 0;
s += s;
int s_length = s.length();
int p_length = p.length();
for (int i = 0; i < s_length - p_length; i++)
{
if (s.substr(i, p_length) == p){
flag = 1;
break;
}
}
... | 1 | 56,949,995 |
#include <iostream>
#include <vector>
using namespace std;
int A, B, C;
int X;
int myrand() {
int res = X;
X = (A*X + B) % C;
return res;
}
bool solve() {
int N;
cin >> N >> A >> B >> C >> X;
if(!N && !A && !B && !C && !X) return false;
vector<int> ys(N);
for(int i = 0; i < N; ++i) {
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | 1 | 47,609,552 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | 1 | 66,824,713 |
#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< vector<int> > VVI;
typedef vector< ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = I... | 1 | 22,052,748 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b)
cout << c;
else if (a == c)
cout << b;
else
cout << a;
} | 1 | 19,691,867 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int nl = n.size(),cnt=0;
for(int i =0;i<nl;i++)
{
cnt+=(int)n.at(i)-48;
cnt%=9;
}
if(cnt>0)
{
cout << "No" << endl;
}
else
{
cout << "Yes" << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
stri... | 1 | 56,896,146 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include<cstdio>
#include<cstring>
int main()
{
int n,ans=0,m=1;
int num;
scanf("%d", &n);
for (int i = 0; i < n;i++)
{
scanf("%d", &num);
if(num==m)
{
m++;
}
else
ans++;
... | 1 | 20,757,662 |
#include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int A... | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map... | 1 | 78,721,479 |
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begin(), (x).end()
usi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | 1 | 17,841,001 |
#include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define acc_io cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define rep(i,sta,end) for(ll i=sta;i<end;i++)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#define pb push_back
ty... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
int main() {
int n,k;cin>>n>>k;
ll co=k;
for(int i=1;i<n;i++){
co*=k-1;
}
cout<<co<<endl;
} | 1 | 84,919,379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.