code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main(){
ll n;cin >> n;
ll res=0;
vl v=divisor(n);
for(auto p:v){
if(p==1)continue;
if(n/(p-1)==n%(p-1))res+=p-1;
}
cout << res <<endl;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline T chmax(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T chmin(T& a, const T b) { return a = (a > b) ? b : a; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N;
cin >> N;
int ans = 0;
for(int i = 1; i*i <= N; i++){
if((N-i)%i == 0){
int x = (N-i)/i;
if(x > i) ans += x;
}
}
cout << ans << "\n";
return 0;
} | 1 | 31,130,649 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
rep(i, S.size()){
int count = 0;
rep(j, S.size()){
if (i == j) continue;
if (S.at(i) == S.at(j)) count += 1;
}
if (count != 1){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;cin>>s;
map<char,ll> mp;rep(i,4) mp[s[i]]++;
print((mp.size()==2&&mp[s[0]]==2)?"Yes":"No");
return 0;
} | 1 | 32,572,317 |
#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)
#define all(a) (a).begin(), (a).end()
bool odd_digit(int n)
{
int cnt = 0;
while (n)
{
cnt++;
n /= 10;
}
return cnt & 1;
}
int main()
{
int n;
cin >> n;
int ans = 0;
rep2(i, 1, n + 1)
{
if (odd_digit(i))
{
ans++;
}
}
cout << ans << '\n';
return (0);
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n; scanf("%lld", &n);
int Count = 0;
for(int i = 1; i <= n; i++)
{
int p = i;
int Coun = 0;
while(p)
{
Coun++;
p /= 10;
}
if(Coun%2 == 1)
{
Count++;
}
}
cout << Count << endl;
return 0;
} | 1 | 89,793,902 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a); i > (intl)(b); i--)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define cin(i, a) rep(i, alength(a))cin >> a[i]
#define ccin(i, j, a) rep(i, alength(a))rep(j, alength(a[i]))cin >> a[i][j]
#define debug(x) cout << #x << ":" << x << endl
#define rdebug(i,x) rep(i, alength(x))cout << #x << "[" << i << "]:" << x[i] << endl
#define sqrt sqrtl
#define itn int
#define double ld
#define pb push_back
#define mp make_pair
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld eps = 1.0e-14;
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
intl kai(intl k){
intl a = 1;
for(int i = 2; i <= k; i++){
a *= i;
}
return a;
}
intl gcd(intl a, intl b){
if(!b)return a;
return gcd(b, a % b);
}
intl lcm(intl a,intl b){
return a / gcd(a, b) * b;
}
intl digit10(intl a){
intl b = 0;
do{
a /= 10;
b++;
}while(a);
return b;
}
signed main(){
cout << fixed << setprecision(10);
string s;
cin >> s;
rep(i,3){
if(s[i] == '1')cout << '9';
else if (s[i] == '9')cout << '1';
else cout << s[i];
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
string n;
cin >> n;
for (int i = 0; i < 3; i++)
{
if (n.at(i) == '1')
n.at(i) = '9';
else if (n.at(i) == '9')
n.at(i) = '1';
}
cout << n << endl;
} | 1 | 19,261,814 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a;
set<int> ans, s;
rep(i,4) {
cin >> a;
s.insert(a);
}
ans.insert(1);
ans.insert(9);
ans.insert(7);
ans.insert(4);
if(s == ans) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N[4];
for(int i=0;i<4;i++) cin>>N[i];
sort(N,N+4);
if((N[0]==1&&N[1]==4)&&(N[2]==7&&N[3]==9)) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 27,016,636 |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i,a,n) for(int (i)=a;(i)<(int)(n);(i)++)
#define rrep(i,a,n) for(int (i)=(n)-1;(i)>=a;(i)--)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int INF = 1e9;
int main() {
int cnt[10][3][4];
memset(cnt, 0, sizeof cnt);
int n;
cin >> n;
rep(i,0,n) {
int b, f, r, v;
cin >> b >> f >> r >> v;
cnt[r-1][f-1][b-1] += v;
}
rep(i,0,4) {
if (i>0) cout << "####################" << endl;
rep(j,0,3) {
rep(k,0,10) {
cout << " " << cnt[k][j][i];
}
cout << endl;
}
}
} | #include<iostream>
using namespace std;
int main(){
int count[5][4][11], n;
for ( int s = 1; s <= 4; s++){
for ( int t = 1; t <= 3; t++)
for ( int u = 1; u <= 10; u++)
count[s][t][u] = 0;
}
cin >> n;
for ( int i = 0 ; i < n; i++){
int b, f, r, v;
cin >> b >> f >> r >> v;
count[b][f][r] += v;
}
for ( int s = 1; s <= 4; s++){
if (s > 1) cout << "####################\n";
for ( int t = 1; t <= 3; t++){
for ( int u = 1; u <= 10; u++){
cout << " " << count[s][t][u];
}
cout << endl;
}
}
return 0;
} | 1 | 17,707,537 |
#include<bits/stdc++.h>
using namespace std;
long long a[200000],l[200000];
signed main()
{
ios::sync_with_stdio(0);
long long n,i;
long long ans=0;
cin >> n;
for(i=1; i<=n; i++)
cin >> a[i];
for(i=1; i<=n; i++)
l[i]=max(a[i],l[i-1]);
for(i=1; i<=n; i++)
ans+=l[i]-a[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int> ;
using vl = vector<ll>;
int main(){
int n;
cin >>n;
vl a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
int tmp = a[0];
rep(i,n-1){
if(tmp > a[i+1]){
ans += (tmp-a[i+1]);
}else{
tmp = a[i+1];
}
}
cout << ans << endl;
return 0;
} | 1 | 83,285,716 |
#include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
string s;
cin >> s;
vector <int> cnt(26, 0);
ll sm = 0, ans = 0;
for(int i = 0; i < 26; i++) {
cnt[i] = count(all(s), 'a' + i);
ans += sm * cnt[i];
sm += cnt[i];
}
cout << ans + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;cin>>s;
ll n = s.size();
ll ans = n*(n-1)/2 + 1;
ll a[27];rep(i,27)a[i]=0;
rep(i,n){
ll tmp = s[i]-'a';
++a[tmp];
}
rep(i,27)if(a[i]>=2)ans-=a[i]*(a[i]-1)/2;
cout<<ans<<endl;
return 0;
} | 1 | 94,492,508 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
ll modpow(ll a, int n) {
ll res = 1;
while (n) {
if (n & 1)
(res *= a) %= MOD;
(a *= a) %= MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string L;
cin >> L;
int N = L.length();
ll pow2 = 1, pow3 = modpow(3, N);
ll ans = 0;
for (int i = 0; i < N; ++i) {
(pow3 *= 333333336) %= MOD;
if (L[i] == '0')
continue;
ans += pow2 * pow3 % MOD;
ans %= MOD;
(pow2 *= 2) %= MOD;
}
ans += pow2;
cout << ans % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
vector<vector<ll>> dp(n + 1, vector<ll>(2));
dp[0][0] = 1;
rep(i, n) rep(j, 2) {
if (s[i] == '1') {
dp[i + 1][1] = (dp[i + 1][1] + dp[i][j]) % mod;
}
else {
dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod;
}
if (!(s[i] == '0' && j == 0)) dp[i + 1][j] = (dp[i + 1][j] + (dp[i][j] * 2) % mod) % mod;
}
dunk((dp[n][0] + dp[n][1]) % mod);
return 0;
} | 1 | 92,969,613 |
#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 INF = 1000000001;
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;}
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
for(int i = 0; i < n; ++i){
bool bfind = true;
for(int j = 0; j < n - i; ++j){
if(s[i+j] != t[j]){
bfind = false;
break;
}
}
if(bfind){
for(int j = n-i; j < n; ++j){
s += t[j];
}
cout << s.size() << endl;
return 0;
}
}
cout << s.size() + t.size() << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
int N;
cin >> N >> s >> t;
REP(i, N) {
if (s.substr(i, N - i) == t.substr(0, N - i)) {
cout << 2 * N - (N - i) << endl;
return 0;
}
}
cout << 2 * N << endl;
} | 1 | 47,744,970 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii ;
typedef vector<ll> vi ;
typedef vector<ii> vii ;
const ll mod = 1e9+7;
const ll MAX = (1<<20);
const ll inf = 1e9+7;
const ll VAL = 20;
int main() {
fastio;
ll a,b,c,k;
cin>>a>>b>>c>>k;
ll ans = 0;
while(a>=b){ b*=2; ans++;
}
while(c<=b){c*=2; ans++;
}
if(ans<=k) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b, c;
int k;
vector<int> binary = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};
cin >> a >> b >> c;
cin >> k;
bool flg = false;
for (int i=0;i<=k;i++){
for (int j=0;j<=k;j++){
if (a < b*binary[i] && b*binary[i] < c*binary[j] && i+j==k){
flg = true;
}
}
}
if (flg){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 3,523,407 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);--i)
#define SIZE(a) ll((a).size())
#define out(a) cout<<(a)<<endl;
const ll inf=1e9;
const int MAX = 510000;
const ll MOD = 998244353;
int main(){
ll n,a,b;cin>>n>>a>>b;
if(b<a){cout<<0<<endl;return 0;}
if(n==1&&a!=b){cout<<0<<endl;return 0;}
ll l=(n-1)*a+b,r=(n-1)*b+a;
cout<<r-l+1<<endl;
} | # include <bits/stdc++.h>
using namespace std;
int main() {
long long int n,a,b; cin >> n >> a >> b;
long long int ans = 0;
if(a > b) {
cout << 0 << endl;
return 0;
} else if(a == b) {
cout << 1 << endl;
return 0;
} else if(a < b) {
if(n == 1) { ans = 0; }
else if(n >= 2) { ans = (n-2)*(b-a) + 1; }
cout << ans << endl;
return 0;
}
} | 1 | 30,286,780 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
string s,t;
cin>>s>>t;
if(s.size()>t.size())
cout<<"GREATER"<<endl;
else if(s.size()<t.size())
cout<<"LESS"<<endl;
else{
if(s==t) cout<<"EQUAL"<<endl;
else if(s>t) cout<<"GREATER"<<endl;
else cout<<"LESS"<<endl;
}
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
string a,b;
cin >> a >> b;
bool y=1;
if (a.length()>b.length()) {
cout << "GREATER\n";
y=0;
}
else if (b.length()>a.length()) {
cout << "LESS\n";
y=0;
}
else {
for (int i=0;i<=a.length();i++) {
if (a[i]-'0'>b[i]-'0') {
cout << "GREATER\n";
y=0;
break;
} else if (b[i]-'0'>a[i]-'0') {
cout << "LESS\n";
y=0;
break;
}
}
}
if (y) cout << "EQUAL\n";
} | 1 | 71,409,797 |
#include <iostream>
#include <map>
using namespace std;
int main(){
long long N;
map<long long,char> price_for_double;
long long Q,H,S,D;
long long sum=0;
cin >> Q >> H >> S >> D;
cin >> N;
price_for_double.insert(make_pair(Q*8,'Q'));
price_for_double.insert(make_pair(H*4,'H'));
price_for_double.insert(make_pair(S*2,'S'));
price_for_double.insert(make_pair(D,'D'));
auto iter = price_for_double.begin();
if (iter->second=='D'){
sum = (N/2)*(iter->first);
iter=next(iter,1);
if (N%2==1) sum+= iter->first/2;
}else{
sum = N*(iter->first/2);
}
cout <<sum<<endl;
} | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define PII pair<int, int>
#define SZ(x) int((x).size())
#define PB(x) push_back(x)
#define ll long long
#define S second
#define F first
#define nl '\n'
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
mt19937_64 rnd;
const int N = 2e5 + 5;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
vector<ll> cost(4);
for(int i = 0; i < 4; i++){
cin >> cost[i];
}
ll n;
cin >> n;
ll t1 = n * 4 * cost[0];
ll t2 = n * 2 * cost[1];
ll t3 = n * cost[2];
ll t4 = 0;
if(n % 2 == 0){
t4 = n / 2 * cost[3];
}else{
t4 = n / 2 * cost[3] + min({4 * cost[0], 2 * cost[1], cost[2]});
}
cout << min({t1, t2, t3, t4});
return 0;
} | 1 | 96,613,334 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[10][10];
int main() {
for (;;) {
int n, m = 0;
cin >> n;
if (!n) return 0;
for (int i = 0; i < 10; i++)
fill(dp[i], dp[i]+10, 1<<20);
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
m = max(m, max(a, b));
dp[a][b] = c;
dp[b][a] = c;
}
m++;
for (int i = 0; i < m; i++)
dp[i][i] = 0;
for (int k = 0; k < m; k++)
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
int rt = 0, rc = 1<<20;
for (int i = 0; i < m; i++) {
int c = 0;
for (int j = 0; j < m; j++)
c += dp[i][j];
if (rc > c) {
rt = i;
rc = c;
}
}
cout << rt << ' ' << rc << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,l,r) for(int i = l; i <= r; i++)
#define TR(e,x) for(auto e = x.begin(); e != x.end(); e++)
#define DEBUG(x) cout << #x << "=" << x << endl;
#define SHOW1(A,n) { REP(i,n-1) printf("%d ", A[i]); printf("%d\n", A[n-1]); }
#define SHOW2(A,m,n) { REP(i,m) { REP(j,n-1) printf("%d ", A[i][j]); printf("%d\n", A[i][n-1]); } }
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)((x).size())
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 50, INF = ~0U>>1, MOD = ~0U>>1;
int n, m, a[MAXN][MAXN];
int main()
{
#ifdef LOCAL
#endif
while (scanf("%d", &n), n) {
m = 0;
REP(i,50)REP(j,50) a[i][j] = i==j ? 0:1e9;
REP(i,n) {
int x,y,z; scanf("%d%d%d", &x,&y,&z);
a[x][y] = a[y][x] = z;
m = max(m, x); m = max(m, y);
}
m++;
REP(k,m)REP(i,m)REP(j,m) a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
int ans = 0, sum = INF;
REP(i,m) {
int cnt = 0;
REP(j,m) cnt += a[i][j];
if (cnt < sum) sum = cnt, ans = i;
}
printf("%d %d\n", ans, sum);
}
return 0;
} | 1 | 9,406,716 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> x;
int count = 1;
for (int i = 1; i < n; i++) {
if (s.at(i - 1) == s.at(i)) count++;
else {
x.emplace_back(count);
count = 1;
}
}
x.emplace_back(count);
int ans = 0;
if (s.at(0) == '0') {
if ((x.size() + 1) / 2 <= k) {
cout << n << '\n';
return 0;
}
int ans = 0;
int left = 0, count = 0, sum = 0;
for (int right = 0; right < x.size(); right++) {
sum += x.at(right);
if (right % 2 == 0) count++;
if (count > k) {
if (left == 0) {
sum -= x.at(left);
left++;
count--;
}
else {
sum -= x.at(left) + x.at(left + 1);
left += 2;
count--;
}
}
ans = max(ans, sum);
}
cout << ans << '\n';
}
else {
if (x.size() / 2 <= k) {
cout << n << '\n';
return 0;
}
int ans = 0;
int left = 0, count = 0, sum = 0;
for (int right = 0; right < x.size(); right++) {
sum += x.at(right);
if (right % 2 == 1) count++;
if (count > k) {
sum -= x.at(left) + x.at(left + 1);
left += 2;
count--;
}
ans = max(ans, sum);
}
cout << ans << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;
int main(){
int n,k;cin>>n>>k;
string s;cin>>s;
vin zero,one;
int res=0;char tmp=s[0];
rep(i,n){
if(s[i]!=tmp){
if(tmp=='0')zero.push_back(res);
else one.push_back(res);
tmp=s[i];
res=0;
}
res++;
}
if(s[n-1]=='0')zero.push_back(res);
else one.push_back(res);
if(zero.size()<=k){
cout<<n<<endl;
return 0;
}
int zs=zero.size();
int os=one.size();
vin upright(zs+1),handstand(os+1);
upright[0]=0;handstand[0]=0;
if(zs==os&&s[0]=='0'){
reverse(all(s));
reverse(all(zero));
reverse(all(one));
}
rep(i,zs)upright[i+1]=upright[i]+zero[i];
rep(i,os)handstand[i+1]=handstand[i]+one[i];
int ans=0;
if(zs==os){
rep(i,os-k)ans=max(ans,upright[i+k]-upright[i]+handstand[i+k+1]-handstand[i]);
ans=max(ans,upright[zs]-upright[zs-k]+handstand[os]-handstand[os-k]);
}
else{
if(s[0]=='0'){
ans=upright[k]+handstand[k];
rep(i,os-k)ans=max(ans,upright[i+k+1]-upright[i+1]+handstand[i+k+1]-handstand[i]);
ans=max(ans,upright[zs]-upright[zs-k]+handstand[os]-handstand[os-k]);
}
else rep(i,os-k)ans=max(ans,upright[i+k]-upright[i]+handstand[i+k+1]-handstand[i]);
}
cout<<ans<<endl;
} | 1 | 94,930,712 |
#include <cstdio>
#define max(a,b) ((a)>=(b)?(a):(b))
int main() {
int s=0,t=0,p;
for(int i=0;i<4;i++)
scanf("%d",&p),s+=p;
for(int i=0;i<4;i++)
scanf("%d",&p),t+=p;
printf("%d\n",max(s,t));
} | #include<stdio.h>
int main()
{
int tensu[2];
int a,b,c,d,i;
for(i=0;i<2;i++)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
tensu[i]=a+b+c+d;
}
if(tensu[0]<tensu[1])
{
printf("%d",tensu[1]);
}
else if(tensu[0]>tensu[1])
{
printf("%d",tensu[0]);
}
else
{
printf("%d\n",tensu[0]);
}
return 0;
} | 1 | 80,271,428 |
#include<stdio.h>
int main(){
int H[10000], W[10000];
int length;
int i=0, j, k;
do{
scanf("%d %d", &H[i], &W[i]);
i += 1;
}while(H[i-1]!=0 || W[i-1]!=0);
length = i;
for(i=0; i<length-1; i++){
for(j=0; j<H[i]; j++){
for(k=0; k<W[i]; k++){
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include<stdio.h>
int main(){
int a[100],b[100],i=0;
do{
scanf("%d %d",&a[i],&b[i]);
i++;
}while(a[i-1]!=0||b[i-1]!=0);
for(int x=0;x<i-1;x++){
for(int y=0;y<a[x];y++){
for(int z=0;z<b[x];z++){
printf("#");
}
printf("\n");
}
printf("\n");
}
} | 1 | 58,150,647 |
#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, m;
cin >> n >> m;
int h[n];
rep(i, n) cin >> h[i];
int a, b;
int cnt[n] = {0};
rep(i, m) {
cin >> a >> b;
a--; b--;
if (h[a] > h[b]) cnt[b] = 1;
if (h[a] < h[b]) cnt[a] = 1;
if (h[a] == h[b]) {
cnt[a] = 1;
cnt[b] = 1;
}
}
int ans = 0;
rep(i, n) {
if (cnt[i] == 0) ans++;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, bool>> H(N, pair<int, bool>(0, true));
REP(n, N) cin >> H[n].first;
int A, B;
REP(m, M) {
cin >> A >> B;
--A;
--B;
if (H[A].first <= H[B].first) H[A].second = false;
if (H[B].first <= H[A].first) H[B].second = false;
}
int cnt = 0;
REP(n, N) {
if (H[n].second) ++cnt;
}
cout << cnt << endl;
return 0;
} | 1 | 37,279,511 |
#include <stdio.h>
#include <string.h>
int i;
int m, n;
char table[256];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0) return 0;
memset(table, 0, sizeof(table));
for (i=0; i<n; i++) {
char a, b;
scanf(" %c %c", &a, &b);
table[a] = b;
}
scanf("%d", &m);
for (i=0; i<m; i++) {
char c;
scanf(" %c", &c);
if (table[c]) printf("%c", table[c]);
else printf("%c", c);
}
puts("");
}
} | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
int m;
char before, after;
char ch;
while(cin >> n){
if(n == 0) break;
map<char , char> mp;
vector<char> vc;
for(int i = 0; i < n; i++){
cin >> before >> after;
mp[before] = after;
vc.push_back(before);
}
cin >> m;
for(int i = 0; i < m; i++){
cin >> ch;
bool f = true;
for(vector<char>::const_iterator iter = vc.begin();
iter != vc.end(); iter++)
{
if(*iter == ch){
cout << mp[ch];
f = false;
break;
}
}
if(f) cout << ch;
}
cout << endl;
}
return 0;
} | 1 | 43,593,545 |
#include <iostream>
#include <vector>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define FOR(i,n,m) for(ll i=n; i<(ll)m;i++)
#define FORa(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FORr(i,m,n) for(ll i=n; i>=(ll)m; i--)
#define FORm(i,m) for(auto i=m.begin();i!=m.end();i++)
#define FORs(i,st) for(auto i : st)
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define ALL(c) (c).begin(), (c).end()
#define VEC2(x,a,b) vector<vector<ll>> x = vector<vector<ll>>(a,vector<ll>(b,0))
#define sortAl(v) sort(v.begin(),v.end())
#define sortAlr(v) sort(v.begin(),v.end()); reverse(v.begin(),v.end())
#define cinv(v,n,m) FOR(i,n,m) cin>>v.at(i)
#define coutv(v,n,m) FOR(i,n,m) cout<<v.at(i) <<" "; cout<<endl
#define cout(n) cout<<fixed<<setprecision(n)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
map<string, ll> mp;
FOR(i,0,n){
string f,s;
cin>>f>>s;
if(f == "insert") mp[s] = 1;
else{
if(mp[s] == 1)cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
} | #include <iostream>
#include <string>
using namespace std;
int mod = 1046527;
int genhash(string str){
int h = 0;
for(auto ch : str){
h *= 5;
if(ch == 'A'){
h += 1;
} else if(ch == 'C'){
h += 2;
} else if(ch == 'G'){
h += 3;
} else {
h += 4;
}
}
return h;
}
void insert_dict(int* dict, string str){
int h = genhash(str);
int h1 = h%mod;
int h2 = 1+(h%(mod-1));
int i = 0;
while(dict[(h1+h2*i)%mod]){
if(dict[(h1+h2*i)%mod] == h){
break;
}
++i;
};
dict[(h1+h2*i)%mod] = h;
}
bool find_dict(int* dict, string str){
int h = genhash(str);
int h1 = h%mod;
int h2 = 1+(h%(mod-1));
int i = 0;
while(dict[(h1+h2*i)%mod]){
if(dict[(h1+h2*i)%mod] == h){
return true;
}
++i;
}
return false;
}
int main(){
cin.sync_with_stdio(false);
int dict[mod];
char command[10];
string str {};
int n;
cin >> n;
while(n--){
cin >> command >> str;
if(command[0] == 'i'){
insert_dict(dict, str);
} else {
cout << (find_dict(dict, str) ? "yes" : "no") << "\n";
}
}
} | 1 | 97,341,409 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long h, w, a, b;
cin >> h >> w >> a >> b;
long long ans[h][w];
for(long long y = 0; y < h; y++){
for(long long x = 0; x < w; x++){
if(y < b){
if(x < a) ans[y][x] = 0;
else ans[y][x] = 1;
}
else{
if(x < a) ans[y][x] = 1;
else ans[y][x] = 0;
}
}
}
for(long long y = 0; y < h; y++){
for(long long x = 0; x < w; x++){
printf("%lld", ans[y][x]);
}
printf("\n");
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int H, W, A, B;
cin >> H >> W >> A >> B;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
if((i<=B && j<=A) || (i>B && j>A)){
cout << 0;
} else{
cout << 1;
}
}
cout << endl;
}
} | 1 | 58,254,263 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a+(b/2);
cout<<c;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll x,y;cin>>x>>y;
cout<<x+y/2;
} | 1 | 98,623,106 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
string text="abcdefghijklmnopqrstuvwxyz";
const int maxn=1e6+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
multiset<int>s;
int a[n+2];
for(int i=0;i<n;i++){
cin>>a[i];
s.insert(a[i]);
}
for(int i=0;i<n;i++){
int x=a[i];
s.erase(s.find(x));
cout<<*s.rbegin()<<endl;
s.insert(x);
}
} | #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;
cin>>n;
vector<int> a(n),b(n);
rep(i,n) cin>>a[i];
b=a;
sort(b.begin(),b.end());
rep(i,n){
if(a[i]==b[n-1]) cout<<b[n-2]<<endl;
else cout<<b[n-1]<<endl;
}
} | 1 | 30,342,137 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;cin >> n;
string s; cin >> s;
char temp = s[0];
vector<char> str;
str.push_back(s[0]);
for(int i = 1; i < n; i++){
if(temp == s[i]) continue;
temp = s[i];
str.push_back(s[i]);
}
cout << str.size() << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cassert>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr ll INF = 3000000000000000000;
int main() {
int n;
cin >> n;
string s;
cin >> s;
s.erase(unique(ALL(s)), s.end());
cout << SZ(s) << "\n";
return 0;
} | 1 | 29,983,968 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int n;
while(scanf("%d", &n), n){
vi array(n+1);
array[0] = 0;
reep(i, 1, n+1){
scanf("%d", &array[i]);
array[i] += array[i-1];
}
int ans = INT_MIN;
rep(i, n){
reep(j, i+1, n+1)
ans = max(ans, array[j]-array[i]);
}
printf("%d\n", ans);
}
return 0;
} | #include <iostream>
using namespace std;
#define N_MAX 5000
int array[N_MAX];
int main(){
int n;
int num;
while(cin>>n&&n){
int ans=-100000*5000;
for(int i=0;i<n;i++){
cin>>num;
if(i==0)array[i]=num;
else{
array[i]=max(array[i-1]+num,num);
}
ans=max(ans,array[i]);
}
cout<<ans<<endl;
}
return 0;
} | 1 | 27,587,026 |
#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>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define int long long
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9+7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if(dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main(){
int N,M; cin>>N>>M;
vector<int>A(M);
vector<char>B(M);
vector<int>AC(N+1);
vector<int>WA(N+1);
rep(i,M){
string C;
cin>>A[i]>>C;
B[i]=C.at(0);
if(AC[A[i]]==1)continue;
if(B[i]=='A'){
AC[A[i]]++;
}
else{
WA[A[i]]++;
}
}
int ac=0;
int wa=0;
rep(i,N+1){
if(AC[i]){
ac+=AC[i];
wa+=WA[i];
}
}
cout<<ac<<" "<<wa<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int N, M;
int WA[105000];
bool AC[105000];
void solve() {
cin >> N >> M;
int WAnum = 0;
int ACnum = 0;
for(int i = 1; i <= N; i++) {
WA[i] = 0;
AC[i] = false;
}
while(M--) {
int p;
string S;
cin >> p >> S;
if(AC[p]) continue;
if(S == "AC") {
AC[p] = true;
ACnum++;
WAnum += WA[p];
} else if(S == "WA") {
WA[p]++;
}
}
cout << ACnum << " " << WAnum << endl;
return;
}
int main() {
solve();
return 0;
} | 1 | 32,205,892 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
const ll mod = 1e9 + 7;
const ll siz = 1e5 + 10;
const ll base = 32;
const ll MAXX = 1e9;
ll n;
vector<ll> hold;
ll cnt[siz];
ll val[siz][2];
ll pre[siz];
ll qPow(ll a, ll b) {
if (b == 0) {
return 1;
}
ll sub = qPow(a, b / 2);
if (b % 2 == 0) {
return sub * sub % mod;
}
return (a * (sub * sub % mod)) % mod;
}
void setup() {
pre[0] = 1;
for (ll i = 1; i < siz; i++) {
pre[i] = (pre[i - 1] * i) % mod;
}
}
ll cal(ll a, ll b) {
if (a < b) {
return 0;
}
return (((pre[a] * qPow(pre[b], mod - 2)) % mod) * qPow(pre[a - b], mod - 2)) % mod;
}
ll dunno[siz];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
setup();
cin >> n;
hold.resize(n + 1);
for (ll i = 0; i <= n; i++) {
cin >> hold[i];
}
ll needVal;
ll need;
for (ll i = 0; i <= n; i++) {
cnt[hold[i]]++;
if (cnt[hold[i]] > 1) {
need = n - i;
needVal = hold[i];
break;
}
dunno[hold[i]] = i;
}
for (ll i = 1; i <= n + 1; i++) {
ll ans = cal(n + 1, i);
ans = (ans - (cal(dunno[needVal] + need, i - 1)) + mod * mod) % mod;
cout << ans << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;
const int MAX_N = 100005;
ll fact[MAX_N];
ll factinv[MAX_N];
long long mod_pow(long long x, long long n, long long mod){
long long res = 1;
while(n > 0){
if(n & 1) res = res * x % mod;
x = x*x % mod;
n >>= 1;
}
return res;
}
void make_fact_tbl(long long n, long long mod){
fact[0] = 1;
for(long long i=1; i<=n; i++){
fact[i] = fact[i-1] * i;
fact[i] %= mod;
}
}
void make_factinv_tbl(long long n, long long mod){
factinv[0] = 1;
for(long long i=1; i<=n; i++){
factinv[i] = mod_pow(fact[i], mod-2, mod);
}
}
void comb_init(long long n, long long mod){
make_fact_tbl(n, mod);
make_factinv_tbl(n, mod);
}
long long comb(long long n, long long k, long long mod){
if(n < k) return 0;
if(k == 0 || n-k == 0) return 1;
return ((fact[n] * factinv[k]) % mod) * factinv[n-k] % mod;
}
int main(void) {
int n;
cin >> n;
comb_init(n+1, MOD);
map<int, int> a;
ll l = -1;
ll r = -1;
for(int i=0; i<n+1; i++){
int t;
cin >> t;
if(a.find(t) == a.end()){
a[t] = i;
}else{
l = a[t];
r = i;
}
}
for(int k=1; k<=n+1; k++){
ll ans = comb(n+1, k, MOD);
ans = (ans + MOD - comb(l+n-r, k-1, MOD)) % MOD;
cout << ans << endl;
}
return 0;
} | 1 | 34,988,159 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define pb push_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
typedef long long ll;
typedef multiset<ll> S;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll,vector<ll>,greater<ll>> SPQ;
using vi=vector<ll>;
using vvi=vector<vector<ll>>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
bool chmin(auto &a,auto b){if(a>b){a=b;return true;}return false;}
bool chmax(auto &a,auto b){if(a<b){a=b;return true;}return false;}
int main(){
int n,m;cin>>n>>m;
vi a(n),b(m);
rep(i,n)cin>>a[i];
rep(i,m)cin>>b[i];
vvi dp(n+1,vi(m+1,1));
rep(i,n){
rep(j,m){
if(a[i]!=b[j])dp[i+1][j+1]=(mod+dp[i][j+1]+dp[i+1][j]-dp[i][j])%mod;
else dp[i+1][j+1]=(dp[i+1][j]+dp[i][j+1])%mod;
}
}
cout<<dp[n][m]%mod<<endl;
} | #include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int s[2005], t[2005];
const LL M = (LL)1e9 + 7;
LL r_fix[2005][2005];
LL s_pre_t_fix[2005][2005];
LL s_fix_t_pre[2005][2005];
LL total[2005][2005];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &s[i]);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &t[i]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i] == t[j]) {
r_fix[i][j] = (total[i - 1][j - 1] + 1) % M;
} else {
r_fix[i][j] = 0;
}
s_fix_t_pre[i][j] = (s_fix_t_pre[i][j - 1] + r_fix[i][j]) % M;
total[i][j] = (total[i - 1][j] + s_fix_t_pre[i][j]) % M;
}
}
printf("%lld\n", total[n][m] + 1);
} | 1 | 37,676,680 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n, cnt = 0;
cin>>n;
for (int i = 1; i <= n/2; ++i)
{
if (i + (n - i) == n && i != (n - i))
{
cnt++;
}
}
cout<<cnt;
cin>>n;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
using namespace std;
int main(){
int x; cin >> x;
if(x % 2 == 0) cout << x/2 -1 << endl;
else cout << x/2 << endl;
return 0;
} | 1 | 92,089,288 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int swap = 0;
int count = 0;
char last = s[0];
for(int i = 1; i < s.size(); ++i){
char curr = s[i];
if(curr != last){
last = curr;
continue;
}
if(curr == '0'){
last = '1';
}else{
last = '0';
}
swap++;
}
cout << swap << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
const long long LINF =1e18;
const int INF = 1e9;
int main() {
string s;
cin>>s;
int black = 0;
int white = 0;
for (int i = 0; i < s.size(); ++i) {
if(i % 2 == 0){
if(s[i] != '0')black++;
if(s[i] != '1')white++;
}else{
if(s[i] != '1')black++;
if(s[i] != '0')white++;
}
}
cout<<min(black,white)<<endl;
return 0;
} | 1 | 43,318,263 |
#include <iostream>
#include <string>
#define MAX_LEN (100)
using namespace std;
int all_diff(int value[]);
class Dice {
private:
int value[6];
int top;
public:
Dice(int value[]) {
for (int i = 0; i < 6; i++) {
this->value[i] = value[i];
}
this->top = value[0];
}
int Get_right(int top, int front) {
if (top == this->value[0]) {
if (front == this->value[1]) {
return (this->value[2]);
} else if (front == this->value[2]) {
return (this->value[4]);
} else if (front == this->value[3]) {
return (this->value[1]);
} else if (front == this->value[4]) {
return (this->value[3]);
}
} else if (top == this->value[1]) {
if (front == this->value[0]) {
return (this->value[3]);
} else if (front == this->value[2]) {
return (this->value[0]);
} else if (front == this->value[3]) {
return (this->value[5]);
} else if (front == this->value[5]) {
return (this->value[2]);
}
} else if (top == this->value[2]) {
if (front == this->value[0]) {
return (this->value[1]);
} else if (front == this->value[1]) {
return (this->value[5]);
} else if (front == this->value[4]) {
return (this->value[0]);
} else if (front == this->value[5]) {
return (this->value[4]);
}
} else if (top == this->value[3]) {
if (front == this->value[0]) {
return (this->value[4]);
} else if (front == this->value[1]) {
return (this->value[0]);
} else if (front == this->value[4]) {
return (this->value[5]);
} else if (front == this->value[5]) {
return (this->value[1]);
}
} else if (top == this->value[4]) {
if (front == this->value[0]) {
return (this->value[2]);
} else if (front == this->value[2]) {
return (this->value[5]);
} else if (front == this->value[3]) {
return (this->value[0]);
} else if (front == this->value[5]) {
return (this->value[3]);
}
} else if (top == this->value[5]) {
if (front == this->value[1]) {
return (this->value[3]);
} else if (front == this->value[2]) {
return (this->value[1]);
} else if (front == this->value[3]) {
return (this->value[4]);
} else if (front == this->value[4]) {
return (this->value[2]);
}
}
}
};
int main()
{
int value[6];
int q;
do {
for (int i = 0; i < 6; i++) {
do {
cin >> value[i];
} while (value[i] < 0 || value[i] > 100);
}
} while (all_diff(value) == 0);
Dice dice(value);
do {
cin >> q;
} while (q < 1 || q > 24);
int* top = new int[q];
int* front = new int[q];
for (int i = 0; i < q; i++) {
do {
cin >> top[i] >> front[i];
} while ((top[i] < 0 || top[i] > 100) || (front[i] < 0 || front[i] > 100));
}
for (int i = 0; i < q; i++) {
cout << dice.Get_right(top[i], front[i]) << endl;
}
delete[] top;
delete[] front;
return (0);
}
int all_diff(int value[])
{
int i;
int flag[MAX_LEN] = {0};
for (i = 0; i < 6; i++) {
if (i >= 1) {
if (flag[value[i] - 1] == 1) {
break;
}
}
flag[value[i] - 1] = 1;
}
if (i == 6) {
return (1);
} else {
return (0);
}
} | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
struct Dice{
vector<int> oginPostions;
vector<int> positions;
enum MOVE{
E = 0,
S,
W,
N
};
void Move_E(){
positions = oginPostions;
int temp1 = positions[0];
int temp2 = positions[5];
positions[0] = positions[3];
positions[5] = positions[2];
positions[3] = temp2;
positions[2] = temp1;
}
void Move_N(){
positions = oginPostions;
int temp1 = positions[0];
int temp2 = positions[5];
positions[0] = positions[1];
positions[5] = positions[4];
positions[4] = temp1;
positions[1] = temp2;
}
void Move_S(){
positions = oginPostions;
int temp1 = positions[0];
int temp2 = positions[5];
positions[0] = positions[4];
positions[5] = positions[1];
positions[4] = temp2;
positions[1] = temp1;
}
void Move_W(){
positions = oginPostions;
int temp1 = positions[0];
int temp2 = positions[5];
positions[0] = positions[2];
positions[5] = positions[3];
positions[3] = temp1;
positions[2] = temp2;
}
};
int main() {
Dice dice;
int temp;
for (int i = 0; i < 6; i ++) {
cin >> temp;
dice.oginPostions.push_back(temp);
}
int quzCount;
cin >> quzCount;
for (int i = 0; i < quzCount; i++) {
int up, positive;
cin >> up >> positive;
int index_up = 0;
int index_pos = 0;
for (int i = 0 ; i < 6; ++i){
if (dice.oginPostions[i] == up) {
index_up = i;
}else if (dice.oginPostions[i] == positive){
index_pos = i;
}
}
if (index_up == 0 && index_pos == 1) {
cout << dice.oginPostions[2] << endl;
}else if (index_up == 0 && index_pos == 2){
cout << dice.oginPostions[4] << endl;
}else if (index_up == 0 && index_pos == 3){
cout << dice.oginPostions[1] << endl;
}else if (index_up == 0 && index_pos == 4){
cout << dice.oginPostions[3] << endl;
}
if (index_up == 1 && index_pos == 0) {
cout << dice.oginPostions[3] << endl;
}else if (index_up == 2 && index_pos == 0){
cout << dice.oginPostions[1] << endl;
}else if (index_up == 3 && index_pos == 0){
cout << dice.oginPostions[4] << endl;
}else if (index_up == 4 && index_pos == 0){
cout << dice.oginPostions[2] << endl;
}
if (index_up == 5 && index_pos == 1) {
cout << dice.oginPostions[3] << endl;
}else if (index_up == 5 && index_pos == 2){
cout << dice.oginPostions[1] << endl;
}else if (index_up == 5 && index_pos == 3){
cout << dice.oginPostions[4] << endl;
}else if (index_up == 5 && index_pos == 4){
cout << dice.oginPostions[2] << endl;
}
if (index_up == 1 && index_pos == 5) {
cout << dice.oginPostions[2] << endl;
}else if (index_up == 2 && index_pos == 5){
cout << dice.oginPostions[4] << endl;
}else if (index_up == 3 && index_pos == 5){
cout << dice.oginPostions[1] << endl;
}else if (index_up == 4 && index_pos == 5){
cout << dice.oginPostions[3] << endl;
}
if (index_up == 1 && index_pos == 2){
cout << dice.oginPostions[0] << endl;
}else if (index_up == 2 && index_pos == 4){
cout << dice.oginPostions[0] << endl;
}else if (index_up == 4 && index_pos == 3){
cout << dice.oginPostions[0] << endl;
}else if (index_up == 3 && index_pos == 1){
cout << dice.oginPostions[0] << endl;
}
if (index_up == 2 && index_pos == 1){
cout << dice.oginPostions[5] << endl;
}else if (index_up == 4 && index_pos == 2){
cout << dice.oginPostions[5] << endl;
}else if (index_up == 3 && index_pos == 4){
cout << dice.oginPostions[5] << endl;
}else if (index_up == 1 && index_pos == 3){
cout << dice.oginPostions[5] << endl;
}
}
return 0;
} | 1 | 87,841,494 |
#include <bits/stdc++.h>
using namespace std;
#define rep(src,dst) for(int i=src; i<dst; i++)
#define rep2(src,dst) for(int j=src; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define PI acos(-1)
#define ll long long
template<typename T> inline void ChMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<typename T> inline void ChMax(T* a, T* b) {if(*a<*b) *a=*b;}
template<typename T> inline int DivUp(T a, T b) {return ((a+b-1)/b);}
int main(){
int n; cin >> n;
string s, t, ans; cin >> s >> t;
rep(0,n){
ans += s[i];
ans += t[i];
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int n;
string s,t,ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>s>>t;
for(int i=0;i<n;i++){
ans+=s[i];
ans+=t[i];
}
cout<<ans<<endl;
return 0;
} | 1 | 48,250,224 |
#include<cstdio>
using ll = long long;
int main(){
int N, K;
scanf("%d %d", &N, &K);
ll a[N], ruiseki[N + 1], absruiseki[N + 1];
ruiseki[0] = absruiseki[0] = 0;
for (int i = 0; i < N; ++i){
scanf("%lld", a + i);
ruiseki[i + 1] = ruiseki[i] + a[i];
absruiseki[i + 1] = absruiseki[i] + (a[i] > 0 ? a[i] : 0);
}
ll answer = 0;
for (int i = 0; i < N - K + 1; ++i){
if(answer < (ruiseki[i + K] - ruiseki[i] > 0 ? ruiseki[i + K] - ruiseki[i] : 0) + absruiseki[N] - absruiseki[i + K] + absruiseki[i]) answer = (ruiseki[i + K] - ruiseki[i] > 0 ? ruiseki[i + K] - ruiseki[i] : 0) + absruiseki[N] - absruiseki[i + K] + absruiseki[i];
}
printf("%lld\n", answer);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n, k;
cin >> n >> k;
vl a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vl b = a;
for (int i = 0; i < n; ++i) {
b[i] = max(b[i], 0LL);
}
for (int i = 1; i < n; ++i) {
b[i] += b[i - 1];
a[i] += a[i - 1];
}
ll ret = 0;
for (int i = 0; i < n - k + 1; ++i) {
ll temp = a[i + k - 1];
temp += b[n - 1] - b[i + k - 1];
if (i != 0) {
temp -= a[i - 1];
temp += b[i - 1];
}
chmax(ret, temp);
temp = b[n - 1] - b[i + k - 1];
if (i != 0) {
temp += b[i - 1];
}
chmax(ret, temp);
}
cout << ret << "\n";
return 0;
} | 1 | 7,645,277 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int long long int
#define mod 1000000007
#define test int t;cin>>t;while(t--)
#define REP(i,a,b) for(int i=a,i<=b;i++)
#define MAXN 200001
struct plans{
int x,y,z;
};
int32_t main()
{
int n;cin>>n;
vector<plans> vp;
int x,y,z;
for(int i=0;i<n;i++){
cin>>x>>y>>z;
vp.pb({x,y,z});
}
int dp[n+1][3];
memset(dp,0,sizeof(dp));
dp[0][0]=vp[0].x;
dp[0][1]=vp[0].y;
dp[0][2]=vp[0].z;
for(int i=1;i<n;i++){
dp[i][0]=vp[i].x + max(dp[i-1][2],dp[i-1][1]);
dp[i][1]=vp[i].y + max(dp[i-1][0],dp[i-1][2]);
dp[i][2]=vp[i].z + max(dp[i-1][1],dp[i-1][0]);
}
cout<<max(dp[n-1][0],max(dp[n-1][1],dp[n-1][2]))<<endl;
return 0;
} | #include <iostream>
#include<bits/stdc++.h>
#define l long
using namespace std;
int solve(int idx , int n , vector<vector<int>>&dp ,vector<vector<int>>&act , int check)
{
if(idx >= n)
return 0;
if(dp[idx][check] != -1)
return dp[idx][check];
int op1 = -1e7;
int op2 = -1e7;
int op3 = -1e7;
if(check != 0)
op1 = solve(idx+ 1, n , dp , act , 0) + act[idx][0];
if(check != 1)
op2 = solve(idx +1 , n , dp , act , 1) + act[idx][1];
if(check != 2)
op3 = solve(idx + 1, n , dp , act , 2)+ act[idx][2];
dp[idx][check] = max(op1 ,max(op2 , op3));
return dp[idx][check];
}
int main()
{
int n;
cin>>n;
vector<vector<int>>act(n , vector<int>(3));
for(int i = 0 ;i<n ;i++)
{
int a,b,c;
cin>>a>>b>>c;
act[i][0] = a;
act[i][1] = b;
act[i][2] = c;
}
vector<vector<int>>dp(n +1 , vector<int>(4 , -1));
int ans = solve(0 , n , dp , act , 3);
cout<<ans<<endl;
return 0;
} | 1 | 40,457,595 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
string res="";
stack<char>br;
cin>>n>>s;
for(int i=0;i<n;i++)
{
if(s[i]=='('){
br.push(s[i]);
res=res+"(";
}
else if(s[i]==')')
{
if(br.size()==0){
res="("+res;
res=res+")";}
else
{
br.pop();
res=res+")";
}
}
}
for(int i=0;i<br.size();i++)
res=res+")";
cout<<res<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
int divr[maxn];
void divisor()
{for(int i=2;i<sqrt(maxn);i++)
{
if(!divr[i])
{
for(int j=i*i;j<maxn;j+=i)if(!divr[j])divr[j]=i;
}
}
for(int i=1;i<maxn;i++)if(!divr[i])divr[i]=i;
}
int main()
{
int n;
cin>>n;
string s;
cin>>s;
int opn=0,clo=0;
deque<char> dq;
for(int i=0;i<n;i++)
{
if(s[i]==')'&&opn==0)
{
clo++;
}
else if(s[i]=='('&&clo!=0)
{
for(int l=0;l<clo;l++)dq.push_front('(');
for(int l=0;l<clo;l++)dq.push_back(')');
clo=0;
dq.push_back('(');opn++;
}
else if(s[i]=='('&&clo==0)
{
dq.push_back('(');
opn++;
}
else if(s[i]==')'&&opn!=0){dq.push_back(')');opn--;}
}
while(opn!=0)
{
dq.push_back(')');opn--;
}
while(clo!=0)
{
dq.push_front('(');
dq.push_back(')');clo--;
}
for(int i=0;i<dq.sz;i++)cout<<dq[i];
} | 1 | 43,773,366 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int f[50];
int main() {
int n; scanf("%d", &n);
f[0] = f[1] = 1;
for (int i = 2; i <= n; i++)f[i] = f[i - 2] + f[i - 1];
printf("%d\n", f[n]);
} | #include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
long *memo;
long fib(long n){
if(n < 2) return 1;
return memo[n] != -1 ? memo[n] : (memo[n] = fib(n-1) + fib(n-2));
}
int main() {
memo = new long[64];
for(int i = 0; i < 64; i++){
memo[i] = -1;
}
long n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | 1 | 16,112,711 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
typedef std::pair<int, int> ii;
int H, W, M;
int SH[300005];
int SW[300005];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> H >> W >> M;
for (int i = 0; i < H; ++i)
SH[i] = 0;
for (int j = 0; j < W; ++j)
SW[j] = 0;
std::set<ii> targets;
for (int i = 0; i < M; ++i) {
int h, w; std::cin >> h >> w;
h--; w--;
SH[h]++;
SW[w]++;
targets.insert({h, w});
}
std::vector<ii> SSH, SSW;
for (int h = 0; h < H; ++h)
SSH.push_back({SH[h], h});
for (int w = 0; w < W; ++w)
SSW.push_back({SW[w], w});
std::sort(SSH.begin(), SSH.end());
std::sort(SSW.begin(), SSW.end());
int max_ans = SSH[H-1].first + SSW[W-1].first;
int ans = 0;
for (int i = H-1; i >= 0; --i) {
if (max_ans - (SSH[i].first + SSW[W-1].first) >= 2) break;
for (int j = W-1; j >= 0; --j) {
if (max_ans - (SSH[i].first + SSW[j].first) >= 2) break;
int cnt = SSH[i].first + SSW[j].first;
if (cnt <= ans) break;
if (targets.find({SSH[i].second, SSW[j].second}) != targets.end())
cnt--;
ans = std::max(ans, cnt);
}
}
std::cout << ans << "\n";
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define li long ll
#define pp pair<ll, ll>
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
#define pb push_back
#define llp(i, x, n) for (ll i = x; i < n; i++)
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define fr first
#define ss second
#define mod 1000000007
using namespace std;
int main()
{
fast;
ll h,w,m;
cin>>h>>w>>m;
unordered_map<ll,ll> um1,um2;
unordered_map<string,bool> res;
while(m--)
{
ll a,b;
cin>>a>>b;
string s;
s+=to_string(a);
s+=to_string(b);
res[s]=true;
um1[a]++,um2[b]++;
}
ll m1=-1,m2=-1;
vector<int> v1,v2;
for(auto it:um1)
{
m1=max(m1,it.ss);
}
for(auto it:um2)
{
m2=max(m2,it.ss);
}
for(auto it:um1)
{
if(it.ss==m1)
v1.pb(it.fr);
}
for(auto it:um2)
{
if(it.ss==m2)
v2.pb(it.fr);
}
int f=0;
for(int i=0;i<v1.size();i++)
{
string str;
for(int j=0;j<v2.size();j++)
{
str+=to_string(v1[i]);
str+=to_string(v2[j]);
if(res[str]==false)
{
f=1;
break;
}
str="";
}
if(f==1)
break;
}
if(f==1)
cout<<m1+m2<<endl;
else
cout<<m1+m2-1<<endl;
} | 1 | 61,790,594 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
const double pi = acos(-1.0);
int main() {
ll x, a, b; cin >> x >> a >> b;
string ans;
if(b <= a) ans = "delicious";
else if(b - a > x) ans = "dangerous";
else ans = "safe";
cout << ans << endl;
} | #include<iostream>
int main(){
int X, A, B;
std::cin >> X >> A >> B;
if(B - A <= 0) std::cout <<"delicious";
else if(B - A > X) std::cout << "dangerous";
else std::cout<<"safe";
} | 1 | 89,776,191 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int g[100010];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
int main() {
int n,L,T;
long long s=0;
cin>>n>>L>>T;
for(int i=0;i<n;i++) {
int x=gi(),y=gi();
if(y==1) {
g[i]=(x+T)%L;
if(T>=L-x) s+=(T-L+x)/L+1;
}
else {
g[i]=((x-T)%L+L)%L;
if(T>=x+1) s-=(T-x-1)/L+1;
}
}
s=(s%n+n)%n,sort(g,g+n);
for(int i=0;i<n;i++) printf("%d\n",g[(s+i)%n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int x[N], d[N], ans[N];
int main() {
int n, l, t;
scanf("%d%d%d", &n, &l, &t);
vector<int> L, R;
for (int i = 0; i < n; ++ i) {
scanf("%d%d", &x[i], &d[i]);
(d[i] == 1 ? R : L).push_back(x[i]);
(d[i] == 1 ? R : L).push_back(x[i] - l);
(d[i] == 1 ? R : L).push_back(x[i] + l);
}
sort(L.begin(), L.end());
sort(R.begin(), R.end());
if (L.empty()) {
for (int i = 0; i < n; ++ i) printf("%lld ", 1LL * (x[i] + t) % l); puts("");
return 0;
}
if (R.empty()) {
for (int i = 0; i < n; ++ i) printf("%lld ", (1LL * (x[i] - t) % l + l) % l); puts("");
return 0;
}
int base = (2 * t) / l;
for (int i = 0; i < n; ++ i) {
if (d[i] == 1) {
int rt = 2 * t - base * l;
int cnt = upper_bound(L.begin(), L.end(), x[i] + rt) - lower_bound(L.begin(), L.end(), x[i]);
cnt += 1LL * base * L.size() / 3 % n;
ans[(i + cnt) % n] = (x[i] + t) % l;
}
else {
int rt = 2 * t - base * l;
int cnt = upper_bound(R.begin(), R.end(), x[i]) - lower_bound(R.begin(), R.end(), x[i] - rt);
cnt += 1LL * base * R.size() / 3 % n;
ans[((i - cnt) % n + n) % n] = ((x[i] - t) % l + l) % l;
}
}
for (int i = 0; i < n; ++ i) printf("%d ", ans[i]); puts("");
} | 1 | 77,582,823 |
#include<cstdio>
#include<vector>
using namespace std;
int n, sum[1000001], isP[1000001];
vector<int> p;
int main() {
for (int i = 2; i * i <= 1000000; i++) {
bool ok = true;
for (int j = 0; j < p.size(); j++) if (i % p[j] == 0) {
ok = false;
break;
}
if (ok) p.push_back(i);
}
for (int i = 2; i <= 1000000; i++) isP[i] = 1;
for (int i = 0; i < p.size(); i++) {
int k = 2;
while (p[i] * k <= 1000000) isP[p[i] * k] = 0, k++;
}
for (int i = 1; i <= 1000000; i++) sum[i] = sum[i-1] + isP[i];
while (scanf("%d", &n), n) {
printf("%d\n", sum[n]);
n = 0;
}
} | #include<cstdio>
#define MAX 1000010
bool is_prime[MAX];
int sieve(int n) {
for (int i = 0; i <= n; ++i) is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
int count = 0;
for (int i = 2; i <= n; ++i) {
if (is_prime[i]) {
++count;
for (int j = 2 * i; j <= n; j += i) {
is_prime[j] = false;
}
}
}
return count;
}
int main()
{
int n;
while (scanf("%d", &n) == 1) {
printf("%d\n", sieve(n));
}
return 0;
} | 1 | 12,082,742 |
#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FI first
#define SE second
#define endl "\n"
#define ciosup cin.tie(0);ios::sync_with_stdio(false);
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
cout << 180 * (n - 2) << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) {rep(_,v.size())printf("%d ",v[_]);cout<<endl;}
#define show2d(v) {rep(__,v.size())show1d(v[__]);}
using namespace std;
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
#define yes puts("YES")
#define no puts("NO")
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
cout<<180*(n-2)<<endl;
} | 1 | 80,888,962 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int n;
cin>>n;
vector<int> arr(100001,0);
for(int i = 0 ; i< n ;i++)
{
int c;
cin>>c;
arr[c]++;
}
int pos =-1;
int ans = 0;
if(ans<arr[0]+arr[1])
{
ans = arr[0]+arr[1];
pos=0;
}
if(ans<arr[100000]+arr[100001])
{
ans = arr[100000]+arr[100000-1];
pos=100000;
}
for(int index = 1 ;index<100000;index++)
{
if(ans<arr[index]+arr[index-1]+arr[index+1])
{
ans = arr[index]+arr[index-1]+arr[index+1];
pos = index;
}
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[100010]={0};
int x;
int i,j;
int ans=1;
int max=1;
for(i=0; i<N; i++){
cin >> x;
if(x!=0){
for(j=-1; j<2; j++){
a[x+j]++;
}
}
else{
a[0]++;
a[1]++;
}
if(x>max) max=x;
}
for(i=0; i<=100000; i++){
if(ans<a[i]) ans=a[i];
}
cout << ans << endl;
return 0;
} | 1 | 7,265,310 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <vector>
using namespace std;
int main(){
int n, a, b;
cin >> n;
bool flg_a = 0, flg_b = 0;
vector<int> data_a(n);
vector<int> data_b(n);
vector<int> pmt(n);
for (int i = 0; i < n; i++){
cin >> data_a[i];
pmt[i] = i+1;
}
for (int i = 0; i < n; i++){
cin >> data_b[i];
}
int i = 1;
do {
if(data_a == pmt){
a = i;
flg_a = 1;
}
if(data_b == pmt){
b = i;
flg_b = 1;
}
if(flg_a && flg_b)break;
i++;
} while (next_permutation(pmt.begin(), pmt.end()));
cout << abs(a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> array(n),parray(n),qarray(n);
for(int i=0;i<n;i++) cin >> parray.at(i);
for(int i=0;i<n;i++) cin >> qarray.at(i);
int num = 1;
for(int i=0;i<n;i++){
array.at(i) = num;
num++;
}
int cnt = 0,p=0,q=0;
while(next_permutation(array.begin(),array.end())){
cnt ++;
if(array == parray) p = cnt;
if(array == qarray) q = cnt;
}
cout << abs(p-q) << endl;
} | 1 | 86,756,884 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
#include<cassert>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> P;
typedef vector<int> vi;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define all(c) c.begin(),c.end()
#define show(x) cout << #x << " = " << x << endl
#define fi first
#define se second
#define pb push_back
#define DEBUG
template <class X>
void print_vector(const std::vector<X> &t);
template <class X>
void unique_vector(std:: vector<X> &t);
int w, h;
vector<int> xl={-1, 0, 1, 0};
vector<int> yl={0, 1, 0, -1};
int main(){
vi ans;
while(true){
cin >> w >> h;
if(w == 0 && h == 0) break;
vector<vector<char>> f(h, vector<char>(w));
queue<P> ser;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++) {
cin >> f[i][j];
if(f[i][j] == '@')
ser.push(make_pair(i, j));
}
}
int c = 0;
while(!ser.empty()){
P t = ser.front();
ser.pop();
int y = t.fi, x = t.se;
if(f[y][x] == '@') f[y][x] = '#';
for(int i = 0; i < 4; i++) {
int dx = x+xl[i], dy=y+yl[i];
if(dy < 0 || dy >= h || dx < 0 || dx >= w || f[dy][dx] == '#')
continue;
if(f[dy][dx] == '.'){
c++;
ser.push(make_pair(dy, dx));
f[dy][dx] = '#';
}
}
}
ans.pb(c+1);
}
for(auto &i : ans) cout << i << endl;
}
template <class X>
void unique_vector(std::vector<X> &t)
{
std::sort(t.begin(), t.end());
t.erase( std::unique(t.begin(), t.end()), t.end() );
}
template <class X>
void print_vector(const std::vector<X> &t){
for(auto itr=t.begin(); itr != t.end(); itr++){
std::cout << *itr;
if(itr != t.end()-1) std::cout << ' ';
}
std::cout << std::endl;
} | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
#include <ctime>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define pb push_back
#define mp make_pair
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
const double PI = acos(-1);
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
bool check(int x, int y, int h, int w){
return x < 0 || x >= w || y < 0 || y >= h;
}
int main(){
int w, h;
while(cin>>w>>h && w > 0 && h > 0){
vector<string> v(h);
rep(i, h) cin>>v[i];
pii s;
rep(i, h) rep(j, w) if(v[i][j] == '@') s.fi = i, s.se = j;
int ans = 0;
set<pii> used;
used.insert(s);
ans++;
queue<pii> q;
q.push(s);
while(!q.empty()){
pii p = q.front();
q.pop();
int x = p.se, y = p.fi;
rep(i, 4){
int nx = x + dx[i], ny = y + dy[i];
if(check(nx, ny, h, w) || used.count({ny, nx}) || v[ny][nx] == '#') continue;
used.insert({ny, nx});
q.push({ny, nx});
ans++;
}
}
cout<<ans<<endl;
}
} | 1 | 13,037,355 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s, w;
cin >> s >> w;
cout << (w>=s ? "unsafe" : "safe");
return 0;
} | #include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tp3 = tuple<int, int, int>;
using Mat = vector<vector<ll>>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1ll << 60;
constexpr int dh[4] = { 0,1,0,-1 };
constexpr int dw[4] = { -1,0,1,0 };
bool isin(const int H, const int W, const int h, const int w) {
return 0 <= h && h < H && 0 <= w && w < W;
}
int main()
{
int S, W;
cin >> S >> W;
cout << (W >= S ? "unsafe" : "safe") << endl;
return 0;
} | 1 | 71,143,054 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
char field[1000][1000];
class Data {
public:
int x, y, count;
Data() {}
Data(int x, int y, int count) : x(x), y(y), count(count) {}
};
int main() {
int h, w, n;
cin >> h >> w >> n;
Data start;
int ans = 0;
for (int i = 0; i < h; i++) {
cin >> field[i];
for (int j = 0; j < w; j++) {
if (field[i][j] == 'S') {
start = Data(j, i, 0);
}
}
}
for (int i = 1; i <= n; i++) {
queue<Data> Q;
Q.push(start);
bool flg[1000][1000] = {{0}};
while (!Q.empty()) {
Data d = Q.front(); Q.pop();
if (field[d.y][d.x] == i + '0') {
start = Data(d.x, d.y, d.count);
break;
}
if (flg[d.y][d.x]) continue;
flg[d.y][d.x] = true;
for (int j = 0; j < 4; j++) {
int px = d.x + dx[j], py = d.y + dy[j];
if (px < 0 || py < 0 || px >= w || py >= h) continue;
if (field[py][px] == 'X') continue;
Q.push(Data(px, py, d.count + 1));
}
}
ans = start.count;
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<queue>
using namespace std;
string s[1000];
int h,w,n;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int bfs(int x,int y,int now)
{
int d[h][w]={};
queue<pair<int,int>>Q;
Q.push(make_pair(8,x*1000+y));
while(!Q.empty())
{
pair<int,int>a=Q.front();Q.pop();
int tx=a.second/1000,ty=a.second%1000;
if(s[tx][ty]-'0'==now)
{
return a.first/10;
}
for(int r=0;r<4;r++)
{
if(abs(a.first%10-r)==2)continue;
int sx=tx+dx[r];
int sy=ty+dy[r];
if(sx<0||sy<0||sx>=h||sy>=w||s[sx][sy]=='X'||d[sx][sy]!=0)continue;
Q.push(make_pair((a.first/10+1)*10+r,sx*1000+sy));
d[sx][sy]=1;
}
}
return 1<<26;
}
int main()
{
cin>>h>>w>>n;
for(int i=0;i<h;i++)cin>>s[i];
int c=0;
pair<int,int> pr[9];
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
if(s[i][j]=='S')
{
pr[0]=make_pair(i,j);
}
else if(s[i][j]>='0'&&s[i][j]<='8')
{
pr[s[i][j]-'0']=make_pair(i,j);
}
}
}
for(int i=1;i<=n;i++)
{
c+=bfs(pr[i-1].first,pr[i-1].second,i);
}
cout<<c<<endl;
return 0;
} | 1 | 96,105,921 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
if (n % k > 0) {
ans = 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define ld long double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,k; cin>>n>>k;
cout<<(n%k!=0)<<endl;
return 0;
} | 1 | 85,842,642 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int64_t INF = 1LL << 60;
int main() {
int64_t N,A,B;
cin>>N>>A>>B;
if(B<A){cout<<0<<endl;}
else if(N==1){if(A!=B){cout<<0<<endl;}
else{cout<<1<<endl;}}
else{
cout<<(B-A)*(N-2)+1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b; scanf("%d%d%d", &n, &a, &b);
long long ret;
if (a>b) {ret = 0;}
else if (a!=b && n==1) {ret = 0;}
else if (a==b && n==1) {ret = 1;}
else {ret = (long long)(b-a)*(n-2)+1;}
printf("%lld\n", ret);
return 0;
} | 1 | 62,011,387 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int n,z,w;
cin>>n>>z>>w;
vector<int> a(n);for(auto &i:a)cin>>i;
if(n==1){cout<<abs(w-a[0]);return 0;}
cout<<max(abs(a[n-1]-a[n-2]),abs(a[n-1]-w));
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int n,z,w; cin >> n >> z>> w;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >>a[i];
}
if(n>1){
int ans =max(abs(a[n-1]-w), abs(a[n-2]- a[n-1]));
cout << ans << endl;
}
else{
cout << abs(a[0]-w) << endl;
}
return 0;
} | 1 | 26,504,858 |
#include<iostream>
using namespace std;
#include<stdlib.h>
int main()
{
int i, n, d, p, q;
cin >> n;
int *P, *C, *S;
P = new int [n]; C = new int [n]; S = new int [n];
if(P == NULL || C == NULL || S == NULL) exit(EXIT_FAILURE);
for(i = 0; i < n; i++){ P[i] = -1; S[i] = -1; }
while(cin >> i){
cin >> d;
if(d == 0){
C[i] = -1;
}else{
cin >> p;
C[i] = p; P[p] = i;
while(d > 0){
if(d == 1){ break; }
else{
cin >> q;
S[p] = q; P[q] = i;
p = q; d--;
}
};
}
};
for(i = 0; i < n; i++){
cout << "node " << i << ": parent = " << P[i] << ", depth = ";
p = P[i]; d = 0;
while(p >= 0){ p = P[p]; d++; };
cout << d << ", ";
if(P[i] < 0){
cout << "root";
}else if(C[i] < 0){
cout << "leaf";
}else{
cout << "internal node";
}
cout << ", [";
if(C[i] >= 0){
cout << C[i];
p = C[i];
while(S[p] >= 0){ cout << ", " << S[p]; p = S[p]; };
}
cout << "]" << endl;
}
delete [] P; delete [] C; delete [] S;
return 0;
} | #include <cstdio>
using std::scanf;
using std::printf;
const int kNil = -1;
struct Node { int parent, left, right; };
void SetDepth(struct Node tree[], int cur_node, int cur_depth, int depth[]) {
depth[cur_node] = cur_depth;
if (tree[cur_node].left != kNil) {
SetDepth(tree, tree[cur_node].left, cur_depth + 1, depth);
}
if (tree[cur_node].right != kNil) {
SetDepth(tree, tree[cur_node].right, cur_depth, depth);
}
}
int main() {
int n;
scanf("%d", &n);
struct Node tree[n];
for (int i = 0; i < n; ++i) {
tree[i].parent = kNil;
tree[i].left = kNil;
tree[i].right = kNil;
}
for (int i = 0; i < n; ++i) {
int id;
scanf("%d", &id);
int k;
scanf("%d", &k);
if (k == 0) {}
if (k == 1) {
int c;
scanf("%d", &c);
tree[id].left = c;
tree[c].parent = id;
}
if (k >= 2) {
int c1, c2;
scanf("%d", &c1);
tree[id].left = c1;
tree[c1].parent = id;
for (int j = 0; j < k - 1; ++j) {
scanf("%d", &c2);
tree[c1].right = c2;
tree[c2].parent = id;
c1 = c2;
}
}
}
int root;
for (int i = 0; i < n; ++i) {
if (tree[i].parent == kNil) {
root = i;
break;
}
}
int depth[n];
SetDepth(tree, root, 0, depth);
for (int i = 0; i < n; ++i) {
int parent = tree[i].parent;
int child = tree[i].left;
printf("node %d: parent = %d, depth = %d, ", i, parent, depth[i]);
if (parent == kNil) {
printf("root, ");
} else if (child == kNil) {
printf("leaf, ");
} else {
printf("internal node, ");
}
printf("[");
if (child != kNil) {
printf("%d", child);
while (tree[child].right != kNil) {
child = tree[child].right;
printf(", %d", child);
}
}
printf("]\n");
}
return 0;
} | 1 | 56,338,621 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const int INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(int m,int n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;i++){
if(n & (1<<i)){
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(int x){
if(x == 0)return 1;
return x * kaizyou(x-1) % MOD;
}
long long comb(int x,int y){
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x-y) * kaizyou(y) % MOD;
return bunsi * ruizyou((int)bunbo,MOD-2) % MOD;
}
int main(){
int X,Y;
cin >> X >> Y;
double x,y;
x = (-1/3.0)*(X - 2*Y);
y = (-1/3.0)*(-2*X + Y);
if(abs(x-int(x)) > 0.01 || abs(y-int(y)) > 0.01 || x < 0 || y < 0){
cout << 0 << endl;
}
else{
cout << comb(int(x+y),int(x)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int combination_max=1000000+1000000+2;
const int combination_modulo=1000000007;
vector<int64_t> factorials(combination_max);
vector<int64_t> factorials_inv(combination_max);
vector<int64_t> inverse(combination_max);
int combination_mod(int n, int k);
int prepare_combination_mod();
int main()
{
int x,y;
cin >> x >> y;
if ( ((2*x-y)%3!=0) && ((2*y-x)%3!=0) )
{
cout << 0 << endl;
return 0;
}
int n1,n2;
n2=(2*x-y)/3;
n1=(2*y-x)/3;
if ((n1<0)||(n2<0))
{
cout << 0 << endl;
return 0;
}
prepare_combination_mod();
cout << combination_mod(n1+n2,n1) << endl;
}
int prepare_combination_mod()
{
factorials[0]=1;
factorials[1]=1;
factorials_inv[0]=1;
factorials_inv[1]=1;
inverse[1]=1;
for (int i=2;i<combination_max;++i)
{
factorials[i]=factorials[i-1]*i%combination_modulo;
inverse[i]=combination_modulo - inverse[combination_modulo%i]*(combination_modulo/i)%combination_modulo;
factorials_inv[i]=factorials_inv[i-1]*inverse[i]%combination_modulo;
}
return 0;
}
int combination_mod(int n, int k)
{
return factorials[n]*(factorials_inv[k]*factorials_inv[n-k]%combination_modulo)%combination_modulo;
} | 1 | 85,130,593 |
#include<bits/stdc++.h>
#define PI acos(-1.0)
#define eps 1e-67
#define pf printf
#define sf scanf
#define sd(n) scanf("%d",&n)
#define sd2(n1,n2) scanf("%d %d",&n1,&n2)
#define slf(n) scanf("%lf",&n)
#define slf2(n1,n2) scanf("%lf %lf",&n1,&n2)
#define sLf(n1) scanf("%Lf",&n1)
#define sLf2(n1,n2) scanf("%Lf %Lf",&n1,&n2)
#define sl(n) scanf("%lld",&n)
#define sl2(n1,n2) scanf("%lld %lld",&n1,&n2)
#define rep(i,a,b) for(long long int i=a;i<b;i++)
#define repb(i,a,b) for(long long int i=a;i>=b;i--)
#define repa(i,a,b,c) for(long long int i=a;i<b;i=i+c)
#define reps(i,a,b,c) for(long long int i=a;i>b;i=i-c)
#define asort(a) sort(a.begin(),a.end())
#define asortb(a,comp) sort(a.begin(),a.end(),comp)
#define arev(a) reverse(a.begin(),a.end())
#define all(v) (v).begin(),(v).end()
#define allc(v,comp) (v).begin(),(v).end(),comp
#define allrc(v,a,b,comp) (v).begin()+a,(v).end()-b,comp
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define pbb pop_back
#define mp make_pair
#define mt make_tuple
#define bs(v,x) binary_search(v.begin(),v.end(),x)
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define tl(c) towlower(c)
#define root(x) sqrt(x)
#define power(a,n) pow(a,n)
#define tu(c) towupper(c)
#define sq(a) ((a)*(a))
#define cube(a) ((a)*(a)*(a))
#define mx 1000
#define MX 100000
#define mod 1000000007
using namespace std;
typedef string str;
typedef long long int ll;
typedef double lf;
typedef long double llf;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef char ch;
typedef map<ll,ll> mp;
int main()
{
str s;
cin>>s;
arev(s);
str s1[]={"dream","dreamer","erase","eraser"};
rep(i,0,4)
{
arev(s1[i]);
}
int pos=0;
while(1){
bool ok=false;
rep(i,0,4)
{
if(s.substr(pos,s1[i].size())==s1[i])
{
ok=true;
pos=pos+s1[i].size();
break;
}
}
if(pos>=s.size())
{
cout<<"YES"<<endl;
return 0;
}
if(ok==false)
{
cout<<"NO"<<endl;
return 0;
}
}
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
reverse(s.begin(), s.end());
string t = "";
for (int i = 0; i < s.length(); i++) {
if (s.substr(i, 5) == "maerd") {
t += "maerd";
i += 4;
}else if (s.substr(i, 7) == "remaerd") {
t += "remaerd";
i += 6;
}else if (s.substr(i, 5) == "esare") {
t += "esare";
i += 4;
}else if (s.substr(i, 6) == "resare") {
t += "resare";
i += 5;
}
}
cout << (s == t ? "YES" : "NO") << endl;
return 0;
} | 1 | 33,310,939 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
#define UB upper_bound
#define LB lower_bound
const int NUM = 2e5 + 5;
int dp[100][NUM];
int a[100],n,k;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int num_tests=1;
while(num_tests-->0){
cin >> n >> k;
FOR(i,0,n){
cin >> a[i];
}
FOR(i,0,a[0]+1)
dp[0][i] = 1;
FOR(i,1,n){
vector<int> ps(k+1,0);
ps[0] = dp[i-1][0];
FOR(j,1,k+1)
ps[j] = (ps[j-1] + dp[i-1][j]) % mod;
FOR(j,0,k+1){
if(j > a[i])
dp[i][j] = (ps[j] - ps[j-a[i]-1] + mod) % mod;
else
dp[i][j] = ps[j];
}
}
cout << dp[n-1][k];
}
} | #include<bits/stdc++.h>
using namespace std;
int mod = 1e9+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
vector<int> candies(n+1,0);
for(int i=1;i<=n;i++) {
cin>>candies[i];
}
vector<vector<int>> dp(n+1,vector<int>(k+1));
dp[0][0] = 1;
for(int i=1;i<=k;i++) {
dp[0][i] = 0;
}
for(int i=1;i<=n;i++) {
vector<int> sum(k+1);
sum[0] = dp[i-1][0];
for(int j=1;j<=k;j++){
sum[j] = (sum[j-1] + dp[i-1][j])%mod;
}
for(int j=0;j<=k;j++) {
if(j<=candies[i]) {
dp[i][j] = sum[j];
}
else {
int uptill = j-candies[i]-1;
dp[i][j] = (sum[j] - sum[uptill] + mod)%mod;
}
}
sum.clear();
}
cout<<dp[n][k];
} | 1 | 41,526,828 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
bool check[110000];
int cnt,n;
int a[110000];
void dfs(int n){
if(check[n])return;
check[n]=1;
if(n==2)return;
cnt++;
dfs(a[n]);
}
int main(){cout<<fixed<<setprecision(10);
cin>>n;
rep(i,1,n+1)cin>>a[i];
dfs(1);
if(check[2])cout<<cnt<<endl;
else cout<<-1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
signed main(){
IOS;
int n; cin >> n;
vector<int> next(n + 1), ok(n + 1);
for(int i = 0; i < n; i++) {
cin >> next[i + 1];
}
int ans = 0, now = 1;
while(++ans) {
int cur = next[now];
if(cur == 2) {
cout << ans << "\n";
return 0;
}
if(!ok[cur]) ok[cur]++;
else {
cout << "-1\n";
return 0;
}
now = cur;
}
} | 1 | 34,966,808 |
#include<bits/stdc++.h>
using namespace std;
int a,b,bj;
int main()
{
cin>>a>>b;
if((!((a+b)%3))||(!(b%3))||(!(a%3)))puts("Possible");
else puts("Impossible");
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll a, b; cin >> a >> b;
cout << ((a%3 == 0 || b%3 == 0 || (a+b)%3 == 0) ? "Possible" : "Impossible") << endl;
} | 1 | 24,337,877 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<set>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
int main(){
int N; cin >> N;
int index[N+1];
repn(i, N){
int p; cin >> p;
index[p] = i;
}
multiset<int> S{0, 0, N+1, N+1};
S.insert(index[N]);
long sum = 0;
for (int a = N-1; a >= 1; a--){
auto itr = S.lower_bound(index[a]);
int R1 = *itr; int R2 = *++itr; --itr;
int L1 = *--itr; int L2 = *--itr;
long c = (L1-L2)*(R1-index[a]) + (index[a]-L1)*(R2-R1);
sum += c * a;
S.insert(index[a]);
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#include<algorithm>
#include<stdio.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=1e13;
const ll maxn=1e6+5;
const int mod=998244353;
const double eps=1e-12;
ll n,m,p;
ll num[maxn];
int pre[maxn][2];
int cur[maxn][2];
struct node{
int l,r;
ll w;
}t[maxn<<2];
inline bool read(ll &num)
{
char in;bool IsN=false;
in=getchar();
if(in==EOF) return false;
while(in!='-'&&(in<'0'||in>'9')) in=getchar();
if(in=='-'){ IsN=true;num=0;}
else num=in-'0';
while(in=getchar(),in>='0'&&in<='9'){
num*=10,num+=in-'0';
}
if(IsN) num=-num;
return true;
}
void build(int k,int l,int r){
t[k].l=l;t[k].r=r;
if(l==r){
t[k].w=num[l];
return;
}
int mid=(l+r)/2;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
t[k].w=max(t[k<<1].w,t[k<<1|1].w);
}
ll query(int k,int x,int y){
if(t[k].l>=x&&t[k].r<=y){
return t[k].w;
}
ll sum=0;
int mid=(t[k].l+t[k].r)/2;
if(x<=mid) sum=max(query(k<<1,x,y),sum);
if(y>mid) sum=max(query(k<<1|1,x,y),sum);
return sum;
}
void work_one(){
for(int i=1;i<=n;i++){
pre[i][1]=pre[i][0]=0;
ll l=1,r=i-1;
ll ans=-1,aim=num[i];
while(l<=r){
ll mid=(l+r)/2;
if(query(1,mid,i)>aim){
l=mid+1;
ans=mid;
}
else r=mid-1;
}
if(ans==-1) continue;
pre[i][0]=ans;
ll temp=-1;
l=1,r=ans-1;
while(l<=r){
ll mid=(l+r)/2;
if(query(1,mid,ans-1)>aim){
l=mid+1;
temp=mid;
}
else r=mid-1;
}
if(temp==-1) continue;
pre[i][1]=temp;
}
}
void work_two(){
for(int i=n;i>=1;i--){
cur[i][1]=cur[i][0]=n+1;
ll l=i+1,r=n;
ll ans=-1,aim=num[i];
while(l<=r){
ll mid=(l+r)/2;
if(query(1,i,mid)>aim){
r=mid-1;
ans=mid;
}
else l=mid+1;
}
if(ans==-1) continue;
cur[i][0]=ans;
ll temp=-1;
l=ans+1,r=n;
while(l<=r){
ll mid=(l+r)/2;
if(query(1,ans+1,mid)>aim){
r=mid-1;
temp=mid;
}
else l=mid+1;
}
if(temp==-1) continue;
cur[i][1]=temp;
}
}
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)read(num[i]);
build(1,1,n);
work_one();
work_two();
ll ans=0;
for(int i=1;i<=n;i++){
ans+=(pre[i][0]-pre[i][1])*(cur[i][0]-i)*num[i];
ans+=(cur[i][1]-cur[i][0])*(i-pre[i][0])*num[i];
}
printf("%lld\n",ans);
return 0;
} | 1 | 2,534,017 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) { return b / c - (a - 1) / c; }
void print_binary(long long a) {
for (int i = 31; i >= 0; i--) {
cout << (a >> i & 1);
}
cout << endl;
}
long long modpow(long long m, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t;
} else {
return modpow(m, n - 1) * m;
}
}
void yes() {
cout << "Yes" << endl;
exit(0);
}
void no() {
cout << "No" << endl;
exit(0);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
vector<int> h, memo;
signed main() {
long long x, y, ans = 1e9 + 10;
cin >> x >> y;
if (x <= y) {
ans = min(y - x, ans);
}
if (x <= -y) {
ans = min(-y - x + 1, ans);
}
if (-x <= y) {
ans = min(y + x + 1, ans);
}
if (-x <= -y) {
ans = min(-y + x + 2, ans);
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
const int mxn = 1e6+10;
const int mod = 1e9+7;
const int inf = 2e9+10;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int x, y; cin>>x>>y;
long long ans1 = y>=x? y-x:inf, ans2 = -y>=x? -y-x+1:inf,
ans3 = y>=-x? y+x+1:inf, ans4 = -y>=-x? -y+x+2:inf;
cout << min(min(ans1, ans2), min(ans3, ans4)) <<'\n';
return 0;
} | 1 | 18,326,151 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
ll n;
cin >> n;
cout << n*(n-1)/2 << 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;
using P = pair<int,int>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
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 ch(string s){
int a=sz(s);
if(a%2){
return 0;
}else{
string b,c;
b="";c="";
rep(i,a/2){
b+=s[i];
}
FOR(i,a/2,a-1){
c+=s[i];
}
if(b==c){
return a;
}else{
return 0;
}
}
}
int main() {
ll n;cin>>n;
cout<<((n-1)*n)/2<<endl;
return 0;
} | 1 | 56,342,792 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
typedef long long ll;
typedef pair<int,int> ip;
typedef pair<ll,ll> lp;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
ll n,m;
cin>>n>>m;
if(n==1&&m==1){cout<<1<<endl; return 0;}
if(n==1 || m==1){cout<<n*m-2LL<<endl; return 0;}
else cout<<(n-2LL)*(m-2LL)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using ll =long long;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
int main(){
ll n,m;
cin >> n >> m;
if(n>2 && m>2){
cout << (n-2)*(m-2) << endl;
}else{
if(n==1 && m==1){
cout << 1 << endl;
}
else if(n==1){
cout << m-2 << endl;
}else if(m==1){
cout << n-2 << endl;
}else if(n==2 || m==2){
cout << 0 << endl;
}
}
} | 1 | 74,399,703 |
#include <bits/stdc++.h>
using namespace std;
#define ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
string group(string s){
string result;
result += s[0];
for(int i(0); i<s.length() - 1; i++){
if(s[i] != s[i+1]){
result += s[i+1];
}
}
return result;
}
int main(){
io
int n;
string s;
cin >> n >> s;
string str;
str = group(s);
cout << str.length() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main(){
int n,ans=1; cin>>n;
string s; cin>>s;
rep(i,n-1)if(s[i]!=s[i+1]) ans++;
cout<<ans<<endl;
} | 1 | 47,186,825 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
cout << s << " ";
p ++;
}
else {
if(s != 1) cout << s-1 << " ";
else cout << s+1 << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,s;
cin>>n>>k>>s;
for(int i=0;i<k;i++){
cout<<s<<" ";
}
for(int i=0;i<n-k;i++){
if(s==1000000000)
cout<<s-1<<" ";
else{
cout<<s+1<<endl;
}
}
cout<<endl;
return(0);
} | 1 | 47,606,621 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n, tp = 0, hp = 0;
string tc, hc;
cin>>n;
for(int i=0;i<n;i++){
cin>>tc>>hc;
if(tc > hc) tp += 3;
else if(tc < hc) hp += 3;
else if(tc == hc){
tp++; hp++;
}
}
cout<<tp<<" "<<hp<<endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int t,h,n;
cin >> n;
string tc,hc;
t = h = 0;
for (int i = 0; i < n; i++){
cin >> tc >> hc;
if(tc > hc) t += 3;
else if (hc > tc) h += 3;
else{
t++;
h++;
}
}
cout << t << " " << h << endl;
return 0;
} | 1 | 61,628,911 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main()
{
int N,x,count=0;
cin>>N;
for ( int i = 1; i <= N; i++)
{
x=log10(i);
if ((x%2)==0){
count++;
}
}
cout<<count;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int M = N;
int d = 1;
while (M/ 10 > 0)
{
d++;
M /= 10;
}
int ans = 0;
for (int i = 1; i <= d; i++)
{
if (i % 2 == 1)
{
if (i != d)
{
ans += pow(10, i) - pow(10, i - 1);
} else
{
ans += N - pow(10, i - 1) + 1;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 94,025,141 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string numbers;
int a=0;
while (true) {
a=0;
cin>>numbers;
if(numbers=="0")break;
for (int i=0; i<numbers.length(); i++) {
a+=int(numbers[i])-48;
}
cout<<a<<endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
int main()
{
std::string x;
int digitsSum;
while (1)
{
std::cin >> x;
if (!strcmp(x.c_str(), "0"))
{
break;
}
digitsSum = 0;
for (int i = 0; i < x.size(); i++)
{
digitsSum += x[i] - '0';
}
printf("%d\n", digitsSum);
}
return 0;
} | 1 | 92,500,622 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long long i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<pair<string,P> >vec;
void solve(long long N, long long K, vector<long long> a){
vector<ll> zsum(N+1);
repn(i, N) {
zsum[i] = zsum[i-1] + max(a[i-1], 0LL);
}
ll res = 0, ksum = 0;
rep(i, K) {
ksum += a[i];
}
rep(i, N-K+1) {
ll other = zsum[N]-zsum[i+K]+zsum[i];
res = max(res, max(other, ksum+other));
ksum -= a[i];
if (i != N-K) ksum += a[i+K];
}
cout << res << endl;
}
int main(){
long long N;
long long K;
scanf("%lld",&N);
vector<long long> a(N-1+1);
scanf("%lld",&K);
for(int i = 0 ; i <= N-1 ; i++){
scanf("%lld",&a[i]);
}
solve(N, K, a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
int N, K; cin >> N >> K;
vector<ll> a(N+1, 0);
for(int i=1; i<=N; ++i) cin >> a[i];
ll ans = 0;
vector<ll> cum(N+1, 0), poscum(N+1, 0);
for(int i=1; i<=N; ++i){
cum[i] = cum[i-1] + a[i];
if(a[i] > 0) poscum[i] = poscum[i-1] + a[i];
else poscum[i] = poscum[i-1];
}
for(int left=1; left<=N+1-K; ++left){
ll tmp = max(0LL, cum[left+K-1] - cum[left-1]);
tmp += poscum[left-1] + (poscum[N]-poscum[left+K-1]);
chmax(ans, tmp);
}
cout << ans << endl;
} | 1 | 36,004,281 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
vector<int> as;
vector<ll> ss;
ll solve(const int N, const int M) {
map<int, ll> m;
ll ans = 0;
for (int i = 0; i <= N; i++) {
int x = ss[i] % M;
ans += m[x];
m[x]++;
}
return ans;
}
int main(void) {
int N, M;
cin >> N >> M;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
}
ss.resize(N + 1, 0);
for (int i = 0; i < N; i++) {
ss[i + 1] = ss[i] + as[i];
}
cout << solve(N, M) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout<<fixed<<setprecision(20) ;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
double pi=acos(-1) ;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n,m ; cin>>n>>m ;
vector<ll> A(n) ;
rep(i,n) cin>>A[i] ;
ll now=0 ;
map<ll,ll> mp ;
mp[now]++ ;
rep(i,n){
now= (now+A[i])%m ;
mp[now]++ ;
}
ll ans=0 ;
for(auto u : mp){
ans+= u.se*(u.se-1) ;
}
cout<< ans/2 <<endl ;
return 0 ;
} | 1 | 42,272,356 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
ll st = 20190430;
ll in = y * 10000 + m * 100 + d;
if (st < in) cout << "TBD" << endl;
else cout << "Heisei" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int y, m, d;
scanf("%d/%d/%d", &y, &m, &d);
cout << (m <= 4 ? "Heisei" : "TBD") << '\n';
return 0;
} | 1 | 93,139,618 |
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); i++)
#define ASORT(c) std::sort((c).begin(), (c).end())
#define DSORT(c) std::sort((c).begin(), (c).end(), std::greater<typeof((c).front())>())
#define SIZE(x) ((int)(x).size())
#define check(x) std::cout << #x << " = " << x << '\n'
#define cout(x) std::cout << x << '\n'
using VI = std::vector<int>;
using VII = std::vector<VI>;
using VB = std::vector<bool>;
using VBB = std::vector<VB>;
using VS = std::vector<std::string>;
using PII = std::pair<int, int>;
std::string yes = "Yes\n";
std::string no = "No\n";
void solve();
signed main() {
solve();
return 0;
}
void solve() {
int x;
std::cin >> x;
if (x < 1200) {
cout("ABC\n");
} else {
cout("ARC\n");
}
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << endl;
}
else if(1200 <= x && x <= 3000){
cout << "ARC" << endl;
}
} | 1 | 74,874,076 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
int main() {
while(true) {
int n, max=0, min=1000, sum=0;
cin >> n;
if(n==0) break;
for(int i=0; i<n; i++) {
int input;
cin >> input;
sum += input;
if(input > max) max = input;
if(input < min) min = input;
}
cout << (sum - min - max)/(n-2) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int score = 0, n, max = INT_MIN, min = INT_MAX, ava = 0, cnt = 0;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
cin >> score;
ava += score;
if(score > max) max = score;
if(score < min) min = score;
}
cout << (ava - max - min) / (n - 2) << endl;
}
return 0;
} | 1 | 25,499,020 |
#include <iostream>
using namespace std;
int main()
{
int h,w;
for( ; ; ){
cin >> h >> w;
if(h==0 || w==0) break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int H,W;
for(int c=0;;c++){
cin >> H >> W;
if(H+W==0)break;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout << '#';
}
cout << endl;
}
cout << endl;
}
return 0;
} | 1 | 75,660,375 |
#include <iostream>
using namespace std;
main(){
string s,p;
cin>>s>>p;
cout<<((s+s).find(p)!=string::npos?"Yes\n":"No\n");
} | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, m;
string s, p;
int main(){
cin >> s >> p;
n = s.size();
m = p.size();
s += s;
rep(i, n){
if(p == string(s, i, m)){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 1 | 13,600,122 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
string s;
cin>>s;
set<char> st;
for(char c : s) st.insert(c);
if(sz(st) > 1) cout<<"Yes\n";
else cout<<"No\n";
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
} | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
string S;
cin >> S;
bool yes = false;
for (int i = 0; i < S.size() - 1; i++) {
if (S[i] != S[i + 1]) {
yes = true;
break;
}
}
if (yes)
cout << "Yes" << endl;
else {
cout << "No" << endl;
}
return 0;
} | 1 | 91,253,793 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define len(a) (int)a.size()
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
struct UnionFind {
vector<int> parent;
UnionFind(int n) {
parent.assign(n, -1);
}
int find(int x) {
if (parent[x] < 0) return x;
return (parent[x] = find(parent[x]));
}
bool same(int x, int y) {
return find(x) == find(y);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y) return;
if (size(x) < size(y)) swap(x, y);
parent[x] += parent[y];
parent[y] = x;
}
int size(int x) {
return -parent[find(x)];
}
};
int main() {
int n, m; cin >> n >> m;
UnionFind uf(n);
rep(i, m) {
int a, b; cin >> a >> b;
a--; b--;
uf.unite(a, b);
}
int ans = 0;
rep(i, n) {
ans = max(ans, uf.size(i));
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
using namespace std;
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
#define ull unsigned long long
const int maxn = 2e5+10;
const ll mod=1e9+7;
#define MAXN 40100
ll gcd(ll T, ll b) { return b == 0 ? T : gcd(b, T % b); }
ll lcm(ll T, ll b) { return T / gcd(T, b) * b; }
ll mul(ll a,ll b, ll c) {
ll ans = 0;
while(b) {
if(b&1) {
ans= (ans+a)%c;
b--;
}
b>>=1;
a=(a+a)%c;
}
return ans;
}
ll powmod(ll a,ll b,ll c) {
ll ans = 1;
while(b) {
if(b&1) {
ans = mul(ans,a,c);
b--;
}
b>>=1;
a=mul(a,a,c);
}
return ans ;
}
ll exgcd(ll a,ll b,ll &x,ll &y) {
if(b==0)
{
x=1;y=0;
return a;
}
ll r=exgcd(b,a%b,x,y);
ll temp=y;
y=x-(a/b)*y;
x=temp;
return r;
}
const ll INF = 0x3f3f3f3f3f3f3f3f;
int pre[maxn];
int siz[maxn];
int ans;
void init() {
for(int i=0;i<maxn;i++) {
pre[i]=i;
siz[i]=1;
}
}
int find(int x) {
while(x!=pre[x]) {
pre[x]=pre[pre[x]];
x=pre[x];
}
return x;
}
void join(int x,int y) {
int fx=find(x),fy=find(y);
if(fx!=fy) {
pre[fx]=fy;
siz[fy]+=siz[fx];
if(siz[fy]>ans) {
ans=siz[fy];
}
}
}
int main(){
int n,m;
cin>>n>>m;
init();
ans=1;
while(m--) {
int x,y;
cin>>x>>y;
join(x,y);
}
cout<<ans<<endl;
return 0;
} | 1 | 46,538,994 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
vector<int> C(M), D(M);
for (int i=0; i<N; i++){
cin >> A.at(i) >> B.at(i);
}
for (int i=0; i<M; i++){
cin >> C.at(i) >> D.at(i);
}
for (int i=0; i<N; i++){
int diff=400000000;
int point;
for (int j=0; j<M; j++){
int diff_j = abs(A.at(i)-C.at(j))+abs(B.at(i)-D.at(j));
if (diff_j < diff){
diff = diff_j;
point = j+1;
}
}
cout << point << endl;
}
} | #include <bits/stdc++.h>
#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;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll INF = 1001001001;
int main()
{
int n, m;
cin >> n >> m;
vector<P> ab(n);
vector<P> cd(m);
rep(i, n) cin >> ab[i].first >> ab[i].second;
rep(i, m) cin >> cd[i].first >> cd[i].second;
rep(i, n) {
ll mi = INF;
ll ans = 0;
rep(j, m) {
if(abs(ab[i].first - cd[j].first) + abs(ab[i].second - cd[j].second) < mi) {
mi = abs(ab[i].first - cd[j].first) + abs(ab[i].second - cd[j].second);
ans = j + 1;
}
}
cout << ans << endl;
}
return 0;
} | 1 | 10,523,686 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mpow(int N, int P, int M)
{
if (P == 0)
return 1;
if (P % 2 == 0)
{
int t = mpow(N, P / 2, M);
return t * t % M;
}
return N * mpow(N, P - 1, M) % M;
}
int counter(int x)
{
if (x == 0)
return 0;
return counter(x >> 1) + (x & 1);
}
vector<bool> prime(maxn + 1, true);
void prime_table(void)
{
prime[0] = false;
prime[1] = false;
for (int i = 2; i * i <= maxn; i++)
{
if (!prime[i])
{
continue;
}
for (int j = i + i; j <= maxn; j += j + i)
{
prime[j] = false;
}
}
}
bool IsPrime(int num)
{
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
signed main()
{
int N;
cin >> N;
vector<int> AB;
int B = 0;
int ans = 0;
rep(i, N)
{
int a, b;
cin >> a >> b;
B += b;
AB.push_back(a + b);
}
ans -= B;
sort(AB.begin(), AB.end(), greater<int>());
for (int i = 0; i < N; i++)
{
if (i % 2 == 0)
ans += AB[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N;
vector<int> A, B;
vector<pair<int, int>> AB;
bool cmp(pair<int, int> l, pair<int, int> r){
return l.first + l.second < r.first + r.second;
}
int main(){
cin >> N;
A.resize(N), B.resize(N);
AB.resize(N);
REP(i, N){
cin >> A[i] >> B[i];
AB[i] = {A[i], B[i]};
}
ll taka = 0, ao = 0;
sort(AB.rbegin(), AB.rend(), cmp);
REP(i, N){
if(i%2){
ao += AB[i].second;
}
else{
taka += AB[i].first;
}
}
cout << taka - ao << endl;
return 0;
} | 1 | 81,910,461 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll inf=1LL<<32;
ll dis[110][110],i,j,k,n,m,a,b,w,flag;
void Floyd()
{
for(k=0; k<n; k++)
for(i=0; i<n; i++)
for(j=0; j<n; j++)
if(dis[i][k]<inf&&dis[k][j]<inf)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
}
int main()
{
while(scanf("%lld%lld",&n,&m)!=EOF)
{
flag=0;
for(i=0; i<n; i++)
for(j=0; j<n; j++)
if(i==j) dis[i][j]=0;
else dis[i][j]=inf;
for(i=0; i<m; i++)
{
scanf("%lld%lld%lld",&a,&b,&w);
if(dis[a][b]>w)
{
dis[a][b]=w;
}
}
Floyd();
for(i=0; i<n; i++)
if(dis[i][i]<0)
{
flag=1;
break;
}
if(flag)
{
printf("NEGATIVE CYCLE\n");
continue;
}
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
if(j) printf(" ");
if(dis[i][j]==inf) printf("INF");
else printf("%lld",dis[i][j]);
}
printf("\n");
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 1e12+1
typedef long long int ll;
typedef pair<ll,ll> mypair;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
ll v,e;
cin>>v>>e;
vector<vector<mypair> > g(v);
vector<vector<ll> > dp(v,vector<ll>(v,inf) );
ll s,t,d;
rep(i,e){
cin>>s>>t>>d,g[s].push_back(mypair(t,d) );
dp[s][t] = d;
}
rep(i,v)dp[i][i]=0;
rep(k,v)rep(i,v)rep(j,v)if(dp[i][k]!=inf&dp[k][j]!=inf)dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);
bool flag =false;
rep(i,v)if(dp[i][i]!=0)flag = true;
if(flag){
cout<<"NEGATIVE CYCLE"<<endl;
}else{
rep(i,v){
rep(j,v){
if(dp[i][j]==inf)cout<<"INF";
else cout<<dp[i][j];
if(j==v-1){}
else cout<<' ';
}
cout<<endl;
}
}
return 0;
} | 1 | 84,103,178 |
#include <iostream>
#include <cstring>
using namespace std;
struct edge{
int node;
edge *next;
}nodes[105];
int n,matrix[105][105];
int main()
{
memset(matrix,0,sizeof(matrix));
cin>>n;
int i,j;
for(i=1;i<=n;i++){
int ii,n_i;
cin>>ii>>n_i;
for(j=0;j<n_i;j++){
int jj;
cin>>jj;
matrix[ii][jj]=1;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(j!=1)cout<<" ";
cout<<matrix[i][j];
}
cout<<endl;
}
return 0;
} | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int graph[n+1][n+1];
for(int i = 0;i <= n;i++){
for(int j = 0;j <= n;j++){
graph[i][j] = 0;
}
}
for(int k = 0;k < n;k++){
int i;
cin >> i;
int t;
cin >> t;
for(int l = 0;l < t;l++){
int p;
cin >> p;
graph[i][p] = 1;
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(j != n){
cout << graph[i][j] << " ";
}else{
cout << graph[i][j];
}
}
cout << endl;
}
return 0;
} | 1 | 16,186,735 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e6;
string s[maxn];
int main(){
int n,A=0,B=0,AB=0,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
int len=s[i].size()-1;
for(int j=1;j<=len;j++){
if(s[i][j]=='B'&&s[i][j-1]=='A') sum++;
}
if(s[i][0]=='B'&&s[i][len]=='A'){
AB++;continue;
}
if(s[i][0]=='B'){
B++;continue;
}
if(s[i][len]=='A'){
A++;continue;
}
}
int ans=0;
if(AB>0){
if(A>0||B>0){
A--; B--;
ans+=2;AB--;
}
else AB--;
}
ans+=min(A,B)+AB+sum;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
ll b_a = 0;
ll b_x = 0;
ll x_a = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.length()-1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B')ans++;
}
if (s.at(0) == 'B' && s.at(s.length() - 1) == 'A')b_a++;
else if (s.at(0) == 'B')b_x++;
else if (s.at(s.length() - 1) == 'A')x_a++;
}
ll x = 1;
if (x_a == 0) {
if (b_a == 0)ans += 0;
else {
if (b_x == 0)ans += b_a - 1;
else ans += b_a;
}
}
else ans += b_a + min(x_a, b_x);
cout << ans << endl;
} | 1 | 16,747,592 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll H, W;
cin >> H >> W;
if (H == 1 || W == 1) {
cout << 1 << endl;
return 0;
}
if (H % 2 == 0 || W % 2 == 0) {
cout << H * W / 2 << endl;
return 0;
}
cout << H * W / 2 + 1 << endl;
} | #include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
int main(void){
long long h,w;
std::cin >> h >> w;
if(h==1||w==1) std::cout << "1";
else std::cout << (h*w+1)/2;
return 0;
} | 1 | 42,889,004 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>
#define ll long long
#define N 100010
using namespace std;
set<pair<int,int> > s;
set<pair<int,int> >::iterator it;
int a[N];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",a+i);
s.insert(make_pair(a[i],i));
}
int i=0;
for(it=s.begin();it!=s.end();++it)
{
i++;
printf("%d%c",it->second,i==n?'\n':' ');
}
return 0;
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<deque>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<cstring>
#include<climits>
#include<cmath>
#include<iterator>
#include<set>
#define fileOut freopen("out.txt","w",stdout)
#define fileIn freopen("in.txt","r",stdout)
#define testcases ll TC,T; cin >> TC; for(T=1; T<=TC; T++)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define INFLL 9223372036854775807
#define INF 2147483647
#define pi acos(-1.0)
#define ll long long
#define endll printf("\n")
#define CASE printf("Case %lld: ",T)
#define ff first
#define ss second
#define mem(ara,n) memset(ara,n,sizeof ara)
#define ull unsigned long long
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mid3(a,b,c) min(max(a,b),max(b,c),max(a,b))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define endl '\n'
#define ld long double
using namespace std;
int main(){
ll n, x;
cin >> n;
ll ara[n+5];
for (int i = 1; i<= n; ++i)
{
cin >> x;
ara[x] = i;
}
for (int i = 1; i <= n; ++i)
{
cout << ara[i] <<" ";
}
endll;
return 0;
} | 1 | 16,462,248 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%lld", &x)
#define Scll2(x,y) scanf("%lld%lld", &x, &y)
#define Scll3(x,y,z) scanf("%lld%lld%lld", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
#define EPS (1e-7)
#define INF (2e9)
#define PI (acos(-1))
#define Repe(x,y,z) for(ll x = z; x < y; x++)
#define Rep(x,y) Repe(x,y,0)
#define RRepe(x,y,z) for(ll x = y-z-1; x >= 0; x--)
#define RRep(x,y) RRepe(x,y,0)
#define YesNo(a) (a)?printf("Yes\n"):printf("No\n")
#define YESNO(a) (a)?printf("YES\n"):printf("NO\n")
int main() {
int N,K;
Scd2(N,K);
vi a(N),b(N);
Rep(i,N){
Scd2(a[i],b[i]);
}
ll ans = 0;
ll tmp = 0;
int bm = 1;
while( K >= 0 ){
tmp = 0;
Rep(i,N){
if( (K & a[i]) == a[i] ){
tmp += b[i];
}
}
ans = max( ans, tmp );
while( K & bm ){
bm <<= 1;
}
K -= bm;
}
printf ("%lld\n", ans );
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
const ll MOD = 1e9+7;
const int inf = 1e8;
const ll INF = 1e16;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main(){
int N, K;
cin >> N >> K;
int A[N];
ll B[N];
rep(i, N) cin >> A[i] >> B[i];
ll ans = 0;
rep(i, N){
if((K|A[i]) == K) ans += B[i];
}
rep(i, 30){
if(K&(1<<i)){
ll tmp = 0;
rep(j, N){
if(((K>>i)|(A[j]>>i)) == K>>i && !(A[j]&(1<<i))){
tmp += B[j];
}
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
} | 1 | 71,756,201 |
#include <iostream>
using namespace std;
using ll = long long;
int main(void) {
ll A,B,K; cin >> A >> B >> K;
ll ans_A = 0, ans_B=0;
if(A+B < K) {
ans_A = 0;
ans_B = 0;
}
else if(A < K) {
ans_A = 0;
ans_B = B - (K - A);
}
else {
ans_A = A - K;
ans_B = B;
}
cout << ans_A << " " << ans_B << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ll long long
#define ld long double
#define pb push_back
#define MOD 1000000007
#define LLMN LONG_LONG_MIN
#define LLMX LONG_LONG_MAX
#define LDMX LDBL_MAX
#define LDMN LDBL_MIN
#define MAX 1000000
#define pll pair<ll, ll>
#define vl vector<ll>
#define vll vector< vector<ll> >
ll mulmod(ll, ll);
ll fastpower(ll, ll);
void getprime(vector<ll>&);
void getfact(vector<ll>&, vector<ll>&);
ll ncr(ll, ll, vector<ll>&, vector<ll>&);
void solve()
{
ll n, m, k;
cin>>n>>m>>k;
if(n >= k)
{
n -= k;
}
else
{
k -= n;
n = 0;
m -= min(m, k);
}
cout<<n<<" "<<m;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll t = 1;
while(t--)
{
solve();
}
return 0;
}
ll mulmod(ll a, ll b)
{
ll res = 0;
a = a % MOD;
while(b > 0)
{
if (b % 2 == 1)
res = (res + a) % MOD;
a = (a * 2) % MOD;
b /= 2;
}
return res % MOD;
}
ll fastpower(ll a, ll n)
{
ll res = 1;
while(n > 0)
{
if(n % 2 != 0)
{
res = (res * a) % MOD;
}
n /= 2;
a = (a * a) % MOD;
}
return res;
}
void getprime(vector<bool>&prime)
{
prime[0] = false;
prime[1] = false;
for(ll i = 2;i <= MAX; i++)
{
if(prime[i])
{
for(ll j = i*i; j <= MAX; j += i)
prime[j] = false;
}
}
}
void getfact(vector<ll> &fact, vector<ll> &ifact)
{
fact[0] = 1;
ifact[0] = 1;
for(ll i = 1; i <= MAX; i++)
{
fact[i] = (fact[i-1] * i)%MOD;
ifact[i] = (ifact[i-1] * fastpower(i, MOD -2) )%MOD;
}
}
ll ncr(ll n, ll r, vector<ll>&fact, vector<ll>&ifact)
{
ll res;
res = (((fact[n] * ifact[r]) % MOD) * ifact[n-r]) % MOD;
return res;
} | 1 | 67,000,461 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int maxn=2*300;
int n;
int a[maxn];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
printf("node %d: key = %d, ",i,a[i]);
if(i!=1) printf("parent key = %d, ",a[i/2]);
if(2*i<=n) printf("left key = %d, ",a[2*i]);
if(2*i+1<=n) printf("right key = %d, ",a[2*i+1]);
printf("\n");
}
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int main(){
int n;
scanf("%d", &n);
int a[n];
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
}
for(int i = 1; i <= n; i++){
printf("node %d: key = %d, ", i, a[i]);
if(i/2 >= 1){
printf("parent key = %d, ", a[i/2]);
}
if(i*2 <= n){
printf("left key = %d, ", a[2*i]);
if(i*2+1 <= n){
printf("right key = %d, ", a[2*i+1]);
}
}
printf("\n");
}
return 0;
} | 1 | 44,162,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int Room[4][3][10] = {0};
for(int i = 0; i < n; i++) {
int a, b, c, num;
cin >> a >> b >> c >> num;
Room[a - 1][b - 1][c - 1] += num;
}
for(int a = 0; a < 4; a++) {
for(int b = 0; b < 3; b++) {
for(int c = 0; c < 10; c++) {
cout << " " << Room[a][b][c];
if(c == 9) cout << "\n";
}
}
if(a != 3) cout << "####################\n";
}
return 0;
} | #include<iostream>
#include<iomanip>
using namespace std;
int main(){
int n,b,f,r,v,house[4][3][10];
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
house[i][j][k]=0;
}
}
}
cin >> n;
for(int i=0;i<n;i++){
cin >> b >> f >> r >> v;
house[b-1][f-1][r-1]=house[b-1][f-1][r-1]+v;
}
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
cout << " " << house[i][j][k];
}
cout << endl;
}
if(i<3){
cout << "####################" << endl;
}
}
} | 1 | 37,661,457 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
ll n,m;cin>>n>>m;
if(n==1&&m==1){cout<<1;}
else if(n==1){cout<<m-2;}
else if(m==1){cout<<n-2;}
else{cout<<(n-2)*(m-2);}
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
long long N1=min(N,M);
long long M1=max(N,M);
if(N1==1&&M1==1) cout<<1<<endl;
else if(N1==1&&M1!=1) cout<<M1-2<<endl;
else cout<<(N1-2)*(M1-2)<<endl;
return 0;
} | 1 | 2,788,325 |
#include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_back
#define pf push_front
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define tc int tt; scf(tt); while(tt--)
#define inf INT_MAX
#define ninf INT_MIN
#define gcd __gcd
#define bitcount(n) __builtin_popcount(n)
typedef double dd;
using namespace std;
const ll mod =1e9+7;
const int N = 1e6+7;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
bool m[N]={0};
int main()
{
int n;
scf(n);
int a[n];
ll sum=0;
rep(i,0,n)
scf(a[i]),sum+=a[i];
sort(a,a+n);
int x=0;
x=(n&1)?a[n/2]:(a[n/2]+a[(n-2)/2])/2;
int y=(sum+n-1)/n;
int z=sum/n;
sum=0;
ll res=0,ctr=0;
rep(i,0,n)
sum+=((a[i]-x)*(a[i]-x)),res+=((a[i]-y)*(a[i]-y)),ctr+=(pow((a[i]-z),2));
res=min(res,ctr);
lprin(min(sum,res));
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
int input_num, num_list[100], cost, min_cost = -1, min_num, max_num;
cin >> input_num;
for (int i = 0; i < input_num; i++)
{
cin >> num_list[i];
}
min_num = max_num = num_list[0];
for (int i = 0; i < input_num; i++)
{
if (min_num > num_list[i]) min_num = num_list[i];
if (max_num < num_list[i]) max_num = num_list[i];
}
for (int j = min_num; j <= max_num; j++)
{
cost = 0;
for (int k = 0; k < input_num; k++)
{
cost += (num_list[k] - j) * (num_list[k] - j);
}
if (cost < min_cost || min_cost == -1) min_cost = cost;
}
cout << min_cost;
return 0;
} | 1 | 31,813,739 |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
map<int,int>m;
lli n;
cin>>n;
lli a[n],i,flag=0;
for(i=0;i<n;i++)
{
cin>>a[i];
m[a[i]]++;
if(m[a[i]]>1)
flag=1;
}
if(flag==1)
cout<<"NO"<<"\n";
else
cout<<"YES"<<"\n";
} | #include <bits/stdc++.h>
int main() {
int n; std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i) std::cin >> a[i];
std::sort(a.begin(), a.end());
bool ok = true;
for (int i = 0; i < a.size()-1; ++i) {
if (a[i] == a[i+1]) ok = false;
}
if (ok) std::cout << "YES" << std::endl;
else std::cout << "NO" << std::endl;
return 0;
} | 1 | 2,850,412 |
#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);
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
ll sumq = n * 4 * q;
ll sumh = n * 2 * h;
ll sums = n * s;
ll sumd = n / 2 * d;
if (n & 1)
sumd += min({4 * q, 2 * h, s});
cout << min({sumq, sumh, sums, sumd}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T>
void printlnVector(T v)
{
rep(i, v.size())
{
cout << v[i] << endl;
}
}
template <typename T>
void printVector(T v)
{
rep(i, v.size())
{
cout << v[i] << " ";
}
cout << endl;
}
int main()
{
long long Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
H = min(H, 2 * Q);
S = min(S, 2 * H);
D = min(D, 2 * S);
long long ans = (N / 2) * D;
if (N % 2 == 1)
ans += S;
cout << ans << endl;
return 0;
} | 1 | 43,824,518 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,ll>>>;
using pp=pair<ll,pair<ll,ll>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000000000000
vector<int> parent;
int find(int x){
int y=parent[x];
while(y!=parent[y]){
y=find(y);
}
return parent[x]=y;
}
void unite(int a,int b){
int x=find(a);
int y=find(b);
if(x!=y){
parent[x]=y;
}
}
int main(){
int N,Q;
cin>>N>>Q;
parent.resize(N);
for(int i=0;i<N;i++){
parent[i]=i;
}
for(int i=0;i<Q;i++){
int t,u,v;
cin>>t>>u>>v;
if(t==0){
unite(u,v);
}else{
if(find(u)==find(v)){
cout<<1<<endl;
}else{
cout<<0<<endl;
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e7 + 7;
ll par[mx];
ll p_u, p_v;
ll find_parent(ll x) {
if(x == par[x]) return x;
return par[x] = find_parent(par[x]);
}
void join(ll u, ll v) {
p_u = find_parent(u);
p_v = find_parent(v);
if(p_u == p_v) return;
par[p_u] = p_v;
}
int main() {
ll n, q; cin >> n >> q;
for(ll i = 0; i < n; i++) par[i] = i;
while(q--) {
ll t; cin >> t;
if(t == 1) {
ll u, v; cin >> u >> v;
p_u = find_parent(u);
p_v = find_parent(v);
if(p_u == p_v) cout << 1 << endl;
else cout << 0 << endl;
}
else if( t == 0) {
ll u, v; cin >> u >> v;
join(u, v);
}
}
return 0;
} | 1 | 2,159,335 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vvi G(n);
rep(i, n) {
int id, k;
cin >> id >> k;
id--;
G[id].resize(k);
rep(j, k) {
cin >> G[id][j];
G[id][j]--;
}
}
vi dist(n, -1);
dist[0] = 0;
queue<int> q;
q.push(0);
while(!q.empty()) {
int now = q.front();
q.pop();
for(int ne:G[now]) {
if(dist[ne] != -1) continue;
dist[ne] = dist[now] + 1;
q.push(ne);
}
}
rep(i, n) {
cout << i + 1 << ' ' << dist[i] << endl;
}
} | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
void bfs(int src, int n, vector<vector<int> > G);
int main() {
int n;
cin >> n;
vector<vector<int> > G(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v_j;
cin >> v_j;
G[u - 1][v_j - 1] = 1;
}
}
bfs(0, n, G);
}
void bfs(int src, int n, vector<vector<int> > G) {
vector<int> D(n, -1);
D[src] = 0;
queue<int> Q;
Q.push(src);
while (!Q.empty()) {
int cur = Q.front();
Q.pop();
for (int dst = 0; dst < n; dst++)
if (G[cur][dst] == 1 && D[dst] == -1){
D[dst] = D[cur] + 1;
Q.push(dst);
}
}
for (int i = 0; i < n; i++)
cout << i + 1 << " " << D[i] << endl;
} | 1 | 23,258,281 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int n;
int l,r;
int ans;
int main(void){
cin>>n;
while(n--){
cin>>l>>r;
ans+=(r-l+1);
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int n,ans;
int main(){
cin>>n;
vector<pair<int,int>>v;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
if(!i){
v.push_back({a,b});
}
else{
bool ok=1;
for(int j=0;j<sz(v);j++){
if(v[j].first>b || v[j].second<a)continue;
else{
v[j].first=min(v[j].first,a);
v[j].second=max(v[j].second,b);
}
}
if(ok)v.push_back({a,b});
}
}
for(auto i:v){
ans+=i.second-i.first+1;
}
cout<<ans;
} | 1 | 6,411,091 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<int, int>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
llong H, W, N;
vector<P> black, masu;
cin >> H >> W >> N;
int h,w;
for(int i = 0; i < N; i++){
cin >> h >> w;
black.push_back(P(h,w));
for(int sh = h-2; sh <= h; sh++){
for(int sw = w-2; sw <= w; sw++)
if(1 <= sh && sh <= H-2 && 1 <= sw && sw <= W-2)
masu.push_back(P(sh,sw));
}
}
sort(BE(black));
sort(BE(masu));
masu.erase(unique(BE(masu)), masu.end());
vector<llong> ans(10,0);
ans[0] = (H-2)*(W-2) - masu.size();
for(auto it = masu.begin(); it != masu.end(); it++){
int res = 0;
for(int h = it->first; h <= it->first+2; h++)
for(int w = it->second; w <= it->second+2; w++)
if(*lower_bound(BE(black), P(h,w)) == P(h,w))
res++;
ans[res]++;
}
for(auto x : ans)
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int h, w;
LL ans[10];
inline bool ok(int x, int y)
{
return x >= 1 && y >= 1 && x <= h - 2 && y <= w - 2;
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> h >> w;
int n;
cin >> n;
vector<PII> cand;
set<PII> S;
while(n--)
{
int x, y;
cin >> x >> y;
S.insert({x, y});
FOR(i, 0, 3) FOR(j, 0, 3)
if (ok(x - i, y - j))
cand.PB({x - i, y - j});
}
sort(ALL(cand));
cand.resize(unique(ALL(cand)) - cand.begin());
for(auto lol: cand)
{
int x = lol.X, y = lol.Y;
int tut = 0;
FOR(i, 0, 3) FOR(j, 0, 3)
tut += S.count({x + i, y + j});
ans[tut]++;
}
FOR(i, 1, 10) ans[0] += ans[i];
ans[0] = (h - 2) * (LL) (w - 2) - ans[0];
FOR(i, 0, 10) cout << ans[i] << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
} | 1 | 34,567,169 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a<=c)
{
if(b<=c)
{
cout<<"0";
}
else
{
if(b>=d)
{
cout<<(d-c);
}
else
{
cout<<(b-c);
}
}
}
else if(a>=d)
{
cout<<"0";
}
else
{
if(b<=d)
{
cout<<(b-a);
}
else
{
cout<<(d-a);
}
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
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 INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
cin>>a>>b>>c>>d;
cout<<max(min(b, d) - max(a, c), 0)<<endl;
} | 1 | 5,098,376 |
#include <iostream>
#include <cmath>
#include <string>
#include <cstdlib>
#include <iomanip>
#include <stdio.h>
using namespace std;
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a<b)
cout << "a < b" << endl;
else if(a>b)
cout << "a > b" << endl;
else
cout << "a == b" << endl;
return 0;
} | #include<stdio.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a>b){
printf("a > b\n");
}
else if(a<b){
printf("a < b\n");
}
else if(a==b){
printf("a == b\n");
}
return 0;
} | 1 | 82,428,536 |
#include <iostream>
#include <algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int high[10];
REP(i,10){
cin >> high[i];
}
sort(high,high+10);
cout << high[9] << endl;
cout << high[8] << endl;
cout << high[7] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
vector<int> h(10); cin >> h;
sort(ALL(h), greater<int>());
REP(i, 3) cout << h[i] << endl;
} | 1 | 79,046,232 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
string S;
cin >> S;
int not0101 = 0;
int not1010 = 0;
rep(i, S.size()) {
if (i % 2 == 0) {
if (S[i] != '0') not0101++;
else not1010++;
} else {
if (S[i] != '1') not0101++;
else not1010++;
}
}
int ans = not0101 < not1010 ? not0101 : not1010;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int64_t size = S.size();
int64_t siro_count = 0;
int64_t kuro_count = 0;
for (int64_t i=0; i<size; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
siro_count += 1;
} else {
kuro_count += 1;
}
} else {
if (S[i] == '0') {
kuro_count += 1;
} else {
siro_count += 1;
}
}
}
cout << min(siro_count, kuro_count) << endl;
return 0;
} | 1 | 71,810,773 |
#include <iostream>
using namespace std;
int main(){
int H = 1;
int W = 1;
cin >> H >> W;
while(H != 0 & W != 0){
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
if(h == 0 | h == H-1) {cout << "#";}
else{
if(w == 0 | w == W-1) {cout << "#";}
else {cout << ".";}
}
}
cout << "" << endl;
}
cout << "" << endl;
cin >> H >> W;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int h,w;
while(1)
{
cin>>h>>w;
if((h==0)&&(w==0)) break;
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
cout<<(((i==0)||(i==h-1)||(j==0)||(j==w-1))?'#':'.');
cout<<endl;
}
cout<<endl;
}
} | 1 | 99,994,185 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<N-1<<endl;
return 0;
}
if(temp=="Male"){
A[N-1]="Male";
}
if(temp=="Female"){
A[N-1]="Female";
}
int l=N-1;
int r=0;
int k=22;
while(k){
k--;
int m=(l+r)/2;
cout<<m<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<m<<endl;
return 0;
}
if(temp=="Male"){
A[m]="Male";
}
if(temp=="Female"){
A[m]="Female";
}
if((l-m)%2 == 0 && A[l] == A[m]){
l=m;
continue;
}
if((l-m)%2 == 0 && A[l] != A[m]){
r=m;
continue;
}
if((l-m)%2 == 1 && A[l] == A[m]){
r=m;
continue;
}
if((l-m)%2 == 1 && A[l] != A[m]){
l=m;
continue;
}
}
cout<<3<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main() {
int n;
cin >> n;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
vector<string> v(n);
v[0] = s;
int l = 0;
int r = n;
int p = (l+r)/2;
cout << p << endl;
while (cin >> s, s != "Vacant") {
v[p] = s;
int x = p - l - 1;
int y = r - p - 1;
if ((v[l] == s && x % 2 == 0) || (v[l] != s && x % 2 == 1)) {
r = p;
p = (l+r)/2;
} else {
l = p;
p = (l+r)/2;
}
cout << p << endl;
}
} | 1 | 92,428,438 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
class AAtCoderCrackers {
public:
void solve(std::istream& cin, std::ostream& cout) {
int a, b;
int ans = 1;
cin >> a >> b;
if (a%b == 0){
ans = 0;
}
cout << ans << endl;
}
};
int main() {
AAtCoderCrackers solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int k , n;
cin >> k >> n;
if(k % n == 0)cout << 0 << endl;
else cout << 1 << endl;
} | 1 | 58,915,527 |
Subsets and Splits