code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using VI=vector<ll>;
using VD=vector<ld>;
using VVI=vector<VI>;
using VC=vector<char>;
using VVC=vector<VC>;
using VS=vector<string>;
using PLL =pair<ll,ll>;
using PLD=pair<ld,ld>;
using VPLL=vector<PLL>;
#define REP(i,n) for(ll... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
ll n,k;
cin >> n >> k;
vector<ll> v(n);
rep(i,n... | 1 | 97,646,061 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include<cstdio>
#define N 200005
using namespace std;
int read()
{
int x=0;char ch=getchar();
while (ch<'0'||ch>'9')ch=getchar();
while (ch>='0'&&ch<='9')x=x*10+(ch^48),ch=getchar();
return x;
}
int n,cnt,a[N],b[N],mul[25],w;
bool p;
struct stk{
int pos,num,c;
}s[N];int top;
inline void Plus(int x){while (mul[s[x... | 1 | 94,292,128 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pll pair<LL,LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x)*(x))
#define pdd pair<double,double>
#define MEMS(x) memse... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n, k;
ll ans;
ll l[maxn], r[maxn], sum[maxn];
int a[maxn];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
for(int i = 1; i <= n; ++i) l[i] = l... | 1 | 85,617,221 |
#include "bits/stdc++.h"
#include <chrono>
#include <tuple>
#include <string>
#include <random>
#include <cstdio>
#define ll long long int
#define pb push_back
#define mp make_pair
#define rep(i,n) for(ll i=0;i<n;i++)
#define vi vector <int>
#define vs vector <string>
#define vc vector <char>
#define vl vector <ll>
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mo=1e9+7;
const int maxn=1e5+10;
int h[maxn];
LL f[maxn];
long long gcd(long long a,long long b,long long &x,long long &y){
if (b==0){
x=1;y=0;
return a;
} else {
long long r=gcd(b,a%b,y,x);
y-=x*(a/b);
return r;
}
}... | 1 | 14,562,095 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int n,x;
cin>>n;
set<int> st;
string ans="YES";
while(n--)
{
cin>>x;
if(st.count(x))
{
ans="NO";
break;
}
st.insert(x);
}
cout<<ans;
} | 1 | 68,501,877 |
#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 argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
cout<<n*n-a<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int nbord , whbord;
cin >> nbord >> whbord;
int bord = nbord * nbord;
cout << bord - whbord << endl;
} | 1 | 89,044,042 |
#include<bits/stdc++.h>
using namespace std;
#define rep(a,b) for(int i=a;i<b;++i)
int main() {
int n;
cin >> n;
for (int i = 0; i < 10; ++i) {
if (n < (1 << (i+1))) {
cout << (1<<i) << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
int keta(int n) {
int cnt = 0;
while(n > 0) {
n /= 10;
cnt++;
}
return cnt;
}
int main() {
int n;
cin... | 1 | 20,743,274 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b;
cin >> a >> b;
int t = abs(a - b);
if (t <= 1) cout ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | 1 | 48,507,561 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int h, n;
cin >> h >> n;
int i;
vector<int>a(n);
for (i = 0; i < n; i++)
{
cin >> a.at(i);
h -= a.at(i);
if (h <= 0)
{
break;
}
}
if (h <= 0)
cout << "Yes" << endl;
... | #include <iostream>
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main()
{
int h,n;
cin>>h>>n;
int a,s=0;
rep(i,n) {cin>>a;s=s+a;}
if(s>=h){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | 1 | 61,289,517 |
#include<stdio.h>
int main(){
int kazu[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int number;
scanf("%d",&number);
printf("%d",kazu[number-1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> S = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << S.at(K-1) << endl;
return 0;
} | 1 | 42,384,638 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <queue>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
if (N % 2) {
cout << "No" << endl;
return 0;
}
for (int i = 0; i < N / 2; ++i) {
if (S[i] != S[N / 2 + i]) {... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 | 81,749,191 |
#include <memory>
#include <sstream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iterator>
#include <nu... | #include <iostream>
#include <cstdio>
using namespace std;
typedef struct Node{
int key;
Node *prev, *next;
} Node;
Node *nil;
void insert_cell(int key)
{
Node *x;
x = new Node;
x->key = key;
x->prev = nil;
x->next = nil->next;
x->next->prev = x;
nil->next = x;
}
void deleteNode(Node *t)
{
if(t != n... | 1 | 68,584,197 |
#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;
int main() {
int n, k;
cin >> n >> k;
int m = n-1;
int mx = (n-1) * (n-2) / 2;
if(k > mx) {
cout << -1 << endl;
return 0;
}
int now = mx;
vector<pair<int, int>... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 82,173,810 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,m;
cin >> n >> m;
vector <vector <pair <int,int>>> p(n + 1);
for(int i = 0;i < m;++i){
int P,Y;
cin >> P >> Y;
p[P... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 1 | 65,539,176 |
#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>;
ll solve(ll n) {
if (n % 2 == 1) return 0;
ll res = 0;
n /= 2;
while (n) {
res += n / 5;
n /= 5;
}
return res;
}
int main() {
ll n;
cin >> n;
cout << so... | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 1 | 72,563,248 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
S.push_back(s);
}
int ans... | 1 | 97,356,644 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
int getMaxValue(vector<int> count)
{
int max = 0;
for (int i = 0; i < N; i++)
{
if (count[i] > max)
max = count[i];
}
return max;
}
int main()
{
cin >> N;
map<int, string> blueCard;
for (int i = 0; i < N; i++)
... | #include<iostream>
#include<map>
using namespace std;
int main(void) {
int N, M;
string s[100], t[100];
map<string, int> m;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
cin >> s[i];
m[s[i]]++;
}
scanf("%d", &M);
for (int i = 0; i < M; i++) {
cin >> t[i];
m[t[i]]--;
}
int ans = 0;
for (auto itr = m.... | 1 | 52,761,238 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#ifdef VC
#define scanf scanf_s
#endif
#define iINF (1<<30)
#define INF (1LL<<59)
#de... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long lo... | 1 | 18,388,654 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define REV(x) (reverse(x.begin(),x.end()))
ll gcd... | #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); ++... | 1 | 72,731,866 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,K;
cin>>N>>K;
long double ans=0;
for(int i=1;i<=N;i++){
long double a=1;
for(int j=i;j<K;j*=2)
a/=2;
ans+=a;
}
cout<<fixed<<setprecision(16)<<ans/N<<endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
int k;
scanf("%d%d",&n,&k);
double ans = 0;
for (int i = 1; i <= n; i++) {
double p = 1.0 / n;
int x = i;
while (x < k) {
x *= 2;
p /= 2;
}
ans += p;
}
printf("%.12f\n",ans);
} | 1 | 23,052,675 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n,v;
cin >> n >> v;
int tab[n+1][n+1] = {};
REP(i,v){
int sta, goa;
cin >... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | 1 | 8,853,360 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n,a,b;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, A, B;
cin >> N >> A >> B;
if (B < A) {
cout << 0 << endl;
return 0;
}
long long min = A * (N - 1) + B;
long long max = A + B * (N - 1);
cout << (max - min + 1 > 0 ? (max - min + 1) : 0) << endl;
return 0;
} | 1 | 83,886,620 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long a;
double b;
cin >> a >> b;
int B = b*100+0.001;
a *= B;
cout << a/100 << endl;
} | #include <bits/stdc++.h>
int main() {
int64_t a;
double b;
scanf("%lld %lf", &a, &b);
__int128 aa = a;
__int128 bb = round(b * 100);
printf("%lld\n", int64_t((aa * bb) / 100));
} | 1 | 65,028,906 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
int ans=0;
while(!(a[0]==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll a, b, c;
cin >> a >> b >> c;
ll mx = max({a, b, c});
ll mn = min({a, b, c});
ll md = a + b + c - mx - mn;
ll ans = 0;
ans += mx - md;
if((md - ... | 1 | 7,357,823 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
if(C <= A-B){
printf("0\n");
}else{
printf(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int d=a-b;
if(d>=c){
cout<<0<<endl;
}
else{
cout<<(c-d)<<endl;
}
} | 1 | 26,545,255 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
int main(){
int n,k,S,max,count;
while(true){
scanf("%d %d",&n,&k);
if(n == 0 && k == 0)break;
max = -1000000001;
S = 0;
count = 0;
int array[n];
for(int i = 0; i < n; i++){
scanf("%d",&array[i]);
count++;
if(count == k){
S += array[i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,result = -100000;
int num[100005] = {0};
int memo[100000] = {0};
while(cin >> n >> m,n + m)
{
for(int i = 0; i < n; i++)cin >> num[i];
for(int i = m-1; i < n; i++)
{
memo[i]=0;
if(i == m... | 1 | 17,054,435 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[85];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
ll money=1000,stock=0;
for(int i=1;i<=n-1;i++){
stock=0;
if(a[i]<a[i+1]) stock=money/a[i];
money+=(a[i+1]-a[i])*stock;
}
printf("%lld",money);
return 0... | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int day_length;
vector<int> values;
cin >> day_length;
for(int i = 0; i < day_length; i++){
int v;
cin >> v;
values.push_back(v);
}
long long money = 1000;
for(int i = 1; i < day_length; i++){... | 1 | 66,041,637 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main(){
ll N;
cin>>N;
ll res=0;
vector<ll>data(N);
for(ll i=0;i<N;i++)cin>>data[i];
for(ll d=0;d<60;d++){
ll zero=0,one=0;
for(ll i=0;i<N;i++){
if(data[i]>>d&1)one++;
else zero++;
}
ll t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a,ll n,ll mod){
if(n == 0) return 1LL;
if(n % 2 == 0){
ll d = modpow(a,n/2,mod) % mod;
return (d*d) % mod;
}
return (a % mod) * (modpow(a,n-1,mod) % mod) % mod;
}
int main(){
ll n; cin >> n;
v... | 1 | 85,720,424 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
int
main() {
int N; cin >> N;
vector<ll> arr(N);
rep(i, 0, N) cin >> arr[i];
vector<ll> acum(N + 1, 0);
rep(i, 0, N) acum[... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | 1 | 23,327,719 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
string tmp, str;
while (cin >> tmp) str += tmp;
FOR(i, 'a', 'z'+1) {
int s = 0;
REP(j, str.size()) if (tolower(str[j]) == i) s++;
co... | #include<iostream>
#include<string>
using namespace std;
int main( )
{
string str;
int alphas[28] = { 0 };
int i;
while( getline( cin, str ) ) {
for( i=0; i<str.length(); i++ ) {
if( islower( str[i] ) ) {
alphas[ str[i]-'a' ]++;
} else {
alphas[ str[i]-'A' ]++;
}
}
}
for( i=0; i<26; i++ ) {
... | 1 | 14,135,784 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();+... | #include<iostream>
#include<string>
using namespace std;
int main(){
int onum;
while(true){
int N;
cin >> N;
if(N == 0) break;
onum=0;
int oturi = 1000-N;
if(oturi >= 500)
{
onum++;
oturi -= 500;
}
while(oturi>=100)
{
onum++;
oturi -= 100;
}
if(oturi >= 50)
{
onum++;
oturi -... | 1 | 3,087,372 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
string A,B;
cin >> A >> B;
if(A.size() > B.size()){
cout << "GREATER";
}
else if(A.size() < B.size()){
cout << "LESS";
}
else{
rep(i,A.size()){
if(A[i] > B[i... | 1 | 60,304,084 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
using namespace std;
int d[10];
bool valid(int n) {
while(n) {
if(d[n%10]) return false;
n/=10;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL)... | 1 | 12,661,649 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
const string t[] = {"dream","... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
for (int i = 0; i < 4; ++i) reverse(divi... | 1 | 27,154,840 |
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 1 | 79,502,222 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, M, R, ans=0, tmp=0;
vector<ll> Rs;
vector<vector<ll>> D;
signed main(){
cin >> N >> M >> R;
Rs.resize(R);
D.resize(N);
for(int i=0;i<N;i++) {
D[i].re... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define r... | 1 | 10,296,947 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include<bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 100;
int n, avail[Nmax], ass[Nmax], t, res;
vector<int> a[Nmax];
bool visit(int u) {
if (avail[u] != t) avail[u] = t;
else return false;
for(int i = 0; i < (int)a[u].size(); ++i) {
int v = a[u][i];
if (!ass[v] || visit(ass[v... | 1 | 8,570,293 |
#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)
typedef long long ll;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MAX = 100001;
void bfs(int);
int gcd(int a, int b) {
if (b == 0) {
return a;
... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
vector<int>topo_sort(const vector<vector<int>>&edges) {
int size_ = edges.size();
vector<int>nums(si... | 1 | 2,265,814 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,s,d,f;
cin>>a>>s>>d>>f;
int total=0;
if(a>=s)total+=s;
else total+=a;
if(d>=f)total+=f;
else total+=d;
cout<< total<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
typedef long double ld;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
int A, B, C... | 1 | 27,797,356 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a) vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define g... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <deque>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
rep(i, n)
{
cin >> a[i];... | 1 | 61,222,653 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k; cin >> a >> b >> k;
int count = 0;
int div;
if(a>=b) div = b;
else div = a;
for(int i = div; count < k; i--){
if(a%i ==0 && b%i == 0) count++;
div = i;
}
cout << div << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k; cin>>a>>b>>k;
vector<int> div(200);
int cnt=1;
for(int i=min(a,b);i>=1;i--) {
if(a%i==0&&b%i==0) {
div[cnt]=i;
cnt++;
}
}
cout<<div[k]<<endl;
} | 1 | 47,033,087 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,ans=0;
cin>>n;
vector<int> a(n);
for(i=0;i<n;i++) cin>>a.at(i);
sort(a.begin(),a.end());
auto it1=a.begin();
while(it1!=a.end()){
auto it2=lower_bound(a.begin(),a.end(),(*it1)+3);
ans=max(ans,(int)distance(it1,it2));
it1=lower_bo... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
map<ll,ll>l2;
int main()
{
ll n,a=0,b=0,c=0,x=0,y,z;
cin>>n;
ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
l2[l1[i]]++;
}
for(int i=0;i<100000;i++){
if(i==0)x=max(x,l2[i]+l2[i+1]);
else x=max(x... | 1 | 68,737,462 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0; cin >> n;
for(long long i = 1; i <= n; ++i) for(long long j = 1; i*j <= n; ++j) ans += i*j;
cout << ans << "\n";
return 0;
} | 1 | 62,560,080 |
#include <iostream>
int main()
{
int n;
while(std::cin>>n,n){
n = 1000-n;
int ans = 0;
while(n>=500){
n-=500; ans++;
}
while(n>=100){
n-=100; ans++;
}
while(n>=50){
n-=50; ans++;
}
while(n>=10){
n-=10; ans++;
}
while(n>=5){
n-=5; ans++;
}
ans += n;
printf("%d\n",ans);
}
re... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a... | 1 | 65,162,648 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,w,x,sum=0;
cin>>n>>m;
bool a[n+1];
for(int i=1;i<=n;i++)
a[i]=true;
for(int i=1;i<=m;i++)
{
cin>>x;
for(int i=1;i<=x;i++)
{
cin>>w;
a[w]=false;
}
}
for(int i=1;i<=n;i++)
if(a[i])
sum++;
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,c=0;
cin >> N >> K;
map<int,int> sunuke{};
for(int i=0;i<N;i++){
sunuke[i+1] = 0;
}
for(int i=0;i<K;i++){
int d_i;
cin >> d_i;
for(int j=0;j<d_i;j++){
int a_i;
cin >> a_... | 1 | 54,532,688 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
int n,m;
cin>>n>>m;
string str[n];
for(int i=0;i<n;i++)
cin>>str[i];
int left[n][m]{};
int right[n][m]{};
int up[n][m]{};
int down[n][m]{};
for(int i=0;i<n;i++)
{
int coun... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int h,w;cin>>h>>w;
int a[2003][2003];
rep(i,h){
string s;cin>>s;
rep(j,w){
if(s[j]=='#')a[i][j]=0;
else a[i][j]=1;
}
}
int a... | 1 | 8,175,360 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
int n;
cin>>n;
vector<... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N;
cin>>N;
vector<int> A(N),B(N+1);
B[0]=0;
for(int i=0;i<N;i++){
cin>>A[i];
B[i+1]=B[i]+A[i];
}
map<int,int> C;
for(int &i:B)
C[i]++;
int k=0;
for(pair<int,int> p:C)
k+=p.second*(p.second-1)/2;
c... | 1 | 51,743,762 |
#include <iostream>
using namespace std;
int n, m;
void solve() {
int second = m & 1 ? m + 1 : m + 2;
int cnt = 1;
int cnt2 = 0;
for (int i=0;i<m;i++) {
if (i < m / 2) {
cout << cnt << " " << (second - cnt) << endl;
cnt++;
} else {
cout << cnt2 + second << " " << (2 * m + 1 - cnt2) << ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,... | 1 | 19,192,449 |
#include<stdio.h>
int main(){
char r[100];
char s[100];
scanf("%s %s",&s,&r);
printf("%s%s",r,s);
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <utility>
#include <iterator>
#def... | 1 | 38,660,257 |
#include <bits/stdc++.h>
const int INF =1e9;
const int MOD =1e9+7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
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; } r... | 1 | 70,010,317 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> ans;
int sum = 0;
for(int i = 1; i <= n; i++){
if(sum < n) {
ans.push_back(i);
sum += i;
} else {
break;
}
}
int s = ... | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c)... | 1 | 7,215,535 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
ll MOD = 2019;
int
main()
{
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = (double)w * h / 2;
if((dou... | #include<iostream>
#include<string>
#include<stdio.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<vector>
#include<iomanip>
#include <cstdio>
using namespace std;
int main(){
double w,h,x,y;cin >> w >> h >> x >> y;
double m=0.0;
int cnt = 0;
m = (w*h) /2;
if(x*2 == w && y*2 == h)cn... | 1 | 98,106,227 |
#include<iostream>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
int count[26] = {};
while(cin >> ch){
if(isalpha(ch)){
count[tolower(ch) - 'a'] ++;
}
}
for(int i = 0; i <= 25; i++){
printf("%c : %d\n",i + 'a',count[i]);
}
ret... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int count[26] = { 0 };
char c;
while (cin >> c) {
if (c >= 65 && c <= 90)
count[c - 'A']++;
else if (c >= 97 && c <= 122)
count[c - 'a']++;
}
for (int i = 0; i < 26; i++)
pr... | 1 | 10,923,667 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
const vector<string> keys = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main() {
int C;
cin >> C;
while (C-- > 0) {
string s;
cin >> s;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<char>> ch = {{}, {'.', ',', '!', '?', ' '}, {'a', 'b', 'c'}, {'d', 'e', 'f'}, {'g', 'h', 'i'}, {'j', 'k', 'l'}, {'m', 'n', 'o'}, {'p', 'q', 'r', 's'}, {'t', 'u', 'v'}, {'w', 'x', 'y', 'z'}};
int T;
cin >> T;
for (int i = 0; i < T; i++){
... | 1 | 18,372,271 |
#include<bits/stdc++.h>
#define lld long long int
#define ld long double
#define mpi 3.14159265358979323846
#define mod 1000000007
using namespace std;
int main()
{
int h,w;
cin >> h >> w;
char m[h+1][w+1];
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
cin >> m[i][j];
}
}
char p[2*h + 1][w+1];
for(in... | #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 h, w;
cin >> h >> w;
char c[h][w];
rep(i, h) rep(j, w) cin >> c[i][j];
rep(i, h) rep(_, 2) {
rep(j, w) cout << c[i][j];
cout << endl;
}
return 0;... | 1 | 11,947,870 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
int build[12][10]={{0}};
int main()
{
i... | #include <iostream>
using namespace std;
int main(){
int data[12][10] = {0};
int n;
cin >> n;
for (int i = 0; i < n; i++){
int b, f, r, v;
cin >> b >> f >> r >> v;
f += (b - 1) * 3;
f -= 1;
r -= 1;
data[f][r] += v;
}
for (int i = 0; i < 12;i++){
for (int j = 0; j < 10; j++){
if (i % 3 == 0 && i !... | 1 | 41,730,946 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie();
int n;
int x = 0 , y = 1;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,a;
map<int,int> b;
for (cin >> N; N; b[a]++, N--) {
cin >> a;
}
a = 0;
for (auto p : b) {
if (p.second >= p.first) {
a += p.second-p.first;
} else {
a += p.second;
}
}
cout << a;
} | 1 | 30,554,875 |
#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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=2e18;
c... | 1 | 69,005,239 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(k, 1000) {
ll d[3] = {k / 100, k / 10 % 10, k % 10};
int idx = 0;
rep(i, s.size(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
str... | 1 | 11,394,390 |
#include <iostream>
int main(){
int A, B;
std::cin >> A >> B;
std::cout << (A - 1) * (B - 1) << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RFOR(i, a, b) for (int(i) = (a); (i) > (b); --(i))
#define SORT(x) sort(ALL((x)))
#define RSORT(x) sort(RAL... | 1 | 53,122,935 |
#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%lf\n",sqrt(pow((x2-x1),2) + pow((y2-y1),2)));
} | #include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
int main(){
double x1,y1,x2,y2,a,b,c,ans;
cin>>x1>>y1>>x2>>y2;
a=x1-x2;
b=y1-y2;
ans=sqrt(a*a+b*b);
printf("%.8f",ans);
} | 1 | 54,179,173 |
#include <bits/stdc++.h>
using namespace std;
#define range(i, m, n) for(int i = m; i < n; i++)
#define husk(i, m, n) for(int i = m; i > n; i--)
template <typename T>
void debug_out(T t) {
cerr << t;
}
template <typename A, typename B>
void debug_out(pair<A, B> u) {
cerr << "(" << u.first << " " << u.second << ")";... | #include<bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 200003;
int n, a[N], stk[N], num[N], top;
inline bool check(int m){
top = 1; stk[1] = 1; num[1] = a[1];
for(Rint i = 2;i <= n;++ i){
if(a[i] > a[i - 1]){
if(stk[top] == 1) num[top] += a[i] - a[i - 1];
... | 1 | 28,978,593 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define MAX 0x7f7f7f7f
#define maxn 200000+10
LL a[maxn];
LL sum[maxn];
int main()
{
int n;
scanf("%d",&n);
LL s=0;
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s+=a[i];
sum[i]=sum[i-1]+a[i];
}
LL minn=... | 1 | 79,438,811 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define MAX_C 1000000001
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll cost = 1000000000LL * 30;
for (int i = 0; i < (1 << (n-1)); i++) ... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
int main () {
cout << fixed << setprecision(18);
int n,k;cin>>n>>k;
... | 1 | 100,528,787 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
vector<bool> used(26, false);
for (int i = 0; i < s.size(); i++)
{
int j = s[i] - 'a';
if (used[j])
{
cout << "no" << endl;
return 0;
}
used[j] = true;
}... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
string s;
cin >> s;
bool check = false;
int arr['z'-'a'+1]{};
for(int i = 0; i < s.size(); i++)
{
arr[s[i] - 'a']++;
if( arr[ s[i] - 'a'] > 1 )
check = true;
}
if( check == false )
cout <... | 1 | 27,830,673 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (auto &v : vec) {
char c;
cin >> c;
v = c - '0';
}
set<int> s1;
set<int> s2;
set<int> s3;
s1.insert(vec[0]);
s1.insert(vec[1]);
s2.insert(vec[0] * 10 + vec[1]... | #include<iostream>
using namespace std;
int main() {
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for (int i = 0; i < 1000; i++) {
int c[3] = { i / 100,(i / 10) % 10,i % 10 };
int hit = 0;
for (int j = 0; j < n; j++) {
if (s[j] == ('0' + c[hit]))hit++;
if (hit == 3)break;
}
if (hit == 3)ans++;
... | 1 | 4,001,393 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
using vi = vector<int>;
int main(){
int n;
cin >> n;
deque<int> b;
rep(i,n){
int a;
cin >> a;
if (i % 2 == 0) b.push_front(a);
else b.push_back(a);
}
if (n % 2 == 1){
rep(i,n){
printf("%d ", b.fro... | #define _GIBCXX_DEBUG
#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 namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) {
cin >> ... | 1 | 82,508,169 |
#include <iostream>
#include<vector>
#include<cmath>
#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()
typedef long long ll;
using namespace std;... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,D,rs=0;
double wa=0,ans=0;
int digi=0;
cin >> N >> D;
vector<vector <int>> X(N,vector<int>(D));
for(int i = 0;i < N;i++)
for(int j = 0;j < D;j++){
cin >> X.at(i).at(j);
}
for(int i =... | 1 | 3,451,835 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
int m... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
bool isequal_array(int *Array1, int *Array2, int N);
int main(){
int N;
cin >> N;
int P[N];
int Q[N];
for(int i=0; i<N; i++){
cin >> P[i];
}
for(int i=0; i<N; i++){
cin >> Q[i];
}
int default_perm[N];
... | 1 | 39,774,355 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,found;
cin >> n;
string s;
cin >> s;
if(s.size() > n) {
s = s.substr(0, n) + "...";
cout << s << endl;
} else {
cout << s << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k;
cin >> k;
string s;
cin >> s;
if(s.size() <= k) cout << s << endl;
else{
rep(i,k)cout << s.at(i);
cout << "..." << endl;
}
} | 1 | 34,339,737 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<vector<int>> A(N, vector<int>(M));
rep (i, N) {
cin >> C.at(i);
rep (j, M) {
cin >> A.at(i).at(j);
... | 1 | 35,292,440 |
#include <cstdio>
#include <algorithm>
#define MAXN 50
#define NIL -1
using namespace std;
int value[MAXN];
int fibonacci(int n){
if (n == 0 || n == 1) {
value[n] = 1;
return 1;
}
if (value[n] != NIL) return value[n];
value[n] = fibonacci(n-1) + fibonacci(n-2);
return value[n];
}
int... | #include <iostream>
const int MAX_N = 440;
long memo[MAX_N] = {};
long fibonacci(int n) {
switch (n) {
case 0:
case 1:
return 1;
default:
if (memo[n])
return memo[n];
else
return memo[n] = fibonacci(n - 1) + fibonacci(n - 2)... | 1 | 12,321,369 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(),v.end()
#define int long long
#define ll long long
#define M 1000000007
#define mii map<ll ,ll >
#define msi map<string,ll >
#define mis map<ll in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | 1 | 62,390,751 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int x; cin >> x;
int ans = 1, t = x;
while (t % 360) t += x, ans... | #include <cstdio>
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
int x;
scanf("%d",&x);
printf("%d\n",360/gcd(x,360));
return 0;
} | 1 | 31,188,207 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxv = 11;
int d[maxv][maxv];
int V;
int x[maxv];
void warshall_floyd()
{
for(int k=0; k<V; k++)
for(int i=0; i<V; i++)
for(int j=0; j<V; j++)
d[i][j] = min(d[i]... | 1 | 20,835,079 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
char now;
bool ok = false;
map<string, int> a;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<string> vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
}
bool can=true;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(vec.at(i)==vec.at(j)){
can=false;
break;
}
}
if(can) continue... | 1 | 7,279,147 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, ans;
int a, b;
bool check(int x) {
int sum = 0;
while (x) {
sum += x % 10;
x /= 10;
}
return sum >= a && sum <= b;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> a >> b;
... | 1 | 80,907,986 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
long long n;
int main() {
cin >> n;
vector<long long> a(n, 0);
... | #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() {
int n;
cin >> n;
vector<ll> A(n), B(n);
ll biga = 0, bigb = 0;
rep(i, n) cin >> A[i];
rep(i,n) cin >> B[i];
rep(i,n){
if(A[i] > B[i]) biga += A[i]... | 1 | 73,385,026 |
#include<iostream>
#include<vector>
#include<map>
#include <iomanip>
#include<cmath>
#include<queue>
#include<algorithm>
#define ll long long
#define eps 1e-9
#define endl "\n"
#define PI acos(-1)
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define rep(i,n) for(int i=0;i<n;i++)
usin... | #include<iostream>
#include<cmath>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<deque>
#include<tuple>
#include<iomanip>
using namespace std;
#define int int64_t
#define double ... | 1 | 80,274,241 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> pix(h, vector<char>(w));
vector<vector<char>> lpix(2*h, vector<char>(w,'.'));
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin >> pix.at(i).at(j);
}
}
for(int i=0; i<h; i++){
for(i... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h,w;
cin >> h >> w;
string c[h];
for(int i=0;i<h;i++){
cin >> c[i];
}
for(int i=0;i<h;i++){
cout << c[i] << endl;
cout << c[i] << endl;
}
} | 1 | 53,882,234 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define SZ(i) int(i.size())
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);_do(__VA_ARGS__);
template... | #include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#pragma warning(disable:4996)
typedef long long ll;... | 1 | 21,183,113 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return fa... | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
int main() {
long T, X;
cin >> T >> X;
double ans = 0.0;
ans = (double)T / (double)X;
cout << fixed;
cout << setprecision(6) << ans << endl;
return 0... | 1 | 14,916,889 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <map>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main()
{
double n,k;
cin >> n >> k;
double prob = 0;
... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i =... | 1 | 79,734,601 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char ch;
int count[26] = {};
while( scanf("%c", &ch) != EOF ){
if(isalpha(ch)){
ch = tolower(ch);
int num = ch - 'a';
count[num]++;
}
}
for(int i = 0; i < 26; i+... | #include <iostream>
using namespace std;
int main(void) {
char c;
int cnt[26];
for (int i = 0; i < 26; i++) cnt[i] = 0;
while (cin >> c) {
if (isalpha(c)) {
c = tolower(c);
cnt[c - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
cout << char('a' + i) <<... | 1 | 95,280,518 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define fi first
#define se second
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
fio;
string s; cin>>s;
... | 1 | 31,185,290 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b;
cin>>a>>b;
ll c=min(a,b);
ll k;
cin>>k;
ll g=0;
vector<ll>vec(0);
for(ll i=1;i<=c;i++){
if(a%i==0&&b%i==0){
vec.push_back(i);
g+=1;
}
}
cout<<vec.at(g-k)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> c;
for (int i = 1; i <= min(A, B); ++i) {
if (A % i == 0 && B % i == 0) c.push_back(i);
}
reverse(c.begin(), c.end());
cout << c[K-1] << endl;
} | 1 | 64,094,385 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
if(s=="SSS")
cout<<"0"<<endl;
else if(s=="RSS")
cout<<"1"<<endl;
else if(s=="SRS")
cout<<"1"<<endl;
else if(s=="SSR")
cout<<"1"<<endl;
else if(s=="RSR")
cout<<"1"<<e... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | 1 | 59,026,797 |
#include<iostream>
#include <vector>
#include <cstdio>
#include<algorithm>
#include <utility>
#include<string>
using namespace std;
string str[10000] = { "" };
char ch[10000];
int input();
int main() {
int a,most=0;
a = input();
string longest;
int m[10000] = { 0 }, l;
for (int i = 0; i <= a + 1; i++) {
for (in... | #include <iostream>
#include <fstream>
#include <string>
#include <map>
using namespace std;
int main(){
#ifdef DEBUG
ofstream fout("output.txt");
ifstream fin("input.txt");
if(!fout || !fin){
cout << "Can't open the file.\n";
return;
}
#endif
string word;
int max_length;
int max_appear;
string max_string;
... | 1 | 73,910,411 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
vector<int>vec(N);
for(int X=0;X<N;X++){
cin>>vec.at(X);
}
if((N-1)%(K-1)==0){
cout<<(N-1)/(K-1)<<endl;
}
else{
cout<<(N-1)/(K-1)+1<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> A;
int main() {
cin >> N >> K;
A.resize(N);
rep(i, N) cin >> A[i];
cout << ceil((double)... | 1 | 61,499,559 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
float mean(vector<int> v) {
int size = v.size();
float sum = 0;
for (int i = 0; i < size; i++){
sum += v[i];
}
return sum / size;
}
int main(void)
{
int N;
cin >> N;
vect... | 1 | 63,442,183 |
#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> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
rep(i,n) {
if (i == 0) a[i] = b[i];
else if (i =... | #include<bits/stdc++.h>
#define two(a) (1<<(a))
#define LINF (1ll<<61)
#define EPS (1e-14)
#define Lshift(a,b) ((a)<<(b))
#define Rshift(a,b) ((a)>>(b))
#define rep(a,b) for(a=0 ; a<b ; a++)
#define xrep(a,b,c) for(a=b ; a<c ; a++)
#define INF (1<<29)
#define sz(a) int(a.size())
#define mset(x) memset(x, 0, sizeof(x))
... | 1 | 54,262,053 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
cout << (char)toupper(s1[0]) << (char)toupper(s2[0]) << (char)toupper(s3[0])
<< '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
const int MAX=3000;
signed main(){
... | 1 | 57,384,703 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int l, n;
cin>>l>>n;
string s1, s2="";
string mood[l];
for(int i=0; i<l;i++){
cin>>s1;
mood[i]=s1;}
sort(mood, mood+l);
for(int i=0; i<l; i++){
s2+=mood[i];
}
cout<<s2;} | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int N, L;
cin >> N >> L;
vector<string> V(N);
for (int i=0; i<N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
for (int i=0; i<N; i++) {
cout << V[i];
}
cout << endl;
} | 1 | 70,125,409 |
#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 mt make_tuple... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | 1 | 72,064,688 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#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);... | #include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main() {
map<string, int>d;
int n; cin >> n;
for (int i = 0; i < n; i++) {
string s; cin >> s;
d[s]++;
}
int m; cin >> m;
for (int i = 0; i < m; i++) {
string s; cin >> s;
d[s]--;
}
int ans = 0;
for (auto&& x : d) {
ans = m... | 1 | 58,838,360 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin ... | 1 | 7,157,319 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<vector>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=2e18;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 1 | 30,932,906 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int a,b;
if(s.size()==2){
if(s.at(0)==s.at(1)){
flag=true;
a=1;b=2;
}
}
else{
for(int i=0;i<s.size()-2;i++){
if(s.at(i)==s.at(i+1)||s.at(i)==s.at(i+2)||s.at(i+1)==s.at(i+2)){
fla... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#defi... | 1 | 46,051,512 |
#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)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
int K;
cin >> N >> K;
int A[N];
for(int i = 0; i < N; i++){
cin >> A[i];
}
... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).re... | 1 | 31,710,622 |
#include <iostream>
#include <unordered_map>
#include <string>
using namespace std;
char to_lower(char c)
{
if ('A' <= c && c <= 'Z')
{
return char(c - ('A' - 'a'));
}
else
{
return c;
}
}
bool is_alphabet(char c)
{
if ('a' <= to_lower(c) && to_lower(c) <= 'z')
{
... | #include <iostream>
#include <string>
#include <cctype>
int main(int argc, char const *argv[]) {
char alpha = 'a';
int count[26]={};
std::string s;
while(std::getline(std::cin, s)){
std::string::const_iterator it = s.begin();
while(it != s.end()){
char c = *it;
if(std::isupper(c)){
c... | 1 | 2,879,480 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.