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 i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(),(x).end())
#define MIN(x) *min_element((x).begin(),(x).end())
#define SORTR(x) sort((x).rbegin(),(x).rend())
#define SORT(x) sort((x).begin(),(x).end())
#define SUM(x) accumulate((x).begin(),(x).end(), 0)
#define FILL(x,a) fill(x.begin(),x.end(),a)
#define EACH(i,x) for(typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)
#define COUT(x) cout<<x<<"\n"
const ll INF = 1e18;
const ld EPS = 1e-10;
const int MOD = int(1e9)+7;
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; }
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first, BidirectionalIterator middle,BidirectionalIterator last){reverse(middle, last); return next_permutation(first , last);}
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll GCD(VI v){ll a = v[0]; for (ll i = 1; i<SIZE(v); i++) {a = gcd(a, v[i]);} return a;}
ll LCM(VI v){ll a = v[0]; for (ll i = 1; i<SIZE(v); i++) {a = lcm(a, v[i]);} return a;}
void Main()
{
ll N,K;
ll result=0;
string S;
cin>>N>>K;
VI A(N);
REP(i, N) cin >> A[i];
ll maxi=MAX(A);
ll G=GCD(A);
if(K%G==0&&K<=maxi)
S="POSSIBLE";
else
S="IMPOSSIBLE";
cout << S << "\n";
return;
}
int main()
{
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
} | #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)cin >> v[i];
ll gcd = v[0];
rep(i,n-1)gcd = __gcd(gcd,v[i+1]);
if(*max_element(ALL(v)) < k){
printf("IMPOSSIBLE\n");
}else{
if(k%gcd == 0){
printf("POSSIBLE\n");
}else{
printf("IMPOSSIBLE\n");
}
}
return 0;
} | 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).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
ll n,cnt,ans,a[ohara],b,c,d,tmpp,m,h,w,x,y,sum,pos,k,q;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
bool check(ll syu){
int res=1;
priority_queue<P> que;
rrep(i,1,n){
if(res==0)break;
if(a[i]>a[i-1])continue;
while(1){
if(que.empty())break;
P X=que.top();
if(X.fi<a[i])break;
que.pop();
}
ll want_ind=a[i]-1;
int ok=0;
while(1){
if(que.empty())break;
P X=que.top();
if(want_ind==X.fi&&X.se==syu-1){
want_ind--;
que.pop();
}
else{
if(want_ind==X.fi){
que.pop();
que.push({X.fi,X.se+1});
ok=1;
}
break;
}
}
if(want_ind<0){
res=0;
}
if(!ok){
if(want_ind<0){
res=0;
}
else{
if(syu==1)res=0;
que.push({want_ind,1});
}
}
}
if(res==1)return true;
else return false;
}
int main(void){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin>>n;
rep(i,n)cin>>a[i];
ll le=1,ri=LINF,mid;
while(ri-le>1){
mid=(le+ri)/2;
if(check(mid))ri=mid;
else le=mid;
}
rrep(i,max(le-5,1LL),ri+5){
if(check(i)){
Cout(i);
break;
}
}
return 0;
} | #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].c]<=s[x].num&&s[x].c<=w)++s[x].c;}
inline void Sub(int x){while (mul[s[x].c-1]>s[x].num)--s[x].c;}
void add(int x)
{
++top;
s[top].pos=a[x];
s[top].num=b[x]-1;
s[top].c=1;
Plus(top);
}
bool check(int m)
{
if (m<=1)return 0;
mul[1]=m;
for (w=1;mul[w]<=n/m;++w)mul[w+1]=mul[w]*m;
top=0;
for (int i=1;i<=cnt;++i)
{
if (a[i]>a[i-1])add(i);
else
{
while (a[i]<=s[top].pos-s[top].c&&top)--top;
if (!top||s[top].pos<a[i])++b[i],add(i),--b[i];
else
{
if (s[top].pos>a[i])
{
int l=s[top].pos-a[i];
s[top].pos=a[i];
s[top].num/=mul[l];
s[top].c-=l;
}
s[top].num+=b[i];
Plus(top);
}
}
for (int j=top;j>1&&s[j].pos-s[j].c<s[j-1].pos;--j)
{
int l=s[j].pos-s[j-1].pos,v=s[j].num/mul[l];
s[j].num-=v*mul[l];
s[j].c=l;Sub(j);
s[j-1].num+=v;
Plus(j-1);
}
if (s[1].pos-s[1].c<0)return 0;
}return 1;
}
int main()
{
n=read();a[0]=-1;
for (int i=1,x;i<=n;++i)
{
x=read();
if (x<=a[cnt])p=1;
if (x!=a[cnt])a[++cnt]=x;
++b[cnt];
}
if (!p){puts("1");return 0;}
int ans=n;
for (int A=n-1;A;A>>=1)
if (check(ans-((A+1)>>1)))ans-=(A+1)>>1;
printf("%d\n",ans);
return 0;
} | 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) memset(x,-1,sizeof(x))
#define MEM(x) memset(x,0,sizeof(x))
#define less Less
#define EPS 1e-4
#define arg ARG
#define cpdd const pdd
#define rank Rank
#define KK 500
#define MXN 200005
int main(){
LL pre[100005];
LL suf[100005];
LL sum[100005];
int a[100005];
int n,k;
scanf("%d %d",&n,&k);
for(int i = 1;i<=n;i++)
scanf("%d",&a[i]);
pre[0]=0;
suf[n+1]=0;
sum[0]=0;
for(int i = 1;i<=n;i++){
pre[i]=pre[i-1]+max(a[i],0);
sum[i]=sum[i-1]+a[i];
}
for(int i = n;i>=1;i--){
suf[i]=suf[i+1]+max(a[i],0);
}
LL ans=0;
for(int i=1;i<=n-k+1;i++){
ans=max(ans,pre[i-1]+suf[i+k]+max(sum[i+k-1]-sum[i-1],0ll));
}
printf("%lld\n",ans);
} | #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[i - 1] + max(a[i], 0);
for(int i = n; i; --i) r[i] = r[i + 1] + max(a[i], 0);
for(int i = k; i <= n; ++i) ans = max(ans, r[i + 1] + l[i - k] + max(sum[i] - sum[i - k], 0ll));
cout << ans << endl;
return 0;
} | 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>
#define pll pair<ll, ll>
#define pint pair<int, int>
#define S second
#define F first
#define all(c) (c).begin(),(c).end()
using namespace std;
ll max(ll a, ll b){ if(a>b)return a;return b;}
ll min(ll a, ll b){ if(a < b) return a;return b;}
const int N = 10000001;
ll factorialNumInverse[N + 1];
ll naturalNumInverse[N + 1];
ll fact[N + 1];
void InverseofNumber(ll p)
{
naturalNumInverse[0] = naturalNumInverse[1] = 1;
for (int i = 2; i <= N; i++)
naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p;
}
void InverseofFactorial(ll p)
{
factorialNumInverse[0] = factorialNumInverse[1] = 1;
for (int i = 2; i <= N; i++)
factorialNumInverse[i] = (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p;
}
void factorial(ll p)
{
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = (fact[i - 1] * i) % p;
}
}
ll Binomial(ll N, ll R, ll p)
{
if(N < R || R < 0) return 0;
ll ans = ((fact[N] * factorialNumInverse[R])
% p * factorialNumInverse[N - R])
% p;
return ans;
}
void solve()
{
ll p = 1000000007;
InverseofNumber(p);
InverseofFactorial(p);
factorial(p);
int n;
cin>>n;
vi a(n+1);
rep(i, n+1) cin>>a[i];
map<int, int> m;
rep(i, n+1)
{
m[a[i]]++;
}
int twice = 0;
rep(i, n + 1)
{
if(m[a[i]] > 1)
{
twice = a[i];
}
}
int pos1 = -1, pos2;
rep(i, n + 1)
{
if(a[i] == twice && pos1 == -1)
{
pos1 = i;
}
else if(a[i] == twice)
{
pos2 = i;
}
}
int d = pos2 - pos1;
for(int k = 1; k <= n + 1; ++k)
{
ll ret = Binomial(n + 1, k, p) - Binomial(n - d, k - 1, p);
ret = (ret % p + p) % p;
cout << ret << endl;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T=1;
int t=0;
while(t++<T)
{
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} | #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;
}
}
long long sol(long long a,long long b,long long n){
long long x,y;
long long d=gcd(a,n,x,y);
x%=n;x+=n;x%=n;
return x*(b/d)%(n/d);
}
LL c(LL n,LL m){
if (m>n) return 0;
return ((f[n]*sol(f[m],1,mo))%mo*sol(f[n-m],1,mo))%mo;
}
int main()
{
int n,i,x,r;
f[0]=1;
for (i=1;i<maxn;i++) f[i]=(f[i-1]*i)%mo;
while (scanf("%d",&n)!=-1){
for (i=1;i<=n;i++) h[i]=0;
for (i=1;i<=n+1;i++){
scanf("%d",&x);
if (h[x]) r=n+1-(i-h[x]+1);
h[x]=i;
}
for (i=1;i<=n+1;i++){
printf("%lld\n",(c(n+1,i)-c(r,i-1)+mo)%mo);
}
}
return 0;
} | 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) v.erase(unique(v.begin(), v.end()), v.end());
#define MINS(m, s) m.insert(make_pair(s, 1));
#define MFIN(m, s) m.find(s) != m.end()
#define INF (1 << 29)
const int mod = 1000000007;
int main() {
ll n, tmp;
bool flag = true;
map<ll, ll> m;
cin >> n;
for(ll i = 0; i < n; i++) {
cin >> tmp;
if(MFIN(m, tmp)) {
flag = false;
} else {
MINS(m, tmp);
}
}
if(flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #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 >> n;
int i = 0;
while (pow(2,i) <= n) {
i++;
}
i--;
cout << pow(2,i) << endl;
} | 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 << "Yay!" << '\n';
else cout << ":(" << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
} | #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) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll a,b; cin >> a >> b;
if(a <= 8 && b <= 8) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 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;
else
cout << "No"<<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]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #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(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
bool flag = true;
if(N%2 == 0){
REP(i, N/2){
if (S[i] != S[N/2+i]) {
flag = false;
break;
}
}
}
else flag = false;
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | 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 <numeric>
#include <functional>
#include <climits>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
class node{
public:
node* p;
auto_ptr<node> n;
int v;
bool null;
node(node* p_, node* n_, int v_): p(p_), n(n_), v(v_), null(false){}
node(node* p_, node* n_): p(p_), n(n_), null(true){}
};
class list{
public:
auto_ptr<node> f;
node* l;
list(): f(new node(NULL, NULL)), l(new node(NULL, NULL)){
f->n.reset(l);
l->p = f.get();
}
void insert(int v){
node* p = f.get();
node* n = f->n.release();
f->n.reset(new node(p, n, v));
n->p = f->n.get();
}
void del(node* pos){
if(pos == NULL) return;
node* pre = pos->p;
node* next = pos->n.release();
pre->n.reset(next);
next->p = pre;
}
node* find(int x){
for(node* cur = f->n.get(); cur != l; cur = cur->n.get()){
if(cur->v == x) return cur;
}
return NULL;
}
bool empty(){
return f->n.get() == l;
}
void delf(){
if(empty()) return;
del(f->n.get());
}
void dell(){
if(empty()) return;
del(l->p);
}
void print(){
vector<int> buf;
for(node* cur = f->n.get(); cur != l; cur = cur->n.get()){
buf.push_back(cur->v);
}
for (size_t i = 0; i < buf.size()-1; i++) {
cout << buf[i] << " ";
}
cout << buf.back() << endl;
}
};
int main(int argc, char *argv[]){
size_t n;
cin >> n;
list l;
string buf;
char com[20];
int key;
for (size_t i = 0; i < n; i++ ){
scanf("%s%d", com, &key);
if ( com[0] == 'i' ) {l.insert(key);}
else if ( com[0] == 'd' ) {
if (strlen(com) > 6){
if ( com[6] == 'F' ) l.delf();
else if ( com[6] == 'L' ) l.dell();
} else {
l.del(l.find(key));
}
}
}
l.print();
return 0;
} | #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 != nil){
t->prev->next = t->next;
t->next->prev = t->prev;
t->prev = NULL;
t->next = NULL;
delete t;
}
}
void delete_cell(int x)
{
Node *cell;
cell = new Node;
cell = nil->next;
while(cell->key != x && cell != nil)
cell = cell->next;
deleteNode(cell);
}
void deleteFirst()
{
deleteNode(nil->next);
}
void deleteLast()
{
deleteNode(nil->prev);
}
int main()
{
nil = new Node;
nil->prev = nil;
nil->next = nil;
int n, k;
scanf("%d", &n);
for(int i = 0; i < n; i++){
char s[20], c;
scanf("%s%d", s, &k);
if(s[0] == 'i'){
insert_cell(k);
}else{
if(s[6] == 'F')
deleteFirst();
else if(s[6] == 'L')
deleteLast();
else
delete_cell(k);
}
}
Node *p;
p = new Node;
p = nil->next;
for(int i = 0; p != nil; i++, p = p->next)
if(i)
cout << " " << p->key;
else
cout << p->key;
delete p;
cout << endl;
} | 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>> ans;
rep(i, n-1) {
ans.push_back(make_pair(1, i+2));
}
rep(i, n-1) {
if (now == k) break;
if(i == n-2)ans.push_back(make_pair(i+2, 2));
else ans.push_back(make_pair(i+2, i+3));
now--;
}
for(int i = 2; i <= n-2; i++) {
for(int j = i+2; j <= n; j++) {
if (now == k) break;
if(i==2 && j==n) continue;
ans.push_back(make_pair(i, j));
now--;
}
}
cout << ans.size() << endl;;
for(auto t: ans) printf("%d %d\n", t.first, t.second);
return 0;
} | #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()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n,k;
cin>>n>>k;
int mx = (n-1)*(n-2)/2;
if(k>mx){
cout<<"-1"<<endl;
return 0;
}
vp uv;
int cnt =0;
rep(i,n-1){
uv.emplace_back(i+1,n);
}
rep(i,n-1){
rep(j,i){
if(cnt>=mx-k)continue;
uv.emplace_back(i+1,j+1);
cnt++;
}
}
cout<<sz(uv)<<endl;
for(auto it: uv){
cout<<it.fi<<" "<<it.se<<endl;
}
return 0;
} | 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].push_back({Y,i + 1});
}
vector <string> out(m + 1,"");
for(int i = 1;i <= n;++i){
sort(p[i].begin(),p[i].end());
for(int j = 0;j < (int)p[i].size();++j){
string i1 = to_string(i);
string ap = "";
for(int k= 0;k < 6 - (int)i1.length();++k){
ap = ap + "0";
}
reverse(i1.begin(),i1.end());
i1 = i1 + ap;
ap = "";
string j2 = to_string(j + 1);
for(int k = 0;k < 6 - (int)j2.length();++k){
ap = ap + "0";
}
reverse(j2.begin(),j2.end());
j2 = j2 + ap;
out[p[i][j].second] = j2 + i1;
reverse(out[p[i][j].second].begin(),out[p[i][j].second].end());
}
}
for(int i = 1;i <= m;++i) cout << out[i] << newl;
return;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(10);
#ifdef EXECUTE_LOCALLY
freopen("in.txt","r",stdin);
#endif
int t = 1;
while(t--) solve();
#ifdef EXECUTE_LOCALLY
cout << setprecision(3) << "program time: " << (double)clock() / CLOCKS_PER_SEC << newl;
#endif
return 0;
} | #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=998244353;
string num(ll a,ll b){
string x="";
string y=x;
while(a){
x.pb('0'+a%10);
a/=10;
}
while(sz(x)<6){x.pb('0');}
reverse(x.begin(),x.end());
while(b){
y.pb('0'+b%10);
b/=10;
}
while(sz(y)<6){y.pb('0');}
reverse(y.begin(),y.end());
return x+y;
}
int main() {
int N,M;
cin>>N>>M;
vector<map<ll,int>> city(N+1);
rep(i,M){
int p;ll y;
cin>>p>>y;
city[p][y]=i;
}
vector<string> ans(M);
rep(i,N+1){
if(city.at(i).size()==0)continue;
int cnt=0;
for(LP C:city.at(i)){
cnt++;
ans.at(C.second)=num(i,cnt);
}
}
rep(i,M){
cout<<ans.at(i)<<endl;
}
} | 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 << solve(n) << endl;
} | #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 <cstdlib>
#include <ctime>
#include <queue>
#include <unordered_map>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln cout << endl;
#define vi vector<int>
#define vll vector<long long>
#define sortl(vec) sort(vec.begin(), vec.end());
#define sortr(vec) sort(vec.rbegin(), vec.rend());
#define forn(i, x, n) for(long long i = x; i < n; i++)
#define revn(i, n, x) for(long long i = n; i >= x; i--)
#define in(vec) for(auto &it : vec) cin >> it;
#define loop(vec) for(auto &it : vec)
#define out(vec) for(auto &it : vec) cout << it << " "; ln
#define ll long long
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define um unordered_map
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define pi 3.14159265359
#define o(x) cout << x << endl;
#define CLOCK cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
using namespace std;
ll bS(ll l, ll r, ll x, vll arr) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
void primeFactors(ll n) {
while (n % 2 == 0) {
n = n / 2;
}
for (ll i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
n = n / i;
}
}
if (n > 2)
cout << n << " ";
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modulo(ll a, ll b) {
ll c = a % b;
return (c < 0) ? c + b : c;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
fastio
ll t = 1;
while (t--) {
ll n;
cin >> n;
if (n & 1) {
o(0)
return 0;
}
n /= 2;
ll count = 0;
for (ll i = 5; n / i >= 1; i *= 5)
count += n / i;
o(count)
}
CLOCK
return 0;
} | 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 priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N; cin>>N;
vector<string> S(N);
rep(i,0,N) cin>>S[i];
int ans=0;
rep(i,0,N){
vector<string> T(N);
rep(j,0,N){
rep(k,0,N){
T[j]+=S[j][(k+i)%N];
}
}
bool flag=1;
rep(j,0,N){
rep(k,0,N){
if(T[j][k]!=T[k][j]) flag=0;
}
}
ans+=flag*N;
}
cout<<ans<<endl;
} | #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 = 0;
int a = 0;
for (int b = 0; b < N; ++b) {
bool sym = true;
for (int y = 0; y < N - 1 && sym; ++y) {
for (int x = y + 1; x < N && sym; ++x) {
int y1 = (y + a) % N;
int x1 = (x + b) % N;
int y2 = (x + a) % N;
int x2 = (y + b) % N;
if (S[y1][x1] != S[y2][x2]) {
sym = false;
}
}
}
if (sym) {
ans += N;
}
}
cout << ans << endl;
return 0;
} | 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++)
{
cin >> blueCard[i];
}
cin >> M;
map<int, string> redCard;
for (int i = 0; i < M; i++)
{
cin >> redCard[i];
}
vector<int> count(N);
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
if (blueCard[i] == blueCard[j])
count[i]++;
}
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
if (blueCard[i] == redCard[j])
count[i]--;
}
}
int res = getMaxValue(count);
cout << res << endl;
} | #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.begin(); itr != m.end(); itr++) {
ans = max(ans, itr->second);
}
printf("%d\n", ans);
return 0;
} | 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)
#define forn(i) for(int i = 0;i < n; ++i)
#define form(i,n) for(int i = 0 ;i < n; ++i)
#define NIL -1
const ll mod = 998244353;
int n;
int m;
int ans = 0;
int main(){
cin >> n;
bool flg = false;
for (int i = 1; i*(i + 1) <= 2 * n; i++) {
if (i*(i + 1) == 2 * n) {
flg = true;
m = i;
break;
}
}
if (!flg) {
cout << "No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
cout << m + 1 << endl;
for (int i = 0; i < m+1; i++) {
cout << m;
int pr=i;
for (int j = 0; j < i; j++) {
cout << " "<<pr ;
pr += m - j - 1;
}
pr += 1;
for (int j = 0; j < m - i; j++) {
cout << " "<< pr;
pr++;
}
cout << endl;
}
return 0;
} | #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 long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
int N;
vector<int> ans[1010];
void _main() {
cin >> N;
int K = -1;
rep(k, 2, 1010) if (k * (k - 1) / 2 == N) K = k;
if (K < 0) {
printf("No\n");
return;
}
int x = 1;
rep(a, 0, K) rep(b, a + 1, K) {
ans[a].push_back(x);
ans[b].push_back(x);
x++;
}
printf("Yes\n%d\n", K);
rep(k, 0, K) {
printf("%d", ans[k].size());
fore(i, ans[k]) printf(" %d", i);
printf("\n");
}
} | 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(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s;
while(1){
getline(cin,s);
if(s==".")break;
stack<char> st;
bool ans = true;
FOR(i,0,s.size()){
if(s[i]=='('||s[i]=='['){
st.push(s[i]);
}else if(s[i]==')'){
if(st.size()==0){
ans = false;
}else{
if(st.top()=='(')st.pop();
else ans = false;
}
}else if(s[i]==']'){
if(st.size()==0){
ans = false;
}else{
if(st.top()=='[')st.pop();
else ans = false;
}
}
}
if(st.size()!=0)ans = false;
if(ans){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
}
} | #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); ++I)
typedef long long ll;
int main()
{
string s;
while(getline(cin, s)) {
if(s[0] == '.' && s.length() == 1) return 0;
stack<char> st;
bool ok = true;
FOR(i,0,s.length()) {
if(s[i] == '(' || s[i] == '[') st.push(s[i]);
if(s[i] == ')' || s[i] == ']') {
if(st.empty()) {
ok = false;
break;
}
char c = st.top(); st.pop();
if(s[i] == ')' && c == '[') {
ok = false;
break;
}
if(s[i] == ']' && c == '(') {
ok = false;
break;
}
}
}
if(!st.empty()) ok = false;
puts(ok?"yes":"no");
}
return 0;
} | 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 >> sta >> goa;
tab[sta][goa]++;
tab[goa][sta]++;
}
vector<int > vc;
REP1(i, n) vc.push_back(i);
bool ch;
do{
ch = true;
REP(i, n-1) if(tab[vc[i]][vc[i+1]]==0) ch = false;
if(ch) ans++;
}while(next_permutation(vc.begin()+1, vc.end()));
cout << ans << endl;
} | #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;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;
int main() {
int n, m;
scanf("%d%d", &n, &m);
bool G[n][n];
rep(i, n) rep(j, n) G[i][j] = false;
rep(i, m) {
int a, b;
scanf("%d%d", &a, &b);
--a;
--b;
G[a][b] = G[b][a] = true;
}
int p[n];
iota(p, p + n, 0);
int ans = 0;
do {
bool flag = true;
rep(i, n - 1) if (!G[p[i]][p[i + 1]]) {
flag = false;
break;
}
ans += flag;
} while (next_permutation(p + 1, p + n));
printf("%d\n", ans);
} | 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;
cin>>n>>a>>b;
if(a>b) cout<<0;
else if(n==1){
if(a==b) cout<<1;
else cout<<0;
}
else cout<<(b-a)*(n-2)+1;
} | #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]==a[1] && a[1]==a[2])){
sort(a.begin(),a.end());
if(a[1]==a[2]){
a[0]+=2;
++ans;
}
else if(a[0]==a[1]){
++a[0];
++a[1];
++ans;
}
else{
a[0]+=2;
++ans;
}
}
cout << ans << endl;
return 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 - mn) % 2 == 0) ans += (md - mn)/2;
else ans += (md - mn + 1)/2 + 1;
cout << ans << endl;
return 0;
} | 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("%d\n",C-(A-B));
}
return 0;
} | #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];
max = (max >= S)?max:S;
}else if(count > k){
S -= array[i-k];
S += array[i];
max = (max >= S)?max:S;
}else{
S += array[i];
}
}
printf("%d\n",max);
}
return 0;
} | #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)
{
for(int j = 0; j < m; j++)
{
memo[i] += num[i-j];
}
}
else if(i > m-1)
{
memo[i] = memo[i-1] + num[i] - num[i-m];
}
}
for(int i = m - 1; i < n; i++)
{
result = max(result,memo[i]);
}
cout << result << endl;
result = -100005;
}
return 0;
} | 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++){
if(values[i] > values[i - 1]){
long long buy_count = money / values[i - 1];
money += (long long)buy_count * (values[i] - values[i - 1]);
}
}
cout << money << endl;
return 0;
} | 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 tmp=(1LL<<d)%MOD;
ll ans=(zero*one)%MOD*tmp%MOD;
res=(res+ans)%MOD;
}
while(res<0)res+=MOD;
res=res%MOD;
cout<<res<<endl;
} | #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;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll sum = 0;
ll times = 0;
while(times < 65){
ll cnt1 = 0,cnt0 = 0;
ll b_sum = 0;
for(int i = 0; i < n; i++){
if(a[i] % 2 == 1) cnt1++;
}
cnt0 = n-cnt1;
for(int i = 0; i < n; i++){
if(a[i] % 2 == 1){
cnt1--;
b_sum += cnt0;
}else{
cnt0--;
b_sum += cnt1;
}
a[i] /= 2;
}
b_sum%=MOD;
ll res = modpow(2,times,MOD)*b_sum;
sum += res%MOD;
sum %= MOD;
times++;
}
cout << sum << endl;
return 0;
} | 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[i + 1] = acum[i] + arr[i];
map<ll, ll> ans;
rep(i, 0, N + 1){
ans[acum[i]]++;
}
ll sum = 0;
for(auto x: ans){
ll num = x.second;
sum += num * (num - 1) / 2;
}
cout << sum << endl;
} | #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> static void getint(_T& a) {
const char* fmt = " %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b) {
const char* fmt = " %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template<class _T> static void getint(_T& a, _T& b, _T& c) {
const char* fmt = " %d %d %d";
if (sizeof(_T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static void AGC023A();
#if 1
int main()
{
AGC023A();
fflush(stdout);
return 0;
}
#endif
static void AGC023A()
{
int N;
getint(N);
std::vector<LLONG> an(N, 0);
for (int i = 0; i < N; i++) {
getint(an[i]);
}
LLONG sum = 0;
std::map<LLONG, LLONG> summap;
summap[0] = 1;
for (int i = 1; i <= N; i++) {
sum = sum + an[i - 1];
summap[sum]++;
}
LLONG ans = 0;
for (auto it = summap.begin(); it != summap.end(); it++) {
ans += (it->second * (it->second - 1LL)) / 2LL;
}
printf("%lld\n", ans);
} | 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++;
cout << (char)i << " : " << s << endl;}
} | #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++ ) {
cout<<char('a'+i)<<" : "<<alphas[i]<<endl;
}
return 0;
} | 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();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;
int main() {
const int coin[] = {500,100,50,10,5,1};
vector<int> dp(1000,INF);
dp[0] = 0;
REP(i,1000)
REP(k,6)
if (i+coin[k] < 1000)
dp[i+coin[k]] = min(dp[i+coin[k]], dp[i] + 1);
int n;
while(cin>>n,n) {
cout << dp[1000-n] << endl;
}
} | #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 -= 50;
}
while(oturi>=10)
{
onum++;
oturi -= 10;
}
if(oturi >= 5)
{
onum++;
oturi -= 5;
}
while(oturi>=1)
{
onum++;
oturi -= 1;
}
cout << onum << endl;
}
return 0;
} | 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+7;
#define REP(i,n) for (int i = 0; i <(n); ++i)
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
string a,b;
cin >> a >> b;
if(a.size() > b.size()){
cout << "GREATER" << endl;
}
else if(a.size() < b.size()){
cout << "LESS" << endl;
}
else{
if(a > b) cout << "GREATER" << endl;
else if (a < b) cout << "LESS" << endl;
else cout << "EQUAL" << endl;
}
return 0;
} | #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]){
cout << "GREATER";
return 0;
}
else if(A[i] < B[i]){
cout << "LESS";
return 0;
}
}
cout << "EQUAL";
}
} | 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);
#define txto freopen("output.txt", "w", stdout);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return vector< vector<ll> >(n, vector<ll>(m));}
bool compare(char &s1,char &s2){return s1 > s2;}
bool sortmahstyle(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
if(a.second > b.second )
return true;
if( a.second==b.second && a.first > b.second )
return true;
return false;
}
ll const mod = 1e9+7;
ll const inf = 1e6+2;
ll fact[inf];
void factfill()
{
fact[0]=1;
for(ll i=1; i<inf; i++)
fact[i] = ( fact[i-1]*i ) % mod;
}
ll powmod(ll a, ll b)
{
ll res = 1;
while(b){
if(b%2) res = ( res*a )%mod;
a = (a*a)%mod;
b/=2;
}
return res;
}
ll inv(ll x)
{
return powmod(x,mod-2) % mod;
}
ll choose(ll n, ll r)
{
return ( (fact[n]* inv(fact[n-r] ) )%mod *inv(fact[r]))%mod;
}
void solve()
{
string s; cin >> s;
ll n; n = s.size();
f(i,0,n-1){
if(s[i]==s[i+1]){
cout << i+1 << " "<< i+2 << endl;
return;
}
}
f(i,0,n-2){
if(s[i]==s[i+2]){
cout << i+1 << " "<< i+3 << endl;
return;
}
}
cout << "-1 -1";
}
int main() {
Knucklehead
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t;
t=1;
f(testcases,0,t){
solve();
}
return 0;
} | #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);
string s;
int i=1,flag = 0, l, r;
cin >> s;
if(s.length() == 2) {
if(s[0] == s[1]) {
flag = 1;
l = 0; r = 1;
}
} else {
while(s[i]) {
if(s[i+1]) {
if((s[i] == s[i-1]) || (s[i] == s[i+1]) || (s[i-1] == s[i+1])) {
l = i-1 ; r = i+1;
flag = 1;
break;
}
}
i++;
}
}
if(flag) {
cout << l+1 << ' ' << r+1;
} else cout << -1 << ' ' << -1;
cout << "\n";
return 0;
} | 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","dreamer","erase","eraser"};
string s;
bool dfs(int i = 0){
if(i==s.size()) return true;
bool res = false;
for(const string& ti:t){
if(i+ti.size()>s.size()) continue;
string si = s.substr(i,ti.size());
if(si!=ti) continue;
if(dfs(i+si.size())) return true;
}
return false;
}
int main() {
cin >> s;
cout << (dfs()?"YES":"NO") << endl;
} | #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(divide[i].begin(), divide[i].end());
bool can = true;
for (int i = 0; i < S.size();) {
bool can2 = false;
for (int j = 0; j < 4; ++j) {
string d = divide[j];
if (S.substr(i, d.size()) == d) {
can2 = true;
i += d.size();
}
}
if (!can2) {
can = false;
break;
}
}
if (can) cout << "YES" << endl;
else cout << "NO" << endl;
} | 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;
}
inline ll inverse(int x){ return pow(x, mod - 2); }
typedef std::vector<ll> vec;
int n;
vec v;
ll ans;
inline void solve(vec & x) {
ll v = x.back() - n; x.pop_back();
for(ll & i : x) ++ i;
x.insert(std::lower_bound(x.begin(), x.end(), v), v);
++ ans;
}
inline ll _try(vec x) {
for(int i = 0;i < x.size();++i) {
ll v = x.back() - n; x.pop_back();
for(ll & i : x) ++ i;
if(x.size() && v > x.front()) return -1e18;
x.insert(x.begin(), v);
}
return x.front();
}
inline void big_do(vec & x) {
for(int j = 0;j < n;++j) {
if((j ? x[j - 1] : 0) + n - j <= _try(vec(x.begin() + j, x.end()))) {
const int pre_add = n - j, suf_dec = n - pre_add + 1;
const ll cnt = (x[j] - (j ? x[j - 1] : 0)) / (pre_add + suf_dec);
if(pre_add * j - suf_dec * (n - j) != -(n - j)) exit(1);
ans += cnt * pre_add;
for(int i = 0;i < j;++i) x[i] += pre_add * cnt;
for(int i = j;i < n;++i) x[i] -= suf_dec * cnt;
break;
}
}
}
const int S = 50;
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
rep(i, 1, n) {
ll x; cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for(;;) {
if(*std::max_element(v.begin(), v.end()) < n) break;
static int cnt = 0;
++cnt % 2 ? big_do(v) : solve(v);
}
cout << ans << '\n';
} | #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,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
ll n;cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
vector<ll>cnt(n);
ll sum=0;
bool f=0;
ll ans=0;
while(!f){
bool ff=1;
sum=0;
rep(i,n)cnt[i]=0;
rep(i,n){
if(a[i]>=n){
ff=0;
ll s=a[i]-n+1;
cnt[i]=(s-1)/n+1;
sum+=cnt[i];
a[i]-=cnt[i]*n;
}
}
f|=ff;
ans+=sum;
rep(i,n){
a[i]+=sum-cnt[i];
}
}
cout<<ans<<endl;
} | 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].resize(N, INF);
D[i][i] = 0;
}
for(int i=0;i<R;i++) {
cin >> Rs[i];
Rs[i]--;
}
for(int i=0;i<M;i++) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
D[a][b] = c;
D[b][a] = c;
}
for(int k=0;k<N;k++) {
for(int i=0;i<N-1;i++) {
for(int j=i+1;j<N;j++) {
D[i][j] = min(D[i][j], D[i][k]+D[k][j]);
D[j][i] = D[i][j];
}
}
}
vector<int> v;
for(int i=0;i<min(R,min(8LL, N));i++) {
v.push_back(i);
}
ans = INF;
do {
tmp = 0;
for(int i=0;i<min(R,min(8LL, N))-1;i++) {
tmp += D[Rs[v[i]]][Rs[v[i+1]]];
}
ans = min(ans, tmp);
} while (next_permutation(v.begin(), v.end()));
cout << ans << endl;
return 0;
} | #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 rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned int
#define test int t;cin>>t; while(t--)
#define um unordered_map
#define en '\n'
#define us unordered_set
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(x) (int)x.size()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
const int gf = 1e6 + 9;
int dp[209][209];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
int n, m, r;
cin >> n >> m >> r;
int a[r];
zip(i, 0, r)
{
cin >> a[i];
}
sort(a, a + r);
zip(i, 0, 208)
zip(j, 0, 208)
if (i != j)
dp[i][j] = inf;
zip(i, 0, m)
{
int a, b, c;
cin >> a >> b >> c;
if (dp[a][b] > c)
{
dp[a][b] = dp[b][a] = c;
}
}
zip(k, 1, n + 1)
{
zip(i, 1, n + 1)
{
zip(j, 1, n + 1)
{
dp[i][j] = min(dp[i][k] + dp[k][j], dp[i][j]);
}
}
}
int ans = inf;
do {
int cnt = 0;
zip(i, 1, r)
{
int p1 = a[i - 1];
int p2 = a[i];
cnt += dp[p1][p2];
}
ans = min(ans, cnt);
} while (next_permutation(a, a + r));
cout << ans << en;
return 0;
} | 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 "numeric"
#include "bitset"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 1e-7;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<set<int>>edge(N);
for (int i = 1; i < N; i++) {
cin >> L >> R;
L--;
R--;
edge[L].insert(R);
edge[R].insert(L);
}
queue<int>Q;
int three = 0;
for (int i = 0; i < N; i++) {
if (edge[i].size() == 1)Q.push(i);
else if (edge[i].size() >= 3)three++;
}
while (three) {
if (Q.empty()) {
cout << "First\n";
return 0;
}
vector<vector<int>>parent(N);
set<int>nxq;
while (!Q.empty()) {
int cn = Q.front();
int node = 0;
int n = cn;
int nx = n;
int depth = 0;
Q.pop();
while (edge[nx].size() < 2) {
node++;
n = nx;
nx = *edge[n].begin();
edge[n].erase(nx);
edge[nx].erase(n);
}
if (edge[nx].size() == 2)three--;
if (node % 2) {
edge[n].insert(nx);
edge[nx].insert(n);
if (edge[nx].size() == 3)three++;
parent[nx].push_back(n);
}
if (edge[nx].size() == 2)nxq.insert(nx);
if (!three) {
node = 0;
for (auto i : edge)if (i.size() == 2)node++;
if (node % 2)cout << "First\n";
else cout << "Second\n";
return 0;
}
}
for (int i = 0; i < N; i++) {
if (edge[i].size() == 1)Q.push(i);
}
if (clock() > CLOCKS_PER_SEC * 1900 / 1000) {
cout << "First\n";
return 0;
}
}
int node = 0;
for (auto i : edge)if (i.size() == 2)node++;
if (node % 2)cout << "First\n";
else cout << "Second\n";
return 0;
} | #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])) {
ass[v] = u;
return true;
}
}
return false;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i = 1; i <= n-1; ++i) {
int u, v; cin >> u >> v;
a[u].push_back(v);
a[v].push_back(u);
}
for(int i = 1; i <= n; ++i) {
++t;
res += visit(i);
}
cout << (res == n ? "Second" : "First");
} | 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;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}
vector<int> g[MAX];
bool visited[MAX];
int entry[MAX];
list<int> out;
int v;
void tsort() {
rep (i, v) entry[i] = 0;
rep (i, v) {
rep (j, g[i].size()) {
int c = g[i][j];
entry[c]++;
}
}
rep (i, v) {
if (entry[i] == 0 && !visited[i]) bfs(i);
}
for (auto iter = out.begin(); iter != out.end(); iter++) {
cout << *iter << endl;
}
}
void bfs(int s) {
queue<int> q;
q.push(s);
visited[s] = true;
while (!q.empty()) {
int t = q.front();
q.pop();
out.push_back(t);
rep (i, g[t].size()) {
int u = g[t][i];
entry[u]--;
if (entry[u] == 0 && !visited[u]) {
q.push(u);
visited[u] = true;
}
}
}
}
int main() {
int e;
cin >> v >> e;
rep (i, v) visited[i] = false;
rep (i, e) {
int s, t;
cin >> s >> t;
g[s].push_back(t);
}
tsort();
return 0;
} | #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(size_);
for(const auto& es:edges){
for (auto e : es) {
nums[e]++;
}
}
queue<int>que;
for (int i = 0; i < size_; ++i) {
if (!nums[i]) {
que.push(i);
}
}
vector<int>topo;
while (!que.empty()) {
int ver(que.front());
topo.push_back(ver);
que.pop();
for (auto e : edges[ver]) {
nums[e]--;
if (!nums[e])que.push(e);
}
}
if (topo.size() == size_)return topo;
else return vector<int>();
}
int main() {
int V, E; cin >> V >> E;
vector<vector<int>>edges(V);
for (int i = 0; i < E; ++i) {
int s, t; cin >> s >> t;
edges[s].push_back(t);
}
auto vs=topo_sort(edges);
for (auto v : vs) {
cout << v << endl;
}
return 0;
} | 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, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << '\n';
} | 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 gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
#define cout15(a) printf("%.15f\n",a)
template<class T>inline bool chmin(T& a,T b,bool f){
if(f==1){if(a>b){a=b;return true;}return false;}
else if(f==0){if(a<b){a=b;return true;}return false;}return false;}
typedef pair<ll,string> p;
using g = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n;cin>>n;
map<int,int>m{};
int ma=0;
rep(i,0,n){
int a;cin>>a;
m[a]++;
ma=max(a,ma);
}
int ans = 0;
irep(i,m){
if(i->second>=i->first)ans+=abs(i->second-i->first);
if(i->second<i->first)ans+=i->second;
}
cout<<ans<<nnn;
return 0;
} | #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];
}
rep(i, n)
{
mp[a[i]]++;
}
int ans = 0;
for (auto p : mp)
{
int x = p.first;
int cnt = p.second;
if (cnt < x)
{
ans += cnt;
}
else
{
ans += cnt - x;
}
}
cout << ans << endl;
return 0;
} | 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_bound(a.begin(),a.end(),(*it1)+1);
}
cout<<ans<<endl;
} | #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,l2[i]+l2[i-1]+l2[i+1]);
}
if(x)cout<<x;
else cout<<1;
return 0;
} | 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 chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> f(n + 1);
ll ans = 0;
REP(i, 1, n + 1){
for(int j = i; j <= n; j += i){
f[j]++;
}
ans += i * f[i];
}
print(ans);
} | #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);
}
return 0;
} | #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) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define range(i,a,n) for(int i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s; a=0;} return os;}
void OUT(bool b){cout<<(b?"YES":"NO")<<endl;}
void Out(bool b){cout<<(b?"Yes":"No")<<endl;}
void out(bool b){cout<<(b?"yes":"no")<<endl;}
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int clz(int x) { return 31 - __builtin_clz(x); }
int clz(ll x) { return 63 - __builtin_clzll(x); }
int ctz(int x) { return __builtin_ctz(x); }
int ctz(ll x) { return __builtin_ctzll(x); }
class compare {
public:
bool operator()(tuple<ll, ll> a, tuple<ll, ll> b) {
return (get<1>(a) > get<1>(b));
}
};
void solve(int n){
n=1000-n;
int ans=0;
int c[5]={500,100,50,10,5};
rep(i,5){
while(n-c[i]>=0){
ans++;
n-=c[i];
}
}
ans+=n;
cout<<ans<<endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n){
solve(n);
}
} | 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_i;
sunuke[a_i] += 1;
}
}
for(int i=0;i<N;i++){
if(sunuke[i+1] == 0) c++;
}
cout << c <<endl;
} | 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 count = 0;
for(int j=0;j<m;j++)
{
if(str[i][j] == '.')
{
count++;
left[i][j] = count;
}
else
count = 0;
}
}
for(int i=0;i<n;i++)
{
int count = 0;
for(int j=m-1;j>=0;j--)
{
if(str[i][j] == '.')
{
count++;
right[i][j] = count;
}
else
count = 0;
}
}
for(int i=0;i<m;i++)
{
int count = 0;
for(int j=0;j<n;j++)
{
if(str[j][i] == '.')
{
count++;
down[j][i] = count;
}
else
count = 0;
}
}
for(int i=0;i<m;i++)
{
int count = 0;
for(int j=n-1;j>=0;j--)
{
if(str[j][i] == '.')
{
count++;
up[j][i] = count;
}
else
count = 0;
}
}
int ans{};
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(str[i][j] == '.')
ans = max(ans,left[i][j] + right[i][j] + up[i][j] + down[i][j] - 3);
cout<<ans;
return 0;
} | #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 ans = 0;
int cc=1;
int tt=0;
rep(i,h)rep(j,w){
int tmp = 0;
if(a[i][j]==1){
++tmp;
cc=1;
while(a[i-cc][j]==1 && i-cc>=0){
++tmp;
++cc;
}
cc=1;
while(a[i+cc][j]==1 && i+cc<=h-1){
++tmp;
++cc;
}
cc=1;
while(a[i][j-cc]==1 && j-cc>=0){
++tmp;
++cc;
}
cc=1;
while(a[i][j+cc]==1 && j+cc<=w-1){
++tmp;
++cc;
}
}
ans=max(ans,tmp);
++tt;
if(ans>=1960 && tt>=100000)break;
}
cout<<ans<<endl;
return 0;
} | 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<ll> A(n), sum(n+1, 0);
rep(i,n){
cin>>A[i];
sum[i+1] = sum[i] + A[i];
}
sort(sum.begin(), sum.end());
map<ll, ll> mp;
for(auto s:sum){
mp[s]++;
}
ll ans=0;
for(auto m:mp){
ans+=m.second*(m.second-1)/2;
}
cout<<ans<<endl;
return 0;
} | #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;
cout<<k<<endl;
} | 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) << endl;
cnt2++;
}
}
}
int main() {
cin >> n >> m;
solve();
} | #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,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
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; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e10;
const ll MOD = 100000000;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
const ll MAX = 100;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m,x,y;
cin >> n >> m;
if (n%2){
x = 1,y = n;
rep(i,m){
cout << x << " " << y << endl;
x++;
y--;
}
}
else{
x = 1,y = n;
ll k = n/2;
rep(i,min(m,k/2)){
cout << x << " " << y << endl;
x++;
y--;
}
y--;
rep(i,m-k/2){
cout << x << " " << y << endl;
x++;
y--;
}
}
} | 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>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000
#ifdef LOCAL
#define dprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define dprintf(...) 0
#endif
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;
int main() {
string s, t;
cin >> s >> t;
cout << t + s << endl;
return 0;
} | 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(a); i--)
#define WRAP(y, x, h, w) (0 <= y && y < h && 0 <= x && x < w)
#define ALL(x) (x).begin(), (x).end()
int dx[4] ={ 1, 0, -1, 0 };
int dy[4] ={ 0, 1, 0, -1 };
int main()
{
double l;
cin>>l;
printf("%.8lf\n",(l/3)*(l/3)*(l/3));
} | #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; } return 0; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double l;cin >> l;
cout << std::fixed << std::setprecision(15) << l*l*l/27 << endl;
return 0;
} | 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 = sum - n;
for(auto x : ans) {
if(x != s) cout << x << endl;
}
return 0;
} | #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).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };
using LL = long long int;
using LD = long double;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int x = 0, y = 0;
FOR(i, 1, 100001) {
x += i;
if (n <= x) {
x = i;
break;
}
}
for (; n; x--) {
if (x <= n) {
cout << x << endl;
n -= x;
}
}
return 0;
} | 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((double)w / 2 == x && (double)h / 2 == y){
printf("%f 1\n", ans);
} else {
printf("%f 0\n", ans);
}
} | #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)cnt = 1;
cout << fixed << setprecision(10) << m << " " << cnt << endl;
} | 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]);
}
return 0;
} | #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++)
printf("%c : %d\n", ('a' + i), count[i]);
return 0;
} | 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;
int pos = 0;
string res = "";
for (int i = 0; i < s.length() - 1; i++) {
int k = stoi(s.substr(i, 1));
if (k == 0) {
} else if (s[i] == s[i + 1]) {
pos++;
} else {
res += keys[k].substr(pos % keys[k].length(), 1);
pos = 0;
}
}
cout << res << endl;
}
} | #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++){
string S;
cin >> S;
int N = S.size();
int cnt = 0;
int c = 0;
for (int j = 0; j < N; j++){
if (S[j] == '0'){
if (cnt != 0){
cout << ch[c][(cnt - 1) % ch[c].size()];
cnt = 0;
}
} else {
cnt++;
c = S[j] - '0';
}
}
cout << endl;
}
} | 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(int i=1;i<=2*h;i++)
{
for(int j=1;j<=w;j++)
{
p[i][j] = m[(i+1)/2][j];
}
}
for(int i=1;i<=2*h;i++)
{
for(int j=1;j<=w;j++)
{
cout << p[i][j];
}
cout << "\n";
}
return 0;
} | #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()
{
int N;
cin>>N;
while(N--)
{
int b,f,r,v;
cin>>b>>f>>r>>v;
int i=(b-1)*3+(f-1);
int j=r-1;
build[i][j]+=v;
}
for(int i=0;i<12;i++)
{
for(int j=0;j<10;j++)
{
cout<<" "<<build[i][j];
}
cout<<endl;
if((i!=0)&&(i%3==2))
{
if(i==11) break;
for(int k=0;k<20;k++) cout<<"#";
cout<<endl;
}
}
return 0;
} | #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 != 0 && j == 0) cout << "####################" << endl;
cout << " ";
cout << data[i][j];
}
cout << endl;
}
} | 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;
int a[n];
for( int i = 0 ; i < n ; i++ ) cin >> a[i];
sort( a , a + n );
for( int i = 0 ; i < n ; i++ ) {
y = 1;
if( i == n - 1 && a[i] != y ) {
x += y;
break;
} else {
for( int j = i + 1 ; j < n ; j++ ) {
if( a[j] == a[i] ) {
y++;
if( j == n - 1 ) {
if( a[i] < y ) x += y - a[i];
else if( a[i] > y ) x += y;
i = j;
break;
}
} else {
if ( a[i] > y ) x += y;
if ( a[i] < y ) x += y - a[i];
i = j - 1;
break;
}
}
}
}
cout << x;
} | #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 main(){
int a, b;
cin >> a >> b;
char c[100][100];
rep(i, 50) rep(j, 100) c[i][j] = '#';
rep(i, 50) rep(j, 100) c[i+50][j] = '.';
int x = 1, y = 1;
rep(j, a - 1){
c[y][x] = '.';
if (x + 2 < 100) x += 2;
else y += 2, x = 1;
}
x = 1, y = 51;
rep(j, b - 1){
c[y][x] = '#';
if (x + 2 < 100) x += 2;
else y += 2, x = 1;
}
cout << 100 << " " << 100 << endl;
rep(i, 100) {
rep(j, 100) cout << c[i][j];
cout << endl;
}
return 0;
} | #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;
const ll MOD=1e9+7;
ll A,B;
char c[101][101];
int main(){
cin>>A>>B;
for(ll i=0;i<50;i++){
for(ll j=0;j<100;j++){
c[i][j]='.';
}
}
for(ll i=50;i<100;i++){
for(ll j=0;j<100;j++){
c[i][j]='#';
}
}
P now=P(1,1);
for(ll i=0;i<B-1;i++){
c[now.first][now.second]='#';
now.second+=2;
if(now.second>100){
now.first+=2;
now.second=1;
}
}
now=P(51,1);
for(ll i=0;i<A-1;i++){
c[now.first][now.second]='.';
now.second+=2;
if(now.second>100){
now.first+=2;
now.second=1;
}
}
cout<<"100 100"<<endl;
for(ll i=0;i<100;i++){
for(ll j=0;j<100;j++){
cout<<c[i][j];
}cout<<endl;
}
return 0;
} | 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()) {
if (s[i] - '0' == d[idx])
idx++;
if (idx == 3) {
ans++;
break;
}
}
}
cout << ans << endl;
return 0;
} | #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;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 0, 1000) {
string t;
int x = i;
rep(j, 0, 3) {
t += '0' + x % 10;
x /= 10;
}
int ti = 0;
rep(j, 0, n) {
if (s[j] == t[ti]) {
ti++;
if (ti == 3) break;
}
}
if (ti == 3) ans++;
}
cout << ans << "\n";
} | 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(RALL((x)))
#define SZ(x) (int)(x).size()
#define debug(x) cerr << #x << " : " << x << '\n'
const int INF = 1e9;
const int MOD = 1e9 + 7;
const LL LINF = 1e18;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int ans;
int A, B;
cin >> A >> B;
ans = (A - 1) * (B - 1);
cout << ans << '\n';
return 0;
} | 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 << ")";
}
template <typename T>
void debug_out(vector<T> t) {
int sz = t.size();
for(int i = 0; i < sz; i++) {
debug_out(t[i]);
if(i != sz - 1) cerr << ", ";
}
}
template <typename T>
void debug_out(vector<vector<T>> t) {
int sz = t.size();
for(int i = 0; i < sz; i++) {
debug_out(t[i]);
if(i != sz - 1) cerr << endl;
}
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:" << endl, debug_out(__VA_ARGS__), cerr << endl;
int n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
vector<int> a(n);
range(i, 0, n) {
cin >> a[i];
}
bool easy = true;
range(i, 1, n) {
easy &= a[i] > a[i - 1];
}
if(easy) {
cout << 1;
return 0;
}
vector<pair<int, int>> one;
vector<pair<int, int>> other;
auto solve = [&](int s) {
one.clear(); other.clear();
one.emplace_back(0, a[0] - 1);
range(i, 1, n) {
if(a[i] > a[i - 1]) {
if(one.size() && one.back().second == a[i - 1] - 1) one.back().second = a[i] - 1;
else one.push_back(make_pair(a[i - 1], a[i] - 1));
continue;
}
while(one.size() && one.back().first >= a[i]) one.pop_back();
if(one.size()) one.back().second = min(one.back().second, a[i] - 1);
while(other.size() && other.back().first >= a[i]) other.pop_back();
if(one.empty() && other.empty()) {
return false;
}
int pos = INT_MIN;
if(one.size()) pos = one.back().second;
if(other.size()) pos = max(pos, other.back().first);
if(one.size() && one.back().second == pos) {
one.back().second--;
if(one.back().second < one.back().first) one.pop_back();
if(s > 2) other.emplace_back(pos, 2);
} else {
other.back().second++;
if(other.back().second == s) other.pop_back();
}
if(pos + 1 < a[i]) one.emplace_back(pos + 1, a[i] - 1);
}
return true;
};
int lo = 1, hi = n;
while(hi - lo > 1) {
int mid = (hi + lo) >> 1;
if(solve(mid)) hi = mid;
else lo = mid;
}
cout << hi;
return 0;
} | #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];
else stk[++ top] = 1, num[top] = a[i] - a[i - 1];
} else {
int x = a[i - 1] - a[i];
while(top && x >= num[top]) x -= num[top], -- top;
num[top] -= x;
int t = 0;
while(stk[top] == m) t += num[top], -- top;
if(!top) return false;
if(num[top] == 1) ++ stk[top];
else {
-- num[top], stk[top + 1] = stk[top] + 1, ++ top, num[top] = 1;
}
if(t) stk[++ top] = 1, num[top] = t;
}
}
return true;
}
int main(){
scanf("%d", &n);
for(Rint i = 1;i <= n;++ i) scanf("%d", a + i);
int l = 1, r = n, ans, mid;
while(l <= r){
mid = l + r >> 1;
if(check(mid)) ans = mid, r = mid - 1;
else l = mid + 1;
}
printf("%d\n", ans);
} | 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 = 1000000007;
int main() {
int n;cin >> n;
vector<ll> a(n), sum(n+1);
for(int i = 0; i < n; ++i){
cin >> a[i];
sum[i+1]=sum[i]+a[i];
}
ll ans = INF;
for(int i = 1; i < n; ++i){
ll x = sum[i];
ll y = sum[n]-sum[i];
ll tmp = abs(x-y);
ans = min(ans, tmp);
}
cout << ans << endl;
} | #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=MAX;
for(int i=1;i<n;i++)
{
minn=min(minn,abs((LL)(s-sum[i]-sum[i])));
}
printf("%lld\n",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++) {
ll temp_cost = 0;
bitset<14>b(i);
if (b.count() != k-1) continue;
ll height = a[0];
for (int j = 0; j < n-1; j++) {
if (i & (1 << j)) {
height++;
if (height < a[j+1]) height = a[j+1];
temp_cost += (height - a[j+1]);
}
else if (height < a[j+1]) height = a[j+1];
}
if (cost > temp_cost) cost = temp_cost;
}
cout << cost << endl;
} | #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;
ll a[20];
rep(i,n) {
cin>>a[i];
}
ll ans=99999999999999999;
for (int bit=0;bit<(1<<(n-1));bit++) {
int cnt=0;
ll m=a[0];
ll sum=0;
rep(i,n-1) {
if (bit & (1<<i)) {
cnt++;
if (a[i+1]-m<=0) {
sum+=m-a[i+1]+1;
m++;
}
else {
m=a[i+1];
}
}
else {
m=max(m,a[i+1]);
}
}
if (cnt>=k-1) {
ans=min(ans,sum);
}
}
cout<<ans<<endl;
} | 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;
}
cout << "yes" << endl;
return 0;
} | #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 << "yes";
else
cout << "no";
return 0;
} | 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]);
for (int i = 2; i < n; ++i) {
for (auto &v2 : s2)
s3.insert(v2 * 10 + vec[i]);
for (auto &v1 : s1)
s2.insert(v1 * 10 + vec[i]);
s1.insert(vec[i]);
}
cout << static_cast<int>(s3.size()) << endl;
} | #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++;
}
cout << ans << endl;
return 0;
} | 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.front());
b.pop_front();
}
}
else {
rep(i,n){
printf("%d ", b.back());
b.pop_back();
}
}
printf("\n");
} | #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 >> a[i];
}
int l = 0;
int r = n - 1;
bool useL = true;
for (int i = n - 1; i >= 0; --i) {
if (useL) {
b[l] = a[i];
l++;
useL = false;
} else {
b[r] = a[i];
r--;
useL = true;
}
}
rep(i, n) {
if (i != 0) printf(" ");
printf("%lld", b[i]);
}
printf("\n");
return 0;
} | 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;
int main() {
int n, d;
cin>>n>>d;
vector<vector<int>>x(n,vector<int>(d));
rep(i,n){
rep(j,d) cin>>x[i][j];
}
int ans = 0;
rep(i,n-1){
rrep(k,n-i-1){
double dist = 0;
rep(j,d){
dist += (x[i][j]-x[i+k][j])*(x[i][j]-x[i+k][j]);
}
if((int)sqrt(dist)*(int)sqrt(dist)==(int)dist){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
} | #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 = 0;i < N - 1;i++){
for(int j = i + 1;j < N;j++){
wa=0;
for(int k = 0;k < D;k++){
wa += (X.at(i).at(k) - X.at(j).at(k)) * (X.at(i).at(k) - X.at(j).at(k));
}
ans = sqrt(wa);
digi = 0;
while(digi < ans){
digi++;
}
if((ans-digi) == 0)
rs++;
}
}
cout << rs << endl;
} | 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 main() {
ll n;
cin >> n;
vector<ll> p(n), q(n), t(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
rep(i, n) t[i] = i + 1;
ll i = 0, pi, qi;
do {
if (t == p) pi = i;
if (t == q) qi = i;
++i;
} while (next_permutation(t.begin(), t.end()));
cout << abs(pi - qi) << endl;
} | #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];
for(int i=0; i<N; i++){
default_perm[i] = i+1;
}
int counter=0;
int counter_P = 0;
int counter_Q = 0;
do{
bool is_equal_P = isequal_array(P, default_perm, N);
bool is_equal_Q = isequal_array(Q, default_perm, N);
if(is_equal_P){counter_P = counter;}
if(is_equal_Q){counter_Q = counter;}
counter += 1;
}while(next_permutation(default_perm, default_perm+N));
cout << abs(counter_P - counter_Q) << endl;
return 0;
}
bool isequal_array(int *Array1, int *Array2, int N){
for(int i=0; i<N; i++){
if(Array1[i] != Array2[i]){
return false;
}
}
return true;
} | 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){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}
const ll mod=1'000'000'007;
const ll inf=1'000'000'000'000'000'00;
const int INF=1'000'000'000;
const double EPS=1e-10;
const double PI=acos(-1);
int main(){
cin.tie(0);ios::sync_with_stdio(false);
int n,m,x;
cin>>n>>m>>x;
vector<int> c(n);
vector a(n,vector<int>(m));
rep(i,n){
cin>>c[i];
rep(j,m){
cin>>a[i][j];
}
}
int ans=INF;
rep(S,1<<n){
vector<int> now(m,0);
int cnt=0;
rep(i,n){
if(S & 1<<i){
rep(j,m){
now[j]+=a[i][j];
}
cnt+=c[i];
}
}
bool flag=true;
rep(j,m){
if(now[j]<x) flag=false;
}
if(flag) chmin(ans,cnt);
}
if(ans==INF) cout<<-1<<endl;
else cout<<ans<<endl;
} | #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);
}
}
int min_cost = 12345678;
for (int bit = 0; bit < (1 << N); bit++) {
int sum_cost = 0;
vector<int> sum_A(M);
for (int i = 0; i < N; i++) {
if (bit & (1 << i)) {
sum_cost += C.at(i);
rep (j, M) sum_A.at(j) += A.at(i).at(j);
}
}
bool ok_flag = true;
rep(i, M) if (sum_A.at(i) < X) ok_flag = false;
if (ok_flag) min_cost = min(min_cost, sum_cost);
}
if (min_cost == 12345678) cout << "-1" << endl;
else cout << min_cost << endl;
return 0;
} | 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 main(){
fill(value, value+MAXN, NIL);
int n;
scanf("%d", &n);
printf("%d\n", fibonacci(n));
} | #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);
}
}
int main() {
int n;
std::cin >> n;
std::cout << fibonacci(n) << std::endl;
return 0;
} | 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 int, string>
#define rep(a,b) for(ll i=a;i<b;i++)
#define rep0(n) for(ll i=0;i<n;i++)
#define repi(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int) (a); i >= (int) (b); --i)
#define FORE(it, c) for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof (a))
#define FOR repi
ll max(ll a, ll b) { return (a > b)? a : b;}
int min(int a, int b) { return (a < b)? a : b;}
int solve()
{
int n,k;
cin>>n>>k;
cout<<max(0,n-k+1);
}
signed main()
{
int t=1;
while(t--)
{
solve();
}
} | #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 INF=1e9;
const ll IINF=1e18;
template<class T> inline bool chmin(T &a,T b){
if (a>b){a=b; return true;} return false;
}
template<class T> inline bool chmax(T &a,T b){
if (a<b){a=b; return true;} return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K; cin >> N >> K;
cout << N-K+1 << '\n';
} | 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++;
cout << ans << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
} | #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<memory>
#include<functional>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
int main()
{
int n;
while (cin >> n, n) {
int d[10][10];
fill_n((int *)d, 10 * 10, INF);
for (int i = 0; i < n; i++) {
int from, to, cost;
cin >> from >> to >> cost;
d[from][to] = d[to][from] = cost;
}
for (int k = 0; k < 10; k++) {
for (int i = 0; i < 10; i++) {
for (int j = i+1; j < 10; j++) {
d[i][j] = d[j][i] = min(d[i][k] + d[k][j], d[i][j]);
}
}
}
vi sums;
for (int i = 0; i < 10; i++) {
int sum = 0;
for (int j : d[i]) {
if (j != INF) sum += j;
}
if (sum != 0) sums.pb(sum);
}
int m = sums[0];
int ind = 0;
for (int i = 0; i < sums.size(); i++) {
if (m > sums[i]) {
m = sums[i];
ind = i;
}
}
cout << ind << " " << m << endl;
}
return 0;
} | #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][j], d[i][k]+d[k][j]);
}
int main()
{
int E;
while(scanf("%d", &E)==1 && E)
{
memset(d, 0x3f, sizeof(d));
for(int i=0; i<maxv; i++)
d[i][i] = 0;
V = 0;
for(int i=0; i<E; i++)
{
int u, v, cost;
scanf("%d%d%d", &u, &v, &cost);
d[u][v] = cost;
d[v][u] = cost;
V = max(V, max(v, u)+1);
}
warshall_floyd();
memset(x, 0, sizeof(x));
for(int i=0; i<V; i++)
{
for(int j=0; j<V; j++)
x[i] += d[i][j];
}
int ans = min_element(x, x + V) - x;
cout << ans << ' ' << x[ans] << endl;
}
return 0;
} | 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;
for(int i = 0; i< n; i++){
string s;
cin >> s;
if(a[s] == 1) ok = true;
a[s]++;
if(i != 0){
if(now == s[0]){
now = s[s.length()-1];
continue;
}
else{
ok = true;
}
}
now = s[s.length()-1];
}
if(ok){
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
} | #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;
else break;
}
for(int i=0;i<N-1;i++){
int S=vec.at(i).size();
if(vec.at(i).at(S-1)!=vec.at(i+1).at(0)){
can=false;
break;
}
}
if(can) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 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) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
int A, B;
int digits(int num) {
int ans = 0;
for(int i = 1; i <= num; ++i) {
int tmp = i;
int res = 0;
while(tmp > 0) {
int a = tmp % 10;
res += a;
tmp = tmp / 10;
}
if(A <= res && res <= B) ans += i;
}
return ans;
}
int main() {
int N; cin >> N;
cin >> A >> B;
cout << digits(N) << endl;
} | #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;
for (int i = 1; i <= n; ++i) {
if (check(i))
ans += i;
}
cout << ans << endl;
return 0;
} | 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);
vector<long long> b(n, 0);
for(int i = 0; i < n; ++i) {
cin >> a.at(i);
}
for(int i = 0; i < n; ++i) {
cin >> b.at(i);
}
long long sum = 0;
for(int i = 0; i < n; ++i) {
if(a.at(i) > b.at(i)) {
sum += 2*(a.at(i)-b.at(i));
b.at(i) = a.at(i);
}
}
for(int i = 0; i < n; ++i) {
if(a.at(i) < b.at(i)) {
long long ccc = (b.at(i)-a.at(i))/2;
sum -= ccc*2;
}
}
if(sum <= 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | #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] - B[i];
if(B[i] > A[i]) bigb += (B[i] - A[i])/2;
}
if(bigb >= biga) cout << "Yes" << endl;
else cout << "No" <<endl;
} | 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++)
using namespace std;
int main()
{
fast;
map<int,int>m;
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int num;
cin>>num;
m[num]++;
}
int f=0;
for(auto it=m.begin();it!=m.end();it++)
{
if(it->second>1)
{
f=1;
break;
}
}
if(f==1)
{
cout<<"NO"<<endl;
}
else
{
cout<<"YES"<<endl;
}
return 0;
} | #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 long double
#define vi vector<int>
#define di deque<int>
#define si set<int>
#define vpii vector<pair<int,int>>
#define pi pair<int,int>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define PI 3.1415926535897932384626433832795
#define read(a) for(auto& x:a) cin>>x
#define speak(a) for(auto x:a) cout<<x<<' '
#define rep(i,s,n) for(int i=s;i<n;++i)
#define repe(i,s,n) for(int i=s;i<=n;++i)
#define repr(i,n,s) for(int i=n;i>=s;--i)
#define endl '\n'
#define gap ' '
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define MOD 1000000007
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,x;cin>>n;
si s;
rep(i,0,n) cin>>x,s.insert(x);
cout<<(s.size()==n?"YES":"NO");
} | 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(int j=0; j<w; j++){
lpix.at(2*i).at(j) = pix.at(i).at(j);
lpix.at(2*i+1).at(j) = pix.at(i).at(j);
}
}
for(int i=0; i<2*h; i++){
for(int j=0; j<w; j++){
cout << lpix.at(i).at(j);
}
cout << endl;
}
} | #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<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#endif
const int MAXN = 200005;
const ll MOD = 1000000007;
int n, a[MAXN];
int main () {
IOS();
cin >> n;
ll suf = 0;
REP (i, n) {
cin >> a[i];
suf += a[i];
}
ll pre = 0, ans = 0x3f3f3f3f3f3f3f3f;
REP (i, n-1) {
pre += a[i];
suf -= a[i];
ans = min(ans, abs(pre - suf));
}
cout << ans << endl;
return 0;
} | #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;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
void solve()
{
int n;
scanf("%d", &n);
vector<int> a(n);
vector<ll> s(n + 1);
int i;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
s[i + 1] = s[i] + a[i];
}
ll ans = LINF;
for (i = 1; i < n; i++) {
ans=MIN(ans, abs(s[n] - s[i]*2));
}
printf("%lld\n", ans);
return;
}
int main(int argc, char* argv[])
{
#if 1
solve();
#else
int T;
scanf("%d%d", &T, &B);
int t;
for(t=0; t<T; t++) {
solve();
}
#endif
return 0;
} | 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 false; }
template <class T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
double t, x;
void input() {
cin >> t >> x;
}
void solve() {
cout << t/x << endl;
}
int main() {
input();
solve();
return 0;
} | #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;
for (int i = 1; i < n+1; i++)
{
int score = i;
double sum = 1;
while (score < k)
{
score *= 2;
sum *= 0.5;
}
prob += sum/n;
}
cout << fixed << setprecision(10) << prob << endl;
} | #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 = 0; i < (int)(n); ++i)
using ll = long long;
using P = pair<int, int>;
using MATRIX = vector< vector<ll> >;
template <class T> inline bool chmin(T &x, const T &y) {if (x > y) {x = y; return 1;} return 0;}
template <class T> inline bool chmax(T &x, const T &y) {if (x < y) {x = y; return 1;} return 0;}
double N, K;
int NUM;
double p(int a, int key) {
int res = 1;
int x = key;
while(x > 0) {
if(x & 1) {
res *= a;
}
x >>= 1;
a *= a;
}
return res;
}
int main() {
cin >> N >> K;
NUM = floor(log2(K - 0.1)) + 1;
double ans = 0;
double par = pow(2, NUM);
double ch = 0;
for(int i = 1; i <= N; i++) {
if(i >= K) {
ch += par;
continue;
}
int temp = floor(log2((K - 0.1) / i)) + 1;
ch += pow(2, NUM - temp);
}
cout << std::fixed << std::setprecision(11) << ch / (par * N) << endl;
return 0;
} | 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++){
printf("%c : %d\n", i + 'a', count[i]);
}
return 0;
} | #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) << " : " << cnt[i] << endl;
}
return 0;
} | 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
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main(){
string s;
cin >> s;
ll count = 0;
ll tmp = sz(s)-1;
for (ll i = sz(s) - 1; i >= 0;i--){
if(s[i]=='B'){
count += tmp - i;
tmp--;
}
}
print(count);
} | #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;
ll sum=0;
vector<int> v;
for(int i=0;i<s.length();i++){
if(s[i]=='B'){
v.push_back(i);
}
}
reverse(v.begin(),v.end());
int size=s.length()-1;
for(int i=0;i<v.size();i++){
sum+=(size-v[i]);
size-=1;
}
cout<<sum<<'\n';
return 0;
} | 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"<<endl;
else if(s=="RRS")
cout<<"2"<<endl;
else if(s=="SRR")
cout<<"2"<<endl;
else if(s=="RRR")
cout<<"3"<<endl;
return 0;
} | #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 chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
string S;
cin >> S;
if (S == "RRR")
cout << 3 << endl;
else if (S == "RRS" || S== "SRR")
cout << 2 << endl;
else if (S== "SSS")
cout << 0 << endl;
else
cout << 1 << endl;
} | 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 (int j = i + 1; j <= a; j++) {
if (str[i] == str[j]) {
m[i]++;
}
}
}int k,ma=0,locate,memo;
for (k = 0; k <= a+1; k++) {
if (m[k] > ma) {
ma = m[k];
locate= k;
}
}
for (int f = 0; f <= a+1; f++) {
if (str[f].size()> most) {
most = str[f].size();
memo = f;
}
}
longest = str[memo];
cout << str[locate] << " " << longest << endl;
return 0;
}
int input() {
int i = 0, j = 0;
while (1) {
scanf("%c", &ch[i]);
if (isupper(ch[i])) {
ch[i] += 'a' - 'A';
}
if (ch[i] == ' ') {
j++;
}
else if (ch[i] == '\n') {
break;
}
else {
str[j] += ch[i];
}
}
return j;
} | #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;
string max_word;
map<string,int> appear;
max_length = 0;
max_appear = 0;
while(1){
cin >> word;
if(cin.eof()) break;
if(appear.find(word) == appear.end()){
appear[word] = 1;
}else
appear[word]++;
if(appear[word] > max_appear){
max_appear = appear[word];
max_word = word;
}
if(word.length() > max_length){
max_length = word.length();
max_string = word;
}
}
cout << max_word << " " << max_string << endl;
#ifdef DEBUG
fout.close();
fin.close();
#endif
return 0;
} | 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)(N - 1) / (K - 1)) << endl;
} | 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(int i = 0; i < n; ++i) cout << UIET[i]
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
int32_t main(){
SPEED;
int n;
cin >> n;
int arr[n];
read(arr);
int ans = INF;
for(int i = 1; i <= 100; ++i){
int res = 0;
for(int j = 0; j < n; ++j){
res += (arr[j] - i) * (arr[j] - i);
}
ans = min(ans, res);
}
cout << ans ;
} | #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;
vector<int> X(N);
REP (i, N) {
cin >> X[i];
}
REP (i, N) {
cin >> X[i];
}
sort(X.begin(),X.end());
int middle1 = ceil(mean(X));
int middle2 = floor(mean(X));
int total1 = 0;
int total2 = 0;
REP (i, N) {
total1 += (X[i] - middle1) * (X[i] - middle1);
total2 += (X[i] - middle2) * (X[i] - middle2);
}
cout << min(total1,total2) << endl;
return 0;
} | 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 == n-1) a[i] = b[i-1];
else {
if (b[i]-b[i-1] >= 0) a[i] = b[i-1];
else a[i] = b[i];
}
}
int ans = 0;
rep(i,n) ans += a[i];
cout << ans << endl;
return 0;
} | #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))
#define swap(a,b) ( (a^=b) , (b^=a) , (a^=b) )
#define GET(x) (mark[x>>5]>>(x&31)&1)
#define SET(x) (mark[x>>5]|=1<<(x&31))
#define maxL (10000000>>5)+1
#define mod 1000000007
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define si set<int>
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n;
cin >> n;
int i;
vector<int> b(n);
rep(i, n-1) cin >> b[i];
ll ans(0);
ans += b[0];
xrep(i, 1, n-1) {
ans += min(b[i], b[i-1]);
}
ans += b[n-2];
cout << ans << endl;
} | 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(){
string A,B,C;cin>>A>>B>>C;
cout<<(char)(A[0]+('A'-'a'))<<(char)(B[0]+('A'-'a'))<<(char)(C[0]+('A'-'a'))<<endl;
} | 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
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int H, W, D; cin>>H>>W>>D;
vector<vector<int> > A(H, vector<int>(W));
map<int, pair<int, int> > amap;
for(int i=0;i<H;++i) {
for(int j=0;j<W;++j) {
cin>>A[i][j];
if(A[i][j]>D) {
amap[A[i][j]-D] = mp(i, j);
}
}
}
int ans[H*W+1];
for(int i=0;i<=H*W;++i) ans[i] = 0;
for(int i=0;i<H;++i) {
for(int j=0;j<W;++j) {
if(A[i][j]+D>H*W) continue;
ans[A[i][j]] = abs(amap[A[i][j]].fi-i)+abs(amap[A[i][j]].se-j);
}
}
vector<vector<int> > ansarr(D);
for(int i=0;i<D;++i) ansarr[i].push_back(0);
for(int i=1;i<H*W;++i) {
if(ans[i]==0) break;
ansarr[i%D].push_back(ans[i]);
}
for(int i=0;i<D;++i) {
for(int j=1;j<ansarr[i].size();++j) ansarr[i][j] += ansarr[i][j-1];
}
int Q;
cin>>Q;
int l, r;
int ans1[Q];
for(int i=0;i<Q;++i) {
cin>>l>>r;
if(l%D==0) ans1[i] = ansarr[l%D][r/D-1]-ansarr[l%D][l/D-1];
else ans1[i] = ansarr[l%D][(r-l%D)/D]-ansarr[l%D][(l-l%D)/D];
}
for(int i=0;i<Q;++i) cout<<ans1[i]<<endl;
} | #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 int ull;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e18;
const ll MOD=1e9+7;
int main(){
int H,W,D;cin>>H>>W>>D;
int A[H][W];
vector<int> X(H*W+1,0),Y(H*W+1,0);
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin>>A[i][j];
X[A[i][j]]=i;
Y[A[i][j]]=j;
}
}
vector<int> SX(H*W+1,0),SY(H*W+1,0);
for(int i=D+1;i<=H*W;++i){
SX[i]=SX[i-D]+abs(X[i]-X[i-D]);
SY[i]=SY[i-D]+abs(Y[i]-Y[i-D]);
}
int Q;cin>>Q;
while(Q--){
int L,R;cin>>L>>R;
cout<<(SX[R]-SX[L])+(SY[R]-SY[L])<<endl;
}
return 0;
} | 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);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, M;
cin >> N;
map<string, ll> n, m;
set<string> S;
ll maxi = 0;
rep(i, N) {
string temp;
cin >> temp;
n[temp]++;
S.insert(temp);
}
cin >> M;
rep(i, M) {
string temp;
cin >> temp;
m[temp]++;
S.insert(temp);
}
iter(s, S) maxi = max(maxi, n[s] - m[s]);
cout << maxi << endl;
return 0;
} | #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 = max(ans, x.second);
}
cout << ans << endl;
return 0;
} | 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);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
int main(){
FAST
int n;
cin >> n;
pair<int, int> arr[n];
for(int i = 0; i < n; i++){
cin >> arr[i].first;
arr[i].second = i;
}
sort(arr, arr + n);
int ans[n];
for(int i = 0; i < n - 1; i++){
ans[arr[i].second] = arr[n - 1].first;
}
ans[arr[n - 1].second] = arr[n - 2].first;
for(int i = 0; i < n; i++){
cout << ans[i] << endl;
}
return 0;
} | #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 >> a[i];
b = a;
sort(b.rbegin(), b.rend());
rep(i, n) {
if (a[i] == b[0]) cout << b[1] << endl;
else cout << b[0] << endl;
}
} | 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;
const ll MOD=2e18;
const double EPS=1e-7;
ll N;
string c[500];
int main(){
cin>>N;
for(ll i=0;i<N;i++){
cin>>c[i];
}
ll ans=0;
for(ll a=0;a<N;a++){
for(ll i=0;i<N;i++){
char tmp=c[i][0];
for(ll j=0;j<N-1;j++){
c[i][j]=c[i][j+1];
}
c[i][N-1]=tmp;
}
bool isSame=true;
for(ll i=0;i<N;i++){
string tmp1,tmp2;
tmp1=c[i].substr(i+1,N-(i+1));
for(ll j=i+1;j<N;j++){
tmp2+=c[j][i];
}
if(tmp1!=tmp2){
isSame=false;
break;
}
}
if(isSame){
ans+=N;
}
}
cout<<ans<<endl;
} | #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 long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
ll solve(long long N, vector<string> S, ll A, ll B){
bool f = true;
rep(i, N) {
rep(j, N) {
if (S[(A+i)%N][(B+j)%N] != S[(A+j)%N][(B+i)%N]) f = false;
}
}
if (f) return N-A-B; else return 0;
}
int main(){
long long N;
scanf("%lld",&N);
vector<string> S(N-1+1);
for(int i = 0 ; i <= N-1 ; i++){
cin >> S[i];
}
ll res = 0;
rep(i,N) {
res += solve(N, S, i, 0);
}
repn(i,N-1) {
res += solve(N, S, 0, i);
}
cout << res << endl;
return 0;
} | 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)){
flag=true;
a=i+1;
b=i+3;
break;
}
}
}
if(flag){
cout<<a<<" "<<b<<endl;
}else{
cout<<-1<<" "<<-1<<endl;
}
} | #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
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
bool flag = true;
cin >> s;
if (s.size() == 2) {
if (s[0] == s[1]) {
flag = false;
cout << "1 2" << endl;
}
}
rep(i, s.size()-2) {
if (s[i] == s[i+1] || s[i] == s[i+2] || s[i+1] == s[i+2]) {
flag = false;
cout << i+1 << ' ' << i+3 << endl;
break;
}
}
if (flag)
cout << "-1 -1" << endl;
} | 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];
}
cout << ((N-1) + (K-1) - 1) / (K-1) << endl;
return 0;
} | #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).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) ((a)/GCD((a),(b))*(b))
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n,k;
cin >> n >> k;
rep(i,n)
{
ll a;
cin >> a;
}
ll ans = kiriage(n-1,k-1);
cout << ans << endl;
return 0;
}
int getDigit(ll n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 0)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
} | 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')
{
return true;
}
else
{
return false;
}
}
int main()
{
unordered_map<char, int> result_hash;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string input_str;
for (char c : alphabet)
{
result_hash[c] = 0;
}
while (getline(cin, input_str))
{
for (char c : input_str)
{
if (is_alphabet(c))
{
result_hash[to_lower(c)] += 1;
}
}
}
for (char c : alphabet)
{
cout << c << " : " << result_hash[c] << endl;
}
} | #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 = (char)std::tolower(c);
}
int num = c - 'a';
count[num]++;
it++;
}
}
for(int i=0;i<26;i++){
std::cout << alpha << " : " << count[i] << std::endl;
alpha++;
}
return 0;
} | 1 | 2,879,480 |