code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
string s... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,ans="";
cin >> S;
int N = S.size();
for (int i=0; i < N; i++){
if (S.at(i) == '0'){
ans.push_back('0');
}
else if(S.at(i) == '1'){
ans.push_back('1');
}
else if(ans.size()!=0){
ans.erase(ans.size()-1);
}
}... | 1 | 19,404,436 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 200003
#define MOD 1000000007
typedef int FLOW;
int main(){
int N;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p.at(i);
}
vector<int> a(N),b(N);
for(int i=0;i<N;i++){
a.at(i)=30000*(i+1);
b.at(i)=30000*(N-i)... | 1 | 84,378,995 |
#include<bits/stdc++.h>
#define l long
#define ll long long
#define ld long double
#define INF 1000000000000
#define MOD 1000000007
#define MAX_N 1000006
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
l n,k;
cin>>n>>k;
vector<l> a;
l x;
... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define MOD 1000000007
#define pi 3.141592653589793238
#define ll long long int
#define P pair<ll, ll>
#define VII vector<P>
#define P_B push_back
ll n;
ll v[101];
ll DP[100001];
int main() {
{
ll k;
cin>>n>>k;
for (ll i = 0; i < n; i+... | 1 | 89,327,668 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> a(N+1,0);
rep(i,N) cin >> a[i];
ll ans = 0;
rep(i,N){
ans += a[i]/2;
a[i] %= 2;
if(a[i] & (a[i + 1]>0)){
... | 1 | 16,217,940 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio... | # include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0)
# define debug(x) cerr<< #x << " : " << x << endl
# define ddeb... | 1 | 70,489,218 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,i,j,res = 0,temp;
cin >> n;
long long int a[n];
for(i = 0;i<n;i++) {
cin >> a[i];
if(i>0){
temp = a[i] - a[i-1];
if(temp < 0) {
res += (-1 * temp);
a[i] += (-... | #include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<functional>
#include <random>
#include<iostream>
#include<iomanip>
using namespace std;
int N;
long long A[200000];
long long max_height;
long long ans;
int main(... | 1 | 82,381,916 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> SelectSort(vector<int> A,int n)
{
int flag;
int count = 0;
for(int i=0;i<n-1;i++){
int minj = i;
flag = 0;
for(int j=i+1;j<n;j++){
if(A[j] < A[minj]){
minj = j;
flag = 1;
}
}
if(flag == 1){
swap(A[i],A[minj]);
count++;... | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int n;
int a[100];
int k=0;
int mini;
int main()
{
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
mini = ... | 1 | 61,049,633 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << max({A * 10 + B + C, A + B * 10 + C, A + B + C * 10}) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(&a[0],&a[2]+1);
cout << a[2]*10+a[1]+a[0];
return 0;
} | 1 | 28,343,790 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll a, b;
cin >> a >> b;
for(int i = 1; i <= b; i++) {
if((a * i) % b == 0) {
cout << a * i << "\n";
... | #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.... | 1 | 96,268,591 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n; cin >> n;
double sum = 0;
rep(i,n) {
double... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
double x,sum=0;
string u;
cin>>n;
for(int i=1;i<=n;i++){
cin>>x>>u;
if(u=="JPY"){
sum+=x;
}
else if(u=="BTC"){
sum+=(x*380000.0);
}
}
cout<<sum;
return 0;
} | 1 | 69,971,226 |
#include<iostream>
using namespace std;
int main(){
int num[5];
int m1 = -2147483647, m2 = -2147483647, m3 = -2147483647, m4 = -2147483647, m5 = -2147483647;
int p1 = 0, p2 = 0, p3 = 0, p4 = 0;
cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];
for(int i=0; i<5; i++){
if(m1 < num[i]){
... | #include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c... | 1 | 45,134,635 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SORT(... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 1 | 49,062,283 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long int i,n,x,k=0,input;
cin>>n;
x=n+1;
for(i=0; i<n; i++){
cin>>input;
if(input<x){
k++;
x=input;
}
}
cout<<k<<"\n";
return 0;
... | 1 | 67,898,231 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
ll n,m,v,p;
vector<ll> a(n);
bool ok(int x){
if(x >= n-p) return true;
if(a[x] + m < a[n-p]) return false;
ll res = 0;
rep(i,n){
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
... | 1 | 59,003,929 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 1 | 108,281 |
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# define int long long
using namespace std;
const int N = 1e3 + 7;
const int mod = 1e9 + 7;
int32_t main() {
speed;
long ... | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static int IN... | 1 | 77,810,038 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n,k;
cin>>n>>k;
cout<<(k==1?0:n-k)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5000500;
const int mod = 1e9 + 7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
if(k == 1) return cout << 0 << '\n', 0;
cout << n - k << '\n';
return 0;
} | 1 | 79,612,684 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
string... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s=="A")
{
cout<<"T"<<endl;
}
if(s=="T")
{
cout<<"A"<<endl;
}
if(s=="C")
{
cout<<"G"<<endl;
}
if(s=="G")
{
cout<<"C"<<endl;
}
return 0;
} | 1 | 79,159,465 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
ll poll(pair<ll,ll> s,pair<ll,ll> g){
return abs(s.first-g.first)+abs(s.second-g.second);
}
int main(){
ll h,w,d;
cin >> h >> w >> d;
map<ll,pair<ll,ll>> mp;
map<pair<int,int>,int> dp;
map<pair<int,int>... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
int main()
{
int H,W,D;
cin >> H >> W >> D;
int size = H*W;
vector<int> I(size),J(size);
for(int i=0;i<H;i++)
{
for(int j=0;j<W;j++)
{
int t;
cin >> t;
t--;
I[t]... | 1 | 75,459,847 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int a,b,table[17][17],row,col,n;
while(true){
scanf("%d %d",&a,&b);
if(a ==b && b == 0)break;
for(int i=0; i <= 16; i++){
for(int k=0; k <= 16; k++)table[i][k] = 0;
}
table[1][1] = 1;
scanf("%d",&n);
for(int i=0... | #include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int W, H;
int N;
int state[16][16];
int dp[16][16];
while (scanf("%d %d", &W, &H) && W != 0){
scanf("%d", &N);
memset(state, 0, sizeof(state));
memset(dp, 0, sizeof(dp));
for (int i = 0; i < N; i++){
int x, y;
scanf("%d %d", &x,... | 1 | 45,151,555 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 1 | 28,759,845 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC omodtimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using orde... | #include <iostream>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int arr[32];
stringstream ss("1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51");
int a;
char b;
for(int i = 0; i < 32; i++)
{
ss >> a;
arr[... | 1 | 20,088,593 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double n, x, t;
cin>>n>>x>>t;
double t1 = ceil(double(n/x));
ll t11 = ll(t1)*ll(t);
cout<<t11<<endl;
} | #include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
int N, X, T, a = 0, b;
cin >> N >> X >> T;
do {
a = a + X;
b++;
} while (N > a);
cout << T * b << endl;
} | 1 | 53,873,809 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a[7];
for(int i=0;i<6;i++){
cin>>a[i];
}
if(a[0]==a[5]&&a[1]==a[4]&&a[2]==a[3]){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
int main()
{
vector<string> C(2);
string s;
cin >> s;
C.at(0) = s;
cin >> s;
C.at(1) = s;
if (C.at(0).at(0) == C.at(1).at(2)
&& C.at(0).at(1) == C.at(1).at(1)
&& C.at(0).at... | 1 | 38,489,369 |
#include<iostream>
using namespace std;
int m,n1,n2;
main()
{
while(cin>>m>>n1>>n2,m)
{
int p[222],ansg=0,ansi;
for(int i=0;i<m;i++)cin>>p[i];
for(int i=n2;i>=n1;i--)
{
if(ansg<p[i-1]-p[i])
{
ansg=p[i-1]-p[i];
ansi=i;
}
}
cout<<ansi<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> p;
int main()
{
while(true) {
ll m, nmin, nmax;
cin >> m >> nmin >> nmax;
if (m == 0 && nmin == 0 && nmax == 0) {
break;
}
vector<ll> v(m, 0);
for (int i = 0; i < m; i++){
cin >> v[i];
}
... | 1 | 75,573,685 |
#include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
ll solver(int N, int K, vector<int> P, vector<ll> C){
ll ans = -1 * INF;
rep(i, N){
int now = i;... | #include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <utility>
#include <cmath>
#include <random>
using namespace std;
using ll = long lon... | 1 | 83,238,498 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
const double PI = 3.1415926535897932384626433832;
double a,b,x;
bool safe(double a... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 20,320,894 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 1 | 91,337,173 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, x;
cin >> a >> b >>x;
int sum = a+b;
if(x <= sum && x >= a){
cout ... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, ... | 1 | 52,531,626 |
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int n,m;
int sum;
int main(){
scanf("%d%d%d",&n,&m,&sum);
int k=0;
for(int i=0;i<n;i++){
if(k<m){
printf("%d ",sum);
k++;
}
else {
if(sum<1000000000-1){
printf("%d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int INF = 1e9;
signed main() {
int n,k,s;
cin >> n >> k >> s;
vector<int> ans(n, INF);
if(s == INF) {
rep(i,n) ans[i] = INF - 1;
}
rep(i, k) ans[i] = s;
for (auto it : ans) cout << it << " ";
cou... | 1 | 21,495,173 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
int main(){
ll n, x; cin >> n >> x;
vector<ll> p;
for(int i=0; i<n; i++){
ll tmp=0;
cin >> tmp;
p.push_back(tmp);
}
p.push_back(x);
... | #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;
ll gcd(ll a,ll b){
if(a % b == 0)return b;
else{
return(gcd(b,a% b));
}
}
int main(){
... | 1 | 26,173,748 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int mx = -100;
rep(i, N)
{
int x;
c... | 1 | 17,025,382 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N);
for(int i=0; i<N; i++){
cin >> S.at(i) >> T.at(i);
}
string X;
cin >> X;
int P;
for(int i=0; i<N; i++){
if(S.at(i)==X){
P=i;
}
}
int Ans=0;
for(int i=P+1; i<N; i++... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main(){
int N;
cin >> N;
string S[N];
int t[N];
for(int i=0;i<N;i++){
cin >> S[i] >> t[i];
}
string X;
cin >> X;
... | 1 | 82,450,325 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int start = 1900*m+100*(n-m);
int x = pow(2,m);
cout << start * x << endl;
return 0;
} | 1 | 97,483,213 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int N, K; cin >> N >> K;
int cnt... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,f=0,j,k,sum,ans,n,odd,even,c=0;
cin>>a>>b;
for(int i=0;i<a;i++)
{
cin>>k;
if(k>=b)
c++;
}
cout<<c<<"\n";
return 0;
} | 1 | 54,134,795 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include <iostream>
#include <vector>
#include <numeric>
#include <utility>
#include <algorithm>
using namespace std;
using Int = int64_t;
Int solve() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (auto& i : A) cin >> i;
for (auto& i : B) cin >> i;
if (accumulate(A.begin(), A.end(), (Int)0) < a... | 1 | 56,561,355 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int N;
cin >> N;
cout << N/3 << endl;
} | 1 | 70,232,716 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
cin >> N >> Q;
vector<int> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
vector<int> cumsumL(N+1);
vector<int> cumsumR(N+1);
for(int i=1; i <= N; i++){
cumsumL.at(i)= cumsumL.at(i-1)+ data.at(i-1);
cumsumR.at(i)= cums... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
using namespace std;
int main() {
int v[52];
int n, k;
cin >> n >> k;
int i;
v[0] = 0;
for (i = 1; i <= n; i++) {
cin >> v[i];
}
v[n + 1] = 0;
int Lj[52];
int Rj[52];
Lj[0] = 0;
for (i = 1; i <= n+1; i++) {
Lj[i] = ... | 1 | 50,624,236 |
#include <stdio.h>
int main(void) {
int n;
double x1,y1,x2,y2,x3,y3,x4,y4;
int i;
char c;
scanf("%d",&n);
for(i=0;i<n;i++) {
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
if(x2-x1==0.0) {
if(x4-x3==0.0) printf("YES\n");
else printf("NO\n");
}
else if((... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
double x1,x2... | 1 | 99,717,688 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAX=105;
const LL INF=1LL<<31;
LL G[MAX][MAX],A[MAX][MAX];
int V,E;
void init(int type){
for(int i=0;i<MAX;i++){
for(int j=0;j<MAX;j++){
if(type){
if(i!=j)G[i][j]=INF;
else G[i][j... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
int main(){
long long inf=10000000000;
int v,e;
cin >> v >> e;
long long dp[v][v];
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
dp[i][j]=inf;
}
}
for(int i=0;i<e;i++)... | 1 | 92,049,422 |
#include <iostream>
#include <vector>
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> v(h+2, vector<char>(w+2,'.'));
rep(i, 1, h+1) {
rep(j, 1, w+1) {
cin >> v[i][j];
}
}
rep(i, 1, h+1) {
rep(j, 1, w+1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j... | 1 | 64,296,322 |
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef complex<double> com;
#define endl '\n'
#define eb emplace_back
#def... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
string s;
cin >> n;
if (n >= 1200) cout << "ARC" << endl;
else cout << "ABC" << ... | 1 | 83,578,501 |
#include <bits/stdc++.h>
#include <iostream>
#include <set>
using namespace std;
typedef pair <long long,long long> pii;
int N;
pii arr[100005];
long long val[100005];
multiset <long long> larger;
multiset <long long>::iterator it;
struct quad{
long long l, ll, r, rr;
};
quad neighbouring[100005];
int main() {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 1 | 8,747,257 |
#include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main(){
int m,f,r;
while(true){
cin >> m>>f>>r;
if(m==-1&&f==-1&&r==-1) break;
int sum = m+f;
if(m==-1 || f==-1) cout << "F";
else if(sum >= 80) cout << "A"... | #include<iostream>
using namespace std;
void write(char);
int main() {
int m, f, r, sum;
while (true) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
sum = m + f;
if (m == -1 || f == -1) write('F');
else if (sum >= 80) write('A');
else if (sum >= 65) write('B');
else if (sum >= 50) write... | 1 | 73,343,889 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
int main(){
ll A,B,C; cin>>A>>B>>C;
if(A-B>=C){
cout<<0<<endl;
}else{
cout<<C-(A-B)<<endl;
}
} | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int ans=(c-(a-b));
if(ans<0)
cout<<0<<"\n";
else
cout<<ans<<"\n";
} | 1 | 41,170,832 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 | 82,633,188 |
#include <bits/stdc++.h>
#define re runtime_error
using namespace std;
int cal(int a, char op, int b) {
switch (op) {
case '+': return a + b;
case '-': return a - b;
case '*': return a * b;
case '/': {
if (b == 0) throw re("You can't divide by 0");
else return a / b;
}
default: throw re("No such oper... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int a, b;
char op;
cin >> a >> op >> b;
switch(op) {
case '+':
cout << a + b;
break;
case '-':
cout << a - b;
break;
}
cout << "\n";
return 0;
} | 1 | 26,308,641 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
int ans = 0;
rep(i,n) {
int A;
cin >> A, --A;
a[i] = A;
}
... | #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... | 1 | 61,956,691 |
#include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
const ll mod = 1e9 + 7 ;
ll ruiseki_xor ( ll a ){
if( a <= 0 ) return 0 ;
if( ( a - 3 )%4 == 0 ) return 0 ;
if( ( a - 4 )%4 == 0 ) return a ;
if( ( a - 1 )%4 == 0 ) return 1 ... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll 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_... | 1 | 54,400,544 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include<bits/stdc++.h>
using namespace std;
const int N=8001;
const int mod=1e9 + 7;
#define int long long
const int inf=1e18;
#define pii pair<int, int>
#define f first
#define s second
#define mp make_pair
set<int> dp[4001];string st;int t[2];
vector<int> arr[2];
bool solve(int ind, int start)
{
int sum=0;
for(au... | 1 | 20,505,477 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a,... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 1 | 26,042,272 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)
int main()
{
string S; cin >> S;
ll a, b, c, d;
a = S[0] - '0';
b = S[1] - '0';
c = S[2] - '0';
d = S[3] - '0';
ll index = 0;
string ans = "";
rep(i, (1<<3)) {
ll tmp ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
rep(bit,1<<3){
int cnt=s[0]-'0';
string t;
t+=s[0];
rep(i,3){
if(bit&(1<<i)){
cnt+=s[i+1]-'0';
t+='+'... | 1 | 9,966,194 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#d... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int,int> PI;
typedef pair<int,pair<int,int>> PII;
static const int INF=1010000000000000017LL;
static const double eps=1e-12;
static... | 1 | 20,274,444 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll, ll>;
ll n, m, ans;
int main() {
cin >> n >> m;
vector<P> drink(n);
rep (i, n) {
cin >> drink[i].first >> drink[i].second;
}
sort(drink.begin(), drink.end());
ans = 0;
r... | #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<P> d(n);
rep(i,n){
int a, b;
cin >> a >> b;
d[i] = P(a,b);
}
sort(d.begin(), d.end());
... | 1 | 23,395,490 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define fi first
#define se second
#define inf (INT_MAX/2-1)
#define infl (1LL<<60)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz(a) (int)(a).s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
#include <stack>
using namespace std;
#define COUT(x) c... | 1 | 76,563,912 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll d;
cin>>d;
if(d==25) {
cout<<"Christmas"<<endl;
}
else if(d==24) {
cout<<"Christmas Eve"<<endl;
}
else if(d==23) {
cout<<"Christmas Eve Eve"<<endl;
}
else {
cout<<"Christmas Eve Eve Ev... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | 1 | 43,166,513 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S[0] == S[1] && S[1] == S[2]) cout<< "Yes" << endl;
else if (S[1] == S[2] && S[2] == S[3]) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 39,839,885 |
#include <bits/stdc++.h>
using namespace std;
string s;
bool palind(string x){
auto size = x.size();
for(int i=0; i<size/2; i++){
if(x[i] != x[size-1-i]) return false;
}
return true;
}
bool check(){
int length1 = (s.size()-1)/2;
int length2 = s.size()-(s.size()+3)/2+1;
return palind(... | #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() {
string S;
cin >> S;
bool bl = true;
string T = S;
reverse(T.b... | 1 | 61,914,854 |
#include <bits/stdc++.h>
using namespace std;
struct Graph {
int n;
int time;
vector<vector<int>> g;
vector<int> num, low;
vector<vector<int>> scc;
stack<int, deque<int>> S;
vector<bool> inS;
Graph(int n) : n(n), g(n), num(n, -1), low(n, -1), inS(n, false) {}
void addEdge(int u, int v) {
g[u].push... | #include "bits/stdc++.h"
using namespace std;
using LL=long long;
const int INF = 1'000'000'000;
const long long INFLL = 1'000'000'000'000'000'000;
using Weight=int;
struct Edge {
int to; Weight cost;
Edge(int _to, Weight _cost) :to(_to), cost(_cost) {}
};
bool operator>(const Edge& e1, const Edge& e2) { return e1.co... | 1 | 84,590,247 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, P;
cin >> A >> P;
cout << ((A * 3 + P) / 2) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
#define REP(i,N) for(int j=i;j<N;j++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
... | 1 | 5,548,258 |
#include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int N;
vector<int> a;
vector<int> sum;
void input() {
cin >> N;
a = vector<int>(N);
rep(i, N) {
int x;
cin >> x;
a[x-1]++;
}
}
inline bo... | 1 | 93,488,693 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
list<int> lst;
lst.push_back(555);
while(scanf("%d",&n)!=EOF){
if(n==0){
auto itr=lst.begin();
printf("%d\n",*itr);
... | #include <stack>
#include <stdio.h>
int main(int argc, char** argv)
{
std::stack<int> stack;
int i;
while (fscanf(stdin, "%d", &i) == 1) {
if (i) {
stack.push(i);
}
else {
fprintf(stdout, "%d\n", stack.top());
stack.pop();
}
}
} | 1 | 53,316,519 |
#include <stdio.h>
int main() {
int official_house[4][3][10] = { 0 };
int n=0,b=0,f=0,r=0,v=0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d %d %d %d", &b, &f, &r, &v);
official_house[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k... | #include<stdio.h>
#include<string.h>
int main()
{
int a[4][3][10];
int b,f,r,v;
int i,j,k;
int n;
for(i=0;i<4;i++) for(j=0;j<3;j++) for(k=0;k<10;k++) a[i][j][k]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf(" %d %d %d %d",&b,&f,&r,&v);
a[b-1][f-1][r-1]=a[b-1][f-1][r-1]+v;
}
for(i=0;i<4;i++){
for(j=0;j<3;j++){
for(k=0;k<... | 1 | 77,852,592 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if ( N <= 2 ){
cout << 0 << endl;
}
else if ( N%3 == 0 ) {
cout << N/3 << endl;
}
else {
cout << N/3 << endl;
}
} | 1 | 94,316,136 |
#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>
using namespace std;
int n, a, C[100005];
int main(){
cin >> n;
for(int i=0; i<n; ++i){
cin >> a;
C[a]++;
C[a+1]++;
C[a-1]++;
}
int ans = 0;
for(int i=0; i<100005; ++i) ans = max(ans, C[i]);
cout << ans << endl;
} | 1 | 60,953,340 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int x;
int i = 1;
while(true)
{
cin >> x;
if (x == 0)
{
break;
}
printf("Case %d: %d\n", i, x);
i++;
}
return 0;
} | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 1 | 8,999,917 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <memory.h>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include ... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll... | 1 | 20,368,172 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1E9 + 7;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<long long> dp(k + 1);
dp[0] = 1;
for (int i = 0, w; i < n; i++) {
scanf("%d", &w);
vector<long long> pre(k + 2);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll input(){
ll x=0,f=0;char ch=getchar();
while(ch<'0'||ch>'9') f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return f? -x:x;
}
const int N=107,M=1e5+7;
const ll mod=1e9+7;
ll dp[N][M],sum[M];
int a[N];
int main(){
in... | 1 | 19,522,581 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
cout<<max({a[0],a[1],a[2]})-min({a[0],a[1],a[2]})<<endl;
} | #include <bits/stdc++.h>
#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;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 1 | 76,842,052 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 100100100;
int main() {
int N;
cin >> N;
vector<P> R(N);
vector<P> B(N);
rep(i, N) ... | #include <bits/stdc++.h>
using namespace std;
bool compare(pair<int, int> a, pair<int, int> b) {
return a.second > b.second;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
vector<int> d(n);
vector<pair<int, int>> red(n);
vector<pair<int, int>> b... | 1 | 15,452,427 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;... | 1 | 77,118,981 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n,m;
vector<string> A(50),B(50);
bool isok(ll i, ll j) {
ll x,y;
for(x=0;x<m;x++) {
for(y=0;y<m;y++) {
if (A[i+x][j+y] != B[x][y] ) return false;
}
}
return true;
}
int main() {
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
char A[n][n];
memset(A, 0, sizeof(A));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) cin >> A[i][j];
}
char B[m][m];
memset(B, 0, sizeof(B)... | 1 | 11,857,088 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N,Y;
cin>>N>>Y;
int a1=-1;
int a2=-1;
int a3=-1;
for(int x=0;x<=Y/10000;x++){
for(int y=0;y<=Y/5000;y++){
if(10000*x+5000*y+1000*(N-x-y)==Y&&N>=x+y){
a1=x;
a2=y;
a3=N-x-y... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,y;
int i,j,flg=0;
scanf("%d %d",&n,&y);
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
if(n-(i+j)<0) {
break;
}
if(i+j+n-(i+j)==n&&y==i*10000+j*5000+(n-(i+j))*1000){
flg=1;
break;
}
}
if(flg==1) break;
}
if(flg==... | 1 | 33,026,030 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
lli n;
int main(void){
cin >> n;
if(n%2 == 1) cout << 0 << endl;
else{
n/=2;
lli a, b;
a = n;
b = 0;
lli j = 5;
while(j <= n){
b+=n/j;
j*=5;
}
cout << m... | #include <bits/stdc++.h>
using namespace std;
#define fastio {\
ios::sync_with_stdio(0);\
cin.tie(0);\
}
#define file {\
freopen("io\\in.txt", "r", stdin);\
freopen("io\\out.txt", "w", stdout);\
freopen("io\\err.txt", "w", stderr);\
}
#ifdef LOCAL
#define debug(args...) {\
string _s(#args);\
... | 1 | 41,757,180 |
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syos... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<fstream>
#include<stdlib.h>
#include<set>
#include<climits>
#include<cmath>
#include<memory.h>
#include<sstream>
#include<time.h>
using namespace std;
cons... | 1 | 46,586,867 |
#include<iostream>
#include<set>
using namespace std;
int main(){
while(1){
int n;
cin>> n;
if(n==0) break;
string f[n];
for(int i=0; i<n; i++) cin>> f[i];
int left, right;
int up=1, down=0;
left=right=down;
int next=up;
int cnt=0;
... | #include<iostream>
using namespace std;
int main(){
while(1){
int n,c=0;
cin>>n;
if(n==0)break;
string s,b;
for(int i=0;i<n;i++){
cin>>s;
if(s[0]!=b[0]&&s[1]==b[1])c++;
b=s;
}
cout<<c<<endl;
}
return 0;
} | 1 | 64,289,515 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<bits/stdc++.h>
using namespace std ;
#define endl '\n'
string make(string s,int k)
{
string ans="";
for(int i=0;i<k;i++)
ans+=s;
return ans;
}
int32_t main()
{
string s;
cin>>s;
int n=s.size();
if(n==1){
cout<<'0';return 0;
}
string f,se;
if(n&1){
f=make("01",n/2)+"0";
se=mak... | 1 | 21,207,949 |
#include<cstdint>
#include<vector>
#include<utility>
template<typename T>
class basic_union_find{
std::vector<T> data;
public:
basic_union_find(std::size_t s) :data(s, -1){}
T find(T t){ return data[t] < 0 ? t : data[t] = find(data[t]); }
T find(T t)const{ return data[t] < 0 ? t : find(data[t]); }
void unite(T t, ... | #include<cstdio>
#define rep(i,a) for( int i = 0; i != (a); ++i )
int par[10000], rank[10000];
void init( int n )
{
rep( i, n )
par[i] = i, rank[i] = 0;
return;
}
int find( int x )
{
if( x == par[x] )
return x;
else
return par[x] = find( par[x] );
}
void unite( int x, int y )
{
x = find( x );
y = find( y );... | 1 | 36,832,904 |
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
cin >> N;
vector <int> a(N + 1);
for(int i = 1 ; i <= N ; ++i){
cin >> a[i];
}
int current = 1;
int moves = 0;
for(int i = 1 ; i <= N && current != 2 ; ++i, ++moves){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int LED = 1;
vector<int> count(N,0);
count.at(0) = 1;
while(1){
LED = A.at(LED-1);
if(count.at(LED-1) == 1){
LED = -1;
break;
}else ... | 1 | 54,022,388 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
ll n,k;
cin >> n >> k;
vector<pair<ll,ll>> v(n);
rep(i,n)cin >> v[i].fi... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 1 | 93,341,033 |
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main(){
string a,b;
int i=0,j=0,an,bn,count=0;
cin >> a;
cin >> b;
a += a;
an = a.size();
bn = b.size();
if(a.find(b)!=std::string::npos){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<string.h>
using namespace std;
int judge();
char s[202],p[101];
int y;
int main()
{
cin>>s;
cin>>p;
y=strlen(s);
for(int i=0;i<y;i++){
s[y+i]=s[i];
}
if(judge())cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
int judge(){
int sum=0;
for(int i=0;i<y;i++){
for... | 1 | 12,688,072 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
string s;
cout << 0 << endl;
cin >> s;
if (s == "Vacant") return 0;
bool check = (s == "Male");
cout << N-1 << endl;
cin >> s;
if (s == "Vacant") return 0;
int l = 0;
int r = N... | #include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int q(int x) {
if (dp[x]) return dp[x];
cout << x << endl;
string s; cin >> s;
if (s == "Vacant") exit(0);
if (s == "Male") return dp[x] = -1;
return dp[x] = 1;
}
bool f(int s, int t) {
int o = (s - t) & 1;
if (o) return q(s) == q(t);
return q(s) !=... | 1 | 8,354,991 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long l... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
map<int,int> vmp;
for(int i = 0; i < n; i+... | 1 | 31,105,747 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 55,513,425 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll n... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | 1 | 62,773,716 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
string a,b,c;
cin >> a >> b >> c;
if(a.back() == b[0] && b.back() == c[0])
{cout << "YES";}
else{cout << "NO";}
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | 1 | 14,986,446 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 1000005
#define int long long
#define db(x) cout<<#x<<" ->"<<x<<endl
#define db2(x,y) cout<<#x<<"->"<<x<<", "<<#y<<" -> "<<y<<endl
#define db3(x,y,z) cout<<#x<<" -> "<<x<<" , "<<#y<<" -> "<<y<<" , "<<#z<<" -> "<<z<<endl
#define db4(w,x,y,z) cout<<#w <<" -> " <<... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int k,n;
int main(){
k=read(),n=read();
printf("%d\... | 1 | 83,156,218 |
#include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(i=0;i<(n);i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int inputValue(){... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | 1 | 66,628,554 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
#define fast_io(); std::ios_bas... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
}
b=a;
sort(a.begin(),a.end());
for(int i=0; i<n; i++){
if(a.at(n-1)-b.at(i)) cout << a.at(n-1) << endl;
else cout << a.at(n-2... | 1 | 55,962,420 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int mx = A.at(0) + (K - A.at(N - 1));
for (int i = 1; i < N; i++) {
mx = max(mx, A.at(i) - A.at(i - 1));
}
cout << K - mx << "\n";
} | #include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int k, n,i=0,ans=0,kaka=1000000;
cin >> k >> n;
vector<i... | 1 | 21,716,112 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
doub... | 1 | 49,393,313 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ub=N-1,lb=0;
bool lM,uM,mM;
string input;
cout << 0 << endl;
cin >> input;
if(input == "Vacant"){
return 0;
}else if(input=="Male"){
lM = true;
}else{
lM = false;
}
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
n--;
cout << n<<endl;
string s;
cin>>s;
if(s=="Vacant"){
return 0;
}
ll kiso=0;
while(true){
ll sa=(n-kiso)/2;
ll next=n-sa;
if(sa==0){
next=kiso;
}
cout << ... | 1 | 98,684,969 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main(){
int n; cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
sort(a, a+n);
int a_i = a[n-1];
int t1 = *lower_bound(a, a+n, (a_i+1)/2);
int t2 = *(lower_bound(a, a+n, (a_i+1)/2) - 1);
int a_j = -1;
if((a_i+1)/2 - t2 <= t1 - ... | 1 | 69,838,976 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
set<P> wh;
set<P> bl;
int main(){
int A, B; cin >> A >> B;
for(int i=0;i<A-1; i++){
wh.insert( make_pair(i/50 *2 , i%50 *2) );
}
for(int j=0; j<B-1; j++){
bl.insert( make_pair(99-j/50*2, j%50*2 ) );
}
cout <<10... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 1 | 55,358,111 |
#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 arr[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K; cin>>K;
cout << arr[K-1] << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
vector<int> vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int ... | 1 | 71,846,632 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,a[10001]={},t;
vector <int> res;
cin>>n;
for(int i=0;i<n&&cin>>t;i++) a[t]++;
for(int i=0,cnt=0;i<10001;i++) for(;a[i];a[i]--){
if(cnt) cout<<" "<<i;
else cout<<i;
cnt++;
}
cout<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAXN 2000005
#define MAXM 10000
int a[MAXN],b[MAXN];
int c[MAXM+1];
int n;
int main()
{
scanf("%d",&n);
memset(c,0,sizeof(c));
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
c[a[i]]++... | 1 | 31,099,431 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
int ans = 0;
for(int i = 0; i < k; i++){
if(a > 0){
ans++;
a--;
}else if(b > 0){
ans += 0... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k,k1;
cin >> a >> b >> c >> k;
long long ans;
k1=k;
k-=a;
if(k<=0){
ans=k1;
cout << ans << endl;
return 0;
}
k1-=a;
k-=b;
if(k<=0){
ans=a+k1*0;
cout << ans << endl;
return 0;
}
k1-=b;
k-=c;
if(k<... | 1 | 49,205,408 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int r; cin >> r;
cout << r*r << ... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | 1 | 49,428,150 |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "P... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
ll n,k;
cin>>n>>k;
ll ans=1;
for(int i=0;i<n;i++){
if(ans<=k){
ans=ans*2;
}else{
ans+=k;
}
}
cout<<ans<<endl;
} | 1 | 38,630,552 |
#include <stdio.h>
#include <stdlib.h>
int main(void){
int a;
int b;
int c;
int d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if (abs(a-c)<=d){
printf("Yes\n");
}else if(abs(a-b)<=d && abs(b-c)<=d){
printf("Yes\n");
}else{
printf("No\n");
}
return 0;
} | #include<iostream>
using namespace std ;
int main(){
int a,b,c,d ;
cin >> a >> b >> c >> d ;
if(-1*d<=a-b&&a-b<=d&&-1*d<=b-c&&b-c<=d) cout << "Yes" << endl ;
else if(-1*d<=a-c&&a-c<=d) cout << "Yes" << endl ;
else cout << "No" << endl ;
} | 1 | 60,730,612 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.