code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for(... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
class Dice{
public:
int face[7];
int nowFace;
int center;
int top;
int bottom;
int left;
int right;
Dice(int num[]){
for(int i = 1; i <= 6; i++){
face[i] = num[i];
}
... | 0 | 37,169,535 |
#include <bits/stdc++.h>
using namespace std;
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; }
const ll INF = 1LL << 60;
int main() {
int a, b, x; cin >> a >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl "\n"
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
ll x, y;
cin >> x >> y;
ll a... | 0 | 16,771,498 |
#include <bits/stdc++.h>
#define pii pair<int, int>;
#define ss second
#define ff first
#define all(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const ll oo = 1 << 31;
int main(){
ios_base::sync_with_stdio(false);
int n, m;
string a[51], b[51];
cin >> n... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int aa[1010][1010];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
int m=1;
vector<int> a;
while((m*(m+1))/2<=100000){
a.push_back((m*(m+1))/2);
m++;
}
bool f=false;
int p;
f... | 0 | 13,667,351 |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,n,ans=0;
int main()
{
cin>>a>>b>>c>>n;
for(int i=0;i<=n;i+=a) for(int j=0;i+j<=n;j+=b) if((n-i-j)%c==0) ans++;
cout<<ans<<endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#d... | 0 | 18,298,676 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
int sum = 1;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
if ((sum + k) > sum * 2) { sum += sum; }
else if ((sum + k) <= sum * 2) { sum += k; }
}
cout << sum << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 69,405,856 |
#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);
static const int INF = 1e9... | #include<iostream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main(){
int m,f,r;
while(true){
cin >> m>>f>>r;
if(m==-1&&f==-1&&r==-1) break;
int sum = m+f;
if(m==-1 || f==-1) cout << "F";
else if(sum >= 80) cout << "A"... | 0 | 43,418,455 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #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 h,w,k;
cin >> h >> w >> k;
vector<string> c(h);
int ans = 0;
rep(i,h) cin >> c[i];
rep(is,1<<h)rep(js,1<<w){
int counts = 0;
rep(i,h)rep(j,w){
if(is>>... | 0 | 11,091,343 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,cnta=0,cntb=0;
cin >> n;
long a[n],b[n];
rep(i,n){
cin >> a[i];
cnta += a[i];
}
rep(i,n){
cin >> b[i];
cntb += b[i];
}
if(cnta<cntb) cou... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
string s,t;
cin >> N >> s >> t;
int count = 0;
for(int i = N; i > 0 ; i -= 1){
if(s.substr(N-i, i) == t.substr(0,i)){
count = i;
break;
}
}
printf("%d\n", 2*N - count);
} | 0 | 40,110,827 |
#include<iostream>
using namespace std;
int main(){
int monny;
int coin[]={500,100,50,10,5,1};
while(cin>>monny&&monny!=0){
monny=1000-monny;
int answer=0;
for(int i=0;i<6;++i){
answer+=monny/coin[i];
monny%=coin[i];
}
cout<<answer<<endl;
}
return 0;
} | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | 0 | 64,884,813 |
#include <bits/stdc++.h>
using namespace std;
int m;
vector<int>p;
vector<int>s;
int maxn,minn;
int main(){
int i,j,now=0,ni=0;
while(1){
cin >> m >> minn >> maxn;
now = 0;
if(m==0&&maxn==0&&minn==0)break;
for(i=0;i<m;i++){
cin >> j;
p.push_back(j);
}
sort(p.begin(),p.end());
for(i=0;i<m-1;i++... | #include<iostream>
#include<string>
using namespace std;
int main(){
int N;
string dum;
cin >> N >> dum;
if(N >=dum.length()){
cout << dum ;
}
else{
for(int i=0; i<N; i++){
cout << dum[i];
}
cout << "...";
}
return 0;
} | 0 | 45,074,733 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
using namespace std;
int main()
{
int x;
int ans;
cin >> x;
while(x!=0) {
x=1000-x;
ans=0;
ans+=x/500;
x=x%500;
ans+=x/100;
x=x%100;
ans+=x/50;
x=x%50;
ans+=x/10;
x=x%10;
ans+=x/5;
x=x%5;
... | 0 | 54,843,783 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
int l[8];
int dfs(int cur, int a, int b, int c)
{
if(cur == N){
if(min({a,b,c}) > 0){
return abs(a-A) + abs(b-B) + abs(c-C) - 30;
}else{
return 1e9+7;
}
}
int ret0 = dfs(cur+1, a, b, c);
int ret... | 0 | 80,848,812 |
#include<bits/stdc++.h>
using namespace std;
int h,w,d;
const string color = "RBGY";
int main(){
cin>>h>>w>>d;
for( int i = 0; i < h; i++ ){
for( int j = 0; j < w; j++ ){
int a = i + j;
int b = w + i - j;
putchar(color[a/d%2+b/d%2*2]);
}
puts("");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 | 66,833,918 |
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100100;
int k;
char s[N];
int main() {
scanf("%s %d", s, &k);
int n = strlen(s);
long long res = 0;
vector <int> c;
for (int i = 0; i < n;) {
int j = i;
while (j < n && s[i] == s[j])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, R;
cin >> N >> M >> R;
vector<int> r(R);
for (int i = 0; i < R; i++) {
cin >> r.at(i);
r.at(i)--;
}
vector<vector<int>> G(N, vector<int>(N, 1e9));
for (int a, b, c; cin >> a >> b >> c;) {
G.at(--a).at(--b) = c;
G.at(b).at... | 0 | 46,926,341 |
#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
typedef long long ll;
ll n, x, y, a[N], b[N] = {1}, c[N], v[N];
ll M = 1e9 + 7;
int main()
{
ll i, j;
cin >> n;
n++;
for (i = 1; i <= n; i++) b[i] = b[i - 1] * i % M;
for (c[n] = 1, i = b[n], j = M - 2; j; i = i * i % M, j >>= 1)
if (j &... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nl cout << '\n'
#define sor(x) sort(x.begin(), x.end())
#define rev(v) reve... | 0 | 57,196,322 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
int n;
cin >> n;
vll a(n);
rep(i,n) {
cin >> a.at(i);
a.at(i) -... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)
vector<int> dz = {-1,0,1};
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | 0 | 59,708,184 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | 0 | 57,556,208 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
#include<iom... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>... | 0 | 95,802,844 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,m,x,y,i;
cin>>n>>m>>x>>y;
int xi,yi,a;
cin>>xi;
for (i=0;i<n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | 0 | 2,466,563 |
#include<stdio.h>
#include <string.h>
int main()
{
char str[21]={};
char ch;
int n;
scanf("%s",str);
n = strlen(str);
for(int i=0;i<n;i++)
{
printf("%c",str[n-i-1]);
}
printf("\n");
return 0;
} | #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... | 0 | 61,417,365 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 7,302,286 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {... | 0 | 13,430,489 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
vector<char> nchar = {'0','1','2','3','4','5','6','7','8','9'};
bool check(string s,string t){
int... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 35,568,693 |
#include<iostream>
#include<math.h>
using namespace std;
#define ll long long
int main(){
int n,k,x,y;
cin>>n>>k>>x>>y;
int total=0;
if(n<=k)
{
total=x*(n);
}else{
total=k*x;
total+=y*(n-k);
}
cout<<total;
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | 0 | 67,525,667 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,k,flag=0;
cin >> n >> m >> k;
if(n)
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if(k==i*m+j*n-i*j*2) flag = 1;
}
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+10;
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--)
template<class T>
vector<T> make_v... | 0 | 22,280,933 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans;
if (n > 1) {
ans = max(abs(a[n - 1] - w), abs(a[n -... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 69,841,795 |
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>
#define FOR(i, a, b) for( int... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | 0 | 68,417,088 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll dp[105][105];
int main() {
cin.tie(0);
ios:... | 0 | 16,117,692 |
#include <bits/stdc++.h>
using namespace std ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
int n ;
cin>>n ;
long long arr[n] ;
for(int i = 0 ; i < n ; ++i)
cin>>arr[i] ;
long long ans = 0ll ;
sort(arr, arr + n) ;
while(true)
{
bool t = true ;
for(int i = 0 ; i < n ; ++i)
t &= (arr[i] < n... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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; }
const ... | 0 | 6,477,796 |
#include<cstdio>
using namespace std;
int n,L,a[100005],x;
inline int read(){
int ret=0;bool f=0;char ch=getchar();
while(ch>'9'||ch<'0') f^=ch=='-',ch=getchar();
while(ch<='9'&&ch>='0') ret=ret*10+ch-'0',ch=getchar();
return f?-ret:ret;
}
int main(){
n=read(),L=read();
for (int i=1;i<=n;i++) a[i]=read();
for (i... | #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 = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 32,093,453 |
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
using namespace std;
int n,a,c[300010],k,q[300010];
bool judge(int samp){
int l=1,r=n,mid,ans;
while(l<=r){
mid=(l+r)/2;
if(c[mid]<samp&&(mid==n||c[mid+1]>=samp)){ans=mid;break;}
else if(c[mid]<samp) l=mid... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
typedef pair<int,int> pii;
ll C2(ll k){
ll cnt = 0;
while(k % 2 == 0){
cnt++;
k /= 2;
}
return cnt;
}
map<long long, int> prime_factor(long long n){
map< long long, int... | 0 | 47,426,305 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int N;
cin>>N;
ll A[N+1]={},B[N+1]={};
bool same=true;
for(int i=0;i<N;i++){
cin>... | #include <iostream>
#define oo 0x7fffff
namespace MyNameIsLzz {
int N, M, X;
int map[15][15];
int C[15];
int val[15];
int ans = oo;
void dfs(int cur, int sum) {
if (cur == N) {
for (int i = 0; i < M; i++)
if (val[i] < X)
return;
... | 0 | 34,447,955 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
template<typename T> class WeightedUnionFind{
protected:
vector<int> par;
vector<T> w;
public:
WeightedUnionFind(int n);
... | 0 | 15,327,908 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int x, n;
vector<int> p;
cin >> x >> n;
rep (i, n) {
int tmp;
cin >> tmp;
p.push_back(tmp);
}
if(find(p.begin(), p.end(), x) == p.end()) {
cout << x << e... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e10;
int mx[9]={-1,0,1,-1,0,1,-1,0,1};
int my[9]={-1,-1,-1,0,0,0,1,1,1};
signed main(){
int ... | 0 | 7,787,019 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a,b,c;
cin>>a>>b>>c;
ll ans=a+b+c;
ans-=max({a,b,c});
cout <<ans;
return 0;
} | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b... | 0 | 26,375,038 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
template<cl... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using P = pai... | 0 | 15,094,814 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,a=0,b=0,ans=0;
cin >> N;
vector<long long int> sum(N);
for(int i=0;i<N;i++){
long long int a,b;
cin >> a >> b;
ans -= b;
sum[i] = a+b;
}
sort(sum.begin(),sum.end());
for(int i=N-1;0<=i;i... | #include <iostream>
#include <vector>
using namespace std;
string getResult(vector<string> &strs, const int strCount, const int strLen){
for(int i = 0; i < strCount - 1; i++){
for(int j = strCount - 1; j > i; j--){
for(int k = 0; k < strLen; k++){
if(strs[i][k] < strs[j][k]){
break;
... | 0 | 423,487 |
#include <iostream>
#include <iomanip>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for(ll i=init;i<(n);i++)
int main() {
int h, w;
cin >> h >> w;
char c[h][w];
repi(i, h, 0) {
repi(j, w, 0) {
cin >>... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
vi C, X;
vvi A;
int n,m,x;
int findMinCost(int index)
{
bool flag = true;
rep(i, 0, m... | 0 | 90,219,684 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int X, N;
cin >> X >> N;
vector<int> ng(N);
rep (i, N) {
cin >> ng.at(i);
}
vector<int> ok(100 - N + 2);
int tmpIndex = 1;
ok.at(0) = 0;
rep (i, 100) {
bool... | 0 | 62,373,716 |
#include<iostream>
#include<string>
using namespace std;
int ChangeFromStringToInt(string);
string ChangeFromIntToString(int);
void Atoi(int&, string&, int, char);
int main(){
int i, n, a, b;
string s, t, ans;
cin >> n;
for(i=0; i<n; ++i){
cin >> s >> t;
a = ChangeFromStringToInt(s);
b = ChangeFromS... | #include<bits/stdc++.h>
#define SETPERCISION cout << fixed << setprecision(7)
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
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 ... | 0 | 34,268,820 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 8,955,619 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1e9;
const int MOD = 1e9+7;
int main() {
ios::syn... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,h;
cin>>n>>h;
int a[n],b[n];
int normal=0;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
normal=max(normal,a[i]);
}
sort(b,b+n,greater<int>());
int x=0;
while(x<n && b[x]>normal && h>0){
h-=b[x];
... | 0 | 24,656,519 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> ans(n);
for (int j = 0; j < n; j++) {
ans.at(a.at(j) - 1) = j + 1;
}
for (auto k : ans) {
cout << k << " "... | 0 | 64,009,837 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N;
cin >> N;
if (N < 1200) {
cout << "ABC";
} else if (N < 2800) {
cout << "ARC";
} else {
cout << "AGC";
}
c... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | 0 | 80,189,904 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 69,835,924 |
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
int main(){
int e;
stack<int> S;
while(cin >> e){
if(e > 0){
S.push(e);
continue;
}
cout << S.top() << endl;
S.pop();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
f... | 0 | 16,392,700 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int K;
cin >> K;
priority_queue<P, vector<P>, greater<P>> que;
vector<int> min_cost(K, -1);
for(int i=1;i<10;i++) {
que.emplace(i, i % K);
min_cost[i % K] = i;
}
while(!que.empty()) {
auto p = que.top(... | 0 | 61,733,191 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int m[10];
for(int i=0; i<10; ++i)
scanf(" %d", &m[i]);
sort(m, m+10, greater<int>());
for(int i=0; i<3; ++i)
printf("%d\n", m[i]);
return 0;
} | #include <iostream>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
int len = S.length();
int Tindex;
int i, index;
bool flag = false;
for(i = 0; i < len; i++){
if(flag == 1)
break;
if(T[i] == S[0]){
for(index = 1; index < len; index++){
if(i + index >= len)
Tindex = i + index - l... | 0 | 86,672,070 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
for(int i = 1; i*i+i < N; i++) {
if((N-i)%i == 0) {
ans+=(N-i)/i;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, y;
cin >> n >> y;
int a = -1, b = -1, c = -1;
for(int i=0; i<=n; i++) {
for (int j=0; i+j<=n; j++) {
int k = n - i - j;
int total = 10000 * i + 5000 * j + 1000 * k;
if (total == y) {
... | 0 | 90,361,335 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> nums;
int n;
while( cin >> n, n ){
nums.clear();
nums.resize(n);
for( int i=0; i<n; i++ )
cin >> nums[i];
int max=-50000000;
for( int i=0; i<n; i++ ){
int sum=0;
for( int j=i; j<n; j++ ){
sum += nums[j];
if( m... | #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 all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
void solve() {
int n, d, a;
cin >> n >>... | 0 | 32,988,396 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
long long b;
long long c;
cin >> a >> b >> c;
long long sum = (b + c);
if (sum > a) {
cout << (sum - a) << endl;
}
else {
cout << "0" << endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define p... | 0 | 91,181,159 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int N = S.length();
if (N < 4){
cout << "No" << endl;
}
else if (S.substr(0, 4) == "YAKI"){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<vector>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<map>
#define INF 0xFFFFFF
#define ull unsigned long long
#define ll long long
#define ms(x,a) memset(x,a,sizeof(x))
#define endl "\n"
#define M(a,b) (a+b)/2
#define L(x) 2*x
#define R(x) 2*x+1
using namespace std;
ty... | 0 | 23,241,694 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <stdlib.h>
using namespace std;
int main(void){
while(1) {
int N, M, P, div, num = 0, ans;
cin >> N >> M >> P;
if( N == 0 && M == 0 && P == 0) break;
for(int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
num += tmp;
if(... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, x;
while ((cin >> n >> x), !(n == 0 && x == 0)) {
int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
if (x - i - j > j && x - i - j <= n) {
++ans;
... | 0 | 28,162,241 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str, replaced_string, command, sub_string;
int input_length, a, b;
cin >> str;
cin >> input_length;
for (int i = 0; i < input_length; ++i)
{
cin >> command >> a >> b;
if (command == "replace")
... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for(in... | 0 | 12,978,300 |
#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(){
string s;
cin >> s;
int n = s.size();
int ca=0,cb=0;
rep(i,n){
char c = s.at(i);
if(c == '0'){
if(i%2==0) ca++;
else cb++;
... | #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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 92,941,762 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
string S, T; cin >> S >> T;
string ans = "Yes";
int k = 0;
while (S != T)... | 0 | 22,497,032 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
ll N, M;
cin >> N >> M;
if(N == 1 && M == 1) cout << 1 << endl;
if(N == 1 && M >= 2) cout << M - 2 << endl;
if(M == 1 && N >= 2) cout << N - 2 << endl;
if(N >= 2 ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
V<V<int> > g;
V<ll> ans;
void dfs(int v, int i = -1) {
for(auto next_v : g[v]){
if(next_v == i) continue;
ans[next_v] += ans[v];
dfs(next_v, v);
}
}
int m... | 0 | 68,889,088 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long k,a,b;
cin >> k >> a >> b;
cout << max(k+1,((k-a+1)/2)*(b-a)+a+(k-a+1)%2) << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
void solve() {
ll n, k;
cin >> n >> k;
vector <pair <int, int>> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
ll cur = 0;
for(int i = 0; i < n; i++) {
cur += v[i].se... | 0 | 19,905,502 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int w;
cin >> w;
string ans = "";
for (int i = 0; i < s.size(); ++i) {
if (i % w == 0)
ans.push_back(s[i]);
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100000;
std::vector<int>... | 0 | 19,159,775 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> C(N);
rep(i, N) {
cin >> A[i] >> B[i];
C[i] = make_pair(- A[i] - B[i], A[i]);
}
sort(C.b... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 17,727,937 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | 0 | 72,511,145 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) V.begin(),V.end()
vector<int> G[100010];
short arr[100010];
ll cnt;
bool dfs(int c, int p, short v) {
bool jd = 0;
for (int i : G[c]) {
if (i == p)continue;
if (arr[i] == 3 - v) {
jd = 1;
continue;
}
if (arr[i] == v) {
... | #include <iostream>
#include <algorithm>
using i64 = long long;
const int N = 100000 + 7;
int n;
int s[N], e[N];
i64 d[N], t;
int u[N], v[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%lld", d + i), e[i] = i, s[i] = 1;
std::sort(e + 1, e + n + 1, [](int a, int b) {
return d[a] < d[b];
})... | 0 | 68,176,994 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int h, n;
cin >> h >> n;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
ll sum = accumulate(a, a+n, 0);
if (sum >= h) cout << "Yes\n";
else cout << "No\n";
return (0);
} | #include <iostream>
using namespace std;
int main() {
int a,b,c,d,count;
count = 0;
int num[100];
int max;
int n;
for (int v=0;v<100;v++) {
num[v] = 100;
cin >> num[v];
if (!(0<=num[v]&&num[v]<=50)){
max = v-1;
break;
}
}
for (i... | 0 | 22,879,934 |
#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 <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 5,275,977 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #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;
cin >> n;
vector<P> a;
... | 0 | 36,473,141 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string o, b;
cin >> o >> b;
int n = min(o.size(), b.size());
repi(i, ... | #include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N, M;
int S[11][11] = {0};
int C[11] = {0};
std::cin >> N >> M;
for (int i = 0; i < M; i++) {
std::cin >> C[i];
for (int j = 0; j < C[i]; j++) {
int s;
std::cin >> s;
S[i][j] = (s - 1);
}
... | 0 | 12,122,982 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string S, T[1000], U; int sum, maxn; int k, p[1000];
int main() {
getline(cin, S);
S += ' ';
for (int i = 0; i <= S.size(); i++) {
if (S[i] == ' ') {
if (maxn < T[sum].size()) {
maxn = T[sum].size(); U = T[sum];
}
sum++;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 47,562,331 |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll a[n];
ll sum[n + 1];
for(int i = 0; i < n; i++){
cin >> a[i];
sum[i] = 0;
}
sum[n] = 0;
for(int i = 0; i < n; i++){
sum[i + 1] = sum[i] + a[i];
}
sort(sum, s... | 0 | 36,303,335 |
#include <stdio.h>
#include <iostream>
#include <vector>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define vecll vector<ll>
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
bool f(ll n){
ll sum=0,cnt=0,p=n*(n+1)/2;
vecll a(n);
rep(i,n) sum+=a[i]=in();
if(sum%p!=0)return fal... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 79,445,806 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=1e5+9;
int main()
{
FASTINOUT;
int x,k;
cin>>x>>k;
cout<<x-k+1;
return 0;
} | #include <cstdio>
#include <algorithm>
#include <limits.h>
#define INF INT_MAX/100
#define FOR(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(void){
int n,x,y,z,ans,tmp=0,nodes=0,sum=INF;
int graph[50][50];
char str[100];
while(1){
fgets(str,sizeof(str),stdin);
sscanf(str,"%d",&n);
if(n==0)... | 0 | 33,598,076 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,string>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=99999999999999999;
int main(){
ll ans=-INF;
ll N;
cin >> N;
ll M;
cin >> M;
vector<ll> A(N+1,0);
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
string str;
cin>>str;
vector<int> ans(3, 0);
ans[0] = str[0]=='R';
for(int i = 1; i <... | 0 | 46,882,836 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::ma... | #include <bits/stdc++.h>
using namespace std;
const string YES = "YES";
const string NO = "NO";
int main(){
vector<string> inp(2);
for(long long i = 0; i < 2; i++){
cin >> inp[i];
}
for(long long i = 0; i < 2; i++) {
for(long long j = 0; j < 3; j++) {
if(inp[i][j] != inp[1-i][2-j]) g... | 0 | 21,722,483 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int main(void){
int a,b;
cin >> a >> b;
int dai = max(a,b);
if(dai * 2 <= 16){
... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 94,374,195 |
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int n, a[5010], sum[5010], res;
while (true) {
cin >> n;
if (n == 0) break;
rep (i, n) cin >> a[i];
sum[0] = 0;
rep (i, n) sum[i + 1] = a[i] + sum[i];
res = -1000000000;
rep (i, n) rep... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | 0 | 94,885,809 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 0 | 77,179,495 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include<iostream>
#include<cstdlib>
using namespace std;
int main()
{
long long N;
long long Sum_t[200000]={0};
cin>>N;
cin>>Sum_t[0];
for(int i=1;i<N;i++)
{
cin>>Sum_t[i];
Sum_t[i]=Sum_t[i-1]+Sum_t[i];
}
long long min=abs(Sum_t[N-1]-2*... | 0 | 26,871,399 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
int y,m,d;
int day[1024][12];
int sum = 0;
void solve(){
cin >> y >> m >> d;
int count = 0;
for(int i=1;i<y;i++){
for(int j=1;j<=10;j++){
count += day[i][j];
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k,a,b,c;
cin>>k>>a>>b;
c=1;
if(a>=b){
cout<<k+1<<endl;
}
else {
if(k<a+1){
cout<<k+1<<endl;
}
else if(b-a==1){
cout<<k+1<<endl;
}
else{
if(k>=a-c+2){
k-=(a-c+2);
c=b;
}... | 0 | 42,494,872 |
#include <iostream>
using namespace std;
int main() {
int n, s;
int i;
int max, min;
int sum;
int avg;
while(cin >> n, n != 0) {
sum = max = 0;
min = 11111;
for(i=0;i<n;i++) {
cin >> s;
max = (s > max)?s:max;
min = (s < min)?s:min;
sum += s;
}
avg = (sum-max-min)/(n-2);
cout << avg << end... | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | 0 | 16,194,244 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
long long cnt = 0;
while (true) {
long long s = 0;
for (int i = 0; i < n; i++) {
s += a.at(i) / n;
}... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 98,316,325 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef pair<long long int, long long int> ... | 0 | 97,176,795 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int calc(int y, int m, int d) {
int dy = y - 1, dm = m - 1;
int sum = 0;
sum += (dy - dy / 3) * (39 * 5) + (dy / 3) * (10 * 20);
sum += (y % 3) ? (dm / 2 * 39 + (dm % 2) * 20) : (dm * 20);
sum += d - 1;
return sum;
}
int... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 24,876,590 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t H,W;
cin >> H >> W;
if (W==1 || H ==1){
cout << 1 << endl;
}
else if (H%2==1 && W%2==1){
cout << W*(H/2)+W/2+1 << endl;
}
else {
cout << H*W/2 << endl;
}
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define modd 998244353
#define inf 1e18
#define ff first
#define ss second... | 0 | 97,933,263 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_boun... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 56,143,287 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#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;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define s... | 0 | 47,905,890 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b + (a % b > 0);
}
int main()
{
ll w, h;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> A(3, vector<int>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> b.at(i);
}
vector<vector<... | 0 | 73,328,285 |
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
unordered_map<string, int> table;
int main() {
string word, frequent, longest;
size_t N = 0;
while (cin >> word) {
table[word] += 1;
if (table[word] > N) {
N = table[word];
frequent = word;
}
if (word.... | #include<cstdio>
#include<utility>
#include<queue>
using namespace std;
const static int MAX_H = 1010, MAX_W = 1010;
static char maze[MAX_H][MAX_W];
static int state[MAX_H][MAX_W];
static int H, W;
static int dx[4] = { 0,1,0,-1 };
static int dy[4] = { -1,0,1,0 };
typedef pair<int, int > point;
int bfs(point start,point... | 0 | 54,818,592 |
#include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<pair<ll, ll>>())
#define ll long long
#define rep(i, s, g) for (ll i = (s); i < (g); i++)
#define MOD 1000000007
#define vfind(v, target) find(v.begin(), v.end(), target)
#define notFound(v, target) (vf... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int ma = 1000000;
cin >> n;
vector<int>dp(n+1,ma);
dp[n] = 0;
for(int i = n;i>0; i--){
dp[i-1] = min(dp[i]+1, dp[i-1]);
for(int j=1;j<7;j++){
if(i-pow(6,j)>=0)
{
dp[i-pow(6,j)... | 0 | 32,613,162 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int sum = 0;
for(int i = 1; i <= n; i++){
sum += i;
if(sum >= n){
for(int j = 1; j <= i; j++){
if(j != sum - n) cout << j << endl;
}
return 0;
}
}
... | 0 | 25,354,066 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
int main() {
int x, n;
int i, j;
int buf;
cin >> x >> n;
int a[201] = { 0 };
int ans;
rep(i, n) {
cin >> buf;
a[buf]++;
}
for (i = 0; i <= 100; i++) {
if (x - i >= 0) {
if (a[x - i] == 0) {
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 89,020,967 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include<bits/stdc++.h>
using namespace std;
const int N=8005,low=8000;
char s[N];
int x,y,n;
bitset<N*2>bx,by;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
scanf("%d%d",&x,&y);
bx[0+low]=1;by[0+low]=1;
bool flag=true;
int t=0,st=0;
for(int i=1;i<=n;i++)
if(s[i]=='F') t++;
else
... | 0 | 52,687,101 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #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 REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 72,334,701 |
#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 a;
long double b;
cin >> a >> b;
b*=100;
b+=0.00001;
int c=b;
ll ans=a*c;
cout << ans/100;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
deque<ll> deq;
int reverse = 0;
rep(i,n) {
ll a;
cin >> a;
if(reverse) deq.push_front(a);
else deq.push_back(a);
... | 0 | 91,659,324 |
#include<iostream>
#include<vector>
using namespace std;
const int INF = 12000001;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
int a[12][12];
for(int i=0;i<n;i++){
cin >> c[i];
for(int j=0;j<m;j++){
cin >> a[i][j];
}
}
int ans = INF;
for(int i=0;i<(1<<n);i++){
int ... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true... | 0 | 80,137,409 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
string tmp,ans="";
vector<string> vec;
int N,L;
cin>>N>>L;
for(int i=0;i<N;i++){
cin>>tmp;
vec.push_back(tmp);
}
sort(vec.begin(),vec.end());
for(int i=0;i<vec.size();i++){
ans+=vec[i];
}
cout<... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 65,583,217 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i != static_... | #include <bits/stdc++.h>
using namespace std;
std::vector<int> v;
int main() {
int N;
cin >> N;
for(int i=0;i<2*N;i+=1){
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(),v.end());
int a = floor(N/2);
int ans = 0;
for(int i=0;i<(N*2);i+=2){
ans+=v[i];
}
cout << ans;
return 0;
} | 0 | 46,633,896 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include <bits/stdc++.h>
typedef long long ll;
ll n, x;
ll GetAns(ll a, ll b) {
if(a < b) std::swap(a, b);
return a % b ? GetAns(b, a % b) + 2 * (a / b) * b : 2 * (a / b) * b - b;
}
int main() {
scanf("%lld%lld", &n, &x);
printf("%lld", GetAns(x, n - x) + n);
return 0;
} | 0 | 50,193,560 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 51,836,333 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
char s[200010];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>s;
int len=strlen(s);
int sum=0;
for(int i=0;i<len;i++) sum+=s[i]-'0';
if(sum%9==0){
cout<<"Yes";
}
else{
cout<<"No";
}
} | #include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int m, f, r;
while(cin>>m>>f>>r) {
if(m==-1 && f==-1 && r==-1) break;
if(m==-1 || f==-1) cout<<"F\n";
else if(m+f>=80) cout<<"A\n";
else if(m+f>=65) cout<<"B\n";
else if... | 0 | 85,514,097 |
#include <iostream>
using namespace std;
int main()
{
string s,p;
cin>>s>>p;
s+=s;
cout<<(s.find(p)==-1?"No\n":"Yes\n");
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(),v.end())
#define sor(v) sort(v.begin(),v.end())
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#def... | 0 | 5,933,298 |
#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()
{
char c;
cin >> c;
c++;
cout << c;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 | 73,865,912 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.