code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m; cin >> n >> m;
priority_queue<long long, vector<long long>, less<long long>> a;
for(long long i=0;i<n;i++){
long long x; cin >> x;
a.push(x);
}
for(long long i=0;i<m;i++){
long long x=a.top();
a.pop();
a.push(x/2);
}
long long ans=0;
while(!a.empty()){
ans+=a.top();
a.pop();
}
cout << ans;
}
|
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
typedef priority_queue<int>piwi;
typedef queue<int>kiwi;
typedef map<int,int>mi;
typedef map<string,int>mis;
typedef multimap<int,int>muli;
typedef multimap<string,int>muls;
typedef multiset<int>si;
#define endl "\n"
#define Y cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define sp " "
#define PB push_back
#define F first
#define S second
#define as(a) (a).begin(),(a).end()
#define ras(a) (a).rbegin(),(a).rend()
#define sz(x) (int)x.size()
#define ki 1LL
#define MOD 1000000007
#define over return 0;
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define test int t;cin>>t;while(t--)
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
const long long MAX_SIZE = 1000001; vector<long long >isprime(MAX_SIZE , true); vector<long long >prime; vector<long long >SPF(MAX_SIZE); void manipulated_seive(int N) { isprime[0] = isprime[1] = false ; for (long long int i=2; i<N ; i++) { if (isprime[i]) { prime.push_back(i); SPF[i] = i; } for(int j=0;j < (int)prime.size() && i*prime[j] < N && prime[j] <= SPF[i]; j++) { isprime[i*prime[j]]=false; SPF[i*prime[j]] = prime[j] ; } } }
int man_seive(int n){ manipulated_seive(n); for(int i=0;i<prime.size() && prime[i]<=n;i++)
cout<<prime[i]<<endl;
}
ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }
ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }
int main(){
optimize();
vii v;
int n;
cin>>n;
for(int i=1;i<=n;i++){
int a;cin>>a;
v.PB({a,i});
}
sort(v.begin(),v.end());
for(auto e: v){
cout<<e.second<<" ";
}
cout<<endl;
over
}
| 0
| 91,638,725
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 243000000000000001
#define minf -243000000000000001
signed main(){
int n;
cin>>n;
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
ans[0]=0;
ans[1]=abs(v[1]-v[0]);
for(int i=2;i<=n-1;i++){
ans[i]=min(ans[i-2]+abs(v[i-2]-v[i]),ans[i-1]+abs(v[i-1]-v[i]));
}
puts(ans[n-1]);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
#define INF 800000000
#define MAX 1000
int main(){
string s;
cin>>s;
int n=s.size();
bool flag=true;
int count=0;
int left=0;
int right=n-1;
while(left<=right){
if(s.at(left)==s.at(right)){
left++;
right--;
}else if(s.at(left)=='x'){
count++;
left++;
}else if(s.at(right)=='x'){
count++;
right--;
}else{
flag=false;
break;
}
}
if(flag){
cout<<count<<endl;
}else{
cout<<-1<<endl;
}
}
| 0
| 33,228,426
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int a[200010];
rep(i, N) cin >> a[i];
int ans = N;
int search = 1;
rep(i, N) {
if(a[i] == search) {
ans--;
search++;
}
}
if(ans == N) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
const int maxn=1000005;
int head[maxn],t[maxn<<1],ne[maxn<<1],num,n;
inline void addedge(int x,int y){
ne[++num]=head[x];head[x]=num;t[num]=y;
ne[++num]=head[y];head[y]=num;t[num]=x;
}
int sg[maxn];
inline void dfs(int x,int f){
forE(i,x)if(t[i]!=f){
dfs(t[i],x);
sg[x]^=sg[t[i]]+1;
}
}
int main(){
read(n);
rep(i,1,n)head[i]=-1;
rep(i,1,n-1){
int x,y;read(x);read(y);
addedge(x,y);
}
dfs(1,-1);
puts(sg[1]?"Alice":"Bob");
return 0;
}
| 0
| 10,109,274
|
#include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repf(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define repv(x, arr) for (auto &x : arr)
#define all(v) (v).begin(), (v).end()
#define vec(name, num) vector<ll> name((num), 0);
#define mp(a, b) make_pair(a, b)
#define op(i) cout << (i) << endl;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
const ll mod = 1e9 + 7;
const ll infl = 1e17;
typedef unsigned long long ull;
int main()
{
ll n, m;
cin >> n >> m;
if (m == 0)
{
cout << "Yes" << endl;
return 0;
}
map<ll, set<pll>> branch;
ll l, r, d;
set<ll> point;
rep(i, m)
{
cin >> l >> r >> d;
branch[l - 1].insert(mp(r - 1, d));
branch[r - 1].insert(mp(l - 1, -d));
point.insert(l - 1);
point.insert(r - 1);
}
vector<ll> X(n, -infl);
queue<ll> check;
vector<bool> visited(n, false);
for (auto x:point){
if (X[x]!=-infl)
continue;
X[x] = 0;
queue<ll> check;
check.push(x);
while (!(check.empty()))
{
ll now = check.front();
check.pop();
visited[now] = true;
for (auto p : branch[now])
{
ll nex = p.F;
ll d = p.S;
if (X[nex] == -infl)
{
X[nex] = X[now] + d;
check.push(nex);
}
else if (X[nex] != X[now] + d)
{
cout << "No" << endl;
return 0;
}
}
}}
ll MIN = infl, MAX = -infl;
rep(i, n)
{
if (X[i] > -infl)
{
MIN = min(MIN, X[i]);
MAX = max(MAX, X[i]);
}
}
if (MAX - MIN <= 1e9)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>
#include<utility>
#include<cctype>
#include<climits>
#include<map>
#include<queue>
#include<functional>
#include<stack>
#include<iomanip>
#include<sstream>
#include<bitset>
using namespace std;
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPL(i,a,n) for(ll i=a;i<n;++i)
#define RUP(a,b) ((a+b-1)/(b))
#define ENT "\n"
#define SORTVG(v) sort(v.begin(),v.end(),greater<>())
#define SORTV(v) sort(v.begin(),v.end())
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
#define INF LLONG_MAX/2
typedef long long ll;
typedef tuple<int,int,bool> Tb;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> void chmax(T& a, T b) {if(a < b){a=b;}}
template<class T> void chmin(T& a, T b) {if(a > b){a=b;}}
template<class T> void YesNo(T& a) {if(a){cout << "Yes" << ENT;}else{cout << "No" << ENT;}}
template<class T> void YESNO(T& a) {if(a){cout << "YES" << ENT;}else{cout << "NO" << ENT;}}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
long long COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int atcoder(){
ll n;
cin>>n;
vector<ll> x(n+1),y;
map<ll,ll> mp;
REP(i,0,n+1){
cin>>x[i];
mp[x[i]]++;
}
COMinit();
ll check;
for(auto x : mp){
if(x.second==2) check=x.first;
}
REP(i,0,n+1) if(x[i]==check) y.push_back(i);
ll r=n+y[0]-y[1];
REP(i,0,n+1){
if(i>r) cout<<COM(n+1,i+1)<<ENT;
else{
if(COM(n+1,i+1)-COM(r,i)<0) cout<< COM(n+1,i+1)-COM(r,i)+MOD <<ENT;
else cout<< COM(n+1,i+1)-COM(r,i) <<ENT;
}
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| 0
| 64,755,978
|
#include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
int main(){
int N; cin >> N;
int ans = 0;
int num_A = 0;
int num_B = 0;
int num_AB = 0;
rep(i, N){
string s; cin >> s;
rep(j, s.size()-1){
if (s[j] == 'A' && s[j+1] == 'B')ans++;
}
if (s[0] == 'B' && s[s.size()-1] != 'A') num_B++;
if (s[s.size()-1] == 'A' && s[0] != 'B') num_A++;
if (s[0] == 'B' && s[s.size()-1] == 'A') num_AB++;
}
int add;
if (num_AB == 0) add = min(num_A, num_B);
else if (num_A + num_B > 0) add = num_AB + min(num_A, num_B);
else if (num_A + num_B == 0) add = num_AB - 1;
cout << ans + add << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long;
using namespace std;
const ll mod = 1000000007;
template <class Abel> struct BIT2D {
int H, W;
vector<vector<Abel>> data;
Abel UNITY = 0;
BIT2D(int H_, int W_) { init(H_, W_); }
void init(int H_, int W_) {
H = H_ + 1; W = W_ + 1;
data.assign(H, vector<Abel>(W, UNITY));
}
void add(int h, int w, Abel x) {
for (int i = h; i < H; i += i & -i) {
for (int j = w; j < W; j += j & -j) {
data[i][j] += x;
data[i][j] %= mod;
}
}
}
Abel sum(int h, int w) {
Abel res = UNITY;
for (int i = h; i > 0; i -= i & -i) {
for (int j = w; j > 0; j -= j & -j) {
res += data[i][j];
res %= mod;
}
}
return res;
}
};
int main(){
int n, m; cin >> n >> m;
vector<int> s(n); rep(i,n) cin >> s[i];
vector<int> t(m); rep(i,m) cin >> t[i];
BIT2D<ll> dp(n,m);
rep(i,n) rep(j,m) if(s[i] == t[j]) dp.add(i+1,j+1,dp.sum(i,j)+1);
cout << dp.sum(n,m) + 1 << endl;
return 0;
}
| 0
| 12,466,696
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5;
int mod[N+100],cnt[10010];
char str[N+100];
ll ans;
int main()
{
int n,p;
scanf("%d%d%s",&n,&p,str);
if(p==2){
for(int i=n-1;i>=0;i--){
if(((str[i]-'0')&1)==0){
ans += (i+1);
}
}
}
else if(p==5){
for(int i=n-1;i>=0;i--){
if((str[i]-'0')==0||(str[i]-'0')==5){
ans += (i+1);
}
}
}
else{
mod[0] = 1;
for(int i=1;i<=N;i++){
mod[i] = (mod[i-1]*10)%p;
}
int cur = 0;
cnt[0] = 1;
for(int i=n-1;i>=0;i--){
int t1 = (mod[n-1-i]*(str[i]-'0'))%p;
cur = (cur+t1)%p;
ans += cnt[cur];
cnt[cur]++;
}
}
printf("%lld\n",ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A, B, M;
vector<ll> a;
vector<ll> b;
ll min_a = 1000000;
ll min_b = 1000000;
cin >> A >> B >> M;
for (int i = 0; i < A; ++i)
{
ll temp;
cin >> temp;
a.push_back(temp);
min_a = min(min_a, temp);
}
for (int i = 0; i < B; ++i)
{
ll temp;
cin >> temp;
b.push_back(temp);
min_b = min(min_b, temp);
}
ll x, y, c;
ll ans = 300000;
for (int i = 0; i < M; ++i)
{
cin >> x >> y >> c;
ll temp = a[x - 1] + b[y - 1] - c;
ans = min(temp, ans);
}
cout << min(ans, min_a + min_b) << endl;
}
| 0
| 77,720,823
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<int> data;
int a,b,c;
cin>>a>>b;
for(int i=0;i<a;i++){
cin>>c;
data.push_back(c);
}
c=0;
sort(data.begin(),data.end());
a=data.size();
for(int i=data.size()-1;i>a-b-1;i--){
c+=data[i];
}
cout<<c<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int v[1100000];
int main(){cout<<fixed<<setprecision(10);
int n;
cin>>n;
map<int,int> a;
rep(i,0,n){
int k;
cin>>k;
a[k]++;
}
int ans=0;
for(auto f:a){
int b=f.first;
if(v[b])continue;
int c=b;
if(f.second==1)ans++;
while(b<1100000){
v[b]=1;
b+=c;
}
}
cout<<ans<<endl;
}
| 0
| 35,807,324
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<vector<ll>> matrix;
string g[305];
char ret[305][305];
void solve() {
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> g[i];
int ans = 0;
for(int plus = 0; plus < n; plus++) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
ret[i][(j+plus)%n] = g[i][j];
}
}
bool good = true;
for(int i = 0; i < n; i++) {
for(int j = 0; j < i; j++) {
if(ret[i][j] != ret[j][i]) {
good = false;
}
}
}
if(good) ans += n;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
}
|
#include <iostream>
using namespace std;
int main(){
int n,s,min,max,sum;
while(cin>>n && n>0){
max=0;
sum=0;
for(int i=0;i<n;i++){
cin>>s;
sum+=s;
if(i==0) min=s;
if(s>max) max=s;
if(s<min) min=s;
}
cout<<(sum-max-min)/(n-2)<<endl;
}
}
| 0
| 14,430,082
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,K;
ll S;
cin >> N >> K >> S;
vector<ll> v(N);
for(int i = 0; i < K; i++){
v[i] = S;
}
for(int i = K; i < N; i++){
if(S == 1000000000){
v[i] = 1;
} else {
v[i] = S+1;
}
}
for(int i = 0; i < N; i++){
if(i == N-1){
cout << v[i] << endl;
} else {
cout << v[i] << " ";
}
}
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, l, r, lmax = 1, rmin = 10e+5;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> l >> r;
lmax = max(l, lmax);
rmin = min(r, rmin);
}
cout << max(0, rmin - lmax + 1) << endl;
}
| 0
| 64,405,635
|
#include <iostream>
#include <cstring>
using namespace std;
int c[1001][1001];
int lcs(string x, string y)
{
int maxl = 0;
int m = x.length(), n = y.length();
for (int i = 0; i <= m; i++) c[i][0] = 0;
for (int j = 0; j <= n; j++) c[0][j] = 0;
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
if (x[i-1] == y[j-1])
{
c[i][j] = c[i-1][j-1] + 1;
}else
{
c[i][j] = max(c[i][j-1], c[i-1][j]);
}
maxl = max(maxl, c[i][j]);
}
}
return c[m][n];
}
int main()
{
string x,y;
int q;
cin>>q;
while(q--)
{
cin>>x>>y;
int ans = lcs(x, y);
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n, k;
cin >> n >> k;
vi a(n);
rep(i, n) cin >> a[i];
rep(_, k) {
vi s(n + 2, 0);
rep(j, n) {
ll l = max(0, j - a[j]);
ll r = min(n, j + a[j] + 1);
s[l + 1]++;
s[r + 1]--;
}
bool ok = true;
rep(j, n) {
s[j + 1] += s[j];
if(s[j + 1] < n) ok = false;
a[j] = s[j + 1];
}
if(ok) break;
}
rep(i, n) cout << a[i] << (i == n - 1 ? '\n' : ' ');
}
| 0
| 2,799,994
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
ll a, b, c, k, ans = 0;
cin >> a >> b >> c >> k;
ll ad = k - a, bd = k - a - b;
if (ad <= 0) ans = k;
else if (bd <= 0) ans = a;
else ans = a - bd;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
auto& scan_in = std::cin;
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { scan_in >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { scan_in >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { scan_in >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { scan_in >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)scan_in>>i;
template<typename T>void MACRO_OUT(const T t) { std::cout << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define RREP(w, n) RFOR(w, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n",(x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n",(x) ? "Yes" : "No")
#define F first
#define S second
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if (f) Out(y); else Out(n); }
signed main() {
INIT;
int K, S;
cin >> K >> S;
long long ans = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int z = S - x - y;
if (z >= 0 && z <= K) ans++;
}
}
cout << ans << endl;
}
| 0
| 9,961,612
|
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> P;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int n;
bool is_prime[110];
void sieve(int n) {
memset(is_prime, true, sizeof(is_prime));
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
for (int j = i + i; j <= n; j += i)
is_prime[j] = false;
}
}
}
int solve() {
sieve(n);
map<int, int> m;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
int v = i;
int cnt = 0;
while (v <= n) {
cnt += n / v;
v *= i;
}
if (cnt >= 2) m[2]++;
if (cnt >= 4) m[4]++;
if (cnt >= 14) m[14]++;
if (cnt >= 24) m[24]++;
if (cnt >= 74) m[74]++;
}
}
int res = 0;
res += m[74];
res += m[24] * (m[2] - 1);
res += m[14] * (m[4] - 1);
res += m[4] * (m[4] - 1) * (m[2] - 2) / 2;
return res;
}
void input() {
cin >> n;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve(string S) {
int ans = 0;
ll n = S.size();
string sub;
ll len_sub;
string subsub_l, subsub_r;
for (int i = 1; i < n; i++) {
sub = S.substr(0, i);
if (sub.size()%2 != 0) {
continue;
} else {
len_sub = sub.size() / 2;
subsub_l = sub.substr(0, len_sub);
subsub_r = sub.substr(len_sub, len_sub);
if (subsub_l == subsub_r) {
if (ans < sub.size()) {
ans = sub.size();
}
}
}
}
cout << ans << endl;
}
int main() {
string S;
cin >> S;
solve(S);
return 0;
}
| 0
| 33,756,207
|
#include<iostream>
using namespace std;
int main(){
int w,h,a,b;
while(1){
cin>>h>>w;
if(h==0&&w==0){
break;
}
w-=2;
a=w;
b=h;
for(;h>0;h--){
cout<<'#';
for(w=a;w>0;w--){
if(h==b||h==1){
cout<<'#';
}else{
cout<<'.';
}
}
cout<<'#';
cout<<endl;
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<i64> a(n);
i64 x = 0;
for (auto &e : a) {
std::cin >> e;
x ^= e;
}
for (auto &e : a) e &= ~x;
for (int i = 60, index = 0; i >= 0; i--) {
int mi = index;
i64 me = -1;
for (int j = index; j < n; j++) {
if ((a[j] & (1ll << i)) && a[j] > me) {
me = a[j];
mi = j;
}
}
if (me == -1) continue;
std::swap(a[index], a[mi]);
mi = index++;
for (int j = 0; j < n; j++) {
if (j != mi && (a[j] & (1ll << i))) a[j] ^= a[mi];
}
}
i64 m = 0;
for (int i = 0; i < n; i++) m ^= a[i];
std::cout << x + m * 2 << std::endl;
return 0;
}
| 0
| 45,414,619
|
#include <iostream>
using namespace std;
#define F(i) for (int i=0; i<10; i++)
int main()
{
int n;
while(cin >> n){
int count = 0;
F(a)F(b)F(c)F(d)if(a+b+c+d==n) count++;
cout << count << endl;
}
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int ans = 0;
for(int i = 0; i < n; i++)
if (a[a[i]] == i)
ans++;
ans /= 2;
cout << ans << '\n';
return 0;
}
| 0
| 77,459,388
|
#include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int shihab;
void FI()
{
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\SHIHAB\\Desktop\\input.in","r",stdin);
#endif
}
int main()
{
fast
FI();
int x,y;
cin >> x >> y;
cout << x+y/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
struct edge {
int from;
int to;
int cost;
};
typedef struct edge se;
typedef vector<edge> ve;
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;
}
vpll PrimeFactorization(ll n) {
vpll res;
for (ll i=2; i*i<=n; i++) {
if(n%i!=0) continue;
ll ex=0;
while(n%i==0) {
ex++;
n/=i;
}
res.push_back(pll(i,ex));
}
if(n!=1) res.push_back(pll(n,1));
return res;
}
int main() {
int h,w;
cin >> h >> w;
char s[h][w];
bool check[h][w]={false};
REP(i,h) {
REP(j,w) {
cin >> s[i][j];
if(s[i][j]=='.') check[i][j]=true;
}
}
REP(i,h) {
REP(j,w) {
if(j>0&&s[i][j-1]=='#'&&s[i][j]=='#') {
check[i][j-1]=true;
check[i][j]=true;
}
if(i>0&&s[i-1][j]=='#'&&s[i][j]=='#') {
check[i-1][j]=true;
check[i][j]=true;
}
}
}
string ans="Yes";
REP(i,h) {
REP(j,w) {
if(!check[i][j]) ans="No";
}
}
cout << ans << endl;
return 0;
}
| 0
| 16,503,809
|
#include <iostream>
using namespace std;
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
int last = -1, ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (last == x) {
ans++;
last = -1;
} else {
last = x;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N=1e5+5;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n;cin>>n;
ll a[n],sum=0;
for(ll i=0;i<n;i++)cin>>a[i],sum+=a[i];
ll tot = (n*(n+1))/2;
if(sum%tot)return cout<<"NO" , 0;
ll k = sum/tot;
for(ll i=0;i<n;i++){
ll diff = a[(i+1)%n] - a[i];
ll val = k - diff;
if(val>=0 && val%n==0)continue;
return cout<<"NO" , 0;
}
cout<<"YES";
}
| 0
| 84,256,583
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
if(s.size()<=20){
for(int i=s.size();i--;){
cout << s[i];
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
bool flag = true;
unordered_map<int, int> mp;
for (int i = 0; i < n; ++i)
{
int x;
cin >> x;
mp[x]++;
if (mp[x] > 1)
{
flag = false;
break;
}
}
if (flag)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
return 0;
}
| 0
| 100,734,676
|
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
ll a[maxn];
int main(){
ll n,m;
cin>>n>>m;
ll lcm=1;
for(int i=0;i<n;i++){
cin>>a[i];
if(lcm>1e9) continue;
lcm=lcm*a[i]/2 / __gcd(lcm,a[i]/2);
}
bool flag=0;
for(int i=0;i<n;i++){
ll t=lcm*2/a[i];
if(t%2==0){
flag=1;
break;
}
}
ll ans=m/lcm;
if(ans&1) ans=ans/2+1;
else ans/=2;
if(flag) cout<<"0"<<"\n";
else cout<<ans<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define INF (int)INT_MAX
#define all(v) v.begin(), v.end()
#define endl "\n"
typedef long long int ll;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector< pii > vii;
typedef std::vector< ll > vll;
typedef std::vector< std::pair < pii, int > > vpp;
const int N = 3*1e5 +5 ;
const long long MOD = 998244353;
const long long inf = 1e18;
using namespace std;
ll MAXN=100001;
ll spf[100001];
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%MOD;
x=x*x%MOD;
n>>=1;
}
return res;
}
ll modFact(ll n, ll p)
{
if (n >= p)
return 0;
ll result = 1;
for (ll i = 1; i <= n; i++)
result = (result * i) % p;
return result;
}
bool isPrime(int x)
{
if(x%2==0)
return 0;
for(int i=3;i<=sqrt(x);i+=2)
{
if(x%i==0)
return 0;
}
return 1;
}
void solve()
{
int n , m ;
cin>>n>>m ;
multiset<ll, greater<ll>>a ;
rep(i ,n) {
ll temp ;
cin>>temp ;
a.insert(temp) ;
}
while(m--){
auto it = a.begin() ;
ll temp = (*it) / 2 ;
a.erase(it) ;
a.insert(temp) ;
}
ll ans = 0 ;
for(auto it = a.begin() ; it!=a.end(); it++){
ans += (*it) ;
}
cout<<ans<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
while(t--)
{
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
}
| 0
| 79,846,959
|
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
constexpr int m = 3;
vector<vi> a(m, vi(m));
int n;
vi b;
void input() {
for (auto&& i : a) {
for (auto&& j : i)
cin >> j;
}
cin >> n;
b.resize(n);
for (auto&& i : b)
cin >> i;
}
void solve() {
sort(b.begin(), b.end());
for (auto&& i : a) {
for (auto&& j : i) {
if (binary_search(b.cbegin(), b.cend(), j))
j = 0;
}
}
string ans = "No";
int cnt = 0;
for (int i = 0; i < m; ++i)
cnt += a[i][i] == 0;
if (cnt == 3)
ans = "Yes";
cnt = 0;
for (int i = 0; i < m; ++i)
cnt += a[i][m - i - 1] == 0;
if (cnt == 3)
ans = "Yes";
for (auto&& i : a) {
if (count(i.cbegin(), i.cend(), 0) == 3)
ans = "Yes";
}
for (int i = 0; i < m; ++i) {
cnt = 0;
for (int j = 0; j < m; ++j)
cnt += a[j][i] == 0;
if (cnt == 3)
ans = "Yes";
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(16);
cout << fixed;
int _times = 1;
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
_times = 3;
#endif
while (_times--) {
input();
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
using pll = pair<ll,ll> ;
const int INF = 1e9 ;
void chmin(int &a,int b){if(a>b) a = b ;}
void chmax(ll &a,ll b){if(a<b) a = b ;}
void YorN(bool a){cout << (a?"YES":"NO") << "\n" ;}
int main(){
int n ; cin >> n ;
while(n%2==0) n /= 2 ;
while(n%5==0) n /= 5 ;
vll a(n,INF) ;
priority_queue<pll> q ;
q.emplace(-1,1) ;
while(!q.empty()){
ll p = q.top().second%n ;
ll cost = -q.top().first ;
q.pop() ;
if(a[p]!=INF) continue ;
a[p] = cost ;
q.emplace(-cost,p*10) ;
if(p%10!=9) q.emplace(-cost-1,p+1) ;
}
cout << a[0] << endl ;
}
| 0
| 33,451,922
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
int a, b; cin >> a >> b;
if (a%3 == 0 || b%3 == 0 || (a+b)%3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long h, w;
long long z = 100000000000 ;
cin >> h >> w;
if (h%3==0) z = 0;
else z = min(z, w);
if (w%3==0) z = 0;
else z = min(z, h);
long long a, b, c;
for (int i=1; i<h; i++){
a = i*w;
if (w%2==0){
b = w/2*(h-i);
z = min(z, abs(a-b));
}
else{
b = w/2*(h-i);
c = (w/2+1)*(h-i);
long long n1 = min(a, min(b, c));
long long n2 = max(a, max(b, c));
z = min(z, (n2-n1));
}
}
for (int i=1; i<w; i++){
a = i*h;
if (h%2==0){
b = h/2*(w-i);
z = min(z, abs(a-b));
}
else{
b = h/2*(w-i);
c = (h/2+1)*(w-i);
long long n1 = min(a, min(b,c));
long long n2 = max(a, max(b,c));
z = min(z, (n2-n1));
}
}
cout << z << '\n';
}
| 0
| 33,070,859
|
#include <iostream>
using namespace std;
int main(void){
for(;;){
int N, M, P;
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
return 0;
}
int X[N];
for(int i = 0 ; i < N ; i++){
cin >> X[i];
}
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += 100 * X[i];
}
sum = sum * (100 - P) / 100;
if(X[M-1] > 0){ cout << sum / X[M-1] << endl;}else{ cout << 0 << endl;}
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
vector<ll> factor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
int main() {
ll N;
scanf("%lld", &N);
ll ans = 0;
for (ll i = 1; i <= N; i++) {
if (i % 2 == 0) continue;
if (factor(i).size() == 7) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 19,315,293
|
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,n) for(ll i=0,i##_cond=(n);i<i##_cond;i++)
#define FOR(i,a,b) for(ll i=(a),i##_cond=(b);i<i##_cond;i++)
#define ROF(i,a,b) for(ll i=(a)-1,i##_cond=(b);i>=i##_cond;i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
#define SUM(a) accumulate(all(a),0)
#define sz(x) ((ll)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll,ll> pii;
const ll inf = 1ll<<62;
const ll mod = 1e9+7;
#define int ll
int convert(string ts){
int h,m,s,t;
h = stoi(ts.substr(0,2));
m = stoi(ts.substr(3,2));
s = stoi(ts.substr(6,2));
t = h * 60 * 60 + m * 60 + s;
return t;
}
main()
{
while(1){
int n; cin >> n;
if(n == 0) break;
vi time(24*60*60);
rep(i,n){
string sts,gts; cin >> sts >> gts;
int st = convert(sts), gt = convert(gts);
time[st]++; time[gt]--;
}
rep(i,sz(time)-1) time[i+1] += time[i];
cout << *max_element(all(time)) << endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
while(1){
int ans=0;
int n;
cin>>n;
if(cin.eof())break;
for(int a=0;a<=9;a++){
for(int b=0;b<=9;b++){
for(int c=0;c<=9;c++){
for(int d=0;d<=9;d++){
if(a+b+c+d==n)ans++;
}
}
}
}
cout<<ans<<endl;
}
}
| 0
| 61,771,002
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
rep(i,n)rep(j,n)cin>>a[i][j];
rep(i,m)rep(j,m)cin>>b[i][j];
rep(i,n-m+1)rep(j,n-m+1){
bool ans=true;
rep(k,m)rep(l,m){
if(a[i+k][j+l]!=b[k][l])ans=false;
}
if(ans){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
}
|
#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()
{
string S;
cin >> S;
ll now = 0;
ll ans = 0;
rep(i, 0, len(S)) {
if (S[i] == 'B') continue;
ans += i - now;
++now;
}
cout << ans << endl;
}
| 0
| 66,401,732
|
#include <stdio.h>
#include <string.h>
int main(){
char i[26], j[26], k[26];
scanf("%s %s %s", &i, &j, &k);
int a=strlen(i), b=strlen(j);
if(i[a-1]==j[0] && j[b-1]==k[0]){
printf("YES\n");
}
else {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 2e5+228;
vector<int> graph[N];
bool used[N];
int sz;
void dfs(int v)
{
++sz;
used[v] = true;
for (int u: graph[v]) {
if (used[u]) continue;
dfs(u);
}
}
int main()
{
#ifdef LOCAL_RUN
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
while (m--) {
int x, y;
cin >> x >> y;
graph[x].push_back(y);
graph[y].push_back(x);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!used[i]) {
sz = 0;
dfs(i);
ans = max(ans, sz);
}
}
cout << ans;
return 0;
}
| 0
| 49,598,337
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> a(N);
int mx = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
a[i] = tmp;
mx = max(mx, tmp);
}
int r = -1;
for (int i = 0; i < N; i++) {
if (abs(mx - a[i] * 2) < abs(mx - r * 2) && a[i] != mx) {
r = a[i];
}
}
cout << mx << " " << r << endl;
}
|
#include <iostream>
using namespace std;
void init(char*);
int main(){
int n, m, i;
char a, b, convert[128];
while(cin >> n){
if(n == 0){
break;
}
init(convert);
for(i = 0; i < n; ++i){
cin >> a >> b;
convert[a] = b;
}
cin >> m;
for(i = 0; i < m; ++i){
cin >> a;
if(convert[a] != 0){
cout << convert[a];
}else{
cout << a;
}
}
cout << endl;
}
}
void init(char* ary){
int i;
for(i = 0; i < 128; ++i){
ary[i] = 0;
}
}
| 0
| 50,684,059
|
#include<bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n) int(n);cin >> (n)
#define LCIN(n) LL(n);cin >> (n)
#define SCIN(n) string(n);cin >> (n)
#define YES(n) cout<<((n)? "YES" : "NO")<<endl
#define Yes(n) cout<<((n)? "Yes" : "No")<<endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) <<endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(obj) (obj).begin(),(obj).end()
#define P pair<int,int>
#define I vector<int>
#define S set<int>
#define pb(v) push_back(v)
#define V vector
#define rt return
#define rmsame(a) sort(ALL(a)),a.erase(unique(ALL(a)), a.end())
typedef string::const_iterator State;
class PalseError {};
class Edge{
public:
int from,to,value;
Edge(int a,int b,int c){
from = a;
to = b;
value = c;
}
Edge(int a,int b){
from = a;
to = b;
}
};
LL w[10];
int main(){
LCIN(H);LCIN(W);LCIN(N);
V<pair<LL,LL>> vec;
REP(a,N){
LCIN(b);LCIN(c);
vec.pb(make_pair(b-1,c-1));
}
map<pair<int,int>,int> mp;
int dx[]={1,1,1,0,-1,-1,-1,0,0};
int dy[]={1,0,-1,-1,-1,0,1,1,0};
REP(a,N){
for(int b = 0;b < 9;b++){
if(vec.at(a).second+dx[b] >=1&&vec.at(a).second+dx[b] < W-1&&vec.at(a).first + dy[b] >= 1&&dy[b]+vec.at(a).first < H-1){
if(mp.find(make_pair(vec.at(a).first + dy[b],vec.at(a).second+dx[b])) == mp.end()){
mp[make_pair(vec.at(a).first + dy[b],vec.at(a).second+dx[b])]=1;
}else{
mp[make_pair(vec.at(a).first + dy[b],vec.at(a).second+dx[b])]++;
}
}
}
}
LL sum = 0;
FOREACH(a,mp){
w[a.second]++;
}
for(int a = 0;a < 10;a++){
sum += w[a];
}
w[0]=(H-2)*(W-2)-sum;
for(int a = 0;a < 10;a++){
COUT(w[a]);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int max_n=1e6+10;
int a[max_n];
int gcd(int a,int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
unordered_map<int, int> m;
for (int i = 0; i < n; ++i) {
int x = a[i];
for (int j = 2; j <= x / j; ++j) {
if (x % j == 0)
m[j]++;
while (x % j == 0) x /= j;
}
if (x > 1) m[x]++;
}
bool flag = true;
for (auto item:m) {
if (item.second > 1) {
flag = false;
break;
}
}
if (flag) {
cout << "pairwise coprime" << endl;
return 0;
}
int g=0;
for(int i=0;i<n;++i)
g=gcd(a[i],g);
if(g==1) cout<<"setwise coprime"<<endl;
else cout<<"not coprime"<<endl;
return 0;
}
| 0
| 71,048,150
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
struct Node {
int parent = -1;
vector<int> child;
};
vector<Node> node;
int get_depth(int id, int depth) {
if (node[id].parent == -1) {
return depth;
}
else {
get_depth(node[id].parent, depth + 1);
}
}
string get_type(int id) {
if (node[id].parent == -1) {
return "root";
}
else if (node[id].child.size() == 0) {
return "leaf";
}
else {
return "internal node";
}
}
int main() {
int n, id, k, child;
cin >> n;
node.resize(n);
for (int i = 0; i < n; i++) {
cin >> id >> k;
for (int j = 0; j < k; j++) {
cin >> child;
node[id].child.push_back(child);
node[child].parent = id;
}
}
for (int i = 0; i < n; i++) {
cout << "node " << i << ": ";
cout << "parent = " << node[i].parent << ", ";
cout << "depth = " << get_depth(i, 0) << ", ";
cout << get_type(i) << ", [";
for (int j = 0; j < node[i].child.size(); j++) {
cout << node[i].child[j];
if (j < node[i].child.size() - 1) {
cout << ", ";
}
}
cout << "]\n";
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for(int i = (n-1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).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> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k; cin >> n >> k;
ll ans = (ll)1e19;
vector<P> p(n); rep (i, n) cin >> p[i].first >> p[i].second;
rep (x1, n) {
repp (x2, x1 + 1, n) {
rep (y1, n) {
repp (y2, y1 + 1, n) {
int h1 = p[x1].first, h2 = p[x2].first, w1 = p[y1].second, w2 = p[y2].second;
if (h1 > h2) swap(h1, h2); if (w1 > w2) swap(w1, w2);
int tmp = 0;
rep (i, n) {
if (h1 <= p[i].first && p[i].first <= h2
&& w1 <= p[i].second && p[i].second <= w2) {
tmp++;
}
}
eprintf("%lld x:(%d,%d) y:(%d,%d)\n", (ll)(h2 - h1) * (w2 - w1), h1, h2, w1, w2);
if (tmp >= k) chmin(ans, (ll)(h2 - h1) * (w2 - w1));
}
}
}
}
cout << ans << "\n";
return 0;
}
| 0
| 74,451,145
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int n;
cin >> n;
map<int, int> mp, mp2;
for(int i=0; i<n; i++) {
int t;
cin >> t;
mp[t]++;
}
for(auto pr: mp) {
mp2[pr.second]++;
}
vector<int> c(n+1);
for(auto pr: mp2) {
c[pr.first] = pr.second;
}
int mxn = n, cur = n;
cout << n << '\n';
for(int k=2; k<=mxn; k++) {
while(n/k < cur) {
n -= c[cur];
c[cur-1] += c[cur];
c[cur] = 0;
cur--;
}
cout << cur << '\n';
}
}
|
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<60);
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
LL N,K;
LL A[100000],B[100000];
LL ans = 0;
LL val_sum(LL bit){
LL ret = 0;
for(int i=0;i<N;i++){
bool ok = true;
for(int j=0;j<30;j++){
if(!((bit>>j)&1LL) && ((A[i]>>j)&1LL)) ok = false;
}
ret += ok*B[i];
}
return ret;
}
void solve(){
ans = val_sum(K);
for(int d=0;d<30;d++){
if((K>>d)&1LL){
LL wise = K;
wise &= ~(1<<d);
wise |= ((1<<d) - 1);
ans = max(ans,val_sum(wise));
}
}
}
int main(){
cin >> N >> K;
for(int i=0;i<N;i++) cin >> A[i] >> B[i];
solve();
cout << ans << endl;
return 0;
}
| 0
| 12,290,624
|
#include<cstdio>
#include<cstring>
const int MAX_N = 1e5, A = 1e9 + 7;
int n;
char s[2 * MAX_N + 1];
int dp[2 * MAX_N];
int main() {
scanf("%d", &n);
scanf("%s", s);
int l = strlen(s);
dp[0] = 1;
if (s[0] == 'W') {
printf("0\n");
return 0;
}
for (int i = 1, cnt = 1; i < l; i++) {
bool cj = cnt % 2;
if ((s[i] == 'W' && !cj) || (s[i] == 'B' && cj)) {
if (--cnt < 0) {
printf("0\n");
return 0;
}
dp[i] = static_cast<long>((cnt + 1)) * dp[i - 1] % A;
}
else if ((s[i] == 'W' && cj) || (s[i] == 'B' && !cj)) {
if ((i - cnt) + 2 * cnt >= 2 * n) {
printf("0\n");
return 0;
}
cnt++;
dp[i] = dp[i - 1];
}
}
int per = 1;
for (int i = 2; i <= n; i++) per = static_cast<long>(per) * i % A;
int ans = static_cast<long>(per) * dp[l - 1] % A;
printf("%d\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define pb(z) push_back(z)
#define ff first
#define ss second
#define pi(a,b) make_pair(a,b)
#define pii pair<ll,ll>
#define T int t;cin>>t;for(int tt=1;tt<=t;tt++)
#define debug(vec) cout<<(#vec)<<" : [ "; for (auto& i: vec) cout<<i<<" "; cout<< "]" << endl
#define input(v,n) vector<int>v;for(int i=0;i<n;i++){int x;cin>>x;v.push_back(x);}
#define debugg(a,b,c) cout<<a<<" "<<b<<" "<<c<<endl
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
const int inf = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
const double eps = 1e-4;
const int mod = 1e9+7;
const int mx = 2e5+5;
int main()
{
IOS
vector<ll>a,b,c;
map<int,int>mp;
int n,k;
cin>>n;
int cnt1=0,cnt2=0;
rep(i,0,n+1)
{
ll t,x,y;
cin>>t;
a.pb(t);
}
rep(i,0,n)
{
ll t,x,y;
cin>>t;
b.pb(t);
}
ll tmp=-2,sum=0;
rep(i,0,n)
{
if(b[i]<a[i]+a[i+1])
{
sum+=b[i];
a[i+1]-=max(b[i]-a[i],0LL);
}
else
{
sum+=a[i]+a[i+1];
a[i+1]=0;
}
}
cout<<sum<<endl;
}
| 0
| 51,914,058
|
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int MOD = 1'000'000'007;
const int INF = 1'000'000'000;
const int NIL = -1;
const long long LINF = 1'000'000'000'000'000'000;
const long double EPS = 1E-10;
template<class T, class S> inline bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S> inline bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int n; std::cin >> n;
std::vector<int> r(n), c(n);
for(int i(0); i < n; ++i) std::cin >> r[i] >> c[i];
std::vector<std::vector<int>> dp(n, std::vector<int>(n, 0));
for(int d(1); d < n; ++d){
for(int i(0), i_len(n - d); i < i_len; ++i){
int j(i + d);
dp[i][j] = INF;
for(int k(i); k < j; ++k){
chmin(dp[i][j], dp[i][k] + dp[k+1][j] + r[i]*c[k]*c[j]);
}
}
}
std::cout << dp[0][n-1] << std::endl;
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();
vector<vector<int>> vec(3,vector<int>(3));
for0(i,3)
{
for0(j,3)
{
cin>>vec[i][j];
}
}
vector<vector<bool>> vis(3,vector<bool>(3,false));
int n;cin>>n;
for0(i,n)
{
int a;cin>>a;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(vec[i][j]==a)
{
vis[i][j]=true;
break;
}
}
}
}
bool f=0;
for0(i,3)
{
for0(j,3)
{
if(!vis[i][j])
{
f=0;
break;
}
else
f=1;
}
if(f)
{
cout << "Yes" <<"\n";
return 0;
}
}
for0(i,3)
{
for0(j,3)
{
if(!vis[j][i])
{
f=0;
break;
}
else
f=1;
}
if(f)
{
cout << "Yes" <<"\n";
return 0;
}
}
if((vis[0][0] && vis[1][1] && vis[2][2])||(vis[0][2]&&vis[1][1]&&vis[2][0]))
{
cout << "Yes" <<"\n";
return 0;
}
cout << "No" <<"\n";
}
| 0
| 78,189,326
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
ll N;
cin>>N;
ll ans;
rep(i,1,10){
if(N<=i*111){ans=i*111;break;}
else continue;
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n)cin >> a[i];
vector<pair<int,int>>dataa(110000);
vector<pair<int,int>>datab(110000);
rep(i,110000){
dataa[i].second = i;
datab[i].second = i;
dataa[i].first = 0;
datab[i].first = 0;
}
rep(i,n){
if(i%2==0){
datab[a[i]].first++;
}else {
dataa[a[i]].first++;
}
}
sort(all(dataa));
reverse(all(dataa));
sort(all(datab));
reverse(all(datab));
int x = dataa[0].second;
int y = datab[0].second;
if(x == y){
if(dataa[1].first < datab[1].first)y = datab[1].second;
else x = dataa.at(1).second;
}
int ans = 0;
rep(i,n){
if(i%2==0){
if(a[i]!=y)ans++;
}else{
if(a[i]!=x)ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 64,355,058
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<int> Div(int n) {
vector<int> ret;
for(int i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
if(s[0] == 'W' || s[n * 2 - 1] == 'W') {
cout << 0 << endl;
return 0;
}
vector<char> d;
int l, r;
l = r = 0;
++l;
d.pb('L');
for(int i = 1; i < n * 2; ++i) {
if(s[i] == s[i - 1]) {
if(d[i - 1] == 'L') {
d.pb('R');
++r;
} else {
d.pb('L');
++l;
}
} else {
if(d[i - 1] == 'L') {
d.pb('L');
++l;
} else {
d.pb('R');
++r;
}
}
}
if(l != r) {
cout << 0 << endl;
return 0;
}
LL res = 1;
l = r = 0;
for(int i = 0; i < n * 2; ++i) {
if(d[i] == 'L') {
++l;
} else {
++r;
res = res * l % MOD;
l--;
}
}
for(int i = 1; i <= n; ++i) {
res = res * i % MOD;
}
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
typedef pair<int, int> P;
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
P p[100010];
rep(i, N) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + N);
rep(i, N) {
K -= p[i].second;
if(K <= 0) {
cout << p[i].first << endl;
return 0;
}
}
return 0;
}
| 0
| 48,548,169
|
#include<bits/stdc++.h>
using namespace std;
#define speed ios_base::sync_with_stdio(false) , cin.tie(NULL) , cout.tie(NULL);
int main()
{
speed;
int n;
cin>>n;
vector<int>v(n);
int ans=INT_MAX;
for(int i=0;i<n;i++) cin>>v[i];
for(int i=-100;i<=100;i++)
{
int cal=0;
for(int j=0;j<n;j++)
{
cal+=((v[j]-i)*(v[j]-i));
}
ans=min(ans,cal);
}
cout<<ans<<"\n";
}
|
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(i, N) cin >> T[i];
sort(T.begin(), T.end());
vector<ll> T_lim(N);
rep(i, N) T_lim[i] = T[i] + K;
ll bus_cnt = 0;
for(int i = 0; i < N; ){
int p = i;
i++;
while(T_lim[p] >= T[i] && i < N && i < p + C){
i++;
}
bus_cnt++;
}
cout << bus_cnt << endl;
return 0;
}
| 0
| 79,491,542
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.size();
vector<char>a(n);
vector<char>b(n);
for(int i=0; i<n; i++){
if(s[i] != s[n-1-i]){
cout << "No" << endl;
return 0;
}
}
for(int i=0; i<n/2; i++){
if(n%2==0){
if(s[i]!=s[n/2-1-i]){
cout << "No" << endl;
return 0;
}
if(s[n/2+i]!=s[n-1-i]){
cout << "No" << endl;
return 0;
}
}else{
if(s[i]!=s[n/2-1-i]){
cout << "No" << endl;
return 0;
}
if(s[n/2+1+i]!=s[n-1-i]){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <stdio.h>
int main(){
int n,l,r;
char a[1001],temp[1001],c[1001];
scanf("%s",a);
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",temp);
if(temp[2]=='p'){
scanf("%d%d",&l,&r);
r++;
scanf("%s",c);
for(int j=0;j<r-l;j++){
a[j+l]=c[j];
}
}
if(temp[2]=='v'){
scanf("%d%d",&l,&r);
r++;
for(int j=l;j<r;j++){
c[j]=a[r+l-j-1];
}
for(int j=l;j<r;j++){
a[j]=c[j];
}
}
if(temp[2]=='i'){
scanf("%d%d",&l,&r);
r++;
for(int j=l;j<r;j++)
printf("%c",a[j]);
printf("\n");
}
}
}
| 0
| 52,233,299
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll n;cin >> n;
double ans=0.000000;
rep(i, n) {
ll a; cin>>a;
ans+=1.0/a;
}
ans=1.0/ans;
cout << fixed << setprecision(7);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i < n; i++)
#define repd(i, n) for (int i = n-1; i > -1; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
int s;
cin >> s; s--;
a[i] = s;
}
vector<bool> visited(n);
rep(i, n) visited[i] = false;
int num = 0, cnt = 0;
bool flag = false;
while(true){
if (visited[num]) break;
if (num == 1) {
flag = true;
break;
}
visited[num] = true;
num = a[num];
cnt++;
}
if (flag) {
cout << cnt << endl;
} else {
cout << -1 << endl;
}
}
| 0
| 95,106,975
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, a[50];
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
ans += a[i] * a[j];
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
int n; cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 1;
Rep(i, 1, n)
{
rep(j, i)
{
if (h[i] < h[j]) break;
if (j == i - 1) ans++;
}
}
cout << ans << endl;
}
| 0
| 60,275,796
|
#include <bits/stdc++.h>
using namespace std;
const int x[10] = {-1,2,5,5,4,5,6,3,7,6};
void chmax(int &a, const int &b) { if (a < b) a = b; return; }
int main(){
int n, m; cin >> n >> m;
vector<int> data(m);
for (int i = 0; i < m; i++) cin >> data[i];
sort(data.begin(),data.end(),greater<int>());
vector<int> keta(n+1,-1); keta[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < m; j++) {
if (i - x[data[j]] >= 0) chmax(keta[i], keta[i - x[data[j]]] + 1);
}
}
while (n > 0) {
for (int i = 0; i < m; i++) {
if (n - x[data[i]] >= 0 && keta[n] == keta[n - x[data[i]]] + 1) {
cout << data[i];
n -= x[data[i]];
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <bitset>
#include <numeric>
using namespace std;
const long double PI = 3.14159265358979323846264338327950;
const int N = 2*1e5;
template <class T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int arr[N];
bool vis[N+1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> arr[i];
int x = arr[0];
int ans =1;
for (int i = 1; i < n; ++i) {
if (arr[i] < x)
++ans;
x = min(x, arr[i]);
}
cout << ans << '\n';
}
| 0
| 77,481,125
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
for(int i = 0; i < s.length(); i += 2) {
cout << s[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int pre=0, cnt=0, res=0;
rep(i, n){
int h;
cin >> h;
if(pre>=h){
cnt++;
}else{
res = max(res, cnt);
cnt = 0;
}
pre = h;
}
res = max(res, cnt);
cout << res << endl;
return 0;
}
| 0
| 51,993,879
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i <= N; i++) {
long long x = N / i;
ans += x * (x + 1) / 2 * i;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll,ll> > vpll;
const int MOD=1e9+7;
const int MAX=1e5+5;
const double PI= acos(-1.0);
const long double EPS=1e-10;
const int64_t INF=1e18+10;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(0), cout.tie(0)
#define trace(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vi vector<int>
#define vl vector<ll>
#define vs vector<str>
#define vc(x) vector<x>
#define mapll map<ll,ll>
#define mapib map<int,bool>
#define mapiv map<int,vector>
#define mapsi map<string,int>
#define rep(i,j,k) for(ll i=j;i<k;i++)
#define down(i,j,k) for(ll i=j;i>=k;i--)
#define repa(i,n) for(ll i=0;i<n;i++)
#define dowa(i,n) for(ll i=n;i>=0;i--)
#define reps(i,j,k,s) for(ll i=j;i<k;i+=s)
#define downs(i,j,k,s) for(ll i=j;i>=k;i-=s)
#define trv(i,x) for(auto i:x)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define str string
#define dub double
#define pqmax priority_queue<ll>
#define pqmin priority_queue<ll,vl,greater<ll> >
#define INF(x) numeric_limits<x>::max()
template<typename t> t lcm(t a, t b) {return (a*b)/__gcd(a,b);}
template<typename t> t gcd(t a, t b) {return __gcd(a,b);}
template<typename t> t mul_mod(t a, t b, t m){t res=((a%m)*(b%m)%m); return res;}
template<typename t> t add_mod(t a, t b, t m){t res=((a%m)+(b%m))%m; return res;}
template<typename t> t pow_mod(t a,t b,t m) {t res=1;while(b){if(b&1) res=mul_mod(res,a,m);a=mul_mod(a,a,m), b>>=1;} return res%m;}
template<typename t> vc(t) num_vec(t num) {t res; while (num) res.pb(num%10), num/=10; return res;}
template<typename t> t vec_num(t vec) {t res=0; ll mul=1; repa(i,sz(vec)) res=vec[i]*mul, mul*=10; return res;}
int32_t main(int argc,char** argv){
fastio();
auto tstart= clock();
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stderr);
#endif
int n, k; cin >> n >> k;
vl a(n); repa(i, n) cin >> a[i];
vc(vl) dp(n + 1, vl(k + 1, 0)), pre(n + 1, vl(k + 1, 0));
dp[0][0] = 1;
pre[0][0] = dp[0][0];
rep(j, 1, k + 1)
pre[0][j] = pre[0][j - 1] + dp[0][j], dp[0][j] = pre[0][j];
rep(i, 1, n + 1) {
repa(j, k + 1) {
dp[i][j] = (dp[i][j] + MOD + pre[i - 1][j] - ((j > a[i - 1]) ? pre[i - 1][j - a[i - 1] - 1] : 0) % MOD) % MOD;
pre[i][j] = (((j) ? pre[i][j - 1] : 0) + dp[i][j]) % MOD;
}
}
cout << dp[n][k] << endl;
cerr << setprecision(2) << fixed<<"Time elapsed: " << (double)(clock() - tstart)/CLOCKS_PER_SEC << endl;
return 0;
}
| 0
| 2,966,984
|
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
int cnt=0;
for(int i=0;i<n-1;i++){
if(s[i]==s[i+1])continue;
cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
vector<char> T(N);
for(int i = 0; i < N; i++) {
cin >> T.at(i);
}
map<char, int> Points{{'r', R}, {'s', S}, {'p', P}};
map<char, char> my_hands{{'r', 'p'}, {'s', 'r'}, {'p', 's'}};
vector<char> ls(N);
for(int i = 0; i < N; i++) {
if(i < K) {
ans += Points.at(my_hands.at(T.at(i)));
ls.at(i) = my_hands.at(T.at(i));
} else if(my_hands.at(T.at(i)) != ls.at(i - K)) {
ans += Points.at(my_hands.at(T.at(i)));
ls.at(i) = my_hands.at(T.at(i));
}
}
cout << ans << endl;
}
| 0
| 51,975,997
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
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; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for(ll i=1; i<a.size() && res!=1; i++) res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a){
ll res = a[0];
for(ll i=1; i<a.size(); i++) res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if(n < 2) return false;
for (ll i = 2; i * i <= n; i++) if (n % i == 0) return false;
return true;
}
ll digsum(ll n) {
ll res=0;
while(n) res += n%10, n /= 10;
return res;
}
ll digcnt(ll n){
ll res=0;
while(n) res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) ++res[i], n /= i;
}
if (n != 1) res[n] = 1;
return res;
}
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,k; cin>>n>>k;
vll a(n);
ll ma=0;
rep(i,n) cin>>a[i], chmax(ma,a[i]);
ll g=0;
rep(i,n){
g=gcd(g,a[i]);
}
if(k%g==0&&k<=ma) cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
using namespace std;
using ll=long long;
using ld=long double;
#define ssort(n) sort((n).begin(),(n).end())
typedef pair<int,int> P;
int main()
{
int N;
cin >> N;
vector<ll> a(N);
rep(i,N)cin >> a[i];
map<ll,ll> b;
stack<ll> stack_b;
rep(i,N){
if(!b.count(a[i])){
b[a[i]]=1;
stack_b.push(a[i]);
}else{
b[a[i]]++;
}
}
ll val;
ll count=0;
while(!stack_b.empty()){
val=stack_b.top();
stack_b.pop();
if(b[val]>=val){
count+=b[val]-val;
}
else{
count+=b[val];
}
}
cout << count << endl;
}
| 0
| 61,608,035
|
#include<bits/stdc++.h>
using namespace std;
const unsigned int M = 1000000007;
int main(){
string s;
cin >> s;
if(s=="SSS"){
cout << 0 << endl;
}else if(s == "RRS" || s == "SRR"){
cout << 2 << endl;
}else if(s == "RRR"){
cout << 3 <<endl;
}else{
cout << 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define PERM(c) \
sort(All(c)); \
for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<ll> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
ll __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&... args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
signed main() {
ll lb = 0, ub = 11;
ll p[11];
REP(i, 11) { p[i] = pow(10, i); }
while(ub - lb > 1) {
ll mid = (ub + lb) / 2;
cout << "? " << p[mid] << endl;
SCIN(ans);
if(ans == "Y")
lb = mid;
else
ub = mid;
}
if(lb == 10) {
FORR(i, 10, 0) {
cout << "? " << p[i] - 1 << endl;
SCIN(ans);
if(ans == "N") {
cout << "! " << p[i] << "\n";
}
}
eputs("! 1");
}
ll d = lb;
lb = pow(10, d), ub = pow(10, d + 1);
while(ub - lb > 1) {
ll mid = (ub + lb) / 2;
cout << "? " << mid << "0" << endl;
SCIN(ans);
if(ans == "N")
lb = mid;
else
ub = mid;
}
cout << "! " << ub << endl;
}
| 0
| 94,129,182
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[]) {
int n, b, f, r, v;
int a[4][3][10] = {0};
cin >> n;
for(int i = 0; i < n; i++){
cin >> b >> f >> r >> v;
a[b-1][f-1][r-1] += v;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 3; j++){
for(int k = 0; k < 10; k++){
printf(" %d", a[i][j][k]);
}
printf("\n");
}
if(i != 3) printf("####################\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
if(n/i==i)
c++;
else
c+=2;
}
}
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s, str;
cin>>str;
cin>>s;
for(int i=1;i<=s.size();i++)
{
str=str[str.size()-1] + str;
str.erase(str.begin()+str.size()-1);
int j;
for(j=0;j<s.size();j++)
{
if(str[j]!=s[j])
break;
}
if(j==s.size())
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;
}
| 0
| 4,432,067
|
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vb = vector<bool>;
using qi = queue<int>;
using Graph = vector<vector<int>>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define REP(i,n) for(int i=0;i<n;i++)
qi que;
vi dist;
void bfs(Graph &G) {
while (!que.empty()) {
int v = que.front();
que.pop();
for(int next_v : G[v]) {
if (dist[next_v] != -1) continue;
que.push(next_v);
dist[next_v] = dist[v] + 1;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
Graph G(n);
REP(i, n) {
int u; cin >> u;
int k; cin >> k;
REP(j, k) {
int v; cin >> v;
G[i].push_back(v-1);
}
}
que.push(0);
dist.assign(n, -1);
dist[0] = 0;
bfs(G);
REP(i, n) {
cout << (i+1) << " " << dist[i] << "\n";
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, M; cin >> N >> M;
if(N == 1 && M == 1){
cout << 1 << endl;
} else if(N == 1){
cout << M-2 << endl;
} else if(M == 1){
cout << N-2 << endl;
} else {
ll ans = (N-2) * (M-2);
cout << ans << endl;
}
return 0;
}
| 0
| 84,020,707
|
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template<typename T>
void vprint(vector<T> v) {
for(auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template<typename T>
void vvprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) {
cerr << vv[i][j] << " ";
}
cerr << endl;
}
}
template<typename T1, typename T2>
void vpprint(vector<pair<T1, T2>> vp) {
REP(i, SIZE(vp)) {
cerr << vp[i].first << ", " << vp[i].second << endl;
}
}
template<typename T1, typename T2>
void mprint(map<T1, T2> m) {
for(auto x : m) cerr << x.first << ", " << x.second << endl;
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T gcd(T a, T b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(b%a, a);
}
template<typename T>
T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 0) return 1;
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
#define FACT_SZ 100010
VLL _fact, _inv;
bool _fact_flg = true;
void _fact_init() {
_fact = VLL(FACT_SZ);
_inv = VLL(FACT_SZ);
_fact[0] = 1;
FOR(i, 1, FACT_SZ) _fact[i] = (_fact[i-1] * i) % MOD;
_inv[FACT_SZ-1] = mypow(_fact[FACT_SZ-1], MOD - 2);
for(int i = FACT_SZ - 2; i >= 0; i--) {
_inv[i] = ((i + 1) * _inv[i + 1]) % MOD;
}
}
LL mycomb(LL n, LL k) {
if(_fact_flg) {
_fact_flg = false;
_fact_init();
}
if(n < k) return 0;
return (((_fact[n] * _inv[k]) % MOD) * _inv[n-k]) % MOD;
}
VLL par, rnk, sz;
int root(int x) {
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
x = root(x);
y = root(y);
return x == y;
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(rnk[x] < rnk[y]) {
par[x] = y;
sz[y] += sz[x];
} else {
par[y] = x;
sz[x] += sz[y];
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
#define INF 1e15
int main(void) {
string n;
LL k;
cin >> n >> k;
VVVLL dp(110, VVLL(2, VLL(4, 0)));
LL x0 = n[0] - '0';
dp[0][0][0] = 1;
dp[0][0][1] = x0 - 1;
dp[0][1][1] = 1;
FOR(i, 1, n.size()) {
LL x = n[i] - '0';
if(x != 0) {
dp[i][0][0] = dp[i-1][0][0] * 1 + dp[i-1][1][0] * 1;
dp[i][1][0] = 0;
dp[i][0][1] = dp[i-1][0][0] * 9 + dp[i-1][1][0] * (x - 1) + dp[i-1][0][1] * 1 + dp[i-1][1][1] * 1;
dp[i][1][1] = dp[i-1][1][0] * 1;
dp[i][0][2] = dp[i-1][0][1] * 9 + dp[i-1][1][1] * (x - 1) + dp[i-1][0][2] * 1 + dp[i-1][1][2] * 1;
dp[i][1][2] = dp[i-1][1][1] * 1;
dp[i][0][3] = dp[i-1][0][2] * 9 + dp[i-1][1][2] * (x - 1) + dp[i-1][0][3] * 1 + dp[i-1][1][3] * 1;
dp[i][1][3] = dp[i-1][1][2] * 1;
} else {
dp[i][0][0] = dp[i-1][0][0] * 1;
dp[i][1][0] = dp[i-1][1][0] * 1;
dp[i][0][1] = dp[i-1][0][0] * 9 + dp[i-1][0][1] * 1;
dp[i][1][1] = dp[i-1][1][1] * 1;
dp[i][0][2] = dp[i-1][0][1] * 9 + dp[i-1][0][2] * 1;
dp[i][1][2] = dp[i-1][1][2] * 1;
dp[i][0][3] = dp[i-1][0][2] * 9 + dp[i-1][0][3] * 1;
dp[i][1][3] = dp[i-1][1][3] * 1;
}
}
cout << dp[n.size()-1][0][k] + dp[n.size()-1][1][k] << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
vector<vector<int>> data(W, vector<int>(H));
for (int i = 0; i < N; ++i) {
int x, y, a;
cin >> x >> y >> a;
x--; y--;
if (1 == a) {
for (int j = 0; j < W; ++j) {
for (int k = 0; k < H; ++k) {
if (j <= x) {
data[j][k] = 1;
}
}
}
}
else if (2 == a) {
for (int j = 0; j < W; ++j) {
for (int k = 0; k < H; ++k) {
if (j > x) {
data[j][k] = 1;
}
}
}
}
else if (3 == a) {
for (int j = 0; j < W; ++j) {
for (int k = 0; k < H; ++k) {
if (k <= y) {
data[j][k] = 1;
}
}
}
}
else {
for (int j = 0; j < W; ++j) {
for (int k = 0; k < H; ++k) {
if (k > y) {
data[j][k] = 1;
}
}
}
}
}
int ans = 0;
for (int j = 0; j < W; ++j) {
for (int k = 0; k < H; ++k) {
if (0 == data[j][k]) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 59,279,911
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
vector<vector<int>> g;
vector<bool> visited;
int dfs(int v) {
int size = 1;
visited[v] = true;
for (int u: g[v])
if (!visited[u])
size += dfs(u);
return size;
}
void solve_test() {
int n, m;
cin >> n >> m;
g.resize(n);
for (int i = 0; i < n; i++) g[i].clear();
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
g[u].push_back(v);
g[v].push_back(u);
}
visited.resize(n);
for (int i = 0; i < n; i++) visited[i] = false;
vector<int> component_sizes;
for (int i = 0; i < n; i++)
if (!visited[i])
component_sizes.push_back(dfs(i));
cout << *max_element(component_sizes.begin(), component_sizes.end()) << '\n';
}
int32_t main() {
int T;
T = 1;
while (T--)
solve_test();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
float s, a, b, c;
cin>>s;
a = s/3;
s-=a;
b = s/2;
c = s-b;
cout<<fixed<<setprecision(6)<<(a*b*c)<<endl;
return 0;
}
| 0
| 73,944,502
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N;
cin >>N;
vector<ll>C(N-1);
vector<ll>S(N-1);
vector<ll>F(N-1);
rep(i,N-1){
cin>>C[i]>>S[i]>>F[i];
}
rep(i,N){
ll t=0;
rep3(j,i,N-1){
if(t<S[j]){
t=S[j];
}else if(t%F[j]!=0){
t += F[j]-t%F[j];
}
t+=C[j];
}
cout<<t<<endl;
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
static bool find(size_t pos,
const string& s,
const string& p) {
auto it = s.begin() + pos;
for (auto c : p) {
if (*it != c)
return false;
++it;
if (it == s.end())
it = s.begin();
}
return true;
}
int main() {
string s, p;
cin >> s >> p;
bool found = false;
for (size_t i = 0; i < s.length(); ++i) {
if (find(i, s, p)) {
found = true;
break;
}
}
if (found)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 0
| 39,256,467
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int i,a[n],d=0;
double s=0;
for(i=0;i<n;i++)
{
cin>>a[i];
s=s+a[i];
}
s=s/n;
s=round(s);
for(i=0;i<n;i++)
{
a[i]=a[i]-s;
d=d+a[i]*a[i];
}
cout<<d<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin>>n;
int* a = new int[n+1];
for(int i=1;i<n+1;i++)
{
cin>>a[i];
}
int ans =0;
for(int i=1;i<=n;i++)
{
if( a[ a[i] ]== i)
ans++;
}
cout<<ans/2;
}
| 0
| 12,571,199
|
#define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
bool isprime[1000000];
int main(int argc, char **argv){
int n;
int cnt;
int checkcnt = 0;
for (int i = 0; i < 1000000; i++) {
isprime[i] = true;
}
while (cin >> n && checkcnt < 30) {
cnt = 0;
int i;
for (i = 2; i <= sqrt(n); i++) {
if (isprime[i]) {
for (int j = 2; j <= n / i; j++) {
isprime[i * j] = false;
}
}
}
for (int k = 2; k <= n; k++) {
if (isprime[k]) {
cnt++;
}
}
cout << cnt << endl;
checkcnt++;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ return a < b && (a = b, true); }
int main () {
int n,sum = 100000000;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++){
cin >> w[i];
}
for (int i = 0; i < n-1; i++){
int sum1 = 0,sum2 = 0;
for (int j = 0; j <= i; j++){
sum1 += w[j];
}
for (int j = i+1; j < n; j++){
sum2 += w[j];
}
if (abs(sum1 - sum2) < sum){
sum = abs(sum1 - sum2);
}
}
cout << sum << '\n';
return 0;
}
| 0
| 43,896,494
|
#include<stdio.h>
int i,j,a,b,c[20],d[50001],min=2000000000;
int main(void)
{
scanf("%d %d",&a,&b);
for(i=0;i<b;i++){
scanf("%d",&c[i]);
}
for(j=0;j<=a;j++){
d[j]=min;
}
d[0]=0;
for(i=0;i<b;i++){
for(j=0;j<=a;j++){
if(d[j]!=min && j+c[i]<=a){
if(d[j]+1<d[j+c[i]]){
d[j+c[i]]=d[j]+1;
}
}
}
}
printf("%d\n",d[a]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
string str;
cin>>str;
int n=str.size();
int arr[n+1]={0};
for(int i=0;i<n;i++)
{
if(str[i]=='<'){
arr[i]=0;
int j=i+1;
int val=1;
while(str[j]==str[j-1]){
arr[j]=val;
val++;
j++;
}
i=j-1;
}
}
for(int i=n-1;i>=0;i--)
{
if(str[i]=='>'&&i!=0){
arr[i]=max(arr[i+1]+1,arr[i-1]+1);
}else if(str[i]=='>'&&i==0){
arr[i]=arr[i+1]+1;
}
}
if(str[n-1]=='<'){
arr[n]=arr[n-1]+1;
}
ll sum=0;
for(int i=0;i<=n;i++){
sum+=arr[i];
}
cout<<sum<<endl;
}
return 0;
}
| 0
| 88,523,398
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using ll = long long;
using namespace std;
ll n, a[100100], all, ans, save;
int main(){
cin >> n;
rep(i,n) cin >> a[i], all ^= a[i];
rep(i,n) a[i] &= ~all;
ll rank = 0;
rrep(i,60){
for (save = rank; save < n; save++) if (a[save] & (1ll<<i)) break;
if (save == n) continue;
if (save > rank) a[rank] ^= a[save];
rep(j,n) if (j != rank) if (a[j] & (1ll<<i)) a[j] ^= a[rank];
rank++;
}
rep(i,n) ans ^= a[i];
cout << ans * 2 + all << endl;
}
|
#include <stdio.h>
#include <set>
#include <iostream>
using namespace std;
typedef long long ll;
const int N=55;
ll ans[N];
void solve(){
ll k;
scanf("%lld",&k);
int n=50;
for(int i=1;i<=n;i++) ans[i]=n-1;
for(int i=1;i<=n;i++){
ll cnt=k/n;
if(i<=k%n) cnt++;
ans[i]+=cnt*n-(k-cnt);
}
printf("50\n");
for(int i=1;i<=n;i++) printf("%lld%c",ans[i],i==n?'\n':' ');
}
int fuck(){
int id=1;
for(int i=2;i<=50;i++){
if(ans[i]>ans[id]) id=i;
}
return id;
}
int main(){
solve();
}
| 0
| 72,335,499
|
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn = 1e6+10;
const ll inf = 1e14;
struct node{
ll x,y;
}r[1100];
bool cmp(node a,node b){
return atan2(a.y,a.x) < atan2(b.y,b.x);
}
int main(){
ll n,x,y;
cin >> n;
for(ll i = 0; i < n; i++){
cin >> r[i].x >> r[i].y;
}
ll ans = 0;
sort(r,r+n,cmp);
for(ll i = 0; i < n; i++){
x = r[i].x ; y = r[i].y;
ans = max(ans,x*x+y*y);
for(ll j = (i+1)%n; j != i; j = (j+1)%n){
x += r[j].x ; y += r[j].y;
ans = max(ans,x*x+y*y);
}
}
double ans1 = sqrt(ans);
printf("%.13lf\n",ans1);
return 0;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define setprecision sp
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vlld vector<lld>
#define vi vector<int>
#define vch vector<char>
#define sll set<ll>
#define sch set<ch>
#define vpll vector< pair<ll,ll> >
#define vpii vector< pair<int,int> >
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mll map<ll, ll>
#define mcll map<char,ll>
#define sz(container) ll((container).size())
#define fill(a,b) memset(a, b, sizeof(a))
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
lld pi=3.1415926535897932;
const ll MOD=1e9+7;
const ll dx[4]={-1, 0, 1, 0} , dy[4]={0, 1, 0, -1};
const ll dxx[8]={-1, -1, 0, 1, 1, 1, 0, -1} , dyy[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll lcm(ll a, ll b)
{
ll g=__gcd(a, b);
return a/g*b;
}
ll binpow(ll a, ll b,ll m)
{
a %= m;
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
bool isPrime(ll n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
unordered_map<ll,ll>cnt;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_io;
ll T=1;
For(i,1,T)
{
ll n,k;cin>>n>>k;
vll a(n),s(n+1,0);ll ans=0;
cnt[0]=1;
For(j,0,n-1)
{
cin>>a[j];a[j]--;
s[j+1]=s[j]+a[j];
s[j+1]%=k;
if(j+1>=k) cnt[s[j+1-k]]--;
ans+=cnt[s[j+1]];
cnt[s[j+1]]++;
}
cout<<ans;
}
}
| 0
| 75,941,573
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
main(){
int n;
cin >> n;
vector<int> a(n);
vector<bool> b(n), c(n);
for(int i=0;i<n;i++) cin >> a[i];
fill(b.begin(),b.end(),false);
fill(c.begin(),c.end(),false);
for(int i=0;i<n-1;i++){
if(a[i]<a[i+1]) b[i] = true;
if(a[i]>a[i+1]) c[i] = true;
c[n-1] = true;
}
int money = 1000;
int kabu = 0;
for(int i=0;i<n;i++){
if(c[i]){
money += a[i]*kabu;
kabu = 0;
}
if(b[i]){
kabu += money/a[i];
money %= a[i];
}
}
cout << money << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int n;
char k[2][9];
void init() {
scanf("%d", &n);
}
bool input() {
int i;
if (!n) return false;
n--;
scanf("%s", k[0]);
scanf("%s", k[1]);
return true;
}
int main() {
int i, j, a, num[2];
init();
while (input()) {
a = 1;
for (i = 0; i < 2; i++) {
num[i] = 0;
for (j = 0; j < strlen(k[i]); j++) {
switch (k[i][j]) {
case 'm':
num[i] += a * 1000;
a = 1;
break;
case 'c':
num[i] += a * 100;
a = 1;
break;
case 'x':
num[i] += a * 10;
a = 1;
break;
case 'i':
num[i] += a;
a = 1;
break;
default:
a = k[i][j] - '0';
break;
}
}
}
num[0] += num[1];
a = num[0] / 1000;
num[0] %= 1000;
if (a > 0) {
if (a > 1) {
printf("%d", a);
}
printf("m");
}
a = num[0] / 100;
num[0] %= 100;
if (a > 0) {
if (a > 1) {
printf("%d", a);
}
printf("c");
}
a = num[0] / 10;
num[0] %= 10;
if (a > 0) {
if (a > 1) {
printf("%d", a);
}
printf("x");
}
a = num[0];
if (a > 0) {
if (a > 1) {
printf("%d", a);
}
printf("i");
}
printf("\n");
}
return 0;
}
| 0
| 20,817,800
|
#include<iostream>
#include<cmath>
#define N 0.000001
using namespace std;
int main(){
double x1,y1,x2,y2,x3,y3,px,py;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>px>>py){
double s1=0,s2=0,s3=0,s=0,a=0,b=0,c=0,a1=0,b1=0,c1=0,a2=0,b2=0,c2=0,a3=0,b3=0,c3=0;
a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
b=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
c=sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));
s=(a+b+c)/2;
s=sqrt(s*(s-a)*(s-b)*(s-c));
a1=sqrt((px-x2)*(px-x2)+(py-y2)*(py-y2));
b1=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
c1=sqrt((x3-px)*(x3-px)+(y3-py)*(y3-py));
s1=(a1+b1+c1)/2;
s1=sqrt(s1*(s1-a1)*(s1-b1)*(s1-c1));
a2=sqrt((x1-px)*(x1-px)+(y1-py)*(y1-py));
b2=sqrt((px-x3)*(px-x3)+(py-y3)*(py-y3));
c2=sqrt((x3-x1)*(x3-x1)+(y3-y1)*(y3-y1));
s2=(a2+b2+c2)/2;
s2=sqrt(s2*(s2-a2)*(s2-b2)*(s2-c2));
a3=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
b3=sqrt((x2-px)*(x2-px)+(y2-py)*(y2-py));
c3=sqrt((px-x1)*(px-x1)+(py-y1)*(py-y1));
s3=(a3+b3+c3)/2;
s3=sqrt(s3*(s3-a3)*(s3-b3)*(s3-c3));
if((-N<s1 && s1<N) || (-N<s2 && s2<N) || (-N<s3 && s3<N) )cout<<"NO"<<endl;
else if((s1+s2+s3)>s-N && (s1+s2+s3)<s+N )cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
|
# 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 pr(x) prev(x.end())
# define mset multiset
# define umap unordered_map
# define gcd __gcd
# 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;
typedef pair<ll,ll> pll;
const int mod = 1e9+7;
const int N = 1e5+5;
void solve(){
ll a,b;
cin>>a>>b;
ll cnt=0;
while(a<=b){
a*=2;
cnt++;
}
cout<<cnt;
}
int main(){
Speed();
int T=1;
while(T--)
solve();
return 0;
}
| 0
| 71,800,052
|
#include <bits/stdc++.h>
using namespace std;
int N, L, Q;
int X[100005];
int dp[31][100005];
int trial(int a, int x) {
int cur = a;
for (int i = 30; i >= 0; i--) {
if (x & (1 << i)) {
cur = dp[i][cur];
}
}
return cur;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> X[i];
}
cin >> L >> Q;
for (int i = 1; i <= N; i++) {
dp[0][i] = upper_bound(X + 1, X + N + 1, X[i] + L) - X - 1;
}
for (int j = 1; j < 31; j++) {
for (int i = 1; i <= N; i++) {
dp[j][i] = dp[j - 1][dp[j - 1][i]];
}
}
for (int qi = 0; qi < Q; qi++) {
int a, b;
cin >> a >> b;
if (a > b) {
swap(a, b);
}
if (a == b) {
cout << 0 << "\n";
continue;
}
int lo = 1, hi = N;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (trial(a, mid) >= b) {
hi = mid;
} else {
lo = mid + 1;
}
}
cout << hi << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s, t;
int cnt;
int main() {
ios_base::sync_with_stdio(false);
cin >> s >> t;
cnt = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] != t[i]) cnt++;
}
cout << cnt;
}
| 0
| 68,995,174
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int x; cin >> x;
vector<bool> a(100001, false);
a[0] = true;
rep(i, 6){
int t = 100 + i;
rep(j, 100002){
if(j+t > 100000) break;
if(a[j]) a[j+t] = true;
}
}
pr(a[x]);
return 0;}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
int N, K;
vector<int> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
int ans = 0;
for (int l = 0; l <= K; l++) {
for (int r = 0; l + r <= K; r++) {
if (l + r > N) continue;
int d = max(0, K - l - r);
vector<int> tmp;
int now = 0;
for (int j = 0; j < l; j++) {
tmp.push_back(v[j]);
now += v[j];
}
for (int j = 0; j < r; j++) {
tmp.push_back(v[N - 1 - j]);
now += v[N - 1 - j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; j < d; j++) {
if (j >= tmp.size()) break;
if (tmp[j] > 0) break;
now -= tmp[j];
}
ans = max(ans, now);
}
}
cout << ans << endl;
}
| 0
| 1,819,680
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
int gcd(int x, int y)
{
int r;
while ((r = x % y) != 0)
{
x = y;
y = r;
}
return y;
}
int lcm(int x, int y)
{
return (x / gcd(x, y) * y);
}
int N, M;
int A[100001];
signed main()
{
cin >> N >> M;
REP(i, N) cin >> A[i];
int cur = 1;
for (int i = 0; i < N; i++)
{
cur = lcm(cur, A[i]);
}
int ans = (2 * M) / cur;
if (ans == 0)
{
ans = 0;
}
else if (ans % 2 == 0)
{
ans = ans / 2;
}
else
{
ans = ans / 2 + 1;
}
int target = cur / 2;
for (int i = 0; i < N; i++)
{
int a = (target - A[i] / 2);
if(a % A[i] != 0)
{
cout << 0 << endl;
return 0;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
const ll N_MAX = 2e5 + 5 ;
int count(ll x){
ll y = ( x*(x-1) )/2 ;
return y ;
}
int main(){
ll N ;
cin >> N ;
vector<int> A(N) ;
vector<ll> C(N_MAX) ;
for(int i = 0 ; i < N_MAX ; i++) C.at(i) = 0 ;
for(int i = 0 ; i < N ; i++){
cin >> A.at(i) ;
C.at(A.at(i))++ ;
}
ll MAX_ANS = 0 ;
for(int j = 1 ; j < N_MAX ; j++){
ll ANS = 0 ;
if(C.at(j) > 0){
ANS = C.at(j)*(C.at(j)-1)/2 ;
MAX_ANS += ANS ;
}
}
for(int i = 0 ; i < N ; i++){
C.at(A.at(i))-- ;
ll ans = 0 ;
ll T = 0 ;
ans = C.at(A.at(i)) ;
T += count(ans+1);
T -= count(ans) ;
cout << MAX_ANS - T << endl ;
C.at(A.at(i))++ ;
}
}
| 0
| 61,143,444
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, x; cin >> a >> b >> x;
bool ans = true;
if (a>x)
ans = false;
if (a+b<x)
ans = false;
cout << (ans ? "YES": "NO") << endl;
}
|
#include <iostream>
using namespace std;
#define MAX 100000+5
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
Node T[MAX];
int n, D[MAX];
void Print( int u );
int Rec( int u, int p );
int main() {
cin >> n;
for ( int i = 0; i < n; ++i ) T[i].parent = T[i].left = T[i].right = NIL;
int v, d, l;
for ( int i = 0; i < n; ++i ) {
cin >> v >> d;
int c;
for ( int j = 0; j < d; ++j ) {
cin >> c;
if ( 0 == j ) T[v].left = c;
else T[l].right = c;
l = c;
T[c].parent = v;
}
}
int r;
for ( int i = 0; i < n; ++i ) {
if ( T[i].parent == NIL ) {
r = i;
}
}
Rec( r, 0 );
for ( int i = 0; i < n; ++i ) Print( i );
return 0;
}
void Print( int u ) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if ( NIL == T[u].parent ) cout << "root, ";
else if ( NIL == T[u].left ) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
int flag = 0;
for ( int c = T[u].left; c != NIL; c = T[c].right ) {
if ( flag++ ) cout << ", ";
cout << c;
}
cout << "]\n";
}
int Rec( int u, int p ) {
D[u] = p;
if ( NIL != T[u].right ) Rec( T[u].right, p );
if ( NIL != T[u].left ) Rec( T[u].left, p+1 );
}
| 0
| 100,185,667
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
int main(void){
double M,N,MVote=0,tmpm=0;
cin >> N >> M;
tmpm = M;
vector<int> A(1010,0);
REP(i,N){
cin >> A[i];
MVote += A[i];
}
FOR(i,0,N){
if(A[i] >= MVote/(4*tmpm)) M--;
if(M <= 0){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h;
cin >> h;
vi a(h + 1);
rep(i, 1, h + 1) { cin >> a[i]; }
rep(i, 1, h + 1) {
cout << "node " << i << ": key = " << a[i] << ", ";
if (i / 2 > 0) { cout << "parent key = " << a[i / 2] << ", "; }
if (2 * i <= h) { cout << "left key = " << a[2 * i] << ", "; }
if (2 * i + 1 <= h) { cout << "right key = " << a[2 * i + 1] << ", "; }
cout << endl;
}
return 0;
}
| 0
| 81,749,347
|
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 45
#define NIL -1
int Memo[MAX];
int fibonacci(int n) {
if (n == 0 || n == 1)
return Memo[n] = 1;
if (Memo[n] != NIL)
return Memo[n];
return Memo[n] = fibonacci(n - 1) + fibonacci(n - 2);
}
int main() {
int n;
scanf("%d", &n);
fill_n(Memo, MAX, NIL);
printf("%d\n", fibonacci(n));
}
|
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \
P(v[i]);
#define printt(a, b) cout << a << " " << b << endl;
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int MOD = 1e9 + 7;
void solve()
{
string s;
cin >> s;
vi v(s.length() + 1, 0);
rep(i, s.length())
{
if (s[i] == '<')
{
v[i + 1] = max(v[i + 1], v[i] + 1);
}
}
for (int i = s.length() - 1; i >= 0; i--)
{
if (s[i] == '>')
{
v[i] = max(v[i], v[i + 1] + 1);
}
}
ll sum = 0;
rep(i, v.size())
{
sum += v[i];
}
P(sum);
}
int main()
{
solve();
return 0;
}
| 0
| 100,337,561
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, b1, a2, b2, a3, b3;
cin >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;
int town[4] = {};
town[a1 - 1]++, town[b1 - 1]++, town[a2 - 1]++, town[b2 - 1]++, town[a3 - 1]++, town[b3 - 1]++;
int one = 0, two = 0;
if (town[0] == 1) one++; if (town[0] == 2) two++;
if (town[1] == 1) one++; if (town[1] == 2) two++;
if (town[2] == 1) one++; if (town[2] == 2) two++;
if (town[3] == 1) one++; if (town[3] == 2) two++;
if (one == 2 && two == 2) cout << "YES" << endl; else cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll maxSubsetExor(vector<ll> A, ll X) {
const int N = A.size();
const int M = 62;
auto at = [&](const ll Ai, const int j) -> int {
return (Ai >> (M-j-1) & 1);
};
int s = 0;
REP(j, M) {
int p = -1;
for (int i = s; i < N; i++) if (at(A[i], j)) { p = i; break; }
if (p != -1) {
swap(A[s], A[p]);
for (int i = s+1; i < N; i++) if (at(A[i], j)) A[i] ^= A[s];
s++;
}
}
ll ans = X;
s = 0;
REP(j, M) {
if (at(ans, j) == 0 && at(A[s], j)) ans ^= A[s];
if (at(A[s], j)) s++;
}
return ans;
}
int main2() {
int N; cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i];
ll S = 0;
REP(i, N) S ^= A[i];
REP(i, N) A[i] &= ~S;
ll P = maxSubsetExor(A, 0);
ll Q = S ^ P;
cout << P + Q << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
}
| 0
| 91,408,535
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
string N;
int len, sum;
cin >> N;
len = N.length();
for (int i = 0; i < len; i++)
{
sum += N[i] - '0';
}
if (sum % 9 == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
|
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
string S;
cin>>S;
map<char, int> chrmap;
for(int i=0;i<S.size();++i){
chrmap[S[i]]++;
}
char ans = 'A';
for(char i='a';i<='z';++i){
if(chrmap[i]==0){
ans = i;
break;
}
}
if(ans=='A'){
bool can = false;
int index;
vector<char> arr;
char max;
for(int i=25;i>=1;--i){
if(S[i-1]<S[i]){
can = true;
index = i-1;
max = S[i-1];
arr.push_back(S[i]);
break;
}
else {
arr.push_back(S[i]);
}
}
if(can){
for(int i=0;i<index;++i){
cout<<S[i];
}
sort(arr.begin(), arr.end());
for(int i=0;i<arr.size();++i){
if(S[index]<arr[i]){
cout<<arr[i]<<endl;
break;
}
}
}
else cout<<-1<<endl;
}
else cout<<S+ans<<endl;
}
| 0
| 914,511
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef COMPETITIVE_PROGRAMMING_LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) if(0){}
#endif
int main () {
ios::sync_with_stdio(0); cin.tie(0);
ll n,m,cnt=0;
cin >> n >> m;
vector<ll> A(n);
for (auto& x : A) cin >> x;
ll sum = accumulate(A.begin(), A.end(), 0LL);
double limit = double(sum)/(4*m);
for (int i = 0; i < n; ++i) {
if (A[i] < limit) {
} else {
++cnt;
}
}
if (cnt >= m) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<fixed<<setprecision(n);
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sort(a) sort((a).begin(), (a).end());
#define uniq(a) SORT(a);(a).erase(unique((a).begin(), (a).end()), (a).end());
#define reverse(a) reverse((a).begin(), (a).end());
#define ctos(c) string(1, (c))
#define out(d) cout << (d);
#define outl(d) std::cout<<(d)<<"\n";
#define Yes() printf("Yes\n");
#define No() printf("No\n");
#define YES() printf("YES\n");
#define NO() printf("NO\n");
#define ceil(x, y) ((x + y - 1) / (y))
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << '\n'
#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){ cerr << #v << "[" << _ << "] : " << v[_] << '\n'; }
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
void solve() {
int a, b,c; cin >> a>>b>>c;
if (a <= c && c <= b) {
Yes()
} else {
No()
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
srand((unsigned)time(NULL));
fix(12)
solve();
}
| 0
| 36,017,975
|
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
int N;
cin >> N;
vector<int> C(N),S(N),F(N);
rep(i,N) cin >> C[i] >> S[i] >> F[i];
rep(i,N) {
ll ans = 0;
ll ct = 0;
for(int j=i; j<N-1; j++) {
if(ct <= S[j]) {
ct = S[j] + C[j];
}
else {
if((ct-S[j])%F[j] == 0) {
ct += C[j];
}
else {
ct = S[j] + (ct - S[j]) / F[j] * F[j] + F[j] + C[j];
}
}
}
cout << ct << endl;
}
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+1;
int main()
{
string s;
cin >> s;
ll k;
cin >> k;
ll n=s.length();
ll ans=1;
rep(i,min(n,k)){
ll num=(ll)(s[i]-'0');
if(num!=1){
ans=num;
break;
}
}
cout << ans << endl;
return 0;
}
| 0
| 15,811,268
|
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int h,w;
for(;;){
scanf("%d %d",&h,&w);
if(h==0 && w==0) break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int const MAX_N = 5005;
int const MAX_S = 5005;
bool dp[MAX_N][MAX_S];
int n,k;
vector<int> a;
bool need(int x) {
Fill(dp, false);
dp[0][0] = 1;
rep(i,n) {
rep(j,k) {
if(!dp[i][j]) continue;
dp[i+1][j] = 1;
if(i == x) continue;
if(j + a[i] < k) dp[i+1][j + a[i]] = 1;
}
}
bool ok = false;
rep(j,k) if(dp[n][j] && j + a[x] >= k) ok = true;
return ok;
}
int main()
{
cin >> n >> k;
a.resize(n);
rep(i,n) {
cin >> a[i];
chmin(a[i],k);
}
sort(a.begin(),a.end());
int l = -1, r = n;
while(r - l > 1) {
int mid = (l + r)/2;
if(need(mid)) r = mid;
else l = mid;
}
cout << r << endl;
return 0;
}
| 0
| 31,523,489
|
#include<bits/stdc++.h>
using namespace std;
int count2( int i );
int main( void )
{
int N;
cin >> N;
int max = -INT_MAX;
int count;
int maxi;
for( int i = 1; i <= N; i++ ) {
count = count2( i );
if( count > max ) {
max = count;
maxi = i;
}
}
cout << maxi << endl;
}
int count2( int i )
{
int count = 0;
while( 1 ) {
if( i % 2 == 0 ) {
count++;
i /= 2;
}
else
break;
}
return count;
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for (int i=0;i<(n);++i)
#define rep2(i, s, n) for (int i=s;i<(n);++i)
#define INF (1e9)
using Edge = pair<int,int>;
using Edges = vector<Edge>;
#define to first
#define cost second
void dfs(Edges G[], int u, char visited[], vector<int>& L)
{
visited[u] = 1;
for(auto v:G[u]) if(!visited[v.to]) dfs(G, v.to, visited, L);
L.insert(L.begin(), u);
}
void tsort(Edges G[], int V, vector<int>& L)
{
char visited[V];
memset(visited, 0, sizeof(visited));
rep(i,V) if(!visited[i]) dfs(G,i,visited,L);
}
int main()
{
int V,E; cin>>V>>E;
Edges G[V];
vector<int> L;
rep(i,E) {
int u,v; cin>>u>>v;
G[u].pb(Edge(v,1));
}
tsort(G,V,L);
for(auto e:L) cout << e << endl;
}
| 0
| 19,971,427
|
#include<iostream>
using namespace std;
int main () {
int x, y, z, count;
cin >> x >> y >> z;
for(;x <= y;x++){
if(z % x == 0)
count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S;
int N, a, b;
cin >> S;
N=S.size();
a=0;
b=0;
vector<string> T(N);
vector<string> U(N);
for (int i=0; i<N; i++) {
T[i]=S.at(i);
U[i]=S.at(N-1-i);
}
for (int j=0; j<N; j++) {
if (T[j]==U[j]) {
a=a+1;
}
}
vector<string> V((N-1)/2);
for (int k=0; k<(N-1)/2; k++) {
V[k]=S.at((N-3)/2-k);
}
for (int l=0; l<(N-1)/2; l++) {
if (T[l]==V[l]) {
b=b+1;
}
}
if (a==N && b==(N-1)/2) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0
| 7,028,562
|
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int s;
cin >> s;
int m = 1;
map<int,int> mp;
mp[s]++;
while(true) {
m++;
if (s % 2 == 0) s /= 2;
else s = 3 * s + 1;
if (mp[s]) break;
else mp[s]++;
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define __Imperial_Lord__ ONLINE_JUDGE
#define _cps CLOCKS_PER_SEC
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (long long)(l); i--)
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define high(x) __builtin_popcountll(x)
#define pb push_back
#define pf push_front
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c <<endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d <<endl
#define exec cerr<<"Time taken : "<<(ld)(clock())/_cps<<"s"<<endl
#define mod1 998244353
#define mod 1000000007
#define pi 3.1415926535897932384
using namespace std;
typedef vector<long long> vl;
typedef vector<long double> vld;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector< pair<long long, long long> > vp;
typedef vector<tuple<long long , long long , long long> > vtup;
typedef deque <long long> dql;
typedef deque <char> dqc;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=1e18;
template<typename T> istream& operator>>(istream& is, vector<T>& v)
{
for (auto& i : v)
is >> i;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v)
{
for (auto& i : v)
os << i << ' ';
return os;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll t=1;
while(t--)
{
ll a,b;
cin >> a >>b;
ll d=a*500;
if(d>=b) cout << "Yes" << endl;
else cout << "No" << endl;
}
exec;
}
| 0
| 68,043,483
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> ll llpow(ll x,T n){ll ans=1;if(x==0)ans=0;while(n){if(n&1)ans*=x;x*=x;n>>=1;}return ans;}
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;}
template<class T> inline T gcd(T x,T y){if(y==0)return x; else {return gcd(y,x%y);}}
template<class T> inline T lcm(T x,T y){return x/gcd(x,y)*y;}
long long modinv(long long a, long long m) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
#define irep(i, end_i, begin_i) for (ll i = (ll)begin_i-1; i >= (ll)end_i; i--)
long long INF = 1LL<<60;
int main( ){
ll N,M;
cin>>N>>M;
vll day(N),pay(N);
rep(i,0,N)cin>>day[i]>>pay[i];
using pll =pair<ll,ll>;
priority_queue<pll> q;
rep(i,0,N)q.emplace(pay[i],day[i]);
vb occpy(M+1,false);
set<ll> ok;
rep(i,0,M)ok.insert(i+1);
ll ans=0;
while(!q.empty()){
auto p=q.top(); q.pop();
if(ok.lower_bound(p.second)==ok.end())continue;
if(occpy[p.second]){
auto itr=ok.lower_bound(p.second);
ok.erase(*itr);
occpy[*itr]=true;
}
else{
occpy[p.second]=true;
ok.erase(p.second);
}
ans+=p.first;
}
cout<<ans<<endl;
return 0;
}
|
#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 <math.h>
#include <iomanip>
using namespace std;
#define int long long
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
int a,b;
for(int i = 1;i <= sqrt(n);i ++){
if(n % i == 0){
a = i;
b = n / i;
}
}
int ans = 0;
while(b > 0){
b /= 10;
ans ++;
}
cout << ans << endl;
}
| 0
| 77,865,147
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t[2],b[2];
cin >> t[0] >> t[1] >> b[0] >> b[1];
sort(t,t+2);
sort(b,b+2);
cout << t[0]+b[0];
return 0;
}
|
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <stack>
#include <queue>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using ld = long double;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(void)
{
ll N, i, A[100001], S[100001], judge[100001], ans=0;
cin >> N;
S[0] = 0;
for(i=1; i<=N; i++){
cin >> A[i];
}
sort(A+1, A+N+1);
for(i=1; i<=N; i++){
S[i] = S[i-1]+A[i];
}
for(i=1; i<=N-1; i++){
if(S[i]*2 < A[i+1]) judge[i] = 0;
else judge[i] = 1;
}
judge[N] = 1;
for(i=N; i>=1; i--){
if(judge[i]==1) ans++;
else break;
}
cout << ans << endl;
return 0;
}
| 0
| 74,867,692
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
using namespace std;
int Q;
bool judge(long long x, long long score) {
return x * (x + 1) > score;
}
long long bin_search(long long score, long long left, long long right) {
if (left + 2 > right) {
return judge(left, score)? left: right;
}
long long mid = (left + right) / 2;
if (judge(mid, score)) {
return bin_search(score, left, mid);
} else {
return bin_search(score, mid, right);
}
}
int main() {
cin >> Q;
for (int i = 0; i < Q; i++) {
int A, B;
cin >> A >> B;
long long ans = min(A, B) - 1, score = 1ll * A * B - 1;
long long x = bin_search(score, min(A, B) + 1, 1e9);
ans += x - min(A, B) - 1 + score / x;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define endl "\n"
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ROF(i, a, n) for (ll i = a; i >= n; i--)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x,val,sizeof(x))
#define dline cout<<"
typedef long long ll;
const ll MOD = 1e+9+7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 4e+5+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b;
cin>>a>>b;
if(((16-(2*min(a,b))+1)/2+min(a,b))>= max(a,b)){
cout<<"Yay!";
}
else{
cout<<":(";
}
return 0;
}
| 0
| 34,013,293
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
int N;
signed main()
{
cin >> N;
int ans = 0;
for(int i = 1; i <= N; i++)
{
for(int j = i; j <= N; j += i)ans += j;
}
cout << ans << endl;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 262144
int main() {
int h, w, d;
cin >> h >> w >> d;
string color = "RYGB";
for (int i = 0;i < h;++i) {
for (int q = 0;q < w;++q) {
int mask = 0;
mask |= (i + q) / d % 2;
mask |= ((h - 1 - (i - q)) / d % 2) << 1;
cout << color[mask];
}
cout << endl;
}
return 0;
}
| 0
| 23,825,045
|
#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) { return (a%b == 0) ? b : gcd(b, a%b); }
inline int fac(int n) { return (n==0) ? 1 : n * fac(n - 1); }
int main() {
ll n;
cin >> n;
cout << n*(n-1)/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
int main()
{
string s, t;
cin >> s >> t;
sort(all(s));
sort(all(t));
reverse(all(t));
if(s<t){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
| 0
| 60,004,078
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i, n) {
ll l, r;
cin >> l >> r;
r++;
ans += r - l;
}
out(ans);
re0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
ll ara[Max];
ll dp[Max];
ll n;
ll call(ll i)
{
if(ara[i] || i>n)return 0;
ll &ret=dp[i];
if(~ret)return ret;
ret=(call(i+1)+call(i+2))%Mod;
return ret;
}
int main()
{
fastread();
ll i,j,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=false;
string str;
cin>>n>>k;
memset(dp,-1,sizeof(dp));
for(i=0; i<k; i++)
{
cin>>a;
ara[a]=1;
}
ara[n+1]=1;
ara[n+2]=1;
dp[n]=1;
cout<<call(0)<<endl;
}
| 0
| 93,858,012
|
#include <bits/stdc++.h>
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ffor(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(i, n) ffor(i, 0, n)
#define All(obj) (obj).begin(), (obj).end()
#define INF ((ll)1e9 + 7)
#define c(a) cout << a << "\n";
using namespace std;
const int N = 100005;
int main()
{
speed;
cout << fixed << setprecision(6);
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
rep(i, n)
{
cin >> a[i];
sum += a[i];
}
int count = 0;
rep(i, n)
{
if (a[i] >= (double)sum / (4 * m))
count++;
if (count >= m)
break;
}
string res = count == m ? "Yes" : "No";
c(res);
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll n, m, p, y;
cin >> n >> m;
vector<P> a(m);
map<P, int> ump;
map<int, map<int, P> > mp;
for(int i = 0; i < m; ++i)
{
cin >> p >> y;
P ind = P(p, y);
a[i] = ind;
ump[ind] = i;
mp[p][y] = ind;
}
for(const auto& ip : mp)
{
int ind = 1;
for(const auto& im : ip.second)
{
a[ump[im.second]].second = ind;
ind++;
}
}
cout << setfill('0') << right;
for(const auto& city : a)
{
cout << setw(6) << city.first << setw(6) << city.second << endl;
}
}
int main()
{
fastio;
solve();
return 0;
}
| 0
| 21,020,340
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define MOD 1000000007
void solve(int test_case) {
int a,b,c;
cin>>a>>b>>c;
set<int> s;
s.insert(a);
s.insert(b);
s.insert(c);
cout<<s.size();
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
REP(i,1,t) {
solve(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cout << #x << ": " << (x) << endl
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define INF ((1 << 16)-1)
#define MOD (1000000007)
#define print(arr, n) REP(i, n) cout << arr[i] << " ";
int main() {
int N;
cin >> N;
int X[1024], Y[1024];
REP(i, N) {
cin >> X[i] >> Y[i];
}
REPN(i, 1, N){
if ( (abs(X[i]) + abs(Y[i])) % 2 != (abs(X[0]) + abs(Y[0])) % 2 ) {
cout << -1 << endl;
return 0;
}
}
int m = 31;
vector<ll> d;
REP_REV(i, m) d.push_back(1ll << i);
if ((X[0] + Y[0]) % 2 == 0) {
d.push_back(1);
m += 1;
}
cout << m << endl;
print(d, d.size());
puts("");
REP(j, N) {
ll x = X[j], y = Y[j];
string s = "";
REP(i, d.size()) {
if (abs(x) > abs(y)) {
if (x > 0) {s += "R"; x -= d[i];}
else {s += "L"; x += d[i];}
}
else {
if (y > 0){ s += "U"; y -= d[i];}
else { s += "D";y += d[i]; }
}
}
cout << s << endl;
}
}
| 0
| 30,798,948
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;++i)
int gcd(int a, int b){
if(a%b == 0){
return(b);
}
else return(gcd(b, a%b));
}
int main() {
ll n,x; cin >> n >> x;
vector<ll> co(n);
rep(i,n){
ll xi; cin >> xi;
co[i]=abs(xi-x);
}
ll m;
for(int i=0;i<n-1;i++){
m=gcd(co[i],co[i+1]);
co[i+1]=m;
}
cout << co[n-1] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
ll N;
vector<ll> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) cin >> A[i];
ll ans = 0;
for (int i = 0; i < 60; i++) {
ll cnt = 0;
for (int j = 0; j < N; j++) {
if (A[j] >> i & 1) cnt++;
}
ll pat = cnt * (N - cnt) % MOD;
for (int j = 0; j < i; j++) {
pat *= 2;
pat %= MOD;
}
ans += pat;
ans %= MOD;
}
cout << ans << endl;
}
| 0
| 96,200,589
|
#include <cstdint>
#include <cstdio>
#include <map>
#include <vector>
int main() {
size_t n;
int m;
scanf("%zu %d", &n, &m);
std::vector<int> a(n);
for (auto& ai: a) scanf("%d", &ai);
a.insert(a.begin(), 0);
for (size_t i = 1; i <= n; ++i)
a[i] = (a[i-1] + a[i]) % m;
std::map<int, intmax_t> count;
for (auto ai: a) ++count[ai];
intmax_t res = 0;
for (auto const& p: count) {
res += p.second * (p.second-1) / 2;
}
printf("%jd\n", res);
}
|
#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>
#define ALL(X) X.begin(), X.end()
using lint = long long;
template <typename T>
void print_container(std::vector<T> vec)
{
for (auto iter = vec.begin(); iter != vec.end(); ++iter)
{
std::cout << *iter << " ";
}
std::cout << std::endl;
}
int main()
{
lint n;
scanf("%lld", &n);
std::vector<lint> a(n);
for (int i = 0; i < n; ++i)
{
scanf("%lld", &a[i]);
}
std::vector<lint> cumsum(n + 1);
std::partial_sum(ALL(a), cumsum.begin());
cumsum[n] = 0;
std::sort(ALL(cumsum));
lint prev = 1e16;
lint stream = 0;
lint ans = 0;
for (auto num : cumsum)
{
if (num != prev)
{
ans += stream * (stream - 1) / 2;
stream = 1;
}
else
{
stream++;
}
prev = num;
}
ans += stream * (stream - 1) / 2;
std::cout << ans << "\n";
return 0;
}
| 0
| 48,344,220
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll dp[55][55][5000];
signed main(){
ll n; cin>>n;
vl vec(205);
rep(i,1,201){
ll j=i;
while(j<=200){
vec[j]+=1;
j+=i;
}
}
ll ans=0;
rep(i,1,n+1)ans+=(vec[i]==8 && i%2==1);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
const double EPS=(double)1e-9;
const double PI=(double)acos(-1.0);
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define FOR(i,n) for(int i=0;i<n;i++)
#define REPP(i,l,r,c) for(int i=l;i<=r;i+=c)
#define REP(i,l,r) REPP(i,l,r,1)
#define FORD(i,n) for(int i=n-1;i>=0;i--)
#define REVV(i,l,r,c) for(int i=l;i>=r;i-=c)
#define REV(i,l,r) REVV(i,l,r,1)
int irand(int lo, int hi){
return (((double)rand())/(RAND_MAX+1.0)) * (hi-lo+1) + lo;
}
string toString(ll x) {
stringstream ss;
ss << x;
return ss.str();
}
ll toNumber(string S) {
ll ret;
sscanf(S.c_str(),"%lld",&ret);
return ret;
}
const int INF=(int)2e9;
const ll MOD=(ll)1e9+7;
const int N = (int)1e5;
const int DEP = 17;
int dat[N+5];
int tab[N+5][DEP+1];
int main(){
int n; scanf("%d", &n);
REP(i,1,n) scanf("%d", dat+i);
dat[n+1] = (int)2e9 + 10;
int l; scanf("%d", &l);
for(int i=1,j=2; i<=n; i++){
for(; dat[j] - dat[i] <= l; j++);
tab[i][0] = j-1;
}
REP(j,1,DEP) REP(i,1,n) tab[i][j] = tab[ tab[i][j-1] ][j-1];
int q; scanf("%d", &q);
FOR(xxx,q){
int a,b; scanf("%d %d", &a, &b);
if(a > b) swap(a,b);
int res = 0;
REV(j,DEP,0) if(tab[a][j] < b){
res += 1 << j;
a = tab[a][j];
}
res += 1;
printf("%d\n", res);
}
return 0;
}
| 0
| 54,429,838
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
string s;
cin >> s;
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
int c = s[i] - '0';
if (c == i % 2) a++;
if (c != i % 2) b++;
}
cout << min(a, b) << '\n';
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define bil ((ll)1e9)
#define mod ((ll)1e9+7)
int main(int argc,char* argv[]){
ll n,k;
cin >> n >> k;
ll ans;
for(int i=0;i<n;i++){
if(i==0){
ans=k;
continue;
}
ans*=(k-1);
}
cout << ans << endl;
return 0;
}
| 0
| 11,553,344
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll n, m, k;
cin >> n >> m >> k;
bool flag = false;
for (ll i = 0; i <= n; i++) {
for (ll j = 0; j <= m; j++){
if ((m - j) * i + (n - i) * j == k) flag = true;
}
}
cout << (flag ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
};
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;}
vector<ll> fac(3000001);
vector<ll> ifac(3000001);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % mod;
x = x*x % mod;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b){
if(a == 0 && b == 0)return 1;
if(a < b || a < 0)return 0;
ll tmp = ifac[a-b]* ifac[b] % mod;
return tmp * fac[a] % mod;
}
int main() {
int x,y;
cin >> x >> y;
if((x+y)%3!=0){
cout << 0 << endl;
return 0;
}
int n=(x+y)/3;
x-=n;y-=n;
if(x<0||y<0){
cout << 0 << endl;
return 0;
}
fac[0] = 1;
ifac[0] = 1;
for(ll i = 0; i<3000000; i++){
fac[i+1] = fac[i]*(i+1) % mod;
ifac[i+1] = ifac[i]*mpow(i+1, mod-2) % mod;
}
cout << comb(n,x) << endl;
}
| 0
| 66,112,927
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
vector<ll> a(n+1);
vector<P> v;
for(int i=1;i<=n;i++){
cin>>a[i];
v.push_back(P(a[i],i));
}
sort(v.rbegin(),v.rend());
v.push_back(P(0,0));
vector<ll> res(n+1,0);
ll mi=v[0].second;
for(int i=0;i<n;i++){
mi=min(mi,v[i].second);
res[mi] += (i+1)*(v[i].first-v[i+1].first);
}
for(int i=1;i<=n;i++) cout<<res[i]<<endl;
}
|
#include <bits/stdc++.h>
#define IO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define endl '\n'
#define ll long long
#define f first
#define s second
#define mod 1000000007
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int M=1e5+5;
int main()
{
IO
int n;
ll a[M],m,sum[M]={},ans=0;
map<ll,int>mp;
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i];
sum[0]=a[0];
for(int i=1;i<n;i++) {
sum[i]=sum[i-1]+a[i];
}
for(int i=0;i<n;i++) {
ans+=(mp[sum[i]%m]);
mp[sum[i]%m]++;
}
cout<<ans+mp[0]<<endl;
return 0;
}
| 0
| 85,638,328
|
# include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin>>N;
long long A[N];
long long O[65];
for(long long i=0;i<65;i++){
O[i]=0;
}
for(long long i=0;i<N;i++){
cin>>A[i];
int count=0;
long long temp=A[i];
while(temp!=0){
O[count]+= temp%2;
temp/=2;
count++;
}
}
long long ans=0;
long long t=1;
for(long long i=0;i<63;i++){
ans=(ans+((t*O[i])%1000000007)*(N-O[i]))%1000000007;
t=(t*2)%1000000007;
}
cout<<ans<<endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
ll const MAX_N = 1000;
int main() {
INIT;
ll N;
cin >> N;
ll res = N;
rep(i, N + 1) {
ll cc = 0;
ll t = i;
while (t > 0) {
cc += t % 6;
t /= 6;
}
t = N - i;
while (t > 0) {
cc += t % 9;
t /= 9;
}
chmin(res, cc);
}
cout << res << endl;
return 0;
}
| 0
| 44,836,924
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n;
int a[300010],b[300010],c[300010],S[300010],T[300010],ans[300010];
void solve(){
cin >> n;
rep(i,n){
cin >> a[i];
b[a[i]]+=1;
}
rep(i,n+1){
c[b[i]]+=1;
}
rep(i,n){
S[i+1]+=S[i]+c[i+1];
T[i+1]+=T[i]+(i+1)*c[i+1];
}
vector<int> f;
f.push_back(n);
Rep(i,1,n+1){
f.push_back((T[max(0,i-1)]+i*(S[n]-S[max(0,i-1)]))/i);
}
int l=n;
Rep(k,1,n+1){
while(k>f[l]){
l--;
}
cout << l << endl;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int main() {
int n; cin >> n;
vector<int> T(n), X(n), Y(n);
loop(i,0,n) cin >> T[i] >> X[i] >> Y[i];
int prev_t = 0, prev_x = 0, prev_y = 0;
loop(i,0,n) {
int t = T[i] - prev_t;
int x = abs(X[i]-prev_x);
int y = abs(Y[i]-prev_y);
if (x+y > t) {
cout << "No" << endl;
return 0;
}
if ((x+y)%2 != t%2) {
cout << "No" << endl;
return 0;
}
prev_t = T[i];
prev_x = X[i];
prev_y = Y[i];
}
cout << "Yes" << endl;
return 0;
}
| 0
| 4,461,202
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll n;cin>>n;
ll a[100010],b[100010];
map<ll,ll> bcn;
rep(i,0,n){
cin>>a[i];
b[i]=a[i];
}
sort(b,b+n);
rep(i,0,n){
bcn[b[i]]=i;
}
ll an=0;
rep(i,0,n){
ll tmp=bcn[a[i]];
if((i+tmp)%2==1)an++;
}
cout<<an/2<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ld long double
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rloop(i,a,b) for(int i=a;i>=b;i--)
const int inf=1e9+7;
static bool compare(vector<int> v1,vector<int> v2)
{
return (v1[1]<v2[1] || (v1[1]==v2[1] && v1[0]<v2[0]));
}
bool isprime(ll x)
{
for(ll i=2;i*i<=x;i++)
{
if(x%i==0)
return false;
}
return true;
}
int numberOfSubarrays(vector<int>& nums, int k) {
int n=nums.size();
for(int i=0;i<n;i++)
{
if(nums[i]%2==1) nums[i]=1;
else nums[i]=0;
}
loop(i,0,n)
cout<<nums[i]<<" ";
cout<<endl;
vector<int> prsum(n);
prsum[0]=nums[0];
map<int,int> mp;
mp[prsum[0]]++;
for(int i=1;i<n;i++)
{
prsum[i]=prsum[i-1]+nums[i];
mp[prsum[i]]++;
}
loop(i,0,n)
cout<<prsum[i]<<" ";
cout<<endl;
int ans=0;
for(int i=prsum[n-1];i>=k;i--)
{
if(i!=k)
{
ans+=mp[i]*mp[i-k];
}
else
{
ans+=mp[i]*(mp[0]+1);
}
cout<<ans<<endl;
}
return ans;
}
int main()
{
ll n,k;
cin>>n>>k;
ll a[n+1];
loop(i,1,n+1)
{
cin>>a[i];
}
vector< vector<ll> > dp(n+1, vector<ll> (k+1,1));
loop(i,1,k+1)
{
if(a[1]>=i)
dp[1][i]=1;
else
dp[1][i]=0;
}
loop(i,2,n+1)
{
ll pre[k+1];
pre[0]=dp[i-1][0];
loop(j,1,k+1)
{
pre[j]=(dp[i-1][j]+pre[j-1])%inf;
if(j<=a[i])
dp[i][j]=pre[j];
else
dp[i][j]=(pre[j]-pre[j-a[i]-1]+inf)%inf;
}
}
cout<<dp[n][k]%inf;
return 0;
}
| 0
| 38,647,512
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
using Graph = vector<vector<ll>>;
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (r[x] > r[y]) swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
bool same(int x, int y) {
return root(x) == root(y);
}
ll size(int x) {
return -r[root(x)];
}
};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << setprecision(15) << fixed;
chrono::system_clock::time_point start,end;
start = chrono::system_clock::now();
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i,n) cin >> a[i];
UnionFind UF(n);
rep(i,m) {
ll x, y;
cin >> x >> y;
UF.unite(x-1,y-1);
}
ll ans = 0;
rep(i,n) {
if (UF.same(a[i]-1, i)) ++ans;
}
cout << ans << '\n';
end = chrono::system_clock::now();
auto elapsed = chrono::duration_cast< chrono::milliseconds >(end - start).count();
cerr << elapsed << "ms" << '\n';
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n, x;
cin >> n >> x;
int ans = -1;
rep(i, 0, n) {
int pos;
cin >> pos;
int len = abs(x - pos);
if (ans < 0) {
ans = len;
} else {
ans = gcd(ans, len);
}
}
cout << ans << endl;
return 0;
}
| 0
| 81,216,992
|
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
map<int,int> ma;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
ma[a]++;
if(ma[a]>=2)
{
cout<<"NO"<<"\n";
return 0;
}
}
cout<<"YES"<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i,size) cin >> arr[i];
#define int long long
int x_flip[] = {0,1,0,1};
int y_flip[] = {0,0,1,1};
signed main(){
int x, y; cin >> x >> y;
int ans = INT_MAX;
rep(i, 4){
int tx = x_flip[i] ? -x : x;
int ty = y_flip[i] ? -y : y;
int btn = ty - tx + x_flip[i] + y_flip[i];
if(btn > 0) ans = min(ans, btn);
}
cout << ans << endl;
return 0;
}
| 0
| 83,919,319
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int ln,s=0,i;
char a[1009];
while(1)
{
cin>>a;
ln=strlen(a);
if(ln==1&&a[0]=='0')
break;
for(i=0;i<ln;i++)
s+= a[i]-'0';
cout<<s<<endl;
s=0;
}
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
const ll INF = 1LL << 60;
const int inf = 1 << 20;
int n, m, x, y, q, d,z, w = 0, sum, ans = 0;
vector<int>a;
const int MAX = 510000;
const int MOD = 1000000007;
int main(void) {
cin >> n; int a[51][26]; string s;
Fill(a, 0);
rep(i, n) {
cin >> s;
rep(j, s.size()) {
a[i][s[j] - 'a']++;
}
}s = "";
for (char c = 'a'; c <= 'z'; c++) {
m = c - 'a'; w = inf;
rep(j, n) {
w = min(w, a[j][m]);
}
rep(j, w) s = s + c;
}cout << s << endl;
}
| 0
| 49,643,720
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
using namespace std;
int main() {
int n, a[100000];
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
double r = a[n - 1] / 2.0;
int mini = 1000000001, ans = 0;
for(int i = 0; i < n - 1; i++) {
if(mini > abs(r - a[i])) {
mini = abs(r - a[i]);
ans = a[i];
}
}
cout << a[n - 1] << " " << ans << 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()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int n, a[10005], b[10005];
cin >> n;
for(int i = 0; i < n; ++i) cin >> a[i];
for(int i = 0; i < n; ++i) cin >> b[i];
ll x = 0, y = 0;
for(int i = 0; i < n; ++i){
if(a[i] > b[i]){
x += a[i] - b[i];
}else{
y += (b[i] - a[i]) / 2;
}
}
if(x <= y){
cout << "Yes" << "\n";
}else{
cout << "No" << "\n";
}
return 0;
}
| 0
| 29,465,318
|
#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main(){
double a,b,c,d,s,L,h;
cin>>a>>b>>c;
s=0.5*a*b*sin(c*M_PI/180);
printf("%.10f\n",s);
h=2*s/a;
d=sqrt(a*a+b*b-2*a*b*cos(c*M_PI/180));
L=a+b+d;
printf("%.10f\n",L);
printf("%.10f\n",h);
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
double ans=0;
while(t--)
{
double n;
string s;
cin>>n>>s;
if(s =="BTC")
{
ans+= ((380000)*n);
}
else
ans+=n;
}
cout<<ans<<endl;
}
| 0
| 18,692,143
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
ll mod_pow(ll, ll, ll);
ll mod_fact(ll, ll);
ll mod_inv(ll, ll);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
int h, w;
cin >> h >> w;
vector<vector<bool>> map(h + 2, vector<bool>(w + 2));
for(int i = 0; i < h; i++){
string s;
cin >> s;
for(int j = 0; j < w; j++){
if(s[j] == '.'){
map[i + 1][j + 1] = true;
}
}
}
vector<vector<int>> dis(h + 2, vector<int>(w + 2));
queue<pair<int, int>> que;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
if(!map[i][j]) que.push(make_pair(i, j));
}
}
while(!que.empty()){
auto p = que.front();
int x = p.first;
int y = p.second;
que.pop();
for(int i = 0; i < 4; i++){
int cx = x + dx[i];
int cy = y + dy[i];
if(!map[cx][cy] || dis[cx][cy]){
continue;
}
dis[cx][cy] = dis[x][y] + 1;
que.push(make_pair(cx, cy));
}
}
int mx = 0;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
mx = max(mx, dis[i][j]);
}
}
cout << mx;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
ll fn(ll n, ll p) { return n - n % p; }
int main() {
ll k;
cin >> k;
vector<ll> a(k);
for(int i = 0; i < k; i++) {
cin >> a[i];
}
ll ans1, ans2;
ll l = 0, r = LLONG_MAX / 2;
while(l + 1 < r) {
ll m = (l + r) / 2;
ll mc = m;
for(int i = 0; i < k; i++) {
mc = fn(mc, a[i]);
}
if(mc <= 2) {
l = m;
} else {
r = m;
}
}
ans1 = l;
l = 0, r = LLONG_MAX / 2;
while(l + 1 < r) {
ll m = (l + r) / 2;
ll mc = m;
for(int i = 0; i < k; i++) {
mc = fn(mc, a[i]);
}
if(mc >= 2) {
r = m;
} else {
l = m;
}
}
ans2 = r;
if(ans1 >= ans2) {
cout << ans2 << " " << ans1 << endl;
} else {
cout << -1 << endl;
}
}
| 0
| 85,753,367
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i,n) for (ll i=(ll)n-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX6 1001001
#define MAX7 10010010
#define SENTINEL 2000000000
#define INF 1<<30
#define INFTY 1LL<<60
#define MAX_INT INT_MAX
#define Endl '\n'
#define CLR(mat) memset(mat, 0, sizeof(mat))
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
const int MOD = 1000000007;
inline ll mod_add(ll a,ll b){return (a+b)%MOD;}
inline ll mod_sub(ll a,ll b){return (a+MOD-b)%MOD;}
inline ll mod_mul(ll a,ll b){return ((a%MOD)*(b%MOD))%MOD;}
inline ll mod_pow(ll x,ll n,ll mod=(ll)MOD){ll res=1;while(n>0){
if(n&1)res=res*x%mod;
x=x*x%mod;n>>=1;}return res;}
inline ll mod_inv(ll x){return mod_pow(x,MOD-2);}
inline ll mod_div(ll a, ll b){return mod_mul(a,mod_inv(b));}
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
int main(){
int n,m;cin>>n>>m;
VI p(n);
UnionFind tree(n);
rep(i,n)cin>>p[i],p[i]--;
rep(i,m){
int x,y;cin>>x>>y;
x--;y--;
tree.merge(x,y);
}
int ans=0;
rep(i,n){
if(tree.issame(p[i],i))ans++;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int alphabet[('z' - 'a' + 1)];
int main() {
string S;
cin >> S;
if(S.size() < 26) {
for(auto &p : S) ++alphabet[p - 'a'];
for(int i = 0; i < 'z' - 'a' + 1; ++i) {
if(!alphabet[i]) {
cout << (S + (char)(i + 'a')) << endl;
return 0;
}
}
}
int i = S.size()-1;
while(i-1 >= 0 && S[i-1] > S[i]) --i;
if(i == 0) {
cout << -1 << endl;
}
else {
char ch = 'z';
for(int j = S.size()-1; j >= i; --j) {
if(S[j] > S[i-1]) {
ch = min(ch, S[j]);
}
}
cout << (S.substr(0, i-1) + ch) << endl;
}
return 0;
}
| 0
| 87,958,734
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<pair<int, int>> a(n);
rep(i, n)
{
int ai;
cin >> ai;
a[i] = make_pair(ai, i);
}
sort(a.begin(), a.end());
for (auto i : a)
{
cout << i.second + 1;
if (i.first != n)
cout << " ";
}
cout << endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int mo = 1e9 + 7;
typedef long long ll;
ll mx(ll x,ll y,ll z){return max(max(x,y),z);}
ll mn(ll x,ll y,ll z){return min(min(x,y),z);}
ll h,w;
void solve()
{
ll x,y;
cin>>x>>y;
ll i,ans=min(x,y);
if(x%3==0||y%3==0)ans=0;
else
{
for(i=1;i<x;i++)ans=min(mx(i*y,(x-i)*(y/2),(x-i)*((y+1)/2))-mn(i*y,(x-i)*(y/2),(x-i)*((y+1)/2)),ans);
swap(x,y);
for(i=1;i<x;i++)ans=min(mx(i*y,(x-i)*(y/2),(x-i)*((y+1)/2))-mn(i*y,(x-i)*(y/2),(x-i)*((y+1)/2)),ans);
}
cout<<ans<<endl;
}
main()
{
cin.tie(0);
ios::sync_with_stdio(0);
solve();
return 0;
}
| 0
| 53,633,859
|
#include <bits/stdc++.h>
using namespace std;
#define rrep(i,j,n) for(int i = (int)(j); i < (int)(n); i++)
int main() {
int n; cin >> n;
rrep(i,1,1000001) {
if(n==1||n==2||n==4) {
cout << i+3 << endl;
return 0;
}
if(n%2==0) n=n/2;
else n=n*3+1;
}
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 100005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define endl "\n"
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
void test_case() {
int n;
cin>>n;
vec arr(n);
rep(i,n) {
cin>>arr[i];
}
int ans = INT_MAX;
for(int i=0; i<=100; i++) {
int j=0;
for(auto it : arr) {
j+= (it-i) * (it - i);
}
ans = min(ans, j);
}
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while(t--)
{
test_case();
}
}
| 0
| 38,786,676
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b){ return a ? GCD(b % a, a) : b; }
int main(){
string s;
cin>>s;
int ans = 0;
for(int i=s.size()-1; i>0; i--){
for(int j=1; j<=i/2; j++){
if(i%j || (i/j)%2) continue;
bool ok=true;
for(int k=0; k+j<=i; k+=j){
if(s.substr(0,j)!=s.substr(k,j)) ok=false;
}
if(ok){
ans=max(ans,i);
}
}
}
cout<<ans<<endl;
}
|
#include<iostream>
using namespace std;
int count(long long n){
int cnt=0;
while(n>0){
n/=10;
cnt++;
}
return cnt;
}
int main(){
long long n;
long long b;
int cur=0;
int ans=100000;
cin>>n;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
b=n/i;
cur=max(count(i),count(b));
if(ans>cur)ans=cur;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 90,802,854
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const int mx=100010;
const ll mod=1e9+7;
int main(){
int n,m;
cin >> n >> m;
ll ans = n*(n-1)/2 + m*(m-1)/2;
cout << ans << ln;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main () {
string s;
cin >> s;
for (int i = 0; i < int(s.size()); ++i) {
if (s[i] == '1')
cout << '9';
else if (s[i] == '9')
cout << '1';
else
cout << s[i];
}
cout << '\n';
}
| 0
| 84,055,669
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
string s,t;
cin>>s>>t;
for(int i=0;i<s.size();i++){
bool k=true;
for(int j=0;j<s.size();j++)if(s[j]!=t[(i+j)%s.size()]){
k=false;
break;
}
if(k){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
}
|
#include <set>
#include <string>
#include <iostream>
using namespace std;
int const none_s = 0;
int const left_s = 1;
int const right_s = 2;
int main()
{
set<char> const left = {
'q', 'w', 'e', 'r', 't',
'a', 's', 'd', 'f', 'g',
'z', 'x', 'c', 'v', 'b'
};
set<char> const right = {
'y', 'u', 'i', 'o', 'p',
'h', 'j', 'k', 'l',
'n', 'm'
};
string s;
while( cin >> s ) {
if ( s == "#" ) {
break;
}
int status = none_s;
int times = 0;
for( const char c : s ) {
if ( left.find( c ) != left.end() ) {
if ( status == right_s ) { ++times; }
status = left_s;
} else if ( right.find( c ) != right.end() ) {
if ( status == left_s ) { ++times; }
status = right_s;
}
}
cout << times << endl;
}
}
| 0
| 57,225,657
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
string s, t;
cin >> s >> t;
vector<char> S;
rep(i,s.size()) S.push_back(s[i]);
sort(S.begin(), S.end());
string ss = "";
rep(i,S.size()) ss += S[i];
vector<char> T;
rep(i,t.size()) T.push_back(t[i]);
sort(T.begin(), T.end());
reverse(T.begin(), T.end());
string tt = "";
rep(i,T.size()) tt += T[i];
if (ss < tt) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> a(n+1);
for (int i = 0; i <= n; ++i) cin >> a[i];
vector<long long> s(n + 1);
s[n] = a[n];
for (int i = n - 1; i >= 0; --i)
{
s[i] = s[i + 1] + a[i];
}
vector<long long> b(n+1);
b[0] = 1 - a[0];
b[n] = 0;
if (b[0] < 0)
{
cout << -1 << endl;
return 0;
}
if (n == 0 && a[0] == 1)
{
if (a[1] == 0)
{
cout << 1 << endl;
return 0;
}
else
{
cout << -1 << endl;
return 0;
}
}
for (int i = 1; i < n; ++i)
{
b[i] = (std::min)(2 * b[i - 1] - a[i], s[i + 1]);
if (b[i] < b[i - 1] - a[i])
{
cout << -1 << endl;
return 0;
}
}
if (a[n] > 2 * b[n - 1] || a[n] < b[n - 1])
{
cout << -1 << endl;
return 0;
}
long long ans = 0;
for (int i = 0; i < n + 1; ++i)
{
ans += a[i] + b[i];
}
cout << ans << endl;
return 0;
}
| 0
| 63,844,409
|
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m,a,x,y,c=-2000,d=INT_MAX,e=0;
cin>>n>>m>>x>>y;
for(int i=1;i<=n;i++){
cin>>a;c=max(a,c);
}c=max(c,x);
for(int i=1;i<=m;i++){
cin>>a;
d=min(a,d);
e=max(e,a);
}d=min(y,d);
if(d<=y&&d>c)cout<<"No War\n";
else cout<<"War\n";
}
|
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for (ll i = m ; i < (ll)n ; ++i)
#define INF (ll)2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<ll> abSum(N);
REP(i, N) {
cin >> A[i] >> B[i];
abSum[i] = A[i] + B[i];
}
sort(ALL(abSum));
reverse(ALL(abSum));
ll ans = 0;
REP(i, N) {
if (IsEven(i)) {
ans += abSum[i];
}
}
ans -= accumulate(B.begin(), B.end(), (ll)0);
cout << ans << endl;
return 0;
}
| 0
| 19,319,184
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int a[N][N];
int main()
{
int t,n,m;
cin>>n;
int flag=0;
for(int i=0;i<=n/4;i++)
{
m=n;
m-=4*i;
if(!m)flag=1;
for(int j=0;j<=m/7;j++)
{
t=m;
t-=7*j;
if(!t)flag=1;
}
}
if(flag)cout<<"Yes";
else cout<<"No";
return 0;
}
|
#include <iostream>
#include <cmath>
namespace Geometry {
using Float = long double;
using Real = long long;
constexpr Float eps = 1e-9;
namespace Plane {
struct Vec {
Real x, y;
constexpr Vec() : x(0), y(0) {}
constexpr Vec(Real k) : x(k), y(k) {}
constexpr Vec(Real x, Real y) : x(x), y(y) {}
static constexpr Real dot(Vec v, Vec w) { return v.x*w.x + v.y*w.y; }
static constexpr Real cross(Vec v, Vec w) { return v.x*w.y - v.y*w.x; }
constexpr Real norm2() const { return x*x+y*y; }
Float norm() const { return std::sqrt(x*x+y*y); }
Float arg() const { return std::atan2(x, y); }
constexpr Vec& operator+=(Vec const& v) { x += v.x; y += v.y; return *this; }
constexpr Vec& operator-=(Vec const& v) { x -= v.x; y -= v.y; return *this; }
constexpr Vec& operator*=(Real const& k) { x *= k; y *= k; return *this; }
constexpr Vec& operator*=(Vec const& v) { x *= v.x; y *= v.y; return *this; }
constexpr Vec operator-() const { return Vec(-x, -y); }
friend constexpr Vec operator+(Vec const& v, Vec const& w) { return Vec(v) += w; }
friend constexpr Vec operator-(Vec const& v, Vec const& w) { return Vec(v) -= w; }
friend constexpr Vec operator*(Real const& k, Vec const& v) { return Vec(v) *= k; }
friend constexpr Vec operator*(Vec const& v, Vec const& w) { return Vec(v) *= w; }
constexpr int ort() const {
if( x>0 && !(y<0)) return 1;
if(!(x>0) && y>0 ) return 2;
if( x<0 && !(y>0)) return 3;
if(!(x<0) && y<0 ) return 4;
return 0;
}
friend constexpr bool operator<(Vec const& a, Vec const& b) {
int ao = a.ort() , bo = b.ort();
if(ao != bo) return ao < bo;
return 0 < cross(a, b);
}
friend std::istream& operator>>(std::istream& is, Vec& v) noexcept { is >> v.x >> v.y; return is; }
friend std::ostream& operator<<(std::ostream& os, Vec const& v) noexcept { os << '(' << v.x << ',' << v.y << ')'; return os; }
};
}
}
using Geometry::Plane::Vec;
#include <iomanip>
#include <algorithm>
#include <vector>
signed main() {
using namespace std;
int n;
cin >> n;
vector<Vec> v(n);
for(int i=0; i<n; ++i) cin >> v[i];
sort(v.begin(), v.end());
Vec ans{};
for(int l=0; l<n; ++l) {
Vec now{};
for(int r=l, i=0; i<n; ++r, ++i) {
now += v[r %= n];
if(ans.norm2() < now.norm2()) ans = now;
}
}
cout << fixed << setprecision(15) << ans.norm() << endl;
return 0;
}
| 0
| 40,927,726
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.