code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0; ... | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
string split(string str, char c) {
string res;
for (int i = 0; i < str.length(); i++) {
if (str[i] == c) {
break;
}
else {
res += str[i];
}
}
return res;
}
st... | 1 | 95,874,164 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | #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... | 1 | 24,482,520 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
int a, b, k;
scanf("%d%d%d", &a, &b, &k);
for(int i=0;i<k;i++){
if(i%2 == 0){
if(a%2 != 0) a--;
b += a/2;
a/=2;
}
else{
if(b%2 != 0) b--;
a += b/2;
... | 1 | 57,080,562 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;cin>>n;
for (int i=0;i<100/4+1;i++){
for (int j=0;j<100/7+1;j++){
if (4*i + 7*j == n) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | 1 | 45,521,095 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
if(C >= A && C<= B){
cout << "Yes"; return 0;
}
else{
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
if((c>a&&b>c)||(c==a&&b>c)||(c>a&&b==c)||(c==a&&c==b)){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 1 | 60,413,777 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 1 | 26,579,495 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
string a;
for(int i = 0; i < s.size(); i+=2){
a+=s.at(i);
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for(int i=0; i<(S.size()-1)/2+1; i++){
cout << S[i*2];
}
} | 1 | 8,309,507 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(a,b,c) for(int i=a;i<b;i+=c)
typedef pair<ll , pair<ll, ll> > pi;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res*=x;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
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() {
int A, B, C;
cin >> A >> B >> C;
int P = A % B;
int X = P;
int co = 2;
int tf;
while(true)... | 1 | 34,414,751 |
#include <iostream>
#include <vector>
#include <string>
#include <cctype>
using namespace std;
int getAlphabetIndex(char ch)
{
if (isalpha(ch))
{
if (isupper(ch))
{
ch = tolower(ch);
}
return ch - 'a';
}
else
{
return -1;
}
}
int main()
{
string sentence(1201, '\0');
vector<int> num_of_char(26, 0);... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
char easytolower(char in);
int main(){
string b;
int num[26] = {0};
while(cin >> b){
string a = b;
transform(a.begin(),a.end(), b.begin(),::tolower);
for(int i = 0; i < b.length(); ++i){
num[i... | 1 | 71,728,816 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
map<int,int> mp;
vector<int> prime = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
for(int i=2; i<=n; ++i) for(int j:prime){
if(i%j == 0){
int x = i;
while(x%j == 0){
x /= j;
++mp[j];
}
}
}
i... | 1 | 83,191,567 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> a(n+1);
for (int i = 0; i <= n; ++i) cin >> a[i];
vector<long long> s(n + 1);
s[n] = a[n];
for (int i = n - 1;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <queue>
#include <string>
#define ll long long
using namespace std;
int main() {
vector<ll> a;
vector<ll> ps;
int n; cin >> n;
ll ps_sum = 0;
for(int i=0; i<=n; i++){
ll x; cin >> x;
a.push_back(x);... | 1 | 84,961,104 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X, Y;
cin >> X >> Y;
int ans = 1;
ll A = X;
while (1) {
A *= 2;
if (A > Y) break;
ans++;
}
cout << ans << endl;
return 0;
} | #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>;
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 (b<a) {a=b; return 1;} return 0;}
int... | 1 | 82,927,313 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | 1 | 18,709,171 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum=0;
int ai=1;
while(sum<N){
sum+=ai;
ai++;
}
int del=sum-N;
for(int i=1;i<ai;i++){
if(i!=del)cout << i << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
set<string> st;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> v;
for(ll i = 0; i <= 10000; i++){
v.push_back(i * (i + 1) / 2);
}
while(N > 0){
auto itr = lower_bou... | 1 | 32,671,539 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
long long LucaNum(int n);
int main(){
int N;
cin >> N;
vector<long long> dp(N+1,0);
dp[0] = 2;
dp[1] = 1;
for(int i=2; i<=N; i++){
dp[i] = dp[i-1] + dp[i-2];
}
cout << dp[N] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int64_t> vector(87);
vector.at(0) = 2;
vector.at(1) = 1;
for(int i = 0; i < 85; i++){
vector.at(i+2) = vector.at(i) + vector.at(i+1);
}
int N;
cin >> N;
cout << vector.at(N) << endl;
} | 1 | 4,092,627 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<long long int> V(26, 0);
for (int i = 0; i < N; i++) V.at(S.at(i) - 'a')++;
long long int ans = 1, MOD = 1000000007;
for (int i = 0; i < 26; i++) ans = ans * (V.at(i) + 1) % MOD;
ans = (ans + MOD - 1) % MOD... | 1 | 70,012,836 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
string s;
cin >> s;
int... | #include<stdio.h>
int main(){
int a;
scanf("%d", &a);
while (a>0){
if (a%10==7){
printf("Yes\n");
break;
} else{
if (a<10){
printf("No\n");
}
}
a/=10;
}
return 0;
} | 1 | 290,271 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
cin >> n;
unordered_map< string, ll > ana_list;
string s;
for(int i = 0; i < ... | #include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespac... | 1 | 33,938,953 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i,j,k;
string s;
cin>>s;
int ans(0);
for(auto ch:s)ans+=ch-'0';
if(ans%9)cout<<"No\n";
else cout<<"Yes\n";
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<chrono>
#include<vector>
#include<string>
#include<cstring>
#include<iomanip>
using namespace std;
using namespace std::chrono;
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define mod 1000000007
#define fr(i,n) for(in... | 1 | 26,391,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for(ll i=0;i<(n);i++)
#define FOR(i, a, b) for(ll i=(a);i<(b);i++)
#include <iostream>
#include <vector>
using namespace std;
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start, const ll range_end)
{
if (i... | #include<bits/stdc++.h>
#include<string>
using namespace std;
int main(void){
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
for(int i=0;i<1000;i++){
string sum ="";
if(i<10){
sum += "00";
}else if(i<100){
sum += "0";
}
sum += to... | 1 | 83,824,228 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #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>;
const int INF = 1001001001;
int main() {
int n, m, x, ans = INF;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = ... | 1 | 81,504,113 |
#include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
cout << N + T / 2 << endl;
} | 1 | 32,803,879 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define ll long long
#define pb push_back
#define mp make_pair
vec<vec<int>> edge;
vec<int> dp;
vec<int> score;
int dfs(int start)
{
int ret = 1;
dp[start] = 1;
rep(i, e... | #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#de... | 1 | 63,684,898 |
#include <iostream>
#include <string>
using namespace std;
string n2m(int n) {
string s = "";
string p = "mcxi";
string ns = "0123456789";
int d;
int e = 1000;
for (int i=0; i<4; i++) {
d = n/e;
switch (d) {
case 0:
break;
case 1:
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void solve(string a,string b){
vector<int> m(4),n(4),o(4);
int x=0,y=0,z=0;
string c="mcxi";
for(auto i=a.begin();i!=a.end();i++){
if(*i>='0'&&*i<='9'){
m[c.find(*(i+1))]=*i-'0';
}
}
for(int i=0;i<... | 1 | 29,135,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str;
bool right=0,left=0;
int ans=0;
for(int i=0,now=1;i<n;i++){
cin>>str;
if(str=="lu")left=1;
if(str=="ru")right=1;
if(str=="ld")left=0;
if(str=="rd")right=0;
if(now==right&&right==left){
ans++;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | 1 | 16,974,394 |
#include<bits/stdc++.h>
using namespace std;
#define size1 10
int main(){
int n;
cin>>n;
vector<int> p(n),q(n);
vector<int> sorted;
for(int i=0;i<n;i++){
cin>>p[i];
}
for(int i=0;i<n;i++)
cin>>q[i];
sorted=p;
int a=0,b=0;
do{
a++;
}while(next_permutation(p.begin(),p.end()));
do{
b++;
}while(next_pe... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
int ans = 0;
int n;
vector<int> a,b,c;
cin >> n;
REP(i,0,n){
int inter;
cin >> inter;
a.push_back(inter);
c.push_back(i+1);
}
REP(i,0,n){
int inter;
cin >> i... | 1 | 70,907,286 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define rep(x,y,z) for(int x=y;x<z;x++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
vector<ll> 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};
ll K;
cin>>K;
cout<<vec.at(K-1)<<endl;
} | 1 | 38,850,430 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
int main(){
ll n;
cin >> n;
vector<ll> b(n + 1), ans(n + 1);
unordered_map<ll, ll> m;
for(ll i = 0; i < n; i++){
ll a;
cin >> a;
b[++m[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 1 | 90,611,954 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int ans = 0;
int memo = 0;
for (int i = 0; i < 5; i++) {
int dish;
cin >> dish;
int memo2 = ((dish - 1) / 10 + 1) * 10;
ans += memo2;
memo = max(memo, memo2 - dish);
}
cout << ans - memo << endl;
} | #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()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
int mx = 0, ans = 0;
rep(i, 5)
{
ans += a[i];
int x = a[i] % 10;
if (x == 0)
... | 1 | 40,380,135 |
#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> a(n);
for (int& i : a) cin >> i, --i;
vector<int> s(n + 1, 0);
for (int i = 1; i <= n; ++i) (s[i] += s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int n, k;
ll a[maxn], acc[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(... | 1 | 95,266,634 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
for_(i,1,10) {
for_(j,1,10) {
cout << i << "x" << j << "=" << i * j << endl;
}
}
} | #include <iostream>
static const int MaxNum = 9;
static void print_qq()
{
for (int i = 1; i <= MaxNum; ++i) {
for (int j = 1; j <= MaxNum; ++j) {
std::cout << i << "x" << j << "=" << i * j << std::endl;
}
}
}
int main()
{
print_qq();
} | 1 | 53,033,819 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> a;
int n;
cin>>n;
while(n--){
int t;
for(int i=0;i<3;i++){
cin>>t;
a.push_back(t);
}
sort(a.begin(),a.end());
... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
int A[3];
scanf("%d", &n);
for(int i=0; i<n; i++){
scanf("%d %d %d", &A[0], &A[1], &A[2]);
sort(A, A+3);
double a= (double)A[0], b= (double)A[1], c= (double)A[2];
dou... | 1 | 11,157,060 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
if(a==b){
cout<<"EQUAL"<<endl;
}
else if(a.size()>b.size()||(a.size()==b.size()&&a>b)){
cout<<"GREATER"<<endl;
}
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fast ios_base::sync_with_stdio(0); cin.tie(... | 1 | 38,605,251 |
#include <bits/stdc++.h>
using namespace std;
#define N_PRIME 1000000007
#define ll int64_t
int main(void){
while(true){
int n;
int max_v = INT_MIN;
int min_v = INT_MAX;
int sum = 0;
cin >> n;
if( n == 0 )return 0;
for(int i = 0 ; i < n ; i++ ){
in... | #include <iostream>
#include <valarray>
using namespace std;
int main(void){
int n;
while(cin>>n,n){
valarray<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
cout<<(a.sum()-a.max()-a.min())/(a.size()-2)<<endl;
}
} | 1 | 78,101,263 |
#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... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
constexpr int64_t MOD = 1'000'000'007;
int main(void) {
int64_t n, m;
cin >> n >> m;
vector<int64_t> x(n), y(m);
for(int i=0; i<n; i++) {
cin >> x[i];
}
for(int j=0; j<m; j++) {
cin >> y[j];
}
... | 1 | 29,146,010 |
#include "bits/stdc++.h"
using namespace std;
#define sz(x) (int)(x.size())
#define FOR(i,L,R) for(int i = L; i <= R; i++)
#define int long long
const int N = 2e5 + 2, inf = 1e18;
int n, m;
std::vector<int> A, B;
int dp[2002][2002];
const int mod = 1e9 + 7;
int go(int i, int j) {
if (i == n || j == m)
retur... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 1 | 81,738,727 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) ... | #include<iostream>
#include<algorithm>
#include<memory.h>
#include<string>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
const int maxn=5e5+10;
int hang[maxn],lie[maxn];
int main()
{
int h,w,m;scanf("%d%d%d",&h,&w,&m);
int mxh=0,mxl=0;map<pair<int,int>,int> mp;
vector<int> a,b;
while(m... | 1 | 7,939,442 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#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 RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> brojevi(n);
vector<long long > sume(n);
vector<long long> psume(n);
cin>>brojevi[0];
sume[0]=brojevi[0];
if(brojevi[0]>=0) psume[0]=brojevi[0];
for(int i=1;i<n;i++){
cin>>brojevi[i];
sume[i]=sume[i-1]+broje... | 1 | 91,484,412 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int w, h, x, y;
cin >> w >> h >> x >> y;
double s = (double)w * (double)h / 2.0;
if (x + x == w && y + y == h) {
cout << fixed << setprecision(10) << s << " " << '1' << endl;... | 1 | 40,435,811 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long H,W;
cin >>H>>W;
if(H==1||W==1){
cout<<1<<endl;
return 0;
}
cout<<setprecision(20)<<(W/2)*(H/2)+(W/2+W%2)*(H/2+H%2)<<endl;
return 0;
} | #include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3.14... | 1 | 39,365,889 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string O, E;
cin >> O >> E;
for (size_t i = 0; i < E.size(); i++) {
cout << O[i] << E[i];
}
if (E.size() < O.size()) {
cout << O[O.size() - 1];
}
cout << "\n";
return 0;
} | 1 | 45,368,483 |
#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... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, ... | 1 | 53,412,064 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
double T, X;
cin >> T >> X;
cout << fixed << setprecision(10) << T / X << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << setprecision(10) << (float) t / x << endl;
} | 1 | 98,739,491 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<int, int> P... | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
ll a[n],b[n];
for(ll i=0;i<n;i++) cin >> a[i] >> b[i];
ll ans=0;
for(ll i=0;i<n;i++) ans+=a[i];
ll x=ans;
for(ll i=0;i<n;i++){
if(a[i]>b[i]) x=min(x,b[i]);
}
cout << ans-x << endl;
} | 1 | 33,550,693 |
#include <bits/stdc++.h>
int main() {
int x;
scanf("%d", &x);
printf("%d", x / 3);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 36,520,676 |
#include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;... | #include <iostream>
#include <math.h>
using namespace std;
int main()
{
bool IsPrime[1000010] = {};
for (int i = 2; i < 999999; i++)
{
IsPrime[i] = true;
}
for (int i = 2; i*i <= 999999; i++)
{
if (IsPrime[i])
{
for (int j = i * 2; j <= 999999; j += i)
{
IsPrime[j] = false;
}
}
}
int n;
w... | 1 | 36,402,870 |
#include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<... | #include <bits/stdc++.h>
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;
}
typedef long long int ll;
#defin... | 1 | 95,454,620 |
#include <iostream>
#include <stack>
using namespace std;
stack<int> st;
int main() {
int m, tmp;
while (cin >> m){
if(m > 0) {
st.push(m);
}
else if(m == 0) {
cout << st.top() << endl;
st.pop();
}
}
return 0;
} | #include <stack>
#include <cstdio>
using namespace std;
int main(){
int s;
stack<int> stk;
while(~scanf("%d",&s)){
if(s){
stk.push(s);
} else {
printf("%d\n",stk.top());
stk.pop();
}
}
} | 1 | 30,529,754 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ll n,a,b; cin >>n >>a >>b;
if(a>b){
cout << 0 << endl;
return 0;
}
if(n==1){
if(a!=b) cout << 0 << endl;
else cout << 1 << endl;
return 0;
}
ll m = (n-1)*a+b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
ll sum_max = A + B * (N-1);
ll sum_min = A * (N-1) + B;
cout << max(0LL, sum_max - sum_min + 1) << endl;
return 0;
} | 1 | 25,606,543 |
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, m, v, p;
int a[N], t[N];
bool judge(int x) {
if (x <= p) return 1;
if (a[x] + m < a[p]) return 0;
for (register int i = 1; i <= n; i++)
t[i] = a[i];
for (register int i = 1; i < p; i++)
t[i] += m;
... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 1 | 58,913,652 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,x,t;
cin>>n>>x>>t;
cout<<std::fixed;
cout<<(int)(ceil(n/(x*1.0))*t);
} | #include<iostream>
using namespace std;
int main(){
int x, t, n, counter;
cin >> n >> x >> t;
counter = 0;
while(n > 0){
n -= x;
counter++;
}
cout << t * counter << endl;
} | 1 | 96,728,095 |
#include<iostream>
using namespace std;
int main(){
int i,j=0;
for (i=1;i<10;i++){
for(j=1;j<10;j++){
cout << i << 'x' << j << '=' << i*j << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
for(int a=1;a<=9;a++)
{
for(int b=1;b<=9;b++)
cout << a << "x" << b << "=" << a*b <<endl;
}
return 0;
} | 1 | 47,700,226 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 1 | 69,503,012 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
while(t--)
{
string s;
cin>>s;
string ans;
for(int i=... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char s;
deque<char> dq;
while (cin >> s) {
if (s == '0') {
dq.push_back('0');
continue;
... | 1 | 76,515,903 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
#define rep(i,n) for(int (i)=0,temp=(int)(n);(i)<temp;++(i))
#define repi(i,start,end) for(int (i)=(start),temp=(int)(end);i<(end);++(i))
#define rfor(x,v) for(const auto& (x) : (v))
#define all(x) (x).begin(),(x).end()
#de... | 1 | 29,096,309 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
int a[1100];
cin >> N >> K;
for (int i=0;i<N;i++){
cin >> a[i];
}
sort(a, a+N);
int ans =0;
for(int i=0;i<K;i++){
ans += a[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | 1 | 30,679,386 |
#include <iostream>
using namespace std;
int main() {
long long n,h,w;
cin>>n>>h>>w;
long long Ok=0;
while(n--)
{
long long a,b;
cin>>a>>b;
if(a>=h&&b>=w)
{
Ok++;
}
}
cout<<Ok;
} | #include <cstdio>
int main() {
int n, h, w;
scanf("%d%d%d", &n, &h, &w);
int cnt = 0;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d%d", &a, &b);
if (a >= h && b >= w) {
cnt++;
}
}
printf("%d", cnt);
} | 1 | 95,881,502 |
#include <bits/stdc++.h>
#define PI 3.141592653589793
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int H,N;
int i,k;
int ans=0;
int ctr=0;
cin >> H >> N;
vector<int> gv(N);
rep(i,N) cin >> gv[i];
if(H<=accumulate(g... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
ll h,n;
cin >> h >> n;
vector<int> a(n);
ll sum=0;
for(int i=0;i<n;i++){
cin >> a.at(i);
sum+=a.at(i);
}
if(h>sum)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | 1 | 30,816,610 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m;
... | #include <iostream>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int a = N*(N-1)/2;
int b = M*(M-1)/2;
cout << a+b << endl;
} | 1 | 23,352,365 |
#include <bits/stdc++.h>
#include <ctime>
#define rep(i,a,b) for(int i =a;i<b;i++)
using namespace std;
typedef unsigned long long ll;
inline int cine() {int a; return scanf("%d", &a) ? a : 1e9;}
void solve() {
int train, bus, mine = 1e9, sum = 0 ;
rep(i, 0, 2) {
cin >> train;
mine = min(mine, t... | #include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#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)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<cl... | 1 | 58,557,957 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vec(m);
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
vec[i].resize(k);
for (int j = 0; j < k; ++j) {
cin >> vec... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull... | 1 | 32,004,794 |
#include <iostream>
using namespace std;
int main(){
int n, i;
std::cin >> n >> i;
std::cout << n - i + 1 << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define srev reverse(s.begin(),s.end())
#define sortstr sort(s.begin(), s.end());
#define gtl(x) getline(cin, (x))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, ... | 1 | 62,761,269 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
int main()
{
int A,B;
cin >> A >> B;
cout << A/(double)B;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
typedef pair<int,int> P;
#define inf 1e9
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llin... | 1 | 65,146,495 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
ll K;
... | #include<iostream>
using namespace std;
int main() {
long long k;
cin >> k;
long long x, y;
if (k >= 50) {
cout << 50 << endl;
x = k / 50;
y = k % 50;
if (1 <= y) {
cout << 49 + x + 51 - y;
}
else { cout << 49 + x - y; }
for (int i = 2; i <= 50; i++) {
if (i <= y) {
cout << ' ' << 49 + x + 5... | 1 | 58,629,666 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int b[n];
int i;
for(i=0;i<n;i++)cin>>a[i]>>b[i];
vector<pair<int,int> >p(n);
for(i=0;i<n;i++)p[i] = make_pair(a[i]+b[i],i);
sort(p.begin(),p.end(),greater<pair<int,int> >());
long ans = 0;
for(i=0;i<n;i++){
if... | 1 | 91,227,237 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 1 | 27,208,945 |
#include <iostream>
using namespace std;
void pri(){
for(int i=0; i<20; i++) cout <<"#";
cout << endl;
}
int main(){
int n; cin >> n;
int m[5][4][11]={};
for(int i=0; i<n; i++){
int b,f,r,v;
cin >> b >> f >> r >> v;
m[b][f][r] += v;
}
for(int i=1; i<5; i++){
for(int j=1; j<4; j++){
... | #include <iostream>
using namespace std;
main(){
int n;cin>>n;
int r[4][3][10]={0};
for(int a,b,c,d,i=0;i<n;i++){
cin>>a>>b>>c>>d;
r[a-1][b-1][c-1]+=d;
}
for(int i=0;i<3;i++){
for(int j=0;j<10;j++){
cout<<" "<<r[0][i][j];
}
cout<<endl;
}
cout<<"####################"<<endl;
for(int i=0;i<3;i++){
f... | 1 | 46,818,249 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
typedef long long ll;
int main(){
ll n,x;
cin>>n>>x;
ll num[n+1],paty[n+1];
num[0]=paty[0]=1;
loop(i,1,n+1){
num[i]=num[i-1]*2+3;
paty[i]=paty[i-1]*2+1;
}
ll ans=0;
for(int i=n;i>=1;i--){
if(x==0)... | #include <bits/stdc++.h>
using namespace std;
long long n, x;
vector<long long> brg;
vector<long long> pa;
long long solve(long long n, long long x){
if(x <= 0) return 0;
if(n == 0) return 1;
if(x == 1) return 0;
if(x <= brg.at(n-1) + 1) return solve(n-1, x-1);
return solve(n-1, x-brg.at(n-1)-2) + pa.at(n-1) ... | 1 | 37,204,427 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int a[100005];
int main(){
std::ios::sync_with_stdio(false);
int a,b,k,cot=0;
cin>>a>>b>>k;
for(int i=min(a,b);i>=1;i--){
if(a%i==0&&b%i==0){
cot++;
}
if(k==cot){
... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long LL;
using namespace std;
int main()
{
LL A,B,K,cnt=0;
scanf("%lld%lld%lld",&A,&B,&K);
for(LL i=A;i>=1;i--)
{
if(A%i==0&&B%i==0)
cnt+=1;
if(cnt==K)
{
printf("%lld\n"... | 1 | 4,796,061 |
#include <iostream>
using namespace std;
int main(){
string x;
while (cin >> x, x != "0"){
int ans = 0;
int l = x.length();
for (int i = 0; i < l; ++i){
ans += x[i] - 48;
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string x;
for (;;) {
int ans=0;
cin >> x;
if (x == "0")break;
for (int i = 0; i < x.size(); i++) {
ans += x[i]-'0';
}
cout << ans << endl;
}
return 0;
} | 1 | 66,589,943 |
#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 << 61;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int n;
cin >> n;
int ans = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, s=0;
cin >> n;
for(int i=1; i<=n; i++){
s += n/i;
if(n%i==0) s--;
}
cout << s;
return 0;
} | 1 | 66,653,091 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 8;
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n , m;
cin >> n >> m;
priority_queue < int > Q;
for(int i = 0 ; i < n ; i++){
int x ; cin >> x;
Q.push(x);
}
while(m-... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N, M;
vector<int> V(10);
int ans;
signed main()
{
cin >> N >> M;
for(int i = 0; i < N; i++)
{
int a;
cin >> a;
ans += a;
int tmp = 1;
for(int j = 0; j < 50; j++)
{
V.push_back(a... | 1 | 28,015,143 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
rep(i, n) { cout << s[i] << t[i]; }
cout << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S, T;
cin >> N >> S >> T;
string ans;
for (int i = 0; i < N; i++) {
ans += S.at(i);
ans += T.at(i);
}
cout << ans << endl;
} | 1 | 85,541,477 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int res = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 1) {
if (i + 1 < n && a[i + 1... | 1 | 97,597,280 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int count = 0;
vector<int> v(5);
for(int i=0; i<5; i++) {
int a;
cin >> a;
sum += a;
if(a%10 == 0) count++;
v[i] = a%10;
}
sort(v.rbegin(), v.rend());
for(int i=0; i<4-count; i++) sum += 10-v[i];
cout << sum << e... | #include<bits/stdc++.h>
using namespace std;
int main() {
vector<int> eachtime(5);
for(int &c : eachtime) {
cin >> c;
}
int counter = 0, mintime = 643;
int untilfive = 0;
sort(eachtime.begin(), eachtime.end());
do{
for(int c : eachtime) {
counter += c;
untilfive++;
if(untilfive... | 1 | 54,583,734 |
#include <bits/stdc++.h>
using namespace std;
void bingo(int a1, int a2, int a3, vector<bool>& judge);
int main(){
vector<int> A(9);
for (int i = 0; i < 9; i++){
cin >> A.at(i);
}
int N;
cin >> N;
vector<bool> judge(9, false);
for (int i = 0; i < N; i++){
int B;
cin >> B;
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<vector<int>> a(3, vector<int>(3));
vector<vector<bool>> c(3, vector<bool>(3, false));
for (auto&& v : a) {
for (auto&& e : v) {
cin >> e;
}
}
int n;
cin >> n;
... | 1 | 33,841,268 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 1000000000
#define PB ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | 1 | 47,476,000 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
string A,B;
cin >> A >> B;
if(A.size()>B.size()){
cout << "GREATER" <<endl;
}else if(A.size()<B.size()){
cout <<"LESS"<<endl;
}else{
if((int)A[0] >... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
string res = "EQUAL";
if (a.size() > b.size()) {
res = "GREATER";
} else if (a.size() < b.size()) {
res = "LESS";
} else {
for (int i = 0; i < a.size(); i++) {
if (a.at(i) >... | 1 | 59,926,245 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define NUM 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
int ma... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
uint64_t MOD = 1e9 + 7;
void go(){
int n,m;cin>>n>>m;
map<int, bool> broken;... | 1 | 33,253,754 |
#include <iostream>
using namespace std;
long long int gcd(long long int x, long long int y)
{
if (x % y == 0) {
return y;
} else {
gcd(y, x%y);
}
}
int main()
{
long long int a,b,c,d;
cin >> a >> b >> c >> d;
long long int ans_a, ans_b;
long long int y = gcd(c, d);
ans_a ... | #include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | 1 | 7,540,793 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
usi... | 1 | 55,647,747 |
#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);
}
vector<int>::iterator itr;
for (int j = 1; j <= n; j++) {
itr = find(a.begin(), a.end(), j);
cout << distance(a.begin(), itr) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<int,int> a;
for(int i=0;i<n;i++){
int time; cin >> time;
a[time]=i+1;
}
for(auto stu:a){
cout << stu.second << " ";
}
} | 1 | 89,563,784 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<list<int>> v(100005);
vector<vector<ll>> dp(100005,vector<ll>(2));
vector<int>par(100005);
int n;
ll solve(int i,int pclr)
{
if(dp[i][pclr])
return dp[i][pclr];
ll res=1,ans=0;
for(auto x:v[i])
{
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,s,e) for(int i=s;i<=e;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MAX (int)1e9 + 99
#define maxof(a,b,c) max(a,max(b,c))
#define min... | 1 | 94,754,127 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
const int maxn = 1e5+10;
int dp[maxn];
int32_t main(){
ios_base:... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll ans, n,h ;
ans = 0;
cin >> h >> n;
vector<vector<int>> v(n,vector<int>(2));
int minB = 1e5;
int minId;
rep(i, n) {
cin >> v[i][0] >> v[i][1];
if (v[i][... | 1 | 84,734,595 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >>S;
int a=0,b=1,c=0;
if(S[0]=='A'){
a=1;
}
for(int i=1;i<S.size();i++){
if(islower(S[i])){
}
else if(S[i]=='C'){
if(i<S.size()-1 && i>1)
c++;
else{
c=0;
}
}
else{
b=0;
}
... | #include<bits/stdc++.h>
using namespace std;
string solve(string str)
{
int c = 0;
int len = str.length();
for(int i=0;i<len;i++) {
if(i == 0) {
if(str[i] != 'A') {
return "WA";
}
} else {
if(str[i] == 'C') {
if(c != 0) {
return "WA";
}
if(i < 2 || i > len-2) {
return "WA";
... | 1 | 57,841,676 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long m,k;cin >> m >> k;
long long a=1;
for (int i=0;i<m;i++) a*=2;
if (m==0) {if (k==0) cout << "0 0" << endl; else cout << -1 << endl;}
else if (m==1) {if (k==0) cout << "0 0 1 1" << endl; else cout << -1 << endl;}
else {
if (a<=k) cout <<... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | 1 | 15,442,783 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R;
cin >> R;
if (R < 1200) cout << "ABC" << endl;
else if (R >= 2800) cout << "AGC" << endl;
else cout << "ARC" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int r;
cin >> r;
if(r<1200) cout << "ABC" << endl;
if((r>=1200) && (r<2800)) cout << "ARC" << endl;
if(r>=2800) cout << "AGC" << endl;
} | 1 | 77,103,521 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <string>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i... | 1 | 66,147,315 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef unsig... | 1 | 19,343,623 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
string S, T;
cin >> S... | #include<bits/stdc++.h>
#define P push
#define F first
#define S second
#define pb push_back
typedef long long ll;
#define pf push_front
#define PQ priority_queue
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define lp(a,x) (lower_bound(a.begin(),a.end(),x)-a.begin())
#define up(a,x) (upper_bound(a.b... | 1 | 59,727,489 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _LOCAL_DEBUG
#include "templates/debug.h"
#else
#define debug(...)
#endif
void solve() {
int n;
cin >> n;
cout << 10 - (n / 200) << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
while (tt-... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
if (X<600) {
cout << 8 << endl;
}
else {
if (X<800) {
cout << 7 << endl;
}
else {
if (X<1000) {
cout << 6 << endl;
}
else {
... | 1 | 30,445,145 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b, c;
cin >> a >> b >> c;
vector<int> v = {abs(a - b), ab... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int K = max(A, B);
K = max(K, C);
int J = min(A, B);
J = min(J, C);
cout << K - J << endl;
} | 1 | 84,070,513 |
#include <cstdio>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int, int> P;
#define y first
#define x second
const int INF = 1000000000;
const int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 };
char map[1024][1024];
P start;
P goal[10];
int h, w, n;
int cheese(P s, int hp);
int main()
{
scanf... | #include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <string.h>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
int x;
int y;
int dist;
node(int x , int y , int dist)
{
this -> x = x;
this ->... | 1 | 69,093,147 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false;... | 1 | 66,860,119 |
#include <iostream>
using namespace std;
int main() {
int cnt = 0, res = 0;
for (int i = 0; i < 3; ++i) {
char c;
cin >> c;
if (c == 'R') cnt++;
else cnt = 0;
res = max(cnt, res);
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
string S;
int main(){
cin >> S;
if(S == "RSR" || S == "RSS" || S=="SSR" || S == "SRS"){cout<<1;return 0;}
else if(S == "SSS"){cout<<0;return 0;}
else if(S == "SRR" || S == "RRS"){cout<<2;return 0;}
else{
cout<<3;return 0;
}
} | 1 | 31,149,731 |
#include <cstdio>
#define NMAX 45
int main() {
int n;
scanf("%d", &n);
if (n == 0 || n == 1) {
printf("1\n");
} else {
int fib[NMAX];
fib[0] = fib[1] = 1;
for (int i = 2; i < NMAX; i++) {
fib[i] = fib[i-1] + fib[i-2];
if (i == n) {
... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;
int n;
int s=0;
int a[45];
int main()
{
cin>>n;
if(n==0 || n==1){
cout<<1<<endl;
return 0;
}
a[0]=1;
a[1]=1;
for(int i=1;i<... | 1 | 4,773,834 |
#include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
typedef long long ll;
int main()
{
string s;
cin>>s;
if(s == "RRR")
cout<< 3 <<endl;
else if(s == "RRS"|| s =="SRR")
cout << 2 <<endl;
else if(s=="SSS")
cout << 0 <<endl;
else
cout << 1 <<endl;
r... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string S;cin>>S;
if(S[0]=='S' && S[1]=='S' && S[2]=='S') cout << 0 << endl;
if(S[0]=='R' && S[1]=='S' && S[2]=='S') cout << 1 << endl;
if(S[0]=='S' && S[1]=='R' && S[2]=='S') cout << 1... | 1 | 58,307,341 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define S second
template <typename T>
struct countmap {
std::map<T, long long> dict;
countmap() {
dict = map<T, long long>();
}
bool contains(T key) {
return (dict.find(... | 1 | 32,559,950 |
#include <stdio.h>
#include <string.h>
int n, r[128]; bool used[22370000]; char com[7], s[13];
int main() {
scanf("%d", &n); r[65] = 1, r[67] = 2, r[71] = 3;
for(int i = 0; i < n; i++) {
scanf("%s %s", com, s);
int h = 0, l = strlen(s);
for(int j = 0; j < l; j++) h = h * 4 + r[s[j]];
h += (1 << (2 * l));
if... | #include <iostream>
#include <list>
#include <string>
using namespace std;
struct Trie
{
struct Node
{
Node() :isEnd(false) {}
Node(char _v) : v(_v), isEnd(false) {}
~Node()
{
for (list<Node*>::iterator it = nodes.begin();
it != nodes.end();
++it)
{
delete *it;
}
}
Node* FindChild(cha... | 1 | 71,796,975 |
#include<stdio.h>
int main(void)
{
int n,i,j,k,d,c;
while(scanf("%d",&n)!=EOF){
c=0;
for(i=0;i<10;i++){
for(j=0;j<10;j++){
for(k=0;k<10;k++){
for(d=0;d<10;d++){
if(i+j+k+d==n){
c++;
}
}
}
}
}
printf("%d\n",c);
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
while(cin>>n){
int count=0;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
for(int x=0;x<10;x++){
if(i+j+k+x==n){count++;}
}
}
}
}
cout<<count<<endl;
}
return 0;
} | 1 | 25,882,673 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.