code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int n;cin>>n;
int x0 = 0,y0 = 0,t0 = 0;
rep(i,n) {
int t,x,y;cin>>t>>x>>y;
int d = (t-t0)-abs(x-x0)-abs(y-y0);
if(d>=0 && abs(d)%2==0){
... | 0 | 46,821,976 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> b(n-1);
for(int i = 0; i < n-1; i++){
cin >> b[i];
}
vector <int> a(n);
for(int i = 1; i < n-1; i++){
a[i]=min(b[i-1],b[i]);
}
a[0]=b[0];
a[n-1]=b.back();
long ans = 0;
... | 0 | 7,816,674 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define fastio ios::sync_with_stdio(0); cin.tie(0)
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (c... | 0 | 31,834,944 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N, M;
cin >> N >> M;
priority_queue<ll> que;
for(int i=0; i<N; i++){
ll A; cin >> A;
que.push(A);
}
for(int i=0; i<M; i++){
ll b = que.top(); que.pop();
que.push(b/2);
}
ll res = 0;
while(!que.empty()) re... | #include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int n, m, x; cin>>n >>m >>x;
int c[n], a[n][m];
ll ans=0;
... | 0 | 60,079,179 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define... | #include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define INF 1000000100
#define rep(i,n) for (int i=0;i<n;i++)
const int maxN=2*1000... | 0 | 11,406,738 |
#include<cstdio>
#define ll long long
#define mod 1000000007
#define maxn 100010
char s[2*maxn];
int a[2*maxn];
int n;
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
int flag=0;
for(int i=1;i<=2*n;i++){
if((s[i]=='B')==flag)a[i]=-1;
else a[i]=1;
flag^=1;
}
int sum=0;
for(int i=1;i<=2*n;i++)
sum+=a[i];
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int next_combitantion(int sub){
int x=sub & -sub,y= sub+x;
return (((sub&~y)/x)>>1)|y;
}
bool bitget(int a,int b){
return a&1<<b;
}
int main(){
int N,K;
cin >> N >> K;
vector<long long> A(N);
for(long long &i:A)cin >> i;
l... | 0 | 42,805,457 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int main()
{
int a, ans = 0;
cin >> a;
if (a % 2 == 0)
cout << a / 2 - 1 << endl;
else
cout << a / 2 << endl;
} | #include<iostream>
using namespace std;
int main()
{
int N,digit,temp=0;
cin >> N;
while (N != 0)
{
digit = N % 10;
if (digit == 7)
{
temp=1;
break;
}
N = N / 10;
}
if (temp == 1)
{
cout << "Yes\n";
}
else
{
... | 0 | 9,231,755 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while(cin>>n){
if(n==0) break;
n=1000-n;
int ans=0;
ans=ans+n/500;
n=n%500;
ans=ans+n/100;
n=n%100;
ans=ans+n/50;
n=n%50;
ans=ans+n/10;
n=n%10;
ans=ans+n/5;
n=n%5;
ans=ans+n;
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 8005;
const int maxn = 2*N+1;
int x,y,f[3][3][maxn],tt[3];
string t;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>t;
cin>>x>>y;
f[0][1][N] = 1; f[1][1][N] = 1;
int i =0;
int id = 0,time=0;
while (i<t.length()) {
... | 0 | 12,756,525 |
#include <cstdio>
int N;
int A[100010];
int main(int argc, const char * argv[]) {
scanf("%d", &N);
for(int i=0;i<N;++i) {
scanf("%d", &A[i]);
}
long long answer = 0;
int last = 2;
for(int i=0;i<N;++i) {
if (i==0) {
answer += A[0]-1;
continue;
}
if (A[i]==last) {
last++;
... | #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>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 | 70,393,248 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
#define pint pair<int,int>
... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
int N,M,K; cin>>N>>M>>K;
if(K%N==0){
cout<<"Yes"<<endl;
return 0;
}
if(K%M==0){
cout<<"Yes"<<endl;
return... | 0 | 41,015,632 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s sec... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n);
vector<int> x(n);
int64_t sb=0;
for(int i=0;i<n;i++){
cin>>a.at(i)>>b.at(i);
x.at(i)=a.at(i)+b.at(i);
sb+=b.at(i);
}
sort(x.begin(),x.end(),greater<int>());
int64_t sx=0;
for(int... | 0 | 54,119,634 |
#include<cstdio>
#include<algorithm>
#define MN 2100001
using namespace std;
int n,m,a[MN];
long long sum1=0,sum2=0,mmh=1e18;
long long _abs(long long x){return x<0?-x:x;}
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),sum2+=a[i];
for (int i=1;i<n;i++) if (sum1+=a[i],_abs(sum2-sum1-sum... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n; cin >> n;
vector<ll> t(n), a(n);
for (int i=0; i<n; ++i) {
cin >> t[i];
}
for (int i=0; i<n; ++i) {
cin >> a[i];
}
vector<bool> ft(n);
ll cur=t[0];
ft[0]=true... | 0 | 76,406,318 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char str[25];
for (int i = 0;i < 25;i++) {
str[i] = '\0';
}
cin >> str;
for (int i = 24; i >= 0; i--) {
if (str[i] == '\0') continue;
cout << str[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | 0 | 11,676,225 |
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define chmin(x,y) x = min(x, y)
#define chmax(x,y) x = max(x, y)
#define V vector
v... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> i;
vector<int> u;
int o[11000000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long a=0,b,c,d=0,e=0,f=0,g;
string s;
cin >>a;
for(int n=1;n<=a;n++){
d+=n;
o[n]=1;
if(d>a){... | 0 | 75,423,263 |
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll d,sum=0;
while(cin >> d){
sum=0;
for(int i=1;i<=(600/d)-1;i++){
sum+=d*(i*d)*(i*d);
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include <vector>
struct Card{
char c,v;
Card():c(0),v(0){}
Card(const Card &card):c(card.c),v(card.v){}
Card& operator=(const Card &card){
c = card.c;
v = card.v;
return (*this);
}
bool operator==(const Card &card){
return c==card.c&&v==card.v;
}
bool operator!=(cons... | 0 | 73,386,144 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
using namespace std;
const int N = 1e5+5;
vector < int > gr[N];
int vis[N];
void dfs(int cur){
vis[cur] = true;
for(auto x: gr[cur]){
if(!vis[x]){
dfs(x);
}
}
}
void solve(){... | 0 | 85,422,978 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<double> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
if(n==2){
cout<<(v[0]+v[1])/2.0<<endl;
return 0;
}
sort(v.begin(),v.end());
double ans=(v[0]+v[1])/2.0;
for(int i=0;i<n-2;i++){
ans=(ans+v[i+2])/2.0;
}
... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
int main(){
stack<char> stack;
string s;
int len,i,flag;
while(1){
flag=0;
getline(cin,s);
if(s==".") break;
len=s.size();
for(i=0;i<len;i++){
if(s[i]=='('||s[i]=='[') stack.push(s[i]);
else if(s[i]==')')... | 0 | 17,130,796 |
#include <bits/stdc++.h>
using namespace std;
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<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 82,003,238 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
int main(){
int x,y;
cin >> x >> y;
rep(i,x){
if(2*i+4*(x-i)==y){
cout << "Yes ";
return 0;
}
}
cout << "No" << endl;
return... | 0 | 29,550,402 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll N,cn=0,A=0,B=0,BA=0;cin>>N;
string s[10010];
rep(i,0,N){
cin>>s[i];
rep(j,0,s[i].size()-1){
if(s[i].at(j)=='A'&&s[i].at(j+1)=='B')cn++;
}
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 0 | 86,895,986 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, min(n, k)) h.pop_back();
ll ans = 0;
... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int i,j,h,w,n,x,y;
while(cin>>w>>h,h!=0,w!=0){
int r[21][21]={0};
r[1][1]=1;
cin>>n;
for(i=0;i<n;i++){
cin>>x>>y;
r[y][x]=-1;
}
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
if(r[i][j]!=-1){
if(i!=1&&r[i-1][j]... | 0 | 50,730,852 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
bool rev_fl = i<b;
rep(j,w){
if(j<a){
if(rev_fl) cout << 1;
else cou... | #include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int n;
double x1, x2, x3, x4, y1, y2, y3, y4, slope1, slope2;
double abs(double s) {
return s < 0 ? -s : s;
}
int main(void) {
cin >> n;
while(n--) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
slope1 =... | 0 | 48,582,251 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int inf =1000000000;
int main() {
int n;
ll c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
vector<int> bus;
int l = 0;
boo... | #include <cstdio>
int main( void )
{
while ( true )
{
int h, w;
scanf( "%d %d", &h, &w );
if ( ( h == 0 ) && ( w == 0 ) ) break;
for ( int j = 0; j < w; j++ ) { printf("#"); }
printf("\n");
for ( int i = 1; i < ( h - 1 ); i++ )
{
printf(... | 0 | 55,365,597 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#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 << " = " << (x) << endl;
#define leftunique(a) {sort((a).begin(),(a).end());(a).erase(unique((a).begin(),(a).end()),(a).end());}
t... | #include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=1;i<=n;i++)
typedef pair<int,int> P;
char a[1002][1002];
P f[12];
int d[1002][1002];
int bfs(P from,P to){
loop(i,1000)loop(j,1000)d[i][j]=-1;
queue<P>que;
que.push(from);
d[from.first][from.second]=0;
int dir[5]={0,-1,0,1,0};
while(!... | 0 | 54,084,857 |
#include<iostream>
#include<string>
using namespace std;
enum version{
fleft,
fright,
};
version check(char c){
switch(c){
case 'q':
case 'w':
case 'e':
case 'r':
case 't':
case 'a':
case 's':
case 'd':
case 'f':
case 'g':
case 'z':
case 'x':
case 'c':
case 'v':
case 'b':
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
auto f = [](int x) {
cout << x << '\n';
cout << flush;
string s;
cin >> s;
if (s == "Vacant") {
exit(0);
} else if (s == "Male") {
return 0;
} else {
... | 0 | 68,806,188 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
int main() {
ll n;
cin>>n;
ll f=0;
ll counter=0;
ll ca=0;
string a;
cin>>a;
for(ll i=0; i<n; i++){
if(a.at(i)==')'){
counter++;}
else{
ca++;}
if(counter>ca){
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 15,320,914 |
#pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vpi = vector<pi>;
using ld = long double;
const int... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | 0 | 40,764,776 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,m,x,y; cin>>n>>m>>x>>y;
... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void){
string s;
stack <string> st;
string::iterator it;
while(getline(cin,s)){
it=s.end();
it--;
if(s.size()==1&&*it=='.')
break;
for(it=s.begin();it!=s.end();it++){
if(*it=='('){
st.push("(");
... | 0 | 37,552,161 |
#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>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string a, t;... | 0 | 74,055,468 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
int l1 = 1;
int r1 = m+1;
int l2 = m+2;
int r2 = 2*m+1;
for(int i=0;i<m;i++)
{
if(l1 < r1)
{
cout << l1 << ' ' << r1 << '\n';
l1++;
r1--;
}
else if(l2 < r2)
{
c... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 10,389,208 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(int i=0;i<n;++i){
cin >> a[i];
}
ll res=0;
ll su=0;
int i=0;
while(i<n){
int j=i;
while(j<n && a[j]>0){
su+=a[j];
j++;
}
res+=su/2;
su=0;
i=j+1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 73,845,634 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include <stdio.h>
int main() {
int weeks = 0;
double money = 100.0d;
scanf("%d", &weeks);
for (int i = 0; i < weeks; ++i) {
money *= 1.05d;
int temp = (int) money;
if (temp < money) {
temp++;
}
money = temp;
}
int result = (int) money;
res... | 0 | 18,740,427 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i,n) for(ll i=0;i<n;i++)
int gcd(int a,int b){
if(a<b) return gcd(b,a);
int r;
while(r=a%b){
a=b;
b=r;
}
return b;
}
int ma... | 0 | 73,989,690 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b ;
printf("%d %d %f\n",a/b,a-a/b*b,(double)a/(double)b);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(ll)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(... | 0 | 7,250,159 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <functional>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX]... | #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> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 88,759,279 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
set<int> st;
int cur = 0;
while(true){
st.insert(cur);
if(cur % b == c){
cout << "YES" << endl;
return 0;
}
cur += a;
cur %= b;
if(st.count(cur)){
cout << "NO" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n),b(n);
for(ll i = 0; i < n; i++) cin >> a[i];
for(ll i = 0; i ... | 0 | 23,718,086 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t=1;
while(t--)
{
int n,k;
cin>> n >> k;
int freq[101]={0};
while(k--)
{
int d;
cin >> d;
while(d--)
{
int a;
cin >> a;
freq[a]++;
}
}
int count=0;
for(int i=1;i<=n;i++)
{
if(freq[i]==0)
{
count++;
... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int mod=1000000007;
int n;
int ans;
for (;;) {
scanf("%d",&n);
if (n!=0) {
vector<int> p(n);
for (auto&e:p) {
... | 0 | 43,167,784 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;... | 0 | 26,016,096 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 79,703,378 |
#include <bits/stdc++.h>
using namespace std;
int func(int N) {
int res = 0;
while (N) {
++res;
N /= 10;
}
return res;
}
int main() {
int N; cin >> N;
int res = 0;
for (int n = 1; n <= N; ++n) if (func(n) & 1) ++res;
cout << res << endl;} | #include <iostream>
#include<algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int D, X;
cin >> D >> X;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
X += (D - 1) / A.at(i) + 1;
}
cout << X << endl;
} | 0 | 93,199,336 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
#include <set>
#include <unordered_set>
#include <list>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <climits>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
int num = 0;
for (int i=A;i<B+1;i++){
int C = i;
int count = 0;
int sum = 0;
vector <int> x;
while(C>0){
int mod = C % 10;
x.push_back(mod);
C /= 10;
count++;
... | 0 | 95,543,095 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define setA0(a) for(ull i =0;i<n;i++){a[i] = 0;}
#define aout(a) for(auto x : a){cout<<x<<' ';}
#define a... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
string S;
cin >> S;
int N = (int)S.size();
vector<bool> used(30, false);
if... | 0 | 89,001,747 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long int LL;
using namespace std;
int main()
{
LL A,B,K,cnt=0,n;
scanf("%lld%lld%lld",&A,&B,&K);
n=max(A,B);
for(LL i=n;i>=1;i--)
{
if(A%i==0&&B%i==0)
cnt+=1;
if(cnt==K)
{
... | #include <iostream>
#include <string>
using namespace std;
int main (void) { ... | 0 | 63,980,425 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
i... | #include <iostream>
bool is_right_triangle(const int a, const int b, const int c)
{
bool ret;
int aa;
int bb;
int cc;
aa = a * a;
bb = b * b;
cc = c * c;
if (aa + bb == cc || bb + cc == aa || cc + aa == bb){
ret = true;
}
else {
ret = false;
}
return ret;
... | 0 | 7,561,872 |
#include <stdio.h>
int main (){
int angka, ratusan, puluhan, satuan;
scanf("%d", &angka);
ratusan = (angka / 100);
puluhan = (angka%100)/10;
satuan = (angka%100%10);
if(ratusan == 7 || puluhan== 7||satuan ==7){
puts("Yes");
}
else {
puts("No");
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
using namespace std;
#define IN... | 0 | 30,078,302 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int x, a;
cin >> x >> a;
if(x<a){
cout << 0 << endl;
}
else{
cout << 10 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int tmp,i = 0,j,k = 0,f[11];
vector<int> ans;
while(cin>>tmp){
if(tmp == 0){
ans.push_back(f[i-1]);
f[i-1] = '\0';
i--;
k++;
}
else{
f[i] = tmp;
i++;
}
}
for(j = 0;j < k;j++){
cout<<ans[j]<<endl;
}
return 0;
} | 0 | 22,703,704 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for(int i=0; i<N; i++){
cin >> arr.at(i);
}
int64_t max_abs=-1;
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
if(i==j){
continue;
}
if(max_abs < abs(arr.at(i)-arr.at(j))){
... | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RRE... | 0 | 94,944,520 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n; cin >> n;
string s;
map<string, ll> mp;
rep(i,n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
string s;
cin >> s;
bool judge=true;
while(s.size()!=0){
ll k=0;
ll n=s.size();
if(n>=5){
if(s.substr(n-5)=="erase"||s.substr(n-5)=="dream"){
k++;
... | 0 | 24,453,635 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
const double PI = acos(-1.0);
int main(){
string s,t;
cin >> s >> t;
int n = s.size();
vector<int> as(n),at(n);
map<char,int> ms,mt;
ms[s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int k;
ll ans;
ll solve() {
deque<pair<int, ll>> deq;
set<int> visited;
deq.push_front(make_pair(1, 0LL));
ll ret = 0;
while (!deq.empty()) {
auto cur = deq.front();
d... | 0 | 14,576,979 |
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = N - 1;
for (long long i = 1; i * i <= N; i++) {
if (N % i) continue;
long long j = N / i;
ans = min(ans, i + j - 2);
}
cout << ans << endl;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 70,623,935 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define P pair<int, int>
#define fi first
#define se second
#define INF (1 << 30)
#define REP(i, n) for (int i = 0; i < n; i++)
const int MAX_V = 100000;
struct edge {
int to, cost;
};
int V;
vector<edge> G[MAX_V];
int d[MAX_V];
void bfs01(int s) {
... | 0 | 10,826,624 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int n, l;
vector<string>s;
void solve(){
cin >> n >> l;
for(int i=0;i<n;++i) {
string t;
cin >> t;
s.push_back(t);
}
sort(s.begin(), s.end());
for(string i:s)
cout << i ;
cout << "\n";
}
int ma... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
int bs_upper_bound(int a[], int n, int x) {
int l = 0;
int h = n;
while (l < h) {
int mid = l + (h - l) / 2;
if (x >= a[mid]) {
l = mid + 1;
}... | 0 | 91,020,855 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A,B;
cin >> A >> B;
if(A==1){
A=14;
}
if(B==1){
B=14;
}
if(A>B){
cout << "Alice" << endl;
}
else if(A==B){
cout << "Draw" << endl;
}
else if(A<B){
cout << "Bob" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 74,863,263 |
#include <iostream>
using namespace std;
int main() {
string S;
int n;
cin >> S >> n;
for (int i = 0; i < S.length(); i += n) cout << S[i];
cout << endl;
} | #include <stdio.h>
int main(){
int a,b,c;
int sum=0;
scanf ("%d %d %d", &c,&a,&b);
for(int i=1;i<=c;i++){
int x = 0;
int y = i;
while(y != 0){
x += (y%10);
y = y / 10;
}
if(x >= a && x <= b){
sum += i;
}
}
printf("%d",sum);
return 0;... | 0 | 16,073,712 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n, total = 0;
scanf("%d", &n);
vector<int> v(n);
rep(i,n){
scanf("%d ", &v[i]);
total += v[i];
}
int s, min = 1e5;
rep(t,n){
s = 0;
rep(i,t){
s += v[i];
}
if ( abs(total - 2*s) <= min ) min = abs(t... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 31,514,550 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<int> p(m);
vector<int> y(m);
vector<vector<int>> all(n);
for(int i=0; i<m; i++){
int a,b;
cin >> a >> b;
a--;
p.at(i) = a;
y.at(i) = b;
al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if (a ... | 0 | 71,595,977 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a;
cin >> n >> a;
int b = n / 500;
int res = n - 500 * b;
if(a >= res){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <stdio.h>
int main(void){
int n;
int b,f,r,v;
int i,j,k;
int count[4][3][10]={{{0,0,0}}};
scanf("%d\n", &n);
for ( i = 0 ; i<n ; i++ ){
scanf("%d %d %d %d\n", &b ,&f, &r, &v );
count[b-1][f-1][r-1] += v;
}
for( i = 0 ; i <4 ; i++ ){
for( j = 0 ; j < 3 ; j++ ){
for(k = 0 ; k ... | 0 | 56,409,606 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N, M, P;
while(cin >> N >> M >> P, N != 0){
vector<int> vote(N);
int sum = 0;
rep(i, N... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 22,535,463 |
#include <bits/stdc++.h>
using namespace std;
bool visited[(int) (1e5 + 2)];
int g[(int) (1e5 + 2)];
int dfs(int curr, int c)
{
if (curr == 2)
{
printf("%d\n", c-1);
return true;
}
if (visited[curr])
{
return false;
}
visited[curr] = true;
return dfs(g[curr], c +... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod = 1000000007;
int main() {
int n;
cin >> n;
int ... | 0 | 94,261,583 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endi... | #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 ... | 0 | 83,352,052 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int N;
cin >> N;
int count = 0;
vector<int> list = {1, 3... | #include <bits/stdc++.h>
#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 rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax... | 0 | 31,735,023 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for(int i=0; i<m; i++){
int p,y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p,y);
c[p].emplace_back(y,i);
}
for(int i=0; i<n; i++){
so... | #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>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | 0 | 51,138,823 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
int ball[k];
n = n-k;
ball[0] = 1;
ball[k-1] = 1+n;
cout << ball[k-1]-ball[0] << endl;
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define mp make_pair
#define pb(x) push_back(x)
#define... | 0 | 92,504,872 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a=1000,b,n,p,x,ans=1000;
scanf("%lld",&n);
for (long long i=1;i<100001;i++) {
if (n%i==0) {
a=1;
b=1;
p=max(i,n/i);
for (long long j=1;j<12;j++) {
if (p/b>0) a=j;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_ba... | 0 | 31,232,234 |
#include <iostream>
using namespace std;
char dp[100][100];
int a,b;
void paint(int x,int y){
dp[x][y]='#';
dp[x+1][y]='#';
dp[x+1][y-1]='#';
return ;
}
int main(void){
cout<<100<<" "<<100<<endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
dp[i][j]='.';
}
}
... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
struct edge {ll to, cost;};
void dijkstra(ll s, ll V, vector<vector<edge>>& G, vector<vector<bool>>& used)
{
vector<ll> d(V, INF);
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greate... | 0 | 20,236,596 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int a, k = 0;
cin >> s;
for (int i = 0; i < 3; i++)
{
if (i % 2 == 0)
a = 5;
else
a = 7;
for (int j = 0; j < a; j++)
{
cout << s[k];
k++;
}
if (i != 2)
{
cout << ' ';
k++;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> A(N), B(N);
vector<int> C(N);
long long total = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
... | 0 | 84,504,404 |
#include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#d... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <limits>
const int mod = 1e9 + 7;
#define INF 1000000000000000
typedef long long int ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
long long gcd(long long a, long long b) {
if (a... | 0 | 12,950,001 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string word1,word2;
cin >> word1;
cin >> word2;
int L[1100][1100];
int flag=1;
for(int i=0;i<=word1.size();i++)
L[i][0]=i;
for(int j=0;j<=word2.size();j++)
L[0][j]=j;
for(int i=1;i<=word1.size();i++)
... | 0 | 15,210,738 |
#include <stdio.h>
int main()
{
int k, x;
scanf("%d %d", &k, &x);
if(k*500>=x)
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const ll INFL = (1LL << 60);
const int INFI = (1 << 30);
int main() {
ll H, W, ans = INFL; cin >> H >> W;
if (H % 3 == 0 || W % ... | 0 | 35,559,408 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pa = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e14;
const long double EPS = 1e-11;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,m;
cin >> n >> m;
vector<vector<ll>>s(m);
for(ll i=0;i<m;i++){
ll k;
cin >> k;
for(ll j=0;j<k;j++){
ll x;
cin >> x;
s[i].push_back(x-1);... | 0 | 91,148,425 |
#include <iostream>
using namespace std;
int main(int argc, char** argv) {
int n;
while(cin >> n) {
int count = 0;
for(int a=0; a<=9; a++) {
for(int b=0; b<=9; b++) {
for(int c=0; c<=9; c++) {
for(int d=0; d<=9; d++) {
if(a+... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
while (true) {
string s;
cin >> s;
int hand[26] = {0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0,
1, 0, 0, 0, 1, 0};
if (s == "#") {
... | 0 | 45,832,872 |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d,s,t;
cin>>a>>b>>c>>d;
s=a+b+c+d;
cin>>a>>b>>c>>d;
t=a+b+c+d;
cout<<max(s,t)<<endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#inclu... | 0 | 98,111,419 |
#include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
cout << (long long) N*(N-1)/2 << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
void print(string str, int a, int b)
{
cout << str.substr(a, b - a + 1) << endl;
}
string reverse(string str, int a, int b)
{
string left = str.substr(0, a);
string middle = str.substr(a, b - a + 1);
string right = str.substr(b + 1);
reve... | 0 | 36,483,242 |
#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<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> n;
vector<pair<int, int>> rs(n), b... | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typedef ... | 0 | 19,969,295 |
#include <algorithm>
#include <iostream>
#include <vector>
template <typename C>
void print_container(const C &c, const std::string &name)
{
std::cout << name << ": ";
std::for_each(c.cbegin(), c.cend(),
[](auto &x) { std::cout << x << ", "; });
std::cout << std::endl;
}
int get_GCD(int lhs, int r... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll kadomatsu(ll n,ll ar[],ll a,ll b,ll c,ll suma,ll sumb,ll sumc,ll i){
if(i==n){
if( !suma || !sumb || !sumc ){ return INT_MAX;}
return abs(a-suma)+abs(b-sumb)+abs(c-sumc);
}
ll o1=kadomatsu(n,ar,a,b,c,suma,sumb,sumc,i+1);
... | 0 | 64,832,725 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int a,b,c,d,e=0;
cin>>a>>b>>c>>d;
a--;
int p= b-a;
int q= b/c -a/c;
int r= b/d -a/d;
int s= (c*d)/ __gcd(c,d);
int t= b/s - a/s;
cout<<(p-q-r+t);
} | #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
ii ma[19][1 << 18];
void Update(ii& a, int x) {
if (x > a.first) {
a.second = a.f... | 0 | 62,551,305 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%b==0)
cout<<"-1"<<endl;
else
cout<<a<<endl;
return(0);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | 0 | 23,703,561 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll N,A,B;
cin>>N>>A>>B;
if(A*B<N || A+B>N+1) cout<<-1<<endl;
... | 0 | 42,365,268 |
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 83,835,828 |
#include <bits/stdc++.h>
template <typename T>
void update(T &x, const T &y) {
if (x > y) x = y;
}
const int MAX_N = 110, INF = 0x3f3f3f3f;
int n, m;
char s[MAX_N][MAX_N];
int dp[MAX_N][MAX_N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
dp[1][1] = s[1][1] == '#';
... | #include <iostream>
#include <iomanip>
#include <complex>
using namespace std;
typedef complex<long double> P;
int n;
void dfs(const P& p1, const P& p2, int i)
{
if(i == n){
cout << p2.real() << ' ' << p2.imag() << endl;
return;
} else {
P p3, p4, p5;
p3 = (p2 - p1) / 3.0L + p1;
... | 0 | 51,286,405 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
string in[100];
for (int i = 0; i < h; ++i)
{
cin >> in[i];
}
for (int i = 0; i < h * 2; ++i)
{
cout << in[i/2] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (unsigned i = (a); i <= (b); ++i)
#define per(i, a, b) for (unsigned i = (a); i >= (b); --i)
using namespace std;
using I = int;
using L = long;
using F = float;
using S =... | 0 | 73,572,237 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<pii> vii;
typedef vector<pll> v... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int, int>;
struct UnionFind {
vi p, sz;
int n;
UnionFind(int n): n(n) {
p.resize(n);
sz.assign(n, 1);
for (int i = 0; i < n; i++)
p[i] = i;
}
int find_set(int u) {
return p[u] = u == p[u] ? u : find_set... | 0 | 60,878,294 |
#include<bits/stdc++.h>
using namespace std;
static const int MAX=100000;
static const int INFTY=(1<<29);
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
void dfs(int s){
V[s]=true;
for (int i = 0; i < G[s].size(); ++i) {
int v=G[s][i];
if(!V[v])dfs(v);
}
out.push_front(s);
}
int main(){
int s,t,M;
cin... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 17,171,256 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define first F
#define second S
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int x, n; cin>>x>>n;
map<int, int> m;
for(int i=0; i<n; i++){
int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,ans="";
cin >> S;
bool f = false;
if (S == "zyxwvutsrqponmlkjihgfedcba") ans = "-1";
else{
if (S.length()<26){
for(int i='a';i<'z'+1;i++){
for(auto &v:S){
if(i==v){
break;
}
if (v==S[S.length()-... | 0 | 4,872,905 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#def... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 62,657,284 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main(){
string str,command,p;
string X="print",Y="reverse",Z="replace";
int q,a,b,i,j;
char w;
cin >> str;
cin >> q;
for(i=0;i<q;i++){
cin >> command >> a >> b;
if(command == X){
for(j=a;j<=b;j++){
cout << str[j];
}
... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#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
typedef long long ll;
typedef pair<int,i... | 0 | 67,540,902 |
#include <iostream>
using namespace std;
const int mxN = 2e5 + 5;
long long a[mxN], cnt[mxN];
int main() {
int n;
cin >> n;
long long tot = 0;
for(int i = 1; i <= n; ++i)
cin >> a[i], ++cnt[a[i]];
for(int i = 1; i <= n; ++i) {
tot += (cnt[i] * (cnt[i] - 1) / 2);
}
for(int i = 1; i <= n; ++i) {
long long te... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 82,175,367 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
P[i]--;
}
for (int i = 0; i < N; i++) cin >> C[i];
ll ans = -INF... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | 0 | 9,883,812 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
int T;
cin >> N >> T;
vector<int> t(N);
for (int i = 0; i < N; ++i) {
cin >> t[i];
}
long long start = -1;
long long end = 0;
long long ans = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int tmp=0; tmp<(1<<(S.size()-1)); tmp++) {
bitset<3> bit_tmp(tmp);
string s_result = "";
s_result += S.at(0);
int result = stoi(s_result);
for (int cnt=1; cnt<S.size(); cnt++) {
string S_n = "";
S_n... | 0 | 77,838,971 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int x,y; cin >> x >> y;
y /= 2;
cout << x+y << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll>... | 0 | 78,828,204 |
#include<stdio.h>
#include<string.h>
int main(void){
char S[12];
char T[12];
int A,B;
char U[12];
scanf("%s", &S);
scanf("%s", &T);
scanf("%d", &A);
scanf("%d", &B);
scanf("%s", &U);
if(strcmp(S, U) == 0){
A--;
printf("%d %d\n", A, B);
}else if(strcmp(T, U) ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name... | 0 | 96,882,848 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for(int i = (int)(k);i < (int)(n);i++)
int main() {
int N, K;cin >> N >> K;
vector<int> dp(100005), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0;
rep(i, 1, K) dp[i] = abs(c[0] - c[i]);
rep(i, K, N) {
dp[i] = dp[i-1]+abs(c[i-1]-c[i]);
re... | #include <bits/stdc++.h>
using namespace std;
int main(){
char s[4];
scanf("%s", s);
map <char, int> freq;
for(int i = 0; i < 4; i++){
freq[s[i]]++;
if(freq[s[i]] >= 3)
return puts("No"), 0;
}
for(auto x : freq){
if(x.second != 2)
return puts("No")... | 0 | 40,741,459 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define ALL(c) (c).begin(), (c).end()
... | #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... | 0 | 52,005,665 |
#include<iostream>
#include<vector>
#include<string>
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
int main(){
ll n, start;
std::cin >> n >> start;
ll ans;
std::cin >> ans;
ans = std::abs(ans - start);
for(int i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = { 1, 0, -1, 0 }, dy[4]... | 0 | 6,991,076 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
inline int read()
{
int x = 0 , f = 1; char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 70,008,780 |
#include <iostream>
using namespace std;
int main()
{
int a ,n, x ;
cin>> n;
cin>> a;
if (n>500 ){
x = n%500;
if (x<=a) {
cout<< "Yes";
}
else{
cout<< "No";
}
}
else if(a>0 && n<=a){
cout<< "Yes";
}
else{
cout<< ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i,n) for(int i=0;i<(n);i++)
#define Fr(i,n) for(int i=0;i++<(n);)
#define ifr(i,n) for(int i=(n)-1;i>=0;i--)
#define iFr(i,... | 0 | 5,320,227 |
#include<iostream>
using namespace std;
int main()
{
int ans = 0;
int N, X;
do{
cin >> N >> X;
ans = 0;
if( N == 0 && X == 0 )break;
for(int i = 1; i <= N - 2; i++){
for(int j = i + 1; j <= N - 1; j++){
for(int k = j + 1; k <= N; k++){
if( i + j + k == X ){
ans++;
}
}
}
}
co... | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include<algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m... | 0 | 85,228,002 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
#define ALL(x) (x).begin(),(x).end()
int main(){
ll K;
cin >> K;
ll N = 50;
vector<ll> A(N);
for(int i=0;i<N;i++) {
A[i] = (N-1) + K/N;
}
ll d = K % N;
for(int i=0;i<d;i++) {
A[i] += N;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define clr(a,b) memset(a,b,sizeof(a))
ll n,m,k,ans;
char c[10005];
ll p,q,r;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>c[i];
if(c[i]=='R')p++;
if(c[i]=='G')q++;
if(c[i]... | 0 | 20,211,219 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define sz(obj) ((int)(obj).size())
#define pf push_front
#define pb push_back
int main()
{
int a[101] = {0}, n, m = ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string s;
cin >> s;
vector<char> show;
rep(i,s.size()) {
if (s[i] == '0' || s[i] == '1') show.push_back(s[i]);
else {
if (show.size() == 0) continue;
show.pop_back();
}
}
for(c... | 0 | 86,372,536 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.1415926535;
void solve(int a, int b, int x)
{
cout << fixed << setprecision(10);
double theta;
if (x < (double)a * a * b / 2.0)
{
theta = PI / 2.0 - atan((2.0 * x) / ((double)a * b * b));
}
else
{
theta = atan(... | #include <bits/stdc++.h>
using namespace std;
void solve(){
string str;
cin >> str;
int rain = 0;
int flag = 0;
for(int i = 0; i < 3; i++){
if(str[i] == 'R'){
flag++;
}
else{
flag = 0;
}
rain = max(rain, flag);
}
cout << rain << "\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL... | 0 | 89,307,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.