code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define vvld vector<vector<ld>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
ll begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
string tostring(ll x){
stringstream sss;
sss<<x;
string ans=sss.str();
return ans;
}
const ll N=1e3+5;
int main()
{
ll k,s;
cin>>k>>s;
ll c=0;
FOR(i,k+1) {
FOR(j,k+1){
ll rem=s-i-j;
if(rem>=0&&rem<=k)c++;
}
}
cout<<c;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vector<ll>(m, 0))
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define arr(var, n) vec var(n); rep(i,n){cin >> var[i];}
#define arrll(var, n) vecll var(n); rep(i,n){cin >> var[i];}
#define arrst(var, n) vecst var(n); rep(i,n){cin >> var[i];}
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define uniqueall(v) v.erase(unique(v.begin(), v.end()), v.end());
#define f_sum(var) accumulate(all(var), 0)
#define f_sumll(var) accumulate(all(var), 0LL)
#define chmin(v1, v2) v1 = min(v1, v2)
#define chmax(v1, v2) v1 = max(v1, v2)
#define mp(v1, v2) make_pair(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << (var) << "\n"
#define prtd(n, var) cout << fixed << setprecision(n) << var << "\n"
#define prtfill(n, var) cout << setw(n) << setfill('0') << var;
#define prt2(v1, v2) cout << v1 << " " << v2 << "\n"
#define prt3(v1, v2, v3) cout << v1 << " " << v2 << " " << v3 << "\n"
#define prtall(v) rep(i,v.size()){cout<<v[i]<<(i!=v.size()-1?" ":"\n");}
void prtok(bool ok){prt(ok ? "Yes" : "No");}
int main(void) {
int n;
cin >> n;
arrll(a,n);
sortall(a);
reverse(all(a));
ll tmp=-1;
ll ans[2]={};
int id=0;
rep(i,n){
if(tmp==a[i] && id<2) {
ans[id]=a[i];
tmp=-1;
id++;
} else {
tmp = a[i];
}
}
prt(ans[0]*ans[1]);
} | 0 | 54,570,320 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
#define cout15(a) printf("%.15f\n",a)
template<class T>inline bool chmin(T& a,T b,bool f){
if(f==1){if(a>b){a=b;return true;}return false;}
else if(f==0){if(a<b){a=b;return true;}return false;}return false;}
typedef pair<ll,string> p;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
int main (){
ll k,a,b;cin>>k>>a>>b;
if(a+1>=b){
cout<<1+k<<nnn;
return 0;
}
if(a<k){
k-=a-1;
ll ans = a;
ans+=(b-a)*(k/2);
if(k%2==1)ans++;
cout<<ans<<nnn;
}else cout<<1+k<<nnn;
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
signed main() {
int n, a, b, c, x;
while(cin >> n >> a >> b >> c >> x, n || a || b || c || x) {
vector<int> v(n);
rep(i,0,n) cin >> v[i];
bool ok = false;
int cnt = 0;
rep(i,0,10001) {
if(x == v[cnt]) cnt++;
if(cnt == n) {
cout << i << endl;
ok = true;
break;
}
x = (x * a + b) % c;
}
if(!ok) cout << -1 << endl;
}
return 0;
} | 0 | 32,404,413 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <iomanip>
#include <cmath>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
using namespace std;
char nums[10] = { '0','1','2','3','4','5','6','7','8','9' };
char alphsl[26] = { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };
const ll MOD = 1000000007;
char alphs[26] = { 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z' };
void solve() {
int n, k;
cin >> n>>k;
vi v(n);
for (auto& x : v) cin >> x;
vll dp(n);
if (k >= n-1) {
cout << abs(v[0] - v[n - 1]) << endl;
return;
}
for (int i = n - 1; i >= n - k; i--) {
dp[i] = abs(v[i] - v[n - 1]);
}
for (int i = n - k-1; i >= 0; i--) {
ll miny = abs(v[i] - v[i + 1]) + dp[i + 1];
for (int j = 1; j <= k; j++) {
miny = min(miny, abs(v[i] - v[i + j]) + dp[i + j]);
}
dp[i] = miny;
}
cout << dp[0] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
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<ll> G[200050];
vector<ll> stock(200050,0);
vector<bool> visited(200050);
void dfs(ll x){
visited[x]=true;
rep(i,sz(G[x])){
if(!visited[G[x][i]]){
stock[G[x][i]]+=stock[x];
dfs(G[x][i]);
}
}
}
int main(){
ll N,Q; cin>>N>>Q;
rep(i,N-1){
ll A,B; cin>>A>>B;
G[A].pb(B);
G[B].pb(A);
}
rep(i,Q){
ll p,x; cin>>p>>x;
stock[p]+=x;
}
dfs(1);
rep1(i,N){
cout<<stock[i]<<" ";
}
} | 0 | 51,771,658 |
#include <bits/stdc++.h>
using namespace std;
void bfs(vector<vector<int>> &G, vector<int> &dist, vector<int> &prev, int start) {
dist[start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int next_v : G[v]) {
if (dist[next_v] != -1) continue;
dist[next_v] = dist[v] + 1;
prev[next_v] = v;
q.push(next_v);
}
}
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
A--; B--;
G[A].push_back(B);
G[B].push_back(A);
}
vector<int> dist(N, -1), prev(N, -1);
bfs(G, dist, prev, 0);
cout << "Yes" << endl;
for (int i = 1; i < N; i++) cout << prev[i] + 1 << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i, a, b) for (int i = a; i < (b); i++)
#define FOR(i, n) for (int i = n; i >= 0; i--)
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > pack;
ll w, h;
int main(){
cin >> w >> h;
ll wholescore = 0;
REP(i, w){
ll tmp;
cin >> tmp;
wholescore = wholescore + tmp * (h + 1);
pack.push_back(pair<ll, ll>(tmp, 1));
}
REP(i, h){
ll tmp;
cin >> tmp;
wholescore = wholescore + tmp * (w + 1);
pack.push_back(pair<ll, ll>(tmp, 2));
}
sort(pack.begin(), pack.end());
ll pmax = w, qmax = h, maxsum = w * h, sum = 0, delsum = 0;
FOR(i, pack.size() - 1){
int type = pack[i].second;
if(type == 2){
qmax--;
delsum = delsum + pmax * pack[i].first;
sum = sum + pmax;
}
else{
pmax--;
delsum = delsum + qmax * pack[i].first;
sum = sum + qmax;
}
if(sum >= maxsum){
break;
}
}
cout << wholescore - delsum << "\n";
return 0;
} | 0 | 52,348,032 |
#include<stdio.h>
#pragma GCC optimize("O2")
static inline int comp(const int a,const int b,int desc){return a<b?(!desc?a:b):(!desc?b:a);}
int main(void)
{
int N,i=scanf("%d",&N)-1,u,v;long x=1l*N*(N+1)*(N+2)/6;
while(i<N-1){i+=scanf("%d %d",&u,&v)>>1;x=x-1l*comp(u,v,0)*(N-comp(u,v,1)+1);}
return printf("%ld",x),0;
} | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
ans = i;
}
return ans;
}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
if(b==1)
return a%m;
ll temp=power(a,b/2,m);
if(b%2==0)
return ((temp%m)*(temp%m))%m;
else
return ((((temp%m)*(temp%m))%m)*a%m)%m;
}
ll c(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1]%MOD +
C[i - 1][j])%MOD;
}
}
return C[n][k]%MOD;
}
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t=1;
while(t--)
{
ll h,n;
cin>>h>>n;
ll a[n],b[n];
for(ll i=0;i<n;i++)
cin>>a[i]>>b[i];
vector<ll>dp(h+1,INT_MAX);
for(ll i=1;i<=h;i++)
{
for(ll j=0;j<n;j++)
{
if(i-a[j]>0)
dp[i]=min(dp[i],dp[i-a[j]]+b[j]);
else
{
dp[i]=min(dp[i],b[j]);
}
}
}
cout<<dp[h];
}
} | 0 | 99,416,861 |
#include <stdio.h>
int main(){
int a;
while(1){
int n=0;
scanf("%d",&a);
if(!a) break;
a=1000-a;
while(a>0){
if(a>=500) a-=500;
else if(a>=100) a-=100;
else if(a>=50) a-=50;
else if(a>=10) a-=10;
else if(a>=5) a-=5;
else if(a>=1) a-=1;
n++;
}
printf("%d\n",n);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int x;
cin>>x;
if(x>=2400){
cout<<1<<endl;
return 0;
}
rep(i,25){
rep(j,25){
rep(k,25){
rep(l,25){
rep(m,25){
rep(n,25){
if(i*100+j*101+k*102+l*103+m*104+n*105==x){
cout<<1<<endl;
return 0;
}
}
}
}
}
}
}
cout<<0<<endl;
} | 0 | 58,048,255 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
unordered_set<int> determined;
{
int prevH = 0;
for (int i = 0; i < N; i++) {
if (prevH < A[i]) {
if (A[i] > B[i]) {
printf("0\n");
return 0;
}
prevH = A[i];
determined.insert(i);
}
}
}
{
int prevH = 0;
for (int i = N - 1; i >= 0; i--) {
if (prevH < B[i]) {
if (B[i] > A[i]) {
printf("0\n");
return 0;
}
prevH = B[i];
determined.insert(i);
}
}
}
int64_t result = 1;
for (int i = 0; i < N; i++) {
if (determined.count(i)) continue;
result = result * min(A[i], B[i]);
result %= MOD;
}
printf("%ld\n", result);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
ll solve(ll n, ll m, vector<ll> &nums) {
while (nums[0] % 2 == 0) {
for (int i = 0; i < n; i++) {
if (nums[i] % 2 != 0) return 0;
nums[i] /= 2;
}
m /= 2;
}
for (int i = 0; i < n; i++) if (nums[i] % 2 == 0) return 0;
ll lcm = 1;
for (int i = 0; i < n; i++) {
ll g = gcd(lcm, nums[i]);
lcm = lcm / g * nums[i];
if (lcm > m) return 0;
}
return (m / lcm + 1) / 2;
}
int main() {
int n, m;
cin >> n >> m;
vector<ll> nums(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
nums[i] /= 2;
}
cout << solve(n, m, nums) << endl;
return 0;
} | 0 | 18,411,859 |
#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 i, N, count=0;
vector<bool> num(26);
string S;
cin >> S;
rep(i,26) num[i] =false;
rep(i,S.size()){
num[S[i]-'a'] = true;
}
rep(i,26) {
if(num[i]==false) {
cout << (char)(i+'a');
count =1;
break;
}
}
if(!count) cout << "None";
} | #include <iostream>
using namespace std;
int main() {
int p[201], ans, t;
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max) {
if (m == 0 && n_min == 0 && n_max == 0) { break; }
for (int i = 0; i < m; i++) {
cin >> p[i];
}
ans = 0; t = 0;
for (int i = n_min; i <= n_max; i++) {
if (t <= p[i-1] - p[i]) {
ans = i;
t = p[i-1] - p[i];
}
}
cout << ans << endl;
}
return 0;
} | 0 | 89,597,821 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(N);
ll L = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] /= 2;
L = lcm(L, a[i]);
if (L > M) {
cout << 0 << endl;
return 0;
}
}
for (int i = 0; i < N; i++) {
if ((L / a[i]) % 2 == 0) {
cout << 0 << endl;
return 0;
}
}
cout << (M / L + 1) / 2 << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<random>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int N;cin>>N;
vector<int> vec (N,0);
for (int i = 0; i < N; i++)
{
cin>>vec[i];
}
sort(ALL(vec));
vector<int> acc(N);
partial_sum(ALL(vec),acc.begin());
int index = -1;
for (int i = 0; i < N-1; i++)
{
if(vec[i+1] > acc[i]*2)
{
index = i;
}
}
cout<<N-1 -index<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
} | 0 | 76,678,203 |
#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 <cmath>
#include <iomanip>
#include <ctype.h>
using namespace std;
using ll = long long;
#define rep(i,N) for(int i=0;i<(int)N;++i)
ll GCD(ll x, ll y) {
if (y == 0) return x;
else return GCD(y, x % y);
}
ll LCM(ll x, ll y) {
return x/GCD(x,y)*y;
}
bool my_compare(pair<string, int> a, pair<string, int> b) {
if (a.first != b.first) {
return a.first < b.first;
}
if (a.second != b.second) {
return a.second > b.second;
}
else {
return true;
}
}
int main()
{
int N;
cin>>N;
vector<int> H(N);
rep(i,N) cin>>H[i];
int a=H[0];
int k=1;
for(int i=1;i<N;++i){
if(H[i]>=a){++k;}
a=max(a,H[i]);
}
cout<<k<<endl;
} | #include<iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<stdlib.h>
#include<stack>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#include<set>
int main(void)
{
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++)
{
for(int j=0;j<=m;j++)
{
int b =i*m;
b-= j*i;
b+= (n-i)*j;
if(b==k)
{
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
} | 0 | 84,266,899 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <stack>
#include <map>
#define rep(i,n) for(long long i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll MOD = 1000000007;
int m, n1, n2;
int p[200];
void solve(){
rep(i,m) cin >> p[i];
sort(p,p+m,greater<int>());
int ans = 0;
int gap = 0;
for(int i = n1-1; i < n2; i++) if(gap <= p[i]-p[i+1]){ gap = p[i]-p[i+1]; ans = i+1; }
cout << ans << endl;
}
int main(){
while(cin >> m >> n1 >> n2){
if(m == 0 && n1 == 0 && n2 == 0) break;
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main()
{
string s;
cin >> s;
if(s.size()==26){
reverse(s.begin(), s.end());
char now = s[0];
int idx = 0;
for (int i = 1; i <= s.size() - 1; i++)
{
if (s[i] > now)
{
idx++;
now = s[i];
}
else
break;
}
if (idx == 25)
{
cout << -1 << endl;
return 0;
}
char mini = 'z';
REP(i, idx + 1)
{
if (s[i] > s[idx + 1])
mini = min(mini, s[i]);
}
reverse(s.begin(), s.end());
REP(i, s.size() - idx - 2) cout << s[i];
cout << mini << endl;
return 0;
}
for (int i = 0; i < 26; i++)
{
char c = i + 'a';
bool t = true;
REP(j, s.size())
{
char a = s.at(j);
if(a==c){
t = false;
}
}
if(t){
cout << s << c << endl;
return 0;
}
}
cout << -1 << endl;
} | 0 | 56,431,762 |
#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 ull unsigned long long
#define OrderSetTree tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define pi 2*acos(0.0)
#define f first
#define s second
#define pb push_back
#define gap ' '
#define fastio {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mod 1000000007
#define MAX 1000000000000
#define N 305
int main()
{
fastio;
ll i,j,t,n,l;
string s;
vector<string>v;
cin>>n>>l;
for(i=0;i<n;i++)
{
cin>>s;
v.push_back(s);
}
sort(v.begin(),v.end());
for(auto i:v)
cout<<i;
cout<<"\n";
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long int h = 0;
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (h > a[i]) {
ans+= h - a[i] ;
}
else h = a[i];
}
cout << ans << endl;
return 0;
} | 0 | 95,490,625 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int maxN=1e5+7;
int N;
int p[maxN];
int pos[maxN];
int leftFirstMaxPos[maxN];
int rightFirstMaxPos[maxN];
ll ans=0;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
cin>>p[i];
pos[p[i]]=i;
leftFirstMaxPos[i]=i-1;
rightFirstMaxPos[i]=i+1;
}
for(int i=1;i<=N;i++){
int Lpos1=leftFirstMaxPos[pos[i]];
int Lpos2=leftFirstMaxPos[Lpos1];
int Rpos1=rightFirstMaxPos[pos[i]];
int Rpos2=rightFirstMaxPos[Rpos1];
if(Lpos1!=0)ans+=(long long)1*i*(Lpos1-Lpos2)*(Rpos1-pos[i]);
if(Rpos1!=N+1)ans+=(long long)1*i*(pos[i]-Lpos1)*(Rpos2-Rpos1);
leftFirstMaxPos[Rpos1]=Lpos1;
rightFirstMaxPos[Lpos1]=Rpos1;
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b;
*b=temp;
}
int gcd(int a,int b){
if(a%b==0) return b;
return gcd(b,a%b);
}
int main(void){
int N,A,B;
cin>>N>>A>>B;
if((B-A)%2==0){
cout<<"Alice"<<endl;
}else if((B-A)%2==1){
cout<<"Borys"<<endl;
}else if(A==B){
cout<<"Draw"<<endl;
}
return 0;
} | 0 | 78,472,580 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = ss; i < (ee); ++i)
const int INF = 1e9;
vector<vector<int>> to(100001);
void solve() {
int N;
int M;
cin >> N >> M;
rep(i, 0, M) {
int u, v;
cin >> u >> v;
--u;
--v;
to[u].push_back(v);
to[v].push_back(u);
}
queue<int> q;
vector<int> d(N, INF);
vector<int> p(N, -1);
d[0] = 0;
q.push(0);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto u : to[v]) {
if (d[u] != INF) continue;
d[u] = d[v] + 1;
p[u] = v;
q.push(u);
}
}
cout << "Yes" << endl;
rep(i, 1, N) { cout << (p[i] + 1) << endl; }
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | #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 h,w;
cin >> h >> w;
string s;
vector<string> ans;
rep(i,h){
cin >> s;
rep(j,2) ans.push_back(s);
}
rep(i,h*2){
cout << ans[i] << endl;
}
return 0;
} | 0 | 12,175,544 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n, t;
cin>>n >>t;
long long x=t;
vector<long long> s(n);
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<n-1;i++){
x+=min(s[i+1]-s[i], t);
}
cout<<x<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF (1e10)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define MOD 1000000007
template<typename T>
int vector_finder(std::vector<T> vec, T number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
template<typename T>
T gcd(T a,T b){
if(b>0){
return gcd(b, a % b);
}else{
return a;
}
}
template<typename T>
T lcm(T a,T b){
T g = gcd(a, b);
return a * b / g;
}
void clear( std::queue<pair<int,int> > &q )
{
std::queue<pair<int,int> > empty;
std::swap( q, empty );
}
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;
}
template<typename T>
std::vector<T> enum_div(T n)
{
std::vector<T> ret;
for(T i=1 ; i*i<=n ; ++i)
{
if(n%i == 0)
{
ret.push_back(i);
if(i!=1 && i*i!=n)
{
ret.push_back(n/i);
}
}
}
return ret;
}
int N,M;
int main()
{
cin>>N;
long long a[N];
long long mx=0;
int idx=0;
REP(i,0,N){
cin>>a[i];
if(a[i]>mx){
mx=a[i];
idx=i;
}
}
long long mx2=mx/2;
long long dif=INF;
int id=0;
REP(i,0,N){
if(dif>abs(a[i]-mx2)){
dif=abs(a[i]-mx2);
id=i;
}
}
if(a[idx]==100&&a[id]==100){
cout<<100<<" "<<0<<endl;
}else{
cout<<a[idx]<<" "<<a[id]<<endl;
}
return 0;
} | 0 | 84,207,235 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int perform(Int x){
return (x*(x+1))/2LL;
}
int main()
{
map<char,int> mp;
string S;cin>>S;
for(auto x:S) ++mp[x];
bool ok=true;
if(mp.size()!=2) ok=false;
for(auto &itr:mp){
if(itr.second!=2) ok=false;
}
cout<<(ok ? "Yes\n":"No\n");
} | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
deque<pair<int, int>> que;
typedef vector<vector<int> > Matrix;
const ll INF = 1e18;
int main() {
int N;
cin >> N;
vector<string> W(N);
map<string, int> str;
vector<char> start(N), end(N);
REP(i, N){
cin >> W[i];
str[W[i]]++;
start[i] = W[i][0];
end[i] = W[i][W[i].length()-1];
}
REP1(i, N){
if(start[i] != end[i-1]){
cout << "No" << endl;
return 0;
}
}
for(auto itr = str.begin(); itr != str.end(); itr++){
if(itr->second != 1){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | 0 | 51,474,899 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
int d=0;
for(int i=0;i<k;i++){
d+=a[n-i-1];
}
cout << d;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define MAX_V 100
#define INF LONG_MAX / 4
using namespace std;
typedef struct {
int to, cost;
} edge;
vector<edge> G[MAX_V];
long long d[MAX_V][MAX_V];
bool find_negative_cycle(int v) {
for (int i = 0; i < v; i++) {
if (d[i][i] < 0) return true;
}
return false;
}
void warshall_floyd(int v) {
for (int k = 0; k < v; k++) {
for (int i = 0; i < v; i++) {
if (d[i][k] == INF) continue;
for (int j = 0; j < v; j++) {
if (d[k][j] == INF) continue;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
void init(int v) {
for (int i = 0; i < v; i++) {
for (int j = 0; j < v; j++) {
if (i == j) d[i][j] = 0;
else d[i][j] = INF;
}
}
for (int i = 0; i < v; i++) {
for (int j = 0; j < G[i].size(); j++) {
d[i][G[i][j].to] = G[i][j].cost;
}
}
}
int main() {
int v, e;
cin >> v >> e;
for (int i = 0; i < e; i++) {
edge temp;
int s, t, d;
cin >> s >> t >> d;
temp.to = t;
temp.cost = d;
G[s].push_back(temp);
}
init(v);
warshall_floyd(v);
if (find_negative_cycle(v) == true) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
for (int i = 0; i < v; i++) {
for (int j = 0; j < v; j++) {
if (INF - 20000000 <= d[i][j] && d[i][j] <= INF) {
cout << "INF";
} else {
cout << d[i][j];
}
if (j < v - 1) {
cout << ' ';
} else {
cout << endl;
}
}
}
return 0;
} | 0 | 80,343,550 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
char m = '0' + min(a, b);
string ans(max(a, b), m);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pl;
ld const PI = 4*atan((ld)1);
int main()
{
fastio;
int a, b, c;
int k;
cin >> a >> b >> c;
cin >> k;
while (a >= b)
b *= 2, k--;
while (b >= c)
c *= 2, k--;
cout << (k < 0 ? "No\n" : "Yes\n");
return 0;
} | 0 | 28,822,273 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
int n, m, k;
cin >> n >> m >> k;
int ok = 0;
for (int i = 0; i <= n; i++) {
int tmp = k - m * i;
int mod = (n - 2 * i);
if (mod == 0) ok = (tmp == 0);
else {
if (tmp % mod == 0) if (tmp / mod >= 0 && tmp / mod <= m) ok = 1;
}
}
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 2006
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout<<(a)<<endl
#define VECIN(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define MOD 1000000007
ll dp[N][N];
int main(){
int n,m;
cin>>n>>m;
vector<int> S(n);
vector<int> T(m);
REP(i,n){
cin>>S[i];
}
REP(i,m){
cin>>T[i];
}
REP(i,N){
dp[0][i]=1;
dp[i][0]=1;
}
REP(i,n){
REP(j,m){
if(S[i]==T[j]){
dp[i+1][j+1]=(dp[i+1][j]+dp[i][j+1])%MOD;
}
else{
dp[i+1][j+1]=(dp[i][j+1]+dp[i+1][j]-dp[i][j])%MOD;
}
}
}
if(dp[n][m]<0) dp[n][m]+=MOD;
OUT(dp[n][m]);
return 0;
} | 0 | 95,070,366 |
#include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N = 0;
std::cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (i % 2 == 0) {
continue;
}
int f = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0) {
f++;
}
}
if (f == 8) {
ans++;
}
}
std::cout << ans << std::endl;
return 0;
} | #include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define rrep(i,a,b) for(int i = a; i >=b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#define nl "\n"
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using ii = pair<int, int>;
using pli = pair<ll, int>;
using vi = vector<int>;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using pil = pair<int,ll>;
using vvi = vector<vi>;
using vpi = vector<ii>;
const int N = 100100;
ll mod=1000000007;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll x,y,z,k;
cin>>x>>y>>z>>k;
vector<ll> a(x),b(y),c(z);
rep(i,0,x-1){
cin>>a[i];
}
rep(i,0,y-1){
cin>>b[i];
}
rep(i,0,z-1){
cin>>c[i];
}
sort(c.rbegin(),c.rend());
priority_queue<pll> q;
rep(i,0,x-1){
rep(j,0,y-1){
q.push(mp(a[i]+b[j]+c[0],0));
}
}
rep(i,0,k-1){
auto fr = q.top();
q.pop();
cout<< fr.F << nl;
int se = fr.S;
if(se == z - 1){
continue;
}
q.push(mp(fr.F - c[se] + c[se+1], se + 1));
}
return 0;
} | 0 | 45,664,986 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main()
{
vector<int> v(3);
for (int i = 0; i < 3; ++i) cin >> v[i];
set<int> s(v.begin(), v.end());
cout << s.size() << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, b, n) for (int i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve(int N, string S) {
auto itr = S.begin();
int l(0), r(0);
REP(i, N) {
if (S[i] == '(')
l++;
else
r++;
if (l < r) {
S.insert(S.begin(), '(');
i++;
N++;
l++;
}
}
REP(i, l - r)
S.insert(S.end(), ')');
cout << S << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
solve(N, S);
return 0;
} | 0 | 243,948 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n == 2) {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "YES" << '\n';
} else {
cout << "NO" << '\n';
}
return 0;
}
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
--x, --y;
g[x].emplace_back(y);
g[y].emplace_back(x);
}
int root = -1;
for (int i = 0; i < n; i++) {
if (g[i].size() > 1) {
root = i;
break;
}
}
function<ll(int, int)> dfs = [&](int v, int p) {
vector<ll> t;
for (int to : g[v]) {
if (to == p) continue;
t.emplace_back(dfs(to, v));
}
if (t.empty()) {
return a[v];
}
sort(t.begin(), t.end());
ll mx = accumulate(t.begin(), t.end(), 0LL);
ll mn = max(t.back(), (mx + 1) / 2);
if (a[v] < mn || mx < a[v]) {
cout << "NO" << '\n';
exit(0);
}
ll res = mx - a[v];
res = mx - res * 2;
return res;
};
if (dfs(root, -1) == 0) {
cout << "YES" << '\n';
} else {
cout << "NO" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
if(n==2)
cout<<"Borys"<<endl;
else{
int diff=abs(a-b)+1;
if(diff%2==0)
cout<<"Borys"<<endl;
else
cout<<"Alice"<<endl;
}
return 0;
} | 0 | 29,958,287 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef pair<int, int> pint;
#define INF 1e9
struct w_union_find{
vector<int> d_ws;
vector<int> ps;
w_union_find(int n = 1) : ps(n, -1), d_ws(n, 0){}
int root(int a){
if(ps[a] < 0){
return a;
}
int r = root(ps[a]);
d_ws[a] += d_ws[ps[a]];
return ps[a] = r;
}
bool same(int a, int b){
return root(a) == root(b);
}
int weight(int a){
root(a);
return d_ws[a];
}
int diff_weight(int a, int b){
return weight(b) - weight(a);
}
bool unite(int a, int b, int w){
if(same(a, b)){
return diff_weight(a, b) == w;
}
w -= weight(b);
w += weight(a);
a = root(a);
b = root(b);
if(ps[a] > ps[b]){
swap(a, b);
w *= -1;
}
ps[a] += ps[b];
ps[b] = a;
d_ws[b] = w;
return true;
}
};
int main(){
int N, M;
cin >> N >> M;
w_union_find uf(N);
rep(i, M){
int l, r, d;
cin >> l >> r >> d;
if(! uf.unite(l, r, d)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e7 + 7;
ll par[mx];
ll find_parent(ll x) {
if(x == par[x]) return x;
return par[x] = find_parent(par[x]);
}
void join(ll u, ll v) {
ll p_u = find_parent(u);
ll 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;
ll p_u = par[u];
ll p_v = par[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;
} | 0 | 73,231,044 |
#include<bits/stdc++.h>
#include<numeric>
#include<cassert>
#define ll long long int
#define CON 100010
const long long mod=1e9+7;
const int INF=1001001001;
using namespace std;
ll gcd(ll a,ll b)
{
ll r=a%b;
if(r==0)
{
return b;
}
return gcd(b,r);
}
ll lcm(ll num,ll gcd)
{
return num/gcd;
}
int main()
{
ll a,b;
cin>>a>>b;
ll com=a*b;
ll mul=gcd(max(a,b),min(a,b));
ll ans=lcm(com,mul);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
if(a[n-1] <= 0) {
int ans = a[n-1];
rep(i,n-1) ans -= a[i];
cout << ans << endl;
rep(i,n-1) {
cout << a[n-1] << " " << a[i] << endl;
a[n-1] -= a[i];
}
} else if(a[0] >= 0) {
int ans = a[0];
for(int i = 1; i < n-1; i++) ans -= a[i];
ans = a[n-1] - ans;
cout << ans << endl;
for(int i = 1; i < n-1; i++) {
cout << a[0] << " " << a[i] << endl;
a[0] -= a[i];
}
cout << a[n-1] << " " << a[0] << endl;
} else {
int ans = 0;
rep(i,n) ans += abs(a[i]);
cout << ans << endl;
int p = 0;
while(a[p] < 0) {p++;}
for(int i = p; i < n-1; i++) {
cout << a[0] << " " << a[i] << endl;
a[0] -= a[i];
}
rep(i,p) {
cout << a[n-1] << " " << a[i] << endl;
a[n-1] -= a[i];
}
}
return 0;
} | 0 | 281,376 |
#include <queue>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <time.h>
#include <functional>
using namespace std;
typedef long long int ll;
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
#define REP(i,n) for(int i=0;i<n;i++)
int gcd(int a, int b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll beki(ll a, ll b) {
ll tmp = 1;
REP(i, b) tmp *= a;
return tmp;
}
int S, W;
int main() {
cin >> S >> W;
if (S <= W) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
} | #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(){
const ll inf = 1LL<<59;
ll W, H; cin >> W >> H;
vector<ll> p(W+1), q(H+1);
for(int i=0; i<W; ++i) cin >> p[i];
for(int i=0; i<H; ++i) cin >> q[i];
p[W] = q[H] = inf;
sort(p.begin(), p.end());
sort(q.begin(), q.end());
ll ans = 0;
ll row = H+1, cul = W+1;
int i = 0, j = 0;
for(int loop=0; loop<H+W; ++loop){
if(p[i] <= q[j]){
ans += p[i]*row;
++i;
--cul;
}
else{
ans += q[j]*cul;
++j;
--row;
}
}
cout << ans << endl;
} | 0 | 44,390,714 |
#include <iostream>
#include <string>
using namespace std;
const string keys = "qwertasdfgzxcvb";
int main() {
for (;;) {
string s;
cin >> s;
if (s == "#") break;
int res = 0;
bool cur = keys.find(s.substr(0, 1)) != string::npos;
for (int i = 1; i < s.size(); i++) {
bool prev = cur;
cur = keys.find(s.substr(i, 1)) != string::npos;
if (cur != prev) {
res++;
}
}
cout << res << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int> a, pair<int, int> b) {
return (a.second < b.second);
}
const int MAX = 200005;
const long long MOD = 1000000007;
const long long MODMOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long gcd(long long a, long long b) {
if(a % b == 0) return b;
else return gcd(b, a % b);
}
int main() {
ll n;
cin >> n;
ll ans = 0LL;
for(ll i=1;i<=sqrt(n);i++) {
if(n % i == 0 && n / i > i + 1) ans += n / i - 1;
}
cout << ans << endl;
} | 0 | 88,417,104 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace std;
typedef pair<long long, long long> P;
vector<P> prime_factorize(long long n)
{
vector<P> res;
for (long long p = 2; p * p <= n; ++p)
{
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0)
{
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
long long gcd(long long x, long long y)
{
if (y == 0)
{
return x;
}
else
{
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
int main()
{
int n,m;
cin>>n>>m;
vector<vector<int> > G(n,vector<int>());
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(n,-1);
vector<int> prev(n,-1);
queue<int> que;
que.push(0);
dist[0]=0;
while(!que.empty()){
int v=que.front();
que.pop();
for(auto nv:G[v]){
if(dist[nv]==-1){
dist[nv]=dist[v]+1;
prev[nv]=v;
que.push(nv);
}
}
}
cout<<"Yes"<<endl;
for(int i=1;i<n;i++){
cout<<prev[i]+1<<endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
int n;
cin >> n;
rep(i, (n + 3) / 4)
{
int x = 4 * i;
if (n % 4 == 0)
{
cout << "Yes" << endl;
return 0;
}
if ((n - x) % 7 == 0)
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 0 | 74,933,450 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long ptn0=0;
long long ptn1=0;
for (long long i=0; i<S.size(); i++) {
if (i%2==0) {
if (S.at(i)!='0') ptn0++;
else ptn1++;
}
else {
if (S.at(i)!='1') ptn0++;
else ptn1++;
}
}
cout << min(ptn0, ptn1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
std::cout << #x << ": "; \
view(x); \
} while (0)
template <typename T>
void view(T e) {
std::cout << e << std::endl;
}
template <typename T>
void view(const std::vector<T>& v) {
for (const auto& e : v) {
std::cout << e << ", ";
}
std::cout << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>>& vv) {
for (const auto& v : vv) {
view(v);
}
}
int main() {
ll N, K;
cin >> N >> K;
ll ans = 0;
for (ll i = K; i <= (N + 1); i++) {
ll mi = i * (i - 1) / 2;
ll ma = 0;
rep(j, i) { ma += N - j; }
ma = i * (2 * (N - i + 1) + (i - 1)) / 2;
ans += (ma - mi + 1) % (1000000000 + 7);
}
cout << ans % (1000000000 + 7) << endl;
return 0;
} | 0 | 58,547,677 |
#include <bits/stdc++.h>
using namespace std;
int n, a[200005];
map<int, int> mp;
bool check(int lmt) {
mp.clear();
int now = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > now) now = a[i];
else {
now = a[i];
while (!mp.empty()) {
int last = (--mp.end())->first;
if (last >= now) mp.erase(last);
else break;
}
int nnow = now - 1;
mp[nnow]++;
while (nnow >= 0 && mp[nnow] >= lmt) {
mp.erase(nnow);
--nnow;
mp[nnow]++;
}
if (nnow < 0) return false;
}
}
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
bool flag = true;
for (int i = 1; i <= n; ++i)
flag &= (a[i] > a[i - 1]);
if (flag) return puts("1") & 0;
int l = 2, r = n, ans = n;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid)) ans = mid, r = mid - 1;
else l = mid + 1;
}
printf("%d\n", ans);
return 0;
} | #include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout<<"YES"
#define NN cout<<"NO"
#define EE cout<<"\n"
#define ee cout<<"\n"
#define ne cout<<"-1"
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define mkt make_tuple
#define sall(v ) sort(v.begin(), v.end())
#define all(v ) v.begin(), v.end()
#define rall(v ) reverse(v.begin(), v.end())
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#define vl vector<ll>
#define vll vector< pair<ll,ll> >
#define mpl map<ll, ll>
#define pr pair<ll,ll>
#define tpl tuple<ll,ll,ll>
bool sortbysec(const pair<int,int> &a,const pair<int,int> &b) {return (a.second < b.second); }
ll soltn(ll x, ll n) {if(x>=0) return x%n; else return n+x%n;}
ll pd(ll x,ll y){if(x%y==0) return x/y;else return x/y+1;}
ll coda(ll n,ll d){ll count=0;while(n!=0){if(n%10==d)count++;n/=10;}return count;}
ll pow1(ll n,ll p){if(p==0)return 1;ll x=pow1(n, p/2);x=(x*x)%MOD;if(p%2==0) return x;else return (x*n)%MOD;}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
while(t--)
{
ll n,m,j,k,l,i;
cin>>n;
ll a[n],s=0;
fo(i,n)
{
cin>>a[i];
s+=a[i];
}
ll ini=0;
ll f=1;
ll N=((n)*(n+1))/2;
if(s%N!=0)
f=-1;
ini=(s/N);
fo(i,n)
{
ll p=ini-(a[(i+1)%n]-a[i]);
if(p<0||p%n!=0)
f=-1;
}
if(f==1||n==1)
YY;
else
NN;
ee;
}
return 0;
} | 0 | 40,557,411 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
ll n;
cin >> n;
vector<ll> L(n + 1);
L[0] = 2LL; L[1] = 1LL;
for(int i = 2; i <= n; ++i) {
L[i] = L[i - 1] + L[i - 2];
}
cout << L[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define MOD 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 100005
#define M 1e6+9
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
#define int long long
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
void test_case() {
int h,n;
cin>>h>>n;
vec d(n), b(n);
rep(i,n) {
cin>>d[i]>>b[i];
}
int dp[N];
for(int i=0; i<N; i++) {
dp[i] = LONG_MAX;
}
dp[0] = 0;
int ans = INT64_MAX;
for(int i=1; i<=10*h; i++) {
for(int j=0; j<n; j++) {
if(i- d[j] >=0 && dp[i - d[j]] != LONG_MAX) {
dp[i] = min(dp[i], dp[i-d[j]] + b[j]);
if(i>=h) {
ans=min(ans, dp[i]);
}
}
}
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while(t--)
{
test_case();
}
} | 0 | 56,733,257 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
char a,b; cin >> a >> b;
if (a == 'D')
{
if (b == 'D') cout << 'H';
else cout << 'D';
}
else
cout << b;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
void solve() {
string str; cin >> str;
bool b1= 1, b2= 1;
int n= str.size();
for (int i= 0; i< n/ 2; i++) {
if (str[i]!= str[n/ 2- 1- i]) b1= 0;
}
for (int i= n/ 2+ 1; i< n; i++) {
if (str[i]!= str[n- 1- i]) b1= 0;
}
if (b1&& b2) cout << "Yes\n";
else cout << "No\n";
}
int32_t main(){
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int T= 1;
while ( T-- ) solve();
return 0;
} | 0 | 29,749,339 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#define rnfor(i,a,b) for(ll (i) = (a) - 1; (i) >= (b); --(i))
#define ll long long
#define mod (1000000007)
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
const ll inf = 1e9;
ll gcd(ll a,ll b){
if(a < b)swap(a, b);
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
ll factorial(ll n){
ll t = 1;
rep1(i, n)t *= i;
return t;
}
ll combinations(ll n, ll k) {
ll r = 1;
rep1(i, k)r = r * n-- / i;
return r;
}
int main(){
ll k,n;
cin >> n >> k;
vector<ll> x(n),y(n);
rep0(i, n)cin >> x[i] >> y[i];
ll ans = 4 * 1e18 + 1;
rep0(xl, n)rep0(xr, n)rep0(yl, n)rep0(yr, n){
ll lx = xl,rx = xr,ly = yl,ry = yr;
if(x[lx] > x[rx])swap(lx, rx);
if(y[ly] > y[ry])swap(ly, ry);
ll cnt = 0;
rep0(i, n)if(x[i] >= x[lx] && x[i] <= x[rx] && y[i] >= y[ly] && y[i] <= y[ry])++cnt;
if(cnt >= k)ans = min(ans, (x[rx] - x[lx]) * (y[ry] - y[ly]));
}
pf(ans);
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
typedef long double ld;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> edges(n+1);
int a,b;
REP(i,m){
cin>>a>>b;
edges[a].push_back(b);
edges[b].push_back(a);
}
vector<int> nodes(n-1);
REP(i,n-1)nodes[i]=i+2;
int cnt=0;
if(SIZE(nodes)==1){
cnt=1;
}else{
do{
bool can=true;
int from=1;
REP(i,n-1){
int to=nodes[i];
if(find(ALL(edges[from]),to)!=edges[from].end()){
from=to;
}else{
can=false;
break;
}
}
if(can)cnt++;
}while(next_permutation(ALL(nodes)));
}
cout<<cnt<<endl;
return 0;
} | 0 | 54,424,790 |
#include <stdio.h>
#include <string.h>
int dp[51][5];
void init() {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 0; i <= 50; ++i) {
for (int j = 1; j <= 4; ++j) {
for (int t = 0; t < 10 && t <= i; ++t) {
dp[i][j] += dp[i-t][j-1];
}
}
}
}
int main() {
int n;
init();
while (scanf("%d", &n) == 1) {
int result = dp[n][4];
printf("%d\n", result);
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
enum version{
fleft,
fright,
};
version check(char c){
switch(c){
case 'q':
case 'w':
case 'e':
case 'r':
case 't':
case 'a':
case 's':
case 'd':
case 'f':
case 'g':
case 'z':
case 'x':
case 'c':
case 'v':
case 'b':
return fleft;
default:
return fright;
}
}
int main(){
string input;
while(cin>>input && input!="#"){
version v=check(input[0]);
int count=0;
for(int i=1;i<(int)input.size();i++){
version ver=check(input[i]);
if(ver!=v){
count++;
v=ver;
}
}
cout<<count<<endl;
}
return 0;
} | 0 | 15,694,913 |
#include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[]={"SUN","MON","TUE","WED","THU","FRI","SAT"};
bool sortDescByFirst(const pair<int,int>&a, const pair<int,int>&b){
return a.first>=b.first;
}
int main() {
int a,b,c,d;
while(cin>>a>>b>>c>>d){
cout<<min(a+d,min(a+c,min(b+c,b+d)))<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[n];
for (int& e: a) cin >> e;
vector<vector<int>> g(n);
for (int i=0; i<m; i++) {
int x, y;
cin >> x >> y;
g[x-1].push_back(y-1);
g[y-1].push_back(x-1);
}
int cnt = 0;
for (int i=0; i<n; i++) {
bool flag = true;
for (int e : g[i])
if (a[e] >= a[i])
flag = false;
cnt += flag;
}
cout << cnt << "\n";
} | 0 | 15,411,298 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); }
int bt(ll x) { return 63 - __builtin_clzll(x); }
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
vector<int> get_bits(int mask) {
vector<int> bb;
while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
reverse(all(bb));
return bb;
}
int get_mask(vector<int> v) {
int mask = 0;
for(int x : v) { mask ^= (1 << x); }
return mask;
}
template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r){
uniform_int_distribution<ll> uid(l, r);
return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const int mod = 1e9 + 7;
int pwr(int a,ll b) {
int ans = 1;
while(b) {
if(b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
const int N = 1e5 + 5;
int dsu[N], sz[N];
bool odd[N], par[N];
int root(int u) {
while(u != dsu[u]) u = dsu[u];
return u;
}
int get_par(int u) {
int p = 0;
while(u != dsu[u]) {
p ^= par[u];
u = dsu[u];
}
return p;
}
void uni(int u,int v) {
int uu = root(u), vv = root(v);
if(uu == vv) {
if(get_par(u) == get_par(v))
odd[uu] = 1;
return;
}
if(sz[uu] > sz[vv]) {
swap(uu, vv), swap(u, v);
}
dsu[uu] = vv;
sz[vv] += sz[uu];
odd[vv] |= odd[uu];
par[uu] = get_par(u) ^ get_par(v) ^ 1;
}
void solve() {
int n, m;
sc(n, m);
fr(i, 1, n) {
sz[i] = 1;
dsu[i] = i;
odd[i] = 0;
par[i] = 0;
}
fr(i, 1, m) {
int u, v;
sc(u, v);
uni(u, v);
}
int c1 = 0, c2 = 0, c3 = 0;
fr(i, 1, n) {
if(i == dsu[i]) {
if(sz[i] == 1) {
c1++;
}
else if(odd[i]) {
c2++;
}
else {
c3++;
}
}
}
ll ans = 0;
while(c1) {
ans += 2 * n - 1;
n--;
c1--;
}
while(c2) {
ans += 2 * (c2 + c3) - 1;
c2--;
}
ans += (c3 * 1LL * (c3 - 1)) * 2 + 2LL * c3;
cout << ans;
}
int main() {
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
for(int tt = 1; tt <= t; tt++) {
solve();
}
return 0;
} | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 210000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
void init_C(int n){
fact[0]=finv[0]=inv[1]=1;
for(int i=2;i<n;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<n;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
int b[110000];
int main(){
int a;scanf("%d",&a);
for(int i=0;i<a;i++)scanf("%d",b+i);
std::sort(b,b+a);
printf("%d",b[a-1]);
int at=0;
int val=mod;
for(int i=0;i<a-1;i++){
if(ABS(b[a-1]-2*b[i])<val){
at=i;
val=ABS(b[a-1]-2*b[i]);
}
}
printf(" %d\n",b[at]);
} | 0 | 82,344,874 |
#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 sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
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); }
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min(a,b)+min(c,d)<<endl;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 998244353
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi>b.fi;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
V<ll>a(n);
for(ll i=0;i<n;i++)cin>>a[i];
sort(all(a));
ll ans=0;
ans=a[0];
V<Pll>out;
if(a[n-1]<=0){
ans=a[n-1];
for(ll i=n-2;i>=0;i--){
out.pb(mp(ans,a[i]));
ans-=a[i];
}
cout<<ans<<endl;
for(ll i=0;i<n-1;i++){
cout<<out[i].fi<<" "<<out[i].se<<endl;
}
return 0;
}
ll l=0,r=0;
for(ll i=1;i<n-1;i++){
if(a[i]>=0){
l=ans;
r=a[i];
ans-=a[i];
out.pb(mp(l,r));
}
}
r=ans;
l=a[n-1];
ans=a[n-1]-ans;
out.pb(mp(l,r));
for(ll i=1;i<n-1;i++){
if(a[i]<0){
l=ans;
r=a[i];
ans-=a[i];
out.pb(mp(l,r));
}
}
cout<<ans<<endl;
for(ll i=0;i<n-1;i++){
cout<<out[i].fi<<" "<<out[i].se<<endl;
}
return 0;
} | 0 | 65,308,731 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
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() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
ll n = s.size();
map<char, ll> mp;
rep(i, n) mp[s[i]]++;
ll ans = n*(n-1)/2+1;
for (auto e : mp)
ans -= e.second*(e.second-1)/2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
ll N; cin >> N;
ll A[N]; rep(i, N) cin >> A[i];
ll K[N] = {};
ll acc = 0;
ll ans = 0;
while(true){
acc = 0;
rep(i, N){
if(A[i] <= N-1) K[i] = 0;
else{
K[i] = (A[i]+1-N)/N;
if((A[i]+1-N) % N) K[i]++;
acc += K[i];
}
}
if(acc == 0) break;
rep(i, N){
A[i] += (acc-K[i])-K[i]*N;
}
ans += acc;
}
cout << ans << endl;
return 0;
} | 0 | 11,942,980 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N; cin>>N;
vi A(N);
rep(i,0,N) cin>>A[i];
vector<map<int,int>> M(2);
rep(i,0,N) M[i%2][A[i]]++;
sort(ALL(A));
int ans=0;
rep(i,0,N){
if(M[i%2][A[i]]>0){
M[i%2][A[i]]--;
}
else{
ans++;
M[1-i%2][A[i]]--;
}
}
cout<<ans/2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
#define dame { puts("-1"); return 0;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int N, K, x[55], y[55];
int main() {
cin >> N >> K;
rep(i,N) cin >> x[i] >> y[i];
long long ret = 1LL << 62;
rep(i,N) rep(j,N) rep(k,N) rep(l,N) {
if (x[i] <= x[j] && y[k] <= y[l]) {
int cnt = 0;
for (int p = 0; p < N; p++) {
if (x[i] <= x[p] && x[p] <= x[j] && y[k] <= y[p] && y[p] <= y[l]) cnt++;
}
if (cnt >= K) ret = min(ret, 1LL * (x[j] - x[i]) * (y[l] - y[k]));
}
}
cout << ret << endl;
return 0;
} | 0 | 23,600,655 |
#include <iostream>
using namespace std;
int main(){
int n, k, x, y;
cin >> n >> k >> x >> y;
int result = 0;
if(n - k >= 0){
result += k * x;
result += (n - k) * y;
}
else{
result += n * x;
}
cout << result << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
string S;
cin >> H >> W;
int a, b;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S;
if (S == "snuke") {
a = j, b = i;
}
}
}
cout << char(a + 'A') << b + 1 << endl;
return 0;
} | 0 | 13,467,265 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >>T ;
while(T--){
int s[3];
cin >> s[0] >> s[1] >> s[2];
sort(s,s+3);
if( s[0] * s[0] + s[1] * s[1] == s[2] * s[2] ) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
vector<vector<int>> v(4,vector<int>(4));
vector<vector<bool>> bin(4,vector<bool>(4,false));
for(int i=1; i<=3; i++)
for(int j=1; j<=3; j++)
cin >> v[i][j];
int n; cin >> n;
for(int i=1; i<=n; i++){
int b;
cin >> b;
for(int j=1; j<=3; j++)
for(int k=1; k<=3; k++)
if(v[j][k]==b)
bin[j][k]=true;
}
bool ans = false;
for(int i=1; i<=3; i++){
bool bingo = true;
for(int j=1; j<=3; j++){
if(bin[i][j] == false) bingo = false;
}
if(bingo==true) ans = true;
}
for(int i=1; i<=3; i++){
bool bingo = true;
for(int j=1; j<=3; j++){
if(bin[j][i] == false) bingo = false;
}
if(bingo==true) ans = true;
}
if(bin[1][1]&&bin[2][2]&&bin[3][3]) ans = true;
if(bin[1][3]&&bin[2][2]&&bin[3][1]) ans = true;
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 39,753,837 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MMOD 998244353
#define MAX 2010101
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll H,W,N;
cin>>H>>W>>N;
map<pair<ll,ll>,ll> L;
REP(n,N){
ll A,B;
cin>>A>>B;
for(ll i=A-2; i<=A; ++i){
for(ll j=B-2; j<=B; ++j){
L[MP(i,j)]++;
}
}
}
ll ANS[10],cnt=0;
REP(i,10) ANS[i]=0;
FORE(v,L){
if(1<=v.first.first && v.first.first<=H-2 && 1<=v.first.second && v.first.second<=W-2){
ANS[v.second]++;
cnt++;
}
}
ANS[0]=(H-2)*(W-2)-cnt;
REP(i,10) cout<<ANS[i]<<endl;
return 0;
} | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,k,n) for(ll i=k; i<(ll)(n); i++)
#define Q 1000000007
struct UnionFind {
vector<ll> par;
UnionFind(ll N) : par(N) {
rep(i,0,N) par[i] = i;
}
ll root(ll x) {
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if(rx == ry) return;
par[rx] = ry;
}
bool same(ll x, ll y) {
return root(x) == root(y);
}
};
int main(){
ll n,m; cin >> n >> m;
UnionFind tree(n);
vector<ll> p(n);
rep(i,0,n) {
cin >> p[i];
--p[i];
}
vector<ll> x(m),y(m);
rep(i,0,m) {
cin >> x[i] >> y[i];
--x[i]; --y[i];
tree.unite(x[i],y[i]);
}
ll ans = 0;
rep(i,0,n) {
if(tree.same(i,p[i])) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 97,658,392 |
#include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int
#define ld long double
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define YY cout<<"YES"
#define NN cout<<"NO"
#define EE cout<<"\n"
#define ee cout<<"\n"
#define ne cout<<"-1"
#define pb push_back
#define ff first
#define ss second
#define mkp make_pair
#define mkt make_tuple
#define sall(v ) sort(v.begin(), v.end())
#define all(v ) v.begin(), v.end()
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#define vl vector<ll>
#define vc vector<char>
#define vll vector< pair<ll,ll> >
#define pr pair<ll,ll>
#define mps map<string ,ll>
#define mpc map<char ,char>
#define mpl map<ll,ll>
#define tpl tuple<ll,ll,ll>
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
while(t--)
{
ll n,m,j,k,l,i;
string s;
cin>>s;
l=s.length();
map<char ,ll >M;
fo(i,l)
M[s[i]]=0;
for(i=1;i<=l;i++)
{
if(M[s[i-1]]&&i-M[s[i-1]]<=2&&i-M[s[i-1]]>0)
{
cout<<M[s[i-1]]<<" "<<i;
return 0;
}
M[s[i-1]]=i;
}
cout<<-1<<" "<<-1;
ee;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int d;
while(cin >> d){
int COUNT = 0;
for (int i = d; 600 > i; i = i + d){
int j = i * i * d;
COUNT = COUNT + j;
}
cout << COUNT << endl;
}
return 0;
} | 0 | 16,695,434 |
#include <bits/stdc++.h>
using namespace std;
#define M_PI 3.14159265358979323846
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> ipair;
typedef pair<ll, ll> llpair;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
ll a, b, c, d;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
cin>>a>>b>>c>>d;
cout<<max({a*c, a*d, b*c, b*d})<<"\n";
return 0;
} | #include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
#include<math.h>
#include <functional>
#include<climits>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<(ll)(n); ++i)
#define mod 1000000007
vector<ll>to[1000005];
int main(){
ll a,b,c,d,e,g=0;cin>>a>>b;
c=a+b;
if(a%3==0||b%3==0||c%3==0){
cout<<"Possible";
}
else cout<<"Impossible";
} | 0 | 64,585,163 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a,b,c;
cin >> a>> b>> c;
cout << ((a <= c && b >= c) ? "Yes" : "No" ) << endl;
return 0;
} | #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#define point pair<double, double>
using namespace std;
int n;
vector<pair<double, double> > points;
void makeCurve(pair<double, double> p1, pair<double, double> p2, int n);
point makeVector(point a, point b);
int main() {
cin>>n;
point start = make_pair(0,0);
pair<double, double> end = make_pair(100.0,0.0);
makeCurve(start, end, n);
points.push_back(end);
for (int i=0; i<points.size(); i++) {
cout<<points[i].first<<" "<<points[i].second<<endl;
}
return 0;
}
point makeVector(point a, point b){
point vec;
vec = make_pair(b.first-a.first, b.second-a.second);
return vec;
}
void makeCurve(pair<double, double> p1, pair<double, double> p2, int n){
if (n>0) {
point vec = makeVector(p1,p2);
point s = make_pair(p1.first+vec.first/3, p1.second+vec.second/3);
point t = make_pair(p1.first+vec.first*2/3, p1.second+vec.second*2/3);
point vec1 = make_pair(vec.first/3, vec.second/3);
point u = make_pair(s.first+cos(60*M_PI/180)*vec1.first-sin(60*M_PI/180)*vec1.second, s.second+sin(60*M_PI/180)*vec1.first+cos(60*M_PI/180)*vec1.second);
makeCurve(p1, s, n-1);
makeCurve(s, u, n-1);
makeCurve(u, t, n-1);
makeCurve(t, p2, n-1);
}
else if(n==0){
points.push_back(p1);
}
} | 0 | 97,828,147 |
#include <iostream>
#include <numeric>
#define MAX 1000000
using namespace std;
int main() {
bool prime[MAX];
fill(prime, prime + MAX, true);
prime[0] = prime[1] = false;
for (int i = 2; i * i < MAX; i++) {
for (int j = 2; i * j < MAX; j++) {
if (!prime[i * j]) {
continue;
}
prime[i * j] = false;
}
}
int n, count;
while (cin >> n) {
count = 0;
for (int i = 2; i <= n; i++) {
if (prime[i]) {
count++;
}
}
cout << count << endl;
}
return 0;
} | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
class UnionFind {
public:
vector <int> par;
vector <int> siz;
UnionFind(int sz_): par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) {
return root(x) == root(y);
}
int size(int x) {
return siz[root(x)];
}
};
ll modPow(ll x, ll n, ll mod = MOD){
ll res = 1;
while(n){
if(n&1) res = (res * x)%mod;
res %= mod;
x = x * x %mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000+10
bool sieve[SIEVE_SIZE];
void makeSieve(){
for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;
sieve[0] = sieve[1] = false;
for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;
}
bool isprime(ll n){
if(n == 0 || n == 1) return false;
for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;
return true;
}
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
inline long long mod(long long a, long long m) {
return (a % m + m) % m;
}
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m);
}
ll GCD(ll a, ll b){
if(b == 0) return a;
return GCD(b, a%b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for(int i=0; i<A.size(); ++i){
for(int k=0; k<B.size(); ++k){
for(int j=0; j<B[0].size(); ++j){
C[i][j] = (C[i][j] + A[i][k] * B[k][j] %MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for(int i=0; i<A.size(); ++i){
B[i][i] = 1;
}
while(n > 0) {
if(n & 1) B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N; cin >> N;
vector<int> a(N);
map<int, int> mp;
set<int> st;
REP(i,N) cin >> a[i], st.insert(a[i]);
int ct = 1;
for(auto e: st){
mp[e] = ct;
ct++;
}
REP(i,N) a[i] = mp[a[i]];
int cnt = 0;
for(int i=1; i<=N; i++){
if(a[i-1]%2 != i%2) cnt++;
}
cout << cnt /2 << endl;
return 0;
} | 0 | 56,846,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(12);
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
double L = 0;
L = sqrt((x2 - x1)*(x2-x1) + (y2 - y1)*(y2-y1));
cout << L << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k,d,x,cnt=0;
cin >> n >> k;
bool a[n+1] = {false};
for(int i=0;i<k;i++){
cin >> d;
for(int j=0;j<d;j++){
cin >> x;
a[x]=true;
}
}
for(int i=1;i<n+1;i++)
if(a[i]==false)
cnt++;
cout << cnt;
return 0;
} | 0 | 91,571,380 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
bool flag = false;
int pos = 0;
for(int i = 1; i <= n; i++)
{
sum += i;
if(n == sum)
{
flag = true;
pos = i;
break;
}
}
if(!flag)
{
cout << "No" << endl;
return 0;
}
vector<vector<int>> ans(pos+1);
int i = 1;
int x = pos;
int cur = 1;
while(cur <= n)
{
for(int j = 1; j <= x; j++)
{
ans[pos-x].push_back(cur);
ans[pos-x+j].push_back(cur);
cur++;
}
x--;
}
cout << "Yes" << endl;
cout << pos+1 << endl;
for(int i = 0; i <= pos; i++)
{
cout << pos << " ";
for(int j = 0; j < pos; j++)
{
cout << ans[i][j] << " ";
}
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void YN(bool flg){if(flg) cout << "YES" << endl; else cout << "NO" << endl;}
void Yn(bool flg){if(flg) cout << "Yes" << endl; else cout << "No" << endl;}
void yn(bool flg){if(flg) cout << "yes" << endl; else cout << "no" << endl;}
const double PI=acos(-1.0);
int main()
{
int h, w;
cin >> h >> w;
string c[2*h];
rep(i, h) cin >> c[i];
rep(i, 2*h) {
rep(j, w) {
cout << c[i/2][j];
}
cout << endl;
}
return 0;
} | 0 | 99,017,716 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define revp(i,a,b) for(int i=b;i>=a;i--)
string s;
int main()
{
cin>>s;
rep(i,0,s.length()-1)
{
if(s[i]!=',')
cout<<s[i];
else
cout<<" ";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
ll s;
cin >> s;
if(s <= 1000000000){
cout << 0 << " " << 0 << " " << 1 << " " << 0 << " " << 1 << " " << s << endl;
}
else{
ll x,y;
if(s % 1000000000 == 0){
y = s / 1000000000; x = 0;
}
else{
y = (s / 1000000000) + 1; x = 1000000000 * y - s;
}
cout << "0 0 " << "1000000000 1 "<< x << " " << y << endl;
}
return 0;
} | 0 | 28,042,659 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll n,h,w,cnt=0;
cin >> n >> h >> w;
ll a[n],b[n];
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
if(a[i]>=h&&b[i]>=w){
cnt++;
}
}
cout << cnt<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
int y,m,d;
cin>>y>>m>>d;
int ans=0;
int ty=1000-y-1;
ans+=(20*20+19*10)*(ty/3);
if(ty%3==1) ans+=20*10;
else if(ty%3==2) ans+=20*15+19*5;
if(y%3==0)
{
ans+=20*(10-m);
ans+=21-d;
}
else
{
ans+=39*((10-m)/2);
if(m%2) ans+=19+21-d;
else ans+=20-d;
}
cout<<ans<<endl;
}
return 0;
} | 0 | 47,121,090 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll i,fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=0,i=0;while(n/10>0){i++;d++;}return d;}
llfor;ll ans=0;
int main(){
char s[30];
cin>>s;
ll n=strlen(s);
map<char,ll>map;
if(n!=26){
rep(i,0,n){
map[s[i]]++;
}
cout<<s;
rep(i,0,26){
if(map[i+'a']==0){
char c='a'+i;
cout<<c<<endl;
return 0;
}
}
}
char t[30]="zyxwvutsrqponmlkjihgfedcba";
if(!strcmp(s,t)){
char c[5]="-1";
pr(c);
return 0;
}
ll k=0,m;
rrp(i,n,0){
map[s[i]]++;
ll mx=s[i]-'a';
rep(j,mx+1,26){
if(map['a'+j]!=0){
s[i]='a'+j;
rep(k,0,i+1){
cout<<s[k];
}
pnn;return 0;
}
}
}
return 0;} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e18,MOD=1e9+7;
int main(){
string s;
cin>>s;
int cnt=0;
for(int i=0;i<s.length();i++){
if(s[i]=='o')cnt++;
}
if(s.length()==15){
if(cnt>=8)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
else{
if(cnt>=(int)s.length()-7)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
} | 0 | 37,199,563 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define debug(x) cerr <<__LINE__<< ": " <<#x<< " = " << x << endl
#define debug_vec(v) cerr<<__LINE__<<": "<<#v<<" = ";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
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 int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
string s, t;
cin >> s >> t;
cout << t << s << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int main()
{
string s;
cin >> s;
int L = s.size(), ans = 0;
stack<char> st;
for(int i = 0; i < L; i++){
if(!st.size()){
st.push(s[i]);
continue;
}
char c = st.top();
if((c == '0' && s[i] == '1') || (c == '1' && s[i] == '0'))
st.pop(), ans += 2;
else
st.push(s[i]);
}
cout << ans << '\n';
return 0;
} | 0 | 22,288,358 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdint>
#include <bitset>
#include <vector>
#include <thread>
#include <stack>
#include <map>
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
vector<string> vs(n);
for (int i = 0; i < n; i++)
{
cin >> vs[i];
}
sort(vs.begin(), vs.end());
for (auto s : vs)
cout << s;
} | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
#define ll long long
#define all(x) x.begin(), x.end()
#define mset(v, a) memset(v, a, sizeof(v))
#define pll pair< ll, ll >
#define pdd pair< double, double >
#define ff first
#define ss second
#define pi acos(-1.0)
#define mxN 2010
#define inf 1e14
#define MOD 1000000007
int main()
{
ll n;
cin >> n;
vector<ll> v;
for(ll i = 0; i < n; i++)
{
ll x;
cin >> x;
ll y = x-(i+1);
v.pb(y);
}
sort(all(v));
ll b = v[n/2];
ll ans = 0;
for(ll i = 0; i < n; i++)
{
ans+=abs(v[i]-b);
}
cout << ans;
} | 0 | 75,046,595 |
#include <bits/stdc++.h>
using namespace std;
int a,b;
#define For(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) For(i,0,n)
#define F first
#define S second
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF=1e17;
ll gcd(ll x,ll y){
return y? gcd(y,x%y):x;
}
int main(){
ll n,a=0;
cin>>n;
for(int i=pow(n,0.5);i>0;i--){
if(n%i==0){a=i;break;}
}
cout<<to_string(n/a).length()<<endl;
return 0;} | #include<iostream>
#include<string>
#include<queue>
using namespace std;
int main(){
int n;
string w;
priority_queue<int> s;
while(cin>>w && w!="end"){
if(w=="insert"){
cin>>n;
s.push(n);
}
else{
n=s.top();
s.pop();
cout<<n<<endl;
}
}
} | 0 | 19,535,639 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
int ii() { int x; if (scanf("%d", &x) == 1) return x; }
long long il() { long long x; if (scanf("%lld", &x) == 1) return x; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define gcd __gcd
int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size)
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
ld to_deg(ld rad){
return rad * ((ld)(180) / PI);
}
int main(){
ll A, B, X;
cin >> A >> B >> X;
ld a = ld(A);
ld b = ld(B);
ld x = ld(X);
ld ans;
if (a * b / 2 > x / a){
ans = atan2(b, x * 2 / (a * b) );
}
else{
ans = atan2(b * 2 - (2 * x / a / a), a);
}
od_nosp(to_deg(ans)); br();
} | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
const dd PI = 3.1415926435;
class UnionFind
{
public:
UnionFind(int N) : par(N)
{
for (ll i = 0; i < N; i++)
{
par[i] = i;
}
}
int root(int x)
{
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y)
{
int rx = root(x);
int ry = root(y);
return rx == ry;
}
private:
vector<int> par;
};
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
ll fact(ll n)
{
if (n == 0)
{
return 1;
}
if (n == 1)
{
return 1;
}
return n * fact(n - 1) % MOD;
}
ll pow_fast(ll n, ll k)
{
if (k == 0)
{
return 1;
}
if (k == 1)
{
return n;
}
if (k % 2 == 0)
{
ll tmp = pow_fast(n, k / 2LL);
return tmp * tmp % MOD;
}
else
{
ll tmp = pow_fast(n, k / 2LL);
tmp *= tmp;
tmp %= MOD;
return tmp * n % MOD;
}
}
map<ll, ll> sosuu(ll n)
{
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++)
{
while (n % i == 0)
{
res[i] += 1;
n /= i;
}
}
if (n != 1)
{
res[n] += 1;
}
return res;
}
int main()
{
string S;
cin >> S;
bool ok = false;
bool ok2 = false;
bool ok3 = true;
if (S[0] == 'A') {
ok = true;
}
for (ll i = 2; i < S.size() - 1; i++)
{
if (ok2 && S[i] == 'C') {
ok2 = false;
break;
}
if (S[i] == 'C') {
ok2 = true;
}
}
for (ll i = 0; i < S.size(); i++)
{
if (i == 0 || S[i] == 'C') {
continue;
}
if ('a' > S[i] || S[i] > 'z') {
ok3 = false;
}
}
if (ok && ok2 && ok3) {
cout << "AC" << endl;
} else {
cout << "WA" << endl;
}
} | 0 | 68,206,558 |
#include <bits/stdc++.h>
#define Int int64_t
#define pb push_back
using namespace std;
int main()
{
Int N;cin>>N;
vector<Int> A(N);
set<Int> s;
for(auto &x:A) cin>>x,s.insert(x);
Int largest=-1;int find=1;bool found=false;
int i=0,j=0;
while(i<N){
if(A[i]==find){
++find;
found=true;
}
i++;
}
cout<<(!found ? -1:N-find+1)<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(void){
int M,K; cin >> M >> K;
if(M == 0 || M == 1){
if(K == 0){
VI ans(2*(1<<M));
REP(i,ans.size()/2){
ans[2*i] = i;
ans[2*i+1] = i;
}
REP(i,ans.size()) cout << ans[i] << " ";
cout << endl;
}
else{
cout << -1 << endl;
return 0;
}
}
else{
if(K >= (1<<M)){
cout << -1 << endl;
return 0;
}
VI ans;
REP(i,1<<M){
if(i == K) continue;
ans.push_back(i);
}
ans.push_back(K);
RREP(i,1<<M){
if(i == K) continue;
ans.push_back(i);
}
ans.push_back(K);
REP(i,ans.size()) cout << ans[i] << " ";
cout << endl;
}
return 0;
} | 0 | 46,469,209 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
long long mod=1000000007;
for(long long i=K;i<=N+1;i++){
ans+=(N*(N+1)/2-(N-i)*(N-i+1)/2-(i-1)*i/2)+1;
ans%=mod;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define smax(a, b) ((a) < (b) ? ((a)=(b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a)=(b), true) : false)
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MAX = 1e9 + 7;
int n;
bool visited[100001];
vector <int> tree[100001];
pa dpfs(int d)
{
visited[d] = true;
ll wsum = 1;
ll bsum = 1;
for(auto e: tree[d])
{
if(!visited[e])
{
pa t = dpfs(e);
ll w = t.first;
ll b = t.second;
wsum *= w + b;
wsum %= MAX;
bsum *= w;
bsum %= MAX;
}
}
return pa(wsum, bsum);
}
int main() {
cin >> n;
for(int i = 0; i < n-1; i++)
{
int a, b;
cin >> a >> b;
tree[a].push_back(b);
tree[b].push_back(a);
}
pa ans = dpfs(1);
cout << (ans.first + ans.second)%MAX << endl;
return 0;
} | 0 | 26,138,204 |
#include<iostream>
#include<cstdio>
#include<queue>
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
struct P{
int x;
int y;
};
int w,h,n;
const int INF = 1e+8;
char feld[1010][1010];
int d[1010][1010];
int sx,sy,gx,gy;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int ans;
P che[15];
void bfs(){
REP(i,n){
P sp=che[i];
sx=che[i].x;
sy=che[i].y;
gx=che[i+1].x;
gy=che[i+1].y;
REP(y,h)REP(x,w)d[y][x]=INF;
queue<P> que;
que.push(sp);
d[sy][sx]=0;
while(!que.empty()){
P p=que.front();
que.pop();
int x=p.x;
int y=p.y;
if(x==gx&&y==gy){
ans+=d[gy][gx];
break;
}
REP(i,4){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx<0||nx>=w||ny<0||ny>=h)continue;
if(feld[ny][nx]!='X'&&d[ny][nx]==INF){
P next;
next.x=nx;
next.y=ny;
que.push(next);
d[ny][nx]=d[y][x]+1;
}
}
}
}
}
int main(){
cin>>h>>w>>n;
REP(y,h){
REP(x,w){
scanf(" %c",&feld[y][x]);
if(feld[y][x]=='S'){
che[0].x=x;
che[0].y=y;
}else if(feld[y][x]>='1'&&feld[y][x]<='9'){
char c=feld[y][x];
che[c-'0'].x=x;
che[c-'0'].y=y;
}
}
}
bfs();
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, m, k;
cin >> n >> m >> k;
bool flag = false;
rep(i, n + 1) {
rep(j, m + 1) {
if (j * (n - i) + i * (m - j) == k)
flag = true;
}
}
flag ? cout << "Yes" : cout << "No";
cout << endl;
return 0;
} | 0 | 82,807,345 |
#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, b;
cin>> a >> b;
if(a%3 == 0 || b%3 == 0 || (a+b)%3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
typedef long long int lint;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(all(a));
int num_minus = lower_bound(all(a), 0) - a.begin();
int minus_part, plus_part;
if (num_minus >= n - 1) {
minus_part = n - 2;
plus_part = 0;
} else if (num_minus >= 1) {
minus_part = num_minus - 1;
plus_part = n - num_minus - 1;
} else {
minus_part = 0;
plus_part = n - 2;
}
int ans = a[n - 1] - a[0];
for (int i = 1; i < n - 1; i++) {
if (i <= minus_part) {
ans -= a[i];
} else {
ans += a[i];
}
}
cout << ans << endl;
int p = a[n - 1], r = a[0];
queue<int> q, s;
for (int i = 1; i <= minus_part; i++) {
q.push(a[i]);
}
for (int i = minus_part + 1; i < n - 1; i++) {
s.push(a[i]);
}
while (!q.empty()) {
int now = q.front();
q.pop();
cout << p << " " << now << endl;
p = p - now;
}
while (!s.empty()) {
int now = s.front();
s.pop();
cout << r << " " << now << endl;
r = r - now;
}
cout << p << " " << r << endl;
} | 0 | 96,856,770 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, m;
cin >> n >> m;
vector< vector<P> > city(n+1);
for(int i=1; i<=m; i++){
int p, y;
cin >> p >> y;
city[p].push_back(make_pair(y, i));
}
for(int j=1; j<=n; j++){
sort(city[j].begin(), city[j].end());
}
vector<P> ans(m+1);
for(int j=1; j<=n; j++){
for(int i=1; i<=city[j].size(); i++){
ans[city[j][i-1].second] = make_pair(j, i);
}
}
for(int i=1; i<=m; i++){
string left = to_string(ans[i].first);
while(left.length() < 6){
left = "0" + left;
}
string right = to_string(ans[i].second);
while(right.length() < 6){
right = "0" + right;
}
cout << left << right << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll long long
#define INF 1000000000000000000
#define MOD 998244353
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define uid uniform_int_distribution <int>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> A(n);
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
mx = max(mx, A[i]);
}
int closeHalf = MOD, sec = -1;
for (int i = 0; i < n; i++) {
if(A[i] != mx) {
if(abs(A[i] - mx / 2) < closeHalf) {
sec = A[i];
closeHalf = abs(A[i] - mx / 2);
}
}
}
cout << mx << " " << sec;
} | 0 | 9,284,598 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b[51],cnt=0;
cin>>a;
for (int i=0;i<a;i++)
cin>>b[i];
for (int i=0;i<a;i++)
for (int n=i+1;n<a;n++)
cnt+=b[i]*b[n];
cout<<cnt;
return 0;
} | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Edge {
int to, cost;
Edge(int to, int cost) : to(to), cost(cost) {}
};
typedef vector<vector<Edge> > AdjList;
AdjList graph;
vector<int> dist;
int solve(){
int a,b,c,k,ans;cin>>a>>b>>c>>k;
ans=a-b;
if(k%2==1)ans*=-1;
cout << ans << endl;
return 0;
}
signed main() {
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} | 0 | 96,548,337 |
#include <cstdio>
using namespace std;
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a < b){
printf("a < b\n");
}
else if(a > b){
printf("a > b\n");
}
else{
printf("a == b\n");
}
return 0;
} | #include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define pb push_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef pair<ll,ll> pll;
#define br "\n"
#define ff first
#define ss second
#define MAX 1000003
ll mod = 1e9 + 7;
vll prime(MAX,0);
void sieve()
{
prime[0] = prime[1] = 1;
for (ll i = 2; i < MAX; i++) {
if (prime[i] == 0) {
for (ll j = i * 2; j < MAX; j += i) {
if (prime[j] == 0) {
prime[j] = i;
}
}
prime[i] = i;
}
}
}
void solve(){
ll n;
cin >> n;
ll ans=0;
rep(i,1,n){
ll x = n - i;
if(x == 1){
ans += 1;
continue;
}
if(x == 0) {
continue;
}
map<ll,ll> m;
while(x != 1){
m[prime[x]]++;
x /= prime[x];
}
ll temp=1;
for(auto x:m){
temp *= (x.ss + 1);
}
ans += temp;
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t = 1;
sieve();
rep(i,0,t){
solve();
}
} | 0 | 76,549,426 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> takahashi(n);
ll sum = 0;
for(int i = 0; i < n; i++){
ll a, b;
cin >> a >> b;
takahashi[i] = a+b;
sum-=b;
}
sort(takahashi.begin(), takahashi.end(), greater<long long>());
for(int i = 0; i < n; i++){
if(i%2 == 0){
sum += takahashi[i];
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
int main() {
int N, M, K;
cin>>N>>M>>K;
int number;
int check=0;
rep(i, N+1){
rep(j, M+1){
number=M*i+N*j-2*i*j;
if(number==K){
check=1;
goto move;
}
}
}
move:;
if (check==1){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 0 | 91,850,070 |
#include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) { x+=y; y=x-y; x-=y; }
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int m = 100000;
for (int i = 0; i < s.size()-2; i++) {
int v = s[i]*100+s[i+1]*10+s[i+2]-'0'*(111);
if (abs(753-v) < m) m = abs(753-v);
}
cout << m << ende;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
string s, t;
cin >> s >> t;
string ans = "No";
rep(i, s.size()) {
if (s==t) ans = "Yes";
char c = s[0];
s.erase(s.begin());
s += c;
}
cout << ans << endl;
return 0;
} | 0 | 985,351 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v.begin(),unique(v.begin(),v.end())))
#define all(x) (x).begin(),(x).end()
#define pof pop_front
#define ios ios_base::sync_with_stdio(0);cin.tie();cout.tie();
#define scn scanf
#define prt printf
#define rep(i, a, n) for(int i = a; i < n; i++)
#define mod 1000000007
#define yes cout << "YES\n"
#define no cout << "NO\n";
#define take for(auto &it : a) cin >> it;
#define out cout << a << "\n";
#define l_b lower_bound
#define u_b upper_bound
#define Max 100005
template<typename T> T mymax(T x, T y) {
return (x > y ? x : y);
}
using namespace std;
const int N = 2e5 + 5;
void solve() {
long long x, l;
cin >> x >> l;
ll m = x / 2019;
ll k = (m + 1) * 2019;
if(x % 2019 == 0 || k <= l) {
cout << 0 << '\n'; return;
}
ll ans = 1e8;
for(ll i = x; i < l; i++) {
for(ll j = i + 1; j <= l; j++) {
ll prod = ((i % 2019) * (j % 2019)) % 2019;
ans = min(ans, prod);
}
}
cout << ans;
}
int main() {
solve();
return 0;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
ll n, m, k;
cin >> n >> m >> k;
bool r = false;
rep(i, n+1) {
rep(j, m+1) {
if(i*(m-j) + j*(n-i) == k) r = true;
}
}
r ? mes("Yes") : mes("No");
} | 0 | 56,196,343 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b,c;
cin >> a >> b >> c;
c %= a;
map<ll,ll> mp;
mp[c]++;
while(1){
c += b;
c %= a;
mp[c]++;
if(c == 0){
cout << "YES" << endl;
return 0;
}
if(mp[c] > 1){
cout << "NO" << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
ll cnt[101010];
pair<ll,int> P[101010];
int main(){
int N; cin>>N;
map<ll,int> mp;
rep(i,N){
ll a; cin>>a;
P[i]=make_pair(a,-(i+1));
mp[a]++;
}
sort(P,P+N);
reverse(P,P+N);
P[N]=make_pair(0,-N);
int ind=0;
ll sum=0;
while(ind<N){
ll f=P[ind].first;int s=-P[ind].second;
sum+=mp[f];
int next=min(N,ind+mp[f]);
ll f2=P[next].first;int s2=-P[next].second;
cnt[s]+=max(1LL,f-f2)*sum;
if(s<s2) P[next]=make_pair(f2,-s);
ind=next;
}
for(int i=1;i<=N;i++) cout<<cnt[i]<<endl;
return 0;
} | 0 | 93,982,344 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};
signed main()
{
int W, H;
char mas[25][25];
while(cin >> W >> H, W || H) {
queue < Pi > que;
int ans = 1;
Rep(i, H) Rep(j, W) {
cin >> mas[i][j];
if(mas[i][j] == '@') {
que.push(Pi(i, j));
mas[i][j] = '#';
}
}
while(!que.empty()) {
Pi d = que.front(); que.pop();
int y = d.fi, x = d.se;
Rep(i, 4) {
int ny = y + my[i], nx = x + mx[i];
if(ny < 0 || nx < 0 || ny >= H || nx >= W || mas[ny][nx] == '#') continue;
ans++, mas[ny][nx] = '#';
que.push(Pi(ny, nx));
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
rep(i,N) {
ll tmp; cin >> tmp;
a[i] = tmp - 1;
}
ll ansi = 0;
ll ans = 0;
rep(i,N) {
ans++;
if (a[ansi] == 1) {
cout << ans << endl;
exit(0);
}
ansi = a[ansi];
}
cout << -1 << endl;
} | 0 | 74,311,965 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int six(int k) {
if(k==0) return 0;
int num = 1;
while(1) {
if(k < num * 6) break;
num*=6;
}
int cnt = 0;
while(1) {
if(num > k) {
num/=6;
continue;
}
int ans = k/num;
cnt += ans;
k -= ans * num;
num/=6;
if(k==0) break;
}
return cnt;
}
int nine(int k) {
if(k==0) return 0;
int num = 1;
while(1) {
if(k < num * 9) break;
num*=9;
}
int cnt = 0;
while(1) {
if(num > k) {
num/=9;
continue;
}
int ans = k/num;
cnt += ans;
k -= ans * num;
num/=9;
if(k==0) break;
}
return cnt;
}
int main() {
int n;cin>>n;
ll ans = 100010;
rep(i,n+1) {
ans = min(ans,ll(six(i)+nine(n-i)));
}
cout<<ans<<endl;
} | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a < b)
if (b < c) cout << "Yes\n";
else cout << "No\n";
else
cout << "No\n";
} | 0 | 32,247,578 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N, K;
cin >> N >> K;
if(K == 1) K = N;
cout << max(N - K, 0) << endl;
} | # include <bits/stdc++.h>
using namespace std;
# define int long long
int d,s,h,q,n,p;
signed main()
{
scanf("%lld%lld%lld%lld\n",&q,&h,&s,&d);
scanf("%lld\n",&n);
p=min(min(q*8,h*4),s*2);
if(d<p){
if(n%2==1)printf("%lld\n",(n-1)/2*d+p/2);
else printf("%lld\n",n/2*d);
}
else printf("%lld\n",p/2*n);
return 0;
} | 0 | 745,468 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(X))
#define all(X) (X).begin(), (X).end()
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
void solve(long long n, std::vector<long long> a) {
sort(all(a));
ll num = a[n - 1];
ll minDiff = 1e10;
ll r = a[0];
rep(i, n - 1) {
ll tmp = abs(a[i] - (num - a[i]));
if (tmp < minDiff) {
minDiff = tmp;
r = a[i];
}
}
print(num << " " << r);
}
int main() {
long long n;
scanf("%lld", &n);
std::vector<long long> a(n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
solve(n, std::move(a));
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main(){
int n,q;
cin >> n >> q;
vector<int> value(n+1);
vector<vector<int>> G(n+1);
rep(i,n-1){
int a,b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i,q){
int a,b;
cin >> a >> b;
value[a] += b;
}
queue<int> q1;
q1.push(1);
vector<bool> visited(n+1,false);
while(!q1.empty()){
int nq = q1.front();
q1.pop();
visited[nq] = true;
rep(i,G[nq].size()){
if(visited[G[nq][i]] == true) continue;
value[G[nq][i]] += value[nq];
q1.push(G[nq][i]);
}
}
for(int i = 1;i <= n;i++) cout << value[i] << " ";
cout << endl;
} | 0 | 73,855,532 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#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++)
int main() {
int n, i = 0,ans=1,m;
cin >> n;
vector <int>a(n),k(1000000,0);
rep(i, n) {
cin >> a.at(i);
}
m = a.at(0);
while (1) {
if (ans>=n) {
cout << -1 << endl;
return 0;
}
if (m == 2) {
cout << ans << endl;
return 0;
}
m = a.at(m - 1);
ans++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K, long long S) {
if (S == 1e9) {
rep(i, N) {
if (i < K) {
cout << S << " ";
} else {
cout << 1 << " ";
}
}
} else {
rep(i, N) {
if (i < K) {
cout << S << " ";
} else {
cout << S + 1 << " ";
}
}
}
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
long long S;
scanf("%lld", &S);
solve(N, K, S);
return 0;
} | 0 | 78,544,876 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int N, K; cin >> N >> K;
if(N % K == 0){
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#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;
signed main() {
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int ans = 0;
REP(k, N){
bool flag = true;
REP(i, N) REP(j, N){
if(s[(i+k)%N][j] != s[(j+k)%N][i]) flag = false;
}
if(flag) ans += N;
}
cout << ans << endl;
return 0;
} | 0 | 96,111,269 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
while (true){
int i,S=0;
char x[1000] = { 0 };
cin >> x;
for (i = 0; i < 1000; i++){
if (x[i] == '\n'){ break; }
switch (x[i]){
case '0':S = S + 0;
break;
case '1':S = S + 1;
break;
case '2':S = S + 2;
break;
case '3':S = S + 3;
break;
case '4':S = S + 4;
break;
case '5':S = S + 5;
break;
case '6':S = S + 6;
break;
case '7':S = S + 7;
break;
case '8':S = S + 8;
break;
case '9':S = S + 9;
break;
}
}
if (S == 0){ break; }
cout << S << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
for (int A=1;A<=9;A++){
for (int B=1;B<=9;B++){
cout<<A<<'x'<<B<<'='<<A*B<<endl;
}
}
return 0;
} | 0 | 94,390,724 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) {return 0 <= a ? a : -a;}
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr)
{
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr)
{
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void)
{
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void)
{
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void)
{
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
}
}
}
}
typedef struct {
vector<DWORD> vdwPar;
vector<DWORD> vdwRank;
vector<DWORD> vdwCnt;
DWORD dwSize;
void initUnionFind(
DWORD dwSize)
{
dwSize = dwSize;
vdwPar.resize(dwSize);
vdwRank.resize(dwSize);
vdwCnt.resize(dwSize);
for (DWORD dwIdx = 0; dwIdx < dwSize; dwIdx++) {
vdwPar[dwIdx] = dwIdx;
vdwRank[dwIdx] = 0;
vdwCnt[dwIdx] = 1;
}
}
DWORD ufGetCnt(DWORD sqIdx) {
return vdwCnt[ufGetParent(sqIdx)];
}
DWORD ufGetParent(DWORD dwIdx) const
{
return vdwPar[dwIdx];
}
DWORD ufGetRank(DWORD dwIdx) const
{
return vdwRank[dwIdx];
}
void ufSetParent(DWORD dwIdx, DWORD dwParent)
{
vdwPar[dwIdx] = dwParent;
if (ufGetRank(dwIdx) == ufGetRank(dwParent)) {
(vdwRank[dwParent])++;
}
}
DWORD ufGetRoot(DWORD dwIdx) const
{
if (ufGetParent(dwIdx) == dwIdx) {
return dwIdx;
} else {
DWORD dwParent = ufGetParent(dwIdx);
DWORD dwRoot = ufGetRoot(dwParent);
return dwRoot;
}
}
bool ufUnite(DWORD dwX, DWORD dwY)
{
DWORD dwRootX = ufGetRoot(dwX);
DWORD dwRootY = ufGetRoot(dwY);
if (dwRootX == dwRootY) {
return false;
}
if (ufGetRank(dwRootX) < ufGetRank(dwRootY)) {
ufSetParent(dwRootX, dwRootY);
(vdwCnt[dwRootY]) += (vdwCnt[dwRootX]);
} else {
ufSetParent(dwRootY, dwRootX);
(vdwCnt[dwRootX]) += (vdwCnt[dwRootY]);
}
return true;
}
bool ufIsSame(DWORD dwX, DWORD dwY) const
{
return (ufGetRoot(dwX) == ufGetRoot(dwY));
}
} ST_UNION_FIND;
int main(void)
{
ST_UNION_FIND uf;
SQWORD sqN = inputSQWORD();
SQWORD sqM = inputSQWORD();
uf.initUnionFind(sqN);
for (SQWORD sqIdx = 0; sqIdx < sqM; sqIdx++) {
SQWORD sqA = inputSQWORD();
SQWORD sqB = inputSQWORD();
uf.ufUnite(sqA, sqB);
}
SQWORD sqMaxSize = 0;
for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
SQWORD sqSize = uf.ufGetCnt(sqIdx);
sqMaxSize = max(sqMaxSize, sqSize);
}
printf("%lld\n", sqMaxSize);
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
ll gcd(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
int main(){
ll n;
cin>>n;
if(n==1){
cout<<0<<endl;
return 0;
}
vector<ll> cnt;
ll m=n;
for(long long int i=2;i*i<=m && n>1;i++){
if(n%i==0){
ll tmp=0;
while(n%i==0){
tmp++;
n/=i;
}
cnt.push_back(tmp);
}
}
ll ans=0;
if(n!=1) ans++;
n=cnt.size();
rep(i,n){
ll k=0;
while(((k+1)*(k+2))/2 <= cnt[i]){
k++;
}
ans+=k;
}
if(ans==0) ans++;
cout<<ans<<endl;
return 0;
} | 0 | 49,088,094 |
#include <iostream>
using namespace std;
int main() {
while(1) {
int a, b;
cin >> a >> b;
if (a == 0 && b == 0)
return 0;
int krsw[17][17] = {};
int cross[17][17] = {};
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
krsw[x][y] = 1;
}
for(int i = 1; i <= a; i++) {
for(int j = 1; j <= b; j++) {
if(krsw[i][j])
continue;
cross[i][j] = cross[i - 1][j] + cross[i][j - 1];
if(i == 1 && j == 1)
cross[1][1] = 1;
}
}
cout << cross[a][b] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
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()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, h, w;
cin>>n>>h>>w;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
int ans=0;
rep(i,n){
if(a[i]>=h&&b[i]>=w)ans++;
}
cout<<ans<<"\n";
} | 0 | 5,102,711 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
class LCA_weight {
private:
int n;
int D = 30;
vector<int> depth;
vector<vector<pair<int,T>>> hen;
vector<vector<int>> par;
vector<T> dista;
void dfs(int v, int p, int dep, T dep_dist) {
par[v][0] = p;
depth[v] = dep;
dista[v] = dep_dist;
for(auto i : hen[v]) {
if(i.first == p)continue;
dfs(i.first, v, dep + 1, dep_dist + i.second);
}
}
public:
LCA_weight(const vector<vector<pair<int,T>>>& hen):hen(hen) {
n = hen.size();
par.resize(n, vector<int>(D + 1));
depth.resize(n);
dista.resize(n);
dfs(0, -1, 0, 0);
for(int i = 0; i < D; i++) {
for(int j = 0; j < n; j++) {
if(par[j][i] == -1)par[j][i + 1] = -1;
else par[j][i + 1] = par[par[j][i]][i];
}
}
}
int back(int v, int dist) {
for(int i = 0; i < D; i++)if((1 << i) & dist) {
if(v == -1)return v;
v = par[v][i];
}
return v;
}
int get(int u, int v) {
int ret = 0;
if(depth[u] > depth[v])swap(u, v);
ret = depth[v] - depth[u];
v = back(v, ret);
if(u == v)return v;
for(int i = D; i >= 0; i--) {
if(par[u][i] != par[v][i]) {
u = par[u][i];
v = par[v][i];
}
}
return par[u][0];
}
T dist(int u, int v) {
int lca = get(u, v);
return (dista[u] + dista[v]) - dista[lca] * 2;
}
void print(int i) {
cerr << "[";
for(int j = 0; j < n; j++)cerr << par[j][i] << (j == n - 1 ? "" : ",");
cerr << "]";
}
};
int main()
{
int n; cin >> n;
vector<vector<pair<int,ll>>> hen(n);
for(int i = 0; i < n - 1; i++) {
int a, b, c; cin >> a >> b >> c;
a--, b--;
hen[a].emplace_back(b, c);
hen[b].emplace_back(a, c);
}
LCA_weight<ll> lca(hen);
int q, k; cin >> q >> k;
k--;
while(q--) {
int s, t; cin >> s >> t; s--, t--;
cout << lca.dist(s, k) + lca.dist(t, k) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9+7;
constexpr lint mod2 = 998244353;
int main() {
lint n, k, s = 0;
cin >> n >> k;
if(k % 2 == 0){
s += (lint)pow(n/k, 3);
s += (lint)pow((n+k/2)/k, 3);
}
else s += (lint)pow(n/k, 3);
cout << s << endl;
return 0;
} | 0 | 56,895,746 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, 0,-1};
const int dx[]={ 0, 1,1,1,0,-1,-1,-1};
int main()
{
string s;
while(getline(cin,s),s!="."){
for(int i=s.size()-1;i>=0;i--){
if(s[i]!='(' && s[i]!=')' && s[i]!='[' && s[i]!=']') s.erase(s.begin()+i);
}
int pos1,pos2;
while( (pos1=s.find("()"))!=string::npos || (pos2=s.find("[]"))!=string::npos){
if(pos1!=string::npos){
s.replace(pos1,2,"");
continue;
}
if(pos2!=string::npos){
s.replace(pos2,2,"");
continue;
}
}
if(s=="") cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> struct edge { int from, to; T cost;};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
int main() {
int n; cin >>n;
vector<int> a(n); rep(i, n){ cin >>a[i]; a[i]--; }
int res = 0;
rep(i, n) if (a[a[i]] == i) res++;
res /= 2;
cout <<res <<endl;
} | 0 | 9,854,757 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll x, ll y) {
ll r;
while (x%y) {
r = x % y;
x = y;
y = r;
}
return y;
}
ll C(ll N) {
return N * (N - 1) / 2;
}
ll a(ll n, ll x) {
ll r = pow(10, x);
n = (n % r);
n /= pow(10, x - 1);
return n;
}
int main() {
ll N, K; cin >> N >> K;
cout << N - (K-1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define dbg(n) cout<<#n<<' '<<n<<endl;
int power(ll x,ll y){ll res=1;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int main(){
int t;
cin>>t;
map<int,int> mp;
int a[200001];
for(int i=0;i<t;i++){
cin>>a[i];
mp[a[i]]=i;
}
sort(a,a+t);
int count=0;
for(int i=0;i<t;i++){
if(abs(mp[a[i]]-i)%2!=0){count++;}
}
cout<<count/2<<endl;
} | 0 | 23,489,207 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;
#define A_MAX 2000000
#define INVALID -2000000000
int A[A_MAX];
void insert(int i, int* start) {
int parent = i / 2;
if (parent != 0) {
if (*(start+i-1) > *(start+parent-1)) {
int tmp = *(start+i-1);
*(start+i-1) = *(start+parent-1);
*(start+parent-1) = tmp;
insert(parent, start);
}
}
}
void max_heapify(int i, int *start, int n) {
int l = i * 2;
int r = i * 2 + 1;
int largest;
if (l <= n && *(start+l-1) > *(start+i-1)) {
largest = l;
}
else {
largest = i;
}
if (r <= n && *(start+r-1) > *(start+largest-1)) {
largest = r;
}
if (largest != i) {
int tmp = *(start+i-1);
*(start+i-1) = *(start+largest-1);
*(start+largest-1) = tmp;
max_heapify(largest, start, n);
}
}
void extract(int *start, int n) {
int parent = n / 2;
*start = *(start + n - 1);
max_heapify(1, start, n-1);
}
void build_max_heap(int *start, int n) {
for (int i = n/2; i > 0; i--) {
max_heapify(i, start, n);
}
}
void print_queue(int *start, int n) {
for (int i = 0; i < n; i++) {
printf(" %d", *(start+i));
}
printf("\n");
}
int main() {
int* start = A;
int* end = A;
int n = 0;
char order[10];
int key;
while (1) {
scanf("%s", order);
if (strcmp(order, "insert") == 0) {
cin >> key;
*end = key;
n++;
insert(n, start);
end++;
}
else if (strcmp(order, "extract") == 0) {
key = *start;
extract(start, n);
end--;
n--;
cout << key << endl;
}
else if (strcmp(order, "end") == 0) {
break;
}
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
int main(){
int n;
cin >> n;
int p[n];
for(int i=0;i<n;i++) cin >> p[i];
int mi[n];
mi[0]=p[0];
for(int i=1;i<n;i++){
if(mi[i-1]>=p[i]){
mi[i]=p[i];
}else{
mi[i]=mi[i-1];
}
}
int counter=0;
for(int i=0;i<n;i++){
if(p[i]<=mi[i]) counter++;
}
cout << counter << endl;
} | 0 | 40,802,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i <= n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
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 n, m, k;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m >> k;
if (k % n == 0)
return yes, 0;
if (k % m == 0)
return yes, 0;
rep(i, n)
{
rep(j, m)
{
if(k==i*m+j*n-2*i*j)return yes,0;
}
}
no;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int s;
cin >> s;
int ans=1;
vector<int> num;
while(true){
for(int i=0; i<num.size(); i++){
if(num[i]==s){
cout << ans << endl;
return 0;
}
}
num.push_back(s);
if(s%2==0){
s /=2;
}
else if(s%2==1){
s = 3*s+1;
}
ans ++;
}
} | 0 | 23,182,549 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 10007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
struct Dice{
int U, D, N, E, S, W, temp;
Dice (int u, int s, int e, int w, int n, int d) {
U = u; S = s; E = e; W = w; N = n; D = d;
}
void turnN () {
temp = D;
D = N; N = U; U = S; S = temp;
}
void turnE () {
temp = W;
W = D; D = E; E = U; U = temp;
}
void turnS () {
temp = D;
D = S; S = U; U = N; N = temp;
}
void turnW () {
temp = W;
W = U; U = E; E = D; D = temp;
}
void turnRight () {
temp = W;
W = S; S = E; E = N; N = temp;
}
void turnLeft () {
temp = W;
W = N; N = E; E = S; S = temp;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
V<int>a(6);
for(int i=0;i<6;i++)cin>>a[i];
Dice d =Dice(a[0],a[1],a[2],a[3],a[4],a[5]);
int n;cin>>n;
for(int i=0;i<n;i++){
int up,front;cin>>up>>front;
while(d.U!=up){
d.turnW();
if(d.U==up)break;
d.turnW();
if(d.U==up)break;
d.turnW();
if(d.U==up)break;
d.turnW();
if(d.U==up)break;
d.turnS();
if(d.U==up)break;
d.turnS();
}
while(d.S!=front)d.turnLeft();
cout<<d.E<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
ll ans = 1e12;
for(int i = 0; i < 1<<n; i++)
{
int count = __builtin_popcount(i);
if(count != k) continue;
ll cost = 0;
int h = 0;
for(int j = 0; j < n; j++)
{
if(i >> j & 1)
{
if(a[j] <= h)
{
cost += h - a[j] + 1;
h++;
}
else
{
h = a[j];
}
}
else h = max(h, a[j]);
}
ans = min(ans, cost);
}
cout << ans << endl;
} | 0 | 40,851,129 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#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;
signed main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
int ans = 0;
int sum = 0;
int right = 0;
REP(left, N){
while(right < N && (sum^A[right]) == sum+A[right]){
sum += A[right];
right++;
}
ans += right-left;
sum -= A[left];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
int n;
cin>>n;
for(int i=1;;i++){
if(i*(i+1)>=2*n){
for(int j=1;j<=i;j++){
if(j!=i*(i+1)/2 - n){
cout<<j<<endl;
}
}
return 0;
}
}
} | 0 | 21,739,031 |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <bitset>
#include <numeric>
using namespace std;
const long double PI = 3.14159265358979323846264338327950;
const double EPS = 1e-9;
const long long N = 1e9;
template <class T> T gcd(T a, T b) {
if (b == 0) { return a; }
return gcd(b, a % b);
}
template <class T> bool isPrime(T x) {
for (T d = 2; d * d <= x; d++) { if (x % d == 0) return false; }
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
if (s < t) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;
int main()
{
string str = "";
getline (cin, str );
stringstream ss(str);
vector <int> num(5, 0);
int i;
for (i = 0; i < 5; ++i){
ss >> num[i];
}
sort (num.begin(), num.end(), greater<int>() );
for (i = 0; i < 5; ++i){
cout << num[i];
if (i != 4){
cout << ' ';
}
}
cout << endl;
return 0;
} | 0 | 5,550,165 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >>A;
if(A<1200)cout << "ABC" <<endl;
else cout << "ARC"<<endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); i < (n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int n, m; cin >> n >> m;
vector<pll> drinks(n);
rep(i, n){
ll a, b; cin >> a >> b;
drinks[i] = pll(a, b);
}
sort(all(drinks));
ll res = 0, cnt = 0;
rep(i, n){
if(m - cnt > drinks[i].second){
res += drinks[i].first * drinks[i].second;
cnt += drinks[i].second;
}else{
res += (m - cnt) * drinks[i].first;
break;
}
}
cout << res << ln;
} | 0 | 55,989,169 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INPUT() freopen("input.txt", "r", stdin)
#define OUTPUT() freopen("output.txt", "w", stdout)
#define F first
#define S second
template<typename T>T gcd(T x, T y) { if (y == 0)return x; else return gcd(y, x%y);}
template <class T> T euclideanDistance(T x1 , T x2 , T y1 , T y2){return sqrt(( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ));}
template <class T> T digitSum(T n){T sum = 0;while(n > 0)sum += n % 10,n /= 10;return sum;}
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
const double INF = 1e+9;
const double INFLL = 1e+18;
const double EPS = 1e-9;
const double PI = acos(-1);
const int knightDir[8][2] = {{-2,-1},{-2,1},{-1,2},{1,2},{2,-1},{2,1},{-1,-2},{1,-2}};
const int dx[] = {0 , 1 , 0 , -1};
const int dy[] = {1 , 0 , -1 , 0};
#define MAX 2000005
const ll MOD = 1000000000 + 7;
char str[MAX+10];
int dp[MAX],n;
std::map<int,int>::iterator it;
int ans;
int main()
{
ll n , k;
scanf("%lld%lld",&n,&k);
for(int i = 0 ;i < n ; i++)
{
scanf("%d",&dp[i]);
}
vector<int> m,d;
int cnt = 0, cnt2 = 0;
for(int i = 0 ; i < n ; i++)
{
for(int j = i+1 ; j < n ; j++)
{
if(dp[j] < dp[i])cnt++;
}
for(int j = 0 ; j < i ; j++)
{
if(dp[j] < dp[i])cnt2++;
}
}
ll ans = 0;
ll temp = (k * (k+1))/2L;
temp -= k;
temp = temp%MOD;
ans += ((temp+k)*cnt)%MOD;
ans += (temp*cnt2)%MOD;
printf("%lld\n",ans%MOD);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
int l = 0;
int r = N-1;
vi seat(N,-1);
cout << l << endl << flush;
string s;
cin >> s;
if(s == "Vacant") {
return 0;
}
seat[l] = s == "Male";
cout << r << endl << flush;
cin >> s;
if(s == "Vacant") {
return 0;
}
seat[r] = s == "Male";
while(1) {
int m = (l+r)/2;
cout << m << endl << flush;
cin >> s;
if(s == "Vacant") return 0;
bool male = s == "Male";
seat[m] = male;
if((seat[l] && male) || (!seat[l] && !male)) {
if((m-l)%2 != 0) {
r = m;
continue;
}
}
if((seat[l] && !male) || (!seat[l] && male)) {
if((m-l)%2 == 0) {
r = m;
continue;
}
}
if((seat[r] && male) || (!seat[r] && !male)) {
if((r-m)%2 != 0) {
l = m;
continue;
}
}
if((seat[r] && !male) || (!seat[r] && male)) {
if((r-m)%2 == 0) {
l = m;
continue;
}
}
}
return 0;
} | 0 | 57,430,582 |
#define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>
using namespace std;
int main(){
int a[10];
for (int i = 0; i < 10; i++){
cin >> a[i];
}
sort(a, a + 10);
reverse(a, a + 10);
for (int i = 0; i < 3; i++){
cout << a[i] << endl;
}
} | #include <iostream>
using namespace std;
int P[10010];
int n,q;
int root(int a) {
if (P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b) {
P[root(a)] = root(b);
}
int main() {
int x,y,num,check;
cin >> n >> q;
for (int j = 0; j < n; j++){
P[j] = j;
}
int a[q];
for (int l = 0; l < q; l++){
cin >> num >> x >> y;
if (num == 0){
unite(x,y);
}
else{
a[check] = is_same_set(x,y);
check++;
}
}
for (int t = 0; t < check; t++){
cout << a[t] << endl;
}
} | 0 | 31,644,104 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
ll dp[50][3000];
int main()
{
fast;
ll a,b,h;
cin>>a>>b>>h;
set<ll>s={a,b,h};
cout<<s.size();
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
ll ans = 0;
ll t = 0;
ll cand = 0;
for (int i = 30; i >= 1; i--) {
if (((K >> i) & 1) == 0) continue;
t += (1 << i) - 1;
cand = 0;
for (int j = 0; j < N; j++) {
if ((A[j] | t) == t) cand += B[j];
}
ans = max(ans, cand);
t += 1;
}
cand = 0;
for (int j = 0; j < N; j++) {
if ((A[j] | K) == K) cand += B[j];
}
ans = max(ans, cand);
cout << ans << endl;
return 0;
} | 0 | 92,534,823 |
#include<iostream>
using namespace std;
int main() {
int n, i = 0;
cin >> n;
for (i = 1; i < 370; ++i) {
if (i * n % 360 == 0)break;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
int main(){
int n, m; cin >> n >> m;
vector<int> S(n);
rep(k, m){
int tmp; cin >> tmp;
rep(i, tmp){
int a; cin >> a; a--;
S[a] |= 1 << k;
}
}
int p = 0;
rep(i, m){
int tmp; cin >> tmp;
p |= tmp << i;
}
int success = 0;
rep(bit, (1<<n)){
int ok = 0;
rep(i, n){
if (bit >> i & 1){
ok ^= S[i];
}
}
if (ok == p) success ++;
}
cout << success << endl;
} | 0 | 10,971,547 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
double x[4],y[4];
for(int j=0;j<4;j++)
cin>>x[j]>>y[j];
if(abs((x[3]-x[2])*(y[1]-y[0])-(x[1]-x[0])*(y[3]-y[2]))<1e-10)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
using namespace std;
typedef long long LL;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define F first
#define S second
inline int read(){
int x = 0; char ch = getchar(); bool positive = 1;
for (; !isdigit(ch); ch = getchar()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(int a){
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(int a){
if(a<0){
a=-a; putchar('-');
}
write(a); puts("");
}
#include<string>
string s;
int dp[1<<26],sum,oo=10000005;
int main(){
cin>>s;
for(int i=1;i<(1<<26);i++)dp[i]=oo;
for(int i=0;i<s.length();i++){
sum^=1<<(s[i]-'a');
for(int j=0;j<26;j++)dp[sum]=min(dp[sum],dp[sum^(1<<j)]+1);
}
if(sum==0)writeln(1); else writeln(dp[sum]);
} | 0 | 53,983,106 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N, M;
int cnt[int(1e5 + 5)];
int main(){
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++){
int L, R; scanf("%d%d", &L, &R);
cnt[L]++; cnt[R + 1]--;
}
int ans = 0;
for (int i = 1; i <= N; i++){
cnt[i] += cnt[i - 1];
if (cnt[i] == M) ans++;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void solve () {
double n;
cin >> n;
vector<int> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double avg = round(sum / n);
long long ans = 0;
for (int i = 0; i < n; i++) {
long long x = avg - a[i];
ans += x * x;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 69,320,451 |
#include <iostream>
#include <string>
#include <cmath>
#include<iomanip>
#include<algorithm>
#include<list>
using namespace std;
int main()
{
int n;
string a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
b[i] = a[i];
}
for (int i = 0; i < n; i++){
for (int j = n - 1; j > i; j--){
if (a[j][1] < a[j - 1][1]){
string tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = tmp;
}
}
}
for (int i = 0; i < n; i++){
if (i < n - 1){
cout << a[i] << " ";
}
else{
cout << a[i] << endl<<"Stable"<<endl;
}
}
for (int i = 0; i < n; i++){
int minj = i;
for (int j = i; j < n; j++){
if (b[j][1] < b[minj][1]){
minj = j;
}
}
string tmp = b[i];
b[i] = b[minj];
b[minj] = tmp;
}
for (int i = 0; i < n; i++){
if (i < n - 1){
cout <<b[i] << " ";
}
else{
cout << b[i] << endl;
}
}
bool flag = true;
for (int i = 0; i < n; i++){
if (a[i] != b[i]){
flag = false;
}
}
if (flag){
cout << "Stable" << endl;
}
else{
cout << "Not stable" << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
const ll INFL = numeric_limits<ll>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
ll factorial(ll n) {
ll res = 1;
for (ll i = 1; i <= n; i++) {
res *= i;
}
return res;
}
bool fn_is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
bool isOK(int index, int key, vector<ll>& a) {
if (a[index] >= key) return true;
else return false;
}
int binary_search(int key, vector<ll>& a) {
int ng = -1;
int ok = a.size();
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key, a)) ok = mid;
else ng = mid;
}
return ok;
}
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (r[x] > r[y]) swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) {
return -r[root(x)];
}
bool same(int x, int y) {
return root(x) == root(y);
}
};
ll calc(ll a, ll b, ll p) {
if (b == 0) {
return 1;
} else if (b % 2 == 0) {
ll d = calc(a, b/2, p);
return (d * d) % p;
} else {
return (a * calc(a, b-1, p)) % p;
}
}
int main()
{
int n, m; cin >> n >> m;
priority_queue<ll> q;
rep(i,n) {
ll a; cin >> a;
q.push(a);
}
ll tmp;
rep(i,m) {
tmp = q.top();
q.pop();
q.push(tmp/2);
}
ll ans = 0;
while (!q.empty()) {
tmp = q.top();
q.pop();
ans += tmp;
}
cout << ans << endl;
} | 0 | 7,888,839 |
#include <iostream>
using namespace std;
int main() {
int N,i,j;
cin >> N;
for(i=0; i<30; i++){
for(j=0;j<30;j++){
if(4*i+7*j==N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
map <int,int> hash;
int n,m,ans=0; cin>>n>>m;
while (n--){
int a,b;
cin>>a>>b;
hash[a] += b;
}
for (auto &it: hash){
if (it.ss<=m) m -= it.ss,ans += it.ss*it.ff ;
else {
ans += m*it.ff;
break;
}
}
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
} | 0 | 99,680,868 |
#include<iostream>
using namespace std;
#include<iomanip>
int main()
{
int a, b, r, d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (a * 1.0) / b;
cout << d << " " << r << " " << fixed << setprecision(10) << f << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
int four = 0;
int num=n;
if(n==1 || n==2 || n==4){
cout << 4 <<endl;
}else{
for(int i=1; i<1000000; i++){
if(num%2==0){
num /= 2;
}else{
num = (num*3)+1;
}
if(num==4){
four++;
}
if(four==2){
cout << i+1 <<endl;
break;
}
}
}
} | 0 | 15,353,415 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n);i++)
#define ll long long
#define llint long long int
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define Pint pair<int,int>
#define keta(a) fixed << setprecision(a)
constexpr auto INF = 1000000000000000000;
constexpr auto mod = 1000000007;
struct edge { int to, cost; };
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (b == 0)return a;
return gcd(b, a % b);
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int size(int a) {
return par[root(a)];
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(){
int n;
cin >> n;
hei(ll) a(n);
rep(i, 0, n) {
cin >> a[i];
a[i] -= (i + 1);
}
sort(a.begin(), a.end());
ll x = a[n / 2];
ll ans = 0;
rep(i, 0, n)ans += abs(x - a[i]);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#include <cstring>
#include <random>
using namespace std;
#define int long long
#define ld long double
#define ull unsigned long long
#define endl '\n'
#define try tr
#define pii pair<int, int>
#define ti tuple <int, int, int>
#define vi vector <int>
#define vpi vector <pii>
#define umap unordered_map
#define uset unordered_set
#define left left11
#define right right11
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define sqr(a) ((a) * (a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define X first
#define Y second
ld TL = 1.0;
bool is_tl = 0;
int CALLS = 0;
inline bool IS() {
if (++CALLS == 1000) {
CALLS = 0;
is_tl |= clock() > (TL - 0.1) * CLOCKS_PER_SEC;
}
return is_tl;
}
template<typename T1, typename T2>
inline void amin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void amax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << ' ' << p.second << endl;
return os;
}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v) os << u << ' ';
os << endl;
return os;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e6 + 7, NS = 2e3 + 7, lg = 19, sq = 550, inf = 2e9 + 7, SM = 1e2 + 7;
const ld eps = 1e-9;
int hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937}, mod = hash_mod[rnd() % 4];
int hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];
void solve() {
int n, x;
cin >> n >> x;
cout << 3 * (n - __gcd(n, x)) << endl;
}
signed main() {
fast
solve();
} | 0 | 93,524,878 |
#include <iostream>
using namespace std;
int a[100005];
int m = 0;
int sum = 0;
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n-1; i++) {
if (a[i] >= a[i + 1]) {
sum++;
if (m < sum) {
m = sum;
}
}
else {
if (m < sum) {
m = sum;
}
sum = 0;
}
}
cout << m << endl;
return 0;
} | #include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(int n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6)
{
if ((n % i == 0) || (n % (i + 2) == 0))
return false;
}
return true;
}
int32_t main()
{
int t=1;
while(t--)
{
int n;
cin >> n;
cout << n*(n-1)/2;
}
} | 0 | 57,608,339 |
#include <iostream>
#include <string>
typedef long long ll;
void print()
{
std::cout << std::endl;
}
template<class T>
void print(T param)
{
std::cout << param << std::endl;
return;
}
template<class T, class... S>
void print(T param1, S... param2)
{
std::cout << param1 << " "; print(std::forward<S>(param2)...);
}
int main()
{
ll A, B, K;
std::cin >> A >> B >> K;
for (ll i = 0; i < K; i++) {
A /= 2;
B += A;
std::swap(A, B);
}
if (K % 2 == 1) {
std::swap(A, B);
}
print(A, B);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int count = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (0 <= z && z <= k) {
count++;
}
}
}
cout << count << endl;
return 0;
} | 0 | 32,562,786 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
int n; cin >> n;
double ans=0,x;
string u;
REP(i,n) {
cin >> x >> u;
ans += u=="JPY" ? x : x*380000;
}
COUT(ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
const int N = 300005;
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
void cs(int &x)
{
cout << "Case #" << x << ": ";
}
bool cmp(string a, string b)
{
return a + b < b + a;
}
int32_t main()
{
fastIO;
int n,k;cin>>n>>k;
vector<int>v(n,0);
while(k--)
{
int x,r;cin>>r;
for(int i=0;i<r;i++)
{
cin>>x;
v[x-1]++;
}
}
int c=0;
for(int i=0;i<n;i++)
if(v[i]==0)
c++;
cout<<c<<endl;
return 0;
} | 0 | 75,084,003 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(a.begin(), a.end());
int ans = a[1]-a[0] + a[2]-a[1];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
bool OK=true;
map<char,int> data;
rep(i,4){
data[S[i]]++;
}
if(data.size()!=2){
OK=false;
}
for(auto p:data){
auto v=p.second;
if(v!=2){
OK=false;
}
}
if(OK==true){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 0 | 85,274,840 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
inline void nprint(){}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&... tail) {
cout << head << endl;
nprint(move(tail)...);
}
#ifdef DEBUG
#define eprint(...) nprint(__VA_ARGS__)
#else
#define eprint(...) if(0==1) cout << 1 << endl;
#endif
#define Yes(a) cout << (a ? "Yes" : "No") << endl
#define YES(a) cout << (a ? "YES" : "NO") << endl
#define POSSIBLE(a) cout << (a ? "POSSIBLE" : "IMPOSSIBLE") << endl
using cmp = complex<double>;
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x,y) (x=max(x,y))
#define mins(x,y) (x=min(x,y))
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORS(i,a,b) FOR(i,a,b+1)
#define REPS(i,n) REP(i,n+1)
#define RFOR(i,a,b) for(ll i = (ll)(b)-1;i >= a;--i)
#define RREP(i,n) RFOR(i,0,n)
#define RREPS(i,n) RREP(i,n+1)
#define RFORS(i,a,b) RFOR(i,a,b+1)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define PERM(c) sort(ALL(c)); for(bool cp = true;cp;cp = next_permutation(ALL(c)))
#define eb(val) emplace_back(val)
const double PI = acos(-1), EPS = 1e-10;
constexpr ll MOD = 1E9+7;
constexpr int dx[] = {1,0,-1,0}; constexpr int dy[] = {0,1,0,-1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p){
return s << "(" << p.first << ", " << p.second << ")";
}
template<class T> istream& operator>>(istream &is,vector<T> &st){
for(size_t i=0;i<st.size();++i) is >> st[i];
return is;
}
template<class T> istream& operator>>(istream &is,vector<vector<T>> &st){
for(size_t i=0;i<st.size();++i) is >> st[i];
return is;
}
template<class T> ostream& operator<<(ostream &os, const vector<T> &st){
for(size_t i=0;i<st.size();++i){
if(i==st.size()-1) os << st[i];
else os << st[i] << " ";
}
return os;
}
template<class T> ostream& operator<<(ostream &os, const vector<vector<T>> &st){
for(size_t i=0;i<st.size();++i){
os << st[i];
if(i!=st.size()-1) os << endl;
}
return os;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n,k;
cin >> n >> k;
if(k==1){
cout << 0 << endl;
return 0;
}
vl a(n);
cin >> a;
vl sum(n+1,0);
REP(i,n) sum[i+1] = (sum[i] + a[i])%k;
REP(i,n+1){
sum[i] -= i%k;
sum[i] = (sum[i]+k)%k;
}
map<ll,ll> mp;
REP(i,min(k,n+1)){
mp[sum[i]]++;
}
ll ans = 0;
REP(i,n+1){
ans += --mp[sum[i]];
if(k+i<n+1){
mp[sum[k+i]]++;
}
}
cout << ans << endl;
} | #include <cstdio>
#define inf -99999999
using namespace std;
int cnt(int x,int y);
int cross[17][17];
int main(void){
int a,b,n,i,j,k,x,y;
for(j=0;j<6;j++){
scanf("%d%d",&a,&b);
if(a==0) return 0;
scanf("%d",&n);
for(i=1;i<17;i++) for(k=1;k<17;k++) cross[i][k]=inf;
for(i=0;i<n;i++){
scanf("%d%d",&x,&y);
cross[x][y]=0;
}
printf("%d\n",cnt(a,b));
}
}
int cnt(int x,int y){
if(x+y==2){
return 1;
}else if(cross[x][y]-inf){
return cross[x][y];
}else if(x==1){
return cnt(x,y-1);
}else if(y==1){
return cnt(x-1,y);
}else return cnt(x,y-1)+cnt(x-1,y);
} | 0 | 93,359,293 |
#include <stdio.h>
int main () {
int angka;
scanf ("%d", &angka);
int x = (angka/100);
int y = (angka - (x*100))/10;
int z = (angka - ((angka/10)*10));
if (x == 7 | y == 7 | z == 7) {
puts ("Yes");
} else puts ("No");
return 0;
} | #pragma GCC optimize("Ofast")
#include<stdio.h>
#include<algorithm>
using namespace std;
int r[105],c[105],dp[105][105]={0};
int main(){
int i,j,k,n,len;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d",&r[i],&c[i]);
for(i=0;i<n-1;i++)
dp[i][i+1]=r[i]*c[i]*c[i+1];
for(len=3;len<=n;len++){
for(i=0;i<n-len+1;i++){
j=i+len-1;
dp[i][j]=2147483647;
for(k=i;k<j;k++){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+r[i]*c[k]*c[j]);
}
}
}
printf("%d\n",dp[0][n-1]);
} | 0 | 6,900,120 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a, Ts... ts) {return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T,typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v){ t = v; }
template<typename T,typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v){ for(auto &e : t) fill_v(e, v); }
const int INF = (int)1e9;
const LL INFL = (LL)1e18;
const int MOD = 1e9 + 7;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> t(n), a(n);
REP(i, n) cin >> t[i];
REP(i, n) cin >> a[i];
vector<bool> c(n), d(n);
c[0] = true;
d[n-1] = true;
REP(i, n-1) if(t[i] != t[i+1]) c[i+1] = true;
REP(i, n-1) if(a[n-i-1] != a[n-i-2]) d[n-i-2] = true;
LL ans = 1;
REP(i, n) if(c[i] && d[i]) if(t[i] != a[i]) ans = 0;
REP(i, n) if(c[i]) if(t[i] > a[i]) ans = 0;
REP(i, n) if(d[i]) if(t[i] < a[i]) ans = 0;
REP(i, n)
{
if(!c[i] && !d[i])
{
ans = ans * min(t[i], a[i]) % MOD;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int N,M;
cin >> N >> M;
vector<priority_queue<int,vector<int>,greater<int>>> p(N+1);
vector<map<int,int>> m(N+1);
vector<pair<int,int>> query(M);
for(int i = 0; i < M ;i++){
int pre,y;
cin >> pre >> y;
query[i] = make_pair(pre,y);
p[pre].push(y);
}
for(int i = 1; i <= N;i++){
if(p[i].empty()) continue;
int k = p[i].size();
for(int count = 1; count <= k; count++){
m[i][p[i].top()] = count;
p[i].pop();
}
}
for(auto pa : query)
printf("%06d%06d\n",pa.first,m[pa.first][pa.second]);
return 0;
} | 0 | 25,169,038 |