code1
stringlengths 54
12k
| code2
stringlengths 71
12k
| similar
int64 0
1
| __index_level_0__
int64 0
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#define maxn 200010
using namespace std;
int f[maxn],cnt[maxn];
int getf(int u){
return f[u]==u?u:f[u]=getf(f[u]);
}
void merge(int u,int v){
int f1,f2;
f1=getf(u),f2=getf(v);
if(f1!=f2)f[f2]=f1;
}
int main(){
int n,m,i,u,v,mx=0;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)f[i]=i;
for(i=1;i<=m;i++)scanf("%d%d",&u,&v),merge(u,v);
for(i=1;i<=n;i++)cnt[getf(i)]++;
for(i=1;i<=n;i++)mx=max(mx,cnt[i]);
printf("%d\n",mx);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#define doubled( x ) (x * x)
int digit_count(int num);
using namespace std;
int main()
{
int N; cin >> N;
vector<int> data(3);
for(int i = 0; i < N; i++)
{
for(int j = 0; j < 3; j++)
{
cin >> data[j];
}
sort(data.begin(), data.end());
if( ( doubled(data[0]) + doubled(data[1]) ) == doubled(data[2]) )cout << "YES";
else cout << "NO";
cout << endl;
}
return 0;
}
int digit_count(int num)
{
if( num < 0 )num *= (-1);
int count = 0;
for(int i = 10; num != 0; i *= 10)
{
int diff = num % i;
num -= diff;
count++;
}
return count;
}
| 0
| 26,426,837
|
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return false;}return true;}
int get_adp(double x, int n){return (int)round((x-(int)x)*pow(10,n))%10;}
int64_t sigma(int64_t s, int64_t n){return n*(2*s+n-1)/2;}
int main()
{
int n, sum_all = 0;
cin >> n;
vector<int> a(n + 2);
vector<int> a_diff(n + 1);
a[0] = 0;
a[n + 1] = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i + 1];
a_diff[i] = abs(a[i + 1] - a[i]);
sum_all += a_diff[i];
}
a_diff[n] = abs(a[n + 1] - a[n]);
sum_all += a_diff[n];
for (int i = 0; i < n; i++)
cout << sum_all - a_diff[i] - a_diff[i + 1] + abs(a[i] - a[i + 2]) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s.at(i);
ll res = 0;
rep(i,n){
rep(j,s.at(i).size()-1){
if(s.at(i).at(j)=='A' && s.at(i).at(j+1)=='B') res++;
}
}
ll p1=0,p2=0,p3=0;
rep(i,n){
if(s.at(i).at(0)=='B' && s.at(i).at(s.at(i).size()-1)=='A'){
p1++;
}else if(s.at(i).at(0)=='B' && s.at(i).at(s.at(i).size()-1)!='A'){
p2++;
}else if(s.at(i).at(0)!='B' && s.at(i).at(s.at(i).size()-1)=='A'){
p3++;
}
}
if(p1>0 && p2==0 && p3==0){
res += p1-1;
}else{
res += p1 + min(p2,p3);
}
cout << res << endl;
}
| 0
| 80,532,782
|
#include <bits/stdc++.h>
using namespace std;
const int N = 330000;
int a[N];
vector<int> dp[N];
void insert(vector<int> &lhs, const vector<int> &rhs) {
for (int x : rhs) lhs.push_back(x);
sort(lhs.begin(), lhs.end());
reverse(lhs.begin(), lhs.end());
lhs.resize(2);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n; int m = 1 << n;
for (int i = 0; i < m; i++) cin >> a[i];
for (int i = 0; i < m; i++) dp[i].push_back(a[i]);
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (j & (1 << i)) insert(dp[j], dp[j ^ (1 << i)]);
int ans = 0;
for (int i = 1; i < m; i++) {
ans = max(ans, dp[i][0] + dp[i][1]);
cout << ans << "\n";
}
return 0;
}
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v<< ": " << v <<endl;
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
int main(){
ll n, m; cin >> n >> m;
vll a(n);
rep(i, 0, n){
cin >> a[i];
}
priority_queue<ll> r;
rep(i, 0, n){
r.push(a[i]);
}
rep(i, 0, m){
ll x = r.top();
r.pop();
x /= 2;
r.push(x);
}
ll c = 0;
while(!r.empty()){
ll v = r.top(); r.pop();
c += v;
}
prtl(c);
}
| 0
| 87,194,819
|
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
#include <stdlib.h>
#include <time.h>
#include <string>
const int MAX_N = 350;
int N;
std::string S[MAX_N];
bool is_good[MAX_N][MAX_N];
bool calc_is_good(int i, int j) {
for (int k = 0; k < N; k++) {
if (S[(i + k) % N][j] != S[i][(j + k) % N]) {
return false;
}
}
return true;
}
int main(int argc, char **argv) {
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
is_good[i][j] = calc_is_good(i, j);
}
}
int ret = 0;
for (int i = 0; i < N; i++) {
bool is_all_good = true;
for (int k = 0; k < N; k++) {
if (!is_good[k][(i + k) % N]) {
is_all_good = false;
break;
}
}
if (is_all_good) {
ret += N;
}
}
std::cout << ret << std::endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
int main()
{
for(int a, b, n; cin >> a >> b >> n; )
{
vector<vint> board(a, vint(b, true)), dp(a, vint(b, 0));
rep(i, n)
{
int x, y;
cin >> x >> y;
board[x-1][y-1] = false;
}
dp[0][0] = 1;
rep(x, a) rep(y, b)
{
if(0 < x && board[x-1][y]) dp[x][y] += dp[x-1][y];
if(0 < y && board[x][y-1]) dp[x][y] += dp[x][y-1];
}
cout << dp[a-1][b-1] << endl;
}
}
| 0
| 19,768,918
|
#include <iostream>
using namespace std;
int main (){
long long n,m=1000,s=0;
cin >> n;
int a[n];
for (int i=0;i<n;i++) cin >> a[i];
for (int i=0;i<n-1;i++) {
if (a[i]<a[i+1]) {
long long t=m/a[i];
s+=t;
m-=t*a[i];
}
if (a[i]>a[i+1]) {
m+=s*a[i];
s=0;
}
}
m+=s*a[n-1];
s=0;
cout << m << endl;
}
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int s,k=0;
cin>>s;
vector<int> v;
v.push_back(s);
map<int,int> mp;
mp[s]=1;
while(1){
if(v[k]%2==0){
v.push_back(v[k]/2);
k++;
}
else{
v.push_back((3*v[k])+1);
k++;
}
if(mp[v[k]]!=0){
break;
}
else{
mp[v[k]]=1;
}
}
cout<<(k+1);
}
int main()
{
cool;
int t;
t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 50,936,512
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
ll N; int X, M; cin>>N>>X>>M;
int mn = min(N, (ll)M);
set<ll> S;
vector<ll> A;
ll a = X;
ll ans = 0;
rp(_i, 0, mn){
if(S.find(a) != S.end()) break;
S.insert(a);
A.push_back(a);
ans += a;
a = a*a % M;
if(a == 0){ cout<< ans <<endl; return 0; }
}
if((int)A.size() >= mn){ cout<< ans <<endl; return 0; }
int st_len = 0;
while(st_len < (int)A.size() && a != A[st_len]) st_len += 1;
int cyc_len = A.size() - st_len;
int ed_len = (N - st_len) % cyc_len;
ll st = 0; rp(i, 0, st_len) st += A[i];
ll cyc_sum = 0; rp(i, st_len, A.size()) cyc_sum += A[i];
ll cyc_num = (N - st_len) / cyc_len;
ll ed = 0; rp(i, st_len, st_len + ed_len) ed += A[i];
cout<< st + cyc_sum * cyc_num + ed <<endl;
}
|
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
template<typename Type> inline void chmin(Type& a, Type b) { if (a > b) a = b; }
template<typename Type> inline void chmax(Type& a, Type b) { if (a < b) a = b; }
template<typename Arr, typename Type> inline void fill(Arr& arr, Type v) { std::fill(arr.begin(), arr.end(), v); }
template<typename Type> inline void sort(Type& arr) { std::sort(arr.begin(), arr.end()); }
template<typename Type> inline Type nth(vector<Type>& arr, size_t pos) { std::nth_element(arr.begin(), arr.begin() + pos, arr.end()); return arr[pos]; }
constexpr double BIGP = 1000000007L;
constexpr double INF_I = std::numeric_limits<double>::max();
constexpr double INF_F = std::numeric_limits<float>::infinity();
constexpr double PI = 3.14159265358979323846L;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> P(N, 0);
vector<ll> Q(N, 0);
rep(i, N)
{
cin >> P[i];
}
rep(i, N)
{
cin >> Q[i];
}
vector<ll> I(N);
iota(I.begin(), I.end(), 1);
ll cnt = 0;
ll iP = -1, iQ = -1;
do
{
if (I == P) iP = cnt;
if (I == Q) iQ = cnt;
++cnt;
} while (std::next_permutation(I.begin(), I.end()));
cout << abs(iP - iQ);
return 0;
}
| 0
| 69,381,052
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,int>> dat(n);
rep(i,n){
int a,b;
cin>>a>>b;
dat[i]=make_pair(a,b);
}
sort(dat.begin(),dat.end());
ll ans=0,now=0;
rep(i,n){
while(now!=m&&dat[i].second!=0){
dat[i].second--;
ans+=dat[i].first;
now++;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define endl '\n'
#define LL long long
#define LD long double
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define debug(x) cerr << #x << " is " << x << endl;
using namespace std;
int const MAXN = 2e6 + 9;
int main(){
ios_base::sync_with_stdio (0),cin.tie(0);
int m, k;
cin >> m >> k;
if ( k == 0){
for (int i = 0; i < (1 << m); i++)
cout << i << ' ' << i << ' ';
return 0;
}
bool cond = false;
int s = 0;
for (int i = 0; i < (1 << m); i++){
if( i == k ) continue;
s ^= i;
}
cond = ( s == k );
if (!cond){
cout << -1;
return 0;
}
deque<int> dq;
dq.push_back(k);
for(int i = 0; i < (1 << m); i++){
if (i == k) continue;
dq.push_back(i);
dq.push_front(i);
}
dq.push_front(k);
for(auto cur : dq) cout << cur << ' ';
}
| 0
| 23,023,702
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define dbv(v) cout<<endl;cout<<#v<<"-->> ";for(auto it:v){cout<<it<<" ";}cout<<endl;
#define dbm(m)cout<<endl;cout<<#m<<"-->> ";for(auto it:m){cout<<it.fi<<" "<<it.se.fi<<" "<<it.se.se<<endl;}
#define dbs(s)cout<<endl;cout<<#s<<"-->> ";for(auto it:s){cout<<it<<" ";}cout<<endl;
#define mod 1000000007
#define db1(x) cout<<#x<<"="<<x<<endl;
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl;
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl;
#define mx 1e18
#define mxe(v) *max_element(v.begin(),v.end())
#define mne(v) *min_element(v.begin(),v.end())
#define double long double
#define re(s) reverse(s.begin(),s.end())
#define io std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
int powe(int x,int n)
{
if(n==0)return 1;
if(n%2==0)
return powe((x%mod*x%mod)%mod,n/2)%mod;
return (x%mod*powe((x%mod*x%mod)%mod,(n-1)/2))%mod;
}
int gcd(int A,int B)
{
if(B==0)return A;
return gcd(B,A%B);
}
int32_t main()
{
io
int n;cin>>n;
int p=0;
if(n%10==7)p=1;
n/=10;
if(n%10==7)
p=1;
n/=10;
if(n%10==7)
p=1;
if(p)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n; cin >> n;
cout << (n-1)*n/2 << endk;
return 0;
}
| 0
| 81,484,790
|
#include <stdio.h>
int main(){
int a=0,b=0,temp;
for(int i=0;i<4;i++){
scanf("%d",&temp);
a+=temp;
}
for(int i=0;i<4;i++){
scanf("%d",&temp);
b+=temp;
}
if(a>b)printf("%d\n",a);
else printf("%d\n",b);
}
|
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<cstdio>
#include<map>
#pragma warning(disable : 4996)
#define P pair<int,int>
using namespace std;
bool g[1000][1000]{};
int x[] = { -1,0,0,1 }, y[] = { 0,-1,1,0 };
map<int, P>j;
int a, b, c;
int meiro(int d) {
queue<P> e;
vector<vector<int>>f(a, vector<int>(b));
for (int g = 0; g < a; g++) {
for (int h = 0; h < b; h++) {
f[g][h] = 1 << 29;
}
}
e.push(j[d]);
f[(j[d]).first][(j[d]).second] = 0;
while(e.size()) {
P p = e.front(); e.pop();
if (p == j[d+1])break;
for (int q = 0; q < 4; q++) {
int l = p.first + x[q];
int r = p.second + y[q];
if (l >= 0 && l < a&&r >= 0 && r < b&&g[l][r] && f[l][r] == 1 << 29) {
P w(l, r);
e.push(w);
f[l][r] = f[p.first][p.second] + 1;
}
}
}
return f[(j[d + 1]).first][(j[d + 1]).second];
}
int main() {
scanf("%d%d%d", &a, &b, &c);
for (int d = 0; d < a; d++) {
for (int e = 0; e < b; e++) {
char f;
cin >> f;
if (f == 'X')g[d][e] = false;
else if (f == '.')g[d][e] = true;
else if (f == 'S') {
g[d][e] = true;
P h(d, e);
j[0] = h;
}
else {
g[d][e] = true;
P h(d, e);
j[f - 48] = h;
}
}
}
int s = 0;
for (int l = 0; l < c; l++) {
s += meiro(l);
}
printf("%d\n", s);
}
| 0
| 75,940,533
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool chk(ll a,ll b,ll k){
if(b+k>=a*b)return 0;
if(k*(b+1)>=a*b)return 0;
if(b+k+1>=2*k)return 1;
if((b+k+1)*(b+k+1)<4*a*b)return 1;
return 0;
}
void solve(){
ll a,b;cin>>a>>b;
if(a<b)swap(a,b);
ll s=1,e=a-1,ans=0;
while(s<=e){
ll mid=(s+e)>>1;
if(chk(a,b,mid))ans=mid,s=mid+1;
else e=mid-1;
}
cout<<ans+b-1<<"\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;cin>>t;
while(t--)solve();
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
int top = sqrt(N);
map<int, int> soinsu;
int i = 2;
bool flag = false;
if(N == 1) flag = true;
while(i<=top){
if(N % i == 0){
if(soinsu.count(i) > 0) soinsu.at(i) += 1;
else soinsu[i] = 1;
N /= i;
top = sqrt(N);
}
else{
i++;
}
}
if(N != 1){
if(soinsu.count(N) > 0) soinsu.at(N) += 1;
else soinsu[N] = 1;
}
if(flag) cout << 0 << endl;
else if(soinsu.size() == 0) cout << 1 << endl;
else{
int count=0;
int t;
for(auto itr = soinsu.begin(); itr != soinsu.end(); ++itr) {
t = 1;
while(true){
if(itr->second < t) break;
else{
itr->second -= t;
t++;
count++;
}
}
}
cout << count << endl;
}
}
| 0
| 33,306,065
|
#include <stdio.h>
int i, N, a, b, c, A, B, C;
int print(void)
{
if (C == A + B) {
printf("YES\n");
} else if (A == B + C) {
printf("YES\n");
} else if (B == C + A) {
printf("YES\n");
} else {
printf("NO\n");
}
}
int main(void)
{
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d %d\n", &a, &b, &c);
A = a * a;
B = b * b;
C = c * c;
print();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
struct pair_hash {
template <class T1, class T2>
size_t operator () (const pair<T1,T2> &p) const {
auto h1 = hash<T1>{}(p.first);
auto h2 = hash<T2>{}(p.second);
return h1 ^ h2;
}
};
using Vote = pair<ll,ll>;
using Unordered_map = unordered_map<Vote, int, pair_hash>;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define showvec(arr,a,b) for(ll i=a;i<b;i++) cout<<arr[i]<<" ";
#define read_input(arr,a,b) for(ll i=a;i<b;i++) cin>>arr[i];
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define endl '\n'
#define SmooothOperatorrrrr() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define deci(n) cout<<fixed<<setprecision(n)
const int mod=998244353;
const int mod2=1000000007;
#define M_PI 3.14159265358979323846
#define LL_MAX 9223372036854775807
#define MAXN 2000001
int main()
{
SmooothOperatorrrrr();
ll count=0;
ll n;cin>>n;
ll a[n];
read_input(a,0,n);
ll maxm=0;
FOR(i,0,n)
{
maxm=max(maxm,a[i]);
count+=(maxm-a[i]);
}
cout<<count<<endl;
}
| 0
| 18,315,387
|
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template<class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template<class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template<class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#else
#endif
#ifdef HK_CUP
freopen("finput.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout << setprecision(13) << fixed;
smain();
#ifdef MAX_HOME
#ifndef HK_CUP
cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
#endif
return 0;
}
void smain() {
int n;
cin >> n;
vl a(n);
vl b(n);
fori (i, n) {
cin >> a[i] >> b[i];
}
ll mx = 0;
for (int i = n - 1; i >= 0; --i) {
ll old = a[i];
a[i] += mx;
ll kek = (a[i] + b[i] - 1) / b[i] * b[i];
inmax(mx, kek - old);
}
cout << mx;
}
|
#include <unordered_set>
#include <string>
#include <iostream>
using namespace std;
int main() {
typedef unordered_set<string> set_t;
set_t A;
int n;
string s,t;
cin >> n;
for (int i = 0; i<n; i++){
cin >> s >> t;
if (s == "insert"){
A.insert(t);
}
else if (s == "find"){
bool find = A.count(t);
cout << (find?"yes":"no") << endl;
}
}
}
| 0
| 71,715,403
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a , b , c ;
cin >> a >> b >> c ;
if(a == b && b == c)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const int MAX_H = 2000000;
const int MAX_E2 = 1 << 22;
template <typename T, const int MAX_E2>
struct SegTreeMax {
int n, e2;
T nodes[MAX_E2], is[MAX_E2];
SegTreeMax() {}
SegTreeMax(int _n) { init(_n); }
void init(int _n) {
n = _n;
for (e2 = 1; e2 < n; e2 <<= 1);
memset(nodes, -1, sizeof(nodes));
memset(is, 0, sizeof(is));
}
int maxi() { return is[0]; }
T getmax() { return nodes[0]; }
T get(int i) { return nodes[e2 - 1 + i]; }
void set(int i, T v) {
int j = e2 - 1 + i;
nodes[j] = v;
is[j] = i;
j = (j - 1) / 2;
for (;;) {
int j0 = j * 2 + 1, j1 = j0 + 1;
if (nodes[j0] > nodes[j1])
nodes[j] = nodes[j0], is[j] = is[j0];
else
nodes[j] = nodes[j1], is[j] = is[j1];
if (j == 0) break;
j = (j - 1) / 2;
}
}
};
SegTreeMax<int,MAX_E2> st(MAX_H);
int main() {
int h = 0;
for (;;) {
char op[16];
int tmp = scanf("%s", op);
if (op[0] == 'i') {
int x;
tmp = scanf("%d", &x);
st.set(h++, x);
}
else if (op[1] == 'x') {
int x = st.getmax();
st.set(st.maxi(), -1);
printf("%d\n", x);
}
else break;
}
return 0;
}
| 0
| 77,589,743
|
#include <iostream>
using namespace std;
int a,b;
int main()
{
cin >> a;
cin >> b;
const char* gg = ((a * b) % 2 == 0) ? "Even" : "Odd";
cout << gg;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
if(b==0){
return a;
}else{
return gcd(b,a%b);
}
}
int main(){
ll N,X; cin>>N>>X;
vector<ll> x(N);
for (ll i = 0; i < N; i++){
cin>>x[i];
x[i]=abs(X-x[i]);
}
ll ans=gcd(x[0],x[1]);
for (ll i = 2; i < N; i++){
ans=gcd(ans,x[i]);
}
cout<<ans<<endl;
}
| 0
| 43,415,205
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string a(int aa, int b) {
if(aa <= 8 && b <= 8) {
return "Yay!";
}
return ":(";
}
int main() {
int aa, b;
cin >> aa >> b;
cout << a(aa, b);
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, a[100005] = {0}, b[100005] = {0}, t = 0;
long long memo[35] = {0};
long long solve();
int main() {
cin >> n >> k;
for(long long i = 0; i < n; ++i) cin >> a[i] >> b[i];
memo[0] = 1;
for(long long i = 1; i < 32; ++i)
memo[i] = 2 * memo[i - 1];
while(memo[t] <= k) ++t;
t = max(t - 1, 0LL);
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 0, now = 0;
for(long long i = 0; i < n; ++i)
if((k | a[i]) == k) ans += b[i];
for(long long x = t; x >= 0; --x) {
now = 0;
for(long long i = 0; i < n; ++i) {
if(k >= memo[x] && memo[x] > a[i])
now += b[i];
else if(k >= memo[x] && a[i] >= memo[x])
a[i] -= memo[x];
}
if(k >= memo[x]) k -= memo[x];
ans = max(ans, now);
}
return ans;
}
| 0
| 59,402,485
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b,c; cin>>a>>b>>c;
if(a+b>=c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(int i = 0; i < n; ++i) cout << UIET[i] << " "
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
bool isPrime(int x){
for(int i = 2; i * i <= x; ++i){
if(x % i == 0) return 0;
}
return 1;
}
int fun(int n){
if(n & 1) return 3 * n + 1;
else return n/2;
}
int32_t main(){
SPEED;
int n, a, b;
cin >> n >> a >> b;
int rem = n % (a + b);
cout << (n/(a + b)) * a + min(rem, a) ;
}
| 0
| 96,467,055
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin>>n;
if(n==0){
break;
}
int leg[2]={0};
int cnt=0,last=0;
string s;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu"){
leg[0]=1;
}else if(s=="ru"){
leg[1]=1;
}else if(s=="ld"){
leg[0]=0;
}else{
leg[1]=0;
}
if(leg[0]==1&&leg[1]==1){
if(last==0){
cnt++;
last=1;
}
}else if(leg[0]==0&&leg[1]==0){
if(last==1){
cnt++;
last=0;
}
}
}
cout<<cnt<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int N, K, a[1000000];
int main()
{
while(true)
{
cin >> N >> K;
if(!N)
break;
int v = 0;
for(int i = 0; i < N; i++)
{
cin >> a[i];
if(i < K)
v += a[i];
}
int ans = v;
for(int i = K; i < N; i++)
ans = max(ans, v = v + a[i] - a[i - K]);
cout << ans << endl;
}
}
| 0
| 39,628,403
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define DEBUG_ENDL_S(S) ((S).size() ? "\n" : "") << flush;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }
template <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
void debug_func_preffix(const string &s) { if(s.size()) cout << s << " = "; }
template <typename T>
void debug_func(const T &t, const string &s = "") {
debug_func_preffix(s);
cout << t << DEBUG_ENDL_S(s);
}
template <typename T, typename U>
void debug_func(const P<T, U> &p, const string &s = "") {
debug_func_preffix(s);
cout << "(";
debug_func(p.first);
cout << ", ";
debug_func(p.second);
cout << ")" << DEBUG_ENDL_S(s);
}
template <typename T>
void debug_func(const V<T> &v, const string &s = "") {
for(ll i = 0; i < v.size(); i++) {
string t = s + "[" + to_string(i) + "]";
debug_func(v[i], t);
}
}
template <typename T>
void debug_func_mult(int idx, const V<string> &names, const T &t) {
debug_func(t, names[idx]);
}
template <typename T>
void debug_func_mult(const V<string> &names, const T &t) {
debug_func(t, names[0]);
}
template <typename Head, typename... Tail>
void debug_func_mult(int idx, const V<string> &names, const Head &head, const Tail&... args) {
debug_func(head, names[idx]);
debug_func_mult(idx + 1, names, args...);
}
template <typename Head, typename... Tail>
void debug_func_mult(const V<string> &names, const Head &head, const Tail&... args) {
debug_func(head, names[0]);
debug_func_mult(1, names, args...);
}
V<string> split_names(string &&s) {
replace(ALL(s), ' ', ',');
V<string> ret;
istringstream ss(s);
string t;
while(getline(ss, t, ',')) if(t.size()) ret.push_back(move(t));
return move(ret);
}
void init_io() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
ll H, W;
void str_and(const V<string> &red, const V<string> &blue) {
#ifdef DEBUG_MODE
V<string> output(H, string(W, '.'));
for(ll i = 0; i < H; i++) for(ll j = 0; j < W; j++) if(red[i][j] == '#' && blue[i][j] == '#') output[i][j] = '#';
cout << endl;
for(const auto &s : output) cout << s << endl;
#endif
}
int main() {
ll N;
cin >> N;
V<ll> A(N);
V<ll> cnt(N + 10, 0);
for(ll &e : A) {
cin >> e;
cnt[e]++;
}
ll max_len = *max_element(ALL(A));
bool poss = true;
if(max_len & 1) {
ll center = (max_len + 1) / 2;
if(cnt[center] != 2) poss = false;
for(ll i = center + 1; i <= max_len; i++) if(cnt[i] < 2) poss = false;
} else {
ll center = max_len / 2;
if(cnt[center] != 1) poss = false;
for(ll i = center + 1; i <= max_len; i++) if(cnt[i] < 2) poss = false;
}
cout << (poss ? "Possible" : "Impossible") << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int ans;
int n, s;
void dfs(int sum,int i,int m){
if (m == 0 && sum == s)
ans++;
if (i == 10 | m == 0)
return ;
dfs(sum+i,i+1,m-1);
dfs(sum, i + 1, m);
}
int main() {
while (cin >> n >> s, n){
ans = 0;
dfs(0,0,n);
cout<<ans<<endl;
}
return 0;
}
| 0
| 38,066,218
|
#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 euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,ll b){
ll u = 1;
ll d = 1;
while(b != 0){
u *= a;
d *= b;
a--;
b--;
}
return u / d;
}
int fact(int n){
if(n == 1)return 1;
return n * fact(n-1);
}
int main(){
int x,y;
cin >> x >> y;
cout << x + (y/2) << endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e14;
using Graph = vector<vector<int>>;
signed main(){
vector<vector<int>> A(3, vector<int>(3));
for( int i = 0; i < 3; i++ ){
for( int j = 0; j < 3; j++ ) cin >> A[i][j];
}
int N;
cin >> N;
for( int n = 0; n < N; n++ ){
int B;
cin >> B;
for( int i = 0; i < 3; i++ ){
for( int j = 0; j < 3; j++ ){
if( A[i][j] == B ) A[i][j] = -1;
}
}
}
for( int i = 0; i < 3; i++ ){
bool fg = 1;
for( int j = 0; j < 3; j++ ){
if( A[i][j] != -1 ) fg = 0;
}
if( fg ){
cout << "Yes" << endl;
return 0;
}
}
for( int i = 0; i < 3; i++ ){
bool fg = 1;
for( int j = 0; j < 3; j++ ){
if( A[j][i] != -1 ) fg = 0;
}
if( fg ){
cout << "Yes" << endl;
return 0;
}
}
if( A[0][0] == -1 && A[1][1] == -1 && A[2][2] == -1 ){
cout << "Yes" << endl;
return 0;
}
if( A[0][2] == -1 && A[1][1] == -1 && A[2][0] == -1 ){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| 0
| 25,146,124
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> inline bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> inline bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
const ll MOD2=998244353;
const ld pi=3.141592653589793238;
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N;
cin >> N;
ll K;
cin >> K;
deque<P> vec;
for(ll i=0;i<N;++i){
ll a;
cin >> a;
ll b;
cin >> b;
vec.emplace_back(P(a,b));
}
sort(vec.begin(), vec.end());
ll num=0;ll ans=0;
while(num<K){
num+=vec[0].second;
ans=vec[0].first;
vec.pop_front();
}
prt(ans)fl
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
string s;
while (cin >> n, n) {
int l=0, r=0, state=0;
int score=0;
for(int i=0; i<n; i++) {
cin >> s;
if (s[0] == 'l') { l = (s[1] == 'u' ? 1 : 0); }
if (s[0] == 'r') { r = (s[1] == 'u' ? 1 : 0); }
if (l==1 && r==1) { if(state==0){ score++; } state = 1; }
if (l==0 && r==0) { if(state==1){ score++; } state = 0; }
}
cout << score;
cout << endl;
}
return 0;
}
| 0
| 9,434,368
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvi = vector<vector<int>>;
using Graph = vvi;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ui = unsigned int;
using qul = queue<ll>;
using pql = priority_queue<ll>;
using kaage = priority_queue<int, vector<int>, greater<int>>;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll box(double a)
{
ll b = a;
return b;
}
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
ll mch(ll n) {
if (n == 1) return 1;
else return n * mch(n - 1);
}
bool prime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll modpow(ll a, ll n, ll mod) {
ll hi = 1;
while (n > 0) {
if (n & 1) hi = hi * a % mod;
a = a * a % mod;
n >>= 1;
}
return hi;
}
ll mg(ll a, ll mod) {
return modpow(a, mod - 2, mod);
}
int main() {
int n; cin >> n;
vl a(n);
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] = i;
}
sort(a.begin(), a.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
if (mp[a[i]] % 2 != i % 2) cnt++;
}
cout << cnt / 2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
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; }
const ll MOD = 1e9 + 7;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
bool asikiri(int n, VL& a) {
bool res = false;
if (n == 0 && a[0] != 1) res = true;
else if (n != 0 && a[0] != 0) res = true;
return res;
}
int main() {
int n;
cin >> n;
VL a(n + 1);
rep(i, n + 1) {
cin >> a[i];
}
VL sum(n + 1, 0);
sum[n] = a[n];
for (int i = n - 1; i >= 0; i--) {
sum[i] += sum[i + 1] + a[i];
}
ll ans = 1;
ll now = 1;
if (asikiri(n, a)) {
puts("-1");
return 0;
}
rep1(i, n) {
now *= 2;
chmin(now, sum[i]);
ans += now;
now -= a[i];
if (now < 0) {
puts("-1");
return 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 99,969,078
|
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int b[26] = {};
string a;
cin >> a;
for ( int i = 0 ; i < a.length() ; i++ ) {
b[a[i] - 'a']++;
if( b[a[i] - 'a'] >= 2 ) {
cout << "no";
return 0;
}
}
cout << "yes";
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
#include <string.h>
#include <set>
using namespace std;
#define N 100005
#define M 20
#define mod 1000000007
int x[N],dp[N][M];
int jumpCity(int stCity,int day) {
int curCity = stCity;
for(int i=0;i<M;++i) {
if(day&(1<<i)) {
curCity = dp[curCity][i];
}
}
return curCity;
}
void solve() {
int n;scanf("%d ", &n);
for(int i=1;i<=n;++i) {
scanf("%d ", &x[i]);
}
int L;scanf("%d ", &L);
for(int i=0;i<M;++i) {
dp[n+1][i] = n+1;
dp[n][i] =n+1;
}
int lastCity = n;
int dist = x[n] - x[n-1];
for(int i=n-1;i>=1;--i) {
while(dist>L) {
dist -= x[lastCity] - x[lastCity-1];
--lastCity;
}
dp[i][0] = lastCity;
for(int j=1;j<M;++j) {
dp[i][j] = dp[dp[i][j-1]][j-1];
}
dist += x[i] - x[i-1];
}
int q;scanf("%d ", &q);
while(q--) {
int a,b;scanf("%d %d ", &a,&b);
if(a>b) {
swap(a,b);
}
int l = 1,r = n,mid;
while(l<r) {
mid = (l+r)/2;
int arrived = jumpCity(a,mid);
if(b<=arrived) {
r = mid;
} else {
l = mid+1;
}
}
printf("%d\n", l);
}
}
int main() {
solve();
return 0;
}
| 0
| 46,615,254
|
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#define tc(t) int t; cin>>t; while(t--)
#define sz(v) int((v).size())
#define pb push_back
using namespace std;
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {std::cout << x;}
void __print(unsigned x) {std::cout << x;}
void __print(unsigned long x) {std::cout << x;}
void __print(unsigned long long x) {std::cout << x;}
void __print(float x) {std::cout << x;}
void __print(double x) {std::cout << x;}
void __print(long double x) {std::cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i : x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
template <typename T> inline void inp(T &any) {cin >> any;} template <typename T, typename... U>inline void inp(T &a, U &...b) {cin >> a; inp(b...);}
#define rin(args...) ll args; inp(args);
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#define matdeb(mat,row,col) cout << #mat << "::" << endl; printmat(mat,row,col); printpartition;
#define debugv(v,n) cout << #v << ":" << endl; printv(v,0,n-1); printpartition;
#else
#define debug(x...)
#define matdeb(mat,row,col)
#define debugv(v,n)
#endif
const int maxm = 1000000000 + 7;
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s, t;
cin >> s >> t;
ll a = s.length();
ll b = t.length();
if (a > b)
{
cout << "GREATER" << endl;
}
else if (a < b)
{
cout << "LESS" << endl;
}
else
{
loop(i, s.length())
{
if (s[i] > t[i])
{
cout << "GREATER";
return 0;
}
else
{
if (s[i] < t[i])
{
cout << "LESS";
return 0;
}
}
}
cout<<"EQUAL";
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long e[100010];
int main() {
long long n, k;
cin >> n >> k;
long long ans = 0;
for (long long i = 1; i <= k; i++) {
long long m = k / i;
long long b = 0;
for (long long j = 1; j * j <= i; j++) {
if (i % j == 0) {
b += e[j];
if (j != i / j && j != 1) {
b += e[i / j];
}
}
}
if (i == 1) {
b = 0;
}
long long n1 = n;
long long ans1 = 1;
while (n1 > 0) {
if ((n1 & 1) == 1) {
ans1 = ans1 * m % 1000000007;
}
m = m * m % 1000000007;
n1 >>= 1;
}
ans += ans1 * (i - b) % 1000000007;
ans %= 1000000007;
e[i] = (i - b);
}
cout << ans << endl;
}
| 0
| 33,033,526
|
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
#define int long long
const int inf = 999999999999999999;
typedef long long ll;
typedef long double ld;
string a, b;
int dp[1001][1001];
signed main() {
cin >> a >> b;
for (int i = 0; i < a.size(); i++)
for (int j = 0; j < b.size(); j++)
dp[i][j] = inf;
for (int i = 0; i <= a.size(); i++)
dp[i][0] = i;
for (int i = 0; i <= b.size(); i++)
dp[0][i] = i;
for (int i = 1; i <= a.size(); i++) {
for (int j = 1; j <= b.size(); j++) {
int cost = 1;
if (a[i-1] == b[j-1])
cost = 0;
dp[i][j] = min(dp[i - 1][j] + 1, min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost));
}
}
cout << dp[a.size()][b.size()] << endl;
getchar(); getchar();
}
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
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); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if (s[0] == '>')
s = "<" + s;
if (s[s.size() - 1] == '<')
s += ">";
vector<ll> v;
int n = s.size(), c = 0;
bool b = true;
rep(i, 0, n) {
if (b) {
if (s[i] == '<')
c++;
else {
v.push_back(c);
c = 1;
b = !b;
}
} else {
if (s[i] == '>')
c++;
else {
v.push_back(c);
c = 1;
b = !b;
}
}
}
v.push_back(c);
ll ans = 0;
rep(i, 1, v.size()) {
ll maxv = max(v[i], v[i - 1]);
ll minv = min(v[i], v[i - 1]);
minv--;
ans += maxv * (maxv + 1) / 2;
ans += minv * (minv + 1) / 2;
i++;
}
cout << ans << endl;
}
| 0
| 18,613,401
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
int n;
ll Bigmod(int a,int b)
{
if(b==0)
return 1%MOD;
ll x=Bigmod(a,b/2);
x=(x*x)%MOD;
if(b%2==1)
x=(x*a)%MOD;
return x;
}
ll recur(int pos)
{
if(pos==n)
{
if(s[pos]=='0')
return 1ll;
return 3ll;
}
if(s[pos]=='0')
return recur(pos+1)%MOD;
else
return (Bigmod(3,n-pos)+2 * recur(pos+1)%MOD)%MOD;
}
int main()
{
FastRead
cin>>s;
n=s.length()-1;
cout<<recur(0)<<endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
#define int_ int64_t
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define lb long double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
const ll N=1010;
ll n,m,x;
char grid[N][N];
bool vis[N][N];
ll u[10],v[10];
ll dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
struct node {
ll x,y,val;
};
ll solve(ll s,ll t) {
memset(vis,0,sizeof(vis));
queue<node> q;
q.push({u[s],v[s],0});
while (!q.empty()) {
node cur=q.front();
q.pop();
if (vis[cur.x][cur.y]) continue;
vis[cur.x][cur.y]=true;
if (cur.x==u[t]&&cur.y==v[t]) {
return cur.val;
}
for (ll i=0;i<4;i++) {
ll xx=cur.x+dir[i][0];
ll yy=cur.y+dir[i][1];
if (xx>0&&xx<=n&&yy>0&&yy<=m&&!vis[xx][yy]&&grid[xx][yy]!='X') {
q.push({xx,yy,cur.val+1});
}
}
}
return 0;
}
int main()
{
scanf("%lld%lld%lld",&n,&m,&x);
for (ll i=1;i<=n;i++) {
scanf("%s",&grid[i][1]);
for (ll j=1;j<=m;j++) {
if (grid[i][j]=='S') {
u[0]=i,v[0]=j;
} else if (grid[i][j]!='.'&&grid[i][j]!='X') {
ll idx=grid[i][j]-'0';
u[idx]=i,v[idx]=j;
}
}
}
ll ans=0;
for (ll i=1;i<=x;i++) {
ans+=solve(i-1,i);
}
printf("%lld\n",ans);
}
| 0
| 24,951,798
|
#include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> stk;
int car;
while (cin >> car) {
if (car) {
stk.push(car);
}
else {
cout << stk.top() << endl;
stk.pop();
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int h, w;
cin >> h >> w;
int s[h][w];
rep(i, h) rep(j, w) {
char c;
cin >> c;
s[i][j] = (c == '#');
}
int score[h][w];
rep(i, h) rep(j, w) score[i][j] = 0;
rep(i, h) {
int l = -1;
rep(j, w) {
if (s[i][j])
l = -1;
else {
++l;
score[i][j] += l;
}
}
}
rep(i, h) {
int l = -1;
rep(j, w) {
if (s[i][w - j - 1])
l = -1;
else {
++l;
score[i][w - j - 1] += l;
}
}
}
rep(j, w) {
int l = -1;
rep(i, h) {
if (s[i][j])
l = -1;
else {
++l;
score[i][j] += l;
}
}
}
rep(j, w) {
int l = -1;
rep(i, h) {
if (s[h - i - 1][j])
l = -1;
else {
++l;
score[h - i - 1][j] += l;
}
}
}
int ans = 0;
rep(i, h) {
rep(j, w) {
if (s[i][j]) continue;
ans = max(ans, score[i][j] + 1);
}
}
cout << ans << endl;
return 0;
}
| 0
| 87,651,571
|
#include<iostream>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 4; i++)
for (int j = i + 1,t; j < 5; j++)
if (a[i] < a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
for (int i = 0; i < 5; i++)
{
if (i != 0)cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
inline pair<bool, string> calc(li pos, string s, string t) {
rep(i, sz(t)) {
if (s[pos + i] != t[i]) {
if (s[pos + i] != '?') {
return {false, ""};
}
s[pos + i] = t[i];
}
}
rep(i, sz(s)) {
if (s[i] == '?') {
s[i] = 'a';
}
}
return {true, s};
}
int main() {
string s, t;
cin >> s >> t;
string res = "";
if (sz(t) > sz(s)) {
puts("UNRESTORABLE");
return 0;
}
rep(i, sz(s) - sz(t) + 1) {
auto r = calc(i, s, t);
if (r.F) {
if (res == "" || r.S < res) {
res = r.S;
}
}
}
cout << (res == "" ? "UNRESTORABLE" : res) << endl;
return 0;
}
| 0
| 40,972,508
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MAX/2;
#define PI 3.14159265358979323846264338327950L;
const int INF2 = 1001001001;
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll mod = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
using Graph = vector<vector<int>>;
int cnt_digit(ll N)
{
int digit = 0;
while (N > 0)
{
N /= 10;
digit++;
}
return digit;
}
ll gcd(ll a, ll b)
{
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
struct union_find
{
vector<int> par, r;
union_find(int n)
{
par.resize(n);
r.resize(n);
init(n);
}
void init(int n)
{
for (int i = 0; i < n; i++) par[i] = i;
for (int i = 0; i < n; i++) r[i] = 0;
}
int find(int x)
{
if (par[x] == x)return x;
else return find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (r[x] < r[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (r[x] == r[y])
{
r[x]++;
}
}
}
};
const int MAX_N = 110000;
int memo[MAX_N];
int rec(int n) {
if (n == 0)return 0;
if (memo[n] != -1)return memo[n];
int res = n;
for (int pow6 = 1; pow6 <= n; pow6 *= 6)res = min(res, rec(n - pow6) + 1);
for (int pow9 = 1; pow9 <= n; pow9 *= 9)res = min(res, rec(n - pow9) + 1);
return memo[n] = res;
}
int calc(int x) {
int ret = 0;
while (x % 2 == 0) {
x /= 2;
ret++;
}
return ret;
}
int a[12][12];
int D;
ll G;
vector<ll> P, C;
long modpow(long a, int p) {
if (p == 0)return 1;
if (p % 2 == 0) {
int halfP = p / 2;
long half = modpow(a, halfP);
return half * half % mod;
}
else {
return a * modpow(a, p - 1) % mod;
}
}
long calcComb(int a, int b) {
if (b > a - b) return calcComb(a, a - b);
long ansMul = 1;
long ansDiv = 1;
rep(i, 0, b) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= mod;
ansDiv %= mod;
}
long ans = ansMul * modpow(ansDiv, mod - 2) % mod;
return ans;
}
bool is_war(const vector<int>& x, const vector<int>& y) {
for (int Z = -100; Z <= 100; Z++) {
bool is_ok = true;
rep(i, 0, x.size()) {
if (x[i] >= Z) {
is_ok = false;
}
rep(i, 0, y.size()) {
if (y[i] < Z) {
is_ok = false;
}
}
}
if (is_ok)return false;
}
return true;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> x(n + 1),y(m+1);
cin >> x[0] >> y[0];
rep(i, 0, n) {
cin >> x[i + 1];
}
rep(i, 0, m) {
cin >> y[i + 1];
}
if (is_war(x, y)) {
cout << "War" << endl;
}
else {
cout << "No War" << endl;
}
}
|
#include <functional>
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int> > adj(n);
for (int i = 1; i < n; i++) {
int a, b; cin >> a >> b;
a--; b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
function<bool(int, int)> dfs = [&](int i, int p) {
if (p >= 0 && adj[i].size() == 1) return false;
int c = 0;
for (int j : adj[i]) if (j != p && !dfs(j, i)) c++;
if (c > 1) {
cout << "First\n";
exit(0);
}
return c == 1;
};
cout << (dfs(0, -1) ? "Second\n" : "First\n");
}
| 0
| 78,671,554
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll>PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e4+7;
int main() {
ll x, y;
cin >> x >> y;
if ( x % y == 0 ) {
cout << -1 << endl;
return 0;
}
ll mult_num = 2;
while ( 1 ) {
if ( x * mult_num > 1e18 ) {
cout << -1 << endl;
return 0;
}
if ( ( x * mult_num ) % y != 0 ) break;
++mult_num;
}
cout << x * mult_num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N; cin >> N;
string s; cin >> s;
ll l = 0, r = 0;
ll cnt = 0;
rep(i, s.size()) {
switch(s[i]) {
case '(':
cnt ++;
break;
case ')':
cnt --;
if(cnt < 0) {
l ++;
cnt = 0;
}
break;
}
}
cnt = 0;
rep(i, s.size()) {
switch(s[s.size() - i - 1]) {
case ')':
cnt ++;
break;
case '(':
cnt --;
if(cnt < 0) {
r ++;
cnt = 0;
}
break;
}
}
rep(i, l) cout << '(';
cout << s;
rep(i, r) cout << ')';
cout << endl;
}
int main(void)
{
solve();
}
| 0
| 22,452,076
|
#include <iostream>
using namespace std;
int main() {
int N;
string S;
string T;
cin >> N >> S;
T = S.substr(N / 2);
if (T + T == S) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
|
#include<iostream>
#include<list>
#include<vector>
#include<queue>
using namespace std;
class Vertex{
int connection;
int name;
list<Vertex*> v_list;
Vertex(int n):connection(0),name(n){}
friend class Graph;
};
class Graph{
vector<Vertex*> graph;
public:
Graph(int size){
graph.resize(size);
for(int i=0;i<size;i++){
graph[i]=new Vertex(i);
}
}
~Graph(){
for(int i=0;i<(int)graph.size();i++){
delete graph[i];
}
}
void addEdge(int from,int to){
graph[from]->v_list.push_back(graph[to]);
graph[to]->connection++;
}
void topo(){
Vertex *v;
queue<Vertex*> q;
vector<Vertex*> vec;
for(int i=0;i<(int)graph.size();i++){
if(graph[i]->connection==0) q.push(graph[i]);
}
while(!q.empty()){
v=q.front();
q.pop();
vec.push_back(v);
for(list<Vertex*>::iterator it=v->v_list.begin();it!=v->v_list.end();it++){
Vertex* w=*it;
if((--w->connection)==0){
q.push(w);
}
}
}
for(int i=0;i<(int)vec.size();i++){
cout<<vec[i]->name<<endl;
}
}
};
int main(){
int v=0;
int e=0;
cin>>v>>e;
Graph graph(v);
for(int i=0;i<e;i++){
int from,to;
cin>>from>>to;
graph.addEdge(from,to);
}
graph.topo();
return 0;
}
| 0
| 5,042,317
|
#include <iostream>
using namespace std;
int main (void) {
int r, g;
cin >> r >> g;
int ans;
ans = 2*g - r;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
ll dp[100005][2];
int main() {
string L;
cin >> L;
int n = L.size();
dp[0][0] = 1;
rep(i, n) {
if (L[i] == '1') {
dp[i+1][0] = dp[i][0] * 2 % MOD;
dp[i+1][1] = (dp[i][1] * 3 + dp[i][0]) % MOD;
} else {
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1] * 3 % MOD;
}
}
ll ans = dp[n][0] + dp[n][1];
ans %= MOD;
cout << ans << endl;
return 0;
}
| 0
| 56,198,410
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
int a[100010];
rep(i, n) {
cin >> a[i];
a[i]--;
}
int ans = 0;
rep(i, n) if (a[a[i]] == i) ans++;
cout << ans / 2 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int d[6],q,a,b,tmp,j;
for(int i=0;i<6;i++){
cin >> d[i] ;
}
cin >> q ;
for(int i=0;i<q;i++){
j=0;
cin >> a >> b ;
while(1){
if(d[1]==b)break;
tmp=d[0];
d[0]=d[1];
d[1]=d[5];
d[5]=d[4];
d[4]=tmp;
if(j==4){
tmp=d[0];
d[0]=d[3];
d[3]=d[5];
d[5]=d[2];
d[2]=tmp;
}
j++;
}
while(1){
if(d[0]==a)break;
tmp=d[0];
d[0]=d[2];
d[2]=d[5];
d[5]=d[3];
d[3]=tmp;
}
cout << d[2] << endl ;
}
return 0;
}
| 0
| 44,982,033
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i < n; i++)
string s[10010];
int main(void)
{
int n;
cin >> n;
REP(i, n) cin >> s[i];
int cnt = 0, ca = 0, cb = 0, cab = 0,a,b;
REP(i, n) {
REP(j, s[i].length()-1) {
if(s[i][j] == 'A' && s[i][j+1] == 'B') cnt++;
}
a = (s[i][s[i].length()-1] == 'A')?1:0;
b = (s[i][0] == 'B')?1:0;
if(a+b==2) {
cab ++;
} else {
ca += a;
cb += b;
}
}
if(cab==0) {
cnt += min(ca,cb);
} else {
if(ca+cb>0) {
cnt += cab+min(ca,cb);
} else {
cnt += cab-1;
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int main() {
int a, b, c, n;
cin >> a >> b >> c >> n;
int cardA = a, cardB = b, cardC = c;
int cnt = 0;
while(cardA >= cardB){
cardB *= 2;
cnt++;
}
while(cardB >= cardC){
cardC *= 2;
cnt++;
}
if(cnt <= n) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 19,458,756
|
#include<bits/stdc++.h>
#include<cstdlib>
#include<cmath>
using namespace std;
int main(){
int N; cin>>N;
int P=0;
vector<vector<int>> S(N,vector<int>(2));
for(int i=0; i<N; i++){
for(int j=0;j<2; j++){
cin>>S.at(i).at(j);
}
P+=(S.at(i).at(1)-S.at(i).at(0)+1);
}
cout<<P<<endl;
}
|
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
int main() {
i64 n, m; scanf("%lld%lld", &n, &m);
std::vector<i64> x(n), y(m);
for(int i = 0; i < n; i++) scanf("%lld", &x[i]);
for(int i = 0; i < m; i++) scanf("%lld", &y[i]);
i64 A = 0, B = 0;
const int MOD = 1e9 + 7;
for(i64 i = 0; i < n; i++) (A += x[i] * i - x[i] * (n - i - 1)) %= MOD;
for(i64 i = 0; i < m; i++) (B += y[i] * i - y[i] * (m - i - 1)) %= MOD;
printf("%lld\n", A * B % MOD);
return 0;
}
| 0
| 90,822,891
|
#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() {
ll x,y;
cin >> x >> y;
int count = 1;
for(;;){
x = x*2;
if(x>y)break;
count++;
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll> >;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F first
#define S second
int main(){
ll n; string s;
cin >> n >> s;
ll R = 0,G = 0,B = 0, cnt = 0;
rep(i, n){
if(s[i] == 'R') R++;
else if(s[i] == 'G') G++;
else if (s[i] == 'B') B++;
}
for(int i = 0; i < n-2; i++){
for(int j = 1; i + j * 2 < n; j++){
if(s[i] != s[i+j] && s[i+j] != s[i+j*2] && s[i] != s[i+j*2]) cnt++;
}
}
cout << R*G*B - cnt << endl;
return 0;
}
| 0
| 52,325,503
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);}
int sgn(const double&a,const double&b){return sgn(a-b);}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin>>n>>m;
vvl g(n);
vl ans(n,LINF);
rep(i,m){
ll a,b;
cin>>a>>b;
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
}
queue<pll> q;
q.push(pll(0,-1));
while(!q.empty()){
auto p=q.front();q.pop();
if(ans[p.fs]!=LINF)continue;
ans[p.fs]=p.sc;
for(auto x:g[p.fs]){
if(x!=p.sc&&ans[x]==LINF)q.push(pll(x,p.fs));
}
}
puta("Yes");
rep(i,n-1){
puta(ans[i+1]+1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll A,B,K;
cin >> A >> B >>K;
ll num =0;
for(int i=100;i>=0;--i){
if(A%i ==0 && B%i==0){
num++;
}
if(num == K){
cout << i << endl;
return 0;
}
}
return 0;
}
| 0
| 47,853,579
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[2001],ans,p[2001],mod=1000000007;
int main(){
ll n,k;
cin>>n>>k;
for(ll i=1;i<=n;i++)cin>>a[i];
for(ll i=1;i<=n;i++){
for(ll j=i+1;j<=n;j++){
if(a[j]<a[i]){
ans=ans+k;
ans%=mod;
}
}
for(ll j=1;j<=n;j++){
if(a[j]<a[i]){
ans=ans+k*(k-1)/2;
ans%=mod;
}
}
}
cout<<ans;
return 0;
}
|
#include <cstdio>
#include <climits>
#include <algorithm>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n)&&n!=0) {
long long int a[n];
for (int i=0; i<n; i++) scanf("%lld", &a[i]);
long long int dp[n];
dp[0] = a[0];
long long int res = dp[0];
for (int i=1; i<n; i++) {
dp[i] = max(a[i], dp[i-1]+a[i]);
res = max(res, dp[i]);
}
printf("%lld\n", res);
}
}
| 0
| 79,080,548
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#define vpll vector< pair<lld ,lld> >
#define vvl vector<vector<lld> >
#define pll pair <lld,lld>
#define modA(cccc,bbbb ,p) (((cccc+bbbb)%p+p)%p)
#define modS(cccc,bbbb ,p) (((cccc-bbbb)%p+p)%p)
#define modM(cccc,bbbb ,p) ((((cccc%p)*(bbbb%p))%p+p)%p)
long long int modp(lld a,lld p,lld n)
{
lld d[100];
lld i,j,k,l;
if(n==0) return 1;
for(i=0;n>=1;i++)
{
d[i]=n%2;
n/=2;
}
l=i;
long long int e=1;
if(d[0]==1) e*=(a%p);
for(i=1;i<l;i++)
{
a*=a;
a=a%p;
if(d[i]==1)
{
e*=a;
e=e%p;
}
}
return e%p;
}
lld modInverse(lld n, lld p)
{
return modp(n, p, p-2);
}
lld gcd(lld a,lld b)
{
if(a>b) return gcd(b,a);
if(b%a==0) return a;
else return gcd(b%a,a);
}
lld p1=1e9 + 7,p2=998244353;
lld l,r,mid,ans;
lld n,i,j,k,g,m;
lld x,y,n1,n2,h,z,c;
lld aa=1;
void solve()
{
cin>>n;
string s,t;
cin>>s>>t;
for(i=0;i<n;i++) cout<<s[i]<<t[i];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lld t=1;
lld ans=0;
for(int i=0;i<t;i++)
{
solve();
cout<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define set_zero(a) memset(a,0,sizeof(a));
#define ll long long int
#define PI 2 * acos(0.0)
#define MAX 1000000000000000000
#define in(a) scanf("%d",&a);
#define out(a) printf("%d",a);
#define INF 1000000
#define M 1000000007
#define pi 3.14159265
using namespace std;
int main(){
fast_io
ll n;
cin>>n;
ll a[n];
for(ll i = 0;i<n;i++) cin>>a[i];
sort(a,a+n);
long double ans = (long double) a[0];
for(ll i = 1;i<n;i++){
long double y = (long double)(a[i]);
ans = (ans+y)/2.0;
}
cout<<fixed<<setprecision(15)<<ans<<endl;
return 0;
}
| 0
| 47,476,801
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
bool ac[100010]={false};
ll wa[100010]={};
for(ll i=0;i<m;i++){
ll now;string s;
cin>>now>>s;
now--;
if(s=="WA"){
if(ac[now]==false){
wa[now]++;
}
}
else{
ac[now]=true;
}
}
ll accnt=0;ll wacnt=0;
for(ll i=0;i<n;i++){
if(ac[i]){
accnt++;
wacnt+=wa[i];
}
}
cout << accnt<<" "<<wacnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(int n,int mn,int mx){
int t,st=0,maxx=0,ans=0;
vector<int> v;
cin >> st;
for(int i=0;i<n-1;i++){
cin >> t;
v.push_back(st-t);
st=t;
}
for(int i=mn-1;i<mx;i++){
if(maxx<v[i]){
maxx=v[i];
}
if(maxx<=v[i]){
ans=i+1;
}
}
cout<<ans<<endl;
}
int main(void){
int a,b,c;
while(cin>>a>>b>>c,a){
solve(a,b,c);
}
}
| 0
| 87,562,959
|
#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, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#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;
struct UnionFind {
vector< int > data;
UnionFind(int sz) {
data.assign(sz, -1);
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
data[y] = x;
return (true);
}
int find(int k) {
if(data[k] < 0) return (k);
return (data[k] = find(data[k]));
}
int size(int k) {
return (-data[find(k)]);
}
};
vector<vector<P> > graph;
vector<bool> used;
vector<ll> pl;
vector<vector<bool> > used_edge;
bool rec (int k) {
bool ret = true;
used[k] = true;
rep (i, graph[k].size()) {
if (!used_edge[k][i]) {
int a, b; tie(a, b) = graph[k][i];
if (used[a] && b + pl[k] != pl[a]) {
eprintf("%d %d %d %d %d\n", b, k, pl[k], a, pl[a]);
return false;
}
pl[a] = b + pl[k];
used_edge[k][i] = true;
if (!used[a]) {
ret &= rec(a);
if (!ret) return false;
}
}
}
return true;
}
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin >> n >> m;
graph.resize(n);
rep (_, m) {
int l, r, d; cin >> l >> r >> d; l--; r--;
graph[l].emplace_back(r, d);
graph[r].emplace_back(l, -d);
}
used.resize(n);
pl.resize(n);
used_edge.resize(n);
rep (i, n) used_edge[i].resize(graph[i].size());
bool ans = true;
rep (i, n) {
if (!used[i]) ans &= rec(i);
}
rep (i, n) eprintf("%d ", pl[i]); eprintf("\n");
cout << (ans ? "Yes\n" : "No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
if(k > (n - 1) * (n - 2) / 2) {
cout << -1 << '\n';
return 0;
}
vector<pair<int,int>> ans;
for (int i = 2; i <= n; i++) {
ans.emplace_back(1, i);
}
int tot = (n - 1) * (n - 2) / 2;
for (int i = 2; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
if(tot == k) break;
ans.emplace_back(i, j);
tot--;
}
if(tot == k) break;
}
cout << ans.size() << '\n';
for(auto it : ans) {
cout << it.first << " " << it.second << '\n';
}
}
| 0
| 97,522,215
|
#include <iostream>
using namespace std;
#include <stdio.h>
int main()
{
int HW[10000][2], i = 0, j, l, k;
while (1){
cin >> HW[i][0] >> HW[i][1];
if (HW[i][0] == 0 && HW[i][1] == 0)break;
i++;
}
for (j = 0; j < i; j++){
for (l = 0; l < HW[j][0]; l++){
for (k = 0; k < HW[j][1]; k++){
if ((l == 0 || l == HW[j][0] - 1) || (k == 0 || k == HW[j][1] - 1)) printf("#");
else printf(".");
}
printf("\n");
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> v(n), ans(n, 0);
map<long long, long long> m;
map<long long, int> p;
for (int i = 0; i < n; i++) {
cin >> v[i];
m[-v[i]]++;
if (m[-v[i]] == 1) p[v[i]] = i;
}
m[0] = 0;
long long cnt = 0;
int cur = n+1;
long long prev = -1;
for (auto it: m) {
long long x = -it.first;
if (prev != -1) {
ans[cur] += (prev - x) * cnt;
}
cnt += it.second;
cur = min(cur, p[x]);
prev = x;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
| 0
| 36,793,215
|
#include <iostream>
#include <vector>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, vector<T> const& v) {
for (int i = 0; i < v.size() - 1; i++) os << v[i] << ' ';
if (!v.empty()) os << v.back();
return os;
}
int main(void) {
uint64_t K;
cin >> K;
constexpr uint64_t N = 50;
vector<uint64_t> ans(N);
for (auto& x : ans) x = (N - 1) + K / N;
for (uint64_t i = 0; i < (K % N); i++) {
ans[i] += N;
for (uint64_t j = 0; j < N; j++) {
if (i != j) ans[j]--;
}
}
cout << N << endl;
cout << ans << endl;
return 0;
}
|
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include<vector>
#include<iostream>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
long long int divide(long long int h,long long w){
if(h %2 == 0){
return (h/2)*w;
}
if(w %2 == 0){
return (w/2)*h;
}
long long int mi = min(h,w);
long long int ma = max(h,w);
return (ma/2)*mi;
}
long long int calcRes(long long int rect1,long long int rect2,long long int rect3){
long long int ma = max(rect1,max(rect2,rect3));
long long int mi = min(rect1,min(rect2,rect3));
return ma - mi;
}
int main() {
int h,w;
cin >> h >> w;
cout << (h-1)*(w-1) <<endl;
return 0;
}
| 0
| 12,527,230
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
sort(t.begin(), t.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
int time = t[i];
for (int j = 0; j < c; j++) {
if (t[i + j] > time + k) {
i += j - 1;
break;
}
if (j == c - 1) i += j;
}
cnt++;
}
cout << cnt << endl;
}
int main() {
if (debug) {
while (true) {
cout << "********" << endl;
solve();
}
} else {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b){
if(b == 0){
return a;
}
else{
return gcd(b,(a%b));
}
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int main(){
int n,k;
cin>>n>>k;
ll vec[n-1];
for(int i=0;i<n;i++){
cin>>vec[i];
}
int bitb[n];
ll a=0,b=0,ma=vec[0];
ll ans=150000000000;
for(int bit=0;bit<(1<<n-1);bit++){
for(int i=0;i<n-1;i++){
if(bit&(1<<i)){
bitb[i]=1;
b++;
}
else{
bitb[i]=0;
}
}
if(b<k-1){
b=0;
continue;
}
b=0;
for(int i=1;i<n;i++){
if(bitb[i-1]==1){
if(ma>=vec[i]){
a+=ma+1-vec[i];
b++;
}
}
ma=max(ma,vec[i]);
if(b==1){
ma=ma+1;
b=0;
}
}
ma=vec[0];
ans=min(ans,a);
if(ans==a){
}
a=0;
}
cout<<ans<<endl;
}
| 0
| 77,614,728
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int X,A;
cin >> X >> A;
if(X < A) cout << "0\n";
else cout << "10\n";
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
signed main() {
int n, m;
long double sum = 0;
cin >> n >> m;
vector<int> vec(n);
rep(i, n) {
cin >> vec[i];
sum += vec[i];
}
sort(vec.rbegin(), vec.rend());
if (vec[m - 1] >= sum / (4 * m)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 57,834,008
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ALL(a) begin((a)), end((a))
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RFOR(i, a, b) for (int(i) = (a); (i) > (b); (i)--)
#define debug(x) cout << #x << " : " << x << '\n'
const int INF = 1e9;
const LL LINF = 1e16;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
LL ans;
int N;
cin >> N;
vector<LL> a(N);
vector<LL> sum(N);
LL acc = 0;
FOR(i, 0, N) {
cin >> a[i];
acc += a[i];
sum[i] = acc;
}
ans = LINF;
LL temp;
FOR(i, 0, N - 1) {
temp = abs(sum[i] - (sum[N - 1] - sum[i]));
ans = min(ans, temp);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
bool compare(string a, string b) {
if (a.length() == b.length()) {
for (int i = 0; i < a.length(); i++) {
if (a[i] == b[i]) continue;
else return a[i] < b[i];
}
} else {
return a.length() < b.length();
}
return true;
}
signed main() {
int N, M;
cin >> N >> M;
vector<int> match = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<vector<string>> dp(20, vector<string>(N + 5, ""));
vector<int> use(M);
for (int i = 0; i < M; i++) cin >> use[i];
for (int i = 1; i <= N; i++) {
for (int j = 0; j < M; j++) {
for (int k = 0; k < M; k++) {
if (match[use[k]] > i) continue;
if (dp[use[k]][i - match[use[k]]] != "" || i - match[use[k]] == 0) dp[use[j]][i] = max(dp[use[j]][i], dp[use[k]][i - match[use[k]]] + to_string(use[k]), compare);
}
}
}
string ans = "";
for (int i = 1; i <= 10; i++) ans = max(ans, dp[i][N], compare);
cout << ans << endl;
}
| 0
| 84,892,877
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,e,n,k,maxi=0,f=0,mini=INF,sum=0,q;
string str,stra,straa;
ll x,y,w,z;
char ca,cb,cc;
cin>>ca>>cb>>cc;
map<char,ll> ma;
ma[ca]++;
ma[cb]++;
ma[cc]++;
if(ma['a']&&ma['b']&&ma['c']) Yes;
else No;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
vector<ll> fac(1000001);
vector<ll> ifac(1000001);
const ll M = pow(10,9)+7;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*x % M;
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] % M;
return tmp * fac[a] % M;
}
int main(){
ll X,Y;
cin >> X >> Y;
ll ans=0;
ll a,b;
fac[0] = 1;
ifac[0] = 1;
a = (2*Y-X)/3;
b = (2*X-Y)/3;
for(ll i = 0; i<a+b; i++){
fac[i+1] = fac[i]*(i+1) % M;
ifac[i+1] = ifac[i]*mpow(i+1, M-2) % M;
}
if((X+Y)%3!=0) ans=0;
else{
if(a>=0 && b>=0) ans = comb(a+b,a)% M;
}
cout << ans << endl;
}
| 0
| 83,801,723
|
#include <iostream>
#include <cstdio>
#define N 3002
using namespace std;
int n,m,k,l,r,u,d,i,j,ans[N][N];
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
int x=i+j,y=i-j+m-1;
l=min(l,y);r=max(r,y);
u=min(u,x);d=max(d,x);
}
}
for(i=u;i<=d;i++){
for(j=l;j<=r;j++){
int x=i+1,y=j+1;
if(((x-1)/k)%2==0){
if(((y-1)/k)%2==0) ans[i][j]=1;
else ans[i][j]=2;
}
else{
if(((y-1)/k)%2==0) ans[i][j]=3;
else ans[i][j]=4;
}
}
}
for(i=0;i<n;i++){
for(j=0;j<m;j++){
int x=i+j,y=i-j+m-1;
if(ans[x][y]==1) printf("R");
else if(ans[x][y]==2) printf("Y");
else if(ans[x][y]==3) printf("G");
else printf("B");
}
puts("");
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
int main()
{
int K, S;
cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int num = S - x - y;
if (num >= 0 && num <= K) ans++;
}
}
cout << ans << endl;
}
| 0
| 43,138,829
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n,m;
cin >> n >> m;
vector<ll> a(n);
for(int i =0;i<n;i++)
{
cin>>a[i];
}
ll lcm = a[0]/2;
for(int i = 1;i<n;i++)
{
a[i]/=2;
ll g = __gcd(a[i],lcm);
ll p = lcm;
lcm = a[i]/g*lcm;
if(
lcm>m||
(lcm/p)%2==0||
(lcm/a[i])%2==0)
{
cout << 0 << endl;
return 0;
}
}
cout << (m+lcm)/(2*lcm) << endl;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
int a, b;
string s;
cin >> a >> b >> s;
rep (i, a+b+1) {
if (i == a) {
if (s[i] != '-') {
cout << "No" << endl;
return 0;
}
}
else {
if (s[i] == '-') {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 661,798
|
#include <bits/stdc++.h>
using namespace std;
double pai = 3.14159265;
int main(){
cout << fixed << setprecision(8);
double a,b,C;
cin >> a >> b >> C;
C = C / 180 * pai;
double S,L,h;
S = a * b * sin(C) / 2;
double c = sqrt(pow(a,2) + pow(b,2) - 2 * a * b * cos(C));
L = a + b + c;
h = S * 2 / a;
cout << S << endl << L << endl << h;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >>x;
int kazu=x/100;
int amari=x%100;
for(int i=0;i<=kazu;i++){
for(int j=0;j<=kazu;j++){
for(int k=0;k<=kazu;k++){
for(int m=0;m<=kazu;m++){
for(int n=0;n<=kazu;n++){
if(i+j*2+k*3+m*4+n*5==amari&&i+j+k+m+n<=kazu){
cout<<1<<endl;
return 0;
}
if(i+j+k+m+n>kazu)break;
}
}
}
}
}
cout<<0<<endl;
return 0;
}
| 0
| 43,559,943
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define abdelrahman010 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int N = 1e3 + 5;
string s;
int n , p;
ll ans;
map<int , int> mp;
int main() {
abdelrahman010
cin >> n >> p >> s;
int acc = 0;
if(p == 2 || p == 5) {
for(int i = n - 1;i >= 0;i--) {
if((s[i] - '0') % p == 0)
acc++;
ans += acc;
}
} else {
mp[0]++;
int pw = 1;
for(int i = n - 1;i >= 0;i--) {
acc = (acc + (1ll * pw * (s[i] - '0')) % p) % p;
pw = (10ll * pw) % p;
ans += mp[acc]++;
}
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<int> sort(vector<int> vec) {
sort(vec.begin(), vec.end());
return vec;
}
vector<int> resort(vector<int> vec) {
sort(vec);
reverse(vec.begin(), vec.end());
return vec;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table. at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n,r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) {
return comb(n + r - 1, n - 1);
}
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b){
if (a % b == 0){
return(b);
}else{
return(gcd(b, a % b));
}
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
string s;
cin >> s;
bool flag = true;
if (s[0] != 'A') {
flag = false;
}
string t = s.substr(2, s.size() - 3);
sort(t.begin(),t.end());
if (t[0] != 'C') {
flag = false;
}
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (islower(s[i])) {
cnt++;
}
}
if (cnt != s.size() - 2) {
flag = false;
}
if (flag) {
cout << "AC" << endl;
}
else {
cout << "WA" << endl;
}
}
| 0
| 99,324,614
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
sort(A.begin(), A.end());
bool t = true;
while (t) {
t = false;
REP(i, N) {
if (A[i] % A[0] == 0) continue;
A[i] = A[i] % A[0];
t = true;
}
sort(A.begin(), A.end());
}
cout << A[0] << endl;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const ll INF=2e15;
const double PI=acos(-1);
vector<pair<ll,int>> vectorCnt(vector<ll> a) {
sort(a.begin(),a.end());
int n=a.size();
vector<pair<ll,int>> b;
int cnt=1;
rep(i,n-1) {
if (a[i+1]!=a[i]) {
b.push_back(make_pair(a[i],cnt));
cnt=1;
} else {
++cnt;
}
}
b.push_back(make_pair(a[n-1],cnt));
return b;
}
int main() {
ios_base::sync_with_stdio(false);
ll n,m;
cin >> n >> m;
vector<ll> a(n+1);
ll ans=0;
rep(i,n) cin >> a[i+1];
rep(i,n) {
a[i+1]+=a[i];
a[i+1]=a[i+1]%m;
}
vector<pair<ll,int>> b=vectorCnt(a);
rep(i,b.size()) {
ll cnt=b[i].second;
ans+=cnt*(cnt-1)/2;
}
cout << ans << endl;
return 0;
}
| 0
| 11,427,932
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll n;
cin >> n;
ll nn = 1ll<<n;
vector<ll> a(nn);
for(auto &e: a) cin >> e;
using P = pair<ll, ll>;
P z = P(-1, -1);
vector<ll> r(nn, 0);
r[0] = a[0];
vector<P> m1(nn, z), m2(nn, z);
m1[0] = P(a[0], 0);
for(ll k=1; k<nn; k++) {
P mm1 = z, mm2 = z;
for(ll i=0; i<20; i++) {
ll j = k & ~(1ll<<i);
if(k == j) continue;
for(auto &t: {m1[j], m2[j]}) {
if(t.second == mm1.second || t.second == mm2.second) continue;
if(t.first > mm1.first)
mm2 = mm1, mm1 = t;
else if(t.first > mm2.first)
mm2 = t;
}
}
if(a[k] > mm1.first)
mm2 = mm1, mm1 = P(a[k], k);
else if(a[k] > mm2.first)
mm2 = P(a[k], k);
m1[k] = mm1;
m2[k] = mm2;
r[k] = max(r[k-1], mm1.first + mm2.first);
}
for(ll k=1; k<nn; k++)
cout << r[k] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
char ans;
int main() {
vector<int> digit(9);
for(int i = 0; i < 9; i++) {
int ok = -1;
int ng = 9;
if(i == 0) ok = 0;
while(ng - ok > 1) {
int mid = (ok + ng) / 2;
cout << "? ";
for(int j = 0; j < i; j++) cout << digit[j];
cout << mid;
for(int j = 0; j < 9; j++) cout << "9";
cout << endl;
cin >> ans;
if(ans == 'Y') ng = mid;
else ok = mid;
}
digit[i] = ok + 1;
}
digit.push_back(0);
while(digit.back() == 0) {
vector<int> sub;
for(int i = 0; i < digit.size(); i++) sub.push_back(digit[i]);
ll a = 0;
ll b = 0;
for(int i = 0; i < sub.size(); i++) {
a *= 10;
a += sub[i];
}
for(int i = 0; i + 1 < sub.size(); i++) {
b *= 10;
b += sub[i];
}
ll query = (a + b) / 2;
cout << "? " << query << endl;
cin >> ans;
if((ans == 'N') ^ (to_string(query) <= to_string(b))) break;
digit.pop_back();
}
cout << "! ";
for(int i = 0; i < digit.size(); i++) cout << digit[i];
cout << endl;
return 0;
}
| 0
| 95,036,858
|
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll k; cin >> k;
queue<ll> que;
rep(i, 9) que.push(i+1);
ll cnt = 0, x = 0;
while(cnt != k){
x = que.front(); que.pop();
if(x%10 != 0) que.push(10*x + x%10 - 1);
que.push(10*x + x%10);
if(x%10 != 9) que.push(10*x + x%10 + 1);
cnt++;
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 10000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N , K;
cin >> N >> K;
K = min(N,K);
string S;
cin >> S;
vector<int> a(4*N+2, 0);
a[0] = 0; a[1] = 0;
int cnt = 0;
int nowi = 2;
char tmpchar = '0';
for(char i: S){
if(i == tmpchar){
}
else{
a[nowi] = cnt;
nowi++;
tmpchar = i;
}
cnt++;
}
for(;nowi < 4*N+2; nowi++){
a[nowi] = cnt;
}
int maxi = 0;
for (int i = 0; i < 4*N-(2*K+1); i += 2) {
maxi = max(maxi, a[i+2*K+1]-a[i]);
}
printf("%d\n", maxi);
}
| 0
| 4,272,176
|
#include<bits/stdc++.h>
using namespace std;
#define N 2000000
#define INFTY (1<<30)
int H, Heap[N+1];
void maxHeapify(int i){
int largest, tmp;
int l = 2 * i;
int r = 2 * i + 1;
if(l <= H && Heap[l] > Heap[i]){
largest = l;
}
else{
largest = i;
}
if(r <= H && Heap[r] > Heap[largest]){
largest = r;
}
if(largest != i){
tmp = Heap[i];
Heap[i] = Heap[largest];
Heap[largest] = tmp;
maxHeapify(largest);
}
}
void increaseKey(int i, int key){
int tmp;
if(key < Heap[i]){
return;
}
Heap[i] = key;
while(i > 1 && Heap[i/2] < Heap[i]){
tmp = Heap[i];
Heap[i] = Heap[i/2];
Heap[i/2] = tmp;
i /= 2;
}
}
void insert(int key){
H++;
Heap[H] = -INFTY;
increaseKey(H, key);
}
int extract(){
int max;
if(H < 1){
return -INFTY;
}
max = Heap[1];
Heap[1] = Heap[H--];
maxHeapify(1);
return max;
}
int main(){
int key;
string status;
while(1){
cin >> status;
if(status == "end"){
break;
}
if(status == "insert"){
cin >> key;
insert(key);
}
else{
cout << extract() << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<string> s(0);
vector<int> p(0);
rep(i, n) {
string si;
cin >> si;
bool hit = false;
rep(j, s.size()) {
if (s.at(j) == si) {
p.at(j)++;
hit = true;
break;
}
}
if (!hit) {
s.push_back(si);
p.push_back(1);
}
}
cin >> n;
rep(i, n) {
string si;
cin >> si;
rep(j, s.size()) {
if (s.at(j) == si) {
p.at(j)--;
break;
}
}
}
int max = 0;
rep(j, s.size()) if (p.at(j) > max) max = p.at(j);
cout << max << endl;
}
| 0
| 24,432,192
|
#include <cstdio>
int main() {
int ary[20],s=0,x;
while(scanf("%d", &x)==1) {
if(x) ary[s++] = x;
else printf("%d\n", ary[--s]);
}
return 0;
}
|
#include <cstdio>
int P[201];
int main() {
int m, nmin, nmax;
while (true) {
scanf("%d %d %d", &m, &nmin, &nmax);
if (m == 0 && nmin == 0 && nmax == 0) break;
for (int i=0;i<m;i++) scanf("%d", &P[i]);
int max_gap = -1, max_n = -1;
for (int n=nmin;n<=nmax;n++) {
const int gap = P[n-1]-P[n];
if (gap >= max_gap) {
max_gap = gap;
max_n = n;
}
}
printf("%d\n", max_n);
}
return 0;
}
| 0
| 30,995,010
|
#include <iostream>
using namespace std;
int main (int argc, char **argv) {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int x = a;
while (x <= b) {
if (c % x == 0) cnt++;
x++;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
int main() {
auto c = make_vec<char>(2, 3);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 3; j++) {
cin >> c[i][j];
}
}
if (c[0][0] == c[1][2] && c[1][0] == c[0][2] && c[0][1] == c[1][1]) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
| 0
| 67,035,563
|
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s;
cin >> s;
for (size_t i = 0; i < s.size(); i++) {
cout << s.at(i);
if (i == 3)
cout << " ";
}
cout << endl;
}
|
#include <iostream>
#include <climits>
using namespace std;
int main() {
while(1) {
int n;
cin >> n;
if(n == 0) break;
int max = INT_MIN;
int maxBfr = INT_MIN;
int bfr = INT_MIN;
int before = INT_MIN;
int temp;
for(int i = 0; i < n; i++) {
cin >> temp;
if(maxBfr > 0) {
maxBfr += bfr;
} else {
maxBfr = bfr;
}
int sum;
sum = maxBfr+temp;
if(maxBfr != INT_MIN && sum > max && sum > temp) {
max = sum;
} else if(temp > max) {
max = temp;
}
bfr = temp;
}
cout << max << endl;
}
return 0;
}
| 0
| 27,015,465
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
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; }
const ll MOD = 1e9 + 7;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min({ a + b,b + c,c + a }) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl "\n"
const int mod = 1e9+7;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { int res = a - b; if(res < 0) res += mod; return res;}
inline int mul(int a, int b) { return (a * b)%mod; }
void solve() {
int n; cin >> n;
int pos[n+1]; pos[0] = 0;
for(int i=1; i<=n; i++) {
int x; cin >> x;
pos[x] = i;
}
int ans = 0;
multiset<int> s;
s.insert(0); s.insert(0);
s.insert(n+1); s.insert(n+1);
s.insert(pos[n]);
for(int cur=n-1; cur>0; cur--) {
int l1, l2, r1, r2;
int cp = pos[cur];
auto it = s.lower_bound(cp);
r1 = *it;
auto it2 = it;
it2++;
r2 = *it2;
it2 = (--it);
l1 = *it2;
l2 = *(--it2);
ans += cur * ((cp-l1)*(r2-r1) + (l1-l2)*(r1-cp));
s.insert(cp);
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(18);
int T = 1;
while(T--) {
solve();
}
return 0;
}
| 0
| 65,619,433
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
string s;
cin >> s;
if(s=="-")
break;
int m;
cin >> m;
for(int i=0; i<m; i++){
int h;
cin >> h;
string s1 = s.substr(0, h);
string s2 = s.substr(h);
s = s2+s1;
}
cout << s << endl;
}
return 0;
}
|
#include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
int N,A[100005],L[100005];
int main()
{
L[0]=0;
cin>>N;
int i,j;
for(i=1;i<=N;i++){
cin>>A[i];
}
int len=1;
L[0]=A[1];
for(i=1;i<=N;i++){
if(L[len-1]<A[i])L[len++]=A[i];
else *lower_bound(L,L+len,A[i])=A[i];
}
cout<<len<<endl;
return 0;
}
| 0
| 3,505,277
|
#include <iostream>
#include <stack>
using namespace std;
int main()
{
string s;
while(1){
getline(cin,s);
if(s == ".")
break;
stack<char> b;
bool flag = true;
for(int i = 0; i < s.size(); i++){
if(s[i] == '('){
b.push('(');
}else if(s[i] == '['){
b.push('[');
}else if(s[i] == ')'){
if(b.empty() || b.top() != '('){
cout << "no" << endl;
flag = false;
break;
}
b.pop();
}else if(s[i] == ']'){
if(b.empty() || b.top() != '['){
cout << "no" << endl;
flag = false;
break;
}
b.pop();
}
}
if(b.empty() && flag)
cout << "yes" << endl;
else if(!b.empty() && (b.top() == '(' || b.top() == '[') && flag)
cout << "no" << endl;
}
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 100000000;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
const ll MAX = 200010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll h,w,d;
cin >> h >> w >> d;
vector<P> place(h*w+1);
ll a;
rep(i,h){
rep(j,w){
cin >> a;
place[a] = P(i,j);
}
}
vector<vector<ll>> power(d);
rep(i,d) power[i].push_back(0);
rep(i,d,h*w+1){
ll x,y,nx,ny;
tie(x,y) = place[i-d];
tie(nx,ny) = place[i];
power[i%d].push_back(abs(nx-x)+abs(ny-y));
}
rep(i,d){
rep(j,power[i].size()-1){
power[i][j+1] += power[i][j];
}
}
ll q;
cin >> q;
ll l,r;
rep(i,q){
cin >> l >> r;
PRINT(power[l%d][r/d]-power[l%d][l/d]);
}
}
| 0
| 41,384,475
|
#include <bits/stdc++.h>
using namespace std;
inline int ceiling_div(int a, int b){
return (a+b-1)/b;
}
int main(){
using station= tuple<int, int, int>;
int N,atTstart,forTwait,forTtrans;
cin >> N;
vector<station> data(N);
for(int i=0; i<N-1; i++){
cin >> forTtrans >> atTstart >> forTwait;
data.at(i)= make_tuple(atTstart, forTwait, forTtrans);
}
data.back()= make_tuple(0, 1, 0);
vector<int> ans(N);
for(int s=0; s<N-1; s++){
int atTarrive= 0;
for(int i=s; i<N; i++){
tie(atTstart, forTwait, forTtrans)= data.at(i);
int atToff= atTstart+ forTwait* max(0, ceiling_div(atTarrive- atTstart, forTwait));
atTarrive= atToff+ forTtrans;
}
ans.at(s)= atTarrive;
}
for(auto elem:ans){
cout << elem << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const double pi = 3.141592653589793;
int main(){
ll H, W, D;
cin>>H>>W>>D;
vector<vector<ll>> A(H, vector<ll>(W));
map<ll, pair<ll, ll>> M;
rep(i, H){
rep(j, W){
cin>>A[i][j];
A[i][j]--;
M[A[i][j]]=make_pair(i, j);
}
}
vector<ll> Dist(H*W);
rep(i, H*W){
if(i-D<0){
Dist[i]=0;
}
else{
Dist[i]=Dist[i-D]+abs(M[i].first-M[i-D].first)+abs(M[i].second-M[i-D].second);
}
}
ll Q;
cin>>Q;
vector<ll> L(Q), R(Q);
rep(i, Q){
cin>>L[i]>>R[i];
cout<<Dist[R[i]-1]-Dist[L[i]-1]<<endl;
}
}
| 0
| 5,532,364
|
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
using namespace std;
using ll = long long;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll>> PP;
const ll MOD = 1e9 + 7;
const ll INF = 1 << 30;
const ll INF2 = 9e18;
const double INF3 = 9e14;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 };
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
#define fr first
#define sc second
struct edge { ll to, cost; };
std::vector<edge>v[100010];
ll d[100010];
void dijkstra(ll n) {
for (int i = 0;i <= n;i++) {
d[i] = INF;
}
d[1] = 1;
std::priority_queue<P, std::vector<P>, std::greater<P>>pq;
pq.push(P(d[1], 1));
while (!pq.empty()) {
P a = pq.top();
pq.pop();
ll i = a.second;
if (d[i] < a.first)continue;
for (int k = 0;k < v[i].size();k++) {
edge e = v[i][k];
if (d[e.to] <= d[i] + e.cost)continue;
d[e.to] = d[i] + e.cost;
pq.push(P(d[e.to], e.to));
}
}
return;
}
int main() {
ll k;
cin >> k;
for (int i = 0;i < k;i++) {
v[i].pb(edge{ (i + 1) % k, 1 });
}
for (int i = 1;i < k;i++) {
if ((i * 10) % k != i)v[i].pb(edge{ (i * 10) % k,0 });
}
dijkstra(k);
cout << d[0] << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define P(s) cout << s << endl
#define PC(condition, _true, _false) if (condition) _true; else _false;
#define toInt(_char) _char - '0'
using namespace std;
int main() {
while (true) {
int n = 0;
cin >> n;
if (n == 0) break;
int a[1001];
FOR(i, 0, n) {
cin >> a[i];
}
int dif = 999999999;
FOR(i, 0, n) {
FOR(j, i + 1, n) {
dif = min(dif, abs(a[i] - a[j]));
}
}
P(dif);
}
}
| 0
| 80,184,636
|
#include <iostream>
#include <string.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i < n+1; i++){
char* num = (char*)calloc(10, sizeof(char));
snprintf(num, 10,"%d", i);
int sum = 0;
while(*num != '\0'){
sum += *num - 48;
num++;
}
if(sum >= a && sum <= b) {
ans += i;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
int main() {
string A, B;
cin >> A >> B;
if (A.size() > B.size()) {
cout << "GREATER" << endl;
return 0;
}
if (A.size() < B.size()) {
cout << "LESS" << endl;
return 0;
}
for (int i = 0; i < A.size(); i++) {
if (A.at(i) > B.at(i)) {
cout << "GREATER" << endl;
return 0;
}
if (A.at(i) < B.at(i)) {
cout << "LESS" << endl;
return 0;
}
if (i == A.size() - 1) {
cout << "EQUAL" << endl;
return 0;
}
}
}
| 0
| 9,000,149
|
#include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int S;
cin >> S;
const int mod = 1e9 + 7;
vector<ll> dp(S + 1);
dp[0] = 1;
for (int i = 3; i <= S; i++) {
for (int j = 3; j <= i; j++)
dp[i] = (dp[i] + dp[i-j]) % mod;
}
cout << dp[S];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
cout << nl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
int main() {
int N;
cin >> N;
vi t(N),a(N);
rep(i,N) {
cin >> t[i];
}
rep(i,N) {
cin >> a[i];
}
vi ans(N,-1);
rep(i,N) {
if(i == 0){
ans[i] = t[i];
} else if(t[i-1] != t[i]) {
ans[i] = t[i];
}
}
drep(i,N) {
if(i == N-1) {
if(ans[i] == -1) {
ans[i] = a[i];
} else {
if(ans[i] > a[i]){
cout << 0 << endl;
return 0;
}
}
} else {
if(a[i] == a[i+1]) continue;
if(ans[i] == -1) {
if(t[i] < a[i]) {
cout << 0 << endl;
return 0;
} else {
ans[i] = a[i];
}
} else {
if(ans[i] < a[i]){
cout << 0 << endl;
return 0;
}
}
}
}
ll c = 1;
rep(i,N) {
if(ans[i] == -1) {
c *= min(t[i],a[i]);
}
c %= MOD;
}
cout << c << endl;
return 0;
}
| 0
| 10,449,590
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll n;string s;
bool ans=false;
bool ch[100010];
void dep(bool one){
for(ll i=1;i<n;i++){
bool now=true;
if(s[i]=='x'){
now=false;
}
ll nex=i+1;
if(nex==n){
nex=0;
}
if(now==ch[i]){
ch[nex]=ch[i-1];
}
else{
ch[nex]=abs(ch[i-1]-1);
}
}
if(ch[0]!=one){
return;
}
bool nex;
bool fi=true;
if(s[0]=='x'){
fi=false;
}
if(ch[0]==fi){
nex=ch[n-1];
}
else{
nex=abs(ch[n-1]-1);
}
if(ch[1]==nex){
for(ll i=0;i<n;i++){
if(ch[i]){
cout << "S";
}
else{
cout << "W";
}
}
ans=true;
}
}
int main() {
cin>>n>>s;
ch[0]=true;ch[1]=true;
dep(ch[0]);
if(ans){
return 0;
}
ch[0]=true;ch[1]=false;
dep(ch[0]);
if(ans){
return 0;
}
ch[0]=false;ch[1]=false;
dep(ch[0]);
if(ans){
return 0;
}
ch[0]=false;ch[1]=true;
dep(ch[0]);
if(ans){
return 0;
}
cout << -1;
return 0;
}
|
#include <stdio.h>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 0;
scanf("%lld%lld", &n, &k);
if(k == 1) {
printf("0");
return 0;
}
ll sum[n + 1], a[n];
sum[0] = 0;
set< pair<ll, ll> > s;
set< pair<ll, ll> >::iterator it;
pair<ll, ll> p;
for(i = 0; i < n; ++i) scanf("%lld", &a[i]), sum[i + 1] = (sum[i] + --a[i]) % k;
if(k <= n) {
for(i = 1; i < k; ++i) {
p = make_pair(sum[i], 1);
if((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i]) p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for(i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i]) ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
if(p.second) s.insert(p);
if(i + k <= n) {
p = make_pair(sum[i + k], 1);
if((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i + k]) p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
}
} else {
for(i = 1; i <= n; ++i) {
p = make_pair(sum[i], 1);
if((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i]) p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for(i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i]) ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
if(p.second) s.insert(p);
}
}
printf("%lld", ans);
return 0;
}
| 0
| 10,636,962
|
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <unordered_map>
#include <stdlib.h>
#include <time.h>
#include <string>
const int MAX_N = 350;
int N;
std::string S[MAX_N];
bool is_good[MAX_N][MAX_N];
bool calc_is_good(int i, int j) {
for (int k = 0; k < N; k++) {
if (S[(i + k) % N][j] != S[i][(j + k) % N]) {
return false;
}
}
return true;
}
int main(int argc, char **argv) {
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
is_good[i][j] = calc_is_good(i, j);
}
}
int ret = 0;
for (int i = 0; i < N; i++) {
bool is_all_good = true;
for (int k = 0; k < N; k++) {
if (!is_good[k][(i + k) % N]) {
is_all_good = false;
break;
}
}
if (is_all_good) {
ret += N;
}
}
std::cout << ret << std::endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int n,i,d;
string s;
cin>>n>>s;
if(n%2!=0)
cout<<"No"<<endl;
else
{
d = n/2;
bool ok = true;
for(i=0;i<d;i++)
{
if(s[i]!=s[i+d])
{
ok = false;
break;
}
}
if(ok)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}
| 0
| 25,042,691
|
#include<bits/stdc++.h>
using namespace std;
signed main(){
int h,w;
string c,d;
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>c;
if(c=="snuke"){
d=64+j;
cout<<d<<i<<"\n";
}
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n, k;
cin >> n >> k;
vector<int> int_seq(n);
rep(i, n){cin >> int_seq.at(i);}
rep(i, n){int_seq[i]--;}
vector<int> cumulative_sum(n+1);
for (int i = 0; i < (n); ++i){
cumulative_sum[i+1] = (cumulative_sum[i] + int_seq[i]) % k;
}
map<int, int> cntr;
long long ans = 0;
queue<int> q;
for (int i = 0; i < (n+1); ++i){
ans += cntr[cumulative_sum[i]];
cntr[cumulative_sum[i]]++;
q.push(cumulative_sum[i]);
if (q.size() == k){
cntr[q.front()]--;
q.pop();
}
}
cout << ans << endl;
return 0;
}
| 0
| 41,514,358
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
SORT(s);
REP(i,s.length()-1){
if(s[i]==s[i+1]){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, m;
cin >> h >> w >> m;
int it, jt;
set<pair<int, int>> obj;
vector<int> ci(h), cj(w);
rep(i, m) {
cin >> it >> jt;
it--; jt--;
obj.emplace(make_pair(it, jt));
ci[it]++;
cj[jt]++;
}
int mi = *max_element(ci.begin(), ci.end());
int mj = *max_element(cj.begin(), cj.end());
vector<int> mei, mej;
rep(i, h) if(ci[i] == mi) mei.emplace_back(i);
rep(j, w) if(cj[j] == mj) mej.emplace_back(j);
int cnt = obj.size();
for(int i: mei) {
for(int j: mej) {
if(obj.find(make_pair(i, j)) == obj.end()) {
printf("%d\n", mi + mj);
return 0;
} else if(cnt == 0) break;
cnt--;
}
}
printf("%d\n", mi + mj - 1);
return 0;
}
| 0
| 59,681,948
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 1; i < s.size(); ++i)
if (s[i] == s[i-1]) --n;
cout << n << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x) cout<<"debug: "<<x<<endl
int k, a, b;
int main() {
cin >> k >> a >> b;
rep(i, a, b+1){
if(i%k == 0){
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
return 0;
}
| 0
| 80,610,683
|
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
int main(){
int h,w;
cin >> h >> w;
char s[h+2][w+2];
for(int i=0;i<h+2;i++){
if(i==0 || i==h+1){
for(int j=0;j<w+2;j++) s[i][j]='.';
}else{
for(int j=0;j<w+2;j++){
if(j==0 || j==w+1){
s[i][j]='.';
}else{
cin >> s[i][j];
}
}
}
}
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
if(s[i][j]=='#'){
if(s[i+1][j]=='.' && s[i-1][j]=='.' && s[i][j+1]=='.' && s[i][j-1]=='.'){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 100+5;
int h,w;
char c[maxn][maxn];
bool fh[maxn];
bool fw[maxn];
void solve() {
for (int i = 1; i <= h; i++) {
bool flag = true;
for (int j = 1; j <= w; j++) {
if (c[i][j] == '#') {
flag = false;
break;
}
}
if (flag) fh[i] = true;
}
for (int j = 1; j <= w; j++) {
bool flag = true;
for (int i = 1; i <= h; i++) {
if (c[i][j] == '#') {
flag = false;
break;
}
}
if (flag) fw[j] = true;
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if (fh[i] || fw[j]) continue;
cout << c[i][j];
}
if (!fh[i]) cout << endl;
}
}
int main() {
scanf("%d%d",&h,&w);
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++){
cin >> c[i][j];
}
}
solve();
return 0;
}
| 0
| 16,208,341
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s; cin >> s;
vector <int> counter(26, 0);
long long ans = 1;
for (auto c: s){
int ord = c - 'a';
counter.at(ord) += 1;
}
for (auto cnt: counter){
ans *= cnt + 1;
ans %= 1000000007;
}
cout << ans - 1 << endl;
}
|
#include <iostream>
int main() {
char c; std::cin >> c;
switch (c)
{
case 'A':
std::cout << 'T' << std::endl;
break;
case 'C':
std::cout << 'G' << std::endl;
break;
case 'G':
std::cout << 'C' << std::endl;
break;
case 'T':
std::cout << 'A' << std::endl;
break;
default:
break;
}
return 0;
}
| 0
| 97,301,925
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void solve() {
int h, w, d;
cin >> h >> w >> d;
if (d % 2) {
rep(i, h) {
rep(j, w) {
cout << ((i + j) % 2 ? "R" : "Y");
}
cout << endl;
}
return;
} else {
d /= 2;
rep(i, h) {
rep(j, w) {
string colors = "RGBY";
int x = (j + i) / 2;
int y = (w + i - j) / 2;
int color = ((x / d) % 2) * 2 + (y / d) % 2;
cout << colors[color];
}
cout << endl;
}
}
}
int main() {
solve();
return 0;
}
| 0
| 33,244,189
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int H,W,A,B; cin>>H>>W>>A>>B;
rep(i,0,B){
rep(j,0,A) cout<<0;
rep(j,A,W) cout<<1;
cout<<endl;
}
rep(i,B,H){
rep(j,0,A) cout<<1;
rep(j,A,W) cout<<0;
cout<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
ll T = 1;
ll n, x, m, y, k, z, N;
string s, t, d, c;
void MAIN() {
cin >> n;
vector<vll> cnt(26,vll(n));
ll mini;
for(ll i=0;i<n;i++) {
cin>>s;
for(auto ch : s) {
cnt[ch-'a'][i]++;
}
}
for(ll i=0;i<26;i++) {
mini = INT_MAX;
for(ll j=0;j<n;j++) mini = min(mini,cnt[i][j]);
for(ll j=0;j<mini;j++) cout<<(char)('a'+i);
}
newl;
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
| 0
| 15,634,385
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
int a,b,c;
cin>>a>>b>>c;
if(c>=a && c<=b)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
const ll mk = 200055;
const ll logn = 29;
const ll mod = 1e9 + 7;
#define endl "\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define pii pair<ll,ll>
#define mp make_pair
#define pq priority_queue<int, std::vector<int>, std::greater<int> >
#define rep(i, n) for(int i = 0 ; i < n ; i++)
#define repf(i , n ) for(int i = 1; i <= n ; i++)
#define pb push_back
int dp[1 << 20] ;
int a[1 << 20] , n ;
void init() {
cin >> n ;
for(int i = 0 ; i < (1 << n) ; i++) cin >> a[i];
for(int i = 1 ; i < (1 << n) ; i++) {
int x = 0 , y = 0;
for(int sub_mask = i ; ; sub_mask = (sub_mask - 1) & i)
{
if(a[sub_mask] > y) x = y, y = a[sub_mask];
else if(a[sub_mask] > x) x = a[sub_mask];
if(!sub_mask) break;
}
dp[i] = max(dp[i - 1] , x + y);
cout << dp[i] << endl;
}
}
signed main() {
init();
}
| 0
| 100,631,045
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main(){
int N;
cin>>N;
vector<int> D(N);
for(int i=0;i<N;i++){
cin>>D.at(i);
}
if(D.at(0)!=0){
cout<<0<<endl;
}else{
map<int,int> m;
int k=0;
for(int i=0;i<N;i++){
if(m.count(D.at(i))==0){
m[D.at(i)]=0;
}
m[D.at(i)]++;
k=max(D.at(i),k);
}
if(m[0]>1){
cout<<0<<endl;
}else{
ll ans=1;
for(int i=1;i<=k;i++){
for(int j=0;j<m[i];j++){
ans*=(ll)m[i-1];
ans%=MOD;
}
}
cout<<ans<<endl;
}
}
}
|
#include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
string s;
cin >> s;
int size = s.size();
int count = 0;
vector<int> xcount;
vector<char> notx;
rep(i, size){
if(s[i] == 'x'){
count++;
}else{
notx.push_back(s[i]);
xcount.push_back(count);
count = 0;
}
}
xcount.push_back(count);
int ans = 0;
rep(i, xcount.size() / 2){
ans += max(xcount[i], xcount[xcount.size() - 1 - i]) - min(xcount[i], xcount[xcount.size() - 1 - i]);
}
rep(i, notx.size()){
if(notx[i] != notx[notx.size() - 1 - i]){
ans = -1;
break;
}
}
cout << ans << endl;
return 0;
}
| 0
| 79,355,135
|
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i < n; i++)
string s[10010];
int main(void)
{
int n;
cin >> n;
REP(i, n) cin >> s[i];
int cnt = 0, ca = 0, cb = 0, cab = 0,a,b;
REP(i, n) {
REP(j, s[i].length()-1) {
if(s[i][j] == 'A' && s[i][j+1] == 'B') cnt++;
}
a = (s[i][s[i].length()-1] == 'A')?1:0;
b = (s[i][0] == 'B')?1:0;
if(a+b==2) {
cab ++;
} else {
ca += a;
cb += b;
}
}
if(cab==0) {
cnt += min(ca,cb);
} else {
if(ca+cb>0) {
cnt += cab+min(ca,cb);
} else {
cnt += cab-1;
}
}
cout << cnt << endl;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){
o<<"{";
for(int i=0;i<(int)v.size();i++) o << (i>0?", ":"") << v[i];
o<<"}";
return o;
}
int main() {
string S;
cin >> S;
vector<string> cand={"dreamer","dream","eraser","erase"};
rep(i,4) reverse(cand[i].begin(),cand[i].end());
reverse(S.begin(),S.end());
int now=0;
while (now<S.size()) {
bool f=false;
for(auto i:cand) {
if (S.substr(now,i.size())==i) {
f=true;
now+=i.size();
}
}
if (f) continue;
else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
}
| 0
| 64,922,597
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n, m;
cin >> n >> m;
ll x = min(n, m / 2);
n -= x;
m -= 2 * x;
if (m > 1) {
x += m / 4;
}
cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout<<setprecision(x)<<fixed;
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
ll MOD=1e9+7;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod=MOD){ return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
if(a.ff != b.ff)return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N=(ll)1e5+11;
ll const LG=(ll)log2(N)+1;
void solve(){
ll i,j,k,l,n,m,x,y,z,r;
cin>>n>>k;
vll a(n+1);
for(i=1;i<=n;i++){
cin>>a[i];
}
ll ans=0;
for(i=0;i<=k;i++){
for(j=0;j<=k;j++){
if(i+j<=k && i+j<=n){
vll tmp;
ll sum=0;
for(x=1;x<=i;x++){
tmp.pb(a[x]);
sum+=a[x];
}
for(x=n;x>n-j;x--){
tmp.pb(a[x]);
sum+=a[x];
}
sort(all(tmp));
ll rem=k-i-j;
ll tt=0;
ans=max(ans,sum);
for(x=0;x<min(rem,(ll)(tmp.sz));x++){
tt+=tmp[x];
ans=max(ans,sum-tt);
}
}
}
}
cout<<ans<<endl;
}
int main(){
FS;
ll i,j,k,n,m,x,y,z,q;
q=1;
while(q--){
solve();
}
return 0;
}
ll pow1(ll n,ll m,ll mod){
if(m==0)return 1;
if(m%2==0)return pow1((n*n)%mod,m/2,mod);
return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
ll ans=1;
while(k>0){
if(k%2==1)ans=ans*n;
n=n*n;
k/=2;
}
return ans;
}
| 0
| 5,258,939
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll LCM(ll x, ll y);
int main() {
ll A, B, C, D, E, sum;
cin >> A >> B >> C >> D;
sum = 0;
E = LCM(C, D);
sum += B / C;
sum -= (A - 1) / C;
sum += B / D;
sum -= (A - 1) / D;
sum += (A - 1) / E;
sum -= B / E;
cout << B - A + 1 - sum;
return 0;
}
ll LCM(ll x, ll y) {
ll a,b,r, gcd, lcm;
a = max(x, y);
b = min(x, y);
r = 1;
while (r != 0) {
r = a % b;
if (r == 0) {
gcd = b;
}
a = b;
b = r;
}
lcm = x * y / gcd;
return lcm;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
double a, b; cin >> a >> b;
int ans=0;
int dis=1;
bool flg = true;
while(true){
if(floor(dis * 0.08) == a && floor(dis*0.1) == b){
ans = dis; break;
}
if(dis > 1000){
flg = false; break;
}
dis++;
}
if(flg)
cout<< ans << endl;
else
{
cout << -1 << endl;
}
return 0;
}
| 0
| 81,410,440
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n;
long a[1<<17],b[1<<17];
vector<pair<long,int> >A;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
A.push_back(make_pair(a[i]+b[i],i));
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
long ans=0;
for(int i=0;i<n;i++)
{
if(i%2)ans-=b[A[i].second];
else ans+=a[A[i].second];
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 1000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed<<setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define fast ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define umll unordered_map<ll,ll>
#define mll map<ll,ll>
#define forr(i,p,n) for(ll i=p;i<(ll)n;i++)
#define fore(i,n,k) for(ll i=n-1;i>=k;i--)
#define MAXN 1000003
typedef long long ll;
using namespace std;
ll mult(ll a, ll b, ll p = MOD) {return ((a % p) * (b % p)) % p;}
ll add(ll a, ll b, ll p = MOD) {return (a % p + b % p) % p;}
ll fpow(ll n, ll k, ll p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
ll inv(ll a, ll p = MOD) {return fpow(a, p - 2, p);}
ll inv_euclid(ll a, ll m = MOD) {ll m0 = m; ll y = 0, x = 1; if (m == 1)return 0; while (a > 1) {ll q = a / m; ll t = m; m = a % m, a = t; t = y; y = x - q * y; x = t;} if (x < 0)x += m0; return x;}
using namespace __gnu_pbds;
typedef tree<ll, null_type, less< ll>, rb_tree_tag, tree_order_statistics_node_update>ordered_set;
void functiontosolve()
{
ll n;
cin >> n;
ll a[n];
forr(i, 0, n) cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
forr(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n - 1] << "\n";
}
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);
cout.tie(NULL);
int test;
test = 1;
forr(i, 1, test + 1) {
functiontosolve();
}
return 0;
}
| 0
| 20,177,449
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
const ll INF=1e9+7;
const ll N = 100001;
ll m,n,x[N],y[N],ans=0,xs=0,ys=0,xad[N],yad[N];
int main(){
cin>>n>>m;
FOR(i,0,n)cin>>x[i+1];
FOR(i,0,m)cin>>y[i+1];
xad[n]=x[n];
yad[m]=y[m];
for(ll i=n-1;i>=1;i--){
xad[i]=x[i]+xad[i+1];
}
for(ll i=m-1;i>=1;i--){
yad[i]=y[i]+yad[i+1];
}
FOR(i,1,n+1){
xs+=xad[i]-x[i]*(n-i+1);
xs%=INF;
}
FOR(i,1,m+1){
ys+=yad[i]-y[i]*(m-i+1);
ys%=INF;
}
cout<<(xs*ys)%INF<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >>n;
vector<int> vec(n);
for(int i=0;i<n;i++) cin >> vec[i];
if(n%2 == 0){
for(int i=n-1;i>0;i -= 2){
cout << vec[i] << " ";
}
for(int i=0;i<n-1;i += 2){
cout << vec[i] << " ";
}cout << endl;
}else {
for(int i=n-1;i>=0;i -= 2){
cout << vec[i] << " ";
}
for(int i=1;i<n;i += 2){
cout << vec[i] << " ";
}
cout << endl;
}
}
| 0
| 67,481,747
|
#include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf 1e18
#define deci(x,y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define nitin ios_base::sync_with_stdio(false); cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
int power(int x, int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int modi(int a, int m)
{
return power(a, m - 2, m);
}
int32_t main()
{
nitin;
int n,k;
cin>>n>>k;
vector<int>v(n+1,0);
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
vector<int>fp(n+2,0);
vector<int>bp(n+2,0);
for(int i=1;i<=n;i++)
{
if(v[i]>0)
{
fp[i]=bp[i]=v[i];
}
}
for(int i=1;i<=n+1;i++)
{
fp[i]+=fp[i-1];
}
for(int i=n;i>=0;i--)
{
bp[i]+=bp[i+1];
}
for(int i=1;i<=n;i++)
{
v[i]+=v[i-1];
}
int ans=0;
int i=k;
for(i=k;i<=n;i++)
{
ans=max(ans,v[i]-v[i-k]+fp[i-k]+bp[i+1]);
}
for(int i=k;i<=n;i++)
{
ans=max(ans,fp[i-k]+bp[i+1]);
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
int a,b,c,i,x;
a =0;
b =0;
c =0;
for (int n=0;n<10;n++){
cin >> i;
if (c < i)
c = i;
if (b < c){
x = b;
b = c;
c = x;
}
if (a < b){
x = a;
a = b;
b = x;
}
}
cout << a << endl << b << endl << c << endl;
}
| 0
| 6,219,370
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
s+='T';
int x,y;
cin >> x >> y;
int n=s.size();
int direction=0;
int count=0;
vector<int> X,Y;
Y.push_back(0);
for (int i=0; i<n; i++){
if (s[i]=='F'){
count++;
} else {
if (direction==0){
X.push_back(count);
}else{
Y.push_back(count);
}
count=0;
direction=1-direction;
}
}
int x_dp[2][16001],y_dp[2][16001];
for (int i=0;i<2;i++){
for (int j=0; j<=16000; j++){
x_dp[i][j]=0;
y_dp[i][j]=0;
}
}
x_dp[0][8000+X[0]]=1;
for (int i=1; i<X.size(); i++){
for (int j=0; j<=16000; j++){
if (0<=j-X[i] && j-X[i]<=16000){
if (x_dp[0][j-X[i]]==1)
x_dp[1][j]=1;
}
if (0<=j+X[i] && j+X[i]<=16000){
if (x_dp[0][j+X[i]]==1){
x_dp[1][j]=1;
}
}
}
for (int k=0; k<=16000; k++){
x_dp[0][k]=x_dp[1][k];
x_dp[1][k]=0;
}
}
y_dp[0][8000]=1;
for (int i=1; i<Y.size(); i++){
for (int j=0; j<=16000; j++){
if (0<=j-Y[i] && j-Y[i]<=16000 ){
if (y_dp[0][j-Y[i]]==1){
y_dp[1][j]=1;
}
}
if (0<=j+Y[i] && j+Y[i]<=16000){
if (y_dp[0][j+Y[i]]==1){
y_dp[1][j]=1;
}
}
}
for (int k=0; k<=16000; k++){
y_dp[0][k]=y_dp[1][k];
y_dp[1][k]=0;
}
}
if (x_dp[0][x+8000]!=0 && y_dp[0][y+8000]!=0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main()
{
int v[3];
for(int i=0;i<3;i++)
{
cin >> v[i];
}
sort(v,v+3);
cout<<abs(v[0] - v[1]) + abs(v[1] - v[2])<<endl;
return 0;
}
| 0
| 85,953,069
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M; cin >> N >> M;
priority_queue<ll> pq;
for (int i = 0; i < N; ++i) {
ll a; cin >> a;
pq.push(a);
}
for (int i = 0; i < M; ++i) {
ll highest = pq.top(); pq.pop();
pq.push(highest / 2);
}
ll min_sum = 0;
while (!pq.empty()) {
min_sum += pq.top(); pq.pop();
}
cout << min_sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
ll a, b, c, k, ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> c >> k;
if (k & 1)
ans = - a + b;
else
ans = a - b;
cout << ans << endl;
return 0;
}
| 0
| 1,777,042
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int l1 = 1, r1 = m+1, l2 = m+2, r2 = 2*m+1;
auto put = [](int &a, int &b) {
cout << a << " " << b << endl;
a++; b--;
};
rep(i, m) {
if (l1 < r1) put(l1, r1);
else put(l2, r2);
}
}
|
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define pai 3.14159265358979323846
ll gcd(ll a, ll b){if (a%b == 0) return(b);else return(gcd(b, a%b));}
ll lcm(ll a, ll b){return a * b / gcd(a, b);}
int main() {
ll l,r;
cin >> l >> r;
if (r-l > 2100) {
cout << 0 << endl;
return 0;
}
int mi = 2100;
for (ll i = l; i < r; i++) {
for(ll j = i + 1 ; j<=r; j++) {
int tmp = (i*j) % 2019;
mi = min(mi, tmp);
}
}
cout << mi << endl;
}
| 0
| 37,929,505
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<string> c(h);
rep(i,h) cin>>c[i];
rep(i,h){
cout<<c[i]<<"\n";
cout<<c[i]<<"\n";
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
int main()
{
int n; scanf("%d", &n);
std::vector<int> a(n+1), b(n);
long long count = 0;
for (int i=0; i<n+1; i++) scanf("%d", &a.at(i));
for (int i=0; i<n; i++) scanf("%d", &b.at(i));
for (int i=n-1; i>=0; i--)
{
if (a.at(i+1) <= b.at(i))
{
count += a.at(i+1);
b.at(i) -= a.at(i+1);
a.at(i+1) = 0;
}
else
{
count += b.at(i);
a.at(i+1) -= b.at(i);
b.at(i) = 0;
}
if (a.at(i) <= b.at(i))
{
count += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
}
else
{
count += b.at(i);
a.at(i) -= b.at(i);
b.at(i) = 0;
}
}
std::cout << count << std::endl;
}
| 0
| 40,447,758
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
queue<char>q[3];
int main()
{
fast;
ll h,w;
cin>>h>>w;
vector<string>v(h+1);
v[0]="\0";
for(ll i=1;i<=h;i++)
{
cin>>v[i];
}
for(ll i=1;i<=2*h;i++)
{
cout<<v[(i+1)/2]<<"\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main()
{
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
ll now = 1;
rep(i, n)
{
if (s[i] == '1')
{
ans += now * modpow(3, n - 1 - i, MOD);
ans %= MOD;
now = now * 2 % MOD;
}
}
ans = (ans + now) % MOD;
cout << ans << endl;
}
| 0
| 49,134,113
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
#define bet(x, a, b) (a) <= (x) && (x) < (b)
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ll X, Y, ans;
cin >> X >> Y;
if (X % Y == 0) ans = -1;
else ans = X * (Y - 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(),x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
const ll MAX = 100000;
struct edge {
ll from, to, weight;
edge(ll f, ll t, ll w) : from(f), to(t), weight(w) { }
};
vector<vector<edge>> edges;
vector<vector<ll>> graph;
vector<bool> visited;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll n, m, r, answer;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vl s(3);
rep(i, 3) cin >> s[i];
ll cnt = 0;
while (not (s[0] == s[1] && s[1] == s[2])) {
sort(all(s));
if (s[0] < s[1] && s[1] < s[2]) {
s[0]++;
s[1]++;
} else if (s[0] < s[1] && s[1] == s[2]) {
s[0] += 2;
} else if (s[0] == s[1] && s[1] < s[2]) {
s[0]++;
s[1]++;
}
cnt++;
}
printf("%ld\n", cnt);
}
| 0
| 99,814,962
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
S += "000";
cout << ((S.substr(0, 4) == "YAKI") ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define itn int
int main(void){
string t;
cin >> t;
stack<char> s;
int sum = 0;
for(int i = 0;i < t.size();i++){
if(s.empty() || s.top() == t[i])s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << sum << endl;
}
| 0
| 30,466,534
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
map<char,int>mp;
for(int i=0;i<s.size();i++){
mp[s[i]]++;
}
if(mp.size()!=2){
cout<<"No"<<endl;
return 0;
}
for(auto a:mp){
if(a.second!=2){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1] * i) % p;
}
}
void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++) spf[i] = i;
for (int i=4; i<MAXN; i+=2) spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
if (spf[i] == i)
{
for (int j=i*i; j<MAXN; j+=i) if (spf[j]==j) spf[j] = i;
}
}
}
vector<int> getFactorization(int x)
{
vector<int> ret;
while (x != 1)
{
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
unsigned long long power(unsigned long long x,
int y, int p)
{
unsigned long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
unsigned long long modInverse(unsigned long long n, int p)
{
return power(n, p - 2, p);
}
unsigned long long nCr(unsigned long long n,
int r, int p)
{
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
}
void solve(int TC) {
int a, b, c; cin >> a >> b >> c;
if(a == b) {
cout << c; return;
}
if(b == c) {
cout << a; return;
}
if(a == c) {
cout << b; return;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(12);
int T = 1;
for(int i=1; i<=T; i++) {
solve(i);
}
return 0;
}
| 0
| 100,096,741
|
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a, b, C;
cin >> a >> b >> C;
double theta;
theta = C * M_PI / 180;
double S, L, h;
S = a * b * sin(theta) / 2;
printf("%.4f\n", S);
double c;
c = sqrt(a * a + b * b - 2 * a * b * cos(theta));
L = a + b + c;
printf("%.4f\n", L);
h = S / a * 2;
printf("%.4f\n", h);
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
using Pi = pair<int, int>;
using ll = long long;
const int INF = 1 << 28;
string to_string(string s) {
return s;
}
template <class T>
string to_string(vector<T> v) {
string ret = "{";
for (int i = 0; i < v.size() - 1; ++i) {
ret += to_string(v[i]) + ",";
}
if (v.size() > 0) {
ret += to_string(v.back());
}
ret += "}";
return ret;
}
void debug() {
cerr << endl;
}
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
void get() {}
template <class Head, class... Tail>
void get(Head& head, Tail&... tail) {
cin >> head;
get(tail...);
}
template <class T>
void getv(vector<T>& vec) {
for (int i = 0; i < vec.size(); ++i)
cin >> vec[i];
}
struct Union_Find {
vector<int> data;
vector<int> dist;
Union_Find(int size) { data = vector<int>(size, -1);dist=vector<int>(size,0); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : root(data[x]); }
int size(int x) { return -data[root(x)]; }
int get_dist(int x){
int dis=0;
while(data[x]>=0){
dis+=dist[x];
x=data[x];
}
return dis;
}
};
int main() {
int N,M;
get(N,M);
Union_Find uf(N);
FOR(i,M){
int L,R,D;
get(L,R,D);
L--;R--;
if(uf.find(L,R)){
if(uf.get_dist(L)+D!=uf.get_dist(R)){
print("No");
return 0;
}
}else{
if(uf.data[uf.root(L)]>uf.data[uf.root(R)]){
swap(L,R);
D=-D;
}
int rt=uf.root(R),dis=uf.get_dist(R);
uf.dist[rt]=D-dis+uf.get_dist(L);
uf.union_set(L,R);
}
}
print("Yes");
return 0;
}
| 0
| 20,850,380
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
ll LLpow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret *= x;
}
x *= x;
n >>= 1;
}
return ret;
}
int main() {
ll M;
scanf("%lld", &M);
ll K;
scanf("%lld", &K);
if (M == 0) {
if (K > 0) {
printf("-1\n");
return 0;
}
printf("0 0\n");
return 0;
}
else if (M == 1) {
if (K > 0) {
printf("-1\n");
return 0;
}
printf("0 0 1 1\n");
return 0;
}
else {
ll N = LLpow(2, M);
if (K >= N) {
printf("-1\n");
return 0;
}
vll result;
result.push_back(K);
rep(i, N) {
if (i != K) {
result.push_back(i);
}
}
result.push_back(K);
dep(i, N) {
if (i != K) {
result.push_back(i);
}
}
for (auto val : result) {
printf("%lld ", val);
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
int main(){
string s[30][30];
int H,W;
cin >> H >> W;
REP(i,H){
REP(j,W){
cin >> s[i][j];
if(s[i][j]=="snuke"){
cout << (char)('A'+j) << i+1 << endl;
}
}
}
return 0;
}
| 0
| 35,789,433
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t a, b, x;
cin >> a >> b >> x;
const int64_t temp_1 = (a * a * b - x) * 2;
const int64_t temp_2 = a * a * a;
const double tan_theta = static_cast<double>(temp_1) / static_cast<double>(temp_2);
double result = atan2(static_cast<double>(temp_1), static_cast<double>(temp_2)) / M_PI * 180.0;
if (a * tan_theta > static_cast<double>(b)) {
const int64_t temp_3 = b * b * a;
const int64_t temp_4 = 2 * x;
result = atan2(static_cast<double>(temp_3), static_cast<double>(temp_4)) / M_PI * 180.0;
}
cout << std::setprecision(20) << result << 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 pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#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;
const ll INF=1e15;
int main() {
ll n,k;
cin >> n >> k;
vector<ll> a(n),s(n+1);
map<ll,ll> m;
rep(i,n){
cin >> a[i];
s[i+1]=s[i]+a[i];
}
for(ll i=1;i<=n;i++){
s[i]-=i;
s[i]%=k;
}
ll ans=0;
for(ll i=0;i<=n;i++){
ans+=m[s[i]];
if(i>=k-1) m[s[i-k+1]]--;
m[s[i]]++;
}
cout << ans << endl;
return 0;
}
| 0
| 41,396,419
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define oset tree<long long, null_type,less<long long>, rb_tree_tag,tree_order_statistics_node_update>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll T=clock();
ll n,k;
cin>>n>>k;
vector<ll> a(n);
for(ll i=0;i<n;i++)
cin>>a[i];
vector<ll> dp(n,MAX);
dp[0]=0; dp[1]=abs(a[0]-a[1]);
for(ll i=2;i<n;i++){
for(ll j=max(0ll,i-k);j<i;j++)
dp[i]=min(dp[i],dp[j]+abs(a[i]-a[j]));
}
cout<<dp[n-1];
cerr<<"\n\nTIME: "<<(double)(clock()-T)/CLOCKS_PER_SEC<<" sec\n";
T = clock();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;
int N,M;
vector<int> edge [100001];
bool vis [100001];
bool dfs(int curr,int p,map<int,int>& color)
{
vis [curr] = true;
color [curr] = p;
int res = true;
for(const auto& it : edge [curr]){
if(color.count(it) == 0){
res &= dfs(it,!p,color);
}
else{
res &= color [it] == !p;
}
}
return res;
}
int main()
{
scanf("%d%d",&N,&M);
FOR(i,0,M){
int u,v;
scanf("%d%d",&u,&v);
edge [u].push_back(v);
edge [v].push_back(u);
}
ll x = 0,y = 0,z = 0;
FOR(i,1,N + 1) if(vis [i] == false){
map<int,int> color;
if(dfs(i,0,color)){
if(color.size() == 1){
x++;
}
else{
y++;
}
}
else{
z++;
}
}
ll ans = x * N * 2 - x * x + y * y * 2 + y * z * 2 + z * z;
printf("%lld\n",ans);
return 0;
}
| 0
| 15,683,136
|
#include <stdio.h>
int main(int argc, char *argv[]) {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF (ll)1e18
#define INF (int)1e9
#define ll_1e9 (ll)1e9
using namespace std;
int main(){
ll n,m;
cin >> n >> m;
ll cnt[n+1] = {};
ll a[m],b[m];
rep(i,0,m){
cin >> a[i] >> b[i];
cnt[a[i]]++;
cnt[b[i]]++;
}
rep(i,0,n){
if(cnt[i] % 2){
cout << "NO" << endl;
break;
}
else if(i == n-1){
cout << "YES" << endl;
}
}
return 0;
}
| 0
| 90,516,332
|
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
int n,a;
cin >> n >>a;
cout << n*n - a;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
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>inline int cmp(vector<T>&v,T &a){
return lower_bound(all(v),a)-v.begin();
}
constexpr int mod = 1e9+7;
constexpr int inf = 3e18;
int f(int x){
if(x%4==0)return x;
if(x%4==1)return 1;
if(x%4==2)return x+1;
return 0;
}
signed main(){
int A,B;cin>>A>>B;
cout<<(f(B)^f(A-1))<<"\n";
}
| 0
| 67,517,457
|
#include <iostream>
#include <vector>
int main()
{
int n, t;
std::cin >> n >> t;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr[i] = tmp;
}
int64_t sum = 0;
for (int i = 0; i < n; ++i)
{
if (i != n - 1)
{
sum += std::min(arr[i + 1] - arr[i], t);
}
else
{
sum += t;
}
}
std::cout << sum << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define VL vector < ll >
#define pi 3.141592653589793
#define ll long long
#define ull unsigned long long
#define w(x) int x;cin>>x;while(x--)
#define fast ios_base::sync_with_stdio(0)
#define sz size()
#define cu cout<<
#define en endl
#define sp " "
#include<cstdio>
#include<cstring>
void bug()
{
cout << "here\n";
}
typedef unsigned long long UL;
template<typename T>inline T S(T a)
{
return a*a;
}
template<class T>inline string tostring(T a)
{
ostringstream os("");
os << a;
return os.str();
}
template<typename T>inline ll tolong(T a)
{
ll res;
istringstream os(a);
os>>res;
return res;
}
template<typename T>inline T gcd(T a, T b)
{
if (b == 0)return a;
else return gcd(b, a % b);
}
template<typename T>inline T bigmod(T a, T b, T m)
{
if (b == 0)return 1;
else if (b % 2 == 0)return S(bigmod(a, b / 2, m)) % m;
else return (a % m*bigmod(a, b - 1, m)) % m;
}
const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll modd = (ll)1e9 + 7;
const int mod = 10000007;
#define N 10000009
bool prime[N];
vector<ll> prm;
void seive ()
{
memset(prime, true, sizeof(prime));
for( ll i=2; i*i<=N; i++)
{
if (prime[i] == true)
{
prm.pb(i);
for (ll j=i*i; j<=N; j += i)
prime[j] = false;
}
}
}
void pr (int f)
{
if(f==1)
cout<<"YES\n";
else
cout<<"NO\n";
}
bool isprime(ll n)
{
if(n<2) return 0;
if(n==2) return 1;
else
{
for(int i=2; i*i<=n; i++)
if(n%i==0) return 0;
}
return 1;
}
ll countSum(ll x)
{
ll res = 0;
while (x != 0)
{
res += (x % 10);
x /= 10;
}
return res;
}
const int nx = 2e6+5;
int us[nx];
int a[nx],w[nx];
int main()
{
fast;
int n,m;
cin>>n>>m;
int ac=0,wa=0;
for(int i=0; i<m; i++)
{
int p;
string s;
cin>>p>>s;
if(s=="AC")
{
if(a[p]==0)ac++;
a[p]=1;
}
else if(s=="WA")
{
if(a[p]==0)w[p]++;
}
}
for(int i=1; i<=n; i++)if(a[i]==1)wa+=w[i];
cout<<ac<<" "<<wa;
}
| 0
| 63,876,611
|
#include <stdio.h>
struct freqency {
int num;
int freq;
}f[1000];
int main(void) {
int n;
int size=0;
int max_freq=0;
int mode[1000];
int s=0;
int i,j,temp;
int flag;
while(scanf("%d",&n)!=EOF) {
flag=0;
for(i=0;i<size;i++) {
if(f[i].num==n) {
flag=1;
f[i].freq++;
}
}
if(flag==0) {
f[size].num=n;
f[size].freq=1;
size++;
}
}
for(i=0;i<size;i++) {
if(max_freq<=f[i].freq) {
max_freq=f[i].freq;
mode[s]=f[i].num;
s++;
}
}
for(i=0;i<s;i++) {
for(j=0;j<s-i-1;j++) {
if(mode[j]>mode[j+1]) {
temp=mode[j];
mode[j]=mode[j+1];
mode[j+1]=temp;
}
}
}
for(i=0;i<s;i++) {
printf("%d\n",mode[i]);
}
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
typedef pair<int,int> P;
int flg[1000][1000];
void ini(int x,int y){
for(int k=0;k<y;k++){for(int j=0;j<x;j++){flg[k][j]=-1;}}
}
int main()
{
int x,y,n,sum=0;
char map[1000][1001];
char ntoi[10]="123456789";
queue<P> q;
int dx[4]={0,0,-1,1},dy[4]={-1,1,0,0};
cin>>y>>x>>n;
for(int i=0;i<y;i++)
{
for(int j=0;j<x;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
q.push(make_pair(i,j));
}
}
}
for(int i=0;i<n;i++)
{
ini(x,y);
flg[q.front().first][q.front().second]=0;
while(!q.empty())
{
P temp=q.front();
q.pop();
if(map[temp.first][temp.second]==ntoi[i])
{
sum+=flg[temp.first][temp.second];
while(!q.empty()){q.pop();}
q.push(temp);
break;
}
for(int j=0;j<4;j++)
{
if(temp.first+dy[j]>-1&&temp.first+dy[j]<y&&temp.second+dx[j]>-1&&temp.second+dx[j]<x&&map[temp.first+dy[j]][temp.second+dx[j]]!='X'&&flg[temp.first+dy[j]][temp.second+dx[j]]==-1)
{
flg[temp.first+dy[j]][temp.second+dx[j]] = flg[temp.first][temp.second]+1;
q.push(make_pair(temp.first+dy[j],temp.second+dx[j]));
}
}
}
}
cout<<sum<<endl;
return 0;
}
| 0
| 29,448,883
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,h;
cin >> n >> h;
vector<pair<int,bool>> ab(2*n);
for(int i = 0; i < n; i++) {
cin >> ab[i*2].first >> ab[i*2+1].first;
ab[i*2].second=false;
ab[i*2+1].second=true;
}
sort(ab.rbegin(),ab.rend());
int cnt=0;
ll dmg=0;
while(ab[cnt].second){
dmg+=ab[cnt].first;
cnt++;
if(dmg>=h){
cout << cnt << "\n";
return 0;
}
}
ll ta=ab[cnt].first;
cnt += ((h-dmg+ta-1)/ta);
cout << cnt << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m; cin >> n >> m;
vector<bool> a(n+1);
vector<bool> b(n+1);
rep(i, m) {
int tmp_a, tmp_b;
cin >> tmp_a >> tmp_b;
if (tmp_a == 1) a[tmp_b] = true;
if (tmp_b == n) b[tmp_a] = true;
}
rep(i, a.size()) {
if (a[i] && b[i]) {
puts("POSSIBLE");
return 0;
}
}
puts("IMPOSSIBLE");
}
| 0
| 86,780,330
|
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define VS vector<string>
#define VL vector<long long>
#define VI vector<int>
#define VVI vector<vector<int>>
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort((x).rbegin(),(x).rend())
#define PAIR pair<ll,ll>
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using ll = long long;
constexpr int MOD = 1000000007;
using namespace std;
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; }
VL prime_decomposition(ll n) {
ll i = 2;
VL table{};
while (i * i <= n) {
while (n % i == 0) {
n /= i;
table.emplace_back(i);
}
++i;
}
if (n > 1) {
table.emplace_back(n);
return table;
}
}
int main() {
string str;
cin >> str;
string a = "YAKI";
if (str.size() < 4) {
cout << "No" << endl;
return 0;
}
REP(i, 4) {
if (str[i] != a[i]) {
cout << "No" << endl;
return 0 ;
}
}
cout << "Yes" << endl;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = 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;
}
int next_combination(int sub) {
int x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
bool isPrime(int a) {
if (a == 2) return true;
if (a <= 1 || a % 2 == 0) return false;
for (int i = 3; i * i <= a; i += 2) {
if (a % i == 0) return false;
}
return true;
}
vector<int> aaa;
bool isOK(int index, int key) {
if (aaa[index] >= key)
return true;
else
return false;
}
int binary_search(int key) {
int ng = -1;
int ok =
(int)aaa
.size();
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
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;
}
int main() {
int n;
cin >> n;
int ans = 0;
int mcnt = 0;
rep(i, n + 1) {
int ti = i;
int cnt = 0;
while (ti) {
if (ti % 2 == 0) { cnt++; }
ti /= 2;
}
if (mcnt <= cnt) {
mcnt = cnt;
ans = i;
}
}
cout << ans << endl;
return 0;
}
| 0
| 80,856,966
|
#include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int N, A[100],minj;
int count = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N-1 ; i++) {
minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj])
minj = j;
}
swap(A[i], A[minj]);
if (i != minj) count++;
}
for (int i = 0; i < N; i++) {
if (i != 0) cout << " ";
cout << A[i];
}
putchar('\n');
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'B') {
cnt++;
} else {
ans += cnt;
}
}
cout << ans << '\n';
return 0;
}
| 0
| 90,783,724
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.