code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
int n,d[N],M[N][N];
void dfs(int r) {
queue<int> q;
q.push(r);
for (int i = 0; i < n; i++) d[i] = -1;
d[r] = 0;
int u;
while (!q.empty()) {
u = q.front();
q.pop();
for (int v = 0; v < n; v++) {
if (M[u][v] == 0) continue;
if (d[v] != -1) continue;
d[v] = d[u] + 1;
q.push(v);
}
}
for (int i = 0; i < n; i++) {
cout<<i+1<<" "<<d[i]<<endl;
}
}
int main() {
int u, p, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> p;
u--;
for (int j = 0; j < p; j++) {
cin >> v;
v--;
M[u][v] = 1;
}
}
dfs(0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF=1145141919;
#define debug cout<<"debug"<<endl;
int main(){
int n;
cin>>n;
vector <int> g[n];
for(int i=0;i<n;i++){
int u,k;
cin>>u>>k; u--;
for(int j=0;j<k;j++){
int v;
cin>>v; v--;
g[u].push_back(v);
}
}
int dis[n];
fill(dis,dis+n,INF);
dis[0]=0;
queue <int> bfs;
bfs.push(0);
for(;!bfs.empty();){
int check=bfs.front(); bfs.pop();
for(int i=0;i<(int)g[check].size();i++){
int next=g[check][i];
if(dis[next]>dis[check]+1){
dis[next]=dis[check]+1;
bfs.push(next);
}
}
}
for(int i=0;i<n;i++)
cout<<i+1<<" "<<(dis[i]==INF?-1:dis[i])<<endl;
return 0;
} | 1 | 51,315,011 |
#include <iostream>
#include <complex>
#include <cmath>
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
using namespace std;
typedef complex<double> P;
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
int main(){
double x1,y1,x2,y2,x3,y3,x4,y4;
int n;
P a,b;
for(cin>>n;n>0;n--){
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
a = P(x2-x1,y2-y1);
b = P(x4-x3,y4-y3);
if EQ(cross(a,b),0.0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <complex>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
int is_paralell (P a, P b) {
return EQ ( cross(a, b), 0.0 );
}
int main()
{
string str = "";
int n;
int i,j;
getline (cin, str );
stringstream ssn(str);
ssn >> n;
for (i = 0; i < n; ++i){
P p[4];
getline (cin, str );
stringstream ss(str);
for (j = 0; j < 4; ++j){
ss >> p[j].real() >> p[j].imag();
}
if (is_paralell (p[1] - p[0], p[3] - p[2] ) ) {
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
return 0;
} | 1 | 37,084,912 |
#include<bits/stdc++.h>
using namespace std;
#define ll long
#define ld double
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define setpr(pp) fixed<<setprecision(pp)
#define FOR(I,N) for(I=0;I<N;++I)
#define MS0(x) memset(x,0,sizeof(x))
#define MS1(x) memset(x,-1,sizeof(x))
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod %1000000007
#define pi 3.141592653
#define NL -5000000
vector<ll> adj[100005];
bool vis[100005];
ll dpw[100005];
ll dpb[100005];
void DFS(ll x)
{
vis[x]=1;
ll i,n = adj[x].size();
dpb[x] = dpw[x] = 1;
FOR(i,n)
{
if(vis[adj[x][i]]==0)
{
DFS(adj[x][i]);
dpb[x] = (dpb[x] * dpw[adj[x][i]] )mod;
dpw[x] = ( dpw[x] * (dpw[adj[x][i]] + dpb[adj[x][i]])mod )mod;
}
}
}
int main()
{ IOS;
ll n,i,j,x,y;
cin>>n;
FOR(i,n-1)
{
cin>>x>>y;
adj[x].pb(y);
adj[y].pb(x);
}
MS0(vis);
DFS(1);
cout<<(dpb[1]+dpw[1])mod;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
vector<ll> v[100010];
ll dp[100010][2]={};
ll dfs(ll i,ll par,ll color){
if(dp[i][color]!=0) return dp[i][color];
dp[i][color]=1;
for(auto x:v[i]){
if(x==par) continue;
if(color==0) dp[i][color]*=(dfs(x,i,0)+dfs(x,i,1));
if(color==1) dp[i][color]*=dfs(x,i,0);
dp[i][color]%=mod;
}
return dp[i][color];
}
int main(void){
ll n;
cin>>n;
for(int i=0;i<n-1;i++){
ll x,y;
cin>>x>>y;
x--,y--;
v[x].push_back(y);
v[y].push_back(x);
}
cout<<(dfs(0,-1,0)+dfs(0,-1,1))%mod<<endl;
} | 1 | 36,515,722 |
#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;
vector<int> h(n);
rep(i,n) cin >> h[i];
int dekai=0;
int cnt=0;
rep(i,n){
if(h[i]>dekai){
cnt++;
dekai = h[i];
}
else if(h[i] == dekai) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main (){
int n;
int cont=0;
cin >> n;
int a[n];
bool mayor = true;
for (int i=0; i<n; i++){
cin >> a[i];
for(int j=0;j<=i && mayor; j++){
if (a[j] > a[i]){
mayor = false;
}
}
if (mayor) cont++;
mayor = true;
}
cout << cont;
return 0;
} | 1 | 90,383,316 |
#include<stdio.h>
int main()
{
int x, y;
int num = 1;
while (1)
{
scanf("%d%d", &x, &y);
if (x==0 && y==0)
{
break;
}
if (x <= y)
{
printf("%d %d\n", x, y);
}
else if (x > y)
{
printf("%d %d\n", y, x);
}
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
for (;;)
{
int x,y;
cin >> x >> y;
if (x==0 &&y==0)break;
cout<< min(x,y) << " " << max (x,y)<<endl;
}
} | 1 | 50,351,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,c,d;
cin>>a>>b;
c=max(a,b);
d=min(a,b);
for(ll i=1;i<=c;i++)
{
cout<<d;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char a, b; cin >> a >> b;
if (a <= b)
for (int i = 0; i < b - 48; ++i)
cout << a;
else
for (int i = 0; i < a - 48; ++i)
cout << b;
cout << endl;
} | 1 | 33,806,458 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) rep(testIncrement,0,a.size()) {puts(a[testIncrement]);} cout << endl
#define putrr(a) rep(Incr1,0,a.size()) {rep(Incr2,0,a[Incr1].size()) {puts(a[Incr1][Incr2]);} cout<<endl;} cout<<endl;
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
int main() {
SINT64 N; cin >> N;
SINT64 M; cin >> M;
SINT64 D; cin >> D;
vector<vector<Pll>> data(D,vector<Pll>(M*N/D + 5));
vector<vector<SINT64>> ans(D,vector<SINT64>(M*N/D + 5));
rep(i,0,N) {
rep(j,0,M) {
SINT64 a;
cin >> a;
SINT64 b,c;
c = a/D;
b = a%D;
data[b][c] = Pll(i,j);
}
}
rep(i,0,D) {
rep(j,1,M*N/D+5) {
SINT64 buf = ABS(data[i][j].F - data[i][j-1].F) + ABS(data[i][j].S - data[i][j-1].S);
ans[i][j] = ans[i][j-1] + buf;
}
}
SINT64 Q; cin >> Q;
rep(i,0,Q) {
SINT64 a,b;
cin >> a >> b;
if (a == b) {
put(0);
} else {
SINT64 c,d,e;
c = a%D;
d = a/D;
e = b/D;
put(ans[c][e] - ans[c][d]);
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,n){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i]; }
#define FILL2(a,n,m,x); REP(i,(n)){ REP(j,(m)){(a)[i][j]=(x);} }
#define CINA2(a,n,m); REP(i,(n)){ REP(j,(m)){cin >> (a)[i][j];} }
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define pii pair<int,int>
#define PI 3.141592653589793
int keta(ll x){ if(x<10){return 1;} else{return keta(x/10) + 1;}}
int keta_wa(ll x){ if(x<10){return x;} else{return keta_wa(x/10) + x%10;} }
int ctoi(char c){ return ( (c>='0' && c<='9')? c - '0': 0 );}
ll sum(ll a[],ll N){ return accumulate(a,a+N,0LL);}
ll gcd(ll a,ll b){if(a<b)swap(a,b); return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){if(a<b){swap(a,b);} return a/gcd(a,b)*b;}
int main(){
int H,W,D; cin>>H>>W>>D;
pii p[H*W+1];
REP(i,H){
REP(j,W){
int a; cin>>a;
p[a] = make_pair(i,j);
}
}
int d[H*W+1] = {0};
for(int i=D+1; i<=H*W; ++i){
d[i] = d[i-D] + abs(p[i].first-p[i-D].first) + abs( p[i].second-p[i-D].second );
}
int Q; cin>>Q;
REP(count,Q){
int L,R; cin>>L>>R;
ll ans = d[R]-d[L];
cout << ans << "\n";
}
} | 1 | 10,800,353 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, l;
vector<string> S;
string ans;
cin >> n >> l;
for (int i = 0; i < n; i++)
{
string buf;
cin >> buf;
S.push_back(buf);
}
for (int i = 0; i < n; i++)
{
ans += *min_element(S.begin(), S.end());
int bufIndex = min_element(S.begin(), S.end()) - S.begin();
S.erase(S.begin() + bufIndex);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int t; cin>>t; while(t--)
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll n,l,i,j,k;
string a[1000];
cin>>n>>l;
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(i=0;i<n;i++)
{
cout<<a[i];
}
cout<<endl;
return 0;
} | 1 | 12,412,653 |
#include <cstdio>
#include <cstring>
using namespace std;
int H, W;
int N;
int X[50], Y[50];
int vis[100][100];
void solve(int x, int y){
if (x > W || y > H) return;
for (int i = 1; i <= N; i++){
if (x == X[i] && y == Y[i]) return;
}
vis[y][x]++;
solve(x + 1, y);
solve(x, y + 1);
}
int main(){
while (1){
memset(vis, 0, sizeof(vis));
scanf("%d%d", &W, &H);
if (W == 0){
return 0;
}
scanf("%d", &N);
for (int i = 1; i <= N; i++){
scanf("%d%d", &X[i], &Y[i]);
}
solve(1, 1);
printf("%d\n", vis[H][W]);
}
} | #include <cstdio>
#define max(a,b) (a > b ? a : b)
int a,b,n,dp[17][17];
int main(){
while(scanf("%d%d",&a,&b), a != 0){
scanf("%d",&n);
for(int i = 0; i < 17; i++){
for(int j = 0; j < 17; j++){
dp[i][j] = 0;
}
}
for(int i = 0; i < n; i++){
int x,y;
scanf("%d%d",&x,&y);
dp[x][y] = -1;
}
dp[1][1] = 1;
for(int i = 1; i <= a; i++){
for(int j = 1; j <= b; j++){
if(i != 1 || j != 1){
if(dp[i][j] != -1){
dp[i][j] = max(dp[i-1][j],0) + max(dp[i][j-1],0);
}
}
}
}
printf("%d\n",dp[a][b]);
}
return 0;
} | 1 | 71,406,676 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef complex <double> cp;
#define debug(a) cout<<#a<<":"<<a<<endl;
#define fr freopen("in.txt","r",stdin);
#define Fill(x,a) memset(x,a,sizeof(x))
#define cpy(a,b) memcpy(a,b,sizeof(a))
const double PI = acos(-1);
const int INF=0x3f3f3f3f;
const int N=1e6+7;
const int mod=1e9+7;
int maxn,minn;
int T,n,m,q;
int pre[N];
void init(){
for(int i = 1; i <= n; i ++ ){
pre[i] = i;
}
}
int find(int a){
if(pre[a] == a) return a;
return pre[a] = find(pre[a]);
}
void join(int a,int b){
int aa = find(a);
int bb = find(b);
if(aa != bb){
pre[aa] = pre[bb];
}
}
int main(){
int u,v;
cin >> n >> m;
init();
for(int i = 1; i <= m; i ++ ){
scanf("%d%d",&u,&v);
join(u,v);
}
map<int,int>mp;
maxn = 0;
for(int i = 1; i <= n; i ++ ){
mp[find(i)] ++ ;
maxn = max(maxn, mp[pre[i]]);
}
cout << maxn << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200010;
int n,m;
int par[N],rk[N];
unordered_map<int,int> h;
void init(int n){
for(int i = 1;i<=n;i++){
par[i] = i;
rk[i] = 0;
}
}
int find(int x){
if(par[x] == x) return x;
else{
return par[x] = find(par[x]);
}
}
bool same(int x,int y){
return find(x) == find(y);
}
void unite(int x,int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rk[x] < rk[y]){
par[x] = y;
}else{
par[y] = x;
if(rk[x] == rk[y]) rk[x]++;
}
}
int main(){
cin >> n >> m;
init(n);
int ans = 0;
for(int i = 0;i<m;i++){
int a,b;
cin >> a >> b;
if(!same(a,b)) {
unite(a,b);
}
}
for(int i =1;i<=n;i++) find(i);
for(int i = 1;i<=n;i++){
h[par[i]]++;
ans = max(ans,h[par[i]]);
}
cout << ans << endl;
return 0;
} | 1 | 61,301,069 |
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int mod = 1e9 + 7;
const int MAX = 510000;
const int V = 100005;
ll dy[8] = {1,0,-1,0,1,-1,1,-1};
ll dx[8] = {0,1,0,-1,1,-1,-1,1};
const double pi = acos(-1);
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;}
int main(){
ll n,m; cin >> n >> m;
vl s(n),t(m);
rep(i,n) cin >> s[i];
rep(j,m) cin >> t[j];
vvl dp(n+1,vl(m+1,0));
rep(i,n+1) dp[i][0] = 1;
rep(j,m+1) dp[0][j] = 1;
rep(i,n){
rep(j,m){
if(s[i]==t[j]) dp[i+1][j+1] = dp[i][j+1]+dp[i+1][j];
else dp[i+1][j+1] = dp[i][j+1]+dp[i+1][j]-dp[i][j];
if(dp[i+1][j+1]<0) dp[i+1][j+1] += mod;
dp[i+1][j+1] %= mod;
}
}
cout << dp[n][m] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using pdd = pair<double, double>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; ++i)
cin >> S[i];
for (int i = 0; i < M; ++i)
cin >> T[i];
vector<vector<ll>> dp(N + 2, vector<ll>(M + 2));
dp[0][0] = 1;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= M; ++j) {
if (i > 0)
dp[i][j] += dp[i - 1][j];
if (j > 0)
dp[i][j] += dp[i][j - 1];
if (i > 0 && j > 0) {
dp[i][j] -= dp[i - 1][j - 1];
if (S[i - 1] == T[j - 1])
dp[i][j] += dp[i - 1][j - 1];
}
dp[i][j] %= MOD;
}
}
if (dp[N][M] < 0)
dp[N][M] += MOD;
cout << dp[N][M] << endl;
return 0;
} | 1 | 25,113,245 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
#define MAX 2000000
using namespace std;
const int INF = 0x7fffffff;
int gcd(int x,int y){
int mi,ma;
ma = max(x,y);
mi = min(x,y);
if(ma % mi == 0){
return mi;
}
else{
return gcd(mi,ma % mi);
}
}
int H;
int heap[MAX+1];
void heapIncreaseKey(int ii,int key){
if(key < heap[ii]){
return ;
}
heap[ii] = key;
int tmp;
while(ii > 1 && heap[(ii)/2] < heap[ii]){
tmp = heap[ii];
heap[ii] = heap[(ii)/2];
heap[(ii)/2] = tmp;
ii = (ii)/2;
}
}
void insert(int key){
H++;
heap[H] = -INF;
heapIncreaseKey(H,key);
int ii;
}
void maxHeapify(int ii){
int l,r;
l = ii*2;
r = ii*2+1;
int largest;
if(l <= H && heap[l] > heap[ii]){
largest = l;
}
else{
largest = ii;
}
if(r <= H && heap[r] > heap[largest]){
largest = r;
}
if(largest != ii){
int sw;
sw = heap[ii];
heap[ii] = heap[largest];
heap[largest] = sw;
maxHeapify(largest);
}
}
int heapExtractMax(){
if(H < 0){
return 0;
}
int max;
max = heap[1];
heap[1] = heap[H];
H--;
maxHeapify(1);
return max;
}
int main(){
long ii,jj,kk;
H = 0;
string cmd;
int n;
while(true){
cin >> cmd;
if(cmd == "end"){
break;
}
else if(cmd == "insert"){
cin >> n;
insert(n);
}
else{
cout << heapExtractMax() << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
priority_queue<int> pq;
while(true)
{
char s[10];
scanf("%s",s);
if(s[2]=='s')
{
int t;
scanf("%d",&t);
pq.push(t);
}
else if(s[2]=='t')
{
printf("%d\n",pq.top());
pq.pop();
}
else break;
}
return 0;
} | 1 | 63,684,991 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
#define ll long long int
int main(){
int l;
cin>>l;
double a=(double)l/3;
double ans=a*a*a;
cout<< std::fixed << std::setprecision(15)<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define print(a) printf("%d\n",a);
#define scanii(a,b) scanf("%d %d",&a,&b);
#define printii(a,b) printf("%d\n%d\n",a,b);
#define scaniii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ll long long
#define ull unsigned long long
#define sll signed long long
#define pi acos(-1)
#define mod 1000000007
#define TRUE 1
#define FALSE 0
#define ZERO 0
#define MP make_pair
#define F first
#define S second
#define f1(i,a) for(int i=0;i<a;++i)
#define f2(i,a) for(int i=a-1;i>=0;--i)
#define en puts("");
#define elif else if
typedef ll int lli;
typedef sll int slli;
typedef ull int ulli;
const int sz=10000;
using namespace std;
int clue();
int result();
void show();
bool check();
bool cmp(pair<int,int>p,pair<int,int>q) {
return p.second<q.second;
}
int main() {
int t;
t=1;
while(t-->0) {
clue();
}
return 0;
}
int clue() {
lli n;
cin>>n;
double p=n/3.0;
p=p*p*p;
cout<<fixed<<setprecision(6)<<p<<endl;
return 0;
} | 1 | 9,413,708 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if(x==y) cout<<"Draw"<<endl;
else if(min(x,y)!=1){
if(x>y) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
else if(min(x,y)==1){
if(x>y) cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
std::cout << "Alice" << '\n';
} else if (a < b) {
std::cout << "Bob" << '\n';
} else {
std::cout << "Draw" << '\n';
}
} | 1 | 15,704,605 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
deque<int> deq;
rep(i, n){
if(i % 2 == 0) deq.push_back(a.at(i));
else deq.push_front(a.at(i));
}
while(!deq.empty()){
if(deq.size() != n){
cout << " ";
}
if(n % 2 == 0){
cout << deq.front();
deq.pop_front();
}else{
cout << deq.back();
deq.pop_back();
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
vector<int> g={},h={};
rep(i,n){
int q;
cin >>q;
if(i%2==0){h.push_back(q);}else{g.push_back(q);}
}
if(n%2==1){
for(int i=h.size()-1;i>=0;i--){
cout << h[i] << " ";
}
for(int i=0;i<g.size();i++){
cout << g[i] << " ";
}
}else{
for(int i=g.size()-1;i>=0;i--){
cout << g[i] << " ";
}
for(int i=0;i<h.size();i++){
cout << h[i] << " ";
}
}
cout << endl;
} | 1 | 37,907,571 |
#include<stdio.h>
int main(){
int a;
int b;
int c;
scanf("%d %d %d",&a,&b,&c);
if (a>=b){
printf("No\n");
}
else if (b>=c){
printf("No\n");
}
else{
printf("Yes\n");
}
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int x,y,z;
cin>>x>>y>>z;
if(x<y && y<z ) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 16,038,756 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int H, W;
vector<string> fi;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; ++i) cin >> fi[i];
vector<vector<int> > dist(H, vector<int>(W, -1));
using pint = pair<int,int>;
queue<pint> que;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
if (fi[i][j] == '#') {
dist[i][j] = 0;
que.push(pint(i, j));
}
}
}
while (!que.empty()) {
auto cur = que.front();
que.pop();
for (int dir = 0; dir < 4; ++dir) {
int nx = cur.first + dx[dir];
int ny = cur.second + dy[dir];
if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;
if (dist[nx][ny] == -1) {
dist[nx][ny] = dist[cur.first][cur.second] + 1;
que.push(pint(nx, ny));
}
}
}
int res = 0;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
res = max(res, dist[i][j]);
}
}
cout << res << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
P dir[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int main() {
int H, W; cin >> H >> W;
char s[H][W];
queue<P> Q;
vector<vector<int>> dist(H, vector<int>(W, INF));
rep(i, H) {
rep(j, W) {
cin >> s[i][j];
if(s[i][j] == '#') {
Q.push(mp(i, j));
dist[i][j] = 0;
}
}
}
while(!Q.empty()) {
P q = Q.front(); Q.pop();
rep(i, 4) {
int h = q.first + dir[i].first, w = q.second + dir[i].second;
if(h < 0 || h >= H || w < 0 || w >= W) continue;
if(s[h][w] == '#') continue;
if(dist[h][w] == INF) {
Q.push(mp(h, w));
dist[h][w] = dist[q.first][q.second] + 1;
}
dist[h][w] = min(dist[h][w], dist[q.first][q.second] + 1);
}
}
int ans = 0;
rep(i, H) {
rep(j, W) {
if(s[i][j] == '#')continue;
ans = max(ans, dist[i][j]);
}
}
cout << ans << endl;
} | 1 | 70,948,509 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int i,j,n,k,x=0;
cin>>n>>k;
double s,z=0,t=0.5,y;
if(n>=k)
{
y=k;
}
else
{
y=n+1;
}
for(i=1;i<y;i++)
{
x=0;
for(j=i;j<k;)
{
j=j*2;
x++;
}
s=pow(t,x);
s=s/n;
z=z+s;
}
if(n>=k)
{
s=(n-k+1)/(n*1.0);
cout<<fixed<<setprecision(10)<<z+s<<endl;
return 0;
}
cout<<fixed<<setprecision(10)<<z<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long ;
int main()
{
int n,k;
cin>>n>>k;
double ans=0;
for(int i=1;i<=n;i++){
ll point=i;
double pro=1;
while(point<k){
point*=2;
pro*=0.5;
}
ans+=pro/n;
}
printf("%.10f",ans);
} | 1 | 32,512,729 |
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
int main()
{
int n;
scanf("%d", &n);
vector<int> arr(n);
for (int i = 0; i < n; i++)
scanf("%d", &arr[i]);
sort(arr.begin(), arr.end());
int ni = arr.back();
int ki = arr[0];
int nowd = arr.back();
for (int i = 0; i < n - 1; i++)
{
int dx = abs((ni + 1) / 2 - arr[i]);
if (ni % 2 == 0)
dx = min(dx, abs(ni / 2 + 1 - arr[i]));
if (dx < nowd)
{
nowd = dx;
ki = arr[i];
}
}
printf("%d %d\n", ni, ki);
return 0;
} | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int n,num[100005],i,j,ai=0,aj=0;
cin>>n;
for(i=1;i<=n;i++){scanf("%d",&num[i]);ai=max(ai,num[i]);}
for(i=1;i<=n;i++){
if(fabs((double)aj-(double)ai/2)>fabs((double)num[i]-(double)ai/2))
aj=num[i];
}
cout<<ai<<' '<<aj<<endl;
return 0;
} | 1 | 58,396,300 |
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int n, a[1000];
double s = 0, p = 1;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
p = p * a[i];
}
for(int i = 0; i < n; i++)
{
s = s + p/a[i];
}
cout << setprecision(16) << p / s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
double total = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
a.at(i) = 1 / a.at(i);
total += a.at(i);
}
cout << 1 / total << endl;
} | 1 | 72,008,231 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
typedef long long int lint;
#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define mp make_pair
#define enld endl
int main() {
lint A, B, C;
cin >> A >> B >> C;
lint K;
cin >> K;
lint cnt = 0;
while (1) {
if (A < B) {
break;
}
else {
B *= 2;
cnt++;
}
}
while (1) {
if (B < C) {
break;
}
else {
C *= 2;
cnt++;
}
}
if (cnt <= K) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int a,b,c,k,i=0;
cin>>a>>b>>c>>k;
while(a>=b&&k){
b*=2;
k--;
}
rep(i,k)c*=2;
if(b<c&&a<b)cout<<"Yes";
else cout<<"No";
return 0;
} | 1 | 16,967,260 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define int long long
using namespace std;
typedef pair<int, int> Pii;
template<typename T>
void readvec(vector<T> &a);
void readindex(vector<int> &a);
void fillvec(vector<int> &a, int s, int k){
int n = a.size();
REP(i, k){
a[i] = i + s;
}
REP(i, n - k){
a[i + k] = n - 1 - i + s;
}
}
signed main(){
int N, A, B;
cin >> N >> A >> B;
if(A * B < N || A + B > N + 1){
cout << -1;
return 0;
}
vector< vector<int> > a(N / B + min((int)1, N % B));
REP(i, N / B){
a[i] = vector<int>(B);
}
if(N % B > 0) a[N / B] = vector<int>(N % B);
A -= a.size();
fillvec(a[0], 0, 0);
FOR(i, 1, a.size()){
fillvec(a[i], i * B, min(A, B - 1));
A -= min(A, B - 1);
}
REP(i, a.size()){
REP(j, a[i].size()){
cout << a[i][j] + 1 << " ";
}
}
return 0;
}
template<typename T>
void readvec(vector<T> &a){
REP(i, a.size()){
cin >> a[i];
}
}
void readindex(vector<int> &a){
REP(i, a.size()){
cin >> a[i];
a[i]--;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void out(deque<int> v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v.front() << " \n"[i == sz - 1];
v.pop_front();
}
}
int main() {
ll n,a,b;
cin >> n >> a >> b;
if (a * b < n) {
cout << -1 << endl;
return 0;
}
if (a + b - 1 > n) {
cout << -1 << endl;
return 0;
}
int pos = n;
deque<int> dq;
for (int i = 0; i < a; i++) {
dq.push_front(pos--);
}
while (--b) {
int tmp = a;
vector<int> v;
while (tmp-- > 0 && pos >= b) {
v.push_back(pos--);
}
for (int i = 0; i < v.size(); i++) {
dq.push_back(v[v.size() - i - 1]);
}
}
out(dq);
return 0;
} | 1 | 38,966,240 |
#include <stdio.h>
#include <string.h>
#define ll long long int
int main(){
int n, m, even = 0;
scanf("%d %d", &n, &m);
even = n * (n -1) /2 + m * (m - 1) /2;
printf("%d\n", even);
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << 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; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n,m; cin>>n>>m;
cout << (n*(n-1))/2+(m*(m-1))/2 << '\n';
return 0;
} | 1 | 88,715,235 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll Mypow(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll INFL = 1LL << 60;
int INF = 1 << 30;
ll MOD = 1000000007;
int N, K;
vector<int> A;
bool p(int x){
bitset<5000> bset;
bset[0] = 1;
rep(i, N){
if(i == x) continue;
bset |= (bset << A[i]);
}
for(int i = K - A[x]; i < K; i++){
if(bset[i]) return true;
}
return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> K;
rep(i, N){
int a; cin >> a;
if(a < K) A.push_back(a);
}
sort(A.begin(), A.end());
N = A.size();
int no = -1, need = N;
while(need - no > 1){
int mid = (no + need) / 2;
if(p(mid)) need = mid;
else no = mid;
}
cout << no + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 5010;
int N, K;
int A[MAXN];
bool dppref[MAXN][MAXN], dpsuff[MAXN][MAXN];
int sum[MAXN];
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
dppref[0][0] = true;
for (int i = 0; i < N; i++) {
copy(dppref[i], dppref[i] + K + 1, dppref[i+1]);
for (int j = 0; j <= K-A[i]; j++) {
dppref[i+1][j+A[i]] |= dppref[i][j];
}
}
dpsuff[N][0] = true;
for (int i = N-1; i >= 0; i--) {
copy(dpsuff[i+1], dpsuff[i+1] + K + 1, dpsuff[i]);
for (int j = 0; j <= K-A[i]; j++) {
dpsuff[i][j+A[i]] |= dpsuff[i+1][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int low = K - A[i];
int high = K - 1;
for (int j = 0; j <= K; j++) {
sum[j] = dpsuff[i+1][j];
if (j > 0) sum[j] += sum[j-1];
}
bool found = false;
for (int j = 0; j <= high; j++) {
if (!dppref[i][j]) continue;
int cntOne = sum[high-j];
if (low-j >= 1) {
cntOne -= sum[low-j-1];
}
found |= bool(cntOne);
}
ans += 1 - int(found);
}
printf("%d\n", ans);
return 0;
} | 1 | 77,885,163 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int>arr(n);
rep(i, n)cin >> arr[i];
sort(all(arr));
cout << arr[n - 1] - arr[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int minimum = 2000000000, maximum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
minimum = min(minimum, tmp);
maximum = max(maximum, tmp);
}
cout << maximum - minimum << endl;
return 0;
} | 1 | 43,046,453 |
#include <iostream>
#include <algorithm>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
if(a > b) {
std::swap(a, b);
}
if(b > c) {
std::swap(b, c);
}
if(a > b) {
std::swap(a, b);
}
std::cout << a << ' ' << b << ' ' << c << std::endl;
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int a , b , c;
cin >> a >> b >> c;
int d;
if(a > b){
d = a;
a = b;
b = d;
}
else{
if(b > c){
d = b;
b = c;
c = d;
}
}
if(b > c){
d = b;
b = c;
c = d;
}
if(a > b){
d = a;
a = b;
b = d;
}
cout << a << " " << b << " " << c << endl;
return 0;
} | 1 | 4,008,718 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 100010
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
int n,a[N];
signed main()
{
n=read();
for (int i=1;i<=n;i++) a[i]=read();
sort(a+1,a+n+1);
int p=0;
for (int i=1;i<=n;i++) if (a[i]<0) p=i;
p=max(p,1);p=min(p,n-1);
int s=0;
for (int i=1;i<=p;i++) s-=a[i];
for (int i=p+1;i<=n;i++) s+=a[i];
cout<<s<<endl;
for (int i=p+1;i<n;i++)
{
printf("%d %d\n",a[p],a[i]);
a[p]-=a[i];
}
printf("%d %d\n",a[n],a[p]);a[n]-=a[p];
for (int i=1;i<p;i++)
{
printf("%d %d\n",a[n],a[i]);
a[n]-=a[i];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N;
cin >> N;
deque<ll> A(N);
rep(i,N){
cin >> A[i];
}
deque<ll> m,p;
rep(i,N){
if(A[i] >= 0){
p.push_back(A[i]);
}else{
m.push_back(A[i]);
}
}
sort(p.begin(),p.end());
sort(m.begin(),m.end());
vector<Pll> v;
if(N == 2){
cout << max(A[0],A[1]) - min(A[0],A[1]) << endl;
cout << max(A[0], A[1]) << " " << min(A[0], A[1]) << endl;
return 0;
}
rep(i,N-1){
ll t1,t2;
if(p.empty()){
t1 = m.front();
m.pop_front();
t2 = m.back();
m.pop_back();
if(t1 > t2){
v.push_back(Pll(t1,t2));
}else{
v.push_back(Pll(t2,t1));
}
p.push_back(abs(t1-t2));
}else if(m.empty()){
t1 = p.front();
p.pop_front();
t2 = p.back();
p.pop_back();
if(p.empty()){
if(t1>t2){
v.push_back(Pll(t1,t2));
}else{
v.push_back(Pll(t2,t1));
}
p.push_back(abs(t1-t2));
continue;
}else if(t1>t2){
v.push_back(Pll(t2, t1));
}else{
v.push_back(Pll(t1, t2));
}
m.push_back(-abs(t1-t2));
}else{
t1 = p.back();
p.pop_back();
t2 = m.back();
m.pop_back();
if(p.empty()){
v.push_back(Pll(t1,t2));
p.push_back(t1-t2);
}else{
v.push_back(Pll(t2,t1));
m.push_back(t2-t1);
}
}
}
cout << p.back() << endl;
rep(i,N-1){
cout << v[i].first << " " << v[i].second << endl;
}
} | 1 | 71,678,333 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+1000;
int s[maxn];
int main() {
int n;
long long sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
sum+=s[i];
}
long long ans=999999999999;
long long su=s[0];
for(int i=1;i<n-1;i++){
su+=s[i];
ans=min(abs(sum-2*su),ans);
}
if(n==2){
cout<<abs(s[0]-s[1])<<endl;
}
else
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >=0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
typedef long long ll;
#define INF 1e9
int main(){
int N;
ll mini = 1e16;
cin >> N;
vector<ll> a(N), sum(N+1);
sum[0] = 0;
REP(i, N){
cin >> a[i];
sum[i+1] = sum[i] + a[i];
}
FOR(i, 1, N){
ll x = sum[i];
ll y = sum[N] - x;
mini = min(mini, abs(x-y));
}
cout << mini << endl;
return 0;
} | 1 | 6,887,489 |
#include <iostream>
#include <string>
using namespace std;
int size=0;
long long int heap[2000000];
int parent(int i){
int return_num;
if(i%2==0){
return_num = (i-2)/2;
}else{
return_num = (i-1)/2;
}
return return_num;
}
int left_child(int i){
return 2*i+1;
}
int right_child(int i){
return 2*i+2;
}
int pop(){
int ret = heap[0];
int x = heap[--size];
int i=0;
while (left_child(i)<size){
int l = left_child(i), r=right_child(i);
if(r < size && heap[r] > heap[l]){
l = r;
}
if(heap[l] <= x){
break;
}
heap[i] = heap[l];
i=l;
}
heap[i] = x;
return ret;
}
void push(int x){
int i = size++;
while (i > 0){
int p = parent(i);
if( heap[p] >= x ){
break;
}else{
heap[i] = heap[p];
i=p;
}
}
heap[i] = x;
}
int chenger(string str){
if(str=="insert"){
return 0;
}else if (str == "extract"){
return 1;
}else if (str == "end"){
return 2;
}
return -1;
}
int main(){
string input_str;
int input_num;
int output_num;
while(1){
cin >> input_str;
int a = chenger(input_str);
switch(a){
case 0:
cin >> input_num;
push(input_num);
break;
case 1:
output_num = pop();
cout << output_num << endl;
break;
case 2:
return 0;
}
}
} | #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int n;
struct Node{
int key;
Node *p, *l, *r;
};
Node *NIL, *root;
void preorder(Node *u){
if(u == NIL) return;
cout << ' ' << u->key;
preorder(u->l);
preorder(u->r);
}
void inorder(Node *u){
if(u == NIL) return;
inorder(u->l);
cout << ' ' << u->key;
inorder(u->r);
}
void insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z = new Node[1];
z->key = k;
z->p = NIL;
z->r = NIL;
z->l = NIL;
while(x != NIL){
y = x;
if(z->key < x->key) x = x->l;
else x = x->r;
}
z->p = y;
if(y == NIL){
root = z;
}
else if(z->key < y->key) y->l = z;
else y->r = z;
}
void find(int k){
Node *x = root;
while(x != NIL){
if(k == x->key) break;
else if(k > x->key) x = x->r;
else x = x->l;
}
if(x == NIL) cout << "no" << endl;
else cout << "yes" << endl;
}
Node *getMinimum(Node *x){
while(x->l != NIL){
x = x->l;
}
return x;
}
Node *getsuccessor(Node *x){
if(x->r != NIL) return getMinimum(x->r);
Node *y = x->p;
while(y != NIL && x == y->r){
x = y;
y = y->p;
}
return y;
}
void deletex(int k){
Node *z = root;
while(z->key != k){
if(k > z->key) z = z->r;
else z = z->l;
}
Node *y;
if(z->l == NIL || z->r == NIL) y = z;
else y = getsuccessor(z);
Node *x;
if(y->l != NIL) x = y->l;
else x = y->r;
if(x != NIL) x->p = y->p;
if(y->p == NIL) root = x;
else if(y == y->p->l) y->p->l = x;
else y->p->r = x;
if(y != z) z->key = y->key;
}
void maxheapify(int *A, int x){
int largest, t;
if(2 * x <= n && A[x] < A[2 * x]){
largest = 2 * x;
}
else{
largest = x;
}
if(2 * x + 1 <= n && A[largest] < A[2 * x + 1]){
largest = 2 * x + 1;
}
if(x != largest){
t = A[x];
A[x] = A[largest];
A[largest] = t;
maxheapify(A, largest);
}
}
void buildmaxheap(int *A){
for(int i = n / 2; i >= 1; i--){
maxheapify(A, i);
}
}
void heapinsertmax(int *A, int i, int key){
if(key < A[i]) cout << "error";
A[i] = key;
while(i > 1 && A[i] > A[i / 2]){
int t = A[i];
A[i] = A[i / 2];
A[i / 2] = t;
i = i / 2;
}
}
void insert(int *A, int key){
n++;
A[n] = -1;
heapinsertmax(A, n, key);
}
void heapextractmax(int *A){
if(n < 1) cout << "error";
cout << A[1] << endl;
A[1] = A[n];
n--;
maxheapify(A, 1);
}
int main(){
n = 0;
int *A = new int[2000000000];
string s;
int x;
while(1){
cin >> s;
if(s == "end") break;
else if(s == "insert"){
cin >> x;
insert(A, x);
}
else if(s == "extract"){
heapextractmax(A);
}
}
return 0;
} | 1 | 18,419,899 |
#include<stdio.h>
#define MAX 100
int main(void){
int array[MAX] = {0};
int i;
int count = 0;
while(scanf("%d",&i) != EOF){
array[i]++;
if(array[i] > count)
count = array[i];
}
for(i=0;i<MAX;i++){
if(array[i] == count)
printf("%d\n",i);
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int a[101]={0},b,i,saihin[100]={0},c=0,saidai=0;
while(cin>>b){
a[b]=a[b]+1;
}
for(i=1;i<=100;i++){
if(saidai<a[i]){
saidai=a[i];
}
}
for(i=1;i<=100;i++){
if(a[i]==saidai){
saihin[c]=i;
c=c+1;
}
}
for(i=0;i<100;i++){
if(saihin[i]==0)break;
cout<<saihin[i]<<endl;
}
return 0;
} | 1 | 21,748,118 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define FOR(i, r, n) for (int i=(int)(r); i<=(int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
struct BFS{
vector<vector<int>> data;
vector<bool> ch;
vector<int> dis, bef;
queue<int> q;
void set(int n){
rep(i, n+1){
data.push_back(vector<int>());
ch.push_back(false);
dis.push_back(0);
bef.push_back(0);
}
return;
}
void cn(int a, int b){
data[a].push_back(b);
data[b].push_back(a);
return;
}
void root(int x){
dis[x]=dis[bef[x]]+1;
for(int i: data[x]){
if(!ch[i]){
q.push(i);
bef[i]=x;
ch[i]=true;
}
}
return;
}
void search(int x){
bef[x]=0;
dis[0]=-1;
ch[x]=true;
for(int i: data[x]){
if(!ch[i]){
q.push(i);
bef[i]=x;
ch[i]=true;
}
}
while(!q.empty()){
root(q.front());
q.pop();
}
return;
}
int dtc(int x){
return dis[x];
}
int bfr(int x){
return bef[x];
}
};
int main(){
cout<<"Yes"<<endl;
int n, m; cin>>n>>m;
BFS bfs;
bfs.set(n);
rep(i, m){
int a, b; cin>>a>>b;
bfs.cn(a, b);
}
bfs.search(1);
FOR(i, 2, n){
cout<<bfs.bfr(i)<<endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>
#include <new>
using namespace std;
#define EPS (1e-9)
#define INF (1e9)
#define MOD (ll)(1e9 + 7)
#define PI (acos(-1))
#define REP(i,a,n) for(int i=a;i<n;i++)
#define rep(i, n) REP(i,0,n)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" ; "IMPOSSIBLE")
using ll = long long int;
ll gcd(ll a, ll 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 N, M;
vector<int> v[100010];
int depth[100010];
int ans[100010] = {};
void bfs();
int main() {
cin >> N >> M;
rep(i, M) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
bfs();
cout << "Yes" << endl;
REP(i, 2, N + 1) {
cout << ans[i] << endl;
}
}
void bfs() {
queue<int> q;
rep(i, 100010) depth[i] = INF;
q.push(1);
depth[1] = 0;
while (q.size()) {
int a = q.front(); q.pop();
rep(i, (int)v[a].size()) {
int b = v[a][i];
if (depth[b] > depth[a] + 1) {
q.push(b);
depth[b] = depth[a] + 1;
ans[b] = a;
}
}
}
} | 1 | 30,652,464 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vi vx={-1,0,1,0};
vi vy={0,1,0,-1};
using pi = pair<int,int>;
signed main(){
int a,b; cin>>a>>b;
vvi v(a,vi(b));
queue<pi> q;
rep(i,0,a){
rep(j,0,b){
char c; cin>>c;
if(c=='#'){
v[i][j]=1;
q.push(make_pair(i,j));
}
else v[i][j]=0;
}
}
while(!q.empty()){
pi p=q.front(); q.pop();
int k,l; tie(k,l)=p;
bool ok=false;
rep(i,0,4){
k+=vx[i]; l+=vy[i];
if(k>=0 && k<a){
if(l>=0 && l<b){
if(v[k][l]==1)ok=true;
}
}
k-=vx[i]; l-=vy[i];
}
if(!ok){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H + 2, vector<char>(W + 2, '.'));
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> s.at(i).at(j);
}
}
bool ok = true;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (s.at(i).at(j) == '#') {
if (s.at(i - 1).at(j) == '.' && s.at(i + 1).at(j) == '.' && s.at(i).at(j + 1) == '.' && s.at(i).at(j - 1) == '.') {
ok = false;
break;
}
}
}
if (ok == false) {
break;
}
}
if (ok) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 33,325,435 |
#include<bits/stdc++.h>
using namespace std;
vector<int> dice(7);
vector<int> tmp(7);
void change_dice(char c){
for(int i=1; i<=6; i++){
tmp[i]=dice[i];
}
if(c=='E'){
dice[1]=tmp[4];
dice[3]=tmp[1];
dice[4]=tmp[6];
dice[6]=tmp[3];
}
else if(c=='N'){
dice[1]=tmp[2];
dice[2]=tmp[6];
dice[5]=tmp[1];
dice[6]=tmp[5];
}
else if(c=='S'){
dice[1]=tmp[5];
dice[2]=tmp[1];
dice[5]=tmp[6];
dice[6]=tmp[2];
}
else if(c=='W'){
dice[1]=tmp[3];
dice[3]=tmp[6];
dice[4]=tmp[1];
dice[6]=tmp[4];
}
}
int main(){
for(int i=1; i<=6; i++)
cin >> dice[i];
int n;
cin >> n;
while(n--){
int upper,front;
cin >> upper >> front;
int key;
for(int i=1; i<=6; i++){
if(dice[i]==front)
key=i;
}
switch(key){
case 1:
change_dice('S');
break;
case 2:
break;
case 3:
change_dice('W');
change_dice('S');
break;
case 4:
change_dice('E');
change_dice('S');
break;
case 5:
change_dice('S');
change_dice('S');
break;
case 6:
change_dice('N');
break;
}
while(dice[1]!=upper){
change_dice('E');
}
cout << dice[3] << endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<time.h>
#include<random>
using namespace std;
struct Dice{
int s[6];
void move(char c){
int tmp;
if(c=='N'){
tmp=s[0];
s[0]=s[1];
s[1]=s[5];
s[5]=s[4];
s[4]=tmp;
}
else if(c=='S'){
tmp=s[0];
s[0]=s[4];
s[4]=s[5];
s[5]=s[1];
s[1]=tmp;
}
else if(c=='E'){
tmp=s[0];
s[0]=s[3];
s[3]=s[5];
s[5]=s[2];
s[2]=tmp;
}
else if(c=='W'){
tmp=s[0];
s[0]=s[2];
s[2]=s[5];
s[5]=s[3];
s[3]=tmp;
}
}
int get_top(){
return s[0];
}
int get_right(){
return s[2];
}
};
int main(){
Dice dice;
for(int i=0;i<6;i++)cin>>dice.s[i];
int n,s0,s1;
cin>>n;
srand((int)time(0));
for(int i=0;i<n;i++){
cin>>s0>>s1;
while(true){
if(dice.s[0]==s0&&dice.s[1]==s1)break;
int random=rand()%4;
if(random==0)dice.move('N');
else if(random==1)dice.move('S');
else if(random==2)dice.move('E');
else dice.move('W');
}
cout<<dice.get_right()<<endl;
}
return 0;
} | 1 | 93,036,484 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9;
const int H_MAX=300;
const int W_MAX=300;
int H,W,D;
vector<pair<int,int>> V(H_MAX*W_MAX+1);
int solve(int s,int e,vector<vector<int>> &memo){
if(memo[s][e]<INF) return memo[s][e];
int res;
int x_cur,y_cur,x_next,y_next;
if(e==0) return memo[s][e]=0;
x_cur=V[s+D*(e-1)].first;
y_cur=V[s+D*(e-1)].second;
x_next=V[s+D*e].first;
y_next=V[s+D*e].second;
res=solve(s,e-1,memo)+abs(x_cur-x_next)+abs(y_cur-y_next);
return memo[s][e]=res;
}
int main(){
cin >> H >> W >> D;
vector<vector<int>> memo(D+1,vector<int>((H*W)/D+1,INF));
int a;
rep(i,H){
rep(j,W){
cin >> a;
V[a]={i,j};
}
}
int Q;
int ans;
cin >> Q;
vector<int> L(Q),R(Q);
rep(i,Q) cin >> L[i] >> R[i];
int start,true_end,nise_end;
rep(i,Q){
start=L[i]%D;
if(start==0) start+=D;
true_end=(R[i]-start)/D;
nise_end=(L[i]-start)/D;
cout << solve(start,true_end,memo)-solve(start,nise_end,memo) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
pll A[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll H, W, D;
cin >> H >> W >> D;
REP(i, H) {
REP(j, W) {
ll a;
cin >> a;
a--;
A[a] = pll(i, j);
}
}
vector<vector<ll>> v(D);
REP(i, D) {
v[i].push_back(0);
ll n = i;
while (n + D < H * W) {
ll c = abs(A[n].first - A[n + D].first) + abs(A[n].second - A[n + D].second) + v[i].back();
v[i].push_back(c);
n += D;
}
}
ll Q;
cin >> Q;
REP(i, Q) {
ll l, r;
cin >> l >> r;
ll a = (l - 1) / D;
ll b = (r - 1) / D;
ll n = (l - 1) % D;
ll ret = v[n][b] - v[n][a];
cout << ret << endl;
}
return 0;
} | 1 | 49,672,478 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename A,typename B>inline bool chmin(A &a,const B &b){if(a>b){a=b;return true;}else{return false;}}
template<typename A,typename B>inline bool chmax(A &a,const B &b){if(a<b){a=b;return true;}else{return false;}}
int main()
{
ll N,A,B;
cin >> N >> A >> B;
if(B < A || (A != B && N == 1)){
cout << 0 << endl;
return 0;
}
if(A == B){
cout << 1 << endl;
}else{
cout << ((B-A)*(N-2) + 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, a, b;
cin >> n >> a >> b;
if(a > b) cout << 0 << endl;
else if(n == 1){
if(a == b) cout << 1 << endl;
else cout << 0 << endl;
}
else {
long long int ans = (n - 2) * b - (n - 2) * a + 1;
cout << ans << endl;
}
return 0;
} | 1 | 89,877,478 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int A=S.size();
T=T.substr(0,A);
if(S==T){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s,t;
cin >> s >> t;
t.pop_back();
if (s==t)cout << "Yes" << endl;
else cout << "No" <<endl;
return 0;
} | 1 | 64,547,485 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
cout << (a - 1) * (b - 1) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
const ll INF=LLONG_MAX;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int x,y; cin >> x >> y;
x--; y--;
cout << x*y;
} | 1 | 56,692,784 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv)
{
int a, b;
cin >> a >> b;
if(a < b){
cout << "a < b" << endl;
}else if(a > b){
cout << "a > b" << endl;
}else{
cout << "a == b" << endl;
}
} | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d%d",&a,&b);
if(a<b) printf("a < b\n");
else if(a==b) printf("a == b\n");
else printf("a > b\n");
} | 1 | 7,051,627 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
ll 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 const INF = 1001001001;
int main()
{
ll n,L,T;
cin >> n >> L >> T;
vl x(n),w(n);
rep(i,n) cin >> x[i] >> w[i];
vl z(n);
rep(i,n) {
if(w[i] == 1) z[i] = (x[i] + T) % L;
if(w[i] == 2) z[i] = ((x[i] - T) % L + L) % L;
}
vl v;
if(w[0] == 1) {
for(int i = 1; i < n; ++i) {
if(w[i] == 2) v.push_back(x[i]-x[0]);
}
}
if(w[0] == 2) {
for(int i = n-1; i > 0; --i) {
if(w[i] == 1) v.push_back(L-x[i]+x[0]);
}
}
ll p = (2*T)/L, q = (2*T)%L;
ll collide_count = p*SZ(v);
rep(j,SZ(v)) {
if(v[j] <= q) collide_count++;
}
ll r, y = z[0];
if(w[0] == 1) r = collide_count % n;
if(w[0] == 2) r = n - collide_count % n;
sort(z.begin(), z.end());
ll pos;
if(w[0] == 1) {
rep(i,n) {
if(z[i] == y) pos = i;
}
}
if(w[0] == 2) {
drep(i,n) {
if(z[i] == y) pos = i;
}
}
ll base = ((pos + n) - r) % n;
rotate(z.begin(), z.begin() + base, z.end());
rep(i,n) cout << z[i] << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<class T> std::vector<std::vector<T>> VV(int n) {
return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
signed main() {
INIT;
VAR(int, n, l, t);
VEC_ROW(int, n, x, w);
std::vector<int> d(n);
REP(i, n) {
int sign = w[i] == 1 ? 1 : -1;
d[i] = x[i] + t * sign;
d[i] %= l;
if (d[i] < 0) d[i] += l;
}
int p0 = d[0];
std::sort(ALL(d));
int cnt = 0;
REP(i, n) {
if (w[i] == w[0]) continue;
int len = x[i] - x[0];
if (w[0] == 2) len = l - len;
if (len <= t * 2) cnt += (t * 2 - len) / l + 1;
cnt %= n;
}
if (w[0] == 2) cnt = n - cnt;
cnt %= n;
std::vector<int> ans(n);
REP(i, n) {
if (d[i] == p0) {
if (w[0] == 1 && d[(i + 1) % n] == p0) ++i;
REP(j, n) {
ans[(j + cnt) % n] = d[(i + j) % n];
}
break;
}
}
REP(i, n) {
OUT(ans[i])BR;
}
return 0;
} | 1 | 71,812,415 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define INF 100000000000
#define MAX 200001
#define MOD 1000000007
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int time1 = h1 * 60 + m1;
int time2 = h2 * 60 + m2;
int ans = time2 - time1 - k;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int h, m;
cin >> h >> m;
int now = h * 60 + m;
cin >> h >> m;
int next = h * 60 + m;
int k;
cin >> k;
cout << next - now - k << endl;
} | 1 | 86,436,575 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
string s; cin >> s;
ll ans = 0;
ll countB = 0;
for(ll i = s.length()-1; i >=0; i --){
if(s[i] == 'B'){
ans += (s.length() -1 - i -countB);
countB ++;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Vec = vector<int>;
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;
}
int main(){
string s;
cin>>s;
int n=s.size();
int ct=0;
ll sum=0;
for(int i=0;i<n;i++){
if(s[i]=='W'){
sum+=(i-ct);
ct++;
}
}
cout<<sum<<endl;
} | 1 | 24,690,182 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m; cin >> n >> m;
int min = 0;
int max = n;
for(int i = 0; i < m; i++) {
int l,r; cin >> l >> r;
if(min < l) min = l;
if(max > r) max = r;
}
int ans = max - min + 1;
if(max < min) ans = 0;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n, m, l, r;
cin >> n >> m;
int imos[100005];
fill(imos, imos + 100005, 0);
for(int i = 0; i < m; ++i)
{
cin >> l >> r;
imos[l]++;
imos[r + 1]--;
}
int ans = 0;
for(int i = 0; i < 100004; ++i)
{
imos[i + 1] += imos[i];
if(imos[i + 1] == m) ans++;
}
cout << ans;
}
int main()
{
fastio;
solve();
return 0;
} | 1 | 22,067,536 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++) {
cin>>A[i];
}
set<ll> S;
ll B=1;
ll count=0;
for(ll i=0;i<N;i++) {
if(B==2) {
cout<<count<<endl;
return 0;
}
B=A[B-1];
count++;
}
cout<<-1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool canstop=false;
vector<int> a(N);
for(int i=0;i<N;i++) cin >> a.at(i);
int now=0,cnt=0;
for(int i=0;i<N;i++){
if(now!=1){
now = a.at(now)-1;
cnt++;
}
else{
canstop = true;
break;
}
}
if(canstop) cout << cnt << endl;
else cout << -1 << endl;
return 0;
} | 1 | 89,506,032 |
#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()
{
ll n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i]--;
vector<int> ans(n);
rep(i,n) ans[a[i]] += i+1;
rep(i,n) cout << ans[i] << " ";
cout << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int A[N+1],B[N+1];
for(int i=1;i<=N;i++)cin>>A[i];
for(int i=1;i<=N;i++){
B[A[i]] = i;
}
for(int i=1;i<=N;i++){
cout << B[i] ;
if(i == N)cout<<endl;
else cout << " ";
}
} | 1 | 12,496,276 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define INF 1e9
#define PI 3.141592653589793238
typedef long long ll;
int main() {
int n,m; cin>>n>>m;
if(n>m) for(int i=0; i<n; i++) cout<<m;
else for(int i=0; i<m; i++) cout<<n;
cout<<endl;
return 0;
} | #include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int c,d;
c = stoi(a);
d = stoi(b);
string e,f;
rep(i,d) e += a;
rep(i,c) f += b;
if(a < b) cout << e << endl;
else cout << f << endl;
} | 1 | 29,997,603 |
#pragma GCC optimization ("O3")
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pb push_back
const int M=10000000000;
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
signed main()
{
fastio;
int t=1;
while(t--)
{
int a,b;
char op;
cin>>a>>op>>b;
if(op=='+')
cout<<a+b;
else
cout<<a-b;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, c;
char b;
int main () {
cin >> a >> b >> c;
if ((int)b == 43){
cout << a + c;
} else if ((int)b == 45){
cout << a - c;
}
} | 1 | 93,246,989 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
const int MOD = 1e9 + 7;
#define pow abcdef
int pow(int a, int b) {
if (b == 0) return 1;
int t = pow(a, b / 2);
t = (t * t) % MOD;
if (b % 2) return (a * t) % MOD;
return t;
}
int mmi(int x) {
return pow(x, MOD - 2);
}
void MAIN() {
int n;
cin >> n;
string s;
cin >> s;
map<char, int> m;
for (auto &i : s) {
m[i]++;
}
int ans = pow(2, n);
for (auto &i : m) {
ans *= ((i.sc + 1) * mmi(pow(2, i.sc))) % MOD;
ans %= MOD;
}
cout << ans - 1 << '\n';
}
signed main() {
#ifdef _DEBUG
freopen("in" , "r", stdin );
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
} | #include<cstdio>
using namespace std;
char s[100002];
int z[26];
int main(){
int n;
scanf("%d%s",&n,s+1);
for(int i=1;i<=n;i++)
z[s[i]-'a']++;
int ans=1;
for(int i=0;i<26;i++)
ans=1ll*ans*(z[i]+1)%1000000007;
printf("%d\n",(ans-1+1000000007)%1000000007);
} | 1 | 89,121,139 |
#include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int ans = N - K + 1;
cout << ans << '\n';
return 0;
} | #include<bits/stdc++.h>
#define fo0n for(int i=0;i<n;i++)
const int M =1e9+7;
const int N=1e5+3;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
using namespace std;
struct node{
int x,y;
};
void solve (){
int n,m;
cin>>n>>m;
cout<<n-m+1;
}
int main(){
int t=1;
while(t--){
solve();
}
} | 1 | 33,798,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
int n,m;
ll x[100001];
ll y[100001];
ll sumx[100001];
ll sumy[100001];
int main() {
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> x[i];
for(int j = 0; j < m; j++) cin >> y[j];
sumx[0] = x[0];
sumy[0] = y[0];
for(int i = 1; i < n; i++) sumx[i] = sumx[i-1] + x[i];
for(int i = 1; i < m; i++) sumy[i] = sumy[i-1] + y[i];
ll tmp1 = 0;
ll tmp2 = 0;
for(int i = 1; i < n; i++) tmp1 += (sumx[n-1] - sumx[i-1]) - (n - i) * x[i-1];
for(int i = 1; i < m; i++) tmp2 += (sumy[m-1] - sumy[i-1]) - (m - i) * y[i-1];
cout << (tmp1 % mod) * (tmp2 % mod) % mod << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define mk make_pair
const int MAXN = 112345;
const double PI = atan(1) * 4;
const int MOD = 1e9 + 7;
long long x[MAXN], y[MAXN];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%lld", &x[i]);
for(int i = 0; i < m; i++)
scanf("%lld", &y[i]);
long long totalx = 0, totaly = 0;
long long a = 0, b = n - 1LL;
for(int i = 0; i < n; i++) {
long long temp = ((a * x[i]) % MOD - (b * x[i]) % MOD) % MOD;
if(temp < 0LL) temp += MOD;
totalx = (totalx + temp) % MOD;
a++, b--;
}
a = 0, b = m - 1LL;
for(int i = 0; i < m; i++) {
long long temp = ((a * y[i]) % MOD - (b * y[i]) % MOD) % MOD;
if(temp < 0LL) temp += MOD;
totaly = (totaly + temp) % MOD;
a++, b--;
}
long long ans = (totalx * totaly) % MOD;
cout << ans << "\n";
return 0;
} | 1 | 36,999,205 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
int p1 = 0;
int p2 = 0;
cin >> n;
string a, b;
for(int i = 0 ; i < n ; i ++) {
cin >> a >> b;
if( a > b) {
p1 += 3;
} else if ( a == b) {
p1 += 1;
p2 += 1;
} else {
p2 += 3;
}
}
cout << p1 << " " << p2 << endl;
} | #include <iostream>
#include <string>
using std::cout;
using std::endl;
using std::cin;
using std::string;
string battle_check(string taro, string hanako) {
if (taro > hanako)
{
return "taro";
}
else if (taro < hanako) {
return "hanako";
}
else {
return "draw";
}
}
int main() {
int battle_num;
string taro_card;
string hanako_card;
int taro_score = 0;
int hanako_score = 0;
string result;
cin >> battle_num;
for (size_t i = 0; i < battle_num; i++)
{
cin >> taro_card;
cin >> hanako_card;
result = battle_check(taro_card, hanako_card);
if (result == "taro")
{
taro_score += 3;
}
else if (result == "hanako") {
hanako_score += 3;
}
else
{
taro_score += 1;
hanako_score += 1;
}
}
cout << taro_score << " " << hanako_score << endl;
return 0;
} | 1 | 17,528,632 |
#include "bits/stdc++.h"
using namespace std;
int main(){
double T,X;
cin >> T >> X;
cout << T/X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
int main(void){
double a,b;
cin>>a>>b;
cout<<a/b<<endl;
} | 1 | 37,817,131 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
template < typename T >
void vprint(T &V){
for(auto v : V){
cout << v << " ";
}
cout << endl;
}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
if(N==1){
p(1);
return 0;
}
ll left = 1;
ll right = N;
while(left+1!=right){
ll center = (left + right) / 2;
ll sum = center * (center+1) / 2;
if(sum >= N){
right = center;
}else{
left = center;
}
}
while(N!=0){
for(int i=right; i>=1; i--){
if(N>=i){
N -= i;
p(i);
}
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
while(cin >> N){
int e = 0;
while(e*(e+1)/2 < N) ++e;
vector<int> r;
for(int i=e;i>=1;i--){
if(N >= i){
r.push_back(i);
N -= i;
}
}
for(auto it=r.rbegin();it!=r.rend();++it) cout << *it << endl;
}
} | 1 | 22,992,145 |
#include<iostream>
int main(){
int a[5],i,j,n;
for(i=0;i<5;i++){
std::cin>>a[i];
}
for(i=0;i<4;i++){
for(j=i+1;j<5;j++){
if(a[i]<a[j]){
n=a[i];
a[i]=a[j];
a[j]=n;
}
}
}
std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<std::endl;
return 0;
} | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <cmath>
# include <iomanip>
# include <functional>
using namespace std;
int main() {
int a;
vector<int> v;
for (int i = 0; i < 5; i++) {
cin >> a;
v.emplace_back(a);
}
sort(v.begin(), v.end(), std::greater<int>());
for (int i = 0; i < 5; i++) {
cout << v[i];
if (i != 4) {
cout << " ";
}
else {
cout << endl;
}
}
} | 1 | 32,449,586 |
#include <iostream>
using namespace std;
int main()
{
int n;
int side[3];
cin >> n;
for (int i = 1; i <= n; i++){
for (int j = 0; j <= 2; j++){
cin >> side[j];
}
for (int j = 0; j < 2; j++){
if (side[j] >= side[j + 1]){
int s = side[j + 1];
side[j + 1] = side[j];
side[j] = s;
}
}
if ((side[2] * side[2]) == ((side[0] * side[0]) + (side[1] * side[1]))){
cout << "YES\n";
} else {
cout << "NO\n";
}
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
bool isRTri(int a, int b, int c)
{
return a * a + b * b == c * c;
}
int main()
{
int n;
cin >> n;
for (int k = 1; k <= n; k++)
{
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
bool r = isRTri(a[0], a[1], a[2]);
cout << (r ? "YES" : "NO") << endl;
}
return 0;
} | 1 | 31,674,467 |
#include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
if (A == B && B == C) cout << "Yes" << "\n";
else cout << "No" << "\n";
return 0;
} | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <cfenv>
using ll = unsigned long long;
using namespace std;
int gcd(int x,int y){
if(y==0){
return x;
}else{
return gcd(y,x%y);
}
}
int lcm(int x,int y){
return x/gcd(x,y)*y;
}
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b&&b==c){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | 1 | 35,082,089 |
#pragma GCC optimize("O3")
#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 <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
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;}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin>>n>>m;
vector<bool> use(10, false);
for(int i=0; i<m; i++){
int a; cin>>a;
use[a] = true;
}
vector<int> match = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> dp(n+1, -inf);
dp[0] = 0;
for(int i=1; i<=9; i++){
if(!use[i]) continue;
for(int j=0; j<=n; j++){
if(j - match[i] >= 0) chmax(dp[j], dp[j - match[i]] + 1);
}
}
string ans;
for(int i=n; i>0; ){
for(int j=9; j>=1; j--){
if(!use[j]) continue;
if(i - match[j] >= 0 && dp[i - match[j]] + 1 == dp[i]){
i -= match[j];
ans += to_string(j);
break;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll match[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[11000];
const string MINUSINF = "-";
void chmax_str(string &a, string b) {
if (a == MINUSINF) a = b;
else if (a.size() < b.size()) a = b;
else if (a.size() == b.size()) {
if (a < b) a = b;
}
}
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
rep(i, M) cin >> A[i];
rep(i, 11000) dp[i] = MINUSINF;
dp[0] = "";
rep(i, N) {
if (dp[i] == MINUSINF) continue;
for (auto a: A) {
chmax_str(dp[i + match[a - 1]], dp[i] + (char) ('0' + a));
}
}
cout << dp[N] << endl;
} | 1 | 94,112,306 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
std::cin >> n >> a;
int temp;
temp = n % 500;
if (temp <= a){
std::cout << "Yes" << std::endl;
}
else{
std::cout << "No" << std::endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
int N, A;
void input() {
cin >> N >> A;
}
int main() {
input();
string ans;
if (N % 500 <= A) ans = "Yes";
else ans = "No";
cout << ans << endl;
} | 1 | 96,660,469 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x) BEGIN(x), END(x)
#define PAIR make_pair
#define VEC(type) vector<type >
#define endl '\n'
#define FOR(i, A, B) for(auto i = (A);i != (B); i++)
#define FORD(i, A, B) for(auto i = (A);i != (B); i--)
#define READRANGE(begin, end) FOR(it, begin, end) cin >> *it
#define READVEC(V) READRANGE(BEGIN(V), END(V))
using namespace std;
typedef long long lint;
typedef pair<int, int> Pii;
typedef pair<int, lint> Pil;
typedef pair<lint, lint> Pll;
typedef pair<lint, int> Pli;
void io_init()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
int main(int argc, char **argv)
{
io_init();
int R;
cin >> R;
cout << R * R << endl;
return 0;
}; | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
cout << fixed << setprecision(10);
int N;
cin >> N;
cout << N*N << endl;
return 0;
} | 1 | 31,511,505 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
int main()
{
int n,d;
while (cin >> d)
{
int s = 0;
for (int i = 1; i < 600/d; i++)
{
s += d*i*d*i*d;
}
cout << s << endl;
}
return 0;
} | #include <bits/stdc++.h>
#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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
int main(){
int d;
while(cin>>d){
int s=0;
for(int x=d;x<600;x+=d) s+=x*x*d;
cout<<s<<endl;
}
} | 1 | 57,632,805 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin>>c;
char a = ++c;
cout<<a<<"\n";
return 0;
} | #include <stdio.h>
int main(){
char C;
int z;
scanf("%c", &C);
z= C+1;
printf("%c\n", z);
return 0;
} | 1 | 52,647,999 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;cin>>h>>w;
vector<vector<char>> in(h,vector<char>(w));
vector<vector<char>> out(h,vector<char>(w));
for(int i=0;i<h;++i)for(int j=0;j<w;++j)cin>>in[i][j];
for(int i=0;i<h;++i)for(int j=0;j<w;++j)out[i][j]='.';
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
bool r=false;
if(in[i][j]=='#'){
if(i>0)if(in[i-1][j]=='#')r=true;
if(i<h-1)if(in[i+1][j]=='#')r=true;
if(j>0)if(in[i][j-1]=='#')r=true;
if(j<w-1)if(in[i][j+1]=='#')r=true;
if(r)out[i][j]='#';
}
}
}
for(int i=0;i<h;++i) for(int j=0;j<w;++j)if(in[i][j]!=out[i][j])return cout<<"No",0;
cout<<"Yes";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s[i];
}
for (int i = 0; i != H; ++i) {
for (int j = 0; j != W; ++j) {
if (s[i][j] == '.') continue;
if ((!i || s[i - 1][j] == '.') && (i + 1 == H || s[i + 1][j] == '.') &&
(!j || s[i][j - 1] == '.') && (j + 1 == W || s[i][j + 1] == '.')) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | 1 | 28,974,681 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using pl = pair<ll,ll>;
using vvb=vector<vector<bool>>;
using vb= vector<bool>;
ll modpow(ll a,ll b,ll p){
if(b==0) return 1;
if(b%2==0){
ll t=modpow(a,b/2,p);
return t*t%p;
}
return a*(modpow(a,b-1,p))%p;
}
signed main(){
ll n,c,k; cin>>n>>c>>k;
vl vec(n);
rep(i,0,n) cin>>vec[i];
sort(all(vec));
vec.push_back(MOD*10);
ll ans=0;
ll memo=0;
rep(i,0,n+1){
if(vec[memo]+k<vec[i]){
memo=i;
++ans;
}
if(i-memo>=c)memo+=c,++ans;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n,c,k;
cin>>n>>c>>k;
vector<int> t(n);
rep(i,n) cin>>t[i];
sort(all(t));
int ans=0;
int i=0;
while(i<n){
ans++;
int start=i;
while(i<n && t[i]-t[start]<=k && i-start<c) i++;
}
cout<<ans<<endl;
} | 1 | 42,492,154 |
#include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;
void solve()
{
int n;
cin >> n;
i64 ans = 0, lo = 0;
for (int i = 0; i < n; i++)
{
i64 a;
cin >> a;
i64 k = (a - 1) / (lo + 1);
ans += k;
if (a == lo + 1 || i == 0)
lo++;
}
cout << ans << endl;
}
int main()
{
solve();
return 0;
} | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int a[100005];
bool able[100005];
int main() {
for (int i = 0; i < 100005; i++) {
able[i] = true;
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int p = 2;
LL ans = a[0] - 1;
for (int i = 1; i < n; i++) {
int times = (a[i] - 1) / p;
ans += times;
int r = a[i] - times * p;
if (times == 0) {
able[r] = false;
while (!able[p]) { p++; }
}
}
cout << ans << endl;
} | 1 | 41,864,231 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
ll N,A,B; cin >>N>>A>>B;
ll ans=B*(N-1)+A-A*(N-1)-B+1;
if ((N==1&&A!=B)||(A>B))ans=0;
cout<<ans;
return 0;
} | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N,A,B;
cin >> N >> A >> B;
ll out = 0;
if(N==1){
if(A==B) out = 1;
}
else if(B<A);
else out = (N-2)*(B-A)+1;
cout << out << endl;
return 0;
} | 1 | 72,930,729 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 998244353;
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
struct inp {
std::size_t szi, szj;
inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
};
inp inp1;
}
int main() {
int n = inp1;
vector<ll> x = inp(n);
ll l = inp1;
int q = inp1;
vector<int> a(q), b(q);
rep(i, q) cin >> a[i] >> b[i], --a[i], --b[i];
rep(i, q) if (a[i] > b[i]) swap(a[i], b[i]);
vector<int> next(n);
rep(i, n) {
ll to = x[i] + l;
next[i] = upper_bound(allof(x), to) - x.begin() - 1;
chmax(next[i], 0);
}
vector<vector<int>> dp(n, vector<int>(62, 0));
rep(i, n) dp[i][0] = next[i];
rep(j, 61) {
rep(i, n) {
dp[i][j + 1] = dp[dp[i][j]][j];
}
}
rep(i, q) {
int goal = b[i];
int left = 0;
int right = n + 1;
while (right - left > 1) {
int mid = (right + left) / 2;
int cur = a[i];
int cnt = 0;
int mask = 1;
while (mask <= mid) {
if (mask & mid) cur = dp[cur][cnt];
++cnt;
mask <<= 1;
}
if (cur >= goal) right = mid;
else left = mid;
}
Cout(left + 1);
}
return 0;
} | #include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=(x<<1)+(x<<3)+(c^48);c=getchar();}
return x*f;
}
const int maxn(1e5+5);
ll n,l,q;
ll s[maxn],f[maxn][35];
void swap(ll &a,ll &b){int t=a;a=b;b=t;}
void init(){
n=read();
for (int i(1);i<=n;++i) s[i]=read();
l=read(),q=read();
for (int i(1);i<=n;++i) f[i][0]=upper_bound(s+1,s+n+1,s[i]+l)-s-1;
for (int i(1);i<=30;++i)
for (int j(1);j<=n;++j)
f[j][i]=f[f[j][i-1]][i-1];
}
signed main(){
init();
while (q--){
int a=read(),b=read(),tot=0;
if (a>b) swap(a,b);
int v=a;
for (int i=30;~i;--i){
if (f[v][i]<b){
tot+=1<<i;
v=f[v][i];
}
}
printf("%d\n",tot+1);
}
return 0;
} | 1 | 90,945,373 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
const int MAX = 1200000;
struct edge {
ll to;
ll cost;
};
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') return 0;
if (c == '1') return 1;
if (c == '2') return 2;
if (c == '3') return 3;
if (c == '4') return 4;
if (c == '5') return 5;
if (c == '6') return 6;
if (c == '7') return 7;
if (c == '8') return 8;
if (c == '9') return 9;
return -1;
}
char to_char(int i){
if (i == 0) return '0';
if (i == 1) return '1';
if (i == 2) return '2';
if (i == 3) return '3';
if (i == 4) return '4';
if (i == 5) return '5';
if (i == 6) return '6';
if (i == 7) return '7';
if (i == 8) return '8';
if (i == 9) return '9';
return ' ';
}
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1) ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
int main() {
cout << fixed << setprecision(16);
int N, M;
cin >> M >> M;
vector<vector<int>> T(M, vector<int>(3));
for (int i = 0; i < M; i++) {
cin >> T.at(i).at(0) >> T.at(i).at(1);
T.at(i).at(2) = i;
}
sort(T.begin(), T.end());
vector<string> P(M), Y(M);
string S = to_string(T.at(0).at(0));
for (int j = int(S.size()); j < 6; j++) {
S = '0' + S;
}
P.at(T.at(0).at(2)) = S;
Y.at(T.at(0).at(2)) = "000001";
int C = 2;
for (int i = 1; i < M; i++) {
string S = to_string(T.at(i).at(0));
for (int j = int(S.size()); j < 6; j++) {
S = '0' + S;
}
P.at(T.at(i).at(2)) = S;
if (T.at(i).at(0) == T.at(i - 1).at(0)) {
string Q = to_string(C);
C++;
for (int j = int(Q.size()); j < 6; j++) {
Q = '0' + Q;
}
Y.at(T.at(i).at(2)) = Q;
}
else {
C = 2;
Y.at(T.at(i).at(2)) = "000001";
}
}
for (int i = 0; i < M; i++) {
cout << P.at(i) << Y.at(i) << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
int n,m; cin >> n >> m;
vector<P> data(m);
vector<vector<int> > num(n);
rep(i,m){
int p,y; cin >> p >> y;
p--;
data[i].first=p;
data[i].second=y;
num[p].push_back(y);
}
rep(i,n){
sort(all(num[i]));
}
rep(i,m){
int p,y;
p=data[i].first;
y=data[i].second;
auto it=lower_bound(all(num[p]),y);
int ans=it-num[p].begin();
ans++;
p++;
int tmpp=p;
int tmpans=ans;
int pmod=0;
int ansmod=0;
while(tmpp){
tmpp/=10;
pmod++;
}
while(tmpans){
tmpans/=10;
ansmod++;
}
rep(j,6-pmod) printf("0");
printf("%d",p);
rep(j,6-ansmod) printf("0");
printf("%d",ans);
puts("");
}
return 0;
} | 1 | 20,937,203 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f)))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
ll mod_div(ll a,ll b){
ll tmp=MOD-2,c=b,ret=1;
while(tmp>0){
if(tmp&1){
ret*=c;ret%=MOD;
}
c*=c;c%=MOD;tmp>>=1;
}
return a*ret%MOD;
}
#define MAX_K 2000100
vector<ll> kaijo(MAX_K);
ll combination(ll n, ll r){
if(n<r||n<0||r<0)
return 0;
if(kaijo[0]!=1){
kaijo[0]=1;
for(ll i=1;i<MAX_K;i++)kaijo[i]=(kaijo[i-1]*i)%MOD;
}
ll ret=kaijo[n];
long long tmp = (kaijo[r] * kaijo[n-r]) % MOD;
return mod_div(ret,tmp);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
vi A(n+1);
ll num = 0;
vi cnt(n+1);
for(auto &a:A){cin>>a;cnt[a]++;if(cnt[a] == 2)num = a;}
cout<<n<<endl;
ll l=-1,r=-1;
for(int i=0;i<n+1;i++){
if(A[i] == num){
if(l == -1)l = i;
else if(r == -1)r = i;
}
}
for(ll i=2;i<=n+1;i++){
cout<<(combination(n+1,i)-combination(l+n-r,i-1)+MOD)%MOD<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mo 1000000007
#define MAX 100004
#define fast_io ios::sync_with_stdio(false)
long long fact[MAX];
long long pow(int a, int b, int MOD)
{
long long x=1,y=a;
while(b > 0)
{
if(b%2 == 1)
{
x=(x*y);
if(x>MOD) x%=MOD;
}
y = (y*y);
if(y>MOD) y%=MOD;
b /= 2;
}
return x;
}
long long InverseEuler(int n, int MOD = mo)
{
return pow(n,MOD-2,MOD);
}
ll nCr(int n, int r)
{
if(n<r)
return 0;
ll temp = (1ll*((1ll*fact[n]*InverseEuler(fact[r], mo))%mo)*InverseEuler(fact[n-r],mo))%mo;
return temp;
}
void pre()
{
fact[0]=1;
for(int i=1;i<MAX;i++)
fact[i] = (1ll*fact[i-1]*i)%mo;
}
int a[MAX];
int main()
{
pre();
fast_io;
int n;
cin >> n;
int d = 0;
for(int i=1;i<=(n+1);i++)
{
int x;
cin >> x;
if(a[x])
{
d = i - a[x];
}
a[x] = i;
}
long long temp;
for(int k=1;k<=(n+1);k++)
{
temp = ((nCr(n+1, k) - nCr(n - d, k - 1))%mo + mo)%mo;
cout << temp << "\n";
}
return 0;
} | 1 | 80,655,146 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
float ans = 0.0, A;
cin >> N;
for(int i=1;i<=N;i++) {
cin >> A;
ans += 1.0/A;
}
ans = 1.0/ans;
cout << setprecision(16) << ans << endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
long double res = 0;
for (int i=0; i < n; i++) {
long double x; cin >> x;
x = 1/x;
res += x;
}
long double nres = 1/res;
cout << nres;
return 0;
} | 1 | 33,499,377 |
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
char ch;
while(1) {
scanf("%c", &ch);
if(ch == '0'){
break;
}
int sum = ch - '0';
while(1){
scanf("%c", &ch);
if(ch == '\n') break;
sum += int(ch) - '0';
}
cout << sum <<endl;
}
return 0;
} | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
string x;
int total=0;
int i=0;
while(1){
cin >> x;
if(x=="0") break;
else{
total=0;
i=0;
while(i<x.size()){
total+=x[i]-'0';
i++;
}
cout <<total <<endl;
}
}
return 0;
} | 1 | 87,704,285 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define u unsigned
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define ci m(char, ll)
#define ii m(ll, ll)
#define mid(a,b) ((a+b)/2)
#define pb push_back
#define LCM(a,b) ((a*b)/__gcd(x,y))
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
class triplet{
ll f, s, t;};
vl in(ll n){vl v;ll x;
f(i,n)
cin>>x, v.pb(x);
return v;}
void out(vl v){
fl(i,v)cout<<i;
}
void out(vl v, char ch){
fl(i,v)
cout<<i<<ch;
}
void solve(){
ll N,ans=-1 ,size=1;
cin>>N;
vl v=in(N);
f(i, N-1)
if(v[i+1]<=v[i])
size++;
else{
ans=max(ans, size);
size=1;
}
cout<<max(ans, size)-1;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N; cin >> N;
int Ai; cin >> Ai;
int vmax = 0;
int cnt = 0;
for (int i = 1; i < N; ++i) {
int A; cin >> A;
if (Ai >= A) {
Ai = A; ++cnt;
} else {
Ai = A; cnt = 0;
}
vmax = max(vmax, cnt);
}
cout << vmax << endl;
} | 1 | 5,755,145 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> r(n,0);
for (int i=0; i<n; i++) {
cin >>r[i];
r[i] --;
}
int ans = 0;
for (int i=0; i<n; i++){
if(r[r[i]]==i){
ans ++;
r[r[i]]=-1;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n, i, a[100100], ans=0;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
a[i]--;
}
for(i=0;i<n;i++){
if(a[i]!=-1){
if(a[a[i]]==i){
ans++;
a[a[i]]=-1;
}
}
}
cout << ans <<endl;
} | 1 | 18,259,539 |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
vi a(n+1);
rep(i,n) cin >> a.at(i);
a.at(n) = 0;
int64_t sum = abs(a.at(0));
rep(i,n-1){
sum += abs(a.at(i+1) - a.at(i));
}
sum += abs(a.at(n-1));
vi res(n);
if((a.at(1) - a.at(0) >= 0 && a.at(0) >= 0) ||
(a.at(1) - a.at(0) <= 0 && a.at(0) <= 0)){
res.at(0) = sum;
}else{
res.at(0) = sum - (abs(a.at(1) - a.at(0)) + abs(a.at(0)))
+ abs(a.at(1));
}
for(int i=1; i<n; i++){
if((a.at(i+1) - a.at(i) >= 0 && a.at(i) - a.at(i-1) >= 0) ||
(a.at(i+1) - a.at(i) <= 0 && a.at(i) - a.at(i-1) <= 0)){
res.at(i) = sum;
}else{
res.at(i) = sum - (abs(a.at(i+1) - a.at(i)) + abs(a.at(i) - a.at(i-1)))
+ abs(a.at(i+1) - a.at(i-1));
}
}
rep(i,n) cout << res.at(i) << endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }
int main(){
int N;
cin >> N;
vector<int> A(N + 1);
A[0] = 0;
for(int i = 1; i < N+1; i++) cin >> A[i];
ll sum = 0;
for(int i = 0; i < N; i++)
{
sum += abs(A[i] - A[i+1]);
}
sum += abs(A[N] - A[0]);
for(int i = 1; i < N; i++)
{
sum = sum - abs(A[i- 1] - A[i]) - abs(A[i] - A[i + 1]) + abs(A[i - 1] - A[i + 1]);
cout << sum << endl;
sum = sum + abs(A[i- 1] - A[i]) + abs(A[i] - A[i + 1]) - abs(A[i - 1] - A[i + 1]);
}
sum = sum - abs(A[N] - 0) - abs(A[N - 1] - A[N]) + abs(A[N - 1] - 0);
cout << sum << endl;
} | 1 | 64,932,714 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int cnt;
int main() {
ios_base::sync_with_stdio(false);
cin >> s >> t;
cnt = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] != t[i]) cnt++;
}
cout << cnt;
} | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define boost ios::sync_with_stdio(0); cin.tie(0);
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
boost;
int count = 0;
string s, t;
cin >> s >> t;
int len = s.length();
FOR(i, 0, len) {
if (s[i] != t[i]) {count += 1;}
}
cout << count << endl;
} | 1 | 97,001,951 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, d;
cin >> n >> d;
vector<vector<double>> x(n, vector<double>(d));
rep(i,n)rep(j,d) cin >> x[i][j];
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
double dist = 0;
rep(k,d) {
dist += (x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
}
dist = sqrt(dist);
int idist = (int)dist;
if (dist == (double)idist) ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d){
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
double dist = 0.0;
for(int k=0; k<d; k++){
dist += (x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
}
dist = sqrt(dist);
if((dist-(int)dist) < 0.00001){
ans++;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 30,817,120 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
int A, B;
cin >> A >> B;
string U;
cin >> U;
if (U == S)
A--;
else
B--;
cout << A << " " << B << endl;
return 0;
} | #include <stdio.h>
#include <string.h>
int main()
{
char S[255], T[255];
scanf("%s%s", S, T);
int A,B;
scanf("%d%d", &A, &B);
char U[20];
scanf("%s", U);
int result1 = strcmp(S,U);
int result2 = strcmp(T,U);
if (result1 == 0)
{
A = A - 1;
}
if (result2 == 0)
{
B = B - 1;
}
printf("%d%s%d", A," ", B);
return 0;
} | 1 | 5,432,141 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool a = 0;
int n = s.length();
if (n == 2 && s[0] == s[1]) {
cout << 1 << " " << 2;
a = 1;
}
if (a == 0)
for (int i = 0; i < n - 2; i++) {
if (s[i] == s[i + 1] || s[i] == s[i + 2]) {
cout << i + 1 << " " << i + 3;
a = 1;
break;
}
}
if (a == 0) {
if (s[n - 2] == s[n - 1]) cout << n - 2 << " " << n;
else cout << -1 << " " << -1;
}
} | #include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=2e18;
const ll MOD=1e9+7;
string s;
int main(){
cin>>s;
for(ll i=0;i<s.length()-1;i++){
if(s[i]==s[i+1]){
cout<<i+1<<" "<<i+2<<endl;
return 0;
}
if(i==s.length()-2)continue;
if(s[i]==s[i+2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<"-1 -1"<<endl;
return 0;
} | 1 | 68,330,157 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
void solve(long long N, std::vector<long long> A){
LL b=0;
for(auto a:A){
b^=a;
}
LL s=0;
for(int i=60;i>=0;i--){
LL u=1LL<<i;
if(b&u)continue;
for(int j=0;j<A.size();j++){
if(A[j]&u){
if(!(s&u)){
s^=A[j];
}
for(int k=j+1;k<A.size();k++){
if(A[k]&u){
A[k]^=A[j];
}
}
A[j]=0;
break;
}
}
}
cout << (b^s)+s << endl;
}
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 <iostream>
#include <string>
#include <queue>
#define llint long long
using namespace std;
llint n;
llint a[100005];
void GaussianElimination(llint a[], int n)
{
llint r = 0;
for(int i = 59; i >= 0 && r < n; i--){
if((a[r]&(1LL<<i)) == 0){
int p = -1;
for(int j = r+1; j < n; j++){
if(a[j] & (1LL<<i)){
p = j;
break;
}
}
if(p == -1) goto end;
swap(a[r], a[p]);
}
for(int j = 0; j < n; j++){
if(j == r) continue;
if(a[j]&(1LL<<i)) a[j] ^= a[r];
}
r++;
end:;
}
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
llint ans = 0;
for(int i = 0; i < 60; i++){
llint cnt = 0;
for(int j = 0; j < n; j++) if(a[j] & (1LL<<i)) cnt++;
if(cnt % 2){
ans += (1LL<<i);
for(int j = 0; j < n; j++) a[j] &= ~(1LL<<i);
}
}
GaussianElimination(a, n);
llint tmp = 0, pre = 0;
for(int i = 59; i >= 0; i--){
if(tmp & (1LL<<i)) continue;
for(int j = pre; j < n; j++){
for(int k = 59; k >= i+1; k--){
if(a[j] & (1LL<<k)) goto pass;
}
if(a[j] & (1LL<<i)) tmp ^= a[j], pre = j;
break;
pass:;
}
}
ans += tmp * 2;
cout << ans << endl;
return 0;
} | 1 | 9,515,224 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
#define EPS 1e-10
#define EQUAL(a, b) (fabs((a)-(b))<EPS)
typedef vector<int> vi;
int main()
{
int n;
scanf("%d", &n);
rep(i, n){
double x1, y1, x2, y2, x3, y3, x4, y4;
scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &x1, &y1, &x2, &y2, &x3, &y3, &x4, &y4);
puts(EQUAL((x2-x1)*(y4-y3), (y2-y1)*(x4-x3)) ? "YES" : "NO");
}
return 0;
} | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
double x1,y1,x2,y2,x3,y3,x4,y4;
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if((x1==x2&&y1==y2)||(x3==x4&&y3==y4))cout<<"NO"<<endl;
else if(fabs(x2-x1)<0.00000000001&&fabs(x4-x3)<0.00000000001)cout<<"YES"<<endl;
else if(fabs((y2-y1)/(x2-x1)-(y4-y3)/(x4-x3))<0.0000000000001)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
} | 1 | 70,799,899 |
#include<bits/stdc++.h>
#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;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
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(){
cout << fixed << setprecision(10);
ll n,a,b;
cin >> n >> a >> b;
if(n == 1){
if(a != b){
cout << 0 << endl;
return 0;
}else{
cout << 1 << endl;
return 0;
}
}
if(a > b){
cout << 0 << endl;
return 0;
}
if(a == b){
cout << 1 << endl;
return 0;
}
cout << b * (n - 1) + a - (a * (n - 1) + b) + 1 << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF=1LL<<60;
ll n,a,b,maxv,minv;
int main(){
cin>>n>>a>>b;
if(a>b) cout<<0<<"\n";
else if(n==1 && a!=b) cout<<0<<"\n";
else{
minv=a*(n-1)+b;
maxv=b*(n-1)+a;
cout<<maxv-minv+1<<"\n";
}
return 0;
} | 1 | 58,312,771 |
#include<stdio.h>
int main()
{
int a,b,c;
scanf("%d %d %d", &a,&b,&c);
if (a < b)
if (b < c)
printf("Yes\n");
else
printf("No\n");
else
printf("No\n");
return 0;
} | #include <cstdlib>
#include <string>
#include <iostream>
std::string get_range(int a, int b, int c) {
std::string ans;
if (a < b && b < c) {
ans = std::string {"Yes"};
} else {
ans = std::string {"No"};
}
return ans;
}
int main() {
int a;
int b;
int c;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cout << get_range(a, b, c) << std::endl;
return EXIT_SUCCESS;
} | 1 | 67,371,117 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N,H; cin>>N>>H;
vector<int> a(N), b(N);
for(int i=0; i<N; i++)
cin>>a[i]>>b[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
int mx=a[0], ret=0;
for(int i=0; i<N; i++)
if(b[i]>mx&&H>0) H-=b[i], ret++;
if(H>0) ret+=(H+mx-1)/mx;
cout<<ret<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
int n;cin>>n;
ll h;cin>>h;
vector<ll> a(n),b(n);
rep(i,n)cin>>a[i]>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
int ok = 1;
ll ans =0,dmg=0;
int i = 0;
while(ok){
if(a[0]<b[i]){
dmg += b[i];
ans++;i++;
}
else if(i>=n||a[0]>=b[i]){
ok = 0;
if((h-dmg)%a[0]==0)ans += (h-dmg)/a[0];
else ans += (h-dmg)/a[0]+1;
}
if(dmg>=h)ok = 0;
}
cout<<ans<<endl;
return 0;
} | 1 | 22,073,196 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int i=0; i<=n; i++) cin>>a[i];
ll ans=0;
l[n+1]=0,r[n+1]=0;
for(int i=n; i>=0; --i)
{
l[i]=l[i+1]/2+l[i+1]%2;
r[i]=r[i+1];
l[i]+=a[i];
r[i]+=a[i];
if(l[i]>Pow2(i))
{
cout<<-1<<endl;
return 0;
}
r[i]=min(r[i],Pow2(i));
}
for(int i=1; i<=n-1; i++)
{
ll x=l[i-1],y=r[i-1];
x-=a[i-1];
y-=a[i-1];
y=2*y;
l[i]=max(l[i],x);
r[i]=min(r[i],y);
}
for(int i=0; i<=n; i++)
{
ans+=r[i];
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define nin(n) int n; cin >> n;
#define kin(k) int k; cin >> k;
int main() {
int n; cin>> n;
vector<long long> a(101010);
vector<long long> mi(101010);
vector<long long> max(101010);
for(int i=0;i<=n;i++){
cin >> a[i];
}
if(n==0){
if(a[0]==1){
cout << "1";
}
else{
cout <<"-1";
}
}
else{
mi[n]=a[n];
max[n]=a[n];
for(int i=n-1;i>=0;i--){
max[i]=max[i+1]+a[i];
if(mi[i+1]%2==0){
mi[i]=mi[i+1]/2+a[i];
}
else{
mi[i]=mi[i+1]/2+1+a[i];
}
}
if(mi[0]>1||max[0]<1||a[0]!=0){
cout << "-1" << endl;
}
else{
long long ans=1;
long long tmp=1;
for(int i=1;i<n+1;i++){
ans=ans+min(2*tmp,max[i]);
tmp=min(2*tmp,max[i])-a[i];
}
cout << ans << endl;
}
}
} | 1 | 40,402,625 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> pi;
typedef pair<int,int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(vi c, vi d){
return c.S < d.S;
}
int main() {
ll T, N, H, K;
long long T1, N1;
cin >> T >> N >> H >> K;
if((T > N? (long long)T-N:(long long)N-T) > 10e18) cout << "Unfair";
else{
T1 = (long long) T;
N1 = (long long) N;
cout << (K%2==0? T1-N1: N1-T1);
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k;
cin >> a >> b >> c >> k;
if(abs(a-b)>=1000000000000000000){cout << "Ubfair" << endl;}
else{
if(k%2==0)cout << a-b << endl;
else cout << b-a << endl;
}
return 0;
} | 1 | 69,714,878 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++i)
#define repr(i,n) for(int _i=(n),i=_i;i>0;--i)
#define db(x) cerr<<#x<<" = "<<x<<" ";
#define db2(x,y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<") ";
#define db3(x,y,z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = ("<<x<<", "<<y<<", "<<z<<") ";
#define ln cout<<endl;
#define all(a) (a).begin(),(a).end()
#define dig(n) to_string(n).length()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define se second
#define fi first
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,pii> ppii;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
bool flag=false;
ll ans=0,sum=0;
int n;
cin >>n;
vector<int> a(n),b(n);
vector<int> a_b(n);
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
ll luck=0;
rep(i,n){
a_b[i]=a[i]-b[i];
if(a[i]-b[i] < 0){
ans++;
luck+=a[i]-b[i];
}
}
sort(all(a_b),greater<int>());
rep(i,n+1){
if(sum + luck >= 0){
flag=true;
break;
}
if(a_b[i] < 0)break;
if(i<n){
sum +=a_b[i];
ans++;
}
}
if(flag)cout<<ans<<endl;
else puts("-1");
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
vi diff(n);
rep(i, n) diff[i] = a[i] - b[i];
sort(diff.begin(), diff.end());
int neg = lower_bound(diff.begin(), diff.end(), 0) - diff.begin();
ll neg_sum = 0;
rep(i, neg) {
neg_sum += diff[i];
}
int ans = neg;
for (int i = n-1; i >= 0 ; --i) {
if (neg_sum >= 0) {
break;
}
if (diff[i] <= 0) {
ans = -1;
break;
} else {
neg_sum += diff[i];
ans++;
}
}
cout << ans << endl;
} | 1 | 36,518,852 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int N;
cin >> N;
int K = 0,cnt = 1;
for(;K < N;cnt++)K += cnt;
if(K != N){
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
cout << cnt << endl;
vector<int> V[cnt];
int re = cnt-1,idx1 = 0,idx2 = 1;
rep(i,1,N+1){
V[idx1].push_back(i);
V[idx2].push_back(i);
if(idx2 == cnt-1){
idx1++;
idx2 = idx1 + 1;
}else idx2++;
}
rep(i,0,cnt){
cout << cnt - 1 << " ";
rep(j,0,cnt-1)cout << V[i][j] << " \n"[j==cnt-2];
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
long x=1;
for(; x*(x+1)<2*n; ++x);
if (x*(x+1)!=2*n) {
cout<<"No"<<endl;
return 0;
}
auto y=x+1;
vector<vector<int>> a(y, vector<int>(x));
for(int r1=0, c1=0, r2=1, c2=0, i=1; i<=n; ++i) {
a[r1][c1]=a[r2][c2]=i;
c1++;
if (c1==x) { r1++; c1=r1; }
r2++;
if (r2==y) { r2=r1+1; c2=c1; }
}
cout<<"Yes"<<endl;
cout<<y<<endl;
for(auto& v: a) {
cout<<v.size();
for(auto& e: v) cout<<' '<<e;
cout<<endl;
}
} | 1 | 57,603,938 |
#include <algorithm>
#include <iostream>
#include <climits>
using namespace std;
const int N = 5000;
int ii[N], cc[N], qu[N];
bool visited[N];
int main() {
int n, k; cin >> n >> k;
for (int i = 0; i < n; i++) {
int p; cin >> p, p--;
ii[i] = p;
}
for (int i = 0; i < n; i++)
cin >> cc[i];
long long ans = LLONG_MIN;
for (int i = 0; i < n; i++) {
fill(visited, visited + n, false);
int cnt = 0;
int i_ = i;
while (!visited[i_]) {
qu[cnt++] = i_;
visited[i_] = true;
i_ = ii[i_];
}
int m = 0;
int i__ = i;
while (i__ != i_) {
m++;
i__ = ii[i__];
}
if (k < m) {
long long a = 0;
for (int h = 0; h < k; h++)
ans = max(ans, a += cc[qu[h]]);
} else {
long long a = 0;
for (int h = 0; h < m; h++)
ans = max(ans, a += cc[qu[h]]);
long long b = 0;
for (int h = m; h < cnt; h++) {
if (0 < h && h <= k)
ans = max(ans, a + b);
b += cc[qu[h]];
}
if (b > 0) {
long long b_ = 0;
for (int h = m; h < cnt && h <= k; h++) {
ans = max(ans, a + (k - h) / (cnt - m) * b + b_);
b_ += cc[qu[h]];
}
}
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
P.at(i)--;
}
for (int i = 0; i < N; i++) cin >> C.at(i);
long long int ans = -1000000000000000000;
for (int i = 0; i < N; i++) {
int v = i;
long long int cycle_sum = 0;
int cycle_cnt = 0;
while (true) {
cycle_cnt++;
cycle_sum += C.at(v);
v = P.at(v);
if (v == i) break;
}
long long int path = 0;
int cnt = 0;
while (true) {
cnt++;
path += C.at(v);
if (cnt > K) break;
int num = (K - cnt) / cycle_cnt;
long long int score = path;
if (cycle_sum > 0) score += cycle_sum * num;
ans = max(ans, score);
v = P.at(v);
if (v == i) break;
}
}
cout << ans << endl;
} | 1 | 81,729,119 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S;
cin >> S;
int ans0 = 0;
for (int n = 0;n<S.size();++n) {
if (1 == n%2) {
if ('0' != S[n]) {
ans0++;
}
}
else {
if ('1' != S[n]) {
ans0++;
}
}
}
int ans1 = 0;
for (int n = 0; n < S.size(); ++n) {
if (1 == n % 2) {
if ('1' != S[n]) {
ans1++;
}
}
else {
if ('0' != S[n]) {
ans1++;
}
}
}
cout << min(ans0,ans1) <<endl;
} | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
string s;
cin >> s;
int n = s.size();
int cnt = 0;
if(s[0]=='0'){
for(int i=0; i<n; ++i){
if(i%2==0){
if(s[i]!='0') cnt++;
}
else if(i%2==1){
if(s[i]!='1') cnt++;
}
}
}
int cnt1 = 0;
if(s[0]=='1'){
for(int i=0; i<n; ++i){
if(i%2==0){
if(s[i]!='1') cnt1++;
}
else if(i%2==1){
if(s[i]!='0') cnt1++;
}
}
}
cout << max(cnt, cnt1);
return 0;
} | 1 | 69,753,226 |
#include<bits/stdc++.h>
using namespace std;
int n,m,i,j,d,x,y;
int main()
{
cin>>x;n=x/100;y=100*n+10*n+n;
if(x<=y)return cout<<y,0;
else return n++,cout<<100*n+10*n+n,0;
} | #include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
void solve() {
int n;
cin >> n;
int ans;
string is;
rep(n, 1000) {
is = to_string(i);
if (is[0] == is[1] && is[1] == is[2]) {
ans = i;
break;
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | 1 | 85,234,443 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int S = 0, T = 0;
for (int i = 0; i < 4; ++i) {
int temp;
cin >> temp;
S += temp;
}
for (int i = 0; i < 4; ++i) {
int temp;
cin >> temp;
T += temp;
}
cout << max(S, T) << endl;
return 0;
} | #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 = "";
vector <vector <int> > score (2, vector <int> (4, 0 ) );
int i, j;
for (i = 0; i < 2; ++i){
getline (cin, str );
stringstream ss(str);
for (j = 0; j < 4; ++j){
ss >> score[i][j];
}
}
vector <int> total (2, 0 );
for (i = 0; i < 2; ++i){
total[i] = accumulate (score[i].begin(), score[i].end(), 0 );
}
cout << max (total[0], total[1] ) << endl;
return 0;
} | 1 | 12,945,367 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
ll dp[1002][10002];
void solve() {
int h, n;
cin >> h >> n;
vector<ll> a(n), b(n);
rep(i,n) cin >> a[i] >> b[i];
for (int i = n; i >= 0; i--) {
for (int j = 0; j <= h; j++) {
if (j == 0) dp[i][j] = 0;
else if (i == n) {
dp[i][j] = INF;
} else {
dp[i][j] = min(dp[i][max(0ll, j - a[i])] + b[i], dp[i + 1][j]);
}
}
}
cout << dp[0][h] << endl;
}
int main() {
solve();
return 0;
} | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int h,n; cin >> h >> n;
vi a(n),b(n); rep(i,n) cin >> a[i] >> b[i];
const int INF = 1001001001;
vector<vi> dp(n+1,vi(h+1,INF));
dp[0][0] = 0;
rep(i,n) rep(j,h+1){
chmin(dp[i+1][j],dp[i][j]);
int next_j = min(h,j+a[i]);
chmin(dp[i+1][next_j],dp[i+1][j]+b[i]);
}
cout << dp[n][h];
cout << "\n";
return 0;
} | 1 | 73,244,366 |
#include<iostream>
using namespace std;
int main(){
double a,b,c,d,e,f,g,h;
int n;
int x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d>>e>>f>>g>>h;
x=(d-b)/(c-a);
y=(h-f)/(g-e);
if((d-b)/(c-a)==(h-f)/(g-e)){cout<<"YES"<<endl;}
else {cout<<"NO"<<endl;}
}
} | #include <iostream>
using namespace std;
class Vector2{
public:
Vector2() : x( 0.0 ), y( 0.0 ){}
Vector2( double aX, double aY ) : x( aX ), y( aY ){}
double cross( Vector2& v ){
return ( x * v.y ) - ( y * v.x );
}
void operator-=( Vector2& v ){
x -= v.x;
y -= v.y;
}
double x, y;
};
int main(){
int n;
cin >> n;
Vector2* a = new Vector2[ n ];
Vector2* b = new Vector2[ n ];
Vector2* c = new Vector2[ n ];
Vector2* d = new Vector2[ n ];
for ( int i = 0; i < n; ++i ){
cin >> a[ i ].x >> a[ i ].y >> b[ i ].x >> b[ i ].y >> c[ i ].x >> c[ i ].y >> d[ i ].x >> d[ i ].y;
}
for ( int i = 0; i < n; ++i ){
a[ i ] -= b[ i ];
c[ i ] -= d[ i ];
cout << ( !a[ i ].cross( c[ i ] ) ? "YES" : "NO" ) << endl;
}
delete[] a;
delete[] b;
delete[] c;
delete[] d;
return 0;
} | 1 | 93,684,466 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long ll;
typedef pair<ll,ll> P;
int n;
bool use[1010101] = {0};
int main(){
cin >> n;
int cnt = 0, i;
for(i = 1; cnt < n; i++){
cnt += i;
}
if(cnt == n){
for(int j = 1; j < i; j++){
cout << j << endl;
}
return 0;
}
for(int j = 1; j < i; j++){
if(j == cnt - n) continue;
cout << j << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int N;
int i;
int sum = 0;
vector<int> ans;
cin >> N;
for (i = 1; i <= N; i++)
{
if (sum > N)
break;
sum += i;
}
for (int j = 1; j < i; j++)
{
if (sum - j != N)
{
cout << j << endl;
}
}
return 0;
} | 1 | 67,410,052 |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
const int MX = 1e3 + 5;
int main() {
int a, b, c;
cin >> a >> b >> c;
(c >= a && c <= b) ? cout << "Yes\n" : cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define tc int tt; scf(tt); while(tt--)
#define inf INT_MAX
#define ninf INT_MIN
#define gcd __gcd
#define bitcount(n) __builtin_popcount(n)
typedef double dd;
using namespace std;
const ll M =1e9+7;
const int N = 1e5+7;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
vector<int> adj[N];
bool vis[N]={0};
void dfs(int x)
{
vis[x]=1;
for(auto it:adj[x])
if(!vis[it])
dfs(it);
}
int main()
{
int a,b,c;
scf(a),scf(b),scf(c);
if(a<=c&&b>=c)
cout<<"Yes\n";
else
cout<<"No\n";
} | 1 | 86,759,145 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define MP make_pair
#define MT make_tuple
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
ll POW(ll x,ll n){
x%=MOD;
if(n==0)return 1;
if(n%2==0)return POW(x*x,n/2)%MOD;
return x%MOD*POW(x,n-1)%MOD;
}
ll POW2(ll x,ll n){
if(n==0)return 1;
if(n%2==0)return POW2(x*x,n/2);
return x*POW2(x,n-1);
}
ll POW3(ll x,ll n,ll m){
x%=m;
if(n==0)return 1;
if(n%2==0)return POW3(x*x,n/2,m)%m;
return x*POW3(x,n-1,m)%m;
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v; u = v; v = r;
}
return u;
}
ll lcm(ll u, ll v) {
return u/gcd(u,v)*v;
}
ll KAI(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI(m-1)%MOD;
}
ll KAI2(ll m)
{
if(m<0) return 0;
if(m==0) return 1;
return m*KAI2(m-1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI(m)%MOD*modinv(KAI(n)%MOD*KAI(m-n)%MOD)%MOD;
}
ll COM2(ll m,ll n)
{
if(m<n) return 0;
if(n<0) return 0;
if(n==0) return 1;
if(m==n) return 1;
return KAI2(m)/KAI2(n)/KAI2(m-n);
}
ll DEC(ll x,ll m,ll n)
{
return x%POW2(m,n+1)/POW2(m,n);
}
ll keta(ll x,ll n)
{
if(x==0)return 0;
return keta(x/n,n)+1;
}
ll DIV(ll x,ll n)
{
if(x==0)return 0;
return x/n+DIV(x/n,n);
}
ll ORD(ll x,ll n)
{
if(x==0)return INF;
if(x%n!=0)return 0;
return 1+ORD(x/n,n);
}
ll SUP(ll x,ll n)
{
if(x==0)return 0;
if(x%n!=0)return x;
return SUP(x/n,n);
}
ll SGS(ll x,ll y, ll m)
{
if(y==0)return 0;
if(y%2==0){
return (1+POW3(x,y/2,m))*SGS(x,y/2,m)%m;
}
return (1+x*SGS(x,y-1,m))%m;
}
ll SSGS(ll x,ll y,ll m)
{
if(y==0)return 0;
if(y==1)return 1;
if(y%2==0){
return (SSGS(x,y/2,m)*(POW3(x,y/2,m)+1)%m+SGS(x,y/2,m)*y/2%m)%m;
}
return (SSGS(x,y-1,m)*x%m+y)%m;
}
void shuffle(ll array[], ll size) {
for(ll i = 0; i < size; i++) {
ll j = rand()%size;
ll t = array[i];
array[i] = array[j];
array[j] = t;
}
}
ll SQRT(ll n){
ll ok,ng,mid;
ng=n+1;
if(303700500<ng)ng=303700500;
ok=0;
while(abs(ok-ng)>1){
mid=(ok+ng)/2;
if(mid*mid<=n){
ok=mid;
}
else{
ng=mid;
}
}
return ok;
}
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
rep(i,n) par[i] = i;
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return sizes[find(x)];
}
};
map< int64_t, int > prime_factor(int64_t n) {
map< int64_t, int > ret;
for(int64_t i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
bool is_prime(int64_t x) {
if(x==1)return false;
for(int64_t i = 2; i * i <= x; i++) {
if(x % i == 0) return false;
}
return true;
}
struct edge{ll to, cost;};
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<LP,vector<LP>, greater<LP> > que;
que.push(LP(0,s));
while(!que.empty()){
LP p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(LP(d[e.to],e.to));
}
}
}
}
};
ll d[300][300];
void warshall_floyd(ll n){
rep(i,n)rep(j,n)rep(k,n)d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
}
struct bit{
ll m;
vector<ll> b;
bit(ll i){
m=i;
b.resize(m+1);
}
ll num(ll i){
return b[i];
}
ll sum(ll i){
ll s=0;
while(i>0){
s+=b[i];
i-=i&-i;
}
return s;
}
void add(ll i, ll x){
while(i<=m){
b[i]+=x;
i+=i&-i;
}
}
};
int main(){
ll n,k,h[310]={},dp[310][1000][3],o=0;
cin >> n >> k;
rep(i,n)cin >> h[i+1];
rep(i,n+1)rep(j,k+1)rep(l,2)dp[i][j][l]=INF;
dp[0][0][1]=0;
rep(i,n){
rep(j,k+1){
rep(l,i+1)dp[i+1][j+i+1-l][0]=min(dp[l][j][1],dp[i+1][j+i+1-l][0]);
rep(l,i+1){
dp[i+1][j+i-l][1]=min(dp[l][j][1]+max(h[i+1]-h[l],o),dp[i+1][j+i-l][1]);
}
}
}
printf("%lld",min(dp[n][k][0],dp[n][k][1]));
} | #include <iostream>
#include <stdio.h>
using namespace std;
typedef long long LL;
const int M=305;
const LL INF=(LL)M*(1000000000);
LL dp[M];
LL h[M];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%lld",&h[i]);
for(int i=1;i<=n;i++)
dp[i]=INF;
for(int i=1;i<=n-k;i++)
{
for(int j=n;j>=i;j--)
{
dp[j]=INF;
for(int k=i-1;k<j;k++)
dp[j]=min(dp[j],dp[k]+max(0LL,h[j]-h[k]));
}
}
LL ans=INF;
for(int i=n-k;i<=n;i++)
ans=min(ans,dp[i]);
printf("%lld\n",ans);
return 0;
} | 1 | 79,654,968 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define LL long long int
const LL MOD=1e9+7;
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
while(t--){
LL n,i;cin>>n;
LL a[n],b[n-1];
fo(i,0,n-1) cin>>b[i];
fo(i,0,n) a[i]=0;
fo(i,1,n-1){
a[i]=min(b[i-1],b[i]);
}
a[0]=max(a[1],b[0]);
a[n-1]=max(b[n-2],a[n-2]);
LL sum=0;
fo(i,0,n) sum+=a[i];
cout<<sum;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vd = vector <double>;
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end())
#define sortm(d) sort(d.rbegin(),d.rend())
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
ll p=0,q=0,r=0;
int main()
{
ll n;
cin>>n;
vl b(n-1);
rep(i,n-1)
{
cin>>b[i];
}
rep(i,n-2)
{
p+=min(b[i],b[i+1]);
}
p+=b[0];
p+=b[n-2];
print(p);
} | 1 | 52,995,429 |
#include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORe(i, k, n) for(int i = (k); i <= (n); i++)
#define FORr(i, k, n) for(int i = (k); i > (n); i--)
#define FORre(i, k, n) for(int i = (k); i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int dp0[2005][2005];
int dp1[2005][2005];
int main(void){
int n, m;
cin >> n >> m;
vector<int> s(n+1), t(m+1);
REP(i, n) cin >> s[i];
REP(i, m) cin >> t[i];
dp0[0][0] = 1;
REP(i, n+1) REP(j, m+1){
dp0[i+1][j] = (dp0[i+1][j] + dp0[i][j]) % mod;
dp1[i][j] = (dp1[i][j] + dp0[i][j]) % mod;
dp1[i][j+1] =(dp1[i][j+1] + dp1[i][j]) % mod;
if(s[i] == t[j]) dp0[i+1][j+1] = (dp0[i+1][j+1] + dp1[i][j]) % mod;
}
cout << dp1[n][m] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define ve vector
const int mod = 1000000007;
int main(){
int n,m;
cin >> n >> m;
ve<int> s(n), t(m);
rep(i,n) cin >> s[i];
rep(i,m) cin >> t[i];
ve<ve<ll>> dp0(n+3,ve<ll>(m+3));
ve<ve<ll>> dp1(n+3,ve<ll>(m+3));
dp0[0][0] = 1;
for(int i = 0; i <= n+1; i++){
for(int j = 0; j <= m+1; j++){
(dp0[i+1][j] += dp0[i][j]) %=mod;
(dp1[i][j] += dp0[i][j]) %= mod;
(dp1[i][j+1] += dp1[i][j]) %= mod;
if(s[i] == t[j]){
(dp0[i+1][j+1] += dp1[i][j]) %= mod;
}
}
}
cout << dp1[n][m] << endl;
return 0;
} | 1 | 98,588,643 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
using namespace std;
#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl
typedef long long ll;
typedef vector<int> vi;
template<typename T>
ostream& operator<<(ostream& os,vector<T>& vec){
typename vector<T>::iterator it,endit=vec.end();
os << "[";
for(it=vec.begin();it!=endit;it++){
os << " " << *it << ",";
}
os << "]";
return os;
}
template<typename T>
T input(){
T t;cin >> t;
return t;
}
template<typename T>
vector<T> input(const int N){
vector<T> v(N);
repeat(i,N) cin >> v[i];
return v;
}
int solve(int n){
int m;
map<char,char> convmap;
for(int i=0;i<n;i++){
char temp1,temp2;
cin >> temp1 >> temp2;
convmap[temp1]=temp2;
}
cin >> m;
string ans;
for(int i=0;i<m;i++){
char temp;
cin >> temp;
if(convmap.find(temp)!=convmap.end())
cout << convmap[temp];
else
cout << temp;
}
cout <<endl;
return 0;
}
int main(){
for(;;){
int n;
cin >> n;
if(n==0)
break;
solve(n);
}
return 0;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F first
#define S second
const int INF=1000000000;
int main(){
int n;
while(cin>>n&&n){
vector<pair<char,char> > table(n);
for(int i=0; i<n; ++i){
char t1,t2;
cin >> t1 >> t2;
table[i].F=t1;
table[i].S=t2;
}
int m;
cin >> m;
string ans;
for(int i=0; i<m; ++i){
char tmp;
cin >> tmp;
for(int j=0; j<n; ++j){
if(table[j].F==tmp){
tmp=table[j].S;
break;
}
}
ans+=tmp;
}
cout << ans << endl;
}
return 0;
} | 1 | 22,106,875 |
#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;
int len=S.size();
int num;
int ans=1000;
rep(i,len-2){
num=(S[i]-'0')*100+(S[i+1]-'0')*10+S[i+2]-'0';
ans=min(ans,abs(753-num));
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
string S; cin >> S;
int ans = 10000;
rep(s, S.size() - 2) {
string T = S.substr(s, 3);
int x = 0;
rep(i, 3) x = x * 10 + (T[i] - '0');
ans = min(ans, abs(753 - x));
}
cout << ans << endl;
return 0;
} | 1 | 13,331,475 |
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <complex>
#include <cassert>
#include <exception>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << "\n"
static const int INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[200010],dp[300][300];
char field[200][200];
void big(){
if(l > 20){
l = 1;
m++;
}
}
void small(){
if(l > 19){
l = 1;
m++;
}
}
void check(){
if(m > 10){
m = 1;
n++;
}
}
int main(){
int p;
cin >> p;
while(p--){
ll ans = 0;
cin >> n >> m >> l;
while(1){
if(n == 1000 && m == 1 && l == 1)break;
ans++;
l++;
if(n % 3 == 0)big();
else{
if(m % 2)big();
else small();
}
check();
}
print(ans);
}
return 0;
} | #include<stdio.h>
int main(){
int C=0;
for(int i=1;i<1000;i++)
{if(i%3==0)C+=200;else C+=195;}
int n,y,m,d;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&y,&m,&d);
if(y==0&&m==0&&d==0)break;
int c=0;
for(int i=1;i<y;i++)
{if(i%3==0)c+=200;else c+=195;}
for(int i=1;i<m;i++){
if(y%3==0)c+=20;
else if(i%2==0)c+=19;
else c+=20;
}
c+=d;
int s=C-c+1;
printf("%d\n",s);
}
return 0;
} | 1 | 8,963,053 |
#include <iostream>
using namespace std;
int main()
{
for (int n, count; cin >> n; cout << count << endl) {
count=0;
if (n<=36) {
for (int a=0; a<10; a++) {
for (int b=0; b<10; b++) {
for (int c=0; c<10; c++) {
for (int d=0; d<10; d++) {
if (a+b+c+d>n) {
break;
}
else if (a+b+c+d==n) {
count++;
}
}
}
}
}
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, j, k, l, ans;
while (cin >> n) {
ans = 0;
for (i = 0; i <= 9; i++) {
if (i > n) continue;
for (j = 0; j <= 9; j++) {
if (i + j > n) continue;
for (k = 0; k <= 9; k++) {
if (i + j + k > n) continue;
for (l = 0; l <= 9; l++)
if (i + j + k + l == n) {
ans++; break;
}
}
}
}
cout << ans << endl;
}
return 0;
} | 1 | 53,333,452 |