code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
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 (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
if(a < h) continue;
if(b < w) continue;
ans++;
}
cout << ans << endl;
} | 1 | 88,949,061 |
#include <iostream>
#include <stdio.h>
#define MAX 100005
#define NIL -1
struct Node {
int parent, left, right;
};
Node T[MAX];
int n, D[MAX];
void rec(int u, int p) {
D[u] = p;
if (T[u].right != NIL) rec(T[u].right, p);
if (T[u].left != NIL) rec(T[u].left, p+1);
}
void printChildren (int id) {
pri... | #include<iostream>
#include<cstdlib>
#include<cstdio>
#define N 100001
#define NIL -1
using namespace std;
int parent[N];
int leftc[N];
int rightc[N];
int degree[N];
int depth[N];
int root;
int main(){
int n,i,j,id,child,bef;
int flag=0;
for(i=0;i<N;i++){
parent[i]=NIL;
leftc[i]=NIL;
rightc[i]=NIL;
... | 1 | 11,262,970 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
vector<ll> xv,yv;
int main(){
ll n,k;
cin>>n>>k;
vector<P> vec;
for(int i=0;i<n;i++){
ll x,y;
cin>>x>>y;
vec.push_back(P(x,y));
xv.push_back(x);
yv.push_b... | 1 | 80,120,991 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF (2147483647)
#define MOD (int)(1e9 + 7)
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
double ans = 0;
double s;
cin >> s;
int res = (s/3);
double min = res * res * res;
if((int)s%3 == 0) {... | #include <stdio.h>
int main() {
int L;
scanf("%d", &L);
printf("%.12f\n", (double)L * L * L / 27);
} | 1 | 53,911,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i, cnt=0;
cin >> s;
if ((s[0] == s[1] && s[1] == s[2]) || (s[1] == s[2] && s[2] == s[3]))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
if((s[0]==s[1] && s[1]==s[2]) || (s[1]==s[2] && s[2]==s[3])) cout << "Yes" << "\n";
else cout << "No" << "\n";
return ... | 1 | 38,400,747 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
string s;
cin >> s;
string y = s.substr(0, 4);
string... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int year, month, day;
string S, heisei;
heisei = "2019/04/30";
cin >> S;
if (S > heisei)
cout << "TBD\n";
else
cout << "Heisei\n";
return;
}
int ... | 1 | 44,179,942 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
string s;;
cin >> s;
if(s[0]!='A'){
... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
bool flg=true;
if(s[0]!='A')flg=false;
ll cnt=0;
for (in... | 1 | 99,005,549 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a,b,c;
cin>>a;
cout<<180*(a-2)<<'\n';
return 0;
} | 1 | 29,085,341 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string R="";
for(int i = 0;i<s.size();i++){
if((i + 1)% 2 !=0) R+=s[i];
}
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s;
string ans = "";
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
ans += s[i];
}
}
cout << ans << endl;
return 0;
} | 1 | 48,445,091 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int LOG = 20;
int n, len, q;
int a[MAXN];
int par[LOG][MAXN];
set <int> st;
map <int, int> mp;
void gen () {
for (int i=n; i>=1; i--) {
auto it = st.upper_bound(a[i] + len);
if (it == st.begin()) {
st.insert(a[i]... | #include <bits/stdc++.h>
using namespace std;
int N, L, Q;
int X[100005];
int dp[31][100005];
int trial(int a, int x) {
int cur = a;
for (int i = 30; i >= 0; i--) {
if (x & (1 << i)) {
cur = dp[i][cur];
}
}
return cur;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >>... | 1 | 84,716,279 |
#include<iostream>
using namespace std;
int main(){
int n,m,p,x[100],total;
while(1){
cin>>n>>m>>p;
if(!(n||m||p))break;
total=0;
for(int i=0; i<n; i++) cin>>x[i],total+=x[i];
if(x[m-1]!=0) total = total*(100-p)/x[m-1] ;
else total = 0;
cout<< total <<endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p) {
if (n == 0 && m == 0 && p == 0) {
break;
}
int t[110] = {0};
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
sum += t[i];
}
sum *= (100-p);
if (t[m-1] == 0) {
cout << 0 << endl;
} else... | 1 | 48,806,483 |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000... | #include<iostream>
#include<stdio.h>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#defin... | 1 | 44,881,312 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int ans=0,n,a,b;
cin>>n;
for(int i=1;i<=n;i++)
ans+=(i*(n-i+1));
for(int i=1;i<=n-1;i++)
{
cin>>a>>b;
if(a>b)swap(a,b);
ans-=(a*(n-b+1));
}
cout<<ans<<"\n";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 1 | 88,167,562 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int a,b,c,d,e=0;
cin>>a>>b>>c>>d;
a--;
int p= b-a;
int q= b/c -a/c;
int r= b/d -a/d;
int s= (c*d)/ __gcd(c,d);
int t= b/s - a/s;
cout<<(p-q-r+t);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
long gcd(long a,long b){
if (a%b==0){
return(b);
}
else{
return(gcd(b,a%b));
}
}
long lcm( long m, long n ){
if ( ( 0 == m ) || ( 0 == n ) )
return 0;
retur... | 1 | 98,020,833 |
#include <iostream>
using namespace std;
int main() {
long long h, w;
cin >> h >> w;
if (h == 1 || w == 1) cout << 1 << '\n';
else cout << (h * w + 1) /2 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, w;
cin >> h >> w;
bool heven = h%2==0;
bool weven = w%2==0;
long long ans;
if (h!=1 && w!=1 ) {
if (heven && weven)
ans = h * w / 2;
else if (!heven && weven)
ans = w / 2 * h;
else if (heven && !weven)
ans ... | 1 | 89,471,831 |
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | #include <iostream>
using namespace std;
int main(){
int K,X;
cin >> K >> X;
if (500*K >= X ) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 1,706,512 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if(N==1){cout<<1<<endl;}
else if(N<=3){cout<<2<<endl;}
else if(N<=7){cout<<4<<endl;}
else if(N<=15){cout<<8<<endl;}
else if(N<=31){cout<<16<<endl;}
else if(N<=63){cout<<32<<endl;}
else {cout<<64<<endl;}
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 5,541,902 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
int main(){
int n; cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin>>a[i];
b[i]=a[i]-i;
}
sort(b.begin(),b.end());
int median=b[b.size()/2];
long int sum=0;
for(int i=0;i<n;i++){
sum+=abs(... | #include <iostream>
#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 <unordered_set>
#include <u... | 1 | 27,152,751 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void ... | 1 | 72,645,314 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int a,b;cin>>a>>b;
cout<<(a*b%2?"Odd":"Even")<<endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | 1 | 80,300,962 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename ... | 1 | 28,426,405 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n, m; cin >> n >> m;
vector<pair<long long, long long>> d(n);
for (int i = 0; i < n; i++)
{
long long a, b;
cin >> a >> b;
d[i] = make_pair(a, b);
}
sort(d.begin(), d.end());
long long res = 0;
int i = 0;
while (m > 0)
{
long long buy... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, int>> v;
rep(i, n) {
ll a;
int b;
cin... | 1 | 73,870,166 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#define endl "\n"
const int MOD = 1000000007;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int a, b, sum = 0;
cin >> a >> b;
int ara[a];
for(int i = 0 ; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#define all(x) x.begin(), x.end()
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
reverse(all(a));
int ans = 0;
rep(i, k) ans += a[i];
cout <<... | 1 | 61,502,559 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <v... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> memo1(n+1, 1001001001);
vector<int> coins;
coins.push_back(1);
for(int i = 6; i <= n; i *= 6) coins.push_back(i);
for(int i = 9; i <= n; i *= 9) coins.push_back(i);
memo1[0] = 0;
for(i... | 1 | 23,483,169 |
#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 a;
string b;
cin>>a>>b;
ll B=100*(b[0]-'0')+10*(b[2]-'0')+b[3]-'0';
ll ans=a*B;
ans/... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const ll INF = 1e18;
const int MAX = 1e6;
struct... | 1 | 46,768,796 |
#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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) ... | 1 | 68,144,601 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 1 | 4,130,471 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int m, n, i, cnt = 0, sum = 0;
float x;
cin>>n>>m;
int a[n];
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(i = 0; i<n; i++)
{
sum += a[i];
}
x = (1.0/(4.0*m))*sum;
for(i = 0; i<n; i++)
{
if(a[... | 1 | 84,560,519 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Y;
cin>>N>>Y;
for(int x=0;x<=N;x++){
for(int y=0;y<=N;y++){
int z=N-(x+y);
if(z>=0 && 10000*x+5000*y+1000*z==Y){
cout<<x<<' '<<y<<' '<<z<<endl;
return 0;
}
}
}
cout<<-1<<' '<<-1<<' '<<-1<<endl;
return 0... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,y,i,j,k,ans,flag=0;
cin>>n>>y;
for(i=0;i<=n;i++){
for(j=0;j<=n-i;j++){
ans=(10000*i)+(5000*j)+(1000*(n-i-j));
if(ans==y){flag=1;break;}
}
if(flag) break;
}
if(flag) cout<<i<<" "<<j<<" "<<n-i-j;
else cout<<-1<<" "<<-1<<" ... | 1 | 54,683,930 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EP... | #include<cstdio>
int main(){int N,K;scanf("%d%d",&N,&K);printf("%d\n",N-K+1);} | 1 | 75,310,426 |
#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 MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int N,Y;
cin>>N>>Y;
int res10000=-1,res5000=-1,res1000=-1... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main()
{
int n,y;
int a,b,c;
cin >> n >> y;
a = b = c = -1;
for (int i = 0;i <= n;++i)
for (int j = 0;j <= n-i;++j) {
int k = n - i - j;
... | 1 | 13,560,696 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstdlib>
#include <cmath>
#include<stdio.h>
#define MAX 1000000000000000000LL
long long inf=1000000007;
using namespace std;
int parent(int i){return i/2;}
int left(int i){return 2*i;}
int right(int i){return 2*i+1;}
int main(){
int H... | #include <iostream>
#include <cstdio>
using namespace std;
#define MAX 250
int H, T[MAX + 1];
void print(int node) {
printf("node %d: key = %d, ", node, T[node]);
if (node > 1) printf("parent key = %d, ", T[node / 2]);
if (2 * node <= H) printf("left key = %d, ", T[2 * node]);
if (2 * node + 1 <= H) printf("right k... | 1 | 29,556,202 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
ll N;cin>>N;
vector<ll> b(N);
rep(i,N)cin>>b[i],b[i]=b[i]-(i+1);
sort(b.begin(),b.end());
ll m = (b.size()%2==0 ? (b[(N-1)/2+1]+b[(N-1)/2])/2 : b[(N-1)/2]);
ll ans = 0;
rep(i... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 57,264,009 |
#include <iostream>
using namespace std;
int main(){
int A[2000001], B[2000001], C[10001], n;
for(int i = 0; i <= 10000; i++) C[i] = 0;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> A[i];
C[A[i]]++;
}
for(int i = 1; i <= 10000; i++) C[i] += C[i-1];
for(int i = n; i > 0; i--){
B[C[A[i]]] = A[i]... | #include <bits/stdc++.h>
using namespace std;
#define MAX 10000
void count_sort(int A[],int n){
int i,k;
int B[n],C[MAX+1]={0};
for(i=0;i<n;i++){
C[A[i]]++;
}
k=0;
for(i=0;i<MAX+1;i++){
if(C[i]>0){
C[i]+=k;
k=C[i];
}
}
for(i=n-1;i>=0;i--){
... | 1 | 25,074,769 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T num_div(T x) {
T res = 0;
for (T i = 1; i * i <= x; i++) {
if (x % i == 0) {
res++;
if (i * i != x) res++;
}
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ans = 0;
f... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(... | 1 | 34,795,598 |
#include <bits/stdc++.h>
using namespace std;
int inputAppleInfo(int nApples, deque<int>& apples, int arrayLength){
for (int i = 0; i < nApples; i++){
int p;
cin >> p;
apples.push_back(p);
}
sort( apples.begin(), apples.end(), greater<int>());
while (apples.size() > arrayLength){... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 100005
#define ll long long
#define DEBUG
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << " "
#else
#define debug(x) ;
#endif
int x, y, a, b, c;
int p[maxn], q[maxn], r[maxn];
vector<int> ans, co;
int main() {
cin.tie(0);
... | 1 | 42,944,051 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
int num(string s){
int i=0, ans=0;
map<char, int> ctoi;
ctoi['m']=1000;
ctoi['c']=100;
ctoi['x']=10;
ctoi['i']=1;
while(i<s.size()){
int a=1;
if(isdigit(s[i])){
a=s[i]-'0';
i++;
}
ans+=a*ctoi[s[i]];
i++;
}... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 1 | 96,033,634 |
#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 (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll h,n;
cin>>h>>n;
ll ah[1002],bm[1002];
ll ch[20010];
ch[0]=0;
for(ll i=1;i<20010;i++){
ch[i]=INF;
}
for(ll i=0;i<n;i++){
cin>>ah[i]>>bm[i];
}
ll ans=INF;
for(ll i=0;i<h;i++){
f... | 1 | 12,082,571 |
#include<bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp,-1,sizeof(dp))
const ll mod = 1e9+7;
void _IOS(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);}
#define PI 3.14159265359
int sx,sy,tx,ty;
struct threeElements{
int _1st,_2nd,_3rd... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <string.h>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
for (int i=0; i<s.length(); i++) {
c... | 1 | 29,564,046 |
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<map>
#include<algorithm>
using namespace std;
void Trace(vector<pair<char, char> > card)
{
for(int i = 0; i < card.size(); i++) {
if (i) {
cout << " ";
}
cout << card[i]... | #include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
using namespace std;
struct P {
int id;
char name;
};
P newP(int id, char name){
P *v = new P;
v->id = id; v->name = name;
return *v;
}
void swap(P& a, P& b){
P h = newP(a.id, a.name);
a = b;
b = h;
}
bool check(vector<P>& A, vector<P> ... | 1 | 29,868,613 |
#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 <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 1 | 34,222,372 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int mi=10000000,k=0,sums=0,sum=0,co=0;
vector<int> a(5);
for(int i=0;i<5;++i){
cin>>a[i];
sums+=a[i];
if(a[i]%10==0){
a[i]-=10;
++co;
}
if(mi>a[i]%10&&a[i]%10!=0){
mi=a[i]%10;
k=i;
}
}
if(co==5... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int main(){
int A, B, C, D, E;
cin >> ... | 1 | 78,441,570 |
#include <iostream>
#include <string>
using namespace std;
bool test(int n){
int pre = n%10;
n /= 10;
while(n != 0){
if(pre != n%10) return false;
n /= 10;
}
return true;
}
int main(){
int n;
cin >> n;
while(1){
if(test(n)){
cout << n << endl;
... | #include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p = 1e9, ans = 1e9;
string bigG;
cin >> n;
if(n <= 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100)){
cout << 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100);
}else{
cout << ... | 1 | 7,308,192 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - k) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 1 | 39,647,110 |
#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... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n, m;
cin >> n >> m;
ll ans = 0;
ll a, b;
vecto... | 1 | 16,854,446 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#define MX 200005
#define INF (1<<30)
#define EPS 1e-9
#define MOD 1000000007
#define mid (x+xend)/2
#define izq nod*2
#define der nod*2+1
#define fr first
#define sc second
#define pb p... | #include <bits/stdc++.h>
#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 outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 1 | 94,945,825 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int main() {
while (true) {
int a, b;
cin >> a >> b;
if (a == 0 && b == 0)break;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
if... | #include<iostream>
int main()
{
int a[300], b[300];
int i = 0;
int j = 0;
int v = 0, t = 0;
for ( int i = 0; i < 300; i++ )
{
std::cin >> a[i] >> b[i];
if ( a[i] == 0 && b[i] == 0 )
{
break;
}
else
{
j++;
}
}
for ( int i = 0; i < j; i++ )
{
for ( int v = 0; v < a[i]; v++ )
{
for... | 1 | 37,999,802 |
#include <stdio.h>
int main(){
int i,x;
for(i=1;;i++){
scanf("%d",&x);
if(x == 0){
break;
}
else{
printf("Case %d: %d\n",i,x);
}
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int count = 0, x = 0, a[10000] = { 0 };
while (1){
cin >> x;
if (x == 0) break;
a[count] = x, count++;
}
for (int i = 1; i <= count; i++) cout << "Case " << i << ": " << a[i - 1] << endl;
return 0;
} | 1 | 37,920,978 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
ll n,k;
cin>>n>>k;
ll hun=500;
if(n*hun>=k)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a*500>=b? "Yes":"No")<<endl;
} | 1 | 50,609,942 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main(){
ll n;cin >> n;
string s; cin >> s;
ll r=0,g=0,b=0;
for(int i=0;i<n;i++){
if(s.at(i) == '... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n,i,j,a=0,b=0,c=0;
cin>>n;
string s;
cin>>s;
for(i=0;i<n;++i)
{
if(s[i]=='R') ++a;
if(s[i]=='G') ++b;
if(s[i]=='B') ++c;
}
ll ans = 1ll*a*b*c,cnt=0ll;
for(i=0;i<n;++i)
{
for(j=i+1;j<n;++j)
{
if(j+j-i<n&&s[i... | 1 | 5,232,840 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
long double A[N];
for (int i = 0; i < N; i++)
{
A[i] = 0l;
cin >> A[i];
}
long double sum = 0l;
for (int i = 0; i < N; i++)
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
using ll = long long;
int main(){
int a,b;
double sum=0;
cin >> a;
rep(i,a){cin >> b;sum += 1.0/b;}
cout << fixed << setprecision(15) << 1.0/sum << endl;
return 0;
} | 1 | 36,856,640 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(1 << n);
for (int i = 0; i < (1 << n); i++)
scanf("%d", &a[i]);
vector<vector<int>> v(1 << n);
for (int i = 0; i < (1 << n); i++)
v[i].push_back(a[i]);
for (int j = 0; j < n; j++) {
for (int i = 0;... | 1 | 59,366,254 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1LL << 60;
signed main(void){
int n,k; cin >> n >> k;
vector<int>a(n);
for(int i = 0; i < n; i++){ cin >> a[i];}
int ans = inf;
for(int bit = 0; bit < (1<<n); bit++){
vector<bool> vec(n,false); int cnt = 0;
for(int i =... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_N = 15;
const ll INF = 1000100100100100100;
int main()
{
int n, k; cin... | 1 | 95,121,565 |
#include<bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i=0; i < n; i++)
#define repran(i, a,b) for (int i = a; i<b;i++)
#define repd(i, n) for (int i = n-1; i > -1; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using LP = pair<ll,ll>;
using P = pair<int,int>;
const ll inf = 1e9;
int ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h; cin>>h; int n; cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
vector<int> dp(h+1,0x3f3f3f3f);
dp[0]=0;
for(int i=1;i<=h;i++){
for(int j=0;j<n;j++){
if(a[j]>i){dp[i]=min(dp[i],b[j]); }
else dp[i]=min(dp[i],dp[i-a[j]]+b[j]);
}
}
cout<... | 1 | 69,768,336 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
int fnum = s%10;
int snum = (s/10)%10;
int tnum = (s/100)%10;
if(tnum > snum){
cout << tnum << tnum << tnum <<endl;
}
else if (tnum == snum){
if(snum >= fnum){
cout << tnum << tnum << t... | 1 | 90,883,750 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int mod = 1000000000+7;
int main(){
string s,t;
cin>>s>>t;
string ans="";
int flag=-1;
rep(i,s.size()){
if(s[i]=='?' || s[i]==t[0]){
int j=i+1;
while(j<s.size() && j-i<t.size()){
if(s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S, T;
cin >> S >> T;
int lenS = S.si... | 1 | 66,812,609 |
#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 req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
ll n;
cin >> n;
vector<P> v;
for (ll i = 2; i * i <= n; ++i) {
int cnt = 0;
while (n % i == 0) {
n /= i;
++cnt;
}
if (cnt) v... | 1 | 23,126,086 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define F... | #include<cmath>
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cctype>
using namespace std;
int main() {
char s;
while (1) {
scanf("%c", &s);
if (s == '\n')break;
if (islower(s))s = toupper(s);
else if (isupper(s))s = tolower(s);
printf("%c",s);
}
cout << endl;
return 0;
} | 1 | 65,327,299 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a.at(i);
for(int i = 0; i < k; i++){
vector<int> sum(n);
for(int j = 0; j < n; j++){
int l = max(0, j-a.at(j)), r = min(n, j+a.at(j) + 1);
if(r < n) sum.a... | 1 | 16,724,523 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
string s; cin >> s;
deque<char> d;
for (auto &e : s)
d.push_back(e);
ll res{0};
while (d.size() > 1)
{
char f = d.front();
char b = d.back();
if ... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (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;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
string s;
cin >> s;
int n = s.length();
int l ... | 1 | 43,669,778 |
#include<iostream>
using namespace std;
int main(){
int a,b;
int count;
while(1){
count = 0;
cin >> a;
if( a == 0) break;
b = 1000 - a;
a = b%500;
count = count + b/500;
b= a%100;
count = count + a/100;
a = b%50;
count = count + b/50;
b = a%10;
count = count + a/10;... | #include <cstdio>
using namespace std;
const int coin[] = {500,100,50,10,5,1};
int main() {
int n;
while (scanf("%d",&n)&&n!=0) {
int res=0,turi=1000-n,m=0;
while (turi!=0) {
if (turi<coin[m]) {
m++;
} else {
turi -= coin[m];
res++;
}
}
printf("%d\n",res);
}
} | 1 | 26,062,664 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int M, K; std::cin >> M >> K;
if(M == 0) {
if(K > 0) fin(-1);
fin("0 0");
}
if(M ... | 1 | 10,506,746 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int x,t;
cin >> x >>t;
if(t >= x) cout << 0 << endl;
else cout << x-t << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int X, t;
cin >> X >> t;
cout << max(X-t, 0) << "\n";
return 0;
} | 1 | 631,255 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define cw(x) cout << (x) << endl
#define cww(x,y) cout << (x) << ' ' << y << endl
#define cwa(x) for(auto a:x) cout << a << ' ';cout << endl
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
typedef long long ll;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
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; }
int main() {
... | 1 | 28,598,985 |
#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>;
const long long INF = 1ll << 60;
int main() {
int A, P; cin >> A >> P;
int S = (A * 3 + P) / 2;
cout << S << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int n,p;
cin>>n>>p;
cout<<(n*3+p)/2;
} | 1 | 39,015,327 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
#define N 100005
#define mod 1000000007
int p[N];
int lmini[N],lmaxi[N];
int rmini[N],rmaxi[N];
bool hasLeft[N],hasRight[N];
void... | 1 | 10,471,306 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i<(n);i++)
#define fore(i,a) for(auto &i:a)
#define debug(a,b) cout << "debug : " << a << " , "<< b << endl
using ll=long long;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
const ll INF=1LL<<60;
cons... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
struct edge... | 1 | 90,793,301 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << (A + B >= C ? "Yes" : "No") << endl;
} | #include <iostream>
using namespace std;
int main(void){
int a,b,x;
cin >> a >> b >> x;
if(a+b >= x) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 60,132,735 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<float>v(n);
for(int i=0;i<n;i++)
{
cin >> v.at(i);
}
sort(v.begin(),v.end());
float f=v.at(0);
for(int i=1;i<n;i++)
{
f=(f+v.at(i))/2.0;
}
cout <<fixed << setprecision(15) << f << endl;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n;
cin>>n;
vector<int> v(n);
... | 1 | 59,823,033 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("../data.txt");
string s;
int stones, n;
int main() {
getline(cin, s);
n = s.size();
for (int i = 1; i < n; i++) {
if (s[i] != s[i-1]) stones++;
}
cou... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
#include <list>
#include <deque>
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a,... | 1 | 79,286,940 |
#define MAX_VALUE 10000
#include<iostream>
using namespace std;
int main() {
int n;
int backet[MAX_VALUE + 1] = { 0 };
cin >> n;
int* a = new int[n];
int work;
for (int i = 0;i < n;i++) {
cin >> work;
backet[work]++;
}
int count = 0;
for (int i = 0;i <= MAX_VALUE;i++) {
for (int j = 0;j < backet[i];j++) ... | #include <iostream>
#define k 10000
using namespace std;
void CountingSort(int a[],int b[],int n){
int cnt[k+1];
for(int i=0;i<=k;i++) cnt[i]=0;
for(int i=1;i<=n;i++) cnt[a[i]]++;
for(int i=1;i<=k;i++) cnt[i]=cnt[i]+cnt[i-1];
for(int j=1;j<=n;j++){
b[cnt[a[j]]]=a[j];
cnt[a[j]]--;
}
}
int main(){
i... | 1 | 1,524,889 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
ll N = S.size();
ll cnt = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1]) {
if(S[i]=='0'){
S[i] = '1';
cnt++;
}
else if(S[i]=='1'){
... | #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;
cin >> s;
int n = s.size();
int ans = n;
rep(i, 2) {
int now = 0;
char c = i + '0';
rep(j, n) {
if ((j % 2 == 0) ^ (s[j] == c)) ++now;
}
ans... | 1 | 84,434,224 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[1<<26];
int val[214514];
int ans[214514];
signed main(){
string str;
cin>>str;
int n = str.size();
for(int i=1;i<=n;i++){... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for( int i = 0; i < (n); i++ )
#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<int, Pii> Pip;
con... | 1 | 40,854,954 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.141592653589793238
#define INF 1050... | #include<iostream>
using namespace std;
#include<map>
#include<vector>
#include<cmath>
#define int long long int
int power(int a,int b)
{
int x=pow(a,b);
return x;
}
int solve(int val)
{
int j;
if(val>0)
{
int sum=0;
for(j=0;;j+=2)
{
sum+=power(2,j);
if(sum>=val)
{
return j;
}
}
}
else
{... | 1 | 15,719,138 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = 0;
for (int ii = 0; ii < N; ++ii){
int H;
cin >> H;
if (H >= K){
ans++;
}
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <regex>
#include <set>
#include <cmath>
#include <sstream>
#include <numeric>
#include <set>
int main()
{
long long n, k;
std::cin >> n;
std::cin >> k;
std::vector<long long> heights;
for(long long i = 0; i < n; i+... | 1 | 16,202,767 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int R;
cin >> R;
if (R < 1200) ... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int iy[]={0, 0, 1, -1};
int ix... | 1 | 89,758,287 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n;
bool C(ll k){
ll sum = k * (k + 1) / 2;
return sum >= n;
}
int main(){
cin >> n;
ll ok = n, ng = 0;
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
if (C(mid)... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
bool ok(int x){
int m = n - x;
LL sum = 1LL * x * (x - 1) / 2;
if(sum < m) return 0;
return 1;
}
int main(){
while(~scanf("%d", &n)){
int low = 1, top = n, ans = n, mid;
while(low <= top){
mid = low + top >> 1;
if(ok(m... | 1 | 61,512,515 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ty... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<long long, int> prime_factorize(long long n) {
map<long long, int> res;
for (long long p = 2; p * p <= n; ++p) {
while (n % p == 0) { ++res[p]; n /= p; }
}
if (n != 1) res[n] = 1;
return res;
}... | 1 | 71,335,401 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
usin... | #include <bits/stdc++.h>
using namespace std;
int dp[105][105];
char c[105][105];
int main(){
int h,w;
cin >> h >> w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> c[i][j];
}
}
if(c[0][0]=='#')dp[0][0]=1;
for(int i=0;i<h;i++){
if(i>0){
if(c[i-... | 1 | 36,650,110 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n,i,j=0,sm1=0;
string s;
cin>>s;
n=s.size();
if(s.size()==1)cout<<-1<<' '<<-1;
else if(s.size()==2)
{if(s[0]==s[1])cout<<1<<' '<<2;
else cout<<-1<<' '<<-1;
}
else
{
for(i=0;i<n-3;i++)
{map<char,int>m;
for(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>Vl;
typedef pair<int,int>PII;
typedef vector<PII>Vll;
typedef vector<pair<int,pair<int,int> > >Vlll;
typedef priority_queue<int>PQL;
typedef map<int,int>MP;
#define S second
#define F first
#define mp make_pair
#define ms(x,y) memset(... | 1 | 64,220,718 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef priority_queue<PP, vector<PP>, greater<PP>> PPQueue;
#define fi first
#define se second
... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lowe... | 1 | 16,211,689 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 1e9+7;
int maxn;
int vis[100005];
LL fac[100005]={1,1};
LL inv[100005]={1,1};
LL fi[100005]={1,1};
void init()
{
for(int i=2; i<=100005; ++i)
{
fac[i] = fac[i-1]*i%mod;
inv[i] = (mod-mod/i)*inv[mod%i]%mod;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=... | 1 | 36,025,825 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ;
cin >> n;
long long y;
cin >> y;
int a =-1; int b=-1; int c=-1;
for(int i=0;i<=n;i++){
for(int j=0;j<=n-i;j++){
int k = n-i-j;
if(10000*i+5000*j+1000*k==y){
a = i; b=j; c=k;
break;
}
}
}
cout << a... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
ll n,Y; cin >> n >> Y;
ll sum;
REP(i,n+1){
... | 1 | 51,781,471 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> l(2*n);
for(int &x : l) cin>>x;
sort(l.begin(),l.end());
int ans=0;
for(int i=0;i<2*n;i+=2) ans+=l[i];
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 1666666
#define inf 9999999999999
int n;
int arr[N];
signed main(){
cin>>n;
for(int i=1;i<=2*n;i++) cin>>arr[i];sort(arr+1,arr+1+2*n);
int ans=inf;int l=1;int s=0;
for(int i=1;i<=2*n;i++) if(i%2) s+=arr[i];
cout<<s;
return 0;
} | 1 | 45,669,841 |
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define ll long long int
#define vl vector<ll>
#define mid(a,b) ((a+b)/2)
#define pb push_back
cla... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
char c;
cin >> c;
printf("%c\n", c + 1);
return 0;
} | 1 | 32,456,931 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
const int maxm=1e6+5;
int a[maxm];
int n;
signed main(){
cin>>n;
for(int i=1;i<=n*2;i++)cin>>a[i];
int ans=0;
sort(a+1,a+1+n*2);
for(int i=1;i<=n*2;i+=2){
ans+=min(a[i],a[i+1]);
}
cout<<ans<<... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(2 * N);
rep(i, 2 * N) cin >> L[i];
sort(L.begin(), L.end());
int ans... | 1 | 77,897,353 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,b) for(ll i=(b)-1, i>=a; --i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scanv(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No")... | 1 | 71,840,791 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";new... | #include<stdio.h>
long long x, y, z;
int main() {
scanf("%lld%lld", &x, &y);
z = x + y;
if(x % 3 != 0 && y % 3 != 0 && z % 3 != 0) printf("Impossible\n");
else printf("Possible\n");
return 0;
} | 1 | 82,945,844 |
#include <bits/stdc++.h>
using namespace std;
#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 _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define tc ll t; cin >> t; while (t--)2 2
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#defin... | 1 | 75,880,552 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
using Vvec = vec... | 1 | 95,781,016 |
#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 (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
using ll =long long ;
int main() {
string A,B,C;
cin>>A>>B;
C=B+A;
cout<<C<<endl;
} | 1 | 73,921,201 |
#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;
vector<int> h(n);
int ans = 0;
rep(i, n)
{
cin >> h[i];
if (k <= h[i])
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,k=0;
cin>>N>>K;
for(int i=0;i<N;i++){
int j;
cin>>j;
if(j>=K)
k++;
}
cout<<k<<endl;
} | 1 | 18,411,312 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
for(ll i = 0; i < N; i++){
cin >> A[i];
}
sort(A.begin(),A.end());
ll cnt = 0;
for(ll i=1; i<N; i++){
if(A[i-1] == A[i]){
cnt += 1;
}
}... | #include<bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)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<int > vecint;
typedef vector<vector<int> > vec2int;
ty... | 1 | 96,785,996 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m), n){
typedef pair<int, int> P;
vector<P> v;
int res = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
v.push_back(P(b, a));
res += a * b;
}
sort(v.begin(), v.end());
reverse(v... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
type... | 1 | 49,112,663 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll q,h,s,d,n;
cin >> q >> h >> s >> d >> n;
if(h>q*2)h=q*2;
if(s>h*2)s=h*2;
if(d>s*2)d=s*2;
cout << n/2*d+n%2*s;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
using namespace std;
typedef long long ll;
int main(){
int q,h,s,d;
ll n = 0;
cin >> q >> h >> s >> d >> n;
int l2 = 0;
int l1 = 0;
l2 = min(d,s * 2);
l2 = m... | 1 | 69,194,423 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
cout<<(s.substr(0,4)=="YAKI" ? "Yes":"No")<<endl;
} | #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;}
const long long INFLL = 1LL<<60;
const int INF = 1<<28;
void solve(int a){cout<<( a?"Yes":"N... | 1 | 31,279,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for ( int i = 0; i < (int)(n); i++ )
int main( void )
{
string s1,s2,s3;
cin >> s1 >> s2 >> s3;
char ans[3] = {s1[0] - 0x20,s2[0] - 0x20,s3[0] - 0x20};
cout << ans << endl;
} | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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>;
int main(void) {
string s;
string ans;
rep(i, 3) {
cin >> s;
ans.push_back(toupper(s[0]... | 1 | 14,518,920 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | #include<iostream>
#include<math.h>
using namespace std;
int main(){
long long a,b,c,d=0,e=0;
cin>>a>>b;
a*=3;
a+=b;
a/=2;
cout<<a;
return 0;
} | 1 | 20,567,649 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>
using namespace std;
class DICE
{
private:
void swapMap(string a, string b);
public:
map<string,int> dice;
DICE(vector<int> &v);
~DICE();
void turnDice(char c);
void ro... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(fa... | 1 | 64,142,935 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, k;
int v[50];
signed main() {
cin >> n >> k;
rep(i,n) cin >> v[i];
int ans = 0;
for (int a=0; a<=min(n,k); a++ )
for(int b=0; b<=min(n,k) - a; b++)
{
multiset<int> s;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N, K;
cin >> N >> K;
deque<ll> D;
rep(i, N) {
ll v;
cin >> v... | 1 | 63,854,538 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.