code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
#include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
bool kaibun( string s ){
string t =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,u; cin>>s,t=s.substr(0,(s.size()-1)/2),u=s.substr((s.size()+1)/2);
cout<<(t==u?"Yes":"No");
} | 1 | 75,842,809 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string o, e;
cin >> o >> e;
int i = 0;
while (o[i] != NULL) {
cout << o[i];
if (e[i] != NULL) cout << e[i];
i++;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string o,e;
cin >> o >> e;
int a=o.size(),b=e.size();
for(int i=0;i<min(a,b);i++){
cout << o[i] << e[i];
}
if(a>b) cout << o[a-1] << endl;
else cout << endl;
} | 1 | 68,012,730 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> v(200001, 0);
rep(i, 0, n) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n,k,a;
map<int,int>m;
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a;
m[a]++;
}
vector<pair<int,int>>v;
for(auto i=m.begin();i!=m.end();i++)
{
v.push_back(make_pair(i->second,i->first));
}
sort(... | 1 | 5,248,101 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
int A,B,C... | #include<iostream>
using namespace std;
int main()
{
long long int a,b,c;
cin >> a >> b >> c;
c=c-(a-b);
if(c<0)
cout << "0" << endl;
else
cout << c << endl;
return 0;
} | 1 | 62,155,888 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll x,y;
cin>>x>>y;
if(llabs(x-y)<2) printf("Brown\n");
else printf("Alice\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end(... | 1 | 62,701,599 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
while(cin >> n >> k) {
if(n+k == 0) break;
vector<int> seq(n);
for(int i=0;i<n;i++) {
cin >> seq[i];
}
int wa = 0;
for(int i=0;i<k;i++) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
while(cin>>n>>k){
int total[100010]={0},ip[100010]={0};
if(n==0 && k==0)break;
for(int i=0;i<n;i++){
cin>>ip[i];
if(i==k-1){
for(int j=0;j<k;j++){
total[i]+=ip[i-... | 1 | 45,721,085 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int X = max(max(A, B), C);
cout << A + B + C + X * 9 << endl;
} | 1 | 30,622,306 |
#include <stdio.h>
#include <math.h>
long long max_divisor(long long n)
{
long long max_div = 1;
long long max_len = (long long)sqrt(n);
for (int i=max_len; i>=1; i--)
{
if (n % i == 0) return n / i;
}
return 1;
}
int main()
{
long long n; scanf("%lld", &n);
long long max_div = m... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 1000000000000000;
double sqrtNum = sqrt(n);
sqrtNum += 0.5;
int i = 0;
whil... | 1 | 22,438,425 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int t[n], a[n];
for (int i=0; i<n; i++) cin>>t[i];
for (int i=0; i<n; i++) cin>>a[i];
int max_h1[n], min_h1[n];
max_h1[0] = min_h1[0] = t[0];
for (int i=1; i<n; i++) {
if (t[i] == t[i-1]) {
max_h1[i] = max_h1[i-1];
... | #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... | 1 | 32,542,787 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll long long
#define make_pair mkp
#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(v... | #include <iostream>
#include <cstdio>
using namespace std;
long long fib[45];
int main(void) {
fib[0] = fib[1] = 1;
for (int i = 2; i < 45; ++i) {
fib[i] = fib[i - 1] + fib[i - 2];
}
int n;
cin >> n;
printf("%lld\n", fib[n]);
return 0;
} | 1 | 50,361,434 |
#include<stdio.h>
char judg(int, int, int);
int main() {
char gd[BUFSIZ];
int mid, lst, ret;
int num;
int i;
for (i = 0; i < BUFSIZ - 1; i++) {
fflush(stdin);
scanf("%d %d %d", &mid, &lst, &ret);
if (ret == -1 && mid == -1 && lst == -1)break;
gd[i] = judg(mid, lst, ret);
}
gd[i] = '\0';
num = i;
for (i... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, f, r;
for (int i = 0; i < 50 ; i++) {
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1){
break;
}
if(m == -1 || f == -1){
cout << "F" << endl;
continue;
}
if(m+f >= 80){
cout <<... | 1 | 82,624,538 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.... | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
int n;
int tmax;
int a[1000], b[1000], c[1000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i... | 1 | 64,892,822 |
#include <iostream>
#include <string.h>
using namespace std ;
int A,P;
int main(){
cin >> A >> P;
P += A*3;
int pi = P /2;
cout << pi << "\n";
} | #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 a, p;
cin >> a >> p;
p = p + a*3;
int ans;
ans = p/2;
cout << ans << endl;
return 0;
} | 1 | 90,458,408 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long H,W,M;cin>>H>>W>>M;
vector<long>X(W),Y(H);
vector<pair<long,long>>s;
for(long i=0;i<M;i++){
long h,w;cin>>h>>w;
Y[h-1]++;X[w-1]++;
s.push_back(pair<long,long>(h-1,w-1));
}
long x=0;for(long t:X)x=max(x,t);
long y=0;for(long t:Y)y=ma... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 1 | 30,739,794 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#de... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
const int NIL = -1;
const int M =1046527;
const int L = 14;
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
long long getKey(... | 1 | 66,069,899 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f(i,n) for(int i=0;i<n;++i)
typedef vector<int> vi;
vi siz(200001);
vi par(200001);
void initialize(int n){
f(i,n){
par[i]=i;
siz[i]=1;
}
}
int find_set(int v){
if(par[v]==v) return v;
return par[v]=find_set(par[v]);
... | #include <cstdio>
#include <atcoder/dsu>
int main() {
int n, q;
scanf("%d %d", &n, &q);
atcoder::dsu dsu(n);
for (int i = 0; i < q; ++i) {
int t, u, v;
scanf("%d %d %d", &t, &u, &v);
if (t == 0) {
dsu.merge(u, v);
} else if (t == 1) {
printf("%d\n", dsu.same(u, v)? 1: 0);
}
}
} | 1 | 73,388,575 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 1 | 2,761,012 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
int main(){
ios::sync_with... | 1 | 25,658,858 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define priqu... | #include <iostream>
#include <fstream>
#include <utility>
#include <queue>
#include <vector>
#include <array>
#include <stack>
#include <list>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#... | 1 | 28,294,660 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
string s, t;
c... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
string s, t;
... | 1 | 91,140,439 |
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
static vector<int> M(44, 0);
static inline int fibonacci(int n) {
if (n == 0 || n == 1) {
return 1;
}
if (M[n] != 0) {
return M[n];
}
M[n] = fibonacci(n - 2) + fibonacci(n - 1);
return M[n];
}
int main() {
int n;
cin ... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functi... | 1 | 6,641,814 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x,a;
cin>>n>>x;a=x;
ll l1[n+5];
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i==1)x=__gcd(abs(a-l1[i]),abs(a-l1[i]));
else ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 1 | 28,720,861 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=na... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
map<int64_t, int64_t> uniq;
for (int64_t i = 0; i < N; i++) {
int64_t x;
cin >> x;
if (uniq.count(x) == 0) {
uniq[x] = 0;
}
uniq[x]++;
}
vector<int64_t> search;
unordered_set<int64_t> notdiv;
for (a... | 1 | 37,798,861 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000001;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int M,K;
cin >> M >> K;
if(M == 0) {
if(K == 0) {
cout <<... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 1 | 27,369,563 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)cin >> a[i];
vector<ll> sum(n + 1);
for (int i = 0; i < n; i++)sum[i + 1] = sum[i] + a[i];
vector<ll> left_onlyplus_sum(n + 1);
... | #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 < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | 1 | 84,180,092 |
#include <bits/stdc++.h>
#define smax(a, b) ((a) < (b) ? ((a)=(b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a)=(b), true) : false)
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MAX = 1e9 + 7;
int n;
bool visited[... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
#define SSTR(x) static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#de... | 1 | 63,676,974 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
if(s.size()<8){
cout<<"YES"<<endl;
return 0;
}
int win=0;
for(int i=0;i<s.size();i++){
if(s[i]=='o') win++;
}
if(win+(15-s.size())<8){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main() {
string s;
cin >> s;
int cnt=0;
rep(i,s.size()){
if(s[i]=='x') cnt++;
}
if(cnt<=7)
cout << "YES" << endl;
else
cout << "NO" << endl;\
return 0;
} | 1 | 50,093,542 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = *max_elemen... | #include<bits/stdc++.h>
using namespace std;
vector<int>v;
main()
{
int t,p;
scanf("%d",&t);
for(int i = 0;i < t;i++)
{
scanf("%d",&p);
v.push_back(p);
}
sort(v.begin(),v.end());
int mx=0,pos=0;
for(int i = 0;i < t-1;i++)
{
if(mx<min(v[t-1]-v[i],v[i]))
{
... | 1 | 2,241,723 |
#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;
bool check(string str){
int n = str.length();
for(int i = 0; i < n; i++)
if(str[i] != str[n-1-i])
... | #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 ... | 1 | 61,325,651 |
#include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A * B < N || A + B > N + 1) {
cout << -1 << endl;
return 0;
}
vector<ll> ans;
ll num = 0;
for (ll i = 0; i < B; i++) {
ll tmp_num = min(N - num - (B - i -... | #include <cstdio>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 4e5;
int A[N], B[N];
int main(){
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
if(((ll)a*(ll)b<(ll)n) || (a+b>n+1)){
puts("-1");
return 0;
}
int i, j;
for(i=1; i<=n; i++... | 1 | 37,489,913 |
#include <iostream>
using namespace std;
int main() {
char c;
while (cin >> c)
cout << (c == '1' ? 9 : 1);
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 1 | 87,011,448 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | 1 | 90,704,999 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int dx[4] = {-1, 1, ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main (){
int N;
cin >> N;
vector<vector<int>> a(N);
i... | 1 | 75,506,667 |
#include<stdio.h>
using namespace std;
int main(){
int h, w;
int i,j;
while(1){
scanf("%d %d", &h, &w);
if(!h && !w)break;
for(i=0;i<h;i++){
for(j=0;j<w;j++){
if(i==0 || i==h-1 || j==0 || j==w-1){
putchar('#');
}else{
putchar('.');
}
}
putchar('\n');
}
putchar('\n');
}
retu... | #include<stdio.h>
int main(){
int a,b,c,d,x,y;
while(1){
scanf("%d %d",&x,&y);
if(x==0&&y==0)break;
for(c=1;c<=y;c++){
printf("#");
}
printf("\n");
for(b=3;b<=x;b++){
printf("#");
for(a=3;a<=y;a++){
printf(".");
}
printf("#\n");
}
for(d=1;d<=y;d++){
printf("#");... | 1 | 24,520,902 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 65,537,813 |
#include<bits/stdc++.h>
using namespace std;
int flag[1001];
map<int,int>mp;
map<int,int>mp1;
int main()
{
string s,s1;
int c=0;
cin>>s>>s1;
if(s[0]==s1[0])
c++;
if(s[1]==s1[1])
c++;
if(s[2]==s1[2])
c++;
cout<<c<<"\n";
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s, t;
int sm = 0;
cin >> s >> t;
rep(i, 0, 3){
if(s[i] == t[... | 1 | 54,468,596 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll a[N];
for(ll i=0;i<N;i++){
cin >> a[i];
}
ll j = 1;
bool go = false;
for(ll i=0;i<N;i++){
if(a[i]==j){
j++;
go = t... | #include <bits/stdc++.h>
using namespace std;
#define all(arr) arr.begin(), arr.end()
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef uns... | 1 | 100,521,884 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define ... | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL INF=1e18;
const int MAXN=2e5+100;
const double eps=1e-10;
int main()
{
LL k,n=50;
while(scan... | 1 | 11,741,682 |
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef long long llint;
const int MAXL = 11;
int N, sol;
int pwr10[MAXL];
char A[MAXL], B[MAXL], C[MAXL];
void num_to_str(llint x, char C[]) {
for (int i = 0; i < MAXL; ++i) C[i] = 0;
for (int i = 0; x > 0; ++i, x /= 10... | #include <cstdio>
#include <string>
using i64 = long long;
bool ask(i64 n) {
printf("? %lld\n", n);
fflush(stdout);
char res[10];
scanf("%s", res);
return res[0] == 'Y';
}
int main() {
int c = 0, t = 1;
for (; c <= 9; c++) {
if (!ask(t)) break;
t *= 10;
}
if (c == 10) {
i64 t = 10;
whi... | 1 | 75,777,788 |
#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
map<string, int> data;
string mxlen, mst, str;
while(cin >> str){
data[str]++;
if(data[str] > data[mst]){
mst = str;
}
if(str.size() > mxlen.size()){
... | #include <stdio.h>
#include <string.h>
#include <string>
#include <map>
using namespace std;
#define TT 35
map <string, int> S;
int max_len, max_time;
char str[TT], tmp_max_len[TT], tmp_max_time[TT];
void init(){
max_len = 0, max_time = 0;
}
void solve(){
S[str] ++;
if (max_time < S[str]){
strcpy(tmp_max_time, s... | 1 | 16,191,825 |
#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... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 1 | 12,525,560 |
#include <bits/stdc++.h>
#define ull unsigned long long
#define mem 26
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int c=0;
char t[2] = {'1','0'};
for(int i=0;s[i];i++) {
if(s[i]!=t[i&1])
c++;
}
int mc = c;
t[0] = '0';t[1... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int N=S.size();
int count1=0,count2=0;
for(int i=0;i<N;i++){
if(i%2==0 && S.at(i)=='0'){
count1++;
}
else if(i%2==1 && S.at(i)=='1'){
count1++;
}
if(i%2==0 && S.at(i)=='1'){
count2++;
}
e... | 1 | 41,352,826 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
long long K;
cin >> N >> K;
vector<long long> A( N );
for( int i = 0; i < N; i++ ) {
cin >> A[i];
}
const long long MOD = 1000000000 + 7;
long long ans1 = 0;
for( int i = 0; i < N; i++ ) {
for( int j = i + 1; j < N; j++ ) {
if( A[i] > A[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int T[2005]={0};
int main(){
ll n,k;cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>T[i];
}
ll a=0,b=0,ans = 0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
if(T[i]>T[j])a++;
else if(T[i]<T[j])b++;
... | 1 | 86,083,123 |
#include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, res = 100000;
cin >> N;
for (int i = 0; i <= N; i++) {
int A = i, B = 0;
while (A != 0) {
B += A % 9;
A /= 9;
}
A = N - i;
while (A != 0) {
B += A % 6;
A /= 6;
}
res = min(res, B);
}
cout << r... | 1 | 56,617,295 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int s = N.size();
int x;
int ans = 0;
for(int i=0;i<s;i++){
x = N[i] - 48;
ans += x;
}
if(ans % 9 == 0){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string x;
cin >> x;
int sum = 0;
for (int i = 0; i < x.length(); ++i){
sum += x[i]-'0';
}
if(sum%9 == 0){cout << "Yes" << endl;}
else{std::cout << "No" << std::endl;}
return 0;
} | 1 | 85,545,301 |
#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 all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
template<typename T>
void print(T x) {
cout << x << endl;
}
int main(void) {
int n; cin >> n;
string s; cin >> s;
int k; cin >> k; k--;
char x = s[k];
rep(i, s.size()) {
if(s[i]!=x... | 1 | 78,548,837 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
long double x1,y1,x2,y2;
cin >> x1;
cin >> y1;
cin >> x2;
cin >> y2;
cout.precision(4);
cout.setf(ios::fixed);
cout << sqrt(pow(x1-x2, 2.0)+pow(y1-y2, 2.0)) << endl;
return 0;
} | #include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MD 1000000007
char sep[3] = " \n";
int i, j, k, l, m, n;
double PI = acos(-1);
int main() {
doubl... | 1 | 36,488,000 |
#include <iostream>
#include <string.h>
using namespace std;
int char2int(char ch) {
if (ch == 'A') return 1;
if (ch == 'C') return 2;
if (ch == 'G') return 3;
if (ch == 'T') return 4;
return 0;
}
int string2hash(char str[]) {
int length = strlen(str);
int sum = 0;
int phase = 1;
for... | #include <iostream>
#include <set>
using namespace std;
int main()
{
int n = 0;
cin >> n;
string cmd;
string str;
set<string> dict;
while (n--) {
cin >> cmd >> str;
if (cmd == "insert") {
dict.insert(str);
}
else if (cmd == "find") {
set<st... | 1 | 43,316,677 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
int ans = 0;
if(a < b) ans = a;
else ans = b;
if(c < d) ans += c;
else ans += d;
printf("%d\n", ans);
return 0;
} | #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... | 1 | 64,483,597 |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long int
#define ff first
#define ss second
#define u128 __int128
#define pb push_back
#define N 200010
#define MOD 1000000007
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(20);
int n;
cin >> n;
pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define M 1000000007
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
... | 1 | 100,465,525 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n;cin >>n;
int ans=INF;
for (int i = 0; i < 1000; ++i) {
if(i>=n){
ll c=i;
... | #include <iostream>
#include <string>
using namespace std;
bool test(int n){
int pre = n%10;
n /= 10;
while(n != 0){
if(pre != n%10) return false;
n /= 10;
}
return true;
}
int main(){
int n;
cin >> n;
while(1){
if(test(n)){
cout << n << endl;
... | 1 | 7,973,992 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[1000+10];
while(cin >> n && n!=0){
for(int i=0;i<n;i++) cin >> a[i];
sort(a,a+n);
int ans[1000+10];
for(int i=0;i<n-1;i++){
ans[i]=abs(a[i+1]-a[i]);
}
sort(ans,ans+n-1);
cout << ans[0] << endl;
}
return 0;
... | 1 | 13,751,979 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_string_palindorme(void) {
string s;
cin >> s;
int n = s.size();
int n_1 = (n - 1) / 2;
int n_3 = (n + 3) / 2 - 1;
string s_upper = s.substr(0, n_1);
string s_lower = s.substr(... | #include <iostream>
using namespace std;
int main ()
{
string S;
cin >> S;
bool palindrome = true;
if (S.size()%2 != 0)
{
int i = 0, j = S.size()-1;
while (i!=j)
{
palindrome = palindrome && (S[i] == S[j]);
i++;
j--;
}
i = 0... | 1 | 64,850,986 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | 1 | 212,628 |
#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 a,b;
double c;
cin >> a >> b;
c = (a+(b+1))/2;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b;
cin >> a >> b;
if((a+b)%2) cout << (a+b)/2+1 << endl;
else cout << (a+b)/2 << endl;
return 0;
} | 1 | 57,302,792 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[0] <= 'z' && s[0] >= 'a') {
cout << "a" << endl;
} else {
cout << "A" << endl;
}
} | #include <iostream>
using namespace std;
int main(){
char s;
cin>>s;
if(isupper(s)){
cout<<"A"<<endl;
}else{
cout<<"a"<<endl;
}
return 0;
} | 1 | 38,595,547 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n,m,d;
cin>>n>>m>>d;
cout<<fixed<<setprecision(20);
if (d==0) {
cout<<(double)(m-1)/n<<endl;
} else {
cout<<(m-1)*(n-d)*2.0/(double)(n*n)<<endl;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define tri pair<pll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#de... | 1 | 40,927,707 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0; i < (ll)(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
con... | 1 | 8,709,236 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
struct hash_pair{
template <class T1, class T2>
size_t operator()(const pair<T1,T2>& p)const{
auto h1 = hash<T1>{}(p.first);
auto h2 = hash<T2>{}(p.second);
return h1^h2;... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n+3), v(n+2);
for (int i = 2; i <= n+1; i++) cin >> t[i];
for (int i = 1; i <= n; i++) cin >> v[i];
partial_sum(begin(t), end(t), begin(t));
double p = 0, ans = 0;
for (double a = 0; a <= t.back(); a... | 1 | 33,268,816 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
ll n,k;
cin >> n >> k;
vector<ll>h(n);
rep(i,n){
cin >> h[i];
}
sort(h.begin(),h.end());
ll m=0;
rep(i,n-k){
m+=h[i];
}
cout << m << endl;
... | 1 | 77,692,819 |
#include <bits/stdc++.h>
#define pb push_back
#define vt vector
#define ll long long
using namespace std;
const int INF = 1e9 +5;
const ll LLINF = 1e18 +5;
int i4[4] = {1,0,-1,0};
int j4[4] = {0,1,0,-1};
void solve()
{
int a,b;
cin >> a >> b;
cout << (((a*b)&1)? "Odd":"Even") << endl;
}
int main() {
ios::sync_w... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a*b&1?"Odd":"Even");
} | 1 | 48,332,412 |
#include<iostream>
#include<algorithm>
#include<math.h>
typedef long long ll;
using namespace std;
int main(){
ll N, ans; cin >> N;
ans = 0;
if(N%2==0){
for(int j=1; j<=25; j++){
ans += N/10;
N /= 5;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(15);
long long n;
cin>>n;
if(n%2!=0){
cout<<0<<endl;
return 0;
}
long long ans=0,fives=10;
while(fives<=n){
ans+=n/fives;
f... | 1 | 20,050,647 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int X,Y; cin>>X>>Y;
cout<<(abs(X-Y)>=2? "Alice":"Brown")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#def... | 1 | 80,483,189 |
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin >> n >> m;
ll S = 0;
for (int i=0; i<m; i++) {
int ai;
cin >> ai;
S += ai;
}
if (S > n) cout << -1 << endl;
else cout << (n - S) << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long n,m,a,num;
int main(){
cin>>n>>m;
for (int i=0;i<m;i++){
cin>>a;
num+=a;
}
if (num>n)
cout<<-1<<endl;
else
cout<<n-num<<endl;
return 0;
} | 1 | 91,637,503 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(... | 1 | 34,967,552 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, C;
int flag = 0;
cin >> A >> B >> C;
if (A == B && B == C) {
flag = 1;
}
if (flag == 1) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
int main() {
int a,b,c;
cin>>a>>b>>c;
... | 1 | 86,195,588 |
# include <iostream>
# include <cstdio>
using namespace std;
int main(void)
{
char a[100];
scanf("%s",a);
if (a[2]==a[3]&&a[4]==a[5]) printf("Yes\n");
else printf("No\n");
return 0;
} | #include<iostream>
#include<cstring>
#include<stdbool.h>
using namespace std ;
bool coffee(char str[]){
if(str[2]==str[3]&&str[4]==str[5]) return true;
return false;
}
int main(){
char str[6];
cin >> str;
if(coffee(str)){
cout << "Yes";
}
else{
cout << "No";
}
} | 1 | 96,253,760 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
const ll mod=1e9+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll q,h,s,d,n;
cin>>q>>h>>s>>d>>n;
n*=4... | #include <bits/stdc++.h>
using namespace std;
long long llmax(long long a, long long b)
{
return a > b ? a : b;
}
int main()
{
int q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
long long ans = (long long)n / 2 * min(q * 8, min(h * 4, min(s * 2, d)));
n = n - ((n / 2) * 2);
ans += n * min(q * 4, m... | 1 | 73,114,274 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>data(N);
int M=0;
int m=1000000000;
for(int i;i<N;i++){
cin >> data.at(i);
if(data.at(i)>M) M=data.at(i);
if(data.at(i)<m) m=data.at(i);
}
cout << M-m << endl;
} | #include <bits/stdc++.h>
using ll = long long int;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
ll n = 0;
std::cin >> n;
ll val = 0;
std::cin >> val; n--;
ll min = val;
ll max = val;
while (n--) {
std::cin >> val;
min = std::m... | 1 | 63,552,166 |
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace std;
int a[10];
int n;
int s[100];
int s_max, s_min;
int sum = 0;
int ave = 0;
int main() {
while(cin >> n, n)
{
for(int i =0; i < n; i++){
cin >> s[i];
}
s_max = *max_element(s, s + n);
s_min = *min_element(s, s + n);
sum = a... | #include<iostream>
using namespace std;
int main()
{
int x;
while(1){
cin >> x;
if(x == 0) break;
int max = -1, mini = 10000, sum = 0, score = 0, y = 0;
for(int i = 0; i < x; i++){
cin >> score;
sum += score;
if(score > max) max = score;
... | 1 | 95,337,134 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cout << #x << ": " << (x) << endl
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#defi... | #include<stdio.h>
int x[1024],y[1024];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d",&x[i],&y[i]);
}
int tp=((x[0]+y[0])&1);
tp^=1;
for(int i=0;i<n;i++)
{
x[i]-=tp;
if(((x[i]+y[i])&1)==0)
{
printf("-1\n");
return 0;
}
}
if(tp)
{
printf("36\n1 ");
}
else
{
pri... | 1 | 72,792,300 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#def... | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue... | 1 | 78,546,811 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
string x;
int sum;
cin >> x;
while( !(x=="0") ) {
sum = 0;
for( auto i:x ) {
sum += i - ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
int sum,i;
while(cin>>a)
{
i=0;
sum=0;
if(a[0]==48) break;
while(a[i]!=0){
sum=sum+(a[i]-48);
i++;
}
cout<<sum<<endl;
}
return 0;
} | 1 | 32,329,907 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long calc(vector<long long>& List, int K) {
int N = List.size();
vector<long long> LSum(N);
LSum[0] = List[0];
for (int i = 1; i < N; i++) LSum[i] = LSum[i - 1] + List[i];
int NK = K;
if (K > N) K = N;
long long... | #include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
}
for (int i = 0; i < n; i++) {
c... | 1 | 42,455,484 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<ll>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
void solve()
{
int n;
cin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | 1 | 67,625,965 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n, a[MAXN];
bool can(int c){
map <int, int> mp;
for(int i = 0; i < n; i++){
if(a[i] <= a[i - 1]){
auto d = mp.lower_bound(a[i]);
while(d != mp.end()){
auto nxt = next(d);
mp.erase(d);
d = nxt;
}
int x = a[i] - 1;
w... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
usi... | 1 | 31,648,775 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i= a ; i < b ; ++i)
#define rep(i,n) fo(i,0,n)
#define pln(n) printf("%lld\n",n)
#define sll(n) scanf("%lld",&n)
#define ss(n) scanf("%s",n)
#define vi vector < int >
#define pii pair < int , int >
#define pb push_back
#define mp make_pair
#define ll long long
#define u... | #include <bits/stdc++.h>
#define IO ios::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 5;
const int inf = ~0u >> 1;
typedef pair<int, int> P;
#define REP(i, a, n) for (int i = a; i < (n); ++i)
#define PER(i, a, n) for (int i = (n)-1; i >... | 1 | 27,693,848 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
struct UnionFind {
vector<ll> p;
vector<ll> rank;
UnionFind(ll n) {
p.resize(n);
rank.resize(n, 0);
for... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define mp unordered_map
#define fi first
#define se second
#define endl '\n'
#define I... | 1 | 55,126,457 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
long long a[n+1];
for(long long i=1;i<=n;i++)
cin>>a[i];
long long tall=0,ans=0;
for(long long i=1;i<=n;i++)
{
if(a[i]<tall)
ans+=tall-a[i];
tall=max(tall,a[i]);
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long tolong;
int main(){
tolong N = 0;
tolong ans = 0;
tolong tmp = 0;
tolong i;
cin >> N;
vector<tolong> A(N,0);
for(i = 0;i < N;i++){
cin >> A[i];
}
for(i = 1;i < N;i++){
if(A[i - 1] > A[i]){
tmp =... | 1 | 100,723,692 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | 1 | 51,914,929 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
ll S, C;
cin >> S >> C;
ll ans = 0;
if (C > S * 2)
{
ans += S;
C -= S * 2;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 1 | 8,634,631 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
map<string,int>mp;
map<string,int>::iterator it;
int n,x,y=0,count = 0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>s>>x;
count+=x;
mp[s]=count;
}
cin>>s;
it=mp.find(s);
if(it!=mp.end()) y = it->second;
cout<<count-y<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 1 | 21,832,382 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL<<60;
int main()
{
int n;
int count[100000] = {};
cin>>n;
int m1;
rep(i, n) {
cin>>m1;
count[m1]++;
if (m1 -1 >= 0) {
count[m1 -1] ++;
}
if(m1 +1... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 1 | 44,927,661 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int main(){
string code;
string train;
int i,j;
while(cin >> code){
if(code == "10") code = 'A';
if(code == "0"){
if(train[train.size()-1] == 'A'){
cout << "10" << en... | #include <iostream>
#include <stack>
using namespace std;
int main(void) {
int n;
stack<int> s;
cin >> n;
s.push(n);
while(cin >> n) {
if(n == 0) { n = s.top(); s.pop(); cout << n << endl; }
else s.push(n);
}
return 0;
} | 1 | 4,311,501 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<vector<char>> A (2,vector<char>(3,'a'));
for(int i=0;i<2;i++){
for(int j=0;j<3;j++){
cin >> A.at(i).at(j);
}
}
bool B = false;
for(int j=0;j<3;j++){
int i=0;
if(A.at(i).at(j) != A.at(i+1).at(2-j)){
B=true;
break;... | #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()
{
vector<string> C(2);
string s;
cin >> s;
C.at(0) = s;
cin >> s;
C.at(1) = s;
if (C.at(0).at(0) == C.at(1).at(2)
&& C.at(0).at(1) == C.at(1).at(1)
&& C.at(0).at... | 1 | 47,800,280 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long w,h,a,b;
cin >> w >> h >> a >> b;
long long ans=(w*h)/2;
cout << fixed << setprecision(10);
if(a+a==w&&b+b==h){
cout << ans << " 1" << endl;
}
else{
if(w%2==0||h%2==0){
cout << ans << " 0" << endl;
}
else{
cout... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main(){
long double w,h,x,y;
cin>>w>>h>>x>>y;
double kotae=w*h/2;
ll ans=0;
if(2*x==w&&2*y==h){
ans=1;
}
cout<<fixed<<setprecision(10)<<kotae<<" "<<ans<<endl;
} | 1 | 97,446,743 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int main() {
int n, r;
cin >> n >> r;
if (n >= 10) {
cout << r ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 1 | 43,540,018 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(b+(b-a))<<endl;
return 0;
} | 1 | 35,229,012 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define erep(i, n) for (ll i = 1; i <= (n)i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll h[100010];
ll dp[100010];
int main(void) {
ll n;
cin >>... | #include <bits/stdc++.h>
#define f(i, a, b) for (int i = a; i < (b); ++i)
#define f2(i, a, b) for (int i = a; i <= (b); ++i)
#define rep(i, n) f(i, 0, n)
#define rep2(a, n) f(i, a, n)
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
long long dp[100010];
int main(void) {
int n;
cin >> n;
vecto... | 1 | 49,834,689 |
#include <iostream>
#include <algorithm>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007;
static const size_t MAX_N = 100001;
struct modll {
long long x;
modll() { }
modll(long long _x) : x(_x) { }
operator int() const { return (int)x; }
modll operat... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 1 | 21,471,076 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
cout << (s < t ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t; cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if (s < t) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 69,048,347 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = v... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
using namespace std;
void solve(){
string a, b, c; cin >> a >> b >> c;
if(a[a.size() - 1] == b[0] && b[b.size() - 1] == c[0]) cout << "YES\n";
else cout << "NO\n";
return;
}
int main(){
... | 1 | 49,414,451 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=200005;
ll rui(ll a,ll b){
if(b==1) return a%mod;
else if(b==0) return 1;
else if(b%2==0) return (rui(a,b/2)*rui(a,b/2))%mod;
else return (rui(a,b-1)*a)%mod;
}
int main()... | 1 | 23,937,021 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector <int> a;
void insert(int t) {
int k = a.size();
a.push_back(t);
while (k != 0 && a[(k - 1) / 2] < a[k]) {
swap(a[k], a[(k - 1) / 2]);
k = (k - 1) / 2;
}
}
void maxheapify(int i) {
int l = 2 * i + 1;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 1 | 37,313,833 |
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
constexpr int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> m(26);
char c;
while (cin >> c) ++m[c - 'a'];
cout << accumulate(begin(m), end(m), 1LL,
[](auto a, int x) { return a * (x + 1) % MOD; }... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 1 | 23,665,421 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <numeric>
int main() {
int n, z, w;
std::cin >> n >> z >> w;
std::vector<int> v(n);
for (size_t i = 0; i < n; i++)
{
std::cin >> v[i];
}
if (n == 1) {
std::cout << abs(v[0] - w) << std:... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#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()
typedef long long lint;
using ... | 1 | 79,413,382 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 1 | 46,027,199 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int MOD = 1000000007;
char s[MAXN];
int n, c[26];
int main(){
scanf("%d %s", &n, s);
for(int i = 0; i < n; i++){
c[s[i] - 'a']++;
}
long long res = 1;
for(int i = 0; i < 26; i++)
res = res * (c[i] + 1) % MOD;
printf("%lld\n", (res - ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9+7;
signed main() {
int N;
string S;
cin >> N >> S;
vector<int>cnt(26,1);
for(int i = 0; i < N; i++) {
cnt[S[i]-'a']++;
}
int res = 1;
for(int i = 0; i < 26; i++) {
res*=cnt[i];
res =... | 1 | 10,978,505 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1000000009
#define LINF 1000000000000000009
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define l... | 1 | 66,861,708 |
#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORR(i,n) for(int i=n;i>=0;i--)
#define pb push_back
#define vlli vector<int>
#define slli set<int>
#define mlli map<int,int>
#define int long long int
#define test int tt1234; cin>>tt1234;while(tt1234--)
#define endl "\n"
#define all(zz) zz.begin(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include... | 1 | 85,941,612 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.