code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include<cstdio>
#define N 200001
int a[N],i,l,n,r,o[N],p[N],q;
inline bool check(int s)
{
if(s==1)
{
for(i=1;i<n;i++)if(a[i]>=a[i+1])return false;
return true;
}
for(i=1,q=0;i<=n;i++)
if(o[q]<a[i])o[++q]=a[i],p[q]=1;
else
{
while(a[i]<o[q])q--;
if(o[q]!=a[i])o[++q]=a[i],p[q]=2;
else if(p[q]!=s)p[q]++;... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 1 | 19,752,680 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 1 | 74,291,932 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int i = 1;
int cand = 1;
for(; i <= 10; i++)
{
cand *= 10;
cout << "? " << cand << endl;
char ans;
cin >> ans;
if(ans == 'N') break;
}
if(i == 11)
{
cand = 1;
... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cassert>
#include<string>
using namespace std;
typedef long long ll;
ll N = 1000;
bool query(ll x){
char c;
cout << "? " << x << endl << flush;
cin >> c;
return c == 'Y';
}
int main(){
i... | 1 | 88,131,868 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int l[n];
for(int i=0; i<n; i++) {
cin >> l[i];
}
sort(l,l+n);
reverse(l,l+n);
int ans=0;
for(int i=0; i<k; i++) {
ans+=l[i];
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 1 | 37,125,325 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int p[200005];
int root(int x) {return p[x] < 0 ? x : p[x] = root(p[x]);}
void mer(int x, int y) {
if ((x = root(x)) == (y ... | #include <iostream>
#include "atcoder/dsu.hpp"
using namespace std;
int main()
{
int N, Q;
int t, u, v;
cin >> N >> Q;
atcoder::dsu d(N);
for (int i = 0; i < Q; i++)
{
cin >> t >> u >> v;
if (t == 0)
{
d.merge(u, v);
}
else if (t == 1)
... | 1 | 37,089,338 |
#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 <iostream>
using namespace std;
int main()
{
int n,k;
cin>>k>>n;
if(500*k>=n){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 53,165,449 |
#include <stdio.h>
int main(){
char huruf;
scanf("%c",&huruf);
if (huruf >=65 && huruf <=90){
printf("A\n");
}
else{
printf("a");
}
return 0;
} | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <tuple>
#include <map>
#include <ctime>
#include <cstdlib>
#include <random>
#include <unistd.h>
using namespace std;
#define int long long
signed main(){
char a;
ci... | 1 | 31,668,249 |
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,x,prev,cnt=1;
cin>>n;
cin>>x;
prev=x;
while(--n)
{
cin>>x;
if(x<prev)
{
prev=x;
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N;
cin >> N;
int min_P, ans;
min_P = INT_MAX;
ans = 0;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
min_P = min(min_P, P);
if(min_P == P) ans++;
}
cout << ans << endl;
}
int main() {
s... | 1 | 95,506,013 |
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <numeric>
#include <ctype.h>
#include <cstdlib>
#include <string.h>
using namespace std;
int main()
{
int count = 0, a = 0, b = 0;
string input;
cin >> input;
cin >> count;
for (int i = 0;... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str;
cin >> str;
int q;
cin >> q;
for(int i = 0; i < q; i++){
string command;
int a, b;
cin >> command >> a >> b;
if(command == "print"){
cout << str.substr(a, b-a+1) << endl;
}
if(command == "reverse"... | 1 | 15,986,990 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<a/b<<" "<<a%b<<" ";
cout<<setiosflags(ios::fixed)<<setprecision(5)<<(double)(a)/b;
return 0;
} | #include <stdio.h>
int main(int argc, char* argv[])
{
int i;
int a, b;
double af, bf;
char temp[22];
fgets(temp, sizeof(temp), stdin);
sscanf(temp, "%d %d", &a, &b);
af = (double)a;
bf = (double)b;
printf("%d %d %.5f\n", a / b, a % b, af / bf);
return 0;
} | 1 | 433,104 |
#include <bits/stdc++.h>
#include <vector>
#include <string.h>
typedef long long ll;
typedef long double lg;
using namespace std;
int main(){
ll n,k,x;
cin>>n>>k;
vector<ll>a;
for(int i=0;i<n;i++){
cin>>x;
a.push_back(x);
}
sort(a.begin(),a.end());
if(k>= n){
cout<<"0"<<endl;
return 0;
... | #include<iostream>
#include<vector>
#define lli long long int
#include<climits>
#include<unordered_map>
#include<algorithm>
#include<bitset>
#include<map>
#include<cmath>
#include<queue>
#define pb push_back
#define N (int)(1e5)
using namespace std;
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
lli ... | 1 | 19,074,072 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string ans;
string A,B;
cin >> A >> B;
for(int i=0; i<N; i++)
{
ans+=A.at(i);
ans+=B.at(i);
}
cout << ans <<endl;
} | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 38,973,813 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll n;
cin >> n;
vector<ll> a(n);
for(auto &e: a) cin >> e;
ll r = 0, t = 0;
for(ll i=0; i<n; i++) {
ll s = max(0ll, (a[i]-(t+1) + t) / (t+1));
r += s;
if(a[i] == t+1... | #include <iostream>
#define llint long long
using namespace std;
llint N;
llint A[100005];
int main(void)
{
cin >> N;
for(int i = 0; i < N; i++) cin >> A[i];
llint ans = 0;
llint val = 1;
for(int i = 0; i < N; i++){
if(A[i] < val) continue;
if(A[i] == val) val++;
else ans += (A[i] - 1) / val;
if(val == 1)... | 1 | 78,613,860 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x[i];
}
vector<int> right(n);
for(int i=0; i<n-1; i++){
right[i] = x[i+1] - x[i];
}
right[n-1] = -1;
int klim = log... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i =... | 1 | 42,284,475 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
int n;
cin >> n;
string tarou, hanako;
int score_ta = 0, score_ha = 0;
for (int i = 0; i < n; i++) {
cin >> tarou >> hanako;
int maxlength = tarou.length() < hanako.length() ? tarou.length() : hanako.length();
for (int j =... | #include<iostream>
#include<string>
using namespace std;
int main() {
int i, n, a = 0, b = 0;
string sa, sb;
cin >> n;
for (i = 0; i < n; i++) {
cin >> sa >> sb;
if (sa.compare(sb) > 0)a += 3;
else if (sa.compare(sb) < 0)b += 3;
else {a++;b++;}
}
cout << a << " " << b << endl;
return 0;
} | 1 | 10,910,880 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
#include <bitset>
using namespace std;
using ll... | 1 | 52,948,821 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdint>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 1 | 81,858,906 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
string S, T, U;
cin >> S >> T;
U = T + S;
cout << U << endl;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 1 | 80,378,672 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
long int n,h,w,ans=0,i,ab[1000][2];
cin>>n>>h>>w;
for(i=0;i<n;i++){
for(int j=0;j<2;j++){
cin>>ab[i][j];
}
}
for(i=0;i<n;i++){
if(ab[i][0] >= h && ab[i][1] >= w)
ans++;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
long long N,H,W;
cin>>N>>H>>W;
vector<long long> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
long long ans=0;
for(int i=0;i<N;i++){
if(A[i]>=H&&B[i]>=W) ans++;
}
cout<<ans<<endl;
return 0;
} | 1 | 63,212,173 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#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 ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tost... | #include <iostream>
using namespace std;
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
int last = -1, ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (last == x) {
ans++;
last = -1;
} else {
last = x;
}
}
cout << ans << endl;
} | 1 | 12,256,633 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#de... | 1 | 42,142,783 |
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int main(){
priority_queue<int> pq;
string command; cin>>command;
int key;
while(command!="end"){
if(command=="insert"){
cin>>key;
pq.push(key);
}else if(command=="extract"){
cout<<pq.top()<<endl;
pq.pop();
}
cin>>command;
... | #include<iostream>
#include<vector>
#define MAX 2000000
using namespace std;
int A[MAX+1];
int top;
void heapify(int index){
int parent = index / 2;
if (parent < 1) return;
if (A[index] <= A[parent]) return;
int tmp = A[index];
A[index] = A[parent];
A[parent] = tmp;
heapify(parent);
}
void i... | 1 | 29,082,191 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<in... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | 1 | 91,954,591 |
#include <bits/stdc++.h>
using namespace std;
int n, a[201], ans;
int main() {
scanf("%d", &n); n <<= 1;
for(int i = 1;i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for(int i = 1;i <= n; i += 2)
ans += a[i];
printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_... | 1 | 97,733,905 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
char s = 'a';
int n, count, _count, ind;
cin >> n;
vector<string> ve(n);
for(int i = 0; i < n; i++) cin >> ve[i];
while(s <= 'z'){
count = 0;
for(int j = 0; j < n; j++){
_count = 0;
... | 1 | 67,434,100 |
#include <bits/stdc++.h>
#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 ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
using namespace std;
long long a,b,k;
int main()
{
cin>>a>>b>>k;
long long takahashi,aoki;
if(k<=a)
{
takahashi=a-k;
aoki=b;
}
else
if(k<=a+b)
{
takahashi = 0;
aoki=b-(k-a);
}
else
{
takahashi=0;
aoki=0;
}
cout<<takahashi<<" "<<aoki;
} | 1 | 34,479,661 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
#define rad_to_... | 1 | 89,637,368 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(i, a) for (auto &i: (a))
#define sz(x) (int)(x).size()
#define all(v) (v).begin(), (v).end()
#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
int dp[100005][4];
vo... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define xx first
#define yy second
#define sci(n) scanf("%d",&n)
#define scii(n,m) scanf("%d%d",&n,&m)
#define sciii(n... | 1 | 33,690,636 |
#include<string>
#include<iostream>
int main(){
std::string str;
std::cin>>str;
if(str=="abc"||str=="acb"||str=="cab"||str=="bac"||str=="bca"||str=="cba")
std::cout<<"Yes"<<std::endl;
else std::cout<<"No"<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | 1 | 19,374,402 |
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <limits>
#include <cmath>
#include <map>
#include <set>
using namespace std;
#define ll long long int
#define rep(i,k,n) for(int i = k; n > i; i++)
#define REP(i,n) rep(i,0,n)
int main(){
int n;
long double Pi4 = atan((long d... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
bool cmp(const pair<long, long> &q, const pair<long, long> &w) {
if (q == w)
return false;
if (q == make_pair(0ll, 0ll))
return true;
if (w == make_pair(0ll, 0ll))
return false;
bool side1 = (q.second > 0 ||... | 1 | 77,418,641 |
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
if(a+b>n+1||a*b<n){
puts("-1");
return 0;
}
while(n){
long long tmp=min(a,n-b+1);
for(long long i=n-tmp+1;i<=n;i++)
printf("%lld ",i);
n-=tmp;
b--;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, inc, dec;
scanf("%d %d %d", &n, &inc, &dec);
if(inc>n || dec>n){
printf("-1\n");
return 0;
}
bool swapped=false;
if(inc<dec)
{
swap(inc,dec);
swapped=true;
}
vector<int> v;
for(int i... | 1 | 42,278,375 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int d;
cin >> d;
int i=25-d;
cout << "Christmas";
while(i>0){
cout << " Eve";
i--;
}
cout << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void solve(){
int d; cin >> d;
string s = "Christmas";
for(int i = d; i < 25; i++){
s += " Eve";
}
cout << s << endl;
return;
}
int main(){
solve();
return 0;
} | 1 | 77,108,689 |
#include<bits/stdc++.h>
#define endl "\n"
#define ll long long
#define PI acos(-1.0)
#define test cout<<"\n****\n"
#define precise fixed(cout);cout<<setprecision(12)
#define fast ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
int main(){
string a,b;
cin>>a>>b;
ll si... | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
int main(){
string A,B; cin >>A >>B;
ll temp1=A.size(),temp2=B.size();
if (temp1>temp2) cout <<"GREATER" <<endl;
else if (temp1<temp2) cout <<"LES... | 1 | 56,506,979 |
#include<iostream>
#include<map>
using namespace std;
typedef long long ll;
int M;
int main() {
cin >> M;
ll sum = 0;
ll cnt = 0;
for (int i = 0; i < M; i++) {
ll c, d;
cin >> d >> c;
sum += c * d;
cnt += c;
}
ll ans = 0;
ans += (cnt - 1);
ans += (sum / 9);
if (sum % 9 == 0)ans--;
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int M;
cin >> M;
int cnt = 0;
int cnt2 = 0;
for(int i = 0; i < M; i++) {
int d,c;
cin >... | 1 | 75,973,419 |
#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(){
int N;
cin >> N;
vector<int> cnt(100005, 0)... | #include <bits/stdc++.h>
using namespace std;
int a[100003];
int main()
{
int N;
cin >> N;
while (N--)
{
int t;
cin >> t;
a[t]++;
a[t + 1]++;
a[t + 2]++;
}
cout << *max_element(a + 2, a + 100000) << endl;
return 0;
} | 1 | 8,885,671 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, l, r, cnt=0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> l >> r;
for (int j = l; j <= r; j++) {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
bool arr[100000] = {0};
for(int i = 0; i < n; i++) {
int start, end;
cin >> start >> end;
for(int j = start - 1; j < end; j++) {
arr[j] = true;
}
}
int n_people = accumulate(&arr[0], &arr[10000... | 1 | 75,413,676 |
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <... | #include "bits/stdc++.h"
#include <unordered_set>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb... | 1 | 13,272,478 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n;
cin>>n;
vector<string> w(n);
map<string,long long> m;
f(i,0,n){
cin>>w[i];
m[w[i]]++;
}
bool f=true;
f(i,0,n-1){
if(w[i][w[i].size()-1]!=w[i+1][0]){
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 100000000... | 1 | 66,861,488 |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int R,G; cin>>R>>G;
cout<<(G+G-R)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double nowrate;
double outrate;
cin >> nowrate;
cin >> outrate;
cout << outrate*2-nowrate << endl;
} | 1 | 48,114,880 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
rep(i,n){
if(s[i] != s[i-1]) ans ++;
}
cout << ans << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cmath>
#include <climits>
#include <cstdint>
#include <string>
using namespace std;
inline namespace atcoder {
using i32 = int32_t; using u32 = uint32_t;
using i64 = int64_t; using u64 = uint64_t;
using f32 = float; using ... | 1 | 9,732,688 |
#include <iostream>
int main() {
int n;
while( std::cin >> n ) {
int ans = 0;
for( int a=0; a<10; ++a )
for( int b=0; b<10; ++b )
for( int c=0; c<10; ++c )
for( int d=0; d<10; ++d )
ans += (a+b+c+d==n)?1:0;
std::cout << ans << std::endl;
}
} | #include <iostream>
using namespace std;
int main(int argc, char **argv)
{
int n, tmp, count;
while(cin >> n){
count = 0;
for(int i = 0; i <= 9; i++){
if(i > n){
break;
}
for(int j = 0; j <= 9; j++){
if((i + j) > n){
break;
}
for(int k = 0; k <= 9; k++){
tmp = i + j + k;
if... | 1 | 63,088,827 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
static const auto _____ = []() {
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(0);
return 0;
}();
int main(){
int n;
cin>>n;
ll sum = 0;
for(int i=1;i<n;i++){
sum += (n-1)/i;
}
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
templat... | 1 | 71,678,976 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R; cin >> R; string s = "AGC";
if(R < 2800) s = "ARC";
if(R < 1200) s = "ABC";
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RNG(i,from,to) for(int i=(from); i<(int)(to); i++)
#define gcd(i,j) __gcd((i), (j))
typedef long long ll;
typedef pair<int, int> pii;
template<typename S, typename T> string to_string(pair<S, T> p) { return "("+to_strin... | 1 | 11,625,618 |
#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 a;
cin >> a;
cout << a*a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int C;
cin >> C;
cout << C * C<<endl;
} | 1 | 85,313,377 |
#include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> p(n);
for(ll i=0; i<n; i++){
ll j;
... | #include <iostream>
#include <fstream>
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#incl... | 1 | 4,385,217 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#defin... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um = unordered_map<ll,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void prt(T v){cout<<... | 1 | 31,298,019 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 1 | 78,756,391 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n,ans;
ans=0;
cin>>n;
vector<int> a(n,100001);
vector<int> b(n-1);
for(int i=0;i<n-1;i++)
{
cin>>b.at(i);
}
for(int i=0;i<n-1;i++)
{
a.at(i)=min(b.at(i),a.at(i));
a.at(i+1)=min(b.at(i),a.at(i+1));
}
for(int i=0;i<n;i++)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> b(n-1);
rep(i, n-1) cin >> b[i];
vector<int> a(n);
rep(i, n) {
if (i == 0) {
a[i] = b[i];
}
else if (i... | 1 | 37,740,797 |
#define rep(i,n) for (int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
int n;
ll co=0;
cin >> n;
vector <ll> a(n);
vector <ll> b(n);
rep(i,n)
cin >> a.at(i) >> b.at(i);
rep(i,n){
a.at(n-i-1)+=co;
if(a.at(n-i-1)%b.at(n-i-1)=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | 1 | 25,342,129 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define per(i,s,n) for(int i=n-1;i>=s;i--)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
voi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
priority_queue<ll> que;
rep(i,n){
ll a;
cin >> a;
que.push(a);
}
ll ans=0;
rep(i,m){
ll cp=que.top();
que.pop();
cp/=2;
que... | 1 | 76,616,618 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define maxn 999999 + 5
typedef long long ll;
int prime[maxn];
void init(){
for(int i=2;i<maxn-4;i++)
prime[i] = i % 2;
prime[2]=1;
prime[1]=0;
for(int i=2;i*i<=maxn;i++){
if(!prime[i])cont... | #include<stdio.h>
#include<math.h>
int main(){
int ans[1000000];
int count=2;
for(int i=4;i<1000000;i++){
bool p=true;
double sqrti = i;
for(int j=2;j<=sqrt(sqrti);j++){
if(i % j == 0){
p=false;
break;
}
}
if(p){
count++;
ans[i]=count;
}
else ans[i]=count;
}
ans[1] = 0;
ans[2] =... | 1 | 90,495,993 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000000;
const int MOD = 1000000007;
signed main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<n;i++){
if(a[i-1]>=a[i])break;
if(i==n-1){
cout<<1;
return ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | 1 | 76,946,489 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n, r;
cin >> n >> r;
if (500 * n >= r) {
cout << "Yes";
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int k, x;
cin >> k >> x;
if (500 * k >= x)
puts("Yes");
else
puts("No");
} | 1 | 86,330,803 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a , b;
cin >> a >> b;
int c[a] , x... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 1 | 39,104,411 |
#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;
string S;
cin >> N >> S;
int ans = 0;
rep(i,10) rep(j,10) rep(k,10) {
for (int l = 0; l < N; ++l) {
if (S.at(l) == '0' +... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int N;
string S;
cin >> N;
cin >> S;
int result = 0;
for(int num = 0; num <= 999; num++)
{
int num1 = num / 100;
int num2 = num / 10 - num1 * 10;
int num3 = num % 10;
int p1 =... | 1 | 82,290,179 |
#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++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
struct UnionFind{
vector<int> par;
UnionFind(int N) : par(N){
... | #include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 29
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j) ((i)>>(j))&1... | 1 | 35,053,841 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x,y;
x = 800 * N;
if(N >=90) y = 1200;
else if(N >=75) y = 1000;
else if(N >=60) y = 800;
else if(N >=45) y = 600;
else if(N >=30) y = 400;
else if(N >=15) y = 200;
else y = 0;
cout << x - y << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
cout << (n*800) - ((n/15)*200) << endl;
} | 1 | 53,297,734 |
#include <iostream>
using namespace std;
int sum(int y, int m, int d) {
int t = 0;
t += (y - 1) * 195 + (y - 1) / 3 * 5;
t += (m - 1) * 19 + m / 2;
if (y % 3 == 0) t += (m - 1) / 2;
t += d - 1;
return t;
}
int main() {
int n;
cin >> n;
while (n--) {
int y, m, d;
cin >> y >> m >> d;
cout << sum(1000, 1, 1... | #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int y,m,d;
cin>>y>>m>>d;
int cnt=0;
while(1){
d++;
cnt++;
if(y%3==0){
if(d==21){
d=1;
m++;
}
}
else{
if(m%2==0){
if(d==20){
d=1;
m++;
}
}
else{
if(... | 1 | 80,318,226 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI acos(-1)
int main(){
int x,y,x2,y2;
int x_d,y_d;
cin >> x >> y >> x2 >> y2;
x_d = x - x2;
y_d = y - y2;
cout << x2 + y_d << " " << y2 - x_d << " " << x + y_d << " " << y - x_d << endl;
} | #include <iostream>
int main()
{
int x1, y1, x2, y2, x3, y3, x4, y4, a, b;
std::cin >> x1 >> y1 >> x2 >> y2;
a = x2 - x1;
b = y2 - y1;
x3 = x2 - b;
y3 = y2 + a;
x4 = x3 - a;
y4 = y3 - b;
std::cout << x3 << ' ' << y3 << ' '
<< x4 << ' ' << y4 << std::endl;
return 0;
} | 1 | 4,379,347 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
const int INF = 1 << 30;
int solve(string s) {
int res = 0;
for (int i = 0,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | 1 | 7,628,380 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z;
cin>>x>>y>>z;
if (x==y&&y==z) puts("Yes");
else puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF = 2000000000
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define X first
#define Y second
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) {
cout ... | 1 | 41,659,968 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,sum;
cin >> a;
c = a;
b = 0;
sum = 0;
for (int i = 0 ; i < 10 ; i++ ){
b = a % 10;
sum += b;
if(a > 9) {
a /= 10;
} else {
break;
}
}
if(c % sum == 0){
cout << "Yes" << endl;
} else {
cout <... | 1 | 43,914,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vc = vector<char>;
using vvll = vector<vll>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int,int>;
using vpii = vect... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 1 | 64,931,943 |
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <string>
using namespace std;
int n, s, res = 0;
void dfs(int sum,int now, int cnt) {
if (now == 10) {
if (sum == s&&cnt == n) {
res++;
}
return;
}
dfs(sum, now + 1, cnt);
dfs(sum + now, now + 1, cnt + 1);
return;
}
int mai... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#pragma region defins
#define ll long long
#define loop(i,n) for (int i = 0; i < n; i++)
#define loops(i,f,n) for (int i = (f); i < n; i++)
#define INF 100000000000000
#define sort(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rbegin(),a.rend... | 1 | 84,537,917 |
#include <iostream>
#include <cassert>
#include <limits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <array>
#include <map>
#include <set>
#include <deque>
#include <list>
#include <sstream>
#include <iomanip>
#include <numeric>
#i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b;
cin>>a>>b;
if(a>=b){
cout<<10<<endl;
return 0;
}
cout<<0<<endl;
return 0;
} | 1 | 18,318,222 |
#include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 200000000
#define ull unsigned long long int
#define f(i,k,n) for(i=k;i<n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 10000 + 10;
ll cnt[N];
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll n, p;
string s;
cin >> n >> p >> s;
ll ans = 0;
if (p == 2 || p == 5){
for (ll i = 0; i < n; i ++)
if ... | 1 | 76,714,404 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n,m,a[10] = {0,0,0,0,0,0,0,0,0,0};
string s,t;
string s1(".,!? ");
string s2("abc");
string s3("def");
string s4("ghi");
string s5("jkl");
string s6("mno");
string s7("pqrs");
string s8("tuv");
string... | #include<iostream>
#include<string>
using namespace std;
#define NMAX 123456
int main(){
string S[10]={"NULL",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string in;
int N;
cin>>N;
while(N--){
cin>>in;
int c;
if(in[0]=='0') c=0;
else c=1;
for(int i=1;i<in.size();i++){
if(in[i]=='0'){
... | 1 | 78,823,364 |
#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;
}
void debug() { cerr << "\n"; }
t... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define per(i,n) for (int i = (n)-1; i >=0; --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
string s;
cin>>s;
vector<int> c(26,0);
rep(i,s.size()){
c[s[i]-'a']++;
... | 1 | 75,219,154 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
int a[2020];
int b[2020];
int dp[2020][2020];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=0,m=0;
cin>>n>>m... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 2e3 + 5, M = 1e5 + 5;
int n, m, a[N], b[N];
ll dp[N][N][3], MOD(1e9 + 7);
ll solve(int i, int j, int men){
if(i == n || ... | 1 | 65,932,160 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
int main(void) {
int i,n;
vector<int> m;
for(i=0; i<10; i++){
cin >> n;
m.push_back(n);
}
sort(m.begin(),m.end(),greater<int>());
for(i=0; i<3; i++) {
cout << m[i] << end... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int ary[10];
for(int i=0;i<10;i++){
cin>>ary[i];
}
for(int i=0;i<10;i++){
for(int j=i+1;j<10;j++){
if(ary[i]<ary[j]){
swap(ary[i], ary[j]);
}
}
}
cout<<ary[0]<<endl;
cout<<ary[1]<<endl;
cout<<ary[2]<<endl;
return 0;
} | 1 | 94,588,097 |
#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
vector<int> ve[N];
priority_queue<int> qe;
int main()
{
int n,m,sum=0;
cin>>n>>m;
int a,b;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
if(m-a+1>0)ve[m-a+1].push_back(b);
}
for(int i=m;i>0;i--)
{
for(int j=0;j<ve[i].size();j++)qe.push(ve[i][j]);
if(q... | 1 | 44,893,269 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define quick \
ios::sync_with_stdio(false); \
cin.tie(0);
#define time cerr << (0.1 * clock()) / CLOCKS_PER_SEC << endl;
#define mod 1000000007
typedef long long ll;
typedef pair<ll, ll> pl;... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | 1 | 29,096,622 |
#include<bits/stdc++.h>
#define LL long long
#define rep(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
static const LL INF = 1LL<<61LL;
static const int MAX_N = 10000;
typedef pair<int,int> PII;
int par[MAX_N];
int rank[MAX_N];
int n,q;
int com,x,y;
class UF{
public:
... | #include<cstdio>
#define rep(i,a) for( int i = 0; i != (a); ++i )
int par[10000], rank[10000];
void init( int n )
{
rep( i, n )
par[i] = i, rank[i] = 0;
return;
}
int find( int x )
{
if( x == par[x] )
return x;
else
return par[x] = find( par[x] );
}
void unite( int x, int y )
{
x = find( x );
y = find( y );... | 1 | 85,065,397 |
#include <bits/stdc++.h>
#define gc( ) std::getchar( )
#define pc( i ) std::putchar( i )
template < typename T >
inline T read( )
{
register T x = 0;
register char ch = gc( );
register bool f = 0;
while( !std::isdigit( ch ) )
{
f = ( ch == '-' );
ch = gc( );
}
while( std::isdigit( ch ) )
{
x = x * 10 + ( ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n);
rep(i, 0, n... | 1 | 99,143,675 |
#include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
int n[101]={0};
int max = 0;
int x;
while(scanf("%d",&x)!=EOF){
n[x]++;
if(max<n[x]){
max=n[x];
}
}
for(int i=0; i<101; i++){
... | #include<iostream>
#include<map>
using namespace std;
main(){
int a,b=0,c=0,n,x=0,max=0;
map< int,int >p;
for(a=0;a++<100;p[a]=0);
while(cin>>n){
if(p[n]==0){
if(b==0||b<n)b=n;
}
p[n]++;
}
for(a=0;a<b;a++){
if(max<p[a]){
max=p[a];
}
}
for(a=0;a<b;a++){
if(max==p[a]){
... | 1 | 80,971,797 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
con... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL W, H; cin >> W >> H;
vector<pair<ULL, int>> P(W + H);
rep(i, W) { cin >> P[i].first; P[i].seco... | 1 | 72,829,003 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) (a).begin(),(a).end()
#define print(A,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i];}cout<<endl;
#define pprint(A,m,n) rep(j,0,m){print(A[j],n);}
const long mod=1e9+7;
const int size=1e2;
const int INF=1e9;
int N,M;
vector<in... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 110, M = 1010, INF = 0x3f3f3f3f;
int n, m;
int g[N][N];
struct Edge
{
int a, b, c;
}e[M];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= n;... | 1 | 21,835,176 |
#include <iostream>
using namespace std;
int main(){
int a;
cin>>a;
string ret;
if(a<1200){
ret="ABC";
}else{
ret="ARC";
}
cout<<ret;
return 0;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define INF INT_MAX;
typedef long long ll;
using namespace std;
int main(){
int x;cin >> x;
(x<1200) ? puts("ABC") : puts("ARC");
} | 1 | 75,560,447 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define db double
#define pi 3.1415926535897932384626
#define PI acos(-1.0)
#define endl "\n"
#define mod 1000000007
#define mk ... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
i... | 1 | 41,984,612 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<string> vs;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
s... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
int mcc = n/4 +1;
int mdc = n/7 +1;
for(int i = 0;i < mcc;i++){
for(int j = 0;j < mdc;j++){
if(i*4 + j*7 == n){
cout << "Yes" << endl;
... | 1 | 53,428,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
for (ll i = k; i <= n + 1; ++i) ans += n * i - i * i + i + 1, ans %= MOD;
cout << ans << endl;
return 0;
} | 1 | 7,484,268 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main()
{
string s;
int a,b;
a=0;
b=0;
cin>>s;
for(int i=0;i<s.size();i++)
{
if(i%2==0)
{
if(s.at(i)=='1')
a++;
}
else
{
if(s.at(i)=='0')
a++;
}
}
... | 1 | 87,534,728 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,... | #include <bits/stdc++.h>
#define MOD (long long)(1E9+7)
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m)
cin >> l[i] >> r[i];
cout << max(0, *min_element(r.begin(), r.end()) - *max_element(l.begin(),... | 1 | 5,711,318 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
int n,m;
cin >> n >> m;
const int max_n = 1e5;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for(int i = 0; i < m; i++){
int left = 0;
int righ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | 1 | 47,970,861 |
#include <iostream>
#include <vector>
#include <algorithm>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int num, i;
ll ans = 1;
cin >> num;
vector<int> s(num), t(num), ss(num, false), tt(num, false);
for (i = 0; i < num; i++)
scanf("%d", &s[i]);
for (i = 0; i < num; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<pair<ll,ll>> t(n);
ll tmp = -1;
for(i = 0;i < n;++i){
cin >> t.at(i).first;
t.at(i).first != tmp... | 1 | 4,186,212 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<unordered_map>
#includ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> p(n);
for (auto i = 0; i < n; i++)
{
int pi;
cin >> pi;
pi -= 1;
p[i] = pi;
}
vector<long long> num(n);
vector<long long> num_r(n);
num[0] = 1;
num_r[0] = 1;
... | 1 | 80,003,114 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#defi... | #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>
#include <iomanip>
#include <limits>
using namespace... | 1 | 34,283,647 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 1 | 63,506,281 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
int y;
cin >> y;
vector<int> x(4);
rep(i,4){
x.at(i) = y%10;
y /= 10;
}
reverse(x.begin(),x.end());
if(x.at(... | 1 | 62,003,849 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> num(N);
for (int i = 0; i < N; i++) {
cin >> num.at(i);
}
sort(num.begin(), num.end());
vector<int> a(N);
int count = 0;
int check = num.at(0);
for(int i = 0; i < N; i++) {
if (num.at(i) == check)... | #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);
}
vector<int> vec(n);
for(int i=0; i<n; i++){
vec.at(a.at(i)-1)++;
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
int num=0;
for(int i=0; i<n; i+... | 1 | 11,903,920 |
#include<iostream>
#include<cstring>
typedef long long ll;
using namespace std;
char str[10000000];
int main(void){
ll n;
char before[1000];
char after[1000];
while(cin>>n,n){
for(int i=0;i<n;i++){
cin >> before[i];
cin >> after[i];
}
ll m;
cin >> m;
for(int i=0;i<m;i... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
do{
char a[256],b[256];
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
int num;
char s;
cin >> num;
for(int i=0; i<num; i++){
cin >> s;
for(int j=0; j<n; j++){
if(s==a[j]){
s=b[j];
break;
}
}
cout << ... | 1 | 58,696,915 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b,c,d,ans,t;
while(cin>>a>>b>>c>>d){
ans=a*c;
t=a*d;
ans=max(ans,t);
t=b*c;
ans=max(t,ans);
t=b*d;
ans=max(ans,t);
cout<<ans<<endl;
}
return 0;} | #include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | 1 | 90,161,578 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
if (a == b) {
cout << "H" << ... | #include <iostream>
using namespace std;
int main(void){
int a,b;
char aa,bb;
cin >> aa >> bb;
a = aa == 'H' ? 1 : 0;
b = bb == 'H' ? 1 : 0;
int ans = a ^ b;
if(!ans){
cout << "H" << endl;
}
else{
cout << "D" << endl;
}
} | 1 | 56,630,450 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf = numeric_limits<ll>::max()/3;
const ll mod = 1e9+7;
int main(void){
int n;
vector< P > points;
set< int > xs;
set< int > ys;
cin >> n;
for(int i = 0;i < n;++i){
int x,y;
cin >> x >> y;
point... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int x[maxn], y[maxn], n, d[maxn], m, flg[2];
void solve(int a, int b){
for(int i=0; i<m-flg[0]; i++){
if(abs(a)>abs(b)){
if(a>0) putchar('R'),a-=d[i];
else putchar('L'),a+=d[i];
}else{
if(b>0) ... | 1 | 57,887,134 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<bool>> map(N, vector<bool>(N, false));
for (int i = 0; i < M; i++)
{
int p, q;
cin >> p >> q;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <random>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <deque>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using vc = vector<char> ;
... | 1 | 14,013,839 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,n,k,t,c=0;
string a;
cin>>n>>a;
for(i=0; i<n; i++)
{
if(a[i]!=a[i+1])
{
c++;
}
}
cout<<c<<endl;
} | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int n;
string s;
cin >> n >> s;
int ans = 1;
for(int i = 0; i < n-1; i++){
if... | 1 | 11,695,714 |
#include <iostream>
#include <numeric>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll X, ll Y) {
ll ans{};
if(X%Y==0) {
ans = -1;
} else {
ans = X;
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a,b;
cin >> a>>b;
if(a%b==0){cout << "-1" <<endl;}
else
{
cout << a <<endl;
}
} | 1 | 66,567,529 |
#include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
signed main() {
const ll T = 100000000;
ll N;
cin >> N;
vector<ll> x(N), y(N);
rep(i,N)
... | 1 | 67,679,965 |
#include <iostream>
using namespace std;
int main(){
while(true){
int n,x; cin >> n >> x;
if(n==0 && x==0) break;
int sum=0;
for(int i=1;i<=n;++i){
for(int j=i+1;j<=n;++j){
for(int k=j+1;k<=n;++k){
if(i+j+k==x) ++sum;
}
}
}
cout << sum << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
vector<int> hmw;
int main(void) {
int n, x, count = 0;
while (cin >> n >> x,
n != 0 || x != 0) {
count = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
for (int k = j; k <= n; k++) {
... | 1 | 87,034,627 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
ll binary_pow(ll n, ll p)
{
return p ? binary_pow(n * n % MOD, p >> 1) * (p & 1 ? n : 1) % MOD : 1;
}
ll factorial(ll n)
{
ll ret = 1;
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
ll Power(ll a,ll b,ll p)
{
ll res=1;
while (b>0)
{
if (b%2!=0)
res=((res%p)*(a%p))%p;
a=((a%p)*(a%p))%p;
b=b/2;
}
return res;
}
ll fac[10000005... | 1 | 12,401,882 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.