code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
int a[n];
for (int i=0;i<n;i++) cin>>a[i];
map <int,long long int> m;
for (int i=0;i<n;i++) m[a[i]]++;
long long int ans=0;
for (auto i : m) ans+=(i.second*(i.second-1))/2;
for (int i=0;i<n;i++){
long long int temp=ans-(m[a[i]]*(m[a[i]]-1))/2;
temp+=((m[a[i]]-1)*(m[a[i]]-2))/2;
cout<<temp<<"\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265358979323846
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b)
{
intt res = 1;
while (b > 0) {
if (b & 1)res = ((res%mod) * (a%mod))%mod;
a = ((a%mod) * (a%mod))%mod;
b >>= 1;
}
return res;
}
intt fact(intt n) {
if ((n==0)||(n==1))
return 1;
else
return n*fact(n-1);
}
void go()
{
#ifndef ONLINE_JUDGE
freopen("inn.txt","r",stdin);
freopen("ouut.txt","w",stdout);
#endif
}
int dx[4]={0,-1,1,0};
int dy[4]={1,0,0,-1};
int main()
{
fast_io
go();
int n;cin>>n;
vi v(n);
map<intt,intt> mp;
intt arr[200005];
for0(i,n)
{
cin>>v[i];
mp[v[i]]++;
}
intt ans=0;
for(auto it=mp.begin();it!=mp.end();it++)
{
intt temp=it->ss;
temp=temp*(temp-1)/2;
arr[it->ff]=temp;
ans+=temp;
}
for0(i,n)
{
intt anss=ans;
auto it=mp.find(v[i]);
intt temp=it->ss;
anss-=arr[v[i]];
temp--;
temp=temp*(temp-1)/2;
anss+=temp;
cout << anss <<"\n";
}
} | 1 | 39,680,548 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int c,ans=0;
for(int i=0;i<a;i++){
cin >> c;
if(c>=b)ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans=0;
cin >> N >> K;
vector<int> h(N);
for(int i=0; i<N; i++) {
cin >> h.at(i);
if(h.at(i) >= K) ans++;
}
cout << ans << endl;
} | 1 | 35,122,299 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
string n;
int k;
ll dp[111][4][2];
ll f(int i, int j, int less) {
if(j > k) return 0;
if(i == (int)n.size()) return j == k;
ll &ans = dp[i][j][less];
if(~ans) return ans;
ans = 0;
if(less) {
return ans = f(i + 1, j, less) + f(i + 1, j + 1, less) * 9;
}
else {
int dig = int(n[i] - '0');
for(int d = 0; d <= dig; d++) {
ans += f(i + 1, j + !!d, d < dig);
}
}
return ans;
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
cout << f(0, 0, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dp[105][4][2];
int main(){
string s;
int K;
cin >> s >> K;
int n = s.size();
dp[0][0][0] = 1;
rep(i,n) rep(j,4) rep(k,2){
int nd = s[i] - '0';
rep(d, 10){
int ni = i+1, nj = j, nk = k;
if (d != 0) nj++;
if (nj > K) continue;
if (k == 0){
if (d > nd) continue;
else if (d < nd) nk++;
}
dp[ni][nj][nk] += dp[i][j][k];
}
}
int ans = dp[n][K][0] + dp[n][K][1];
cout << ans << endl;
return 0;
} | 1 | 61,432,851 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n,k,ans=0;
cin>>n>>k;
vector<int> a(100000000);
n=n-k;
ans++;
for(int i=0;0<n;i++){
n=n-k+1;
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int N,K;
int A[100000];
int main(){
cin>>N>>K;
rep(i,N) cin>>A[i];
int ans=ceil((double)(N-1)/(K-1));
cout<<ans<<endl;
} | 1 | 50,105,903 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[i] = fact[i-1] * i % MOD;
}
void create_seq_inv_mod(int num){
seq_inv[0] = seq_inv[1] = 1;
for(int i=2; i<=num; i++) seq_inv[i] = (MOD - MOD/i) * seq_inv[MOD%i] % MOD;
}
void create_fact_inv_mod(int num){
fact_inv[0] = fact_inv[1] = 1;
for(int i=2; i<=num; i++) fact_inv[i] = fact_inv[i-1] * seq_inv[i] % MOD;
}
void create_mod_tables(int num){
fact.resize(num+1);
seq_inv.resize(num+1);
fact_inv.resize(num+1);
create_fact_mod(num);
create_seq_inv_mod(num);
create_fact_inv_mod(num);
}
int64_t comb_mod(int n, int k){
return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;
}
int64_t perm_mod(int n, int k){
return fact[n] * fact_inv[n-k] % MOD;
}
int64_t power_mod(int64_t num, int64_t power){
int64_t prod = 1;
num %= MOD;
while(power > 0){
if(power&1) prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
int64_t d = a;
if(b != 0){
d = extgcd(b, a%b, y, x);
y -= (a/b) * x;
}else{
x = 1; y = 0;
}
return d;
}
int64_t inv_mod(int64_t a){
int64_t x, y;
extgcd(a, MOD, x, y);
return (MOD + x%MOD) % MOD;
}
int main(){
int N;
cin >> N;
vector<int> A(N+1);
for(int i=0; i<N+1; i++) cin >> A[i];
vector<int64_t> ans(N+2);
create_mod_tables(N+1);
for(int i=1; i<=N+1; i++) ans[i] = comb_mod(N+1, i);
int side = 0;
vector<int> pos(N+1, -1);
for(int i=0; i<N+1; i++){
if(pos[A[i]] >= 0){
side = pos[A[i]] + N-i;
break;
}
pos[A[i]] = i;
}
for(int i=0; i<=side; i++) add(ans[i+1], MOD - comb_mod(side, i));
for(int i=1; i<=N+1; i++) cout << ans[i] << endl;
} | #include <iostream>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll sz;
ll power(ll x, ll y){
ll ret = 1;
x %= MOD;
while(y > 0){
if(y & 1) {
ret = (ret * x) % MOD;
}
y >>= 1LL;
x = (x * x) % MOD;
}
return ret;
}
ll modInverse(ll num){
ll M = MOD;
return power(num, M - 2);
}
ll fac[1000001];
ll arr[1000001];
map<pair<ll, ll>, ll> mapa;
ll nCr(ll n, ll r){
if(r == 0)return 1;
if(n < r)return 0;
if(mapa.find(make_pair(n, r)) != mapa.end())return mapa[make_pair(n, r)];
return mapa[make_pair(n, r)] = (fac[n] * modInverse(fac[r]) % MOD * modInverse(fac[n - r]) % MOD) % MOD;
}
ll idx[1000001];
int main(int argc, const char * argv[]) {
ios_base::sync_with_stdio(false);
fac[0] = 1;
for(ll i = 1; i <= 1000000; i ++){
fac[i] = fac[i - 1] * i % MOD;
}
cin >> sz;
sz ++;
set<ll> st;
memset(idx, -1, sizeof idx);
ll tmp1, tmp2;
for(int i = 0; i < sz; i ++){
cin >> arr[i];
if(idx[arr[i] - 1] == -1){
idx[arr[i] - 1] = i;
}
else{
tmp1 = idx[arr[i] - 1];
tmp2 = i;
}
st.insert(arr[i]);
}
cout << (int)st.size() << endl;
for(ll i = 2; i <= sz; i ++){
ll t = nCr(sz, i) - nCr(tmp1 + (sz - tmp2 - 1), i - 1);
if(t < 0)t += MOD;
cout <<t << endl;
}
return 0;
} | 1 | 59,330,411 |
#include<stdio.h>
int main() {
int i = 8;
while (i++ < 89) {
printf("%dx%d=%d\n", i / 9, i % 9 + 1, i / 9 * (i % 9 + 1));
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=1;i<10;i++)
for(int j=1;j<10;j++)
printf("%dx%d=%d\n",i,j,i*j);
} | 1 | 64,342,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
x = N%10 + (N%100)/10 + (N%1000)/100 + (N%10000)/1000 + (N%100000)/10000 + (N%1000000)/100000 + (N%10000000)/1000000 + (N%100000000)/10000000 + (N%1000000000)/100000000;
if (N / x * x == N)
cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
int n,nc,sum=0;cin>>n;
nc=n;
while(n>0){
sum+=n%10;
n/=10;
}
if(nc%sum==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 1 | 1,533,089 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n;
ll a[100005];
ll ans;
ll mx, mn;
ll f(ll p)
{
for(ll i = 1; i <= n; i++)
{
p = p / a[i] * a[i];
}
return p;
}
int main()
{
scanf("%lld", &n);
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
}
ll lt, rt, mid, ans;
lt = 2;
rt = 4e18;
while(lt <= rt)
{
mid = (lt + rt) / 2;
if(f(mid) > 2) rt = mid - 1;
else ans = mid, lt = mid + 1;
}
mx = ans;
lt = 2;
rt = 4e18;
while(lt <= rt)
{
mid = (lt + rt) / 2;
if(f(mid) < 2) lt = mid + 1;
else ans = mid, rt = mid - 1;
}
mn = ans;
if(mn > mx) printf("-1\n");
else printf("%lld %lld\n", mn, mx);
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n;
cin >> n;
vl a(n);
rep(i,n)cin>>a[i];
reverse(rng(a));
ll R = 2,L=2;
rep(i,n){
L=(L+a[i]-1)/a[i]*a[i];
if(R<L){
print(-1);
return 0;
}
R = (R/a[i]+1)*a[i]-1;
}
cout<<L<<" "<<R<<endl;
return 0;
} | 1 | 14,528,082 |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace std;
typedef pair<int,int> pii;
typedef pair<lln,lln> pll;
typedef vector<int> vi;
typedef vector<lln> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
int arr[maxii];
int arr2[maxii];
int gcd(int a,int b)
{
if(b==0){
return a;
}
return gcd(b,a%b);
}
int lcm(int a,int b)
{
int res=(a*b)/gcd(a,b);
return res;
}
int po(int a,int b)
{
int res=1;
while(b)
{
if(b%2!=0)
{
res*=a;
b--;
}
else
{
a*=a;
b/=2;
}
}
return res;
}
lln modMul(lln a, lln b,lln mod){
lln ans = 0;
a = a % mod;
while (b > 0){
if ( b % 2 )ans = (ans%mod+ a%mod) % mod;
a = (a%mod * 2%mod) % mod;
b /= 2;
}
return ans % mod;
}
lln powerMod(lln a,lln b,lln mod){
if(b==0)return 1LL%mod;
lln x=powerMod( a,b/2,mod );
x = ( x%mod * x%mod ) % mod;
if( b%2==1 )x = ( x%mod * a%mod ) % mod;
return x%mod;
}
int main()
{
string a,b;
cin>>a>>b;
int len=a.size();
int len1=b.size();
if(len==len1)
{
for(int i=0;i<len;i++)
{
cout<<a[i];
cout<<b[i];
}
}
else if(len>len1)
{
for(int i=0;i<len1;i++)
{
cout<<a[i];
cout<<b[i];
}
cout<<a[len-1];
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VB = vector<bool>;
using VS = vector<string>;
using graph = vector<vector<int>>;
int main()
{
string a,b;
cin>>a>>b;
int num=a.length(),aaaa=b.length();
num=num+aaaa;
int x=0,y=0;
for (int i = 1; i <= num; i++)
{
if (i%2==1)
{
cout<<a.at(x);
x++;
}
else
{
cout<<b.at(y);
y++;
}
}
cout<<endl;
return 0;
} | 1 | 38,496,538 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
char s, ans;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> s;
for(int i = 0; i < 26; ++i){
if(a.at(i) == s) ans = a.at(i + 1);
}
cout << ans << endl;
return 0;
} | #include <stdio.h>
int main (){
char a;
scanf("%c", &a);
a++;
printf ("%c", a);
return 0;
} | 1 | 63,970,588 |
#include <bits/stdc++.h>
using namespace std;
#define rep3(i, s, n ,a) for (int i = (s); i < (int)(n); i+=a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
int main(){
int n;
cin >> n;
vector<int> a;
vector<long> sum;
rep(i, n){
int num;
cin >> num;
a.push_back(num);
}
sum.push_back(0);
long total=0;
long minim=0, maxim=0;
rep(i, n){
total += a[i];
sum.push_back(total);
minim = min(minim, total);
maxim = max(maxim, total);
}
sort(sum.begin(), sum.end());
long cnt=0, set=sum[0], seq=1;
rep2(i, 1, n+1){
if(set==sum[i]){
seq++;
}else{
cnt += seq * (seq - 1) / 2;
set = sum[i];
seq = 1;
}
}
cnt += seq * (seq - 1) / 2;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);--i)
#define SIZE(a) ll((a).size())
#define out(a) cout<<(a)<<endl;
const ll inf=1e9;
const int MAX = 510000;
const ll MOD = 998244353;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
ll n;cin>>n;
vll sum(n+1,0);
map<ll,ll> m;
ll ans=0;
m[0]++;
rep(i,0,n){
ll a;cin>>a;
sum[i+1]=sum[i]+a;
m[sum[i+1]]++;
}
for(auto u:m){
ll tmp=u.second;
ans+=((tmp-1)*tmp)/2;
}
cout<<ans<<endl;
} | 1 | 76,873,406 |
#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() {
char c;
cin >> c;
if ('A' <= c && c <= 'Z') cout << 'A' << endl;
else cout << 'a' << endl;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
long long mod;
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
return dp[i][k];
if(k!=0)
ans=max(rec(dp,arr,n,i+1,w,w),arr[i]+rec(dp,arr,n,i+1,k-1,w));
else
ans=max(rec(dp,arr,n,i+1,k,w),rec(dp,arr,n,i+1,w,w));
return dp[i][k]=ans;
}
ll t[400008];
void build(vector<ll>& a, int v, int tl, int tr) {
if (tl == tr) {
t[v] = a[tl];
} else {
int tm = (tl + tr) / 2;
build(a, v*2, tl, tm);
build(a, v*2+1, tm+1, tr);
t[v] = max(t[v*2] ,t[v*2+1]);
}
}
ll maxi(int v, int tl, int tr, int l, int r) {
if (l > r)
return 0;
if (l == tl && r == tr) {
return t[v];
}
int tm = (tl + tr) / 2;
return max(maxi(v*2, tl, tm, l, min(r, tm)) ,maxi(v*2+1, tm+1, tr, max(l, tm+1), r));
}
void update(int v, int tl, int tr, int pos, ll new_val) {
if (tl == tr) {
t[v] = new_val;
} else {
int tm = (tl + tr) / 2;
if (pos <= tm)
update(v*2, tl, tm, pos, new_val);
else
update(v*2+1, tm+1, tr, pos, new_val);
t[v] = max(t[v*2] ,t[v*2+1]);
}
}
int main() {
char c;
cin>>c;
if(c>='A'&&c<='Z')
cout<<'A';
else
cout<<'a';
return 0;
} | 1 | 62,689,126 |
#include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);
}
const long double PI=(acos(-1));
const long double EPS=0.0000000001;
long double a,b,x;
long double f(long double a,long double b,long double theta)
{
if(theta>PI/2.0-EPS)
return 0.0;
long double ret;
if(a*tan(theta)<=b)
ret=a*a*b-a*a*a*tan(theta)/2.0;
else
ret=b*b/tan(theta)*a/2.0;
return ret;
}
int main()
{
cin>>a>>b>>x;
long double ok=PI/2.0;
long double ng=0.0;
for(int i=1;i<=10000;i++)
{
long double mid=(ok+ng)/2.0;
if(f(a,b,mid)<x)
ok=mid;
else
ng=mid;
}
cout<<fixed<<setprecision(10)<<ok/PI*180<<endl;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
const double pi=acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double a,b,x;
cin>>a>>b>>x;
if(2*x==a*a*b) cout<<fixed << setprecision(15) <<atan(b/a)*180/pi<<endl;
else if(2*x>a*a*b) cout<<fixed << setprecision(15) <<atan(2*(a*a*b-x)/a/a/a)*180/pi<<endl;
else cout<<fixed << setprecision(15) <<atan(a*b*b/2/x)*180/pi<<endl;
return 0;
} | 1 | 67,796,738 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
bool leaf=true;
int white=0,yet=0;
for(int i=0;i<g[now].size();i++){
int next=g[now][i];
if(used[next]) continue;
leaf=false;
int z=dfs(next);
if(z==1) return 1;
else if(z==0) white++;
else yet++;
}
if(now==0){
if(yet==1) return 0;
else return 1;
}else{
if(yet>=2) return 1;
else if(yet==1) return 0;
else return -1;
}
}
int main(){
int n;
cin>>n;
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
if(dfs(0)) cout<<"First"<<endl;
else cout<<"Second"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> adj[100010];
int dfs(int x, int pre = 0) {
int cnt = 0;
for (int i = 0; i < adj[x].size(); ++i) {
int y = adj[x][i];
if (y != pre)
cnt += dfs(y, x);
}
return cnt < 2 ? cnt ^ 1 : cnt;
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
puts(dfs(1) ? "First" : "Second");
} | 1 | 73,874,583 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
double e;
cin >> a >> b;
c = a/b;
d =a%b;
e= 1.0*a/b;
printf("%d %d %.8lf\n",c,d,e);
return 0;
} | #include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
int a,b,x,y;
cin>>a>>b;
double z;
x = a/b;
y = a%b;
z = 1.0 * a/b;
cout<<x<<" "<<y<<" ";
printf("%.6lf\n", z);
} | 1 | 65,270,930 |
#include<bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int n = (int)S.size();
int dif = 0;
for (int i = 1; i < n; i ++) {
if (S[i - 1] != S[i]) dif ++;
}
cout << dif << endl;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vector<int>
#define sz(a) int((a).size())
#define rep(i,x,y) for(int i=x;i<y;i++)
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
const int maxn = 400010;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 2000000000000000000ll;
const ld pi = acos(-1);
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
int qpow(int b,int e){
if( !e ) return 1;
if( e & 1 ) return qpow(b,e-1) * b % mod;
int pwur = qpow(b,e>>1);
return (pwur * pwur) % mod;
}
int modinv(int x){
return qpow(x,mod-2);
}
int a[101][101];
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cout.setf(ios::fixed); cout.precision(0);
srand(time(NULL));
string s;
cin>>s;
int ans=0;
for(int i=1;i<s.size();i++){
if(s[i-1]!=s[i])ans++;
}
cout<<ans<<endl;
return 0;
} | 1 | 962,822 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
using ll=long long;
int main(){
int n;
cin>>n;
vector<int> d={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};
cout<<d[n-1]<<endl;
} | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
int main(void){
int a[32] = { 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51} ;
int N ;
cin >> N ;
cout << a[N-1] << endl;
} | 1 | 30,703,011 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<=b;i++)
#define fr(i,b)for(i=b-1;i>=0;i--)
ll mn=INT_MAX,mx=INT_MIN;
ll n,m,tc,i,j,tmp,sum,cn,ans,res,pos,flag;
string s;
ll a[200007],b[200007];
int main()
{
io;
string str;
cin>>s>>str;
ll l=s.size();
if(l!=str.size())
{
puts("No");
}
else
{
for(i=0;i<l;i++)
{
bool flag=true;
for(j=0;j<l;j++)
{
if(s[j]!=str[(j+i)%l])
{flag=false;}
}
if(flag==true)
{
puts("Yes");
return 0;
}
}
puts("No");
}
return 0;
} | #include <iostream>
#include <cstring>
#include <string.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
bool flag=false;
string c=a+a;
if( c.find(b)!=string::npos)
flag=true;
if(flag)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 14,840,059 |
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define ll long long
const int INF=1e9+7;
int main(){
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\User\\Documents\\input.txt","r",stdin);
#endif
int T,i,j;
int n;
cin>>n;
vector<int> dp(n+1,INF),a(n+1);
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
}
dp[1]=0;
for(i=1;i<n;i++){
dp[i+1]=min(dp[i+1],dp[i]+abs(a[i+1]-a[i]));
if(i+2<=n) dp[i+2]=min(dp[i+2],dp[i]+abs(a[i+2]-a[i]));
}
printf("%d\n",dp[n]);
return 0;
} | #include<bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define mp make_pair
#define PI acos(-1)
using namespace std;
ll dp[200005],a[200005],n;
ll solve(ll idx)
{
if(idx>=n-1)
return 0;
if(dp[idx]!=-1)
return dp[idx];
ll res=INT_MAX;
if(idx+1<n)
res=min(res,abs(a[idx+1]-a[idx])+solve(idx+1));
if(idx+2<n)
res=min(res,abs(a[idx+2]-a[idx])+solve(idx+2));
return dp[idx]=res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i,j,k,x,y,z,m,t,l,r;
cin>>n;
for(i=0; i<n; i++)
cin>>a[i];
memset(dp,-1,sizeof dp);
cout<<solve(0)<<'\n';
} | 1 | 83,448,493 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#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,s,n) for(int i=s;i<n;++i)
#define FORR(i,s,n) for(int i=n-1;i>=s;--i)
#define ALL(c) (c).begin(),(c).end()
#define CLEAR(v) memset(v,0,sizeof(v))
#define MP(a,b) make_pair((a),(b))
#define ABS(a) ((a)>0?(a):-(a))
#define F first
#define S second
int main(int argc, char **argv) {
ll n;
double res = 0.0, x;
string u;
cin >> n;
REP(i, n) {
cin >> x >> u;
if (u == "JPY") res += x;
else res += x * 380000;
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <iomanip>
using namespace std;
int main(void){
int N; cin >> N;
int i = 0;
double sum = 0;
while (i < N) {
double tmp1;
string tmp2;
cin >> tmp1 >> tmp2;
if (tmp2 == "JPY") sum += tmp1;
else sum += tmp1 * 380000;
i++;
}
cout << fixed << setprecision(6) << sum << endl;
} | 1 | 9,659,892 |
#include <bits/stdc++.h>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed main() {
int n;
cin >> n;
VE a;
rep(i, n) {
int enter;
cin >> enter;
a.pb(enter);
}
int ans = 0;
rep(i, n - 1) {
if(a[i + 1] == a[i]) {
a[i + 1] = 10001;
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll oddxor(ll a){
return ((a+1)/2)%2 ;
}
ll funcxor(ll b){
if(b%2) return oddxor(b);
else return oddxor(b+1)^(b+1);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i<n;i++){
cin >> a[i];
}
int ans = 0;
for(int i = 0;i<n-1;){
if(a[i]==a[i+1]){
ans++;
i += 2;
}
else i++;
}
cout << ans << endl;
} | 1 | 64,716,553 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
vector<ll> gf2_rank(vector<ll> &v) {
int n = v.size();
rep(i, n) {
int x = max_element(v.begin() + i, v.end()) - v.begin();
if (v[x] == 0) break;
swap(v[i], v[x]);
ll msb = 1;
while (msb << 1 <= v[i]) msb <<= 1;
rep(j, n) if (j != i) if (v[j] & msb) v[j] ^= v[i];
}
while (v.size() && v.back() == 0) v.pop_back();
return v;
}
int main() {
int n;
cin >> n;
vector<ll> v;
vector<ll> a(n);
ll x = 0;
rep(i, n) {
cin >> a[i];
x ^= a[i];
}
rep(i, n) {
a[i] &= ~x;
v.push_back(a[i]);
}
gf2_rank(v);
ll ret = 0;
for (ll l: v) ret = max(ret, ret ^ l);
cout << ret * 2 + x << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define revrep(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define f first
#define s second
#define pb push_back
ll mod = 2147483647;
const ll INF = 100000000000010000;
const ull B = 998244353;
void test() {
cout << "888888888888888888888888" << endl;
}
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
ll pow_mod(ll x, ll y) {
if (y == 0) return 1;
if (y % 2 == 1) {
return x * pow_mod(x, y - 1) % mod;
}
else {
ll half = pow_mod(x, y / 2);
return half * half % mod;
}
}
ll div_mod(ll x) {
return pow_mod(x, mod - 2);
}
ll N, A[100010], sum, resum;
ll hakidashi[60];
vector<P> trans;
ll ans;
void solve() {
cin >> N;
rep(i, N) cin >> A[i];
rep(i, N) sum ^= A[i];
resum = sum ^ ((1LL << 60) - 1);
rep(i, N) A[i] &= resum;
priority_queue<ll> que;
ll bit = 59;
rep(i, N)if (A[i] != 0) que.push(A[i]);
while (que.size()) {
ll lar = que.top(); que.pop();
while ((lar & (1LL << bit)) == 0 && bit >= 0) bit--;
if (bit < 0) break;
hakidashi[bit] = lar;
while (que.size() && que.top() > (1LL << bit)) {
ll a = que.top(); que.pop();
que.push(a ^ hakidashi[bit]);
}
}
rep(i, 60)if (hakidashi[i] != 0) trans.pb(P(hakidashi[i], i));
for (ll i = 0; i < trans.size(); i++) {
for (ll j = i + 1; j < trans.size(); j++) {
P p = trans[i], q = trans[j];
if ((q.f & (1LL << p.s)) != 0) trans[j].f ^= p.f;
}
}
for (P p : trans) ans ^= p.f;
ans = ans * 2 + sum;
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
ll N;
cin >> N;
} | 1 | 21,733,366 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int N;
char s[4002];
int r[4002],g[4002],b[4002];
long long int ans = 0;
int main(){
scanf("%d",&N);
scanf("%s",&s[1]);
for(int i=N-1;i>0;i--){
r[i] = r[i+1];
g[i] = g[i+1];
b[i] = b[i+1];
if(s[i+1] == 'R')r[i] ++;
else if (s[i+1] == 'G') g[i]++;
else b[i]++;
}
for(int i=1;i<=N-2;i++){
for(int j=i+1;j<=N-1 ; j++){
if(s[i] == s[j])continue;
int x= j-i;
if( (s[i] == 'R' && s[j] == 'G') || (s[i] == 'G' && s[j] == 'R')){
ans+=b[j];
if(x+j <=N && s[x+j] == 'B') ans--;
}
else if ((s[i] == 'R' && s[j] == 'B') || (s[i] == 'B' && s[j] == 'R')){
ans+=g[j];
if(x+j <=N && s[x+j] == 'G') ans--;
}
else {
ans+=r[j];
if(x+j<=N && s[x+j] == 'R') ans--;
}
}
}
printf("%lld\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005;
int r[N],g[N],b[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
ll ans = 0;
if(s[0] == 'R')r[0]++;
if(s[0] == 'G')g[0]++;
if(s[0] == 'B')b[0]++;
for(int i=1;i<n;i++){
r[i] = r[i-1];
g[i] = g[i-1];
b[i] = b[i-1];
if(s[i] == 'R')r[i]++;
if(s[i] == 'G')g[i]++;
if(s[i] == 'B')b[i]++;
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(s[i] != s[j]){
if(s[i] != 'G' && s[j] != 'G'){
ans += g[n-1]-g[j];
if(j + (j-i) <= n-1 && s[j+j-i] == 'G')ans--;
}
if(s[i] != 'R' && s[j] != 'R'){
ans += r[n-1]-r[j];
if(j + (j-i) <= n-1 && s[j+j-i] == 'R')ans--;
}
if(s[i] != 'B' && s[j] != 'B'){
ans += b[n-1]-b[j];
if(j + (j-i) <= n-1 && s[j+j-i] == 'B')ans--;
}
}
}
}
cout<<ans;
return 0;
} | 1 | 3,989,872 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N);
for(int i=0; i<N; i++){
cin >> S.at(i) >> T.at(i);
}
string X;
cin >> X;
int P;
for(int i=0; i<N; i++){
if(S.at(i)==X){
P=i;
}
}
int Ans=0;
for(int i=P+1; i<N; i++){
Ans+=T.at(i);
}
cout << Ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<string>s(n);
vector<ll>t(n);
for(ll i=0;i<n;i++){
cin >> s[i] >> t[i];
}
ll ans=0;
string x;
cin >> x;
ll ti;
for(ll i=0;i<n;i++){
if(s[i]==x){
ti=i;
break;
}
}
for(ll i=ti+1;i<n;i++){
ans+=t[i];
}
cout << ans << endl;
} | 1 | 7,521,695 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (1LL << 61);
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
int ans = 0;
rep(i, n - 1) {
if (s[i] != s[i + 1]) ans++;
}
cout << ans << endl;
return 0;
} | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if ((s[i] == 'B' && s[i + 1] == 'W') || (s[i] == 'W' && s[i + 1] == 'B')) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 1 | 10,604,482 |
#include <iostream>
#define MAX 2000000
#define INFTY 2000000000
using namespace std;
int A[MAX+1], h;
void heapIncreaseKey(int i, int key){
if(key < A[i]) cerr << "new key is smaller than current key" << endl;
A[i] = key;
while(i > 1 && A[i/2] < A[i]){
int tmp = A[i/2];
A[i/2] = A[i];
A[i] = tmp;
i /= 2;
}
}
void maxHeapInsert(int key){
h++;
A[h] = -INFTY;
heapIncreaseKey(h, key);
}
void maxHeapify(int i){
int l = 2 * i;
int r = 2 * i + 1;
int largest;
if(l <= h && A[l] > A[i]) largest = l;
else largest = i;
if(r <= h && A[r] > A[largest]) largest = r;
if(largest != i){
int tmp = A[i];
A[i] = A[largest];
A[largest] = tmp;
maxHeapify(largest);
}
}
int heapExtractMax(){
if(h < 1) cerr << "head underflow" << endl;
int max = A[1];
A[1] = A[h];
h--;
maxHeapify(1);
return max;
}
int main(){
string com;
int key;
cin >> com;
while(com != "end"){
if(com == "insert"){
cin >> key;
maxHeapInsert(key);
}
else cout << heapExtractMax() << endl;
cin >> com;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main(){
priority_queue <int> a;
int tmp1;
char tmp2[10];
while(scanf("%s",tmp2),tmp2[2]!='d'){
if(tmp2[0]=='i'){
scanf("%d",&tmp1);
a.push(tmp1);
}
else{
printf("%d\n",a.top());
a.pop();
}
}
return 0;
} | 1 | 32,528,063 |
#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;
cin>>n;
n--;
vector<int>c(n),s(n),f(n);
rep(i,n)cin>>c[i]>>s[i]>>f[i];
rep(i,n){
int x=c[i]+s[i];
for(int j=i+1; j<n; ++j){
if(x<s[j])x=s[j];
if((x-s[j])%f[j]!=0)x+=f[j]-((x-s[j])%f[j]);
x+=c[j];
}
cout<<x<<endl;
}
cout<<0<<endl;
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 <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
std::vector<lint> c, s, f;
lint next_train(lint cur, lint st_num)
{
if (cur <= s[st_num])
return s[st_num];
if (cur % f[st_num] == 0)
return cur;
return (cur / f[st_num] + 1) * f[st_num];
}
int main()
{
lint n;
scanf("%lld", &n);
for (int i = 0; i < n - 1; ++i)
{
lint ce, se, fe;
scanf("%lld", &ce);
scanf("%lld", &se);
scanf("%lld", &fe);
c.push_back(ce);
s.push_back(se);
f.push_back(fe);
}
for (int i = 0; i < n; ++i)
{
lint time = 0;
for (int j = i; j < n - 1; ++j)
{
time = next_train(time, j);
time += c[j];
}
printf("%lld\n", time);
}
return 0;
} | 1 | 62,707,109 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
long A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
long res = 0;
for (int i = 0; i < N; i++)
{
if (A[i] >= B[i])
{
res += B[i];
continue;
}
else
{
res += A[i];
B[i] -= A[i];
}
if (A[i + 1] >= B[i])
{
res += B[i];
A[i + 1] -= B[i];
}
else
{
res += A[i + 1];
A[i + 1] = 0;
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define pi std::pair<int, int>
#define stdabs std::abs
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
#define vec std::vector
#define oreq |=
#define npm next_permutation
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
ll extgcd(ll a, ll b, ll& x, ll& y);
ll nCr(ll n, ll r);
void stat();
template <typename T> T fact(T num);
constexpr ll mod = 1000000000 + 7;
int main()
{
stat();
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ull ans = 0;
rep(i, n)
{
ans+=min(a[i],b[i]);
ans+=min(a[i+1],b[i]-min(a[i],b[i]));
a[i+1]-= min(a[i+1],b[i]-min(a[i],b[i]));
}
cout<<ans<<endl;
return 0;
}
ll extgcd(ll a, ll b, ll& x, ll& y)
{
if (b == 0) {
x = 1, y = 0;
return a;
}
ll d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
std::vector<unsigned ll> genprimevec(const unsigned ll N)
{
std::vector<bool> is_prime(N + 1);
for (unsigned ll i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<unsigned ll> P;
for (unsigned ll i = 2; i <= N; i++) {
if (is_prime[i]) {
for (unsigned ll j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
void stat(){
#ifdef local
rep(i, 2){std::cout << "local enable" << std::endl;
}
#endif
#ifdef hacks
rep(i, 2) { std::cout << "boost enable" << std::endl; }
#endif
}
ll nCr(ll n, ll r)
{
ll num = 1;
for (ll i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
template <typename T> T fact(T num)
{
if (num == 1) { return 1; }
return num * fact(num - 1);
} | 1 | 65,382,845 |
#include<bits/stdc++.h>
using namespace std ;
const int N =3e5 + 7 ;
int n , m ;
int occ[N] ;
vector<long long> v , v2 ;
long long solve(int x){
long long ret = 0 ;
int l = 1 , r = n ;
while(l<=r){
long long mid = (l + r) >> 1 ;
long long deli = upper_bound(v.begin() , v.end() , mid ) - v.begin() ;
long long gaz = (deli ? v2[deli - 1] : 0) + ((int) v.size() - deli ) * mid ;
if(gaz>=mid * x){
l = mid+1 ;
ret = mid ;
}
else {
r = mid -1 ;
}
}
return ret ;
}
int main(){
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin >> n ;
for(int i = 0 ;i < n;i++){
int x ;
cin >> x;
occ[x] ++ ;
}
for(int i = 0 ;i <= n;i++){
v.push_back(occ[i]) ;
v2.push_back(0) ;
}
sort(v.begin() , v.end()) ;
for(int i = 0 ;i <= n;i ++){
if(i){
v2[i] = v2[i-1] ;
}
v2[i] += v[i] ;
}
v2.push_back(v2.back()) ;
for(int i = 1 ;i <= n;i++){
cout<< solve(i) <<"\n" ;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> C(n + 1, 0), D(n + 1, 0), skD(n + 1), sD(n + 1), f(n + 1);
for (int i = 0; i < n; i++) {
int A;
cin >> A;
C[A]++;
}
for (int i = 0; i <= n; i++) {
D[C[i]]++;
}
skD[0] = 0;
sD[0] = D[0];
for (int i = 1; i <= n; i++) {
skD[i] = skD[i - 1] + i * D[i];
sD[i] = sD[i - 1] + D[i];
}
f[0] = n;
for (int i = 1; i <= n; i++) {
f[i] = (skD[i] + i * (sD[n] - sD[i])) / i;
}
reverse(f.begin(), f.end());
for (int i = 1; i <= n; i++) {
int j = lower_bound(f.begin(), f.end(), i) - f.begin();
cout << n - j << endl;
}
return 0;
} | 1 | 33,162,314 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 99999;
rep(t, n) {
int a = 0; int b = 0;
for (int j = 0; j <= t; j++) {
a += w[j];
}
for (int k = t+1; k < n; k++) {
b += w[k];
}
ans = min(ans, abs(a-b));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
ll now = 0;
rep(i, n)
{
cin >> a[i];
now += a[i];
}
ll ans = now;
rep(i, n)
{
now -= 2 * a[i];
ans = min(ans, abs(now));
}
cout << ans << endl;
} | 1 | 49,733,652 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
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;
}
int main(void) {
map<string, int> counter;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
counter[s]++;
}
int M;
cin >> M;
for (int i = 0; i < M; i++) {
string t;
cin >> t;
counter[t]--;
}
int ans = 0;
for (auto &p : counter) {
chmax(ans, p.second);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
map<string, int> s;
string x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (s.find(x) == s.end()) {
s[x] = 0;
}
s[x]++;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> x;
if (s.find(x) != s.end()) {
s[x]--;
}
}
int max = 0;
for (map<string, int>::iterator it = s.begin(); it != s.end(); it++) {
if (max < it->second) {
max = it->second;
}
}
cout << max << endl;
return 0;
} | 1 | 1,282,242 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int nxt[20][100000], rev[20][100000];
int main(){
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
vector<int> y(n);
for(int i = 0; i < n; i++) y[i] = 1e9-x[n-1-i];
int l;
cin >> l;
for(int i = 0; i+1 < n; i++){
nxt[0][i] = upper_bound(x.begin(),x.end(),x[i]+l)-x.begin()-1;
rev[0][i] = upper_bound(y.begin(),y.end(),y[i]+l)-y.begin()-1;
}
nxt[0][n-1] = -1;
rev[0][n-1] = -1;
for(int k = 0; k+1 < 20; k++){
for(int i = 0; i < n; i++){
if(nxt[k][i] < 0) nxt[k+1][i] = -1;
else nxt[k+1][i] = nxt[k][nxt[k][i]];
if(rev[k][i] < 0) rev[k+1][i] = -1;
else rev[k+1][i] = rev[k][rev[k][i]];
}
}
auto f = [&](int a, int b, int c[20][100000])->int{
int ret = 0, tmp = a;
for(int k = 19; k >= 0; k--){
int to = c[k][tmp];
if(to >= 0 && to < b){
tmp = to;
ret += 1<<k;
}
}
return ret+1;
};
int q;
cin >> q;
while(q--){
int a, b;
cin >> a >> b;
a--, b--;
if(a < b) cout << f(a, b, nxt) << endl;
else cout << f(n-1-a, n-1-b, rev) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = 998244353;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> matP;
int main() {
cin>>N;
vec x(N);
rep(i,N) cin>>x[i];
cin>>L>>Q;
mat dbl(20,vec(N+1));
x.push_back(x[N-1] + L);
rep(i,N + 1){
dbl[0][i] = --upper_bound(ALL(x), x[i] + L) - x.begin();
}
reps(k,1,20) rep(i,N + 1) dbl[k][i] = dbl[k-1][dbl[k-1][i]];
rep(i,Q){
cin>>A>>B;
--A; --B;
if(A > B) swap(A, B);
ll res = 0;
Rrep(j,20){
if(dbl[j][A] < B){
A = dbl[j][A];
res += (1LL<<j);
}
}
cout<<res + 1<<endl;
}
} | 1 | 57,149,801 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
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;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main()
{
gearup;
ll n; cin >> n;
vl a(n), b(n);
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
ll cnt = 0;
rep(i,n){
if(a[i] > b[i]){
cnt +=a[i] - b[i];
b[i] = a[i];
}
}
rep(i,n){
if(b[i] > a[i]){
ll cnt2 = (b[i] - a[i])/2;
a[i] += 2*cnt2;
cnt -= cnt2;
if(b[i] > a[i]){
a[i] += 2;
b[i] += 1;
}
}
}
cout << (cnt <= 0?"Yes":"No" ) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<ll> A(n); rep(i, n) cin >> A[i];
vector<ll> B(n); rep(i, n) cin >> B[i];
ll sumA = accumulate(all(A), 0LL);
ll sumB = accumulate(all(B), 0LL);
ll m = sumB-sumA;
ll two=0, one=0;
rep(i, n) {
if(A[i] > B[i]) {
one += A[i]-B[i];
} else if(A[i] < B[i]) {
two += (B[i]-A[i]+1)/2;
}
}
cout << (two<=m ? "Yes" : "No") << "\n";
return 0;
} | 1 | 57,960,624 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
int main(){
ll n;
cin >> n;
ll ans;
ans = ((n - (ll)1) * n) / (ll)2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long n;
int main()
{
scanf("%lld",&n);
printf("%lld\n",n*(n-1)/2);
return 0;
} | 1 | 99,103,752 |
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
int N;
int INF = 1e9 + 1;
int dp[100001];
int a[100001];
int main(void){
cin >> N;
for(int i=0; i<N; ++i) cin >> a[i];
fill(dp, dp+N, INF);
for(int i=0; i<N; ++i){
*lower_bound(dp, dp+N, a[i]) = a[i];
}
cout << lower_bound(dp, dp+N, INF) - dp << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define TS to_string
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
ll INF = 1e9;
ll MOD = 1000000007;
ll LINF = 1e18;
ld EPS = 1e-9;
ld PI = M_PI;
vll dx = {1, 0, -1, 0, 1, -1, -1, 1};
vll dy = {0, 1, 0, -1, 1, 1, -1, -1};
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;}
void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
vll a(n);
REP(i,n) cin >> a[i];
vll ans;
ans.push_back(a[0]);
for(ll i = 1; i < n; i++){
ll t = a[i];
if(ans.back() < t) ans.push_back(t);
else{
ll lef = -1, rig = ans.size();
while(rig - lef > 1){
ll mid = (lef + rig) / 2;
if(t <= ans[mid]) rig = mid;
else lef = mid;
}
ans[rig] = t;
}
}
cout << ans.size() <<endl;
return 0;
} | 1 | 53,189,043 |
#include <bits/stdc++.h>
#define off exit( 0 )
#define cn continue
#define rt return
#define sc scanf
#define pr printf
#define pb push_back
#define pf push_front
#define p_f pop_front
#define p_b pop_back
#define ff first
#define ss second
#define ll long long
#define ld long double
#define N 356
#define M 1000000007
#define I 1000000000000000000
#define pdd pair < ld, ld >
#define pll pair < ll, ll >
#define pii pair < int, int >
#define sqr( a ) a * a
#define all( c ) c.begin(), c.end()
#define srt( c ) sort( all( c ) )
#define rev( c ) reverse( all( c ) )
#define srtr( c ) sort( c.rbegin(), c.rend() );
using namespace std;
ll n, a, b, x, y;
void solve()
{
cin >> n;
for( int i = 1; i <= n; i ++ )
{
cin >> a >> b;
x += b;
y += a * b;
}
x --;
y --;
x += y / 9;
cout << x;
}
int main()
{
ll tt = 1;
for( ll i = 1; i <= tt; i ++ )
{
solve();
}
} | #include<stdio.h>
#include<cmath>
#define MAX_LEN 200000
int main(){
int n, i, d;
long long c;
long long sum = 0, digit_num=0;
int check = scanf("%d", &n);
for(i=0;i<n;i++){
int check = scanf("%d %lld", &d,&c);
sum += d * c;
digit_num += c;
}
long long reduction_num = (sum-1) / 9;
printf("%lld\n", digit_num - 1 + reduction_num);
return 0;
} | 1 | 56,518,303 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> H, W;
int i = 0, n, m;
while(1) {
cin >> n >> m;
H.push_back(n);
W.push_back(m);
if(H[i] == 0 && W[i] == 0) break;
i++;
}
for(i = 0; H.size(); i++) {
if(i != 0) cout << endl;
if(H[i] == 0 && W[i] == 0) break;
for(int x = 0; x < H[i]; x++) {
for(int y = 0; y < W[i]; y++) {
if(x == 0 || x == H[i]-1 || y == 0 || y == W[i]-1) cout << "#";
else cout << ".";
if(y == W[i]-1) cout << endl;
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b;
while(scanf("%d%d",&a,&b),a||b){
for(int c=0;c<a;c++){
for(int d=0;d<b;d++){
if(c==0||a-1==c||d==0||b-1==d) printf("#");
else printf(".");
}
printf("\n");
}
printf("\n");
}
} | 1 | 8,709,352 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
float a,b,x;
cin>>a>>b;
x=(a+b)/2;
cout<<round(x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,x;
cin >> a >> b;
if((a+b)%2<0.5)
x=(a+b)/2;
else
x=(a+b)/2+1;
cout << x <<endl;
} | 1 | 28,591,505 |
#include "bits/stdc++.h"
using namespace std;
void solve()
{
int n, k;
cin >> n >> k;
vector<int> as(n), bs(n);
for (int i = 0; i < n; i++)
{
cin >> as[i] >> bs[i];
}
long ans = 0;
for (int x = 0; x < n; x++)
{
bool f = 1;
for (int i = 30; i >= 0; i--)
{
if ((k >> i & 1) < (as[x] >> i & 1))
f = 0;
}
if (f)
ans += bs[x];
}
for (int i = 30; i >= 0; i--)
{
if (!(k >> i & 1))
continue;
long res = 0;
for (int x = 0; x < n; x++)
{
if (as[x] >> i & 1)
continue;
bool f = 1;
for (int j = 30; j > i; j--)
{
if ((k >> j & 1) < (as[x] >> j & 1))
f = 0;
}
if (f)
res += bs[x];
}
ans = max(ans, res);
}
cout << ans << endl;
}
int main()
{
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int N, K;
vector<pii> P;
int main() {
scanf("%d %d", &N, &K);
P.resize(N);
for(int i = 0; i < N; i++) {
scanf("%d %d", &P[i].first, &P[i].second);
}
ll mx = 0;
ll cost = 0;
for(int i = 0; i < N; i++) {
if((K | P[i].first) == K) cost += P[i].second;
}
mx = cost;
while(1) {
if(K == 0) break;
int nK = K - 1;
ll cost = 0;
for(int i = 0; i < N; i++) {
if((nK | P[i].first) == nK) cost += P[i].second;
}
mx = max(mx, cost);
K -= (K & -K);
}
printf("%lld", mx);
} | 1 | 9,155,214 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, min, mid, max;
cin >> a >> b >> c;
min = a;
if (min > b){
min = b; mid = a;
} else{
mid = b;
}
if (min > c){
max = mid; mid = min; min = c;
} else{
if(mid < c){
max = c;
} else{
max = mid; mid = c;
}
}
cout << min << " " << mid << " " << max << "\n";
} | #include <algorithm>
#include <iostream>
using namespace std;
int a[3];
int main (){
for(int i=0;i<3;i++){
cin>>a[i];}
sort(a,a+3);
for(int i=0;i<3;i++){
cout<<a[i];
if(i!=2){cout<<" ";}}
cout<<endl;
return 0;
} | 1 | 25,014,459 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
ll x;
cin >> x;
ll res = 0;
rep(i, n) {
ll xi;
cin >> xi;
res = gcd(res, abs(xi - x));
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,i,j;
cin>>n>>x;
int ara[n+1];
ara[0]=x;
for(i=1;i<=n;i++)
cin>>ara[i];
sort(ara,ara+n+1);
int bra[n];
for(i=1;i<=n;i++)
{
bra[i-1]=ara[i]-ara[i-1];
}
sort(bra,bra+n);
for(i=bra[0];i>=1;i--)
{
int p=1;
for(j=0;j<n;j++)
{
if(bra[j]%i !=0)
{
p=0;
break;
}
}
if(p==1)
{
cout<<i<<endl;
break;
}
}
return 0;
} | 1 | 9,604,635 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
#define rrep(i, beg, end) for (int i = (beg); i >= (end); i--)
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsigned long long ull;
const int INF = 2e9;
const int mod = 1e9 + 7;
const int N = 1010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(void)
{
int w,h,x,y; cin >> w >> h >> x >> y;
cout << (double)w * h / 2;
if (x * 2 == w && y * 2 == h) cout << " 1" << endl;
else cout << " 0" << endl;
return 0;
} | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
double w,h,x,y;
cin>>w>>h>>x>>y;
cout<<fixed<<setprecision(6)<<w*h/2<<" ";
if(2*x-w==0 && 2*y-h==0)
cout<<1<<"\n";
else
cout<<0<<"\n";
return 0;
} | 1 | 11,169,657 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a , b;
cin >> a >> b;
if(a/2*2 != a && b/2*2 != b) {
cout << "Odd" << endl;
}
else {
cout << "Even" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int x = a*b % 2;
if (x != 0) {
cout << "Odd" << endl;
}
else cout << "Even" << endl;
} | 1 | 85,292,828 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= m; i++) cin >> b[i];
dp[0][0] = 1;
for(int i = 0; i <= n; i++) sum[i][0] = 1;
for(int i = 0; i <= m; i++) sum[0][i] = 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <=m; j++){
if(a[i] == b[j]) dp[i][j] = sum[i-1][j-1];
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + dp[i][j] + mod;
sum[i][j] %= mod;
}
}
cout << sum[n][m] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long ara[2003][2003],tra[2003][2003],val[2003],tal[2003];
long long mod=1000000007;
int main()
{
long long n,m,i,j,k,x,y,z,p,q,r,a,b=1;
scanf("%lld %lld",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); val[i]=a;
}
for(i=1;i<=m;i++)
{
scanf("%lld",&a); tal[i]=a;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(val[i]==tal[j])
{
if(i==1 || j==1)ara[i][j]=1;
else
{
p=i-1; q=j-1;
ara[i][j]=(tra[p][q]+1)%mod;
}
}
b=(b+ara[i][j])%mod;
x=(tra[i-1][j]+tra[i][j-1]+ara[i][j])%mod;
y=tra[i-1][j-1];
if(x>=y)z=x-y;
else{ z=(mod-y)+x; }
tra[i][j]=z;
}
}
printf("%lld\n",b);
return 0;
} | 1 | 48,765,123 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n,k;
cin >> n >> k;
ll a[n];
REP(i,n){
cin >> a[i];
}
vector<ll> vec;
REP(i,n){
ll sum = 0;
for(int j = i; j < n; j++){
sum += a[j];
vec.push_back(sum);
}
}
ll ans = 0;
for(int i = 40; i >= 0; i--){
ll mask = 1LL << i;
int cnt = 0;
vector<ll> use;
REP(j,vec.size()){
if(vec[j] & mask){
cnt++;
use.emplace_back(vec[j]);
}
}
if(cnt >= k){
ans += mask;
vec = use;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(a,b,sizeof(a))
#define sz(x) ((int)(x.size()))
#define eb emplace_back
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define vi vector<int>
#define pii pair<int,int>
#define mii map<int,int>
#define F first
#define S second
#define makep make_pair
#define maket make_tuple
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define bitcount(x) __builtin_popcountll(x)
#define iceil(n,x) (((n)+(x)-1)/(x))
#define gcd(a,b) (__gcd((a),(b)))
#define lcm(a,b) ((a)*((b)/gcd((a),(b))))
#define dbug(x) cout<<#x<<": "<<(x)<<"\n"
#define flush fflush(stdout)
#define show(x) for(auto zz:x)cout<<zz<<" ";cout<<"\n";
#define show2(x) for(auto zz:x)cout<<zz.F<<" "<<zz.S<<"\n";
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ld pi=acos(-1);
const ll inf=1e18,M=1e9+7;
const int N=1;
void solve()
{
int n,k;
cin>>n>>k;
vi v(n);
for(int i=0;i<n;++i)
cin>>v[i];
vi w;
for(int i=0;i<n;++i)
{
int x=0;
for(int j=i;j<n;++j)
{
x+=v[j];
w.pb(x);
}
}
vi tmp;
int ans=0;
for(int i=60;i>=0;--i)
{
int val=1ll<<i,cnt=0;
for(auto c:w)
{
if(c&val)
++cnt;
}
if(cnt<k)
continue;
ans^=val;
for(auto c:w)
{
if(c&val)
tmp.pb(c);
}
w=tmp;
tmp.clear();
}
cout<<ans;
}
int32_t main()
{
fast();
int t=1;
for(int z=1;z<=t;++z)
{
solve();
}
return 0;
} | 1 | 47,734,706 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
typedef pair<ll,ll>pll;
const ll MAX=100000;
const ll MOD=1e9+7;
vector<ll>sot,unsot;
ll f[MAX+100];
int main()
{
ll n;
cin>>n;
ll ara[n+3];
for(ll i=0;i<n;i++)cin>>ara[i];
sort(ara,ara+n);
double sum=0,a;
a=ara[0];
for(ll i=1;i<n;i++)
{
a+=ara[i];
sum=a/2;
a=sum;
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n; cin>>n;
vector<ll> v(n);
rep(i,n) cin>>v[i];
sort(v.begin(),v.end());
double tmp=v[0];
for(int i=1;i<n;i++){
tmp+=v[i];
tmp/=2;
}
cout<<tmp<<endl;
return 0;
} | 1 | 13,738,903 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
ll a, b; cin >> a >> b;
if(a <= b)cout << 0 << endl;
else cout << a-b << endl;
system("pause");
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 1000034000;
typedef vector<ll> vecl;
typedef vector<int> veci;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
uintmax_t combination(unsigned int n, unsigned int r)
{
if (r * 2 > n)
r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for (unsigned int i = 1; i <= r; ++i)
{
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N, x;
cin >> N >> x;
if(N < x){
cout << 0 << endl;
}
else{
cout << N - x << endl;
}
} | 1 | 74,477,904 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,l,t,cnt,ans[100010];
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(int x,y,i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
ans[i]=x+t*(y==1?1:-1);
cnt+=ans[i]>0?ans[i]/l:(ans[i]-l+1)/l;
ans[i]=(ans[i]%l+l)%l;
}
sort(ans+1,ans+n+1);
cnt=(cnt%n+n)%n;
for(int i=cnt+1;i<=n;i++)
printf("%d\n",ans[i]);
for(int i=1;i<=cnt;i++)
printf("%d\n",ans[i]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int N,L,T,d,A[maxn];
int pre(int x) {return x == 1 ? N : x - 1;}
int nex(int x) {return x == N ? 1 : x + 1;}
int main(){
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
cin >> N >> L >> T;
for (int i = 1; i <= N; i++){
int x,w; scanf("%d%d",&x,&w);
if(w==1){
int dt = T;
if (L - x <= dt)
dt -= (L - x),++d,x = 0;
x += dt; d += dt / L; x %= L;
}
else{
int dt = T;
if (x + 1 <= dt)
dt -= (x + 1),--d,x = L - 1;
x -= dt; d -= dt / L; x %= L;
if (x < 0) x += L;
}
A[i] = x; d %= N;
}
int pos = 1; d %= N;
while (d < 0) pos = pre(pos),++d;
while (d > 0) pos = nex(pos),--d;
sort(A + 1,A + N + 1);
for (int i = pos; i <= N; i++) printf("%d\n",A[i]);
for (int i = 1; i < pos; i++) printf("%d\n",A[i]);
return 0;
} | 1 | 9,408,711 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
# define ll int64_t
# define str string
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define INF 2000000000
#define MAX_V 10
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<string,ll> a,pair<string,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll modpow(ll a,ll n,ll mod1) {
ll res=1;
while(n>0){
if(n&1) res=res*a%mod1;
a = a*a%mod1;
n >>= 1;
}
return res;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) (x*=i)%=mod;
return x;
}
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/gcd(a,b)*b;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll h,w;
cin>>h>>w;
ll sum=0;
if(h>=2 && w>=2) {
sum+=(h-2)*(w-2);
}else if((w==1 || h==1) && h!=w){
sum+=max(h,w)-2;
}else{
cout<<1<<endl;
return 0;
}
cout<<sum<<endl;
return 0;
} | #include<cstdio>
#include<string>
#include<cstring>
#include<utility>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<algorithm>
#include<vector>
#include<iostream>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7fffffff
using namespace std;
int main()
{
int i,j,k,n,m,x,y;
scanf("%d%d",&x,&y);
if(x==1&&y==1)
{
printf("%d",1);
}
else if(x==1)
{
printf("%d",y-2);
}
else if(y==1)
{
printf("%d",x-2);
}
else
{
printf("%lld",1ll*(x-2)*(y-2));
}
return 0;
} | 1 | 22,517,589 |
#include<stdio.h>
#include<string.h>
int main()
{
int i,t,j,s=0;
char S[210],T[210];
char d;
scanf("%s",S);
scanf("%s",T);
t=strlen(S);
for(i=0;i<t;i++)
{
if(strcmp(S,T)==0)
{
s=1;
break;
}
d=S[t-1];
for(j=t-2;j>=0;j--)
{
S[j+1]=S[j];
}
S[0]=d;
}
if(s==0)
printf("No");
else
printf("Yes");
return 0;
} | #include <iostream>
#include <string>
std::string StringRotation(std::string s);
int main() {
std::string S, T;
std::cin >> S >> T;
bool flag{false};
for (int i = 0; i < S.length(); i++) {
S = StringRotation(S);
if (S == T) {
flag = true;
break;
}
}
if (flag)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
std::string StringRotation(std::string s) {
return s.back() + s.substr(0, s.length() - 1);
} | 1 | 98,337,713 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<list>
#define N 10002
using namespace std;
vector<int> G[N+1];
list<int> ans;
bool visited[N+1];
int indeg[N+1];
int n;
void dfs(int node){
visited[node]=true;
for(int i=0;i<G[node].size();i++){
int v=G[node][i];
if(visited[v]==false){
dfs(v);
}
}
ans.push_front(node);
}
int main(){
int q;
cin>>n>>q;
for(int i=0;i<n;i++){
visited[i]=false;
indeg[i]=0;
}
for(int i=0;i<q;i++){
int s,t;
cin>>s>>t;
G[s].push_back(t);
indeg[t]++;
}
for(int i=0;i<n;i++){
if(visited[i]==false){
dfs(i);
}
}
for(list<int>::iterator it=ans.begin();it!=ans.end();it++){
cout<<*it<<endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i, s, n) for(int i=(s); i<=(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef const int let;
int V, E;
vector <int> G[10005];
bool vis[10005];
vector <int> out;
void bfs(let s, int *indeg)
{
queue <int> que; que.emplace(s);
++indeg[s];
while (!que.empty()) {
int u = que.front(); que.pop();
out.emplace_back(u);
for(let x : G[u])
if( --indeg[x] == 0 && !vis[x]++ ) que.emplace(x);
}
}
void topologial_sort()
{
static int indeg[10005] = {};
rep(i, V)
for(let x: G[i]) ++indeg[x];
rep(i, V)
if (indeg[i] == 0 && !vis[i]) bfs(i, indeg);
for_each(out.cbegin(), out.cend(), [](let x) { outl( x ); });
}
signed main()
{
cin.tie(0), ios::sync_with_stdio(false);
cin >> V >> E;
while(E--) {
int s, t;
cin >> s >> t;
G[s].emplace_back(t);
}
topologial_sort();
} | 1 | 97,723,805 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
# define rep(i,n) for(int i=0;i<n;++i)
# define forn(i,n) for(int i=1;i<=n;++i)
# define lr(i,l,r) for(int i=l;(l>r?i>=r:i<=r);(l>r?--i:++i))
using namespace std;
template<class T> void umin(T &a, T b) { a = min(a, b); }
template<class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9+7;
const int N = 1e5+5;
int n,m;
ll ans;
void solve(){
cin>>n>>m;
vector<pii>v;
forn(i,n){
int x,y;
cin>>x>>y;
v.pb({x,y});
}
sort(all(v));
rep(i,n){
if(!m)break;
if(m-v[i].S>=0){
m-=v[i].S;
ans+=v[i].S*1LL*v[i].F;
}
else{
ans+=v[i].F*1LL*m;
m=0;
}
}
cout<<ans;
}
int main(){
Speed();
int T=1;
while(T--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,M;cin>>N>>M;
long long A[N],B[N];
vector<pair<long long,long long>>C(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
C[i].first=A[i];
C[i].second=B[i];
}
sort(C.begin(),C.end());
long long ans=0;
for(long long i=0;i<N;i++){
ans+=min(C[i].second,M)*C[i].first;
M-=C[i].second;
if(M<=0){
break;
}
}
cout<<ans<<endl;
return 0;
} | 1 | 1,604,239 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
int main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
vector<bool> vis(101, false);
int cnt=0;
for(int i=a;i<=b;i++) vis[i] = true;
for(int i=c;i<=d;i++) if(vis[i]) cnt++;
if(cnt>0) cnt--;
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(b<c || d<a){
cout << 0 << endl;
}
else if(b>=d && c>=a) cout << d-c << endl;
else if(d>b && a>c) cout << b-a << endl;
else if(b-c>=d-a) cout << d-a << endl;
else if(d-a>b-c) cout << b-c << endl;
} | 1 | 76,764,584 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
string devide[4] = {"dream", "dreamer", "erase", "eraser"};
string S;
bool flag1,flag2;
cin >> S;
reverse(S.begin(),S.end());
rep(i, 4)
reverse(devide[i].begin(), devide[i].end());
flag1 = true;
for(int i = 0;i < S.size();){
flag2 = false;
rep(j,4){
string s = devide[j];
if(S.substr(i,s.size() ) == s){
flag2 = true;
i += s.size();
}
}
if(flag2 == false){
flag1 = false;
break;
}
}
if(flag1)
cout << "YES" << endl;
else
cout << "NO" << 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;
int main(){
string s; cin>>s;
bool flg=true;
while(flg){
flg=false;
int dream = s.rfind("dream");
int dreamer = s.rfind("dreamer");
int erase = s.rfind("erase");
int eraser = s.rfind("eraser");
if(5 == s.size() - dream){
s = s.substr(0,dream);
flg=true;
}
if(7 == s.size() - dreamer){
s = s.substr(0,dreamer);
flg=true;
}
if(5 == s.size() - erase){
s = s.substr(0,erase);
flg=true;
}
if(6 == s.size() - eraser){
s = s.substr(0,eraser);
flg=true;
}
}
if(s.size()==0){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | 1 | 97,068,348 |
#include<iostream>
using namespace std;
int main(void){
int info;
cin >> info;
int b = 0,f = 0,r = 0,v = 0;
int room[4][3][10]={{{}}};
for (int i = 1; i <= info; i++){
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1] += v;
}
for (int x = 0; x <= 3; x++){
for (int y = 0; y <= 2; y++){
for (int z = 0; z <= 9; z++){
if (z < 9){
cout << " " << room[x][y][z];
}
else{
cout << " " << room[x][y][z] << endl;
}
}
}
if (x < 3){
cout << "####################" << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int b;
int f[4][3][10] = {};
cin >> b;
for (int i = 0; i < b; i++)
{
int a, c, d, e;
cin >> a >> c >> d >> e;
f[a-1][c-1][d-1] += e;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
cout << " " << f[i][j][k];
}
cout << endl;
}
if (i < 3)
for (int i = 0; i < 20; i++)
{
cout << "#";
}
if (i < 3)
cout << endl;
}
} | 1 | 68,580,034 |
#include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<ll>())
#define ll long long
#define ld long double
#define fixset(val) cout << fixed << setprecision(10) << val << endl;
#define rep(i, s, g) for (ll i = (s); i < (g); i++)
#define mod 1000000007
#define vfind(v, target) find(v.begin(), v.end(), target)
#define notFound(v, target) (vfind(v, target) == v.end())
using namespace std;
int main()
{
ll N, M, D; cin >> N >> M >> D;
ld ans;
if (D == 0) {
ans = (ld)(M - 1) / N;
} else {
ans = (ld)(M - 1) * (N - D) * 2 / (N * N);
}
fixset(ans);
} | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
}
else {
break;
}
}
return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes(){
cout<<"Yes"<<endl;
}
void No(){
cout<<"No"<<endl;
}
void YES(){
cout<<"YES"<<endl;
}
void NO(){
cout<<"NO"<<endl;
}
#define fin(i) scanf("%lld",&i)
#define fout(i) printf("%lld",i)
#define fendl printf("\n")
template <class T>
class LazySegTree {
int n;
vector<T> data;
vector<T> lazy;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return def;
if (a <= l && r <= b)
return data[k];
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
return operation(c1, c2);
}
}
public:
LazySegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
void change(int i, int j, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
T query(int a, int b) {
return _query(a, b, 0, 0, n);
}
T operator[](int i) {
return data[i + n - 1];
}
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
long double n,m,d,ans;
signed main() {
cin>>n>>m>>d;
if (d) {
ans=(n-d)*2;
}else{
ans=n-d;
}
ans/=n*n;
ans*=m-1;
printf("%.10Lf\n",ans);
} | 1 | 86,453,565 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1);
dp.at(0) = 1;
ll sm = 0;
mrep(i, 1, n + 1){
if(i >= 3){
sm = (sm + dp.at(i - 3)) % mod;
}
dp.at(i) = sm % mod;
}
cout << dp.at(n) << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <cmath>
#include <limits>
#include <iomanip>
#include <cstring>
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int s;
long long r[2001];
long long mod = 1000000007;
cin >> s;
fill_n(r, 2001, 1);
r[0] = 0;
r[1] = 0;
r[2] = 0;
for(int i = 6; i <= 2000; i++) {
for(int j = 3; j <= i-3; j++) {
r[i] += r[j];
r[i] %= mod;
}
}
cout << r[s] << endl;
return 0;
} | 1 | 32,477,044 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
map<int,int> mp;
int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
mp[a[i]]++;
mp[a[i]-1]++;
mp[a[i]+1]++;
ans=max(ans,max(mp[a[i]],max(mp[a[i]-1],mp[a[i]+1])));
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int r=100001;
int n; cin>>n;
vector<int> v(r);
rep(i,n){
int a; cin>>a; v[a]++;
}
int mx=0;
for(int i=1; i<r-1; i++){
int sum=v[i-1]+v[i]+v[i+1];
mx=max(mx,sum);
}
cout<<mx<<endl;
} | 1 | 89,190,113 |
#include <array>
#include <iostream>
#include <vector>
int main() {
int n;
std::string s;
std::cin >> n >> s;
std::vector<std::array<int, 3>> sum(n + 1);
for (int i = n - 1; i >= 0; --i) {
int c;
if (s[i] == 'R')
c = 0;
else if (s[i] == 'G')
c = 1;
else if (s[i] == 'B')
c = 2;
sum[i][c] = sum[i + 1][c] + 1;
sum[i][(c + 1) % 3] = sum[i + 1][(c + 1) % 3];
sum[i][(c + 2) % 3] = sum[i + 1][(c + 2) % 3];
}
long long res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (s[i] == s[j])
continue;
int c;
if (s[i] == 'R' && s[j] == 'G')
c = 2;
else if (s[i] == 'G' && s[j] == 'R')
c = 2;
else if (s[i] == 'G' && s[j] == 'B')
c = 0;
else if (s[i] == 'B' && s[j] == 'G')
c = 0;
else if (s[i] == 'B' && s[j] == 'R')
c = 1;
else if (s[i] == 'R' && s[j] == 'B')
c = 1;
res += sum[j + 1][c];
int k = j + (j - i);
if (k < n) {
if (s[k] == 'R' && c == 0)
res -= 1;
if (s[k] == 'G' && c == 1)
res -= 1;
if (s[k] == 'B' && c == 2)
res -= 1;
}
}
}
std::cout << res << std::endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) (cerr << #x << " = " << x << endl;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const ll mod = 1e9 + 7;
const double EPS = 1e-10;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll v[3];
int idx(char x)
{
if(x == 'R')
return 0;
else if(x == 'G')
return 1;
else
return 2;
}
int main()
{
ios::sync_with_stdio(0);
int n;
string s;
cin >> n >> s;
for(int i = 0; i < n ; i++)
{
v[idx(s[i])]++;
}
ll ans = v[0] * v[1] * v[2];
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
int k = 2*j - i;
if(k < n && s[i] != s[j] && s[j] != s[k] && s[i] != s[k])
ans--;
}
}
cout << ans << endl;
return 0;
} | 1 | 8,492,180 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
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; }
inline int gcd(int a, int b) { if (a%b == 0) { return b; } else { return gcd(b, a%b); } }
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int iy = 0; iy < h; iy++) {
for (int ix = 0; ix < w; ix++) {
if (s[iy][ix] == '.') {
continue;
}
bool okay = false;
for (int k = 0; k < 4; k++) {
int y = iy + dy[k];
int x = ix + dx[k];
if (0 <= x && 0 <= y && x < w && y < h && s[y][x] == '#')
{
okay = true;
break;
}
}
if (okay == false) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w; cin >>h >>w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >>s[i];
string ret = "Yes";
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '#') {
if (i>0 && s[i-1][j]=='#') continue;
if (i<h-1 && s[i+1][j]=='#') continue;
if (j>0 && s[i][j-1]=='#') continue;
if (j<w-1 && s[i][j+1]=='#') continue;
ret = "No";
break;
}
}
if (ret == "No") break;
}
cout << ret << endl;
return 0;
} | 1 | 28,655,995 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
ll INF = (ll)pow(10, 15);
void dfs(vvl dist, vl r, vl &used, ll prev, ll depth, ll cost, ll &ans){
if(depth == used.size() - 1){
ans = min(ans, cost);
return;
}
rep(i, used.size()){
if(used[i] == 1) continue;
used[i] = 1;
dfs(dist, r, used, i, depth + 1, cost + dist[prev][r[i]], ans);
used[i] = 0;
}
}
int main(){
ll N, M, R;
cin >> N >> M >> R;
vl r(R);
rep(i, R) cin >> r[i];
ll A, B, C;
map<ll, vpll> G;
rep(i, M){
cin >> A >> B >> C;
G[A].push_back({B, C});
G[B].push_back({A, C});
}
vvl dist(R, vl(N + 1, INF));
rep(i, R){
dist[i][0] = 0;
dist[i][r[i]] = 0;
vl vis(N + 1, 0);
priority_queue<pll, vpll, greater<pll>> que;
que.push({0, r[i]});
while(!que.empty()){
pll top = que.top();
que.pop();
if(vis[top.second] == 1) continue;
vis[top.second] = 1;
for(auto x : G[top.second]){
if(dist[i][x.first] > top.first + x.second)
dist[i][x.first] = top.first + x.second;
que.push({dist[i][x.first], x.first});
}
}
}
ll ans = INF;
rep(i, R){
vl used(R, 0);
used[i] = 1;
dfs(dist, r, used, i, 0, 0, ans);
}
cout << ans << endl;
return 0;
} | #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 500000000
#define mod 1000000007
#define INF2 1000000000000000000
int d[210][210];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, R;
cin >> N >> M >> R;
rep(i, N) rep(j, N) d[i][j] = INF;
rep(i, N) d[i][i] = 0;
int r[10];
rep(i, R) cin >> r[i];
rep(i, R) r[i]--;
sort(r, r + R);
rep(i, M) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
d[a][b] = c;
d[b][a] = c;
}
rep(k, N) {
rep(i, N) {
rep(j, N) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
ll ans = INF;
do{
ll tmp = 0;
rep(i, R - 1) {
tmp += d[r[i]][r[i + 1]];
}
ans = min(ans, tmp);
}while(next_permutation(r, r + R));
cout << ans << endl;
return 0;
} | 1 | 12,068,307 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
int X, T; cin >> X >> T;
cout << max(X - T, 0) << endl;
return 0;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll a, b;
cin >> a >> b;
cout << max(a - b, 0LL) << endl;
return 0;
} | 1 | 78,651,340 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string dog;
string pig;
getline(cin, dog);
getline(cin, pig);
string cat = pig.substr(0, pig.size() - 1);
if (dog == cat)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string st1,st2;
cin>>st1>>st2;
int s1=st1.size();
int s2=st2.size();
int c=0;
for(int i=0;i<s2;i++){
if(st1[i]==st2[i]){
c++;
}
else if(st1[i]!=st2[i] && c==s1){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
break;
}
}
} | 1 | 22,656,691 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
int main(){
int X, A; cin>>X>>A;
if(X<A){
cout<<"0"<<endl;
}else{
cout<<"10"<<endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
int a,b;
cin >> a >> b;
if (a >= b)cout << 10 << endl;
else cout << 0 << endl;
} | 1 | 72,411,966 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret.push_back(make_pair(i, tmp));
}
if (n != 1) ret.push_back(make_pair(n, 1));
return ret;
}
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<pair<long long, long long>>f = prime_factor(N);
long long count,sum;
for (auto next : f) {
count = 0;
sum = 0;
while (sum + count < next.second) {
count ++ ;
sum += count;
}
ans += count;
}
cout << ans << endl;
} | #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<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
int main(){
ll n; cin >> n;
ll ans = 0;
const auto &res = prime_factorize(n);
for(auto p: res){
ll e = p.second;
ll tmp = 0, cur = 1;
while(e >= cur) e -= cur++, ++tmp;
ans += tmp;
}
cout << ans << endl;
return 0;
} | 1 | 57,943,301 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
ll M; cin >> M;
vector<ll> D(M), C(M);
for(int i = 0; i < M; ++i) cin >> D[i] >> C[i];
ll ans = 0, cnt = 0;
for(int i = 0; i < M; ++i) {
ans += C[i];
cnt += D[i] * C[i];
}
cout << ans-1 + (cnt-1) / 9;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
ll m; cin >> m;
ll sum=0, dig=0;
REP(i, m){
ll d, c; cin >> d >> c;
sum += d*c; dig += c;
}
cout << (sum-1)/9 + dig-1 << endl;
} | 1 | 35,456,761 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
double pi=acos(-1);
int main(){
double a,b,x;
cin>>a>>b>>x;
x/=a;
if(a*b>=2*x){
double y=2*x/b;
double ans=atan(b/y);
ans=ans*180/pi;
cout<<fixed<<setprecision(10)<<ans<<endl;
}
else{
double y=(2*x-a*b)/a;
double ans=atan((b-y)/a);
ans=ans*180/pi;
cout<<fixed<<setprecision(10)<<ans<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int64_t a, b, x;
double theta1, theta2;
double deg;
cin >>a >>b >>x;
theta1 = atan(2.0*b/a - 2.0*x/a/a/a);
if(b-a*tan(theta1)>=0) deg=theta1*180.0/M_PI;
else{
theta2=atan(a*b*b/2.0/x);
deg=theta2*180.0/M_PI;
}
printf("%2.15f", deg);
return 0;
} | 1 | 95,629,264 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
char ch = 'a';
int charaarray[26] = {};
while(getline(cin,str)){
for ( int i = 0 ; str[i] != '\0' ; i++){
if ( (str[i] >= 'a') && (str[i] <= 'z')){
charaarray[str[i] - 'a']++;
}else if ( (str[i] >= 'A') && (str[i] <= 'Z')){
charaarray[str[i] - 'A']++;
}
}
}
for (int i = 0 ; i < 26 ; i++){
cout << ch++ << " : " << charaarray[i] << endl;
}
} | #include<cstdio>
int main() {
char ch;
int cnt[26] = {};
while (scanf("%c", &ch) != EOF) {
if (ch > 'Z') ch -= ('a' - 'A');
cnt[ch - 'A']++;
}
for (int i = 0; i < 26; i++) printf("%c : %d\n", 'a' + i, cnt[i]);
return 0;
} | 1 | 50,001,562 |
#include <bits/stdc++.h>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T>
void view(T e) { std::cout << e << std::endl; }
template <typename T>
void view(const std::vector<T>& v) {
for (const auto& e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>>& vv) {
for (const auto& v : vv) {
view(v);
}
}
using namespace std;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
int main() {
int N;
cin >> N;
V<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
long long ans = 1000;
for (int i = 0; i < N - 1; ++i) {
if (A[i] < A[i + 1]) {
ans = ans / A[i] * A[i + 1] + ans % A[i];
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define mem(a) memset(a , 0 ,sizeof a)
#define memn(a) memset(a , -1 ,sizeof a)
int main()
{
ll f = 0, n, m = 1000, x, y, i, j, st = 0;
cin >> n;
int a[n + 23];
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
for (i = 2; i <= n; i++)
{
if (a[i] > a[i - 1])
{
if (f == 0)
{
st = m / a[i - 1];
m = m % a[i - 1];
}
f = 1;
} else if (a[i] < a[i - 1])
{
if (f == 1)
{
m += st * a[i-1];
st = 0;
}
f = 0;
}
if (i == n)
{
m += st * a[i];
}
}
cout << m << endl;
} | 1 | 78,306,255 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int main(){
ios::sync_with_stdio(false);
vi len(3);
int a, b;
int n;
cin >> n;
REP(i, n){
cin >> len[0] >> len[1] >> len[2];
VSORT(len);
a = len[0] * len[0] + len[1] * len[1];
b = len[2] * len[2];
if (a == b)
puts("YES");
else
puts("NO");
}
} | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main(){
vector<string> results;
int N = 0;
cin >> N;
for(int i = 0; i < N; i++){
array<int, 3> triangle_vertex;
for(int j = 0; j < 3; j++){
cin >> triangle_vertex[j];
}
sort(begin(triangle_vertex), end(triangle_vertex));
if(pow(triangle_vertex[0], 2) + pow(triangle_vertex[1], 2) == pow(triangle_vertex[2], 2)){
results.push_back("YES");
}
else{
results.push_back("NO");
}
}
for(const auto& result : results){
cout << result << endl;
}
return 0;
} | 1 | 90,148,664 |
#include <algorithm>
#include <cmath>
#include <deque>
#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 (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
int main() {
ll H, W, A, B;
cin >> H >> W >> A >> B;
rep(i, H) {
if (i < B) {
rep(k, A) { cout << 0; }
rep(k, W - A) { cout << 1; }
cout << endl;
} else {
rep(k, A) { cout << 1; }
rep(k, W - A) { cout << 0; }
cout << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; i++) {
if(i < b){
for (int j = 0; j < a; j++) {
printf("0");
}
for (int j = a; j < w; j++) {
printf("1");
}
printf("\n");
}
else{
for (int j = 0; j < a; j++) {
printf("1");
}
for (int j = a; j < w; j++) {
printf("0");
}
printf("\n");
}
}
} | 1 | 1,398,216 |
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
#pragma warning(disable:4996)
typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
ll d[200][200];
void solve()
{
int n, m, R;
scanf("%d%d%d", &n, &m, &R);
vector<int> r(R);
int i, j;
for (i = 0; i < R; i++) {
scanf("%d", &r[i]); r[i]--;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (i != j) d[i][j] = LINF2;
}
}
for (i = 0; i < m; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c); a--; b--;
d[a][b] = MIN(d[a][b], c);
d[b][a] = MIN(d[b][a], c);
}
for(int k = 0; k < n; ++k)
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
ll ans = LINF;
vector<int> v(R);
for (i = 0; i < R; i++) v[i] = i;
do {
ll ans0 = 0;
for (i = 1; i < R; i++) {
ans0 += d[r[v[i - 1]]][r[v[i]]];
}
ans = MIN(ans, ans0);
} while( next_permutation(v.begin(), v.end()) );
printf("%lld\n", ans);
return;
}
int main(int argc, char* argv[])
{
#if 1
solve();
#else
int T;
scanf("%d", &T);
int t;
for(t=0; t<T; t++) {
solve();
}
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main(){
ll N, M, R;
cin >> N >> M >> R;
vector<ll> r(R);
rep(i, R){
cin >> r.at(i);
r.at(i)--;
}
vector<vector<ll>> d(N, vector<ll>(N, INF));
rep(i, N){
d.at(i).at(i) = 0;
}
rep(i, M){
ll A, B, C;
cin >> A >> B >> C;
A--;
B--;
d.at(A).at(B) = C;
d.at(B).at(A) = C;
}
rep(k, N){
rep(i, N){
rep(j, N){
chmin(d.at(i).at(j), d.at(i).at(k) + d.at(k).at(j));
}
}
}
ll ans = INF;
sort(all(r));
do{
ll tmp = 0;
rep(i, R-1){
tmp += d.at(r.at(i)).at(r.at(i+1));
}
chmin(ans, tmp);
} while(next_permutation(all(r)));
cout << ans << endl;
} | 1 | 81,486,202 |
#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 rall(x) (x).rbegin(), (x).rend()
#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()
{
ll N;
cin >> N;
rep(i, 0, 1000) {
rep(j, 0, 1000) {
if (i*4 + j*7 == N) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
bool f = false;
for(int i = 0; i <= n/7; i++){
for(int j = 0; j <= n/4; j++){
if(7*i + 4*j == n) f = true;
}
}
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 87,016,745 |
#include <iostream>
#include <algorithm>
#include <string>
#define ll long long
using namespace std;
int main(){
ll n;
cin>>n;
ll total=0;
ll price[1001];
ll p;
cin>>p;
for (ll i = 0; i <n ; ++i) {
cin>>price[i];
}
sort(price,price+n);
for (int j = 0; j <p ; ++j) {
total+=price[j];
}
cout<<total<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(all(p));
int ans = 0;
for (int i = 0; i < k; ++i) {
ans += p[i];
}
cout << ans << "\n";
return 0;
} | 1 | 56,213,998 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forenska(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sqr(x) ((x)*(x))
#define lowbit(x) ((x)&(-x))
#define GREATER(x) x,vector<x>,greater<x>
#define randIn(L,R) (((LL)rand()*rand())%(R-L)+L)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pLL;
typedef vector<int> vec;
typedef vector<LL> vecL;
typedef vector<pii> vecP;
typedef vector<pLL> vecPL;
typedef vector<string> vecS;
typedef vector<vec> mat;
typedef complex<double> point;
const long double PI=3.14159265358979323846264338327950;
const LL INFLL=0x3f3f3f3f3f3f3f3f;
const int INF=0x3f3f3f3f;
const long double EPS=1e-10;
int read()
{
int x=0;
char ch=' ';
bool flag=false;
while(ch<'0' || ch>'9')
{
if(ch=='-')flag=true;
ch=getchar();
}
while(ch>='0' && ch<='9')
{
x=(x<<3)+(x<<1)+ch-'0';
ch=getchar();
}
return flag?-x:x;
}
int lcm(int a,int b)
{
return a/__gcd(a,b)*b;
}
int main()
{
puts(abs(read()-read())<=1?"Brown":"Alice");
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll x, y;
cin >> x >> y;
if (abs(x-y) <= 1) cout << "Brown" << endl;
else cout << "Alice" << endl;
return 0;
} | 1 | 40,242,143 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char A,B;
cin>>A>>B;
if(A==B)
cout<<'='<<endl;
else if(A<B)
cout<<'<'<<endl;
else
cout<<'>'<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
char a,b;
cin >> a >> b;
if (a < b)
cout << "<";
else if (a > b)
cout << ">";
else if (a == b)
cout << "=";
} | 1 | 95,242,935 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
int a[110];
for (int i = 0; i < N; i++) cin >> a[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int num = 0;
for (int j = 0; j < N; j++) {
num = abs(a[i] - a[j]);
ans = max(ans, num);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using ll = long long int;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
ll n = 0;
std::cin >> n;
ll val = 0;
std::cin >> val; n--;
ll min = val;
ll max = val;
while (n--) {
std::cin >> val;
min = std::min(val, min);
max = std::max(val, max);
}
std::cout << max - min << std::endl;
return 0;
} | 1 | 73,788,308 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
cout << (M * 1900 + (N - M) * 100) * pow(2, M) << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
unsigned gcd(unsigned a, unsigned b) {
if(a < b) return gcd(b, a);
unsigned r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int main(){
int N, M;
cin >> N >> M;
print((M * 1900 + 100 * (N - M)) * pow(2,M));
} | 1 | 24,719,322 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(y>=x*2 && y<=x*4)
{
y-=x*2;
if(y%2==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int x,y,flag=0;
cin >> x >> y;
rep(i,x+1){
if(i*2+(x-i)*4==y) flag = 1;
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 16,320,516 |
#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);
cout << fixed << setprecision(12);
int S;
cin >> S;
const long long MOD = 1000000007;
vector<long long> dp(S + 1, 0);
dp[0] = 1;
for (int i = 0; i < S; ++i) {
for (int j = S - i; j >= 3; --j) {
(dp[j + i] += dp[i]) %= MOD;
}
}
cout << dp[S] << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimize ("03")
#define ll long long
#define pb push_back
#define nl '\n'
#define popb pop_back()
#define sz size()
#define inf 1000000000
#define ld long double
#define ull unsigned long long
#define F first
#define S second
#define fix fixed<<setprecision
#define pii pair<int,int>
#define E exit(0)
ll dp[2001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
cin>>s;
dp[0]=1;
for (int i=1;i<=s;i++) {
for (int j=3;i-j>=0;j++) {
dp[i]+=dp[i-j];
}
dp[i]%=(inf+7);
}
cout<<dp[s]%(inf+7);
} | 1 | 73,771,476 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string O,E;
cin>>O>>E;
string ans="";
if(O.size()>E.size()){
rep(i,E.size()){
ans=ans+O.at(i);
ans=ans+E.at(i);
}
ans=ans+O.at(O.size()-1);
}else{
rep(i,E.size()){
ans=ans+O.at(i);
ans=ans+E.at(i);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string O, E;
cin >> O >> E;
int j=0;
int k=0;
for(int i=0; i<O.size()+E.size(); i++){
if((i+1)%2==0){
cout << E[j];
j++;
}else{
cout << O[k];
k++;
}
}
return 0;
} | 1 | 22,390,288 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int H, W;
char c[110][110];
char c2[210][110];
cin >> H >> W;
for(int i = 1; i <= H; i++){
for (int j = 1; j <= W; j++){
cin >> c[i][j];
}
}
for(int i = 1; i <= 2*H; i++){
for(int j = 1; j <= W; j++){
c2[i][j] = c[(i+1)/2][j];
cout << c2[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vd = vector <double>;
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end())
#define sortm(d) sort(d.rbegin(),d.rend())
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
int wa(ll x)
{
ll sum = 0;
while(x!=0){
sum += x% 10;
x /= 10;
}
return sum;
}
ll p=0,q=0,r=0;
int main()
{
ll h,w;
cin>>h>>w;
vvc c(h,vc(w));
rep(i,h)
{
rep(j,w)
{
cin>>c[i][j];
}
}
rep(i,2*h)
{
rep(j,w)
{
cout<<c[(i+2)/2-1][j];
if(j==w-1)cout<<endl;
}
}
} | 1 | 68,981,783 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
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;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
map<int,int> mp;
void factorize(ll n){
map<ll,ll> ret;
ll x = n;
for(ll i = 2; i*i<=n;i++){
while(x % i == 0){
mp[i]++;
x /= i;
}
}
if(x != 1)mp[x]++;
return;
}
vl a;
ll dfs(int idx,int num){
if(idx == a.size()){
if(num == 1)return 1;
else return 0;
}
ll res = 0;
for(int i=1;i<=a[idx];i++){
if(num % i == 0)res += dfs(idx+1,num/i);
}
return res;
}
signed main()
{
gearup;
ll n; cin >> n;
for(int i = 2;i<=n;i++)factorize(i);
for(auto m:mp)a.push_back(m.second+1);
ll res = dfs(0,75);
out(res);
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, n) for(int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define srep(i, from, to) for(int i = from; i < (int)(to); i++)
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
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;
}
vector<pair<ll, int>> primefactors(ll n) {
vector<pair<ll, int>> res;
int sq = sqrt(n);
for(int x = 2; x <= sq; x++) {
int cnt = 0;
while(n % x == 0) {
cnt++;
n /= x;
}
res.push_back(make_pair(x, cnt));
}
if(n > 1) res.push_back(make_pair(n, 1));
return res;
}
ll pfcount[100];
int main() {
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
vector<pair<ll, int>> res = primefactors(i);
for(auto pf : res) {
pfcount[pf.first] += pf.second;
}
}
ll ans = 0;
for(int i = 1; i < 100; i++) {
if(pfcount[i] < 2) continue;
for(int j = 1; j < 100; j++) {
if(pfcount[j] < 4) continue;
for(int k = 1; k < 100; k++) {
if(i == j || i == k || j == k) continue;
if(k > j) continue;
if(pfcount[k] < 4) continue;
ans++;
}
}
}
for(int i = 1; i < 100; i++) {
if(pfcount[i] < 2) continue;
for(int j = 1; j < 100; j++) {
if(i == j) continue;
if(pfcount[j] < 24) continue;
ans++;
}
}
for(int i = 1; i < 100; i++) {
if(pfcount[i] < 4) continue;
for(int j = 1; j < 100; j++) {
if(i == j) continue;
if(pfcount[j] < 14) continue;
ans++;
}
}
for(int i = 1; i < 100; i++) {
if(pfcount[i] < 74) continue;
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 26,462,665 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N,H,W;
cin>>N>>H>>W;
vector<long> a(N);
vector<long> b(N);
for(int i=0;i<N;i++) cin>>a[i]>>b[i];
long ans=0;
for(int i=0;i<N;i++){
if(a[i]>=H&&b[i]>=W) ans++;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
long long N,H,W;
cin>>N>>H>>W;
vector<long long> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
long long ans=0;
for(int i=0;i<N;i++){
if(A[i]>=H&&B[i]>=W) ans++;
}
cout<<ans<<endl;
return 0;
} | 1 | 71,931,299 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
typedef long long ll;
const int INF = 1e9+1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main(){
int n;
int sum=0;
cin >> n;
vector<int> a(n+2);
a.at(0) = 0;
for (int i = 1; i <= n; i++) {
cin >> a.at(i);
sum += abs(a.at(i) - a.at(i - 1));
}
sum += abs(a.at(n));
for (int i = 1; i <= n; i++) {
int nsum = sum;
nsum -= abs(a.at(i) - a.at(i - 1));
nsum -= abs(a.at(i + 1) - a.at(i));
nsum += abs(a.at(i + 1) - a.at(i - 1));
cout << nsum << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[100005];
signed main()
{
cin>>n;
n+=2;
for (int i=2;i<=n-1;i++) cin>>a[i];
for (int i=1;i<=n-1;i++) ans+=abs(a[i+1]-a[i]);
for (int i=2;i<=n-1;i++) cout<<ans-abs(a[i]-a[i-1])-abs(a[i+1]-a[i])+abs(a[i+1]-a[i-1])<<endl;
return 0;
} | 1 | 79,240,490 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
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;}
const ll MOD = 1000000007;
const int INF = 1<<30;
int main(){
int N; cin >> N;
vector<int> a = {1};
int tmp = 6;
for (int i = 1; i <= 7; ++i) {
a.push_back(tmp);
tmp *= 6;
}
tmp = 9;
for (int i = 1; i<= 6; ++i){
a.push_back(tmp);
tmp *= 9;
}
sort(a.begin(), a.end());
vector<int> dp(N + 1, INF);
dp[0] = 0;
for (int i = 0; i < N; ++i){
for (int j = 0; j < (int)a.size(); ++j){
if (i + a[j] <= N) dp[i + a[j]] = min(dp[i + a[j]], dp[i] + 1);
}
}
cout << dp[N] << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
const int INF = 1e9;
int dp[100010];
int main(){
int n;
cin >> n;
rep(i,n+1) dp[i] = INF;
dp[0] = 0;
queue<int> q;
q.push(0);
while(!q.empty()){
int now = q.front();q.pop();
for (int pow6 = 1; pow6 + now <= n; pow6*=6){
if(dp[pow6 + now] == INF) {
q.push(pow6+now);
dp[pow6 + now] = dp[now] + 1;
}
}
for (int pow9 = 1; pow9 + now <= n; pow9*=9){
if (dp[pow9 + now] == INF){
q.push(pow9+now);
dp[pow9 + now] = dp[now] + 1;
}
}
}
cout << dp[n] << endl;
return 0;
} | 1 | 70,248,326 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s,t;
cin>>s>>t;
long long int cnt=0;
for(unsigned int i=0;i<s.size();i++){
if(s.at(i)!=t.at(i))
cnt++;
}
cout<<cnt;
} | #include <iostream>
#include <string>
int main() {
std::string S, T; std::cin >> S >> T;
int ans = 0;
for (int i = 0; i < S.size(); ++i)
if (S[i] != T[i])
ans++;
std::cout << ans << "\n";
return 0;
} | 1 | 7,220,208 |
#include<stdio.h>
int main (){
int i,j,a,b;
scanf("%d%d",&i,&j);
if(i>j){
printf("a > b\n");
}
else if(i<j){
printf("a < b\n");
}
else{
printf("a == b\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a;
int b;
cin >> a >> b;
string symbol;
if (a < b) {
symbol = " < ";
} else if (a > b) {
symbol = " > ";
} else {
symbol = " == ";
}
cout << 'a' << symbol << 'b' << endl;
} | 1 | 52,565,411 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
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; }
ll MOD = 1e9 + 7;
ll devc(ll x, ll y) { return 1 + (x - 1) / y; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll N;
cin >> N;
vec A(N);
map<ll, ll> X;
rep(i, N) cin >> A[i], ++X[A[i]], X[A[i]] %= 2;
ll ct0 = 0, ct1 = 0;
for(auto x : X){
if(x.second == 0) ++ct0;
else ++ct1;
}
ll ans = ct0 + ct1 - ct0 % 2;
print(ans);
return 0;
} | #include <iostream>
#include <string>
#include <cctype>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <vector>
#define REP(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int n, cnt=0; cin >> n;
int num[100000] = {0};
REP(i, n){
int a; cin >> a;
num[a-1]++;
}
REP(i, 100000){
if(num[i]) cnt++;
}
cout << (cnt%2 ? cnt : cnt-1) << endl;
return 0;
} | 1 | 44,868,672 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
double res = 0;
rep(i,n) {
double m;
string s;
cin >> m >> s;
if (s == "JPY") res += m;
if (s == "BTC") res += m * 380000;
}
cout << fixed << setprecision(10);
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<double> x(N);
vector<string> u(N);
for(int i=0;i<N;i++){
cin>>x[i]>>u[i];
}
double ans=0.0;
for(int i=0;i<N;i++){
if(u[i]=="JPY") ans+=x[i];
if(u[i]=="BTC") ans+=x[i]*380000.0;
}
cout<<fixed;
cout<<setprecision(6)<<ans<<endl;
return 0;
} | 1 | 100,843,268 |
#include<iostream>
using namespace std;
int main(){
int H,N;
cin >> H >> N;
int A[N+1], B[N+1];
int i,j;
for(i=1; i<=N; i++){
cin >> A[i] >> B[i];
}
int dp[N+1][H+1];
for(i=0; i<=N; i++){
dp[i][0] = 0;
}
for(j=1; j<=H; j++){
dp[1][j] = (j/A[1] + (j%A[1]>0))*B[1];
}
for(i=2; i<=N; i++){
for(j=1; j<=H; j++){
if(j-A[i]<0){
dp[i][j] = min(dp[i-1][j],B[i]);
}else{
dp[i][j] = min(dp[i-1][j],dp[i][j-A[i]]+B[i]);
}
}
}
cout << dp[N][H] << endl;
system("pause");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF=1e18;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b){ a = b; return 1; } return 0; }
int main(int argc, char const *argv[]) {
int n,h;
cin >> h >> n;
vector<int> a(n),b(n);
vector<vector<ll>> dp(n+1,vector<ll>(h+1,INF));
dp[0][0]=0;
rep(i,n){
cin >> a[i] >> b[i];
}
rep(i,n){
for(int j=0; j<=h; j++){
chmin(dp[i+1][j], dp[i][j]);
chmin(dp[i+1][min(j+a[i], h)], dp[i+1][j] + b[i]);
}
}
cout << dp[n][h] << endl;
return 0;
} | 1 | 80,464,554 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
char s[N];
int t[N];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
t[i] = s[i] == 'B' ? 1 : 0;
if (i % 2 == 0) t[i] ^= 1;
}
int cnt = 0;
for (int i = 0; i < 2 * n; i++)
cnt += t[i];
if (cnt != n) {
puts("0");
return 0;
}
int ans = 1, temp = 0;
for (int i = 0; i < 2 * n; i++) {
if (t[i] == 0) {
temp++;
} else {
ans = 1LL * ans * temp % MOD;
temp--;
}
if (i < n) ans = 1LL * (i + 1) * ans % MOD;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod=1000000007;
int main(int argc, char const *argv[])
{
int n;
string s;
cin>>n>>s;
if (s.at(0)=='W')
{
cout<<"0\n";
return 0;
}
string memo="A";
for (int i = 1; i < 2*n; ++i)
{
if (s.at(i-1)==s.at(i))
{
if (memo.at(i-1)=='A')
{
memo+="B";
}
else
{
memo+="A";
}
}
else
{
if (memo.at(i-1)=='A')
{
memo+="A";
}
else
{
memo+="B";
}
}
}
long long ans=1LL,cnt=0LL;
for (int i = 0; i < 2*n; ++i)
{
if (memo.at(i)=='A')
{
++cnt;
}
else
{
ans*=cnt;
ans%=mod;
--cnt;
}
}
if (cnt>0LL)
{
cout<<"0\n";
}
else
{
for (int i = 1; i <= n; ++i)
{
ans*=(long long)i;
ans%=mod;
}
cout<<ans<<endl;
}
return 0;
} | 1 | 2,956,894 |
#include<set>
#include<map>
#include<stack>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstring>
#include<climits>
#include<cstdlib>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
#define ULL unsigned long long
LL read(){
LL f=1,x=0;char c=getchar();
while(c<'0'||'9'<c){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
return f*x;
}
#define MAXN 200005
#define INF 0x3f3f3f3f
int main(){
LL X=read(),Y=read();
puts(fabs(X-Y)>1?"Alice":"Brown");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>x>>y;
if(abs(x-y)<=1)
cout<<"Brown"<<endl;
else
cout<<"Alice"<<endl;
return 0;
} | 1 | 4,517,348 |
#include<bits/stdc++.h>
#define ll long long
#define P pair<int,int>
#define PP pair<P,int>
using namespace std;
int inf = 1ll<<30;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int h,w;
cin >> h >> w;
char g[1005][1005];
queue<PP>que;
for(int i=0;i<h;i++)for(int j=0;j<w;j++) {
cin >> g[i][j];
if(g[i][j] == '#') que.push(PP{P{i, j}, 0});
}
int ans;
while(!que.empty()){
PP p = que.front(); que.pop();
ans = p.second;
for(int i=0;i<4;i++){
int nx = p.first.first + dx[i];
int ny = p.first.second + dy[i];
if(!(0 <= nx && 0 <= ny && h > nx && w > ny)) continue;
if(g[nx][ny] == '#') continue;
g[nx][ny] = '#';
que.push(PP{P{nx, ny}, ans + 1});
}
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
int gcd(int x,int y){
if(y==0) return x;
return gcd(y,x%y);
}
int dis2(int x1,int y1,int x2,int y2){
return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
int main(){
int h,w;cin>>h>>w;
vector<string> a(h);
for(int i=0;i<h;i++) cin>>a[i];
vector<vector<int> > d(h,vector<int>(w,INF));
queue<ii> que;
int ans=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#'){
que.push(make_pair(i,j));
d[i][j]=0;
}
}
}
while(!que.empty()){
ii p=que.front();que.pop();
int y=p.first,x=p.second;
for(int i=0;i<4;i++){
int ny=y+dy[i],nx=x+dx[i];
if(ny>=0&&ny<h&&nx>=0&&nx<w&&a[ny][nx]=='.'&&d[ny][nx]==INF){
d[ny][nx]=d[y][x]+1;
que.push(make_pair(ny,nx));
ans=max(ans,d[ny][nx]);
}
}
}
cout<<ans<<endl;
return 0;
} | 1 | 57,243,733 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s,t,u; cin>>s>>t>>u;
s[0]=char(s[0]-32);
cout<<s[0];
t[0]=char(t[0]-32);
cout<<t[0];
u[0]=char(u[0]-32);
cout<<u[0]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(2);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
#define N 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 2 * 1e18;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
vll adj[MAX5]; ll visit[] = {};
ll T = 1;
ll n, x, y, q, m;
string s, t, d;
ll sum = 0;
ll cou = 0;
void MAIN() {
string s1,s2,s3;
cin>>s1>>s2>>s3;
cout<<(char)(s1[0]-'a'+'A');
cout<<(char)(s2[0]-'a'+'A');
cout<<(char)(s3[0]-'a'+'A');
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
} | 1 | 76,342,149 |
#include <bits/stdc++.h>
using namespace std;
char dat[100005];
bool zz[100005];
int main()
{
int n;
scanf("%d%s",&n,&dat);
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
zz[0]=i;
zz[1]=j;
for(int k=1;k<n-1;k++)
{
zz[k+1]=zz[k-1]^zz[k]^(dat[k]=='x');
}
if((dat[n-1]=='x')==(zz[n-2]^zz[n-1]^zz[0]) && (dat[0]=='x')==(zz[n-1]^zz[0]^zz[1]))
{
for(int k=0;k<n;k++) printf("%c",zz[k]?'W':'S');
printf("\n");
return 0;
}
}
}
printf("-1\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
int main() {
int N;
string s;
cin >> N >> s;
rep(p, 2) {
rep(q, 2) {
V<int> state(N);
state[0] = p, state[1] = q;
for (int i = 2; i < N; ++i) {
state[i] = (s[i - 1] == 'x') ^ state[i - 1] ^ state[i - 2];
}
bool ok = 1;
if ((s[0] == 'x') != (state[0] ^ state[1] ^ state[N - 1])) {
ok = 0;
}
if ((s[N - 1] == 'x') != (state[N - 1] ^ state[N - 2] ^ state[0])) {
ok = 0;
}
if (ok) {
rep(i, N) printf("%c", state[i] ? 'W' : 'S');
puts("");
return 0;
}
}
}
puts("-1");
return 0;
} | 1 | 95,976,806 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD = 1e9+7;
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;}
map<int, int> mp;
int n;
int ask(int i) {
i %= n;
if (mp.count(i)) return mp[i];
cout << i << endl;
string s;
cin >> s;
if (s[0] == 'V') exit(0);
return mp[i] = (s[0] == 'M');
}
int g(int i, int j) { return (j-i+n)%n;}
int main() {
cin >> n;
int l = 0, r = n/2;
int a = ask(l);
int b = ask(r);
if ((a^b) == g(l,r)%2) {
swap(l,r); r += n;
}
while (1) {
int c = (l+r)>>1;
if ((ask(l)^ask(c)) == g(l,c)%2) l = c;
else r = c;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string ans, newans;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << "0\n";
cout.flush();
cin >> ans;
if(ans == "Vacant"){
cout << "0\n";
cout.flush();
cin >> ans;
exit(0);
}
int pos = 0;
for(int i = 17; i >= 0; i--){
if(pos + (1 << i) < n){
cout << pos + (1 << i) << "\n";
cout.flush();
cin >> newans;
if(newans == "Vacant"){
cout << pos + (1 << i) << "\n";
cout.flush();
cin >> newans;
exit(0);
}
if(ans == newans)
pos += (1 << i);
}
}
cout << pos + 1 << "\n";
cout.flush();
cin >> newans;
exit(0);
} | 1 | 60,597,147 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<61;
const ll mod=1e9+7;
int main(){
int i,j;
int n;
cin>>n;
int m=1<<n;
int a[m];
for(i=0;i<m;i++){
cin>>a[i];
}
int ans=-1;
for(i=1;i<m;i++){
int m1=-1,m2=-1;
int sub=i;
do{
if(m1<=a[sub]){
m2=m1;
m1=a[sub];
}
else if(m2<=a[sub]) m2=a[sub];
sub=(sub-1)&i;
} while(sub!=i);
if(m1>=0&&m2>=0){
ans=max(ans,m1+m2);
}
cout<<ans<<endl;
}
} | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
long long Comb(int a,int b){
if(a<b||b<0)return 0;
return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
void init_C(int n){
fact[0]=finv[0]=inv[1]=1;
for(int i=2;i<n;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<n;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
long long pw(long long a,long long b){
if(a<0LL)return 0;
long long ret=1;
while(b){
if(b%2)ret=ret*a%mod;
a=a*a%mod;
b/=2;
}
return ret;
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int p[1100000];
pair<int,int>dp[1100000];
int main(){
int a;scanf("%d",&a);
for(int i=0;i<(1<<a);i++){
scanf("%d",p+i);
}
int n=(1<<a);
for(int i=0;i<n;i++){
dp[i]=make_pair(p[i],-1);
}
for(int i=0;i<a;i++){
for(int j=0;j<n;j++){
if(j&(1<<i)){
pair<int,int>tmp=dp[j-(1<<i)];
if(tmp.first>dp[j].first){
dp[j].second=dp[j].first;dp[j].first=tmp.first;
}else if(tmp.first>dp[j].second){
dp[j].second=tmp.first;
}
if(tmp.second>dp[j].first){
dp[j].second=dp[j].first;dp[j].first=tmp.second;
}else if(tmp.second>dp[j].second){
dp[j].second=tmp.second;
}
}
}
}
int ret=0;
for(int i=1;i<n;i++){
ret=max(ret,dp[i].first+dp[i].second);
printf("%d\n",ret);
}
} | 1 | 37,078,102 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" ";
#define LOGE if(DEBUG)cout<<endl;
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 func(long long M, std::vector<long long> d, std::vector<long long> c){
lli ans = 0;
lli sum = 0;
REP(i,0,M){
ans += c[i];
sum += c[i]*d[i];
}
cout<<(ans-1)+(sum-1)/9<<endl;
}
int main(){
long long M;
scanf("%lld",&M);
std::vector<long long> d(M);
std::vector<long long> c(M);
for(int i = 0 ; i < M ; i++){
scanf("%lld",&d[i]);
scanf("%lld",&c[i]);
}
func(M, std::move(d), std::move(c));
return 0;
} | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e16;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 2510;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll m,d,c,sum = 0,keta = 0;
cin >> m;
rep(i,m){
cin >> d >> c;
sum += d*c;
keta += c;
}
if (sum%9== 0) sum = sum/9-1;
else sum = sum/9;
PRINT(sum+keta-1);
} | 1 | 63,263,102 |
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <stdio.h>
int main(void){
int h1,m1,h2,m2,t,k;
std::cin >>h1>>m1>>h2>>m2>>k;
t=(h2-h1)*60+(m2-m1);
if(t==k){
std::cout << "0";
}else{
std::cout << t-k;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h1, h2, m1, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int min = (60 - m1) + (h2 - h1 - 1) * 60 + m2;
cout << min - k << endl;
} | 1 | 81,024,826 |