code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
#define MAX 45
int fib[45];
void make_fib(){
fib[0] = 1;
fib[1] = 1;
for (int i=2;i<MAX;i++) {
fib[i] = fib[i-1] + fib[i-2];
}
}
int main() {
int n;
cin >> n;
make_fib();
cout << fib[n] << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 76,198,448 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> hi(n);
for (int i = 0; i < n; i++) cin >> hi.at(i);
int ans = 0;
int h = hi.at(0);
for (int i = 0; i < n; i++) {
if (h <= hi.at(i)) ans++;
h = max(h, hi.at(i));
}
cout << ans << endl;
} | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 89,579,505 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <typeinfo>
#include <cstring>
#include <iostream>
#define MAX 2000001
#define VMAX 10000
using namespace std;
int main(){
unsigned short *A,*B;
int C[VMAX + 1];
int n,i,j;
cin >> n;
A = static_cast<unsigned short*>(malloc(sizeof(short... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned i... | 0 | 75,559,496 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | #include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int INF = 1000000007;
int dp[30][200000];
int main(){
int n,m;
int c[30];
cin >> n >> m;
rep(i,m){
cin >> c[i] ;
}
rep(j,30){
rep(i,200000){
dp[j][i] = INF;
}
}
rep(j,30){
dp[j][0] = 0;
}
... | 0 | 29,625,952 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
const int INF = 1000010;
int MCMP(int N, int R[], int C[]) {
int dp[N][N];
rep(i, N) rep(j, N) {
if (i==j) dp[i][j] = 0;
else dp[i][j] = INF;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cmath>
const int MaxN = 1e6;
using namespace std;
int pre[2 * MaxN + 5] , last[MaxN + 5] , other[MaxN + 5];
int all , n , res[MaxN + 5];
void Build(int u , int v){
pre[++all] = last[u];
last[u] = all;
other[all] = v;
}
void dfs(int ... | 0 | 92,530,479 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<ll, int> d[n];
rep(i, n) cin >> d[i].first >> d[i].second;
sort(d, d + n);
ll ans = 0, cnt = 0;
rep(i, n) {
if (cnt + d[i].seco... | #include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace... | 0 | 80,951,789 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define whatis(x) cout << #x << " is " << x<<" ";
#define whatisl(x) cout << #x << " is " << x<<"\n";
#define parr(array,end)for(ll loop=0;loop<end;loop++)cout<<array[loop]<<" ";cout<<"\n";
#define lline cout<<"\n";
#define e... | #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 | 17,696,324 |
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const int mod = 1000000007;
ll cnt = 0;
int main(){
int n; cin >> n;
vector<ll>a(n),b(n);
for(int i=0;i<n;i++){
cin >> a.at(i) >> b.at(i);
}
for(int i=n-1;i>=0;i--){
a[i... | 0 | 23,492,799 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long n, a, res, t;
while (cin >> n, n){
res = -100000000;
t = 0;
for(int i = 0; i < n; i++){
cin >> a;
t = max(t + a, a);
res = max(res, t);
}
cout << res << endl;
}
} | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
long long int mod(long long int a,long long int b){
a=a%1000000007;
b=b%1000000007;
return (a*b)%1000000007;
... | 0 | 60,916,514 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long x,a,b;cin>>x>>a>>b;
cout<< (b<=a?"delicious":(b<=a+x?"safe":"dangerous"))<<endl;
} | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vecto... | 0 | 48,678,647 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
template<class T>bool chmax(T &a, const T &b) { return (a<=b... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | 0 | 38,355,415 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,b;cin>>a>>b;
int A,B;
vector<int>power={2,3,4,5,... | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int main(void)
{
int h, w;
cin >> h;
cin >> w;
char *initmap = (char*) malloc(h * w);
int *changennum = (int*) malloc(h * w * sizeof(int));
{
string s;
getline(cin,s);
for(int r = 0; r ... | 0 | 38,109,602 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int total = 0, freq[105] = {0};
for(int i = 1; i <= n; i++){
int val;
cin >> val;
freq[val]++;
}
for(int i = 1; i <= 100; i++){
total += (i * freq[i]);
}
int ans1 = total / n, res1... | #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 ... | 0 | 79,856,733 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_s... | #include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define log(x,b) (log(b)/log(x))
#define rep(i,x,y) for(int i=(x);i<(y);i++)
using namespace std;
const int mod=1e9;
int32_t main()
{
int n,m;
cin>>n>>m;
int x[50],y[50],a[50],b[50],res[50]={0};
for(int i=1;i<=n;i+... | 0 | 93,753,829 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
bool flag[10] = {false};
rep(i, 4) {
int a;
cin >> a;
flag[a] = true;
}
if (flag[1] && flag[9] && flag[7] && flag[4])
cout <<... | #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... | 0 | 49,235,437 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
char next;
set<string> SE;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
if (SE.count(S)) return cout << "No" << "\n", 0;
if (i && S.front() != next) return cout << "No" << "\n", 0;
SE.insert(S);
next = S.b... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#inclu... | 0 | 35,970,355 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
if(b==0){
return a;
}
return gcd(b,a%b);
}
int main(){
ll n,x;cin >> n >> x;
if(n==x*2){
cout << x*3 << endl;
}
else{
cout << (n-gcd(n,x))*3 << endl;
}
} | #include <stdio.h>
int main(int argc, char *argv[])
{
int t;
scanf("%d",&t);
int a[100000];
int count[100005]={0};
for(int i=0;i<t;i++){
scanf("%d",&a[i]);
if(a[i]==0){
count[a[i]]++;
count[a[i]+1]++;
}
else{
count[a[i]]++;
count[a[i]-1]++;
count[a[i]+1]++;
}
}
int max=count[0];
for(int... | 0 | 49,422,595 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,j,n) for(int i = j; i < n; i++)
#define mreps(i,j,n) for(int i = j; i <= n... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 76,824,924 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef std::string str;
#define sei set<int>
#define sell set<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pai pair<int,int>
#define vi vector<long long int>
#define vb vector<bool>
#define vm vector<vector<int> >
#define vd vector<double>
#define vs vector<string>
#define vp vector< pair <string,int> >
#de... | 0 | 77,636,231 |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
const double PI=3.14159265358979323846;
const ull ULL_MAX = 1.8446744e+19;
using namespace std;
int main() {
int x, a;
cin >> x >... | #include <bits/stdc++.h>
#define N 100005
#define ll long long
#define For(i,x,y) for(int i=(x);i<=(y);++i)
#define Rof(i,x,y) for(int i=(x);i>=(y);--i)
#define Edge(x) for(int i=head[x];i;i=e[i].nxt)
#define mset(x,y) memset(x,y,sizeof(x))
#define strL strlen
#define p_b push_back
#... | 0 | 51,370,531 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if(a>=k)
{
cout<<k<<"\n";
}
else
if((a+b)>=k)
{
cout<<a<<"\n";
}
else
{
cout<<(a-(k-(a+b)))<<"\n";
}
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
bool check(string A){
int a[26];
REP(i,26){
a[i]=0;
}
REP(i,... | 0 | 31,032,399 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main() {
int N ;
ll ans = 0 ;
cin >> N ;
vector<ll> A(N) ;
map<ll,ll> mp ;
rep(i,N) cin >> A.at(i) ;
vector<ll> S(N+1) ;
S.at(0) = 0 ;
mp[S.at(0)]++ ;
rep(i,N){
S.at(i+1) = S.... | #include <bits/stdc++.h>
using namespace std;
int N, C[500], S[500], F[500];
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++) scanf("%d%d%d", &C[i], &S[i], &F[i]);
for (int i = 0; i < N; i++) {
int t = 0;
for (int j = i; j < N - 1; j++) {
if (t < S[j])
... | 0 | 30,379,608 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<int,int>Mp;
for(int i = 0; i < 6; i++) {
int a;cin >> a;
Mp[a]++;
}
int X = 0,Y = 0;
for(pair<int,int> x:Mp) {
if(x.second == 1) {
X++;
}
else {
Y++;
}
}
if(X == 2 && Y == 2) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,add=1,ans=0,now=0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if(S[0]=='0'){
zero = true;
}else{
zero = false;
}
for(int i=1;i<N;i++){
if(zero){
if(S[i]=='0')... | 0 | 29,886,408 |
#include <iostream>
#include<bits/stdc++.h>
#include<vector>
#include<string>
#define ll long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define s second
#define pb(x) push_back(x)
#define f first
using namespace std;
int main(){
ios::sync_with_... | #include<iostream>
#include<vector>
using namespace std;
void input(vector<int> &A){
int n =0;
cin >> n;
A.resize(n);
for(int i=0; i<n ; i++){
cin >> A[i];
}
}
void output(vector<int> &out){
int size = out.size();
for(int i=0; i<size ; i++){
cout << out[i];
if(i< size-1){
cout << " ";
}
}
co... | 0 | 68,061,475 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #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 x,n; cin>>x>>n;
int p[n];
rep(i,n) cin>>p[i];
bool n... | 0 | 5,210,622 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll w, h;
cin >> w >> h;
vector<ll> p(w), q(h);
for(auto &e: p) cin >> e;
for(auto &e: q) cin >> e;
vector<pair<ll,ll>> es;
for(auto &e: p) es.push_back({e, 0});
for(auto &e: q) es.p... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.t... | 0 | 55,765,081 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0); ios_base::sync_with_stdio(0);
string s;
cin >> s;
int maxx=0,strk=0;
for(int i=0;i<3;i++){
if(s[i]=='R'){
strk++;
maxx = max(maxx,strk);
}
else strk=0;
}
cout << maxx;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 0 | 6,333,064 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c,k,t;
cin>>n>>c>>k;
std::deque<long long int> deq;
for (int i=0;i<n;i++) {
cin>>t;
deq.emplace_back(t);
}
sort(deq.begin(),deq.end());
const long long INF=1LL<<60;
long long int limit=INF;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 41,704,009 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin... | 0 | 10,973,898 |
#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 <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> pos(N + 1);
rep(i, N) {
int p;
cin >> p;
pos.at(p) = i + 1;
}
multiset<int> ms;
rep(i, 2) {
ms.insert(0);
... | 0 | 69,494,527 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h,w;
string data;
cin>>h>>w;
while(getline(cin,data)){
cout<<data<<endl;
cout<<data<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a[m];
int sum=0;
for(int i=0;i<m;i++)
{
cin>>a[i];
sum+=a[i];
}
if(sum>n)
cout<<-1<<endl;
else if(sum==n)
cout<<0<<endl;
else
cout<<n-sum<<endl;
exit(0);
... | 0 | 89,338,816 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, K;
cin >> N >> K;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
sort(list.begin(), list.end());
reverse(list.be... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 100005
int n, p, a[N];
ll m, v;
bool cmp(int x, int y)
{
return x > y;
}
bool check(int x)
{
if(x <= p) return 1;
if(a[x] + m < a[p]) return 0;
int rv = v - (p - 1) - (n - x + 1);
if(rv < 0) return 1;
ll rs = 1ll * rv * m;
for(int i = p... | 0 | 39,884,464 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
int main()
{
ft
int t,i,j,n,m,... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 68,710,657 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
}
int n;
cin>>n;
ll ans = 0;
for(int i = 1; i<= n;... | 0 | 75,304,915 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int cnt = 0;
vector<vector<ll>> vac;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin>>N;
vac.resize(N);
for(int i=0;i<N;i++){
vac[i].resize(3);
}
for(int i=0;i<N;i++){
for(int j=0;j<3;j++... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
int cnt=0;
int ts, flg;
rep(i, 1000){
flg=0;
rep(j, n){
ts = s[j]-'0';
if((flg==0 && ts == i/100 %10) ||
... | 0 | 14,071,780 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
char a[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin >> a[i][j];
}
}
int dp[n][m];
dp[0][0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> ta... | 0 | 60,715,408 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
if (m == n){
for (int i=0;i<n-1;i++) printf("%d ",s);
printf("%d\n",s);
}
else{
int temp;
if (s == 10... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 44,889,871 |
#include <cstdio>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
const int MAX = 10000;
vector<int> G[MAX];
vector<int> ans;
bool visited[MAX];
void dfs(int u) {
visited[u] = true;
for (int i = 0; i < G[u].size(); ++i) {
int next = G[u][i];
if (visited[next] == false) {
dfs(next... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 74,434,302 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using PL = pair<ll,ll>;
int main()
{
string s; ll t; cin >> s >> t;
for(auto &i : s) i -= '0';
ll n = s.size();
vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(120, vector<ll>(2)));
dp[0][0][0] = 1;
for(ll i = 0; i <... | #include<bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define printd(x) printf("%.12f\n", ans);
#define print(x) cout << (x) << endl;
#define Yes() cout << "Yes" << endl;
#define No() cout << "No" << endl;
#define YES() cout << "YES" << endl;
#define NO() cout << "NO" << endl;
#define printa(x, n... | 0 | 95,985,694 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <cmath>
#include <functional>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main(){
int tmp, i = 1;
cin >> tmp;
while (tmp != 0){
cout << "Case " << i << ": " << tmp << endl;
i++;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long doubl... | 0 | 4,216,986 |
#include <iostream>
using namespace std;
int main(void){
int n;
int debt=100000;
cin >> n;
for(int i=0;i<n;i++){
debt *= 1.05;
if( ( debt % 1000 ) != 0 ){
debt -= ( debt % 1000 );
debt += 1000;
}
}
cout << debt << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 75,630,145 |
#include <stdio.h>
int f(int);
int main()
{
int d,total;
while(scanf("%d",&d) != EOF){
total = 0;
for(int i = 1; d*i < 600; i++){
total += f(d*i) * d;
}
printf("%d\n",total);
}
return 0;
}
int f(int d){
return (d * d);
} | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | 0 | 37,081,340 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
string S;
int count = 0;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'o') {
count++;
}
}
if (count >= 8) {
cout << "YES" << endl;
} else {
if (count... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 92,997,620 |
#include <iostream>
#include <ctype.h>
#include <vector>
using namespace std;
int main() {
char ch;
int count[26] = {};
while (cin >> ch) {
ch = tolower(ch);
int num = ch - 'a';
count[num]++;
}
cout << "a : " << count[0] << endl;
cout << "b : " << count[1] << endl;
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
bool eq = true... | 0 | 99,631,212 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a;
cin >> n >> a;
cout << n * n - a << "\n";
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod (int)1e9+7
#define MOD 998244353
#define ll long long
#define mp make_pair
#define F first
#define S ... | 0 | 60,926,305 |
#include <iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(void) {
int N;
int K;
int l[50];
cin>>N>>K;
int ans=0;
for(int i=0;i<N;i++){
cin>>l[i];
}
sort(l,l+N,greater<int>());
for(int a=0;a<K;a++){
ans+=l[a];
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#de... | 0 | 14,543,297 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10;
int f[N];
ll dis[N];
void fail() {
puts("No");
exit(0);
}
int find(int k) {
if(f[k] == k) return k;
else {
int fa = find(f[k]);
dis[k] += dis[f[k]];
return f[k] = fa;
}
}
int main() {
int n, m;
scanf("%d... | #include<iostream>
using namespace std;
int main(){
int b,f,r,v,n,i,k,l,m,max[5][4][11]{0};
cin>>n;
for(i=0;i<n;i++){
cin>>b>>f>>r>>v;
if(r>0){
max[b][f][r]=max[b][f][r]+v;
}
}
for(k=1;k<=4;k++){
if(k!=1){
cout<<"####################"<<endl;
... | 0 | 26,195,814 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool c=true;
for(int i=97;i<=122;i++){
c=true;
for(int j=0;s[j]!='\0';j++){
if(char(i)==s[j]){
c=false;
continue;
}
}
if(c==true){
cout<<char(i);
break;
}
}
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 82,126,531 |
#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()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
usin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
string s[300];
char t[300][300];
bool check(){
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(t[i][j] != t[j][i]) return false;
}
}
return true;
}
int main(){
ll ans = 0;
ci... | 0 | 49,561,196 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(in... | #include <stdio.h>
int main() {
int child, candy = 0;
scanf("%d", &child);
for(int i = 0; i < child; i++) {
for(int j = 0; j < i; j++) {
candy += 1;
}
candy++;
}
printf("%d", candy);
return 0;
} | 0 | 56,869,080 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n, k;
cin >> n >> k;
ll cur = 1;
for (int i = 0; i < n; i++) {
if (cur * 2 < cur + k) {
cur *= 2;
} else {
cur += k;
}
}
cout << cur << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
ll N; cin >> N;
... | 0 | 69,190,729 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomani... | #include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
string s;
cin >> s;
stack<char> st;
int cnt = 0;
for (int i = 0; i < s.size(); i++)
{
if(!st.empty() && st.top()!=s[i])
{
st.pop();
cnt += 2;
}
else
... | 0 | 86,161,517 |
#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... | #include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std ;
template<... | 0 | 91,877,914 |
#include<stdio.h>
int main(void)
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a < b && b < c)
{
printf("Yes");
}
else
{
printf("No");
}
putchar('\n');
return 0;
} | #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... | 0 | 65,673,940 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
vector<int>... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<... | 0 | 85,776,178 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
string kekka;
cin >> a >> b >> c;
kekka = toupper(a.at(0));
kekka += toupper(b.at(0));
kekka += toupper(c.at(0));
cout << kekka;
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#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; }
#define N 5e6
const lli mod = 1e9+7;
l... | 0 | 38,331,919 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a=0,b=0,c=0,t=0;
int x;
cin >> a >> b >> c;
for(x=a ; x<=b ; x++){
if(c%x==0){
t++;
}
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];
int Min(int &a,int b){return a = min(a,b);}
int main(){
int n;
cin>>n;
for(int i=0,cnt=0;i<n;i++){
int a,b;
cin>>a>>b;
if(i == 0) A[cnt++] = a;
A[cnt++] = b;
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++)dp[i... | 0 | 7,707,226 |
#include <iostream>
using namespace std;
int C(int n){
return n*(n-1)/2;
}
int main(){
int a,b;
cin >> a >> b;
cout << C(a)+C(b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,K;
cin >> N >>K;
ll sum[N+1] ={};
for(int i=0;i<N;i++){
ll a;
cin >> a;
sum[i+1] = sum[i]+a;
}
vector<ll> candidates;
for(int l=0;l<N;l++)for(int r =l;r<N;r++){
candidates.push... | 0 | 51,778,756 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=200100;
vector<int>v[maxn];
int n;
int dfs(int x,int fa)
{
int ans=0;
for(int i=0;i<v[x].size();i++)
{
int y=v[x][i];
if(y==fa)continue;
ans^=(dfs(y,x)+1);
}
return ans;
}
int main()
{
cin>>n;
for(int i=1;i<n;i++)
{
int x,y;
cin>>x>>y;
v[x]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#def... | 0 | 929,822 |
#include <iostream>
using namespace std;
class LightList
{
private:
const static int INVALID = -1;
int front, back;
int *allocate_array;
public:
LightList(int size) :
front(0), back(0)
{
allocate_array = new int[size];
}
~LightList()
{
delete[] allocate_array;
}
void insert(int x)
{
allocate_array[f... | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | 0 | 15,945,216 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
double l;
cin >> l;
l /= 3;
cout << fixed << setprecision(15);
cout << l * l * l << endl;
return 0;... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<cmath>
#include<stack>
#include<string.h>
#include <iomanip>
#define rep(i,n) for(int i = 0;i<n;i++)
#define _GLIBCXX_DEBUG
using ll = long long; ... | 0 | 31,506,793 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<int > vecint;
typedef vector<string > vecstr;
int mai... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%lld%lld", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, ... | 0 | 23,066,113 |
#include<iostream>
using namespace std;
int main()
{
int p, q;
cin >> p >> q;
cout << (3 * p + q) / 2 << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define... | 0 | 64,914,039 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll N; cin >> N;
string S,T,U; cin >> S >> T;
rep(i,N){
U = U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 10001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const double PI = acos(-1);
typedef pair<int, int> P;
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int lcm(int a,... | 0 | 75,235,421 |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(... | #include <iostream>
using namespace std;
int main() {
for (;;) {
string str;
getline(cin, str);
if (str == "0") break;
int tmp = 0;
for (string::iterator it = str.begin(); it != str.end(); ++it) {
if (0x30 <= *it && *it <= 0x39) {
tmp += int(*it) -... | 0 | 54,309,174 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main(){
int H,W;
cin >> H >> W;
vector<vector<char>> map (H, vector<char>(W));
for (int i=0;i<H;i++) {
for (int j=0;j<W;j++) {
cin >> map.at(i).at(j);
... | #include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
char x; cin>>x;
if('a'<=x && x <='z')
cout<<"a\n";
else if('A'... | 0 | 85,171,119 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector <ll> v(n);
ll sum = 0;
rep(i, n) {
cin >> v.at(i);
sum += v.at(i);
}
ll tmp = 0, res = sum;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
int l,r;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
if(x==1) l=i+1;
}
r=n-l+1;
int ans=0;
if(n==k){
ans =1;
}
else if(l<=k || r<=k){
... | 0 | 43,068,691 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
vector<ll> B(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 91,166,066 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int h,w;
cin>>h>>w;
vector<string> c(h);
rep(i,h)cin>>c[... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
int main()
{
ll n,k;
cin>>n>>k;
ll a[n+1];
ll c[n+1];
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=n;i++)
cin>>c[i];
ll ans=-inf;
for(ll i=1;i<=n;i++)
{
vector<ll>v;
v.push_back(0);
ll sum=c[i];... | 0 | 83,822,343 |
#include <bits/stdc++.h>
using namespace std;
long long x, y;
int main() {
cin >> x >> y;
if (x % y == 0)
return cout << -1, 0;
cout << x;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
bool OK=true;
map<char,int> data;
rep(i,4){
data[S[i]]++;
}
if(data.size()!=2){
OK=false;
}
for(auto p:data){
auto v=p.second;
... | 0 | 24,452,874 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<fstream>
using namespace std;
string s;
int dp[(1<<26)+1];
long long now=0;
int main(){
cin>>s;
memset(dp,63,sizeof(dp));
dp[0]=0;
for(int i=0;i<=s.length()-1;i++){
now^=(1<<(s[i]-'a'));
for(int j=0;j<=25;j++){
if((now^(1<<j))!... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e10
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
int n, w, h;
cin >> w>> h >>n;
... | 0 | 86,435,477 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
long double a,b,x;
cin>>a>>b>>x;
cout<<fixed<<setprecisio... | 0 | 17,416,462 |
#include<bits/stdc++.h>
using namespace std;
int main(void) {
int n,l[1000],r[1000],a[1000],ans=0;
cin >> n;
for(int i=0;i<n;++i) cin >> l[i] >> r[i];
for(int i=0;i<n;++i) {
a[i] = r[i] - l[i] + 1;
ans = ans + a[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N;
cin >> N;
ll sum = 0;
vector<ll> A(N+1);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
A[N] = A[0];
if (sum % (N*(N+1)/2) != 0) {
cout << "NO" << endl;
return ... | 0 | 51,599,096 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
vector<int> edge[N];
int col[N];
int a[3];
int n, m;
bool bp;
void DFS(int u) {
for (int v: edge[u]) {
if (col[v] != -1) {
if ((col[v]^col[u]) != 1) bp = false;
} else {
col[v] = col[u]... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
#define MAXI 1000000
int main() {
string s;
whi... | 0 | 88,441,970 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | #pragma GCC optimize ("-O2")
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define mii ... | 0 | 13,842,622 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>... | #include <bits/stdc++.h>
#define int long long
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (... | 0 | 22,626,551 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
class dlink {
public:
dlink(int k) : prev(NULL), next(NULL), key(k) {}
dlink *prev;
dlink *next;
int key;
};
class list {
public:
list() : head(NULL), tail(NULL) {}
dlink *head;
dlink *tail;
void ins(int k) {
dlin... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n; cin>>n;
long long int a,b,f,min=10000000000;
for(int i=1;i<=n/i;i++){
f=1;
if(n%i==0){
a=i;
b=n/a;
while(b>0){
if(b/10!=0){
f++;
}... | 0 | 60,425,017 |
#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(),... | #include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main() {
string S; cin>>S;
long long counter=0;
long long counter1=0;
long long counter2=0;
long long answer=0;
if(S.at(0)=='<'){
counter++;}
else
counter1++;
for(long long i=1; i<S.size(); i++){
... | 0 | 51,814,848 |
#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<ll> vi;
typedef vector<vector<ll>> vvi;
int main()
{
string s;
cin>>s;
int num = (s[0] - '0') *100 + (s[1]- '0') * 10 + (s[2]-... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
#define int long long
int n;
int a[N];
int ans;
int last[N];
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i)
... | 0 | 32,762,865 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GetLeastCommonMultiple(long long a, long long b) {
long long m = a;
long long n = b;
long long temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return a / n * b;
}
int main() {
ll a, b; cin >> a >> b;
cout << GetLe... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 7,869,871 |
#include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fr first
#define sc second
#define N 300009
#define inf 2e16
#define pi pair<ll,ll>
#define pb push_back
using namespace std;
typedef long long ll;
void slv()
{
}
vector<int>adj[N];
bool vis[N];
int dis[N];
void vfs(int s)... | #include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N;
std::cin >> N;
std::vector<std::vector<int>> A(N, std::vector<int>(2));
for (int i=0; i<N; ++i){
std::cin >> A.at(i).at(0);
A.at(i).at(1) = i + 1;
}
std::sort(A.begin(), A.end());
for (int i=0; ... | 0 | 33,524,162 |
#include <iostream>
#include <queue>
#define ll long long
#define up (ll)1e10
#define MAXN 1000005
using namespace std;
struct node {
ll num, step;
node(){}
node(ll n, ll s) : num(n), step(s){}
};
deque <node> q;
bool vst[MAXN];
ll k;
void slove() {
q.push_front(node(1, 1));
while(!q.empty()) {
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 51,148,045 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int n,k;
cin >> n >> k;
vector<pair<int,int>> sushi(n);
for (int i = 0; i < n; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
sort(sushi.rbegin(),sushi.rend());
... | 0 | 384,668 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... | #include<bits/stdc++.h>
using namespace std;
void min_self(int & a, int b){
if(b<a)
a=b;
}
int main(){
int h,w;
cin >> h >> w;
string grid[h];
for(int i =0;i<h;i++)
cin >> grid[i];
int dp[h][w];
dp[0][0] = 0;
for(int i =0;i<h;i++){
for(int j = 0;j<w;j++){
if(i+j==0)
dp[0][0] = (grid[0][0]=='#');
... | 0 | 33,123,335 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for(ll i = n-1; i >= 0LL; i--)
#define FOR(i, n, m) for(ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define all(v) v.begin(),v.end()
#define inf (int)(3e18)
#define P pair<int,int>
#define mod (int)(1e9+7)
#define mod2 998244353
template<class T> inline void chmin(T &a, T b) {... | 0 | 69,945,137 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int N = 300000, M = 300000, K = 300000;
int xx[K], yy[K];
int kkx[1 + N], kky[1 + M];
map<pair<int, int>, bool> mp;
int qux[N], quy[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m, k; cin >> n >> m >> k;
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N+2);
A[0] = 0;
for (int i = 1; i <= N; i++) cin >> A[i];
A[N+1] = 0;
ll sum = 0;
for... | 0 | 28,724,616 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#define TC(c) printf(... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 26,538,049 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 | 85,880,939 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=111)cout<<111<<endl;
else if(n>111&&n<=222)cout<<222<<endl;
else if(n>222&&n<=333)cout<<333<<endl;
else if(n>333&&n<=444)cout<<444<<endl;
else if(n>444&&n<=555)cout<<555<<endl;
else if(n>555&&n<=666)cout<<666<<endl;
else if(n>666&&n... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 48,672,040 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A+B == C+D) {
cout << "Balanced" << endl;
}
else if (A+B >= C+D) {
cout << "Left" << endl;
}
else {
cout << "Right" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,coun=0;
cin>>n;
ll sum=n+100;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
coun++;
ll x= n/i;
if(i+x<sum)sum=(i+x);
}
}
if(coun==0)
cout<<n-1<<... | 0 | 25,739,519 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const ll INF = 1e18;
const int MAX = 1e6;
int gc... | #include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#d... | 0 | 14,638,924 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 78,198,745 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int H,W;
char S[2100][2100];
cin>>H>>W;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>S[i][j];
}
}
vector<vector<int> > right(H,vector<int>(W,0));
vector<vector<int> > left(H,vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, n) for(int i =0 ; i < n; ++i)
#define Rep(i,a,b) for(i... | 0 | 50,620,682 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
#endif
int n;
cin>>n;
vecto... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,v) VL v(n);rep(i,n)cin>>v[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#d... | 0 | 50,362,969 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | #include <iostream>
#include <vector>
using namespace std;
vector<int> g[100005];
int n, m, h[100005], ans;
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> h[i];
while(m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for(i... | 0 | 73,973,571 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void milkshake() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int x = a[0];
for(int i = 1; i <= n; i++) {
if(x == 2) drop(i);
x = a[x-1];
}
c... | #include <bits/stdc++.h>
using namespace std;
using nagai = long long;
using ll = long long;
const int N = 1e6 + 100;
vector<int> g[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<nagai> d(n);
for (auto& x : d)
cin >> x;
vector<int> ord(n);
iota(ord.be... | 0 | 68,260,025 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<... | #include <bits/stdc++.h>
using namespace std;
int main () {
set<int> s;
for (int i = 0; i < 3; i++) {
int a;
cin >> a;
s.insert(a);
}
if (s.size() == 1) {
puts("Yes");
}
else {
puts("No");
}
} | 0 | 40,822,678 |
#include <iostream>
using namespace std;
int main(){
char c;
cin >> c;
if (c == 'z'){
c = 'a';
}
else c = (int)c + 1;
cout << (char)c << endl;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
const int MAX = 510000;
const int MOD = 10000000... | 0 | 26,669,294 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=50;
int n,a[N+9];
string s[N+9],t;
void into(){
cin>>n;
for (int i=1;i<=n;++i)
cin>>s[i]>>a[i];
cin>>t;
}
int ans;
void Get_ans(){
int flag=0;
for (int i=1;i<=n;++i){
ans+=flag*a[i];
if (s[i]==t) flag=1;
}
}
void work(){
Get... | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--... | 0 | 41,953,388 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(N) for (int i = 0; i < N; i++)
int count_char(string S, char c){
int count = 0;
int pos = S.find(c);
while (pos != string::npos){
count++;
pos = S.find(c, pos + 1);
}
return count;
}
int main(){
stri... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (a + b) % mod;
}
int mul(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return 1ll * a * b % mod;
}
int fp(in... | 0 | 65,754,899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.