code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,ans="Yes";
cin >> s >> t;
vector<long> a(26);
vector<long> b(26);
for(long i=0;i<s.size();i++) {
if(a[t[i]-'a']!=0&&a[t[i]-'a']!=s[i]) ans="No";
a[t[i]-'a']=s[i];
if(b[s[i]-'a']!=0&&b[s[i]-'a']!=t[i]) ans="No";
b[s[i]-'a']=t[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#define INF 1000000000000000000
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
signed main()
{
speed;
int k,n;
cin>>k>>n;
int A[n+1];
for(int i=1;i<=n;i++) cin>>A[i];
int minn=INT_MAX;
for(int i=1;i<=n;i++)
{
if(i==n) minn=min(minn,min(A[n]-A[1],k+A[n-1]-A[n]));
else minn=min(minn,min(k-A[i+1]+A[i],2*(A[i]-A[1])+(A[n]-A[i])));
}
cout<<minn<<endl;
} | 0 | 100,533,445 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<55)
#define mod 1000000007
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;}
void prime_div(vector<ll> &ret,ll n){
ll x=n;
for(ll i=2;i*i<=x;i++){
while(n%i==0){
n/=i;
ret.push_back(i);
}
}
if(n!=1){
ret.push_back(n);
}
return;
}
int main(){
ll n;cin>>n;
vector<ll> ret;
for(ll i=1;i<=n;i++){
prime_div(ret,i);
}
sort(ret.begin(),ret.end());
ret.push_back(INF);
vector<ll> pr(101,0);
ll num=1;
rep(i,ret.size()-1){
if(ret[i]==ret[i+1]){
num++;
}else{
if(num!=1){
pr[ret[i]]=num;
}
num=1;
}
}
ll n2=0,n4=0,n14=0,n24=0,n74=0;
rep(i,pr.size()){
if(pr[i]>=74){
n74++;
}
if(pr[i]>=24){
n24++;
}
if(pr[i]>=14){
n14++;
}
if(pr[i]>=4){
n4++;
}
if(pr[i]>=2){
n2++;
}
}
cout<<n74+n24*(n2-1)+n14*(n4-1)+n4*(n4-1)*(n2-2)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int a,b,c,k;
cin>>a>>b>>c>>k;
if (k%2==0) {
long long int ans=a-b;
if (abs(a-b)>1000000000000000000) {
cout<<"Unfair"<<endl;
} else {
cout<<ans<<endl;
}
} else {
long long int ans=-1*(a-b);
if (abs(a-b)>1000000000000000000) {
cout<<"Unfair"<<endl;
} else {
cout<<ans<<endl;
}
}
} | 0 | 48,645,926 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, V) for (int i = 0; i < V; i++)
#define repr(i, V) for (int i = V-1; i >= 0; i--)
#define repval(i, a, V) for (int i = a; i < V ; i++)
#define all(x) x.begin(), x.end()
#define ld long double
#define eps 0.0000000001
#define mod 1000000007
#define inf 1e16
#define vec vector
#define each(i, mp) for(auto& i:mp)
int main(){
int n;
string s;
cin >> n;
cin >> s;
int l = 0;
int ansl = 0;
int ansr = 0;
rep(i, (int)s.size()){
if (s[i] == '('){
l++;
}else if(l > 0){
l--;
}else{
ansl++;
}
}
ansr = l;
rep(i, ansl) cout << '('; cout << s; rep(i, ansr) cout << ')';
} | #include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i,a,b) for(Re int i = a;i <= b;++i)
#define ROF(i,a,b) for(Re int i = a;i >= b;--i)
#define SFOR(i,a,b,c) for(Re int i = a;i <= b;i+=c)
#define SROF(i,a,b,c) for(Re int i = a;i >= b;i-=c)
#define CLR(i,a) memset(i,a,sizeof(i))
#define BR printf("--------------------\n")
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 100+5;
int N,a[MAXN],cnt[MAXN];
int main(){
scanf("%d",&N);
FOR(i,1,N) scanf("%d",a+i),cnt[a[i]]++;
std::sort(a+1,a+N+1);
if(a[N-1] != a[N]) {puts("Impossible");return 0;}
cnt[a[N]] -= 2;
FOR(i,1,a[N]-1){
int d = std::max(i,a[N]-i);
if(!cnt[d]){
puts("Impossible");return 0;
}
cnt[d]--;
}
FOR(i,1,(a[N]+1)/2){
if(cnt[i]){
puts("Impossible");return 0;
}
}
puts("Possible");
return 0;
} | 0 | 76,531,737 |
#include <iostream>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
if (a - b >= c)
{
std::cout << 0 << std::endl;
}
else
{
std::cout << c - a + b << std::endl;
}
return 0;
} | #include <iostream>
typedef long long LL;
using namespace std;
int main() {
LL n;
LL m;
LL tmp;
LL ans;
cin >> n >> m;
if(m>n){
tmp=n;
n=m;
m=tmp;
}
if(m==1){
if(n==1){
ans=1;
}else if(n==2){
ans=0;
}else{
ans=n-2;
}
}else if(m==2){
ans=0;
}else{
ans=(n-2)*(m-2);
}
cout << ans << endl;
return 0;
} | 0 | 1,673,348 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(auto &t:x) cout<<t<<" "; cout<<endl;
#define ff first
#define ss second
#define pb push_back
#define initialize(a,v) for(int i=0;i<a.size();++i) a[i]=v;
#define all(x) x.begin(),x.end()
#define mpt(mp) for(auto it=mp.begin();it!=mp.end();it++)
#define trav(x) for(int i=0;i<(int)x.size();++i)
#define mkp(a,b) make_pair(a,b)
#define sz(x) (int)x.size()
int noofdig(int N)
{
return floor(log10(N))+1;
}
ll f(ll a)
{
return 0;
}
void pre()
{
}
void solve()
{
double d,t,s;
cin>>d>>t>>s;
double time_taken=d/s;
if(time_taken<=t)
{
cout<<"Yes"<<endl;
}
else
cout<<"No"<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
{
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end());
#define exit(); return 0;
#define no "NO"
#define yes "YES"
#define con continue;
LL concate(LL a, LL b)
{
ostringstream os;
os <<a <<b;
istringstream is(os.str());
LL c;
is>> c;
return c;
}
LL check(char c)
{
return c=='a' || c=='e' || c=='i' || c=='o' || c=='u';
}
LL mod = 1e9+7;
int main()
{
LL q,t;
LL a=0,b=0,c=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,r=0,u=0,w=0,x=0,y=0,z=0;
LL aa[1000];
LL flag=0, flag1=0, co=0, co1=0, co2=0, co3=0, x1=0, x2=0, y1=0, y2=0, z1=0, z2=0;
LL ma=0, mi=100000000;
LL mid=0, temp=0, stop=0, start=0;
double pi= 3.141592653589793;
double d1=0.0, d2, d3, d4;
VLL v,v1,v2,v3,v4,v5,v6,v7,v8,v9,v10;
VS vs, vs1, vs2, vs3, vs4;
VP vp, vp1,vp2;
char ch, ch1, ch2[1001];
string str, str1, str2, str3, str4, str5;
pair<LL, LL> pa;
list<LL> li, li1;
map<LL, LL> mp, mp1;
set<LL> st;
map<LL ,LL> :: iterator imll;
VLL :: iterator ivll;
set<LL> :: iterator isll;
VP :: iterator ivp;
cin>>ch>>ch1;
if(ch=='H')cout<<ch1<<endl;
else
{
if(ch1=='H')cout<<'D'<<endl;
else cout<<'H'<<endl;
}
exit()
} | 0 | 27,150,827 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll expo(ll a, ll b){
ll ex = 1;
rep(i, b){
ex *= a;
}
return ex;
}
ll fact(ll a){
ll fc = 1;
REP(i, 1, a+1){
fc *= i;
}
return fc;
}
int main() {
ll n;
cin >> n;
ll cnt = 0;
REP(a, 1, n) {
cnt += (n-1)/a;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ld = double;
using point = complex<ld>;
int main() {
int n; cin >> n;
vector<point> ps;
for(int i = 0; i < n; ++i) {
int x, y; cin >> x >> y;
if(x == 0 && y == 0) continue;
ps.emplace_back(x, y);
}
n = ps.size();
sort(ps.begin(), ps.end(),
[] (auto const& a, auto const& b) { return arg(a) < arg(b); });
ld ans = 0;
for(int i = 0; i < n; ++i) {
point p = ps[i];
ans = max(ans, abs(p));
for(int j = 1; j < n; ++j) {
auto const v = ps[(i + j) % n];
if(arg(v / ps[i]) < 0) break;
p += v;
ans = max(ans, abs(p));
}
}
cout << fixed << setprecision(12) << ans << endl;
} | 0 | 70,245,689 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
using namespace std;
#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;
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 (b < a) { a = b; return true; } return false; }
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int N, K;
pii S[100010];
int tn[100010];
priority_queue<pii, vector<pii>, greater<pii>> pq;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int t, d;
cin >> N >> K;
rep(i, 0, N)
{
cin >> S[i].second >> S[i].first;
}
sort(S, S + N);
int res = 0;
set<int> tns;
rrep(i, N - K, N)
{
res += S[i].first;
pq.push(S[i]);
tn[S[i].second]++;
tns.insert(S[i].second);
}
int tnss = tns.size();
res += tnss * tnss;
int ans = res;
rrep(i, 0, N - K)
{
if (tn[S[i].second] == 0)
{
while (!pq.empty())
{
auto p = pq.top();
pq.pop();
if (tn[p.second] > 1)
{
tn[p.second]--;
tn[S[i].second]++;
tnss++;
res -= p.first - S[i].first;
res += tnss * tnss - (tnss - 1)*(tnss - 1);
chmax(ans, res);
break;
}
}
}
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int n;
scanf("%d", &n);
vector<int> v[100000];
for(int i=0; i<n-1; i++){
int a, b;
scanf("%d %d", &a, &b);
a--; b--;
v[a].push_back(b);
v[b].push_back(a);
}
int d[100000];
fill(d, d+n, -1);
d[0]=0;
queue<int> que;
que.push(0);
while(!que.empty()){
int x=que.front();
que.pop();
for(int i=0; i<v[x].size(); i++){
if(d[v[x][i]]<0){
d[v[x][i]]=d[x]+1;
que.push(v[x][i]);
}
}
}
vector<P> dist;
for(int i=0; i<n; i++){
dist.push_back(P(d[i], i));
}
sort(dist.begin(), dist.end(), greater<P>());
bool used[100000]={};
bool e=0;
for(int i=0; i<n; i++){
int x=dist[i].second;
if(used[x]==1) continue;
bool e1=0;
used[x]=1;
for(int j=0; j<v[x].size(); j++){
int y=v[x][j];
if(d[y]>d[x]) continue;
if(used[y]==0){
e1=1;
used[y]=1;
break;
}
}
if(e1==0){
e=1;
break;
}
}
if(e==1){
printf("First\n");
}else{
printf("Second\n");
}
return 0;
} | 0 | 65,540,682 |
#include <bits/stdc++.h>
#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 ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
const long long INF = 1LL << 60;
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n;
int p[n];
rep(i, n) cin >> p[i];
int pp[n];
rep(i, n) pp[p[i] - 1] = i + 1;
int a[n];
a[0] = pp[0];
rep(i, 1, n)
{
a[i] = a[i - 1] + pp[i];
}
int b[n];
b[0] = a[n - 1];
rep(i, 1, n)
{
b[i] = b[i - 1] - pp[i - 1];
}
rep(i, n) cout << a[i] << " ";
cout << endl;
rep(i, n) cout << b[i] << " ";
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
while(tc--){
int n;
cin >> n;
string s;
cout << "0\n";
cout << flush;
cin >> s;
if(s == "Vacant"){
return 0;
}
int l = 0, r = n - 1;
while(l <= r){
int mid = (l + r) / 2;
cout << mid << '\n';
cout << flush;
string str;
cin >> str;
if(str == "Vacant"){
return 0;
}
if(mid % 2){
if(str != s){
l = mid + 1;
}else{
r = mid - 1;
}
}else{
if(str == s){
l = mid + 1;
}else{
r = mid - 1;
}
}
}
}
} | 0 | 22,849,787 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int t,x;
cin >> t >> x;
cout << fixed << setprecision(15) << t/double(x) << endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
struct Dice{
int t, r, f;
int top() { return t; }
int bottom() { return 7 - t; }
int right() { return r; }
int left() { return 7 - r; }
int front() { return f; }
int back() { return 7 - f; }
void toFront() { swap(f, t); t = 7 - t; }
void toBack() { toFront(); toFront(); toFront(); }
void toRight() { swap(t, r); t = 7 - t; }
void toLeft() { toRight(); toRight(); toRight(); }
void toClock() { swap(f, r); r = 7 - r; }
void toConter() { toClock(); toClock(); toClock(); }
int roll(int tt, int ff) {
REP(i,30) {
if (i % 10 == 0) toRight();
else if (i % 10 == 5) toFront();
else toClock();
if (tt == t && ff == f) return r;
}
return 0;
}
};
int main(){
Dice dai1;
int men[7];
FOR(i,1,7) cin >> men[i];
int n;
cin >> n;
dai1.t = 1;
dai1.f = 2;
dai1.r = 3;
REP(i,n){
int to_top,to_front;
cin >> to_top >> to_front;
FOR(i,1,7){
if(to_top == men[i]) to_top = i;
if(to_front == men[i]) to_front = i;
}
cout << men[dai1.roll(to_top,to_front)] << endl;
}
} | 0 | 99,635,992 |
#include<iostream>
#include<stdlib.h>
#include<queue>
using namespace std;
int main () {
int a,b;
while(cin>>a>>b,a|b){
int x,y,m=0;
int d[a*b]={};int k;cin>>k;
for(int i=0;i<k;++i){
cin>>x>>y;x--;y--;
d[x+y*a]=1;
}
int t=a+b;
int dp[2][a*b];
for(int i=0;i<2;++i)for(int j=0;j<a*b;++j)dp[i][j]=0;
dp[1-m][0]=1;
while(t--){
for(y=0;y<b;++y){
for(x=0;x<a;++x){
if(d[x+y*a])continue;
if(dp[m][x+y*a]==0){
if(x>=1){dp[m][x+y*a]+=dp[1-m][(x-1)+y*a];}
if(y>=1){dp[m][x+y*a]+=dp[1-m][x+(y-1)*a];}
}
}
}
for(int i=0;i<a*b;++i)dp[1-m][i]=dp[m][i];
m=1-m;
}
cout<<dp[1-m][a*b-1]<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5005;
ll c[maxn], p[maxn], b[maxn], n, k, ans = -999999999999, t, cnt, vis[maxn], inf = 0;
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> p[i];
for (int i = 1; i <= n; i++)
cin >> c[i];
ll temp;
for (int i = 1; i <= n; i++)
{
memset(b, 0, sizeof(b));
memset(vis, 0, sizeof(vis));
cnt = 0, temp = 0, t = i, inf = 0;
while (vis[p[t]] == 0)
b[cnt + 1] = c[p[t]], inf += c[p[t]], cnt++, vis[p[t]] = 1, t = p[t];
if (k <= cnt )
{
ll ab = 0;
for (int j = 1; j <= k; j++)
{
ab+=b[j];
ans = max(ans, ab);
}
continue;
}
if( inf<=0)
{
ll ab = 0;
for (int j = 1; j <= cnt; j++)
{
ab+=b[j];
ans = max(ans, ab);
}
}
{
int kk = k / cnt;
kk--;
temp = (kk * inf);
ans = max(temp, ans);
for (int j = 1; j <= cnt; j++)
{
temp = temp + b[j];
ans = max(temp, ans);
}
kk++;
for (int j = 1; j <= k - kk * cnt; j++)
{
temp = temp + b[j];
ans = max(temp, ans);
}
}
}
cout << ans << endl;
return 0;
} | 0 | 91,184,204 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;
int n;
vector<set<int>> e;
int main(){
cin.tie(0); cin.sync_with_stdio(0);
cin >> n;
e.resize(n);
rep(i, n - 1){
int a, b; cin >> a >> b; a--; b--;
e[a].insert(b);
e[b].insert(a);
}
set<int> f, del;
rep(i, n) if(e[i].size() == 1) f.insert(i);
while(f.size()){
int i = *f.begin(), j = *e[i].begin();
f.erase(i); f.erase(j);
del.insert(i); del.insert(j);
for(int k : e[j]){
e[k].erase(j);
if(e[k].size() == 1 && !del.count(k)) f.insert(k);
else f.erase(k);
}
}
cout << (del.size() == n ? "Second" : "First") << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
s1 = toupper(s1.at(0));
s2 = toupper(s2.at(0));
s3 = toupper(s3.at(0));
cout << s1 << s2 << s3 << endl;
} | 0 | 60,140,246 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
int s1len = (int)s1.size();
int s2len = (int)s2.size();
vector<vector<int> > D(s1len+1 ,vector<int>(s2len+1, 0));
for(int i=0;i<=s1len;++i){
D[i][0]=i;
}
for(int i=0;i<=s2len;++i){
D[0][i]=i;
}
for(int i=1;i<=s1len;++i){
for(int j=1;j<=s2len;++j){
if(s1[i-1] == s2[j-1]){
D[i][j] = D[i-1][j-1];
} else {
D[i][j] = min(D[i-1][j-1]+1,min(D[i-1][j]+1,D[i][j-1]+1));
}
}
}
cout << D[s1len][s2len] << endl;
} | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define bit(n) (1LL<<(n))
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b, const ll mod=MOD) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b, const ll mod=MOD) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b, const ll mod=MOD) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b, const ll mod=MOD) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n = 5;
vi a(n); for(auto& e : a) cin >> e;
int res = 0;
int maxd = 0;
for(auto& e : a){
int cur = (e + 9) / 10 * 10;
chmax(maxd, cur - e);
res += cur;
}
res -= maxd;
cout << res << endl;
return 0;
} | 0 | 19,435,866 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = abs(a[i] - x);
}
if (n == 1) {
cout << a[0] << '\n';
} else {
int ans = a[0];
for (int i = 1; i < n; i++) {
ans = __gcd(ans, a[i]);
}
cout << ans << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void show(vector<ll>& vc)
{
for(auto it:vc)cout<<it<<" ";
cout<<endl;
}
#define M 300014
/**
typedef pair<ll, ll> pii;
#define x first
#define y second
pii extendedEuclid(ll a, ll b)
{
if(b == 0) return pii(1, 0);
else
{
pii d = extendedEuclid(b, a % b);
return pii(d.y, d.x - d.y * (a / b));
}
}
ll modularInverse(ll a, ll n)
{
pii ret = extendedEuclid(a, n);
return ((ret.x % n) + n) % n;
}
/**
ll bigmod(ll a, ll b, ll c)
{
if(b==0)return 1;
if(b%2)
{
ll p = bigmod(a,b-1,c);
return (a*p)%c;
}
else
{
ll p = bigmod(a,b/2,c);
return (p*p)%c;
}
}
void solve(ll t)
{
ll n;
cin>>n;
cout<<(n*(n+1))/2<<endl;
}
int main()
{
/**seive();
/** euler_phi();
/** show(phi);
/** bitwiseSieve();
ll t=1;
ll T=t;
while(t--)
{
solve(T-t);
}
return 0;
} | 0 | 51,863,642 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<array>
#include<math.h>
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[])
{
int H, W;
int ansH;
char ansW;
std::cin >> H >> W;
string str;
int A = 'A';
for (int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
std::cin >> str;
if (str == "snuke") {
ansW = j+A;
ansH = i+1;
}
}
}
std::cout << ansW << ansH << '\n';
return 0;
} | #include<stdio.h>
const int MAX_N = 1000000;
int n;
int num[MAX_N];
int ans=0;
int main(){
for (int i = 2; i < MAX_N; i++){
num[i] = 1;
}
for (int i = 2; i < MAX_N; i++){
if (num[i] == 0) continue;
for (int j = 2; i*j < MAX_N; j++){
num[i*j] = 0;
}
}
while(scanf("%d",&n) != -1){
ans = 0;
for(int i = 0; i < n+1; i++){
if(num[i] == 1){
ans++;
}
}
printf("%d\n",ans);
}
return 0;
} | 0 | 94,382,047 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
map<int,int> mp;
for(int i = 0; i < 3; i++){
int a, b; cin >> a >> b; mp[a]++; mp[b]++;
}
int cn1 = 0, cn2 = 0;
for(auto i : mp) {
cn1 += i.second == 1;
cn2 += i.second == 2;
}
cout << (cn1 == 2 && cn2 == 2 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define _dec(i,N,j) for(int i = (N-1);i >= (j);i--)
#define _rec(i,N,j) for(int i = (N);i >=(j);i--)
#define ALL(x) x.begin(),x.end()
#define MEM(a,n) memset(a,n,sizeof(a))
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
int get_int(){int x;scanf("%d",&x);return x;}
LL get_ll(){LL x;scanf("%lld",&x);return x;}
double get_db(){double x;scanf("%lf",&x);return x;}
template<typename T> int chmin(T &a,T b){if(a > b){a = b;return 1;}else return 0;}
template<typename T> int chmax(T &a,T b){if(a < b){a = b;return 1;}else return 0;}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& v) {_for(i,0,v.size()) os << v[i] << " ";return os;}
template<typename T>
ostream& operator<<(ostream& os,const set<T>& v){for(auto a:v) os << a <<" ";return os;}
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& v){os << v.fst <<" "<<v.scd << " ";return os;}
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const map<T1,T2>& v){for(auto a:v) cout << a << endl;return os;}
static const int dx[8] = { -1, 0, 1, 0, 1, -1, 1, -1};
static const int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
const double pi = acos(-1.0);
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const int maxn = 3e5+5;
int N;
int A[maxn];
int main()
{
memset(A,0,sizeof(A));
cin >> N;
_for(i,0,N){
int a; cin >> a;
A[a-1]++;
}
sort(A,A+N,greater<int>());
int r = N-1;
int l = N-1;
LL sum = A[l];
stack<LL> st;
for(; r >= 0;r--){
if(l > r){
l--;
sum += A[l];
}
while(l && (sum/(double)(r - l + 1) > (sum + A[l-1])/(double)(r - l + 2))){
l--;
sum += A[l];
}
st.push(sum/(r - l + 1));
}
while(!st.empty()){
LL a = st.top();
st.pop();
cout << a << endl;
}
return 0;
} | 0 | 25,472,522 |
#include <bits/stdc++.h>
int divs(int n) {
int count = 2;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
++count;
const int t = n / i;
if (i != t) {
if (n % t == 0)
++count;
}
}
}
return count;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0;
std::cin >> n;
int r = 0;
if (n > 104) {
for (int i = 105; i <= n; ++i) {
if ((i & 1) && (divs(i) == 8))
++r;
}
}
std::cout << r << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
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;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int cnt = 0;
for (int i = 0; i < N - 1; i++) {
if (a[i] == a[i + 1]) {
cnt++;
i++;
}
}
cout << cnt << endl;
} | 0 | 40,189,568 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define int long long
int32_t main(){
int l, r;
cin >> l >> r;
if (r - l <= 10000){
int mn = 100000000;
for (int i = l; i <= r; i++){
for (int j = i + 1; j <= r; j++){
mn = min(mn, (i * j) % 2019);
}
}
cout << mn;
}else{
cout << 0;
}
} | #include "bits/stdc++.h"
using namespace std;
int main()
{
int x,n,ans,a,b;
cin>>x>>n;
if(n==0)
{
ans=x;
}
else
{
vector<int> p(n);
for(int i=0;i<n;i++)
{
cin>>p.at(i);
}
for(int i=x;i<=101;i++)
{
int h=0;
for(int j=0;j<n;j++)
{
if(p.at(j)==i)
{
h=1;
break;
}
}
if(h==0)
{
a=i;
break;
}
}
for(int i=x;i>=-100;i--)
{
int h=0;
for(int j=0;j<n;j++)
{
if(p.at(j)==i)
{
h=1;
break;
}
}
if(h==0)
{
b=i;
break;
}
}
if(a-x>=x-b)
ans=b;
else
ans=a;
}
cout<<ans<<endl;
} | 0 | 68,155,776 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e7+5;
int ans[maxn]={0};
int main(){
long long n;
scanf("%lld",&n);
long long cnt=0;
for(int i=1;i<n;i++){
if(ans[i]==0&&ans[n-i]==0&&i!=n-i){
ans[i]=ans[n-i]=1;
cnt++;
}
}
printf("%lld",cnt);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
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 T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
string S;
cin >> S;
map<char, ll> mp;
rep(i, 0, len(S)) mp[S[i]]++;
for (char alph = 'a'; alph <= 'z'; ++alph) {
if (mp[alph] == 0) {
cout << alph << endl;
return 0;
}
}
cout << "None" << endl;
} | 0 | 13,429,305 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int h,w,ans=0;
cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
vector<vector<int>> dist(h,vector<int>(w,INF));
queue<P> que;
rep(i,h) rep(j,w){
cin>>a[i][j];
if(a[i][j]=='#'){
que.push(P(i,j));
dist[i][j]=0;
}
}
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
while(que.size()){
P p=que.front();que.pop();
rep(i,4){
int nx=p.first+dx[i],ny=p.second+dy[i];
if(0<=nx&&nx<h&&0<=ny&&ny<w&&dist[nx][ny]==INF){
que.push(P(nx,ny));
dist[nx][ny]=dist[p.first][p.second]+1;
ans=dist[nx][ny];
}
}
}
cout<<ans;
} | #include <iostream>
#define N_MAX 1000000000
using namespace std;
int func(long long n){
static int cnt = 0;
if(cnt++ > 64)return -1;
char ans;
cout << "? " << n << endl;
cin >> ans;
if(ans == 'Y')return 1;
return 0;
}
int main(void){
long long left = (long long)N_MAX*10-1, right = (long long)N_MAX*100;
while(left + 1 < right){
long long mid = (left + right) / 2;
if(func(mid)){
right = mid;
}else{
left = mid;
}
}
while(right%10 == 0)right /= 10;
if(right == 1){
while(func(right*2) == 0){
right *= 10;
}
cout << "! " << right << endl;
}else{
left = 10;
right--;
while(func(right*left) == 1){
left *= 10;
}
left /= 10;
right++;
cout << "! " << right*left << endl;
}
} | 0 | 72,373,973 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,h;
cin>>n>>h;
vector<long long> a(n);
vector<long long> b(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
cin>>b.at(i);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
long long top=a.at(0);
long long ans=0;
for(auto t:b){
if(t<top) break;
h-=t;
ans++;
if(h<=0){
cout<<ans<<endl;
return 0;
}
}
cout<<ans+(long long)ceil((double)h/top)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int sum = 0;
for (int i = a; i < b + 1; i++){
int c_1 = i / 10000;
int c_2 = (i % 10000) / 1000;
int c_3 = (i % 100) / 10;
int c_4 = i % 10;
if (c_1 == c_4 && c_2 == c_3){
sum++;
}
}
cout << sum << endl;
} | 0 | 16,533,277 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
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; }
using namespace std;
int main(){
Init();
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll p = a-b;
cout << (k%2 == 0 ? p : -p) << endl;
} | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define vi vector<int>
#define sws ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl '\n'
#define teto(a, b) (a+b-1)/(b)
const int MAX = 400010;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ld EPS = 1e-8;
const ld PI = acosl(-1.0);
using namespace std;
int main()
{
int m, k;
cin >> m >> k;
int p = 1<<m;
if(m==1)
{
if(k>0)
cout << -1 << endl;
else
cout << "0 0 1 1\n";
}
else if(k>=p)
cout << -1 << endl;
else
{
for(int i=p-1;i>=0;i--)
if(i!=k)
cout << i << " ";
cout << k << " ";
for(int i=0;i<p;i++)
if(i!=k)
cout << i << " ";
cout << k << endl;
}
return 0;
} | 0 | 37,774,979 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vec A(N), B(N);
REP(i,0,N) cin >> A[i];
REP(i,0,N) cin >> B[i];
ll S = 0, T = 0;
REP(i,0,N) {
if(A[i] >= B[i]) S += A[i] - B[i];
else T += (B[i] - A[i]) / 2;
}
if(S <= T) PR("Yes");
else PR("No");
return 0;
} | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
map<int, int> m1;
map<int, int> m2;
bool comp1(int a, int b) {
return m1[a] > m1[b];
}
bool comp2(int a, int b) {
return m2[a] > m2[b];
}
int main(int argc, char* argv[]) {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> a;
for (int i = 0; i < n; i += 2) {
if (m1.find(v[i]) == m1.end()) {
m1[v[i]] = 0;
a.push_back(v[i]);
}
++m1[v[i]];
}
vector<int> b;
for (int i = 1; i < n; i += 2) {
if (m2.find(v[i]) == m2.end()) {
m2[v[i]] = 0;
b.push_back(v[i]);
}
++m2[v[i]];
}
sort(a.begin(), a.end(), comp1);
sort(b.begin(), b.end(), comp2);
long long ret = 0;
if (a[0] == b[0]) {
if (a.size() == 1 && b.size() == 1) {
ret = n / 2;
} else if (a.size() == 1 && b.size() > 1) {
ret = n - m1[a[0]] - m2[b[1]];
} else if (b.size() == 1 && a.size() > 1) {
ret = n - m1[a[1]] - m2[b[0]];
} else {
ret = n - max(m1[a[0]] + m2[b[1]], m1[a[1]] + m2[b[0]]);
}
} else {
ret = n - m1[a[0]] - m2[b[0]];
}
cout << ret << endl;
return 0;
} | 0 | 89,759,110 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um = unordered_map<ll,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void prt(T v){cout<<v<<'\n';}
template <typename T> inline bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> inline bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=(ll)1e9+7;
const ll MOD2=998244353;
const ld pi=3.14159265358979323846;
const ld eps=1e-10;
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
vl A={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};
ll N;
cin >> N;
prt(A[N-1]);
return 0;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, K;
cin >> n >> K;
string s;
cin >> s;
int res = 0;
vector<pair<int,int>> P;
for (int i = 0; i < n; ++i) {
int x = s[i] - '0';
int cnt = 1;
while (i + 1 < n && s[i + 1] == s[i]) {
++i;
++cnt;
}
P.emplace_back(x, cnt);
if (x == 1) {
res = max(res, cnt);
}
}
int N = P.size();
int sum = 0;
for (int i = 0, j = 0, k = 0; i < N; ++i) {
sum += P[i].second;
if (P[i].first == 0) {
++k;
}
while (k > K) {
if (P[j].first == 0) {
--k;
}
sum -= P[j].second;
++j;
}
res = max(res, sum);
}
cout << res << "\n";
return 0;
} | 0 | 9,844,203 |
#include <iostream>
int main() {
int num1, num2, num3;
int count = 0;
std::cin >> num1 >> num2 >> num3;
for (int i = 1; i <= num3; i++)
{
if (num3%i == 0) {
if (num1 <= i && i <= num2) count++;
}
}
std::cout << count << std::endl;
return 0;
} | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
int main(){
ll N;
cin >> N;
llvec S(N-1), C(N-1), F(N-1);
rep(i, N-1)cin >> C[i] >> S[i] >> F[i];
rep(from, N-1){
ll ans = 0;
for(ll i=from;i<N-1;i++){
ans = max(ans, S[i]);
ll tmp = (ans+F[i]-1)/F[i];
ans = max(ans, tmp*F[i]);
ans += C[i];
}
cout << ans << endl;
}
cout << 0 << endl;
return 0;
} | 0 | 5,501,706 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
ifstream cinn("ride.in");ofstream coutt("ride.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
int n,m;
int fr[100005];
int dp[100005];
signed main(){
FASTER;
cin>>n>>m;
for(int i=1;i<=m;i++){
int x;cin>>x;
fr[x]=1;
}
dp[0]=1;
dp[1]=1-fr[1];
for(int i=2;i<=n;i++){
if(!fr[i])dp[i]=(dp[i-1]+dp[i-2])%MOD;
}
cout<<dp[n];
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int score[300];
int m, mi, ma;
while (1)
{
cin >> m >> mi >> ma;
if (m == 0 && mi == 0 && ma == 0)break;
rep(i, m) cin >> score[i];
int maxScore = 0;
int ans = 0;
for (int i = mi - 1; i < ma; i++)
{
int d = abs(score[i] - score[i + 1]);
if (d >= maxScore)
{
maxScore = d;
ans = i + 1;
}
}
cout << ans << endl;
}
return 0;
} | 0 | 73,104,958 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
vector<pair<int,int>> P;
ll sum_p = 0;
vector<int> X(m, -1);
for(ll i=0; i<n; ++i){
if(X[x] > -1){
int cyc_len = P.size() - X[x];
int nxt_len = (n - X[x]) % cyc_len;
ll remain = P[X[x]].second;
ll cyc = (sum_p - remain) * ((n - X[x]) / cyc_len);
remain +=P[X[x]+nxt_len].second - P[X[x]].second;
cout<< cyc + remain <<endl;
return 0;
}
P.emplace_back(x, sum_p);
sum_p += x;
X[x] = i;
x = (ll)x*x % m;
}
cout<< sum_p <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, l, r, d1;
vector<pair<int,int>> e[100004];
bool visited[100004];
long long d[100004];
bool ok;
void dfs(int here){
visited[here] = true;
for(auto i : e[here]){
int there = i.first;
int dist = i.second;
if(!visited[there]){
d[there] = d[here] + dist;
dfs(there);
}
else
if(d[here]+dist != d[there])
ok = false;
}
return;
}
int main() {
cin>>n>>m;
while(m--){
cin>>l>>r>>d1;
e[l].push_back({r,d1});
e[r].push_back({l,-d1});
}
ok = true;
memset(visited,false,sizeof(visited));
memset(d,0,sizeof(d));
for(int i = 1; i<=n;i++){
if(visited[i]) continue;
d[i] = 0;
dfs(i);
}
cout<<(ok? "Yes" : "No");
return 0;
} | 0 | 19,317,663 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define uniq(x) (x).erase(unique(all(x)),(x).end())
typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue;
const int MAX = 200000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const int MOD = 1000000007;
int N, d, p;
ll M, ans = 0LL;
void solve(void){
while (1) {
scanf("%d %lld\n", &N, &M);
if (N==0&&M==0) return;
ans = 0LL;
vector <P> v(N);
rep(N, i) {
scanf("%d %d\n", &d, &p);
v.pb(P(p, d));
ans += p*d;
}
sort(all(v));
reverse(all(v));
for (P pd : v) {
if (pd.second > M) {
ans -= pd.first*M;
break;
}
ans -= pd.first*pd.second;
M -= pd.second;
}
printf("%lld\n", ans);
}
}
int main(void){
solve();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(){
string S,T;
cin >> S >> T;
vector<int> start(26,-1);
vector<int> goal(26,-1);
for(int i=0;i<S.size();i++){
int a=S[i]-'a';
int b=T[i]-'a';
if(start[a] != -1 || goal[b] != -1){
if(start[a] != b || goal[b]!=a){
cout << "No" << endl;
return 0;
}
}else{
start[a]=b;
goal[b]=a;
}
}
cout<<"Yes" << endl;
return 0;
} | 0 | 55,987,011 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin), freopen(s"out", "w", stdout)
#define ERROR return puts("Impossible"), 0
template<typename T>
inline void read(T &x) {
char ch, t = 0; x = 0;
while(!isdigit(ch = ge)) t |= ch == '-';
while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = ge;
x = t ? -x : x;
}
inline int read_int() { int x; return read(x), x; }
inline ll read_ll() { ll x; return read(x), x; }
template<typename T>
inline void chkmax(T&a, T b) { a = a > b ? a : b; }
int c[110];
int mx;
int main() {
#ifdef LOCAL
FILE("");
#endif
int n = ri;
for(int i = 1; i <= n; i++) {
int x = ri;
++c[x];
chkmax(mx, x);
}
int mi = (mx + 1) >> 1;
for(int i = mx; i > mi; --i) {
if(c[i] < 2) ERROR;
n -= c[i];
}
if(c[mi] != 1 + (mx & 1) || n != c[mi]) ERROR;
puts("Possible");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 105;
int n, a[N];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = 0;
int cnt = 1;
for (int i = 2; i <= n; i++) {
if (a[i] == a[i - 1]) cnt++;
else {
ans += cnt / 2;
cnt = 1;
}
}
cout << ans + cnt / 2;
return 0;
} | 0 | 25,110,381 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int A, B, X;
cin >> A >> B >> X;
if(A <= X && A + B >= X ) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll h[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int active = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (active < h[i]) {
ans += h[i]-active;
active = h[i];
}
else {
active = h[i];
}
}
cout << ans << endl;
return 0;
} | 0 | 62,409,758 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
int main() {
int n; cin >> n;
vector<ll> p(n);
REP(i, n) cin >> p[i];
vector<int> ord(n);
iota(ord.begin(), ord.end(), 1);
sort(ord.begin(), ord.end(), [&](int i, int j) {
return p[i - 1] > p[j - 1];
});
multiset<int> s; ll ans = 0;
REP(i, 2) {
s.insert(0); s.insert(n + 1);
}
for (int i : ord) {
auto itr = s.upper_bound(i);
auto w = *prev(itr, 2), x = *prev(itr), y = *itr, z = *next(itr);
ans += p[i - 1] * ((i - x) * (z - y) + (x - w) * (y - i));
s.insert(i);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int H, W, x, y, ans = 0, flag = 0;
queue<int> Qx, Qx_next; queue<int> Qy, Qy_next;
bool can_go(int x, int y){
return (1 <= x && x <= H && 1 <= y && y<= W);
}
void f(vector<vector<int>>& A, int x, int y){
if(can_go(x,y)){
if(A[x][y] == 1){
flag = 1;
A[x][y] = -1;
Qx_next.push(x);
Qy_next.push(y);
}
}
}
void visit(vector<vector<int>>& A, int x, int y){
f(A, x-1, y);
f(A, x+1, y);
f(A, x, y-1);
f(A, x, y+1);
}
int main(){
cin >> H >> W;
vector<vector<int>> A(H+1, vector<int>(W+1, 1));
char buf;
for(int i = 1; i <= H; ++i){
for(int j = 1; j <= W; ++j){
cin >> buf;
if(buf == '#'){
A[i][j] = -1;
Qx.push(i);
Qy.push(j);
}
}
}
while(!Qx.empty()){
x = Qx.front();
y = Qy.front();
Qx.pop();
Qy.pop();
visit(A, x, y);
if(Qx.empty()){
while(!Qx_next.empty()){
Qx.push(Qx_next.front()); Qx_next.pop();
Qy.push(Qy_next.front()); Qy_next.pop();
}
if(flag == 1)++ans;
flag = 0;
}
}
cout << ans << endl;
return 0;
} | 0 | 47,680,727 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
const int MAX_N = 2e5 + 100;
int N;
int main() {
cin >> N;
ll sum = 0;
int minV = INF;
for(int i=0; i<N; i++) {
int x, y; scanf("%d%d", &x, &y);
sum += x;
if(x > y && minV > y) minV = y;
}
if(minV == INF) puts("0");
else printf("%lld\n", sum-minV);
return 0;
} | #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<<62)-1
#define MAX 1000000000
signed main(){
int N,K; cin>>N>>K;
vi A(N+1);
REP(i,1,N) cin>>A[i];
int dp[N+1][K+1][K+1]={0};
REP(i,1,N){
REP(j,0,(min(i,K))){
REP(k,1,j) dp[i][j][k]=dp[i-1][j-1][k-1];
if(j<i){
dp[i][j][0]=INF;
if(j<i-1){
REP(k,0,j){
dp[i][j][0]=min(dp[i][j][0],dp[i-1][j][k]+max(0ll,A[i]-A[i-1-k]));
}
}
else dp[i][j][0]=dp[i-1][j][j]+A[i];
}
}
}
int ans=INF;
REP(i,0,K) ans=min(ans,dp[N][K][i]);
cout<<ans<<endl;
} | 0 | 91,058,931 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
long long int a,b,ans=0;
cin>>a>>b;
for(int i=0;b>=a;i++){
a=a*2;
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int ans = 0;
int acnt = 0, bcnt = 0, abcnt = 0;
for (int i = 0; i < n; i++) {
int m = s[i].length();
for (int j = 0; j < m - 1; j++) {
if (s[i][j] == 'A' && s[i][j+1] == 'B') ans++;
}
if (s[i][0] == 'B' && s[i][m-1] == 'A') abcnt++;
else if (s[i][0] == 'B') bcnt++;
else if (s[i][m-1] == 'A') acnt++;
}
if (acnt == 0 && bcnt == 0) ans += max(0, abcnt - 1);
else ans += abcnt + min(acnt, bcnt);
cout << ans << endl;
return 0;
} | 0 | 17,574,206 |
#include <iostream>
using namespace std;
int main(){
char s[200001],t[200001];
cin>>s>>t;
int i = 0, sum = 0;
while(s[i]!='\0'){
if(s[i]!=t[i])
sum++;
i++;
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
#include <boost/math/tools/minima.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define INF 3000000000000000000
#define MAX LLONG_MAX
#define PI 3.141592653589793238462
#define MOD 1000000007
using namespace std;
using boost::math::tools::brent_find_minima;
using boost::multiprecision::cpp_int;
void Vout(auto a){if(a.size()==0) cout<<"."<<endl;
else{rep(i,0,a.size()-1)cout<<a[i]<<' ';if(a.size()>0)cout<<a.back()<<endl;}return;}
void Verr(auto a){if(a.size()==0) cerr<<"."<<endl;
else{rep(i,0,a.size()-1)cerr<<a[i]<<' ';if(a.size()>0)cerr<<a.back()<<endl;}return;}
void VVout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())Vout(a[i]);}return;}
void VVerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())Verr(a[i]);}return;}
void VPout(auto a){if(a.size()==0)cout<<"."<<endl;
else{rep(i,0,a.size())cout<<a[i].FI<<' '<<a[i].SE<<endl;}return;}
void VPerr(auto a){if(a.size()==0)cerr<<"."<<endl;
else{rep(i,0,a.size())cerr<<a[i].FI<<' '<<a[i].SE<<endl;}return;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){if((n-r)<r)r=n-r;
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
int comb(int n, int r){if((n-r)<r)r=n-r;
int a=1;for(int i=n;i>n-r;--i){a=a*i%MOD;}for(int i=1;
i<r+1;++i){a=a*mypow(i,MOD-2,MOD)%MOD;}return a%MOD;}
Vi stpowV(){Vi a(100001);
a[0]=1;repeq(i,1,100000)a[i]=a[i-1]*i%MOD;return a;}
void press(auto &v){v.erase(unique(ALL(v)),v.end());}
Vi Vsum(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}
int keta(int k,int i){string s = itos(k);return s[s.size()-i]-'0';}
signed main() {
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
int n,m;
cin >> n >> m;
VVi sushi(100010);
int qw,er;
rep(i,0,n){
cin >> qw >> er;
qw--;
sushi[qw].pb(er);
}
rep(i,0,100010){
sortr(ALL(sushi[i]));
}
Vi itiban(0),zako(0);
rep(i,0,100010){
if(sushi[i].size()==0) continue;
int l = sushi[i].size();
rep(j,0,l){
if(j==0) itiban.pb(sushi[i][j]);
else zako.pb(sushi[i][j]);
}
}
sortr(ALL(itiban));
sortr(ALL(zako));
itiban = Vsum(itiban);
zako = Vsum(zako);
rep(i,0,100010){
itiban.pb(0);
zako.pb(0);
}
int ans = 0;
int now = 0;
repeq(i,1,m){
int l = m-i;
now = 0;
if(itiban[i]==0) continue;
now += itiban[i];
now += zako[l];
now += i*i;
ans = max(ans,now);
}
cout << ans << endl;
return 0;
} | 0 | 52,356,109 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
long long ans = 0;
for(int i = 0; i< N; i++){
ans += A[i] / 2;
if(i < N - 1) {
if(A[i + 1] > 0){
ans += A[i] % 2;
A[i + 1] -= A[i] % 2;
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
const int INF = 1<<20;
const double EPS = 1e-9;
double zero(double d){
return d < EPS ? 0.0 : d;
}
typedef long long LL;
typedef pair<int,int> P;
int main()
{
cout.setf(ios::fixed, ios::floatfield);
cout.precision(7);
const int TOWN = 10;
int n;
while(cin>>n,n){
int cost[TOWN][TOWN];
REP(i,TOWN){
fill( cost[i], cost[i]+TOWN, INF );
cost[i][i]=0;
}
int tnum = 0;
REP(_t,n){
int a,b,c;
cin >>a>>b>>c;
cost[a][b] = cost[b][a] = c;
tnum = max( tnum, max(a,b) );
}
tnum++;
REP(k,tnum){
REP(i,tnum)
REP(j,tnum)
cost[i][j] = min( cost[i][j], cost[i][k] + cost[k][j] );
}
int res=INF;
int num=0;
REP(i,tnum){
int tmp=0;
REP(j,tnum){
tmp += cost[i][j];
}
if( res > tmp ){
res = tmp;
num = i;
}
}
cout << num << " " << res << endl;
}
return 0;
} | 0 | 6,347,272 |
#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() {
string s, t;
cin >> s;
cin >> t;
rep(i,s.size()) {
if (s==t) {
cout << "Yes" << endl;
return 0;
} else {
char lastchar=t.at(t.size()-1);
t.pop_back();
t = lastchar + t;
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define ld long double
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
const int N = 3e5 + 100, OO = 1e9, T = 4500 + 100, M = 1e9 + 7, P = 6151, SQ = 280, lg = 30;
typedef pair <int, int> pii;
vector <int> v[N];
int dfs(int x, int y) {
int ans = 0;
for(auto u : v[x])
if(u != y)
ans ^= (dfs(u, x) + 1);
return ans;
}
int32_t main() {
use_fast;
int n;
cin >> n;
for(int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
if(dfs(1, 0))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
} | 0 | 55,335,008 |
#include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e18
#define fastRead ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const ll MOD = 1e9 + 7;
const int MAX = 1e6+ 6;
vector<int>edg[MAX];
ll dp[MAX][2];
void dfs(int node, int p) {
dp[node][0] = dp[node][1] = 1;
int cnt = 0;
for(auto x: edg[node]) {
if( p == x) continue;
cnt++;
}
if(cnt == 0) return ;
for(auto x : edg[node]) {
if(x == p) continue;
dfs(x, node);
dp[node][1] = (dp[node][1] * dp[x][0])%MOD;
dp[node][0] = (dp[node][0] * (dp[x][0] + dp[x][1]) %MOD) %MOD;
}
}
int main()
{
fastRead;
int n;
cin>>n;
for(int i =1 ;i < n ; i++ ) {
int u, v;
cin>>u>>v;
edg[u].push_back(v);
edg[v].push_back(u);
}
dfs(1, -1);
cout<<(dp[1][0] + dp[1][1])%MOD<<'\n';
} | #include <iostream>
#include <stack>
using namespace std;
void startstack(stack<int> &st){
st.empty();
st.push(0);
}
void clear(string &tmp){
int j;
do{
for(j=0;tmp[j];j++);
if(tmp[--j]=='.') break;
}while(getline(cin,tmp));
}
int main(){
int i,j;
stack<int> st;
string tmp;
startstack(st);
getline(cin,tmp);
while(tmp!="."){
for(i=0;tmp[i];i++){
if(tmp[i]=='('||tmp[i]=='['){
st.push(tmp[i]);
}
if(tmp[i]==']'){
if(st.top()=='[') st.pop();
else {startstack(st);
cout <<"no\n";
clear(tmp);
break;}
}
if(tmp[i]==')'){
if(st.top()=='(') st.pop();
else {startstack(st);
clear(tmp);
cout <<"no\n";
break;
}
}
if(tmp[i]=='.'){
if(st.top()==0) {cout <<"yes\n";
startstack(st);}
else {
cout <<"no\n";
startstack(st);
break;}
}
}
getline(cin,tmp);
}
return 0;
} | 0 | 93,594,034 |
#include <iostream>
std::string str_repeat(char c, int n)
{
std::string str = "";
while (n--) {
str += c;
}
return str;
}
int main(void)
{
int h, w;
while (std::cin >> h >> w) {
if (h == 0 && w == 0) break;
h -= 2;
std::cout << str_repeat('#', w) << std::endl;
while (h--) {
std::cout << "#" << str_repeat('.', w - 2) << "#" << std::endl;
}
std::cout << str_repeat('#', w) << std::endl << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
char toLowerCase(char c){
if(isLowerCase(c)){
return c;
}else{
return c+'a'-'A';
}
}
char toUpperCase(char c){
if(isLowerCase(c)){
return c-('a'-'A');
}else{
return c;
}
}
ll powm(ll a,ll n, ll m){
ll ret=1;
while(n>0){
if(n%2==1){
ret=(ret*a)%m;
}
n>>=1;
a=(a*a)%m;
}
return ret;
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
void func(vector<int>& l, int depth, int idx){
;
}
int main() {
int n;cin>>n;
vector<string> s(n);
vector<int> t(n);
for(int i=0;i<n;i++){
cin>>s[i];
cin>>t[i];
}
string x;cin>>x;
int ans=0;
bool found=false;
for(int i=0;i<n;i++){
if(found){
ans+=t[i];
}
if(s[i]==x){
found=true;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 13,203,377 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<pair<int64_t, int> > vec(n);
rep(i, n) {
int64_t a;
int b;
cin >> a >> b;
vec.at(i) = make_pair(a, b);
}
sort(vec.begin(), vec.end());
int64_t res = 0;
rep(i, n) {
int num = min(m, vec.at(i).second);
res += vec.at(i).first * num;
m -= num;
}
cout << res << endl;
} | #include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
int main(){
long int A,B,C,p,i;
p = 0;
cin >> A >> B >> C;
for(i = A;i <= A * B + 2;i += A){
if(i % B == C){
cout << "YES" << endl;
p = 1;
break;
}
}
if(p != 1){
cout << "NO" << endl;
}
} | 0 | 31,578,591 |
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
namespace
{
static std::array<int, 1000001> ng_nums = {};
static std::array<int, 1000001> num_count = {};
}
namespace ABC170
{
class D
{
public:
D() = default;
~D() = default;
void Run()
{
int N;
std::cin >> N;
std::vector<int>A = {};
for (int i = 0; i < N; ++i)
{
int v;
std::cin >> v;
A.push_back(v);
}
std::sort(A.begin(), A.end());
for(auto v : A)
{
if (ng_nums[v] == 0)
{
if (num_count[v] == 1) { ng_nums[v] = 1; }
for (int i = v + v; i <= 1000000; i += v)
{
ng_nums[i] = 1;
}
}
num_count[v] = 1;
}
int count = 0;
for (int i = 0; i < N; ++i)
{
if (ng_nums[A[i]] == 0) count++;
}
std::cout << count << std::endl;
}
};
}
int main()
{
ABC170::D prob;
prob.Run();
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int a[10];
int out[3] = {0, 0, 0};
for (int i = 0; i < 10; ++i) cin >> a[i];
for (int i = 0; i < 10; ++i){
if (a[i] >= out[0]){
out[2] = out[1];
out[1] = out[0];
out[0] = a[i];
}
else if (a[i] >= out[1]){
out[2] = out[1];
out[1] = a[i];
}
else if (a[i] >= out[2]){
out[2] = a[i];
}
}
for (int i = 0; i < 3; ++i) cout << out[i] << endl;
return 0;
} | 0 | 62,252,348 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int n;
cin >> n;
rep(i,n){
int y,m,d,ans=0;
cin >> y >> m >> d;
while(y<1000){
while(m<=10){
while(d<=19){
d++; ans++;
}
if(y%3==0 || m%2 == 1) ans++;
d=1;
m++;
}
m=1;
y++;
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) cin >> A[i];
int64_t ans = 0;
while(true){
bool updated = false;
for(int i=0; i<N; i++){
int64_t d = A[i]/N;
ans += d;
if(d > 0) updated = true;
A[i] %= N;
for(int j=0; j<N; j++) if(j!=i) A[j] += d;
}
if(!updated) break;
}
cout << ans << endl;
} | 0 | 40,336,825 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, k;
cin >> a >> b >> k;
if(a>=k)a-=k;
else if(a+b>k){
b-=k-a;
a=0;
}
else{
a=0;
b=0;
}
cout << a << " " << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long a[n];
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
sort(a, a + n);
for (int i = 0; i < n - 1; i++) a[i + 1] += a[i];
int k = 0;
for (int i = 0; i < n - 1; i++)
if (a[i] * 3 < a[i + 1]) k = i + 1;
printf("%d\n", n - k);
return 0;
} | 0 | 57,657,330 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<int>
#define vvint vector<vint>
#define P pair<ll,ll>
#define INT_MAX 2147483647
#define MOD 998244353
#define PI 3.14159265358979323846
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
#define MAX 1000000000000
int main(void) {
int n; cin >> n;
n--;
vint b(n);
rep(i, n) {
cin >> b[i];
}
int ans = b[0];
for (int i = 1; i <n; i++) {
ans += min(b[i-1], b[i]);
}
ans += b[n - 1];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<< ": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define cases int testcases;cin>>testcases; while(testcases--)
const int N = 200005;
int len(int n)
{
int ans = 0;
while(n)
{
ans++;
n/=10;
}
return ans;
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n;
cin >> n;
int ans = 0;
int pos = 1;
for(int i =1; i <= n; i++)
{
int k = i;
int ans1 =0;
while(k%2 == 0)
{
k/=2;
ans1++;
}
if(ans < ans1)
{
ans = ans1;
pos = i;
}
}
cout << pos;
return 0;
} | 0 | 63,118,345 |
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a) a = b; }
int main() {
ll X, N;
ll ans=0;
cin >> X >> N;
vector<ll> p(N);
rep(i,N) cin >> p[i];
for (ll i=0; i<=100; ++i) {
if (find(p.begin(), p.end(), X-i) == p.end()) {
ans = X-i;
break;
}
if (find(p.begin(), p.end(), X+i) == p.end()) {
ans = X+i;
break;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
using ll = long long int;
using p = pair<int, int>;
using pl = pair<ll, ll>;
using v = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vl = vector<ll>;
using vpl = vector<pl>;
int main()
{
int m;
cin >> m;
vpl dc(m);
rep(i, m)
{
cin >> dc[i].first >> dc[i].second;
}
ll round = 0;
ll totallen = 0;
ll total = 0;
rep(i, m)
{
totallen += dc[i].second;
total += dc[i].first * dc[i].second;
}
round = (totallen - 1) + ( (total - 1) / 9);
cout << round << endl;
} | 0 | 22,826,997 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const double PI = 3.14159265358979323846;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
#define H_MAX 500
#define W_MAX 500
#define INF 1e9 + 7
const ll mod = 1000000007;
int main() {
int cnt = 0;
string S;
cin >> S;
if (S == "RRR") {
cout << 3 << endl;
} else if (S == "RRS" || S == "SRR") {
cout << 2 << endl;
} else if (S == "RSS" || S == "SRS" || S == "SSR" || S == "RSR") {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
int main() {
for (;;) {
int n;
cin >> n;
if (n == 0) break;
int x = 0, l = 0, r = 0, cnt = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s == "lu") l++;
else if (s == "ru") r++;
else if (s == "ld") l--;
else r--;
if (l == r && l != x) cnt++, x = l;
}
printf("%d\n", cnt);
}
return 0;
} | 0 | 100,006,336 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[4][3][10];
for(int h=0;h<4;h++){
for(int i=0;i<3;i++){
for(int j=0;j<10;j++){
a[h][i][j]=0;
}
}
}
int b;
cin>>b;
for(int c=0;c<b;c++){
int d,e,f,g;
cin>>d>>e>>f>>g;
d--;e--;f--;
a[d][e][f]+=g;
}
for(int h=0;;h++){
for(int i=0;i<3;i++){
for(int j=0;j<10;j++){
cout<<" "<<a[h][i][j];
}
cout<<endl;
}
if(h==3)break;
cout<<"####################"<<endl;
}
} | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
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; }
void solve() {
int n,k;
cin >> n >> k;
VLL a(n);
REP(i,0,n) cin >> a[i];
VLL ru(n+1), ss(n);
REP(i,0,n) ru[i+1] = ru[i] + max(0LL, a[i]);
REP(i,0,k) ss[k-1] += a[i];
REP(i,k,n) ss[i] = ss[i-1] + a[i] - a[i-k];
LL ans = ru[n-k];
REP(i,k-1,n) {
chmax(ans, ru[n]-ru[i+1]+ru[i+1-k] + max(0LL, ss[i]));
}
cout << ans << endl;
}
signed main() {
solve();
return 0;
} | 0 | 47,637,556 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<vector<int>> ar(n,vector<int>(3));
for(int i=0;i<n;++i)
{
cin>>ar[i][0]>>ar[i][1]>>ar[i][2];
}
vector<vector<int>> dp(n,vector<int>(3,0));
dp[0][0]=ar[0][0];
dp[0][1]=ar[0][1];
dp[0][2]=ar[0][2];
for(int i=1;i<n;++i)
{
for(int j=0;j<3;++j)
{
for(int k=0;k<3;++k)
{ if(j==k)
continue;
dp[i][j]=max(dp[i][j],ar[i][j]+dp[i-1][k]);
}
}
}
cout<<max({dp[n-1][0],dp[n-1][1],dp[n-1][2]})<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
vector<int>alf1(26),alf2(26);
rep(i, 0, n){
alf1[s[i]-'a']++;
alf2[t[i]-'a']++;
}
sort(alf1.begin(), alf1.end());
sort(alf2.begin(), alf2.end());
if(alf1==alf2)cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 | 19,210,755 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
vector<ll> sum;
ll i;
void pre_process(vector<ll> &a,vector<ll> &s){
ll n=(ll)a.size();
s.assign(n+1,0);
for(i=0;i<n;i++){
s[i+1]=s[i]+a[i];
}
}
ll query(ll i,ll j,vector<ll> &s){
return s[j]-s[i];
}
int main(){
ll n,k;cin>>n>>k;
string s;cin>>s;
vector<ll> a;
if(n==1){cout<<"1"<<endl;return 0;}
vector<ll> Nums;
int now=1;
int cnt=0;
for(i=0;i<n;i++){
if(s[i]==(char)('0'+now)){cnt++;}
else{
Nums.push_back(cnt);
now=1-now;
cnt=1;
}
}
if(cnt!=0){Nums.push_back(cnt);}
if(Nums.size()%2==0){Nums.push_back(0);}
pre_process(Nums,sum);
ll add=2*k+1;
ll ans=-1;
for(i=1;i<=sum.size()-add;i+=2){
if(i+add-1>sum.size()){cout<<n<<endl;return 0;}
ans=max(ans,query(i-1,i+add-1,sum));
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long fibonatti(long long d){
long long count = 0;
long long f1 = 1;
long long f2 = 1;
long long temp;
if(d == 1){
count = f1;
}else if(d == 2){
count = f2;
}else if(d==0){
count = 1;
}else{
for(int i=0;i<d-2;i++){
temp = f1+f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
unsigned long long GCD(long long L,long long R){
if(L>R){
long long temp=R;
R = L;
L = temp;
}
unsigned long long pp=0,ppt=0;
unsigned long long ans=0;
if(R%L==0){
ans = L;
}else{
while(true){
ppt = pp;
pp=R%L;
if(pp == 0){
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
unsigned long long LCM(long long L,long long R){
unsigned long long ans;
unsigned long long gcd = GCD(L,R);
ans = (L/gcd)*R;
return ans;
}
#define mod 1000000007
#define maxcomb 3000
vector<long long> fc(maxcomb+1);
vector<long long> ifc(maxcomb+1);
long long modpow(long long x,long long n){
long long ans = 1;
while(n > 0){
if(n & 1) {
ans = ans*x%mod;
}
x = x*x%mod;
n >>= 1;
}
return ans;
}
void Conb(){
fc[0]= 1;
ifc[0]=1;
for(long long i=0;i<maxcomb;i++){
fc[i+1] = fc[i]*(i+1)%mod;
ifc[i+1] = ifc[i]*modpow(i+1,mod-2)%mod;
}
}
unsigned long long Combination(long long L,long long R){
unsigned long long up=1,ans;
Conb();
if(L==0&&R==0){
return 1;
}else if(L<R||L<0){
return 0;
}else{
long long t = ifc[L-R]*ifc[R]%mod;
ans = t*fc[L]%mod;
}
return ans;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
int maxx = 0;
for(int i=0;i<N;i++){
cin >> A[i];
if(maxx<A[i]){
maxx = A[i];
}
}
bool b = false;
int maxd=0;
int count = 0;
for(int i=0;i<N;i++){
if(A[i]==maxx){
count++;
}
if(maxd<A[i]&&maxx>A[i]){
maxd = A[i];
}
if(count==2){
b = true;
}
}
if(b==true){
for(int i=0;i<N;i++){
cout << maxx << endl;
}
}else{
for(int i=0;i<N;i++){
if(A[i]!=maxx){
cout << maxx << endl;
}else{
cout << maxd << endl;
}
}
}
} | 0 | 64,546,148 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
int ans = 100;
for(int i=1; (ll)i*i<=n; ++i){
if(n%i == 0){
ll x = n/i;
int nans = 0;
while(x>0){
x /= 10;
nans++;
}
ans = min(ans,nans);
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n) cin >> a[i + 1];
rep(i, n) a[i + 1] += a[i];
sort(a.begin(), a.end());
ll ans = 0;
vector<ll> res;
int p = a[0];
int q = 1;
rep(i, n){
if (a[i] != a[i + 1]){
res.pb(q);
q = 1;
}
else q++;
}
res.pb(q);
rep(i, res.size()) ans += res[i] * (res[i] - 1) / 2;
cout << ans << endl;
} | 0 | 68,523,876 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int W, H, N;
cin >> W >> H >> N;
int x1 = 0, x2 = W + 1, y1 = 0, y2= H + 1;
int x , y , a;
for (int i = 1; i <= N; i++) {
cin >> x >> y >> a;
if(a == 1) {
x1 = max(x1, x);
}
else if (a == 2) {
x2 = min(x2, x);
}
else if (a == 3) {
y1 = max(y1, y);
}
else if ( a == 4) {
y2 = min(y2, y);
}
}
if(x2 <= W){
W = x2;
}
W -= x1;
if(y2 <= H) {
H = y2;
}
H -= y1;
if(W <= 0 || H <= 0) {
cout << 0;
}
else {
cout << W*H;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 25,625,119 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i] = a[i]-1;
int ans = 1;
int p1=a[0];
rep(i,100000){
if(p1 == 1){
cout << ans << endl;
return 0;
}
p1 = a[p1];
ans++;
}
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int ans = 0;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
ans += v[i] * v[j];
}
}
cout << ans << "\n";
} | 0 | 10,467,516 |
#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] -= i;
}
sort(A.begin(), A.end());
int mid = A[N / 2];
long long ans = 0;
for (int i = 0; i < N; ++i) {
ans += abs(A[i] - mid);
}
cout << ans << endl;
return 0;
} | #include<stdio.h>
#include<algorithm>
#include<iostream>
#include<math.h>
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
ll n,vis[MAX];
ll fac[MAX]={1,1};
ll inv[MAX]={1,1};
ll fi[MAX]={1,1};
void init()
{
for(int i=2;i<MAX;i++)
{
fac[i]=fac[i-1]*i%mod;
inv[i]=(mod-mod/i)*inv[mod%i]%mod;
fi[i]=fi[i-1]*inv[i]%mod;
}
}
ll C(ll n,ll m)
{
return fac[n]*fi[n-m]%mod*fi[m]%mod;
}
ll x,d;
int main()
{
init();
scanf("%lld",&n);
for(ll i=1;i<=n+1;i++)
{
scanf("%lld",&x);
if(vis[x])
d=vis[x]+n-i;
vis[x]=i;
}
ll ans=0;
for(ll i=1;i<=n+1;i++)
{
ans=C(n+1,i)%mod;
if(d>=i-1)
ans=(ans-C(d,i-1)+mod)%mod;
printf("%lld\n",ans);
}
return 0;
} | 0 | 66,283,645 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
double sum = 0;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
sum += A[i];
}
int cnt = 0;
rep(i, N) {
if (A[i] >= (double)(sum / (4 * M))) cnt++;
}
if (cnt >= M)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<P,int>
#define vpp vector<PP>
#define fi first
#define se second
#define INF (1<<30)
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
int sum=0;
int i=0;
while(sum<n){
i++;
sum+=i;
}
FOR(j,1,i+1){
if(j==sum-n){
continue;
}
cout<<j<<endl;
}
return 0;
} | 0 | 46,928,494 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#'){
hi[i]=true;
wi[j]=true;
}
}
}
for(int i=0;i<h;++i){
if(hi[i]){
for(int j=0;j<w;++j){
if(wi[j]){
cout<<m[i][j];
}
}
cout<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool compare(const vector<long long> &a, const vector<long long> &b) {
return atan2(a[1], a[0]) < atan2(b[1], b[0]);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<vector<long long>> coords;
for (int i = 0; i < N; i++) {
vector<long long> coord(2);
cin >> coord[0] >> coord[1];
coords.push_back(coord);
}
sort(coords.begin(), coords.end(), compare);
long long maxDist = 0;
for (int i = 0; i < N; i++) {
long long x = 0, y = 0;
for (int j = i; j < i + N; j++) {
x += coords[j % N][0];
y += coords[j % N][1];
maxDist = max(maxDist, x * x + y * y);
}
}
cout << fixed << setprecision(11) << sqrt(maxDist) << '\n';
return 0;
} | 0 | 34,134,475 |
#include <iostream>
using namespace std;
int main(){
int n,m;
while(cin >> n >> m , n || m){
int data[11] = {0};
for(int i=0;i<n;i++){
int a,b;
cin >> a >> b;
data[b] += a;
}
for(int i=10;i>=0;i--){
if(data[i] <= m ){
m -= data[i];
data[i] = 0;
}else{
data[i] -= m;
m = 0;
}
}
int ans = 0;
for(int i=0;i<=10;i++)
ans += i * data[i];
cout << ans << endl;
}
} | #include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
bool isPrime(int n){
if(n < 2){
return 0;
}
if(n%2 == 0){
return n==2;
}
for(int i=3;i*i<=n;i++){
if(n%i == 0) return 0;
}
return 1;
}
void allPoss(int indx,int n,vector<int> v,vector<vector<int>> &vv){
if(indx == n) {
vv.push_back(v);
return;
}
v.push_back(indx);
allPoss(indx+1,n,v,vv);
v.pop_back();
allPoss(indx+1,n,v,vv);
}
int main() {
int n,m,k;
cin>>n>>m>>k;
vector<vector<char>> g(n,vector<char>(m));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)cin>>g[i][j];
}
vector<vector<int>> vn;
vector<vector<int>> vm;
vector<int> v;
allPoss(0,n,v,vn);
v.clear();
allPoss(0,m,v,vm);
int f = 0;
for(int i=0;i<vn.size();i++){
for(int j=0;j<vm.size();j++){
vector<vector<char>> gg(n,vector<char>(m));
for(int ii=0;ii<n;ii++){
for(int ji=0;ji<m;ji++)gg[ii][ji]=g[ii][ji];
}
for(int r=0;r<vn[i].size();r++){
for(int h=0;h<m;h++)gg[vn[i][r]][h] = '.';
}
for(int c=0;c<vm[j].size();c++){
for(int h=0;h<n;h++)gg[h][vm[j][c]] = '.';
}
int l =0;
for(int ii=0;ii<n;ii++){
for(int ji=0;ji<m;ji++){
if(gg[ii][ji] == '#') l++;
}
}
if(l == k)f++;
}
}
cout<<f<<endl;
return 0;
} | 0 | 54,749,119 |
#include <iostream>
using namespace std;
#define LISTSIZE 10000
int main(){
int n[LISTSIZE];
int x = 1;
int i = 0;
while (1){
cin >> x;
if (x==0) {
break;
}
n[i] = x;
i += 1;
}
for (int t=0; t<i; t=t+1) {
cout << "Case " << t+1 << ": " << n[t] << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define SZ(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define f0(i,b) for(int i=0;i<(b);i++)
#define f1(i,b) for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define CIN ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define TEST_CASE(t) for(int zz=1 ; zz<=t ; zz++)
#define PRINT_CASE printf("Case %d: ",zz)
#define Debug(x) cout<<#x " = "<<(x)<<endl
#define NOT_VISITED 0
#define IS_VISITED 1
#define WHITE 0
#define GRAY 1
#define BLACK 2
int fx[4]= {1,-1,0,0};
int fy[4]= {0,0,1,-1};
const double PI = acos(-1.0);
const double EPS = 1e-6;
const int MOD = (int)1e9+7;
const int maxn = (int)1e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, ll> pill;
char str[maxn], ans[maxn];
int n;
bool check(){
for(int i=3 ; i<=n ; i++){
if(ans[i-1]=='S'){
if(str[i-1]=='o'){
if(ans[i-2]=='S') ans[i]='S';
else ans[i]='W';
}else {
if(ans[i-2]=='S') ans[i]='W';
else ans[i]='S';
}
}else {
if(str[i-1]=='o'){
if(ans[i-2]=='S') ans[i]='W';
else ans[i]='S';
}else {
if(ans[i-2]=='S') ans[i]='S';
else ans[i]='W';
}
}
}
if(ans[1]=='S'){
if(str[1]=='o'){
if(ans[2]!=ans[n]) return false;
}else{
if(ans[2]==ans[n]) return false;
}
}else {
if(str[1]=='o'){
if(ans[2]==ans[n]) return false;
}else {
if(ans[2]!=ans[n]) return false;
}
}
if(ans[n]=='S'){
if(str[n]=='o'){
if(ans[n-1]!=ans[1]) return false;
}else {
if(ans[n-1]==ans[1]) return false;
}
}else {
if(str[n]=='o'){
if(ans[n-1]==ans[1]) return false;
}else {
if(ans[n-1]!=ans[1]) return false;
}
}
return true;
}
void printAns(){
f1(i,n){
printf("%c", ans[i]);
}
printf("\n");
}
int main() {
CIN
sf(n);
scanf("%s", str+1);
ans[1]='S';
ans[2]='S';
if(check()){
printAns();
return 0;
}
ans[1]='W';
ans[2]='W';
if(check()){
printAns();
return 0;
}
ans[1]='S';
ans[2]='W';
if(check()){
printAns();
return 0;
}
ans[1]='W';
ans[2]='S';
if(check()){
printAns();
return 0;
}
printf("-1");
return 0;
} | 0 | 63,261,672 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,a,b;
cin>>n>>a>>b;
if(a>b){
cout<<0<<endl;
}
else if(a==b){
cout<<1<<endl;
}
else{
if(n-2>=0){
cout<<b*(n-2)-a*(n-2)+1<<endl;
}
else{
cout<<0<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
int num = o.size() + e.size(), o_idx = 0, e_idx = 0;
string ans;
for (int i=0; i<num; i++){
int temp = i + 1;
if (temp%2 == 0){
ans += e.at(e_idx);
e_idx++;
}
else {
ans += o.at(e_idx);
o_idx++;
}
}
cout << ans << endl;
return 0;
} | 0 | 53,241,469 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a;
cin>>a;
if(a-'a'>=0){
cout<<"a"<<endl;
}
else {
cout<<"A"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
int N;
Vl B;
Vl csum;
ll fun(ll b) {
int idx = lower_bound(B.begin(), B.end(), b) - B.begin();
ll res = b * (idx * 2 - N) + csum[N] - csum[idx] * 2;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
B.resize(N);
csum.resize(N + 1);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
B[i] = a - (i + 1);
}
sort(B.begin(), B.end());
for (int i = 0; i < N; i++) {
csum[i + 1] = csum[i] + B[i];
}
ll t0, t1, t2, t3;
t0 = -1e9, t3 = 1e9;
while (t3 - t0 > 2) {
t1 = (t0 * 2 + t3) / 3;
t2 = (t0 + t3 * 2) / 3;
ll f1 = fun(t1);
ll f2 = fun(t2);
if (f1 <= f2) {
t3 = t2;
}
else {
t0 = t1;
}
}
cout << min(fun(t0), min(fun(t0 + 1), fun(t0 + 2))) << endl;
return 0;
} | 0 | 32,149,705 |
#include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define frepi(a,b) for(int i=a;i<=b;++i)
void solve_main()
{
int x;cin>>x;
int ans;
if(x>=1800)ans=1;
else if(x>=1600)ans=2;
else if(x>=1400)ans=3;
else if(x>=1200)ans=4;
else if(x>=1000)ans=5;
else if(x>=800)ans=6;
else if(x>=600)ans=7;
else if(x>=400)ans=8;
cout<<ans<<"\n";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("/home/suryakant/input.txt","r",stdin);
freopen("/home/suryakant/output.txt","w",stdout);
#endif
int t=1;
while(t--)
{
solve_main();
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <queue>
#include <numeric>
#include <iomanip>
using namespace std;
#define ll long long
constexpr ll inf = 1e9+7;
int main () {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin>>N;
vector<double> ts(N), vs(N);
for (ll n = 0; n < N; n++) cin>>ts[n];
for (ll n = 0; n < N; n++) cin>>vs[n];
double T = accumulate(begin(ts), end(ts), 0.0);
vector<double> v(2*T+1);
for (ll t = 0; t <= 2*T; t++) v[t] = min(0.5*t, T-0.5*t);
double t_begin = 0;
for (ll n = 0; n < N; n++) {
for (ll t = 0; t <= 2*T; t++) {
double new_v;
if (0.5 * t < t_begin) new_v = (t_begin - 0.5 * t) + vs[n];
else if (0.5 * t < t_begin + ts[n]) new_v = vs[n];
else new_v = (0.5 * t - t_begin - ts[n]) + vs[n];
v[t] = min(v[t], new_v);
}
t_begin += ts[n];
}
double ans = 0.0;
for (ll t = 0; t < 2*T; t++) ans += 0.5 * (v[t] + v[t+1]) / 2.0;
cout<<setprecision(8)<<ans<<endl;
return 0;
} | 0 | 77,705,386 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0, cnt2 = 0, cnt3 =0;
rep(i, n) {
int p;
cin >> p;
if(p <= a) {
cnt1++;
}
else if(p <= b) {
cnt2++;
}
else {
cnt3++;
}
}
int ans = min({cnt1, cnt2, cnt3});
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
int N,K; cin>>N>>K;
if(K > (N-1)*N/2 - (N-1)){
cout<<-1<<endl;
return 0;
}
int k = (N-1)*(N-2)/2;
vector<pair<int,int>> res;
rep1(i,N)res.push_back(make_pair(1,i+1));
for(int i = 2; i < N; i++){
if(K==k)break;
for(int j = i+1; j <= N; j++){
k--;
res.push_back(make_pair(i,j));
if(K==k)break;
}
}
cout<<res.size()<<endl;
for(auto p: res){
cout<<p.first<<" "<<p.second<<endl;
}
return 0;
} | 0 | 94,464,739 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
int x = 0;
for (char c : s) {
x += (int)(c - '0');
}
if (x % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<iostream>
#include<list>
#include<cstring>
#include<algorithm>
#include <utility>
#include<stdio.h>
#include<climits>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
int main(){
int n,x,y;
int i,j,k,l;
string str;
cin >> n;
for(i = 0;i < n;i++){
cin >> str;
x = 0;
l = 1;
for(k = 0;k < str.length();k++){
switch(str[k]){
case 'm':
x += l*1000;
l = 1;
break;
case 'c':
x += l*100;
l = 1;
break;
case 'x':
x += l*10;
l = 1;
break;
case 'i':
x += l;
l = 1;
break;
default:
l = str[k]-'0';
break;
}
}
cin >> str;
y = 0;
l = 1;
for(k = 0;k < str.length();k++){
switch(str[k]){
case 'm':
y += l*1000;
l = 1;
break;
case 'c':
y += l*100;
l = 1;
break;
case 'x':
y += l*10;
l = 1;
break;
case 'i':
y += l;
l = 1;
break;
default:
l = str[k]-'0';
break;
}
}
x += y;
if(x/1000){
if(x/1000>1) cout << x/1000;
cout << 'm';
x %= 1000;
}
if(x/100){
if(x/100>1) cout << x/100;
cout << 'c';
x %= 100;
}
if(x/10){
if(x/10>1) cout << x/10;
cout << 'x';
x %= 10;
}
if(x){
if(x>1) cout << x;
cout << 'i';
}
cout << endl;
}
} | 0 | 98,422,149 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA_ARGS__);cout<<endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head,class... Args>void show(Head t,Args... args){std::cout<<t<<" ";show(args...);}
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define REP1(i, n) for(ll i = 1; i <= n; i++)
#define REPR1(i, n) for(ll i = n; i >= 1; i--)
#define FOR1(i, m, n) for(ll i = m; i <= n; i++)
const ll INF = LLONG_MAX;
const ull MOD = 1000000007;
#define VEC(type,A,N) vector<type> A(N)
#define VECi(type,A,N,i) vector<type> A(N,i)
#define VEC2(type,A,N,M) vector<vector<type>> A(N,vector<type>(M))
#define VEC2i(type,A,N,M,i) vector<vector<type>> A(N,vector<type>(M,i))
#define ALL(v) v.begin(), v.end()
ll frac(ll k){
int s = 1;
for (ll i=1; i<=k; ++i)s *= i;
return s;
}
ll gcd(ll a, ll b){
if (a%b==0)return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll antidiv(ll N,ll C,ll D){
return N-floor(N/C)-floor(N/D)+floor(N/lcm(C,D));
}
vector<ll> yakusuu(ll N){
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N) ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main(){
ll N,M;
cin>>N>>M;
cout<<((1900*M)+(100*(N-M)))*pow(2,M);
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
typedef pair<int,int> P;
typedef long long ll;
int main(){
int H, W, D; cin >> H >> W >> D;
vector<P> mp(H * W);
rep(i, 0, H) rep(j, 0, W){
int p; cin >> p; p--;
mp[p] = {i,j};
}
int Q; cin >> Q;
vector<int> L(Q), R(Q);
rep(i, 0, Q) cin >> L[i] >> R[i], L[i]--, R[i]--;
vector<ll> sum(H * W);
rep(i, 0, H * W){
if(i < D) sum[i] = 0;
else{
int dx = abs(mp[i].first - mp[i-D].first);
int dy = abs(mp[i].second - mp[i-D].second);
sum[i] = sum[i - D] + dx + dy;
}
}
rep(i, 0, Q){
cout << sum[R[i]] - sum[L[i]] << endl;
}
} | 0 | 73,227,555 |
#include<iostream>
void sort(int*,int*,int*);
void swap(int*,int*);
void print(int,int,int);
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
sort(&a,&b,&c);
print(a,b,c);
return 0;
}
void sort(int* a,int* b,int* c){
if(*a>*b){
swap(*a,*b);
}
if(*b>*c){
swap(*b,*c);
}
if(*a>*b){
swap(*a,*b);
}
}
void swap(int x,int y){
int tmp=x;
x=y;
y=tmp;
}
void print(int a,int b,int c){
cout<<a<<" "<<b<<" "<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
int L = 0;
int R = 0;
int LR = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int k = s.size();
if (s[0] == 'B' && s[k-1] == 'A') LR++;
else if (s[0] == 'B') L++;
else if (s[k-1] == 'A') R++;
for (int j = 0; j < k-1; j++) {
if (s.substr(j,2) == "AB") {
count += 1;
j += 1;
}
}
}
if (LR > 0) {
count += LR-1;
if (L > 0) {
count += 1;
L--;
}
if (R > 0) {
count += 1;
R--;
}
}
cout << count + max(min(L,R),0) << endl;
} | 0 | 12,592,388 |
#include <bits/stdc++.h>
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<head;print0(tail...);}
int main() {
ll N, X, M;
cin >> N >> X >> M;
vector<ll> exist(100003, -1);
vector<ll> totals(100003, 0);
ll iterate = 1;
ll total = 0;
ll a = X;
bool loop_done = false;
while (iterate <= N) {
total = total + a;
if (!loop_done) {
if (exist[a] > 0) {
ll loop_iter = iterate - exist[a];
ll loop_sum = totals[iterate - 1] - totals[exist[a] - 1];
ll loop_num = max(N / loop_iter - 3, 0L);
total = total + loop_num * loop_sum;
iterate = iterate + (loop_num * loop_iter);
loop_done = true;
} else {
totals[iterate] = total;
exist[a] = iterate;
}
}
a = (a * a) % M;
iterate++;
}
print(total);
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n;
int cnt = 62;
vector<ll> vec;
ll mod = 1e9+7;
ll solve() {
vector<vector<int>> sum_zero(n+1, vector<int>(cnt, 0));
vector<vector<int>> sum_one(n+1, vector<int>(cnt, 0));
ll ans = 0;
reps(i, 1, n+1) {
rep(j,cnt) {
if (vec.at(i-1) >> j & 1ll) {
sum_one.at(i).at(j) = sum_one.at(i-1).at(j) + 1;
sum_zero.at(i).at(j) = sum_zero.at(i-1).at(j);
} else {
sum_one.at(i).at(j) = sum_one.at(i-1).at(j);
sum_zero.at(i).at(j) = sum_zero.at(i-1).at(j) + 1;
}
}
}
rep(i, n-1) {
ll t = 1;
rep(j, cnt) {
ll v;
if (vec.at(i) >> j & 1ll) {
v = (sum_zero.at(n).at(j) - sum_zero.at(i+1).at(j));
} else {
v = (sum_one.at(n).at(j) - sum_one.at(i+1).at(j));
}
ans += v * t;
ans %= mod;
t *= 2;
t %= mod;
}
}
return ans;
}
int main()
{
cin >> n;
vec.resize(n);
rep(i, n) cin >> vec.at(i);
cout << solve() << endl;
return 0;
} | 0 | 11,663,778 |
#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>;
vector<int> par;
vector<int> siz;
int maxi=1;
int root(int x){
if(par.at(x)==-1) return x;
return par.at(x) = root(par.at(x));
}
int size(int x){
return siz.at(x);
}
void unite(int x, int y){
x = root(x);
y = root(y);
if(x==y) return;
if(size(x) < size(y)) swap(x, y);
par.at(y) = x;
siz.at(x) += size(y);
maxi = max(maxi, size(x));
}
int main() {
int N, M;
cin >> N >> M;
par.assign(N, -1);
siz.assign(N, 1);
int a, b;
rep(i, M){
cin >> a >> b;
--a; --b;
unite(a, b);
}
cout << maxi << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#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 RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
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; }
int main()
{
string s,t;
cin >> s >> t;
int slen = s.size();
int tlen = t.size();
vector<int> contIdx;
REP(i, slen-tlen+1){
bool contains = true;
REP(j, tlen){
if (s[i+j] == t[j] || s[i+j]=='?') continue;
contains = false;
break;
}
if (contains) contIdx.push_back(i);
}
sort(RALL(contIdx));
if (contIdx.size()>0) {
REP(i,tlen) s[contIdx[0]+i] = t[i];
REP(i,slen){
if (s[i]=='?') s[i]='a';
}
cout << s << endl;
}else{
cout << "UNRESTORABLE" << endl;
}
return 0;
} | 0 | 32,306,120 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main(){
int n, m, k;
cin >> n >> m >> k;
bool f = false;
rep(i, m+1)if(n * i == k)f = true;
rep(i, n+1)if(m * i == k)f = true;
REP(i, 1, n){
ll sum = m * i;
REP(j, 1, m){
sum = sum - i + n - i;
if(sum == k)f = true;
}
}
cout << (f ? "Yes" : "No") << endl;
} | #include <stdio.h>
#include <stdbool.h>
bool judgeRectTriangle(int , int , int);
int main(void)
{
int edge1, edge2, edge3;
scanf("%d", &edge1);
while (scanf("%d%d%d", &edge1, &edge2, &edge3) != EOF) {
if (judgeRectTriangle(edge1, edge2, edge3) ){
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
bool judgeRectTriangle(int x, int y, int z)
{
if (x * x + y * y == z * z || y * y + z * z == x * x || z * z + x * x == y * y) {
return true;
} else {
return false;
}
} | 0 | 68,702,908 |
#include <iostream>
using namespace std;
int main(){
int money;
while(cin >> money && money !=0){
int count =0;
int res = 1000 - money;
for(int i=0;i<3;i++){
count +=res %10;
if(res % 10 >4){ count -= 4;}
res /=10;
}
cout << count << endl;
}
} | #include <stdio.h>
#include <math.h>
int main()
{
double x1, x2, x3, y1, y2, y3, xp, yp;
double s, s1, s2, s3;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) != EOF){
s = ((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.0;
s1 = ((xp - x1) * (y2 - y1) - (yp - y1) * (x2 - x1)) / 2.0;
s2 = ((xp - x1) * (y3 - y1) - (yp - y1) * (x3 - x1)) / 2.0;
s3 = ((xp - x2) * (y3 - y2) - (yp - y2) * (x3 - x2)) / 2.0;
s = fabs(s);
s1 = fabs(s1);
s2 = fabs(s2);
s3 = fabs(s3);
if (fabs(s -fabs(s1 + s2 + s3))<1e-10) printf("YES\n");
else printf("NO\n");
}
return 0;
} | 0 | 58,986,853 |
#include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
const int MOD = 1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll keta(ll tmp)
{
ll i = 1;
while (tmp / 10 >= 1) {
i++;
tmp /= 10;
}
return i;
}
ll f(ll a, ll b)
{
return max(keta(a), keta(b));
}
int main()
{
ll n;
cin >> n;
ll res = LLINF;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ll a = i;
ll b = n / i;
ll c = f(a, b);
res = min(res, c);
}
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
int check(vector<vector<char>>&hyo,int n,int m){
vector<int>delh;
vector<int>delw;
bitset<6>a=n;
bitset<6>b=m;
int ret=0;
for(int i=0;i<hyo.size();i++){
for(int j=0;j<hyo.at(0).size();j++){
if(a.test(i)&&b.test(j)&&hyo.at(i).at(j)=='#')
ret++;
}
}
return ret;
}
int main(){
int h,w,n;
cin >> h >> w >> n;
vector<vector<char>>hyo(h,vector<char>(w));
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
cin >> hyo.at(i).at(j);
int ans=0;
for(int i=0;i<(1<<h);i++){
for(int j=0;j<(1<<w);j++){
if(check(hyo,i,j)==n)
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 36,563,019 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
cin >> S;
int X = 0;
int Y = 0;
for(int i = 0; i < S.size(); i++) {
if(S[i] == '0') {
X++;
}
else {
Y++;
}
}
cout << min(X,Y)*2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 1001001001;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int cnt1=0,cnt2=0,cnt3=0, ans=0;
rep(i, 0, n){
string a;
cin >> a;
int m = a.size();
rep(j, 0, m-1){
if(a[j]=='A'&&a[j+1]=='B')ans++;
}
if(a[0]!='B'&& a[m-1]=='A')cnt1++;
if(a[0]=='B'&& a[m-1]!='A')cnt2++;
if(a[0]=='B'&& a[m-1]=='A')cnt3++;
}
if(cnt1>cnt2){
ans += cnt2+cnt3;
}
if(cnt1<cnt2){
ans += cnt1+cnt3;
}
if(cnt1 == cnt2){
if(cnt1==0)ans += max(0, (cnt3 -1));
else ans += cnt1+cnt3;
}
cout << ans << endl;
} | 0 | 69,933,824 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0;
cin >> a >> b;
a = (a + b)/2.0 + 0.5 ;
cout << a << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
ll gcd(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
int main(){
int n;
cin>>n;
vector<int> d(n);
rep(i,n){
cin>>d[i];
}
sort(d.begin(),d.end());
n/=2;
int ans=d[n]-d[n-1];
cout<<ans<<endl;
return 0;
} | 0 | 6,852,745 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll a = 0;
a = pow(10,15);
ll b = 0;
b = y - x;
if(b >= 0){
a = min(a,b);
}
b = 1 + y + x;
if(b >= 0){
a = min(a,b);
}
b = 1 - y - x;
if(b >= 0){
a = min(a,b);
}
b = 2 - y + x;
if(b >= 0){
a = min(a,b);
}
cout << a << endl;
return 0;
} | #include<iostream>
int main(){
int n, count = 0;
bool isprime [1000000];
for(int i = 0; i < 1000000; i++)
isprime[i] = true;
isprime[0] = isprime[1] = false;
for(int i = 2; i <= 1000; i++){
if(isprime[i]){
for(int j = i * 2; j < 1000000; j += i){
isprime[j] = false;
}
}
}
while(std::cin >> n){
count = 0;
for(int i = 2; i <= n; i++){
if(isprime[i])
count++;
}
std::cout << count << std::endl;
}
} | 0 | 26,586,494 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;}cout<<endl;
#define vec_debug(v) for(auto it=v.begin();it!=v.end();it++){cerr<<*it<<" ";}cerr<<endl;
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
template <typename T>T digitsum(T n);
template <typename T>bool isPrime(T n);
template <typename T>vector<pair<T, T>> prime_factor(T n);
long long int intpow(long long int,long long int);
template <typename T>T intlog(T);
long long int combination(long long int,long long int);
long long int arith_sum1(long long int,long long int,long long int);
long long int arith_sum2(long long int,long long int,long long int);
long long int series_sum(long long int);
int main(){
ll n,a,b,ans;
cin>>n>>a>>b;
if(a==b){
cout<<1<<endl;
return 0;
}
if(a>b){
cout<<0<<endl;
return 0;
}
if(n>=3){
cout<<(n-2)*(b-a)+1<<endl;
}
if(n==2){
cout<<1<<endl;
}
if(n==1){
cout<<0<<endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s ;
cin >> s ;
int n=s.size();
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(i==0){
if(s.at(i)!='A'){
cout <<"WA" << endl;
break;
}
}
if(i==1){
if(s.at(i)<97||s.at(i)>122){
cout << "WA" <<endl;
break;
}
}
if(i>1&&i<n-1){
if(s.at(i)>=97&&s.at(i)<=122){
c++;
}
if(s.at(i)=='C'){
d++;
}
}
if(i==n-1){
if(s.at(i)<97||s.at(i)>122){
cout << "WA" <<endl;
break;
}
if(s.at(i)>=97&&s.at(i)<=122&&c==n-4&&d==1){
cout << "AC"<< endl;
}
else{
cout << "WA" <<endl;
}
}
}
} | 0 | 78,957,150 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <utility>
#include <numeric>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll inf = (ll)1e9;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s, f) cout << fixed << setprecision(f) << s << endl;
int main()
{
int a, b;
cin >> a >> b;
println(a + b / 2);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc015_a.txt"); \
cin.rdbuf(in.rdbuf());
#else
#define INPUT_FILE
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
ll N, A, B;
cin >> N >> A >> B;
ll max = A + B * (N - 1);
ll min = A * (N - 1) + B;
ll ans = max - min + 1;
cout << (ans > 0 ? ans : 0) << endl;
} | 0 | 38,791,298 |
#include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> mp;
for(int n=0; n<N; n++) {
int A;
cin >> A;
mp[A]++;
}
int ans=mp.size();
int cnte=0;
for(auto itr=mp.begin(); itr!=mp.end(); itr++) {
if(itr->second%2==0) {
cnte++;
}
}
if(cnte%2!=0) {
ans--;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
#define ld long double
#define ff first
#define ss second
using namespace std;
ll fact(ll a)
{
if(a==0) return 1;
else return a*fact(a-1);
}
vl<ll> divisor(ll n)
{
vl<ll> v;
for(int i=2;i<=sqrt(n);i++)
{
if(n%i==0)
{
if(n/i==i) v.pb(i);
else
{
v.pb(i);
v.pb(n/i);
}
}
}
return v;
}
int main()
{
ll i,j,n,k,t,m,a,b;
cin>>n;
vl<ll> v;
v=divisor(n);
ll mn=n-1;
sort(v.begin(),v.end());
for(i=0;i<v.size();i++)
{
for(j=0;j<v.size();j++)
{
a=v[i];
b=v[j];
if((a*b)==n) mn=min(a+b-2,mn);
}
}
cout<<mn;
} | 0 | 6,164,323 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b, q;
string str, str1, str2, str3, g, p;
cin >> str >> q;
for( int i = 0; i < q; i++){
cin >> g;
if(g == "print"){
cin >> a >> b;
cout << str.substr(a, b - a + 1) << endl;
} else if(g == "reverse"){
cin >> a >> b;
str1 = str.substr(a, b - a + 1);
int n;
n = str1.size();
for( int j = 0; j < n; j++){
str[j + a] = str1[n - 1 - j];
}
str.insert(a, str2);
} else if(g == "replace"){
cin >> a >> b >> p;
str.erase(a, b - a + 1);
str.insert(a, p);
}
}
return 0;
} | #include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#define ll long long
#define IOS std::ios::sync_with_stdio(false);
using namespace std;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
int main()
{
IOS
string a,b;
cin>>a>>b;
a = a + a;
for(int i=0,j=0;i<a.size();i++)
{
if(a[i] == b[j])
{
j++;
}
else
{
j = 0;
}
if(j == b.size())
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | 0 | 51,986,820 |
#include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string a, b;
cin >> a >> b;
int asize = a.size();
int bsize = b.size();
if(asize!=bsize){
if(asize>bsize) cout << "GREATER" << endl;
else cout << "LESS" << endl;
return 0;
}
if(asize==bsize){
if(a>b) cout << "GREATER" << endl;
if(a==b) cout << "EQUAL" << endl;
else if(a<b) cout << "LESS" << endl;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define no cout << "no" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define AC cout << "AC" << endl;
#define WA cout << "WA" << endl;
#define out(s) cout << s << endl;
#define ll long long
#define ull unsigned long long
const unsigned int BIT_FLAG_0 = (1 << 0);
const unsigned int BIT_FLAG_1 = (1 << 1);
const unsigned int BIT_FLAG_2 = (1 << 2);
const unsigned int BIT_FLAG_3 = (1 << 3);
const unsigned int BIT_FLAG_4 = (1 << 4);
const unsigned int BIT_FLAG_5 = (1 << 5);
const unsigned int BIT_FLAG_6 = (1 << 6);
const unsigned int BIT_FLAG_7 = (1 << 7);
const double PI = 3.14159265358979323846;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
#define H_MAX 500
#define W_MAX 500
#define INF 1e9 + 7
const ll mod = 1000000007;
int main() {
int N, X, T;
cin >> N >> X >> T;
if (N % X == 0) {
cout << N / X * T << endl;
} else {
cout << (N / X + 1) * T << endl;
}
} | 0 | 9,466,786 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,v[111111],ans;
map<int,int>odd,even;
vector<pair<int,int>>o,e;
int main() {
cin>>n;
for(int i=0;i<n;i++){
cin>>v[i];
if(i&1)even[v[i]]++;
else odd[v[i]]++;
}
for(auto i:odd)o.push_back({i.second,i.first});
for(auto i:even)e.push_back({i.second,i.first});
sort(o.rbegin(),o.rend());
sort(e.rbegin(),e.rend());
o.push_back({0,0});
e.push_back({0,0});
if(o[0].second!=e[0].second)ans=n-o[0].first-e[0].first;
else ans=n-max(e[0].first+o[1].first,e[1].first+o[0].first);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
int main() {
int n, k, r, s, p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
bool flag[n];
rep(i, n) flag[i] = true;
int ans = 0;
rep(i, k) {
if (t[i] == 'r')
ans += p;
else if (t[i] == 's')
ans += r;
else if (t[i] == 'p')
ans += s;
}
for (int i = k; i < n; i++) {
if (t[i] == t[i - k]) {
flag[i] = !flag[i - k];
if (flag[i - k])
continue;
}
if (t[i] == 'r')
ans += p;
else if (t[i] == 's')
ans += r;
else if (t[i] == 'p')
ans += s;
}
cout << ans << endl;
return 0;
} | 0 | 60,431,966 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(){
int n;
cin >> n;
cout << 180*(n-2) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string a,b;cin >> a >> b;
int n=a.size(),m=b.size();
if(n>m){
cout << "GREATER" << endl;
}
else if(n<m){
cout << "LESS" << endl;
}
else{
REP(i,n){
int p=a[i]-'0';
int q=b[i]-'0';
if(p>q){
cout << "GREATER" << endl;
return 0;
}
if(p<q){
cout << "LESS" << endl;
return 0;
}
}
cout << "EQUAL" << endl;
}
} | 0 | 46,880,210 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define vl vector<ll>
#define N 100005
#define mod 1000000007
ll lcm(ll a,ll b)
{
return a/__gcd(a,b)*b;
}
int main()
{
ll n;cin>>n;
ll a[n];
ll sol=1;
for(ll i=0;i<n;i++)
cin>>a[i];
for(ll i=0;i<n;i++)
{
sol=lcm(sol,a[i]);
}
cout<<sol<<"\n";
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N, K;
scanf("%d", &N);
scanf("%d", &K);
std::vector<int > A(N);
std::vector<long long > Asum(N+2);
Asum[0]=0;
for (int i=0; i<N; i++){
scanf("%d", &A[i]);
Asum[i+1]=Asum[i]+(long long)A[i];
}
std::vector<long long > cand;
for (int i=0; i<N; i++){
for (int j=i+1; j<N+1; j++){
cand.push_back(Asum[j]-Asum[i]);
}
}
for (int i=45; i>=0; i--){
std::vector<long long > cand_orig(cand.size());
std::copy(cand.begin(), cand.end(), cand_orig.begin());
cand.clear();
long long unit = (long long )1<<i;
for (int j=0; j<cand_orig.size(); j++){
if ((unit & cand_orig[j]) !=0) cand.push_back(cand_orig[j]);
}
if (cand.size()<K){
std::swap(cand, cand_orig);
}
}
long long ans=((long long)1<<45)-1;
for (int j=0; j<K; j++){
ans = (ans & cand[j]);
}
std::cout << ans << std::endl;
return 0;
} | 0 | 95,450,718 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
void solve(int test_case) {
int a,b,c;
cin>>a>>b>>c;
int m = c%b;
set<int> s;
for(int i=0;;i+=a) {
int n = i%b;
if(n==m) {
cout<<"YES";
return;
}
if(s.count(n))break;
s.insert(n);
}
cout<<"NO";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,K;
cin >> N >> K;
K = min(100,K);
vector<int> A(N+1);
rep(i,N)cin >> A[i+1];
for(int i=0;i<K;i++){
vector<ll> L(N+2);
for(int j=1;j<=N;j++){
ll l = max(0,j-A[j]);
ll r = min(N,j+A[j]);
L[l]++;
L[r+1]--;
}
ll csm = 0;
for(int j=0;j<=N;j++){
csm+=L[j];
A[j]=csm;
}
}
rep(i,N){
cout << A[i+1] << " ";
}
cout << endl;
return 0;
} | 0 | 68,227,176 |
#include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
long long int c[1000000]={0};
long long int m=1;
long long int s;
cin>>s;
while(c[s]==0)
{
c[s]=1;
if(s%2)s=3*s+1;
else s/=2;
m++;
}
cout<<m;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
int main() {
INIT;
ll N, K, S;
cin >> N >> K >> S;
if (S < 1e9) {
rep(i, K) cout << S << " ";
reps(i, K, N) cout << S + 1 << " ";
cout << endl;
} else {
rep(i, K) cout << S << " ";
reps(i, K, N) cout << 1 << " ";
cout << endl;
}
return 0;
} | 0 | 63,881,290 |
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
const ll MOD = 998244353;
#include <vector>
#define ll long long int
#define M 1000000007
int main() {
ll n;
cin >> n;
vector<ll> P(n), Pos(n+1, 0);
for (ll i = 0; i < n; ++i) {
cin >> P[i];
Pos[P[i]] = i + 1;
}
ll res = 0;
multiset<ll> s;
s.insert(0);
s.insert(0);
s.insert(n+1);
s.insert(n+1);
for (ll now = n; now >= 1; now--){
auto it = s.lower_bound(Pos[now]);
ll pos_r = *it;
it++;
ll pos_rr = *it;
it--;
it--;
ll pos_l = *it;
it--;
ll pos_ll = *it;
res += now*(pos_r-Pos[now])*(pos_l-pos_ll);
res += now*(pos_rr-pos_r)*(Pos[now]-pos_l);
s.insert(Pos[now]);
}
cout<<res<<endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
#define relu(x) max(x, 0l)
int main() {
int n, k;
cin >> n >> k;
long a[n], rui[n+1], top[n+1];
for (auto &ai:a) cin >> ai;
rui[0] = top[0] = 0;
for (int i=0; i<n; i++) {
rui[i+1] = rui[i] + a[i];
top[i+1] = top[i] + relu(a[i]);
}
long ans = 0;
for (int i=0; i<=n-k; i++)
ans = max(ans, top[n] - top[i+k] + relu(rui[i+k] - rui[i]) + top[i]);
cout << ans << '\n';
return 0;
} | 0 | 54,865,975 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long t,i,p=0;
string s;
cin>>s;
t=s.size();
for(i=0;i<t;i++){
if(s[i]=='o')
p++;
}p=p+15-t;
if(p>=8)
cout<<"YES";
else
cout<<"NO";
return 0;
} | #include <iostream>
#include <array>
#include <algorithm>
using namespace std;
int main()
{
int q, t, f;
array<int, 6> d;
array<string, 3> tbl = {"12431", "03520", "01540"};
auto idx=[&](int x){return distance(d.begin(), find(d.begin(), d.end(), x));};
auto half=[](int x){return x < 3 ? x : 5 - x;};
for (int &x: d)
cin >> x;
cin >> q;
while (q-- && cin >> t >> f) {
int ti = idx(t), fi = idx(f), r = 3 - half(ti) - half(fi);
cout << d[tbl[r].find(to_string(ti) + to_string(fi)) != string::npos ? r : 5 - r]
<< endl;
}
return 0;
} | 0 | 65,403,133 |
#include <bits/stdc++.h>
using namespace std;
int Sum(vector<int>& x) {
int ret = 0;
for (auto i : x) ret += i;
return ret;
}
int main() {
vector<int> a(4), b(4);
for (auto& i : a) cin >> i;
for (auto& i : b) cin >> i;
cout << max(Sum(a), Sum(b)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
signed main(){
int H, W, D; cin >> H >> W>> D;
vector<P> data(H * W + 1);
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
int x; scanf("%d", &x);
data[x] = P(i, j);
}
}
vector<int> sum(H * W + 1, 0);
for(int i = H * W - D; i >= 0; i--){
int a = data[i].first, b = data[i].second, c = data[i + D].first, d = data[i + D].second;
sum[i] = sum[i + D] + abs(a - c) + abs(b - d);
}
int Q; cin >> Q;
for(int i = 0; i < Q; i++){
int l, r; scanf("%d%d", &l, &r);
cout << sum[l] - sum[r] << '\n';
}
} | 0 | 13,474,842 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
cout << fixed << setprecision(10);
int N,R;
cin >> N >> R;
if(N>10)
{
cout << R << endl;
}
else
{
cout << R + 1000 - 100 * N << endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
string ope[3];
for(int op=0;op < (1<<3);op++){
int sum = 0;
sum = s[0] - '0';
for(int i=0;i < 3;i++){
if((op >> i) & 1){
sum += s[i+1] - '0';
ope[i] = '+';
}else{
sum -= s[i+1] - '0';
ope[i] = '-';
}
}
if(sum == 7) break;
}
cout << s[0] << ope[0] << s[1] << ope[1] << s[2];
cout << ope[2] << s[3] << "=7" << endl;
return 0;
} | 0 | 11,566,337 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
int k;
string s;
cin >> k >> s;
if(s.size() > k)cout << s.substr(0,k) << "..." << endl;
else cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using std::unordered_set;
using std::map;
using std::multimap;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;
using boost::multiprecision::cpp_int;
using cpp_dec_float_1000 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000, boost::int128_type>>;
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
constexpr char CRLF = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
constexpr int MOD = 1000'000'007;
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; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
template<class T> T modinv(T a, T m) { T b = m, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; boost::swap(a, b); u -= t * v; boost::swap(u, v); } u %= m; if (u < 0) u += m; return u; }
template<class T> inline bool isSosuu(const T& n) { if (n == T(1)) { return false; } for (T i = 2; i*i <= n; ++i) { if (n % i == 0) { return false; } } return true; }
template<class T> vector<vector<T>> split (const vector<T>& S, T delim) { vector<vector<T>> ret{}; vector<T> buff{}; for (auto c : S) { if (c == delim) { if (!buff.empty()) ret.push_back(buff); buff.clear(); } else { buff.push_back(c); } } if (!buff.empty()) ret.push_back(buff); return ret; }
template<class T> inline void printYesNo(const T& t) { cout << (t ? "Yes" : "No") << CRLF; }
template<class T = int64_t> T modpow(T N, T P, T M) { T ret{1}; N %= M; while (P) { if (P & 0x01) { ret *= N; ret %= M; } P >>= 1; N *= N; N %= M; } return ret; }
int gErr = 0;
#define ASSERT(p) if(!(p)){ gErr = 1; }else{ ; }
struct Tmp
{
public:
int N;
Tmp(int N)
: N(N)
{}
};
void solve(void)
{
int N; cin >> N;
ll res{};
int p_XXA = 0;
int p_BXX = 0;
int p_BXA = 0;
for (int _ = 0; _ < N; ++_) {
string S; cin >> S;
int cnt{};
auto it = S.find("AB", 0);
while (it != S.npos) {
++cnt;
it = S.find("AB", it+1);
}
res += cnt;
auto p = S[0] == 'B';
auto q = S[S.size()-1] == 'A';
if (p && q) {
++p_BXA;
} else if (p) {
++p_BXX;
} else if (q) {
++p_XXA;
}
}
if (p_BXA > 0) {
res += p_BXA - 1;
if (p_XXA > 0) {
++res;
--p_XXA;
}
if (p_BXX > 0) {
++res;
--p_BXX;
}
}
if (p_XXA > 0 && p_BXX > 0) {
res += std::min(p_BXX, p_XXA);
}
cout << res << CRLF;
return;
}
int main(void)
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} | 0 | 61,677,910 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
string s;
std::deque<string> deq(n,"00000000000000000000000000");
std::map<string, long long int> map;
for (int i=0;i<n;i++) {
cin>>s;
for (int j=0;j<s.size();j++) {
string tmp=deq[i];
if (tmp[s[j]-97]=='0') {
tmp[s[j]-97]='1';
} else if (tmp[s[j]-97]=='1') {
tmp[s[j]-97]='2';
} else if (tmp[s[j]-97]=='2') {
tmp[s[j]-97]='3';
} else if (tmp[s[j]-97]=='3') {
tmp[s[j]-97]='4';
} else if (tmp[s[j]-97]=='4') {
tmp[s[j]-97]='5';
} else if (tmp[s[j]-97]=='5') {
tmp[s[j]-97]='6';
} else if (tmp[s[j]-97]=='6') {
tmp[s[j]-97]='7';
} else if (tmp[s[j]-97]=='7') {
tmp[s[j]-97]='8';
} else if (tmp[s[j]-97]=='8') {
tmp[s[j]-97]='9';
} else if (tmp[s[j]-97]=='9') {
tmp[s[j]-97]='-';
}
deq[i]=tmp;
}
if (map[deq[i]]==0) {
map.emplace(deq[i],0);
map[deq[i]]++;
} else {
map[deq[i]]++;
}
}
long long int ans=0;
for (auto itr=map.begin();itr!=map.end();itr++) {
ans+=(itr->second*(itr->second-1))/2;
}
cout<<ans<<endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, x;
cin >> a >> b >> x;
int tmp = 0;
bool flag = false;
tmp += a;
if (tmp != x)
{
for (size_t i = 0; i <= b; i++)
{
tmp++;
if (tmp == x)
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
}
else
cout << "YES" << endl;
} | 0 | 92,387,019 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define EPS (1e-10)
#define equals(a, b) (fabs((a)-(b)) < EPS)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef pair<double,double> PD;
typedef pair<int,P> ed;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N,M;
cin >> N >> M;
vi a(M),b(M),c(M);
rep(i,M) {
cin >> a[i] >> b[i] >> c[i];
a[i]--;
b[i]--;
}
vvi G(N,vi(N,INF));
rep(i,N) {
G[i][i] = 0;
}
rep(i,M) {
G[a[i]][b[i]]=c[i];
G[b[i]][a[i]]=c[i];
}
rep(k,N) {
rep(i,N) {
rep(j,N) {
if(G[i][j]>G[i][k]+G[k][j]) {
G[i][j]=G[i][k]+G[k][j];
}
}
}
}
int ans = 0;
rep(i,M) {
if(G[a[i]][b[i]]<c[i]) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int,string>> sub(m);
rep(i,m) cin >> sub[i].first >> sub[i].second;
int ac = 0, pena = 0;
map<int,int> mp;
rep(i,m) {
int p = sub[i].first;
string s = sub[i].second;
if(mp[p] == -1) continue;
if(s == "WA"){
mp[p]++;
} else {
ac++;
pena += mp[p];
mp[p] = -1;
}
}
cout << ac << " " << pena << endl;
} | 0 | 76,940,424 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
constexpr int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
#pragma endregion
void solve(){
int N;
cin >> N;
vector<ll> A(N);
for (int i=0; i<N; i++) {
cin >> A.at(i);
}
ll sum = 0;
int right = 0;
ll ans = 0;
for (int left=0; left<N; left++) {
while (right < N && sum + A.at(right) == (sum ^ A.at(right))) {
sum += A.at(right);
right++;
}
ans += right - left;
if (left == right) {
right++;
} else {
sum -= A.at(left);
}
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1013;
int h, w;
bool used[maxn][maxn];
int d[maxn][maxn];
int main() {
char a;
cin >> h >> w;
queue < pair < int, int > > q;
for (int i = 1; i <= h; ++i) {
for (int j = 1; j <= w; ++j) {
cin >> a;
if (a == '#') {
q.push(make_pair(i, j));
used[i][j] = 1;
}
}
}
while (!q.empty()) {
int x = q.front().first, y = q.front().second;
q.pop();
if (!used[x - 1][y] && x > 1) {
d[x - 1][y] = d[x][y] + 1;
used[x - 1][y] = 1;
q.push(make_pair(x - 1, y));
}
if (!used[x + 1][y] && x < h) {
d[x + 1][y] = d[x][y] + 1;
used[x + 1][y] = 1;
q.push(make_pair(x + 1, y));
}
if (!used[x][y - 1] && y > 1) {
d[x][y - 1] = d[x][y] + 1;
used[x][y - 1] = 1;
q.push(make_pair(x, y - 1));
}
if (!used[x][y + 1] && y < w) {
d[x][y + 1] = d[x][y] + 1;
used[x][y + 1] = 1;
q.push(make_pair(x, y + 1));
}
}
int ans = 0;
for (int i = 1; i <= h; ++i) {
for (int j = 1; j <= w; ++j)
ans = max(ans, d[i][j]);
}
cout << ans << '\n';
} | 0 | 60,991,035 |
#include <iostream>
using namespace std;
int main(){
long long int a, b, k;
cin >> a >> b >> k;
if (a > k)
cout << a - k << " " << b;
else if (a + b < k)
cout << 0 << " " << 0;
else
cout << 0 << " " << b - k + a;
} | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
int count = 0;
while(a >= b)
{
b = b*2;
count+=1;
if(count >= k)
{
break;
}
}
if(count < k)
while(b >= c)
{
c = c*2;
count+= 1;
if(count >= k)
{
break;
}
}
if((a < b) && (b < c) && (count <= k))
{
cout << "Yes";
}
else
{
cout << "No";
}
return 0;
} | 0 | 77,482,791 |
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <set>
#include <deque>
#include <vector>
#define MAX 50010
#define rep(i,p) for(int i=0;i<p;i++)
#define pb push_back
using namespace std;
int n,m,temp;
std::vector<int> C;
int dp[MAX];
int main(){
cin >> n >> m;
rep(i,m) {
cin >> temp;
C.pb(temp);
}
rep (i,n+10) dp[i] = MAX;
dp[0] = 0;
for (int i=0; i<m ; i++)
for (int j=C.at(i); j<=n; j++)
dp[j] = min(dp[j],dp[j-C.at(i)]+1);
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
const int INF = 1e18, MOD = 1e9 + 7;
int x, y, a, b, c, n;
signed main() {
cin>>x>>y>>a>>b>>c;
vector<pair<int, int>> v;
for (int i = 0; i < a; i++) {
cin>>n;
v.push_back(make_pair(n, 1));
}
for (int i = 0; i < b; i++) {
cin>>n;
v.push_back(make_pair(n, 2));
}
for (int i = 0; i < c; i++) {
cin>>n;
v.push_back(make_pair(n, 0));
}
sort(v.rbegin(), v.rend());
int cnt = 0;
int ans = 0;
for (auto p: v) {
if (p.second == 0) cnt++, ans += p.first;
if (p.second == 1 && x) x--, ans += p.first;
if (p.second == 2 && y) y--, ans += p.first;
if (x + y - cnt == 0) break;
}
cout<<ans<<endl;
} | 0 | 89,493,549 |
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
char map[1005][1005];
char map1[1005][1005];
int a[1005][1005];
int m,n,q,num=0;
int main()
{
int x,y;
cin>>m>>n>>q;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
x=i;
y=j;
map[x][y]='0';
}
}
}
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
map1[i][j]=map[i][j];
}
}
for(int k=1;k<=q;k++)
{
queue<int> ac;
queue<int> ak;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
map[i][j]=map1[i][j];
if(map1[i][j]-'0'==k-1)
{
x=i;
y=j;
map[x][y]='X';
}
}
}
memset(a,0,sizeof(a));
ac.push(x);
ak.push(y);
while(!ac.empty())
{
x=ac.front();
y=ak.front();
ac.pop();
ak.pop();
if(x+1<m)
{
if(map[x+1][y]!='X')
{
if(map[x+1][y]-'0'==k)
{
num+=a[x][y];
num+=1;
break;
}
map[x+1][y]='X';
ac.push(x+1);
ak.push(y);
a[x+1][y]=a[x][y]+1;
}
}
if(x-1>=0)
{
if(map[x-1][y]!='X')
{
if(map[x-1][y]-'0'==k)
{
num+=a[x][y]+1;
break;
}
map[x-1][y]='X';
ac.push(x-1);
ak.push(y);
a[x-1][y]=a[x][y]+1;
}
}
if(y+1<n)
{
if(map[x][y+1]!='X')
{
if(map[x][y+1]-'0'==k)
{
num+=a[x][y]+1;
break;
}
map[x][y+1]='X';
ac.push(x);
ak.push(y+1);
a[x][y+1]=a[x][y]+1;
}
}
if(y-1>=0)
{
if(map[x][y-1]!='X')
{
if(map[x][y-1]-'0'==k)
{
num+=a[x][y]+1;
break;
}
map[x][y-1]='X';
ac.push(x);
ak.push(y-1);
a[x][y-1]=a[x][y]+1;
}
}
}
}
cout<<num<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb push_back
string en="\n";
string t="hello";
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define vp(vi,x) cin>>x; vi.pb(x);
#define LB(a,x) (lower_bound(aov(a),x)-a.begin())
#define UB(a,x) (upper_bound(aov(a),x)-a.begin())
typedef long long LL;
typedef unsigned long long ULL;
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
LL i,j,k,n,m,l,s=0,x,y,tc=1,c=0;
while(cin>>n>>m)
{
if(n==2 && m==2) cout<<0<<en;
else if(n==1 && m==1) cout<<1<<en;
else
{
if(n==1) cout<<m-2<<en;
else if(m==1) cout<<n-2<<en;
else
{
c=(n-2)*(m-2);
cout<<c<<en;
}
}
}
} | 0 | 8,924,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ')'
#define P(a,b) make_pair(a,b);
ll MOD = 1000000007;
ll INF = 1001001001001001001;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main(){
string S;
cin >> S;
ll cnt = 0;
rep(i,S.size()) if(S[i] == 'o') cnt++;
if(cnt + 15 - S.size()>= 8) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <cstdio>
#include <vector>
using namespace std;
#define MAXN 100001
int N;
vector<int> conj[MAXN];
int visited[MAXN];
int sg(int id)
{
int ret = 0;
visited[id] = 1;
for(auto p : conj[id])
if(!visited[p])
ret ^= sg(p)+1;
return ret;
}
int main(void)
{
int i = 0;
int xi = 0, yi = 0;
scanf("%d", &N);
for(i = 1;i < N;++i)
{
scanf("%d%d", &xi, &yi);
conj[xi].push_back(yi);
conj[yi].push_back(xi);
}
printf("%s\n", (0==sg(1))?"Bob":"Alice");
return 0;
} | 0 | 51,350,527 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
A--; B--;
cout << A * B << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
const int A = 1000005;
int main()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> b(A);
rep(i,n){
cin >> a[i];
++b[a[i]];
}
bool ispw = true;
for(int i=2; i<A; ++i){
int cnt = 0;
for(int j=i; j<A; j+=i){
cnt += b[j];
}
if(cnt < 2) continue;
ispw = false;
break;
}
if(ispw){
cout << "pairwise coprime" << endl;
return 0;
}
int g = 0;
rep(i,n) g = gcd(g,a[i]);
if(g == 1){
cout << "setwise coprime" << endl;
return 0;
}
cout << "not coprime" << endl;
return 0;
} | 0 | 80,167,438 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
double a,b,x;
cin >> a >> b >> x;
double tmp = x/a;
if (a*b/2>=tmp){
double c = tmp*2/b;
double d = sqrt(c*c+b*b);
double e = d-b*(b/d);
double ans = acos(e/c);
ans = ans/3.1415926535*180;
printf("%.8f\n",ans);
return 0;
}else {
double c = b-(tmp*2/a-b);
double d = sqrt(a*a+c*c);
double e = d-c*(c/d);
double ans = acos(e/a);
ans = ans/3.1415926535*180;
printf("%.8f\n",ans);
return 0;
}
} | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define foo(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define deb(x) cout << #x << " --> " << x << endl;
#define deb1a(v) cout << #v << "--->" << endl; for (auto it : v) cout << it << " "; cout << endl;
#define deb2a(v) cout << #v << "--->" << endl;for (auto it:v){for(auto it1 : it){cout << it1 << " ";}cout<< endl;}
#define deb3a(v) cout << #v << "-->" << endl; for(auto it:v){cout << it.fi << " " << it.se << endl;}
#define mod 29996224275833
#define so(v) sort(v.begin(),v.end())
#define fi first
#define se second
#define db1(x) cout<<#x<<"="<<x<<endl
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl
int power(int x, unsigned int y, int p){ int res = 1;x = x % p;while (y > 0) { if (y & 1)res = (res*x) % p;y = y>>1; x = (x*x)% p;} return res;}
string s;
int n ;
int k;
int dp[101][28][28];
int fun(int i,int last,int fi){
if(i>=n)
return 0;
if(i==n-1){
if(s[i]-'a'==last)
return k;
else if(s[i]-'a'==fi)
return k - 1;
else
return 0;
}
if(dp[i][last][fi]!=-1)
return dp[i][last][fi];
int ans = 1e15;
fo(j, 26)
{
if (j != last)
{
if (i == 0)
fi = j;
if (s[i] - 'a' == j)
ans = min(ans, fun(i + 1, j, fi));
else
ans = min(ans, k + fun(i + 1, j, fi));
}
}
return dp[i][last][first]=ans;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
cin >> k;
n = s.size();
memset(dp, -1, sizeof(dp));
int g = 0;
foo(i,1,n){
if(s[i]!=s[i-1]){
g = 1;
}
}
if(g==0){
cout << (n*k)/2;
}
else
cout << fun(0, 27, 0);
} | 0 | 83,520,253 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 25, M = 1e6 + 25, oo = 1e9+7, mxmsk = 1 << 16;
const long long OO = 1e18+25;
#define f first
#define s second
int n,m,a[N], x,y, dsu[N], cnt;
int findparent(int u)
{
if(u == dsu[u]) return u;
return dsu[u] = findparent(dsu[u]);
}
void merge(int u, int v)
{
u = findparent(u);
v = findparent(v);
dsu[u] = v;
}
int main() {
iota(dsu, dsu+N, 0);
scanf("%d%d",&n,&m);
for(int i=1; i<=n ; i++) scanf("%d",a+i);
while(m--)
{
scanf("%d%d",&x,&y);
merge(x,y);
}
for(int i=1; i<=n; i++)
{
cnt += (findparent(i) == findparent(a[i]));
}
printf("%d",cnt);
return 0;
} | #include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
string t;cin >> t;
string ty,tm,td={};
int j = 0;
for(int i = 0;i < t.size();i++){
if(t[i] =='/'){
j++;
continue;
}
if(j == 0)ty += t[i];
else if(j == 1)tm += t[i];
else td += t[i];
}
int y = stoi(ty);
int m = stoi(tm);
int d = stoi(td);
if(y > 2019){cout << "TBD" << endl;}
else if(m > 4){cout << "TBD" << endl;}
else if(d > 30){cout << "TBD" << endl;}
else cout << "Heisei" << endl;
} | 0 | 23,624,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
nsum = (nsum + x) % MOD;
}
ll msum = 0, mans = 0;
for (int i = 0; i < M; i++)
{
ll x;
cin >> x;
mans += (x * i - msum);
mans %= MOD;
msum = (msum + x) % MOD;
}
cout << (nans * mans) % MOD << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int T = 1e5 + 3;
map<ll,ll> freq;
ll v[T];
ll n,MOD;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> MOD;
for(int i = 1; i <= n; i++) {
cin >> v[i];
v[i] = (v[i] + v[i-1]) % MOD;
freq[v[i]]++;
}
freq[0]++;
ll ans = 0;
for(int i = 1; i <= n; i++) {
freq[v[i-1]]--;
ans += (ll)freq[v[i-1]];
}
cout << ans << endl;
return 0;
} | 0 | 7,845,297 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repm(i, a, n) for (int i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vector<int>>
#define vll vector<ll>
#define vllll vector<vector<ll>>
#define vd vector<double>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c)
{
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void Print(bool c)
{
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <typename T>
T gcd(T a, T b)
{
while (1)
{
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
template <typename T>
T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
bool cmp(const pii &a, const pii &b)
{
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(void)
{
int n;
cin >> n;
vll a(n), b(n);
rep(i, 0, n) cin >> a[i] >> b[i];
ll ans = 0;
repm(i, n - 1, 0)
{
if ((a[i] + ans) % b[i])
ans += b[i] - (a[i] + ans) % b[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
using ld=long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve(){
ll n,m,v,p;
cin>>n>>m>>v>>p;
Array a(n);
REP(i,n) cin>>a[i];
sort(all(a),greater<ll>());
auto check = [&](ll x)->bool{
ll base = a[x]+m;
ll ret = m*(v-1);
ret=ret-(p-1)*m;
rep(i,p-1,n){
if(i==x) continue;
if(a[i]>base) return false;
ret-=min(m, base-a[i]);
}
return ret<=0;
};
ll l=p-1;
ll r=n;
while(l+1<r){
ll m=l+r>>1;
if(check(m)) l=m;
else r=m;
}
cout<<r<<en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | 0 | 50,306,031 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[200010];
int ans[100010];
bool vis[100010];
void bfs(int rt)
{
vis[rt]=1;
queue<int>q;
q.push(rt);
while(!q.empty())
{
int adj=q.front(); q.pop();
for(auto x: g[adj])
{
if(vis[x]==0)
{
vis[x]=1;
ans[x]=adj;
q.push(x);
}
}
}
}
int main()
{
int n,m,a,b;
cin>>n>>m;
for(int i=0; i<m; i++)
{
scanf("%d%d", &a,&b);
g[a].push_back(b);
g[b].push_back(a);
}
bfs(1);
for(int i= 1; i<=n; i++)
{
if(vis[i]==0)
{
cout<<"No";
return 0;
}
}
cout<<"Yes"<<endl;
for(int i=2; i<=n; i++)
printf("%d\n", ans[i]);
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define VI vector<int>
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define db double
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
mt19937 mrand(random_device{}());
const ll mod = 1000000007;
int rnd(int x){return mrand()%x;}
clock_t ac; double TLE(){return (double)(clock()-ac)/CLOCKS_PER_SEC;}
void DBG() {cerr << "]" << endl;}
template<class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h);
if(sizeof...(t)) cerr << ", ";
DBG(t...);}
#ifdef _DEBUG
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> cnt(202020);
vector<int> a(n);
long long int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
ans += cnt[a[i]];
++cnt[a[i]];
}
for (int i = 0; i < n; ++i) {
cout << ans - cnt[a[i]] + 1 << '\n';
}
} | 0 | 98,428,907 |
#include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
#define yes_or_no(flag) if (flag) { println("Yes"); } else { println("No"); }
int main() {
int A, B;
cin >> A >> B;
int count = 0;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int x = s.size() / 2;
bool all = true;
for (int j = 0; j < x; j++) {
if (s[j] != s[s.size() - j - 1]) {
all = false;
}
}
if (all) {
count++;
}
}
println(count);
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for(int i=1;i<sz;i++)cout<<" "<<a[i];cout<<endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int>pi;
typedef pair<ll,ll>pll;
const int N=4000010;
ll fact[N];
ll m=1e9+7;
ll power(ll a,ll p)
{
ll res=1;
ll y=a;
while(p>0)
{
if(p&1)res=(res*y)%m;
p>>=1;
y=(y*y)%m;
}
return res;
}
int main()
{
IOS;
fact[0]=1;
for(int i=1;i<N;i++)fact[i]=(fact[i-1]*i)%m;
ll a,b;cin>>a>>b;
ll x=-1,y=-1;
if((2*b-a)%3==0)x=(2*b-a)/3;
if((2*a-b)%3==0)y=(2*a-b)/3;
if(x<0||y<0)cout<<0<<endl;
else{
ll res=(((fact[x+y]*power(fact[x],m-2))%m)*(power(fact[y],m-2)))%m;
cout<<res<<endl;
}
} | 0 | 11,995,115 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstdlib>
typedef long long ll;
using namespace std;
#define M 1020751
long long convert(string word);
void insert(long long *d,long long key);
int find_key(long long *d,long long key);
int h1(long long key);
int h2(long long key);
int main(){
int i,n;
cin>>n;
string order,word;
long long key;
long long d[M];
queue<string> q;
for(i=0;i<M;i++){
d[i]=-1;
}
for(i=0;i<n;i++){
cin>>order>>word;
key=convert(word);
if(order[0]=='i'){
insert(d,key);
}else{
int flag=find_key(d,key);
if(flag==1){
q.push("yes");
}else{
q.push("no");
}
}
}
while(!q.empty()){
cout<<q.front()<<endl;
q.pop();
}
}
long long convert(string word){
long long i,num=0,keta=1;
for(i=0;i<word.size();i++){
if(word[i]=='A'){
num+=keta;
}else if(word[i]=='C'){
num+=keta*2;
}else if(word[i]=='G'){
num+=keta*3;
}else{
num+=keta*4;
}
keta*=10;
}
return num;
}
void insert(long long *d,long long key){
int h,i=1;
h=h1(key);
while(d[h]!=-1){
h=(h1(key)+i*h2(key))%M;
i++;
}
d[h]=key;
}
int find_key(long long *d,long long key){
int h,i=0;
h=h1(key);
while(1){
if(d[h]==-1){
return 0;
}else if(d[h]!=key){
i++;
h=(h1(key)+i*h2(key))%M;
}else{
return 1;
}
}
}
int h1(long long key){
return key%M;
}
int h2(long long key){
return 1+(key%(M-1));
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const int MOD = 1000000007;
const int MAX = 100000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
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;}
typedef pair<int, int> P;
typedef pair<ll,ll> PLL;
ld rad(ld a) {return a * 180 / PI;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
map<ll,ll> factorize_list;
void prime_factorize(ll N) {
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
factorize_list[a] = ex;
}
if (N != 1) factorize_list[N] = 1;
return ;
}
vector<ll> dp(100,MAX);
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll mod(ll val, ll m) {
ll res = val % m;
if (res < 0) res += m;
return res;
}
long long fac[MAX], finv[MAX], inv[MAX];
char upper(char c){
if('a' <= c && c <= 'z'){
c = c - ('a' - 'A');
}
return c;
}
char lower(char c){
if('A' <= c && c <= 'Z'){
c = c + ('a' - 'A');
}
return c;
}
const ll INF = 10000000000;
struct edge{ll to, cost;};
int main(){
ll N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
map<ll,ll> mp;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
sum += a;
mp[sum]++;
}
ll ans = 0;
for (auto p : mp) {
if (p.first == 0) ans += p.second;
ans += p.second * (p.second - 1) / 2;
}
cout << ans << endl;
return 0;
} | 0 | 60,157,593 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.