code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,x;cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
REP(i,n){
cin >> c[i];
REP(j,m){
cin >> a[i][j];
}
}
int ans=inf;
REP(t,1<<n){
vector<int> b(m);
int res=0;
REP(i,n){
if(t&(1<<i)){
res+=c[i];
REP(j,m){
b[j]+=a[i][j];
}
}
}
bool f=true;
REP(i,m){
if(b[i]<x) f=false;
}
if(f) chmin(ans,res);
}
cout << (ans==inf?-1:ans) << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <queue>
#define _PI (3.141592653589793)
int main()
{
int N, M, X;
std::cin >> N >> M >> X;
std::vector<int> C;
std::vector<std::vector<int>> A;
for (int i = 0; i < N; ++i) {
int c;
std::cin >> c;
C.push_back(c);
std::vector<int> row;
for (int j = 0; j < M; ++j) {
int a;
std::cin >> a;
row.push_back(a);
}
A.push_back(row);
}
int minsum = -1;
for (int pattern = 0; pattern < (2 << N); ++pattern) {
std::vector<int> AA;
for (int i = 0; i < M; ++i) {
AA.push_back(0);
}
int sum = 0;
for (int i = 0; i < N; ++i) {
if ((pattern >> i) & 1) {
sum += C[i];
for (int j=0; j < M; ++j) {
AA[j] += A[i][j];
}
}
}
int count = 0;
for (int i = 0; i < M; ++i) {
if (AA[i] >= X) {
++count;
}
}
if (count == M) {
if ((minsum == -1) || (sum < minsum)) {
minsum = sum;
}
}
}
std::cout << minsum << std::endl;
return 0;
} | 1 | 55,177,222 |
#include <bits/stdc++.h>
using namespace std;
#define pb insert
#define eb emplace_back
#define ff first
#define ss second
typedef long long int ll;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define show(x) cerr << #x << " is " << x << "\n"
#define show2(x, y) cerr << #x << " " << #y << " " << x << " " << y << "\n"
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pp;
typedef vector<pp> vp;
typedef map<pp, ll> ipi;
typedef map<pp, char> ipc;
typedef map<ll, ll> ii;
typedef set<ll> sl;
typedef multiset<ll> msl;
typedef map<char, ll> ci;
typedef set<pair<ll, ll>> sp;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
void solve()
{
ll n;cin>>n;
vl v(n+1);
vl m(n);
for(auto &i:v) cin>>i;
for(auto &i:m) cin>>i;
ll ans=0;
for(int i=0;i<n;i++){
ll k=min(m[i],v[i]);
v[i]=0;
m[i]-=k;
ll w=min(m[i],v[i+1]);
v[i+1]-=w;
ans+=k+w;
}
cout<<ans<<"\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t; t=1;
while(t--) solve(); return 0;
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) swap(&a,&b);
if(b<1) return -1;
if(a%b==0) return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a * b / gcd(a,b);
}
int main(){
int N;
std::cin>>N;
std::vector<int> A(N+1);
long long sum=0;
for(int i=0;i<N+1;i++) {
std::cin>>A[i];
sum+=A[i];
}
std::vector<int> B(N);
for(int i=0;i<N;i++) {
std::cin>>B[i];
if(B[i]>=A[i]){
B[i]-=A[i];
A[i]=0;
if(B[i]>=A[i+1]) A[i+1]=0;
else A[i+1]-=B[i];
}
else A[i]-=B[i];
}
long long rest=0;
for(int i=0;i<N+1;i++) rest+=A[i];
long long ans=sum-rest;
std::cout<<ans<<std::endl;
return 0;
} | 1 | 68,322,385 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll LCM(ll x, ll y);
int main() {
ll N, X, tmp, ans;
cin >> N >> X;
vector<ll>dif(N);
ans = pow(10, 9);
rep(i, N) {
cin >> tmp;
dif[i] = abs(X - tmp);
ans = min(ans, dif[i]);
}
rep(i, N) {
ans = min(ans, LCM(ans, dif[i]));
}
cout << ans;
return 0;
}
ll LCM(ll x, ll y) {
ll a, b, r, gcd, lcm;
a = max(x, y);
b = min(x, y);
r = 1;
while (r != 0) {
r = a % b;
if (r == 0) {
gcd = b;
}
a = b;
b = r;
}
return gcd;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int main() {
ll l,r;
cin>>l>>r;
ll a[l]={};
ll gc=0;
for(ll i=0; i<l; i++){
cin>>a[i];
a[i]=abs(r-a[i]);}
gc=a[0];
for(ll i=1; i<l; i++){
gc=__gcd(gc,a[i]);}
cout<<gc<<endl;} | 1 | 3,144,610 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int INF = 1<<30;
int main(){
int h, n;
cin >> h >> n;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i] >> b[i];
vector<vector<int>> dp(n+1, vector<int>(h+1, INF));
dp[0][0] = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j <= h; j++){
int next = min(h, j+a[i]);
dp[i+1][j] = min(dp[i][j], dp[i+1][j]);
dp[i+1][next] = min(dp[i+1][next], dp[i+1][j]+b[i]);
}
}
cout << dp[n][h] << endl;
} | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N = 1e3 + 5;
const int M = 2e4 + 5;
int n,m;
ll dp[N][M];
int a[8500],b[5000];
int main()
{
cin>>n>>m;
memset(dp,inf,sizeof(dp));
for(int i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
}
dp[0][0]=0;
for(ll i=1;i<=m;i++)
{
for(int j=0;j<=n;j++)
{
dp[i][j]=dp[i-1][j];
dp[i][j]=min(dp[i][j],dp[i][max(0,j-a[i])]+b[i]);
}
}
cout<<dp[m][n]<<endl;
return 0;
} | 1 | 17,605,388 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
deque<int> dq;
if(N%2 == 1){
for(int i=0; i<N; i++){
int x;
cin >> x;
if(i%2 == 0){
dq.push_front(x);
}
else{
dq.push_back(x);
}
}
}
else{
for(int i=0; i<N; i++){
int x;
cin >> x;
if(i%2 == 0){
dq.push_back(x);
}
else{
dq.push_front(x);
}
}
}
for(int i=0; i<N; i++){
if(i == N-1){
cout << dq[i] << endl;
return 0;
}
else{
cout << dq[i] << " ";
}
}
} | #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;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
deque<ll> dq;
rep(i,n){
ll x;
cin >> x;
if(n%2==0){
if((i+1)%2==0) dq.push_front(x);
else dq.push_back(x);
}else{
if((i+1)%2==0) dq.push_back(x);
else dq.push_front(x);
}
}
for(auto u : dq){
cout << u << endl;
}
return 0;
} | 1 | 62,789,603 |
#include<iostream>
using namespace std;
int main(){
int n,i,a,b,c,aa,bb,cc;
cin>>n;
for(i=0;i<n;i++){
cin >>a>>b>>c;
aa=a*a;bb=b*b;cc=c*c;
if(aa+bb==cc || bb+cc==aa || cc+aa==bb)cout <<"YES"<<endl;
else cout <<"NO"<<endl;
}
return 0;
} | #include <cstdio>
#include <algorithm>
#define LOOP(index,times) for(int index=0;index<times;index++)
using namespace std;
int main(){
int N;
scanf("%d",&N);
int l[3];
LOOP(i,N){
scanf("%d %d %d",&l[0],&l[1],&l[2]);
sort(l,l+3);
if(l[0]*l[0]+l[1]*l[1]==l[2]*l[2])
printf("YES\n");
else
printf("NO\n");
}
return 0;
} | 1 | 1,673,940 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(intl i=0,nn=(intl)(n);i<nn;++i)
#define Rep1(i,n) for(intl i=1,nn=(intl)(n)+1;i<nn;++i)
#define vec vector
#define fi first
#define se second
#define pub push_back
#define pob pop_back
#define SortA(v) sort(v.begin(), v.end())
#define SortD(v) sort(v.rbegin(),v.rend())
#define All(a) (a).begin(),(a).end()
#define Input(a) for(intl ii=0,nn=(intl)(a.size());ii<nn;ii++){cin>>(a).at(ii);}
#define Input2(a,b) for(intl ii=0,nn=(intl)(a.size());ii<nn;ii++){cin>>(a).at(ii);cin>>(b).at(ii);}
#define mp make_pair
#define mt make_tuple
using intl = int64_t;
using vi = vec<intl>;
using vvi = vec<vi>;
using pi = pair<intl,intl>;
using vpi = vec<pi>;
using si = set<intl>;
using vsi = vec<si>;
using mii = map<intl,intl>;
using vmii = vec<mii>;
vec<intl> dx = {0, 1, 0, -1, 1, 1, -1, -1};
vec<intl> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr intl INF = 9223372036854775807;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
intl N;
cin >>N;
vi nums(N+1,0);
vi A(N+1);
Rep1(i,N){
cin >>A[i];
nums[A[i]] ++;
}
intl all =0;
Rep1(i,N){
all += nums[i]*(nums[i]-1)/2;
}
Rep1(i,N){
cout << all - ( (nums[A[i]])?nums[A[i]]-1:0)<<'\n';
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
ll N;
cin >> N;
vector<ll> vec(N+1);
map<ll,ll> b,c;
for(ll i = 1;i <= N;i++) {
cin >> vec.at(i);
if (b.count(vec.at(i))) b[vec.at(i)]++;
else b[vec.at(i)] = 1;
}
ll ans = 0;
for (ll i = 1;i <= N;i++) {
if (b.count(i) && b[i] > 1) ans += b[i] * (b[i]-1) / 2;
}
for (ll i = 1;i <= N;i++) {
if (b[vec.at(i)] > 1) {
cout << ans - b[vec.at(i)]+1 << endl;
} else cout << ans << endl;
}
return 0;
} | 1 | 61,745,849 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int ans = 0;
bool flag = true;
int cur = 1;
int index = 0;
while (index < N) {
if (A[index] == cur) {
cur++; index++;
} else {
ans++;
index++;
}
}
if (cur == 1) ans = -1;
cout << ans << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n;
int a[200005];
int ans=0;
int cnt = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] == cnt) {
cnt++;
}
else {
ans++;
}
}
if (cnt == 1) {
cout << -1 << endl;
}
else {
cout << ans << endl;
}
} | 1 | 99,879,374 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9';
else if (n[i] == '9')
n[i] = '1';
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1e9+7;
int main() {
string n;
cin>>n;
rep(i,n.size()){
if(n[i]=='1') cout<<"9";
else if(n[i]=='9') cout<<"1";
else cout<<n[i];
}
cout<<endl;
return 0;
} | 1 | 16,740,635 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,divNum=0,ans=1;
cin >> N;
for (int i = 1; i <= N ; i++)
{
if (i % 2 != 0)continue;
int tmp = i;
int count = 0;
while (true)
{
if (tmp%2!=0)
{
break;
}
tmp /= 2;
count++;
}
if (count>divNum)
{
divNum = count;
ans = i;
}
}
cout << ans << endl;
} | #include<iostream>
#include<math.h>
using namespace std;
int main () {
int n;
cin >> n;
int ans = 0;
int i = 0;
while (pow(2,i) <= n) {
ans = pow(2,i);
i++;
}
cout << ans << endl;
} | 1 | 79,584,734 |
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A;
cin >> B;
for(int i = B * 10, l = (B + 1) * 10; i < l; i++) {
if((i * 8 / 100) == A) {
cout << i;
return 0;
}
}
cout << -1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
{
int a, b;
cin >> a >> b;
int ans = -1;
for (int i = 1; i <= 1000; ++i)
{
int x = i * 8;
x /= 100;
int y = i * 10;
y /= 100;
if (x == a && y == b)
{
ans = i;
goto ll;
}
}
ll:
cout << ans << "\n";
}
} | 1 | 53,141,898 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF ((1 << 29)-1)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
ll X, Y;
cin >> X >> Y;
if (abs(X - Y) <= 1){
print("Brown");
} else {
print("Alice");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)
#define DEBUG(x) cout<<#x<<": "<<x<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a=min((a), (b))
#define CHMAX(a, b) a=max((a), (b))
const ll MOD=1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll x, y;
cin>>x>>y;
cout<<(abs(x-y)>1 ? "Alice" : "Brown")<<'\n';
return 0;
} | 1 | 31,232,287 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,M;
cin >>N>>M;
ll a=pow(10,9)+7;
vector<ll> dp(N+1,0);
dp[1]=1;
for(int i=0;i<=M;i++){
int a;
cin >>a;
dp[a]=-1;
}
dp[0]=1;
for(int i=2;i<=N;i++){
if(dp[i]==-1){
continue;
}
if(dp[i-1]!=-1){
dp[i]+=dp[i-1];
}
if(dp[i-2]!=-1){
dp[i]+=dp[i-2];
}
if(dp[i]>=a){
dp[i]%=a;
}
}
cout << dp[N] <<endl;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const long long INF =1ll<<60;
const int DAM =-1;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int N,M;
cin>>N>>M;
vector<int> dp(N+2,0);
vector<int> broken(N+1,0);
for(int i=0;i<M;i++){
int a;
cin>>a;
broken.at(a)=1;
}
dp.at(0)=1;
if (broken.at(1))
dp.at(1) = 0;
else
dp.at(1) = 1;
for(int i=2;i<=N;i++){
if(broken.at(i)!=1){
dp.at(i)=(dp.at(i-2)+dp.at(i-1))%mod;
}
}
cout<<dp.at(N)<<endl;
} | 1 | 15,654,561 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define size(x) (int)x.size()
#define reverse(l, sz) reverse(c + l, c + l + sz)
const int N = 1e6 + 1, mod = 1e9 + 7, inf = 2e9;
int n, a, b, c[N];
int main() { cin.tie(0)->sync_with_stdio(0);
cin >> n >> a >> b;
if (a + b - 1 > n || 1ll * a * b < n) {
return cout << -1, 0;
}
int first = n - n / a * a;
for (int i = 1; i <= first; i++) {
c[i] = i + n - first;
}
for (int i = 1; i <= n / a; i++) {
for (int j = 1; j <= a; j++) {
c[a * (i - 1) + j + first] = j + (n / a - i) * a;
}
}
int need = b - (n / a + !!(n % a));
if (first >= 1) {
if (need >= first - 1) {
reverse(1, first);
need -= first - 1;
} else {
reverse(1, need + 1);
need = 0;
}
}
for (int i = 1; i < n / a; i++) {
if (!need) {
break;
}
int f = first + a * (i - 1) + 1;
if (need >= a - 1) {
reverse(f, a);
need -= a - 1;
} else {
reverse(f, need + 1);
need = 0;
}
}
for (int i = 1; i <= n; i++) {
cout << c[i] << ' ';
}
} | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define double long double
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define dc(d) double d;cin>>d;
#define mod 1777777777
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c,a,b) *min_element(c+a,c+b)
#define maxi(c,a,b) *max_element(c+a,c+b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int,int>
#define upp(a,n,x) upper_bound(a,a+n,x)-a;
#define low(a,n,x) lower_bound(a,a+n,x)-a;
#define UF UnionFind
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
if (x == 0 || y == 0)return x + y;
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
int integer(double d){
return long(d);
}
int distance(double a,double b,double c,double d){
return sqrt((b-a)*(b-a)+(c-d)*(c-d));
}
bool p(int x) {
if (x == 1)return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)return a;
else return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)return s;
else if (n < m)return t;
else {
rep(0, i, n) {
if (s[i] > t[i])return s;
if (s[i] < t[i])return t;
}
return s;
}
}
int min(int a, int b) {
if (a >= b)return b;
else return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y)bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y)bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41)nis[i] = 0;
nn = mod - 2;
for (int i = 40;i >= 0;i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int newcom(int n,int y){
int bunsi = 1, bunbo = 1;
rep(0, i, y){
bunsi = (bunsi * (n - i)) ;
bunbo = (bunbo * (i + 1)) ;
int k=gcd(bunsi,bunbo);
bunsi/=k;
bunbo/=k;
}
return bunsi/bunbo;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41)nis[i] = 0;
nn = mod - 2;
for (int i = 40;i >= 0;i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)sum += i + n / i;
if (i * i == n)sum -= i;
}
return sum;
}
int poow(int y, int n) {
if (n == 0)return 1;
n -= 1;
int ni = 1;
for (int i = 0;i < 41;i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41)nis[i] = 0;
nn = n;
for (int i = 40;i >= 0;i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y)sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100)sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) {
if(a%2==0) return a /2*(a+1);
else return (a+1)/2*a;
}
int sames(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
using Graph = vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph& G, int v, int p, int d) {
depth[v] = d;
oya[v] = p;
for (auto nv : G[v]) {
if (nv == p) continue;
dfs(G, nv, v, d + 1);
}
}
int XOR(int a, int b) {
if (a == 0 || b == 0) {
return a + b;
}
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41)nis[i] = 0;
for (int i = 40;i >= 0;i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41)sum += (nis[i] % 2 * n2[i]);
return sum;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int ans[514514];
vector<int> k;
signed main(){
ic(n) ic(a) ic(b)
if(n>a*b||a+b>n+1)c(-1)
else if(a==1)rep(0,i,n)cout<<n-i<<" ";
else{
k.push_back(b);
int t=n-b;
rep(0,i,t-(t/(a-1)*(a-1)))k.push_back(t/(a-1)+1);
rep(0,i,a-1-(t-(t/(a-1)*(a-1))))k.push_back(t/(a-1));
int sum=0;
rep(0,i,a){
sum+=k[i];
rep(0,j,k[i]){
ans[sum-k[i]+j]=sum-j;
}
}
rep(0,i,n)cout<<ans[i]<<" ";
}
} | 1 | 92,227,876 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
const int mxN = 15;
bool switches[mxN];
vector<int> adj[mxN];
int p[mxN];
int summ[mxN], n, m;
int check(){
memset(summ,0,sizeof(summ));
FOR(i,m){
for(auto neigh : adj[i]){
summ[i] += switches[neigh];
}
if(summ[i]%2 != p[i]) return 0;
}
return 1;
}
void solve(){
cin >> n >> m;
FOR(i,m){
int cnt; cin >> cnt;
FOR(_,cnt){
int y; cin >> y;
--y;
adj[i].pb(y);
}
}
FOR(m) cin >> p[i];
int ans = 0;
FOR(i,pow(2,n)){
FOR(j,n){
switches[j] = (i >> j) & 1;
}
ans += check();
}
cout << ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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 MOD = 1000000007;
int main(void){
int n,m; cin >> n >> m;
int k[m];
int s[m][n];
int p[m];
rep(i,m){
cin >> k[i];
rep(j,k[i]){
cin >> s[i][j];
}
}
rep(i,m) cin >> p[i];
int ans = 0;
for(int i = 0; i < (1<<n); i++){
bool a = 1;
for(int j = 0; j < m; j++){
int b = 0;
for(int l = 1; l <= k[j]; l++){
if((i >> (s[j][l-1]-1)) & 1) b++;
}
if(b %2 != p[j]) a = 0;
}
if(a) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 16,322,405 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <stdlib.h>
#include <time.h>
#define F first
#define S second
#define all(a) a.begin(),a.end()
#define setDP(arr) memset(arr,-1,sizeof arr)
#define Clear(arr) memset(arr,0,sizeof arr)
#define oo 1000000000
#define inf 1000000000000000000
#define M 998244353
using namespace std;
typedef long long ll;
const int N = 1e6+300;
const int SQRTN = 320;
const int LOGN = 20;
const double PI = acos(-1);
const double TAU = 2*PI;
int x;
void solve(){
cin >> x;
int k = 1;
for(int i = 1;i<=360 ; i++){
if((x*i)%360==0){
k=i;
break;
}
}
cout << k << endl;
}
signed main() {
int t=1;
while(t--){
solve();
}
return 0;
} | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
x=0; char c=getchar(); int f=1;
while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> T gcd(T a, T b){return !b?a:gcd(b,a%b);}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
static ui seed=416;
return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
int x,a,res;
int main() {
read(x);
while(1){
res++;a=(a+x)%360;
if(!a)break;
}
cout<<res;
return 0;
} | 1 | 7,346,482 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll N, K, S;
scanf("%lld %lld %lld", &N, &K, &S);
ll val = S;
for (ll i = 0; i < K; i++) {
cout << val << " ";
}
if (S == 1000000000LL) {
val--;
} else {
val++;
}
for (ll i = 0; i < (N - K); i++) {
cout << val << " ";
}
cout << "" << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define nnn "\n"
#define spa " "
using p = pair<ll, string>;
using garph = vector<vector<ll>>;
const int inf = 2147483647;
const ll INF = 9223372036854775807;
signed main (){
int n,k,s;cin>>n>>k>>s;
rep(i,0,k){
cout<<s<<nnn;
}
rep(i,0,n-k){
cout<<s/2+100<<nnn;
}
return 0;
} | 1 | 2,006,470 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int w, h;
cin >> h >> w;
long long int tot = w*h;
long long int ans = tot/2;
if(tot%2) ans++;
if(h == 1 || w == 1) ans = 1;
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int main() {
ll h,w;
cin>>h>>w;
ll ans=0;
if(h==1){
cout << 1 << endl;}
else if(w==1){
cout << 1 << endl;}
else
if(h%2==0){
ans=(h/2)*w;
cout << ans << endl;}
else if(w%2==0){
ans = (w/2)*h;
cout << ans << endl;}
else{
ans = (w*h+1)/2;
cout<< ans <<endl;}} | 1 | 1,212,840 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S;
cin >> S;
int N = S.size();
ll ans = 0;
ll cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'W') {
ans += i - cnt;
cnt++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#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 srep(i,s,t) for (int i = s; i < t; ++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define sz(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define mx(x,y) x=max(x,y)
#define mn(x,y) x=min(x,y)
#define rev(v) reverse((v).begin(),(v).end());
#define so(v) sort((v).begin(), (v).end());
#define yn {puts("Yes");}else{puts("No");}
#define fi first
#define se second
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vp = vector<P>;
using vs = vector<string>;
int main() {
int a, b;
string s;
cin>>s;
ll ct;
a = sz(s);
b = 0;
ct = 0;
rep(i, a) {
if (s.at(i) == 'W') {
ct = ct +i-b;
b++;
}
}
cout << ct << endl;
return 0;
} | 1 | 35,628,502 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using ipair = pair<int, int>;
ll INF = 1e16+7;
bool operator>(const ipair a,const ipair b){return a.first > b.first;}
int main(){
string s;
cin >> s;
rep(i, s.size()){
if(i%2==0){
cout << s[i];
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
string str;
cin >> str;
string ans;
REP(i, str.size()) {
if (i % 2) continue;
ans += str[i];
}
cout << ans << endl;
return 0;
} | 1 | 66,059,275 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
char rev(char x) {
if(x == 'S') return 'W';
else return 'S';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
A--;
B--;
if(A == 0) A += 13;
if(B == 0) B += 13;
if(A < B) {
cout << "Bob" << endl;
} else if(A > B) {
cout << "Alice" << endl;
} else {
cout << "Draw" << endl;
}
} | #include<bits/stdc++.h>
#include<cstring>
typedef long long ll;
#define ull unsigned long long
#define pb push_back
#define ff first
#define ss second
#define all(v) (v.begin(), v.end())
#define pi acos(-1.0)
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define bug(a) cerr << #a << " : " << a << endl
#define pq dp
using namespace std;
const ll mxx = 1e5+10;
ll posx[] = {1,-1, 0, 0};
ll posy[] = {0, 0, 1,-1};
int main()
{
#ifdef Mfc_Tanzim
freopen("input.txt","r", stdin);
#endif
ll t=1, n, k, m, a, b, c, d, cs = 1;
set<ll>s;
map<string, ll>mp;
while(t--){
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}
else if(a==1){
cout << "Alice" << endl;
}
else if(b==1){
cout << "Bob" << endl;
}
else if(a>b){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
return 0;
} | 1 | 70,009,817 |
#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
using namespace std;
int main(void)
{
int num;
cin >> num;
int p1 = 0, p2 = 0;
for (int i = 0; i < num; i++)
{
string w1, w2;
cin >> w1;
cin >> w2;
if (w1 < w2)
p2 += 3;
else if (w2 < w1)
p1 += 3;
else if (w1 == w2)
{
p1++;
p2++;
}
}
cout << p1 << " " << p2 << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
int n;
cin >> n;
int taro = 0, hanako = 0;
for (size_t i = 0; i < n; i++){
string s, t;
cin >> s >> t;
if (s > t)taro += 3;
else if (s < t)hanako += 3;
else{
++taro;
++hanako;
}
}
cout << taro << ' ' << hanako << endl;
char c;
cin >> c;
} | 1 | 16,372,599 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0;i < n;++i){
string num;
cin >> num;
char m = '1';
for(int j = 0;j < num.size();++j){
int nn = num[j] - '0';
if(nn == 1){
if(m == '1' || m == ' ')
m = '.';
else if(m == '.')
m = ',';
else if(m == ',')
m = '!';
else if(m == '!')
m = '?';
else if(m == '?')
m = ' ';
}
else if(nn == 2){
if(m == '1' || m == 'c')
m = 'a';
else if(m == 'a')
m = 'b';
else if(m == 'b')
m = 'c';
}
else if(nn == 3){
if(m == '1' || m == 'f')
m = 'd';
else if(m == 'd')
m = 'e';
else if(m == 'e')
m = 'f';
}
else if(nn == 4){
if(m == '1' || m == 'i')
m = 'g';
else if(m == 'g')
m = 'h';
else if(m == 'h')
m = 'i';
}
else if(nn == 5){
if(m == '1' || m == 'l')
m = 'j';
else if(m == 'j')
m = 'k';
else if(m == 'k')
m = 'l';
}
else if(nn == 6){
if(m == '1' || m == 'o')
m = 'm';
else if(m == 'm')
m = 'n';
else if(m == 'n')
m = 'o';
}
else if(nn == 7){
if(m == '1' || m == 's')
m = 'p';
else if(m == 'p')
m = 'q';
else if(m == 'q')
m = 'r';
else if(m == 'r')
m = 's';
}
else if(nn == 8){
if(m == '1' || m == 'v')
m = 't';
else if(m == 't')
m = 'u';
else if(m == 'u')
m = 'v';
}
else if(nn == 9){
if(m == '1' || m == 'z')
m = 'w';
else if(m == 'w')
m = 'x';
else if(m == 'x')
m = 'y';
else if(m == 'y')
m = 'z';
}
else if(nn == 0){
if(m != '1')
cout << m;
m = '1';
}
}
cout << endl;
}
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <vector>
#include <string>
using namespace std;
int main() {
int t;
cin >> t;
array<array<char, 5>, 10> table{ { {}, { '.', ',', '!', '?', ' ' }, { 'a', 'b', 'c' }, { 'd', 'e', 'f' }, { 'g', 'h', 'i' }, { 'j', 'k', 'l' }, { 'm', 'n', 'o' }, { 'p', 'q', 'r', 's' }, { 't', 'u', 'v' }, { 'w', 'x', 'y', 'z' } } };
array<int, 10> sizes = {0, 5, 3, 3, 3, 3, 3, 4, 3, 4};
for (int i = 0; i < t; i++){
string line;
cin >> line;
int counter = -1;
int type = -1;
for(const char& ch : line){
if(ch == '0'){
if (type >= 0) {
cout << table[type][counter % sizes[type]];
type = -1;
counter = -1;
}
} else {
type = ch - '0';
counter++;
}
}
cout << endl;
}
} | 1 | 99,854,728 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
int main()
{
int n;
cin >> n;
vector<int> operate;
operate.push_back(1);
int num = 6;
while(num <= n)
{
operate.push_back(num);
num *= 6;
}
num = 9;
while(num <= n)
{
operate.push_back(num);
num *= 9;
}
vector<int> dp(n+1, MOD);
dp[0] = 0;
rep1(i, n){
int tans = MOD;
for(auto ope: operate){
if (ope <= i){
tans = min(tans, dp[i-ope]+1);
}
}
dp[i] = tans;
}
cout << dp[n] << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using graph = vector<vector<int>>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repd(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define all(x) (x).begin(),(x).end()
#define size(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define pb push_back
#define mp make_pair
#define f first
#define s second
template<class T> inline bool chmax(T &a,T b) { if (a<b) { a=b; return true; } return false; }
template<class T> inline bool chmin(T &a,T b) { if (b<a) { a=b; return true; } return false; }
vector<ll> dp(200000);
int main(){
int n;cin>>n;
dp.assign(200000,INF);
vector<ll>v(0);
int i=0,j=1;
while(pow(6,i)<100000){
v.pb(pow(6,i));
i++;
}
while(pow(9,j)<100000){
v.pb(pow(9,j));
j++;
}
i=0;
dp[0]=0;
while(i<100000){
for(auto&x:v){
if(i+x>100000)continue;
chmin(dp[i+x],dp[i]+1);
}
i++;
}
cout<<dp[n]<<endl;
} | 1 | 27,206,749 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 200005
int n,k;
int a[N];
mi m;
int get(int a, int b){
int x = a-b;
while(x < 0) x += k;
return x%k;
}
void solve(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i], a[i] += a[i-1];
m[0]++;
int ans = 0;
for(int i=1;i<=n;i++){
if(i >= k) m[get(a[i-k],i-k)]--;
ans += m[get(a[i],i)];
m[get(a[i],i)]++;
}
cout<<ans<<endl;
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pcc pair<char,char>
#define F first
#define S second
#define int long long
#define pi 3.141592653589793238462643383279502
#define M 1000000007
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 10000000000000
#define N 100005
#define vi vector<int>
#define all(v) v.begin(),v.end()
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
vi a(n);
rep(i,0,n)
cin>>a[i];
vi pre(n+1);
for(int i=1;i<=n;i++)
{
pre[i]=pre[i-1]+a[i-1];
pre[i]%=k;
}
for(int i=0;i<=n;i++)
{
pre[i]=(i - pre[i] + k)%k;
}
map<int,int>mp;
int ans=0;
int d=min(n+1,k);
for(int i=0;i<d;i++)
{
ans+=mp[pre[i]];
mp[pre[i]]++;
}
for(int i=d;i<=n;i++)
{
mp[pre[i - k]]--;
ans+=mp[pre[i]]++;
}
cout<<ans<<endl;
} | 1 | 45,289,381 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
if(n%i==0)res=false;
return res;
}
struct dijkstra{
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n){
N = n;
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost){
e[from].push_back({to, cost});
}
void run(ll start){
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start]=0;
while(!que.empty()){
P q = que.top();que.pop();
ll dc = q.first;
ll x = q.second;
if(dc>d[x]){
continue;
}else{
for(auto ip: e[x]){
if(d[ip.x]<=d[x]+ip.c){
continue;
}else{
d[ip.x]= d[x]+ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
int main(){
ll N;
cin >> N;
ll M;
cin >> M;
dijkstra d(N);
rep(i, M){
ll a, b;
cin >> a >> b;
a--;b--;
d.add_edge(a, b, 1);
}
d.run(0);
if(d.d[N-1]>2){
cout << "IMPOSSIBLE";
}else{
cout << "POSSIBLE";
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int n,m;
int a[200000],b[200000];
vector<int>possible_island;
int binary_search(int key) {
int left = 0, right = (int)possible_island.size() - 1;
while (right >= left) {
int mid = left + (right - left) / 2;
if (possible_island[mid] == key) return mid;
else if (possible_island[mid] > key) right = mid - 1;
else if (possible_island[mid] < key) left = mid + 1;
}
return -1;
}
int main(void){
cin>>n>>m;
for(int i(0);i<m;i++){
cin>>a[i]>>b[i];
}
for(int i(0);i<m;i++){
if(b[i] == n)possible_island.push_back(a[i]);
}
sort(possible_island.begin(),possible_island.end());
bool ok(false);
for(int i(0);i<m;i++){
if(a[i] == 1 && binary_search(b[i])>=0)ok = true;
}
if(ok)cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
return 0;
} | 1 | 37,218,525 |
#include <bits/stdc++.h>
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::cin;
using std::cout;
using std::vector;
using std::pair;
using std::string;
std::map < pair < int, int >, int > mp, mp1;
int h, w, n;
int dx[ 9 ] = { -1, 0, 1, 1, 1, 0, -1, -1, 0 },
dy[ 9 ] = { 1, 1, 1, 0, -1, -1, -1, 0, 0 };
long long cnt[ 10 ];
int main( )
{
std::ios::sync_with_stdio( false );
cin >> h >> w >> n;
cnt[ 0 ] = ( long long ) ( h - 2 ) * ( w - 2 );
vector < pair<int, int > > a;
int u, v;
For( i, 1, n )
{
cin >> u >> v;
std::pair < int, int > I;
mp[ I = std::make_pair( u, v ) ] = 1;
For( k, 0, 8 ) if( I.first + dx[ k ] >= 2 && I.second + dy[ k ] >= 2 && I.first + dx[ k ] <= h - 1 && I.second + dy[ k ] <= w - 1 )
a.push_back( std::make_pair( u + dx[ k ], v + dy[ k ] ) );
}
for( auto &i : a )
{
if( mp1[ i ] == 1 )
continue;
mp1[ i ] = 1;
int o = 0;
For( k, 0, 8 ) if( i.first + dx[ k ] >= 1 && i.second + dy[ k ] >= 1 && i.first + dx[ k ] <= h && i.second + dy[ k ] <= w )
o += mp.count( std::make_pair( i.first + dx[ k ], i.second + dy[ k ] ) );
cnt[ o ]++;
cnt[ 0 ]--;
}
For( i, 0, 9 )
cout << cnt[ i ] << '\n';
return 0;
} | #include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
ll inf = (ll)1e9 + 7;
ll a[900009];
ll sum[20];
int dx[] = { 0,-1,-2,0,-1,-2,0,-1,-2 };
int dy[] = { 0,0,0,-1,-1,-1,-2,-2,-2 };
int main()
{
ll h, m, n;
scanf("%lld%lld%lld", &h, &m, &n);
ll x, y;
int k = 0;
ll zo = (h - 2) * (m - 2);
for (ll i = 1; i <= n; i++) {
scanf("%lld%lld", &x, &y);
for (ll j = 0; j < 9; j++) {
ll xn = x + dx[j], yn = y + dy[j];
if (xn<1 || xn>h - 2 || yn < 1 || yn>m - 2)continue;
a[k++] = inf * xn + yn;
}
}
sort(a, a + k);
ll t = 1;
for (int i = 0; i < k; i++) {
if (a[i] == a[i + 1])t++;
else {
sum[t]++; t = 1;
zo--;
}
}
printf("%lld\n", zo);
for (int i = 1; i <= 9; i++)
printf("%lld\n", sum[i]);
return 0;
} | 1 | 50,286,280 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi atan(1.0)*4
#define pb(x) push_back(x)
#define in(x) insert(x)
#define fl(x,y) for(ll i=x;i<y;i++)
#define vi vector<long long>
#define vs vector<string>
#define vp(vi,x) cin>>x; vi.pb(x);
string en="\n";
string t="hello";
string Y="YES\n";
string N="NO\n";
#define E end()
#define B begin()
#define sz size()
#define EM empty()
#define fi first
#define se second
#define clr clear()
#define sqr(a) (a*a)
#define mk make_pair
#define mem(a,b) memset(a,b,sizeof(a))
#define all(cont) cont.begin(),cont.end()
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int main()
{
ll a,b,c,t,n,k,p,q,r,y,yy,sum,ct=0,flag=0;
string s,s1,s2,s3;
set<ll>st;
char ch;
map<ll,ll>mp;
vector<ll>v,vv,vz;
cin>>ch;
p=isVowel(ch);
if(p) cout<<"vowel"<<endl;
else cout<<"consonant"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
char c;
cin>>c;
cout<<(c=='e'||c=='u'||c=='o'||c=='a'||c=='i'?"vowel\n":"consonant\n");
} | 1 | 22,509,909 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N;
cin>> N;
if(N[0]==N[1]&&N[1]==N[2])cout<< "Yes";
else if(N[1]==N[2]&&N[2]==N[3])cout<< "Yes";
else cout<< "No";
} | #include <iostream>
using namespace std;
int main()
{
int i,c;
string s;
cin>>s;
if((s[0]==s[1]&& s[1]==s[2])||(s[1]==s[2]&& s[2]==s[3]))
cout<<"Yes";
else
cout<<"No";
return 0;
} | 1 | 9,422,608 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> T(N+2), A(N+2);
ll ans = 1;
rep(i, N) cin >> T[i+1];
rep(i, N) cin >> A[i+1];
T[0] = 0; T[N+1] = T[N];
A[0] = A[1]; A[N+1] = 0;
REP(i, 1, N+1) {
if(T[i] != T[i-1] &&
A[i] != A[i+1] &&
T[i] != A[i]) {
ans = 0;
} else if(T[i] != T[i-1]) {
if(T[i] > A[i]) ans = 0;
} else if(A[i] != A[i+1]) {
if(A[i] > T[i]) ans = 0;
} else {
(ans *= min(T[i], A[i])) %= mod;
}
}
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;
typedef vector<ll> vll;
ll mod = 1e9+7;
int main() {
ll n;cin >> n;
vll a(n), t(n);
rep(i,n) cin>>a[i];
rep(i,n) cin>>t[i];
vll x(n,-1);
if(a[n-1] != t[0]) {
puts("0");
return 0;
}
x[0]=a[0],x[n-1]=t[n-1];
for(int i=1;i<n;i++){
if(a[i] > a[i-1]){
if(x[i] >= 0 && x[i] != a[i]) {
puts("0");
return 0;
}
x[i] = a[i];
}
}
for(int i=n-2;i>=0;i--){
if(t[i] > t[i+1]){
if(x[i] >= 0 && x[i] != t[i]) {
puts("0");
return 0;
}
x[i] = t[i];
}
}
ll ret = 1;
rep(i,n){
if(x[i] == -1){
ret *= (ll)min(a[i],t[i]);
ret %= mod;
}
else if(x[i] > min(a[i],t[i])) {
puts("0");
return 0;
}
}
cout << ret << endl;
return 0;
} | 1 | 2,721,913 |
#include<iostream>
using namespace std;
int main(){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int xdis=(x2-x1);
int ydis=(y2-y1);
int x3=x2-ydis;
int y3=y2+xdis;
int x4=x1-ydis;
int y4=y1+xdis;
cout<<x3<<" "<<y3<<" "<<x4<<" "<<y4;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = d-b, y = c-a;
printf("%d %d %d %d\n", c-x, d+y, a-x, b+y);
return 0;
} | 1 | 7,490,194 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll=long long;
using namespace std;
int main(){
int x,n,p;
vector<int> d(102);
cin>>x>>n;
rep(i,n){
cin>>p;
d[p]=1;
}
int ans=102;
int ans1=0;
for(int i=0;i<102;i++){
if (d[i]==1) continue;
else if(ans==abs(x-i)){
break;
}
else if(ans>abs(x-i)){
ans=min(ans,abs(x-i));
ans1=i;
}
}
cout<<ans1<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define MOD 1000000007
#define int long long
#define vi vector<long long int>
#define pb push_back
#define rep(i,a,n) for (int i=(a);i<(n);++i)
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 gen_rand_int(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 gen_rand_ll(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int>vec;
long long power(long long a, long long b, long long m)
{
long long res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r"))
{
freopen("INPUT.txt", "r", stdin);
freopen("OUTPUT.txt", "w", stdout);
}
#endif
int t;
t=1;
while(t-->0){
int x,n;
cin>>x>>n;
set<int>arr;
for(int i=0;i<n;i++){
int g;
cin>>g;
arr.insert(g);
}
int ans;
for(int i=0;true;i++){
int z=x-i;
if(arr.count(z)==0){
ans=z;
break;
} z=x+i;
if(arr.count(z)==0){
ans=z;
break;
}
}
cout<<ans<<endl;
}
} | 1 | 8,287,068 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int q;
int a, b;
bool solve(int v){
int pos = v / 2;
for(int i = max(1ll, pos - 10); i <= min(v, pos + 10); i++){
int diff = v - i;
int u = 1 + diff;
int v = i;
if(v <= b) v--;
if(u >= a) u++;
if(u * v >= a * b) return false;
}
return true;
}
main()
{
ios_base::sync_with_stdio(false);
cin >> q;
for(int i = 0; i < q; i++){
cin >> a >> b;
if(a > b) swap(a, b);
int lo = 0, hi = 2000000000;
while(lo != hi){
int mi = (lo + hi + 1) >> 1;
if(solve(mi)) lo = mi;
else hi = mi - 1;
}
cout << lo-1 << endl;
}
} | #include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define co(i) cout<<(i)<<endl
#define fcout cout<<fixed<<setprecision(10)
#define uni(i) i.erase(unique(i.begin(), i.end()), i.end());
#define all(i) i.begin(),i.end()
using namespace std;
const int INF=1e9+7;
const int MOD=1e9+7;
int main(){
int q; cin>>q;
FOR(i,0,q){
ll a,b; cin>>a>>b;
ll k=sqrtl(a*b-1);
ll ans=2*k-1;
if(k*(k+1)>a*b-1) ans--;
if(a==b) ans++;
co(ans);
}
} | 1 | 56,222,894 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,n) for(size_t i=l; i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using mii = map<int,int>;
using pii = pair<int,int>;
using ti3 = tuple<int,int,int>;
int main(){
ll n; cin>>n;
vi d(n); REP(i,n) cin>>d[i];
sort(d.begin(),d.end());
cout<<d[n/2]-d[n/2-1]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
long long int gcd(long long int bdda,long long int chota)
{
if(chota==0)
return bdda;
return gcd(chota,bdda%chota);
}
void solve()
{
long long int n;
cin>>n;
long long int a[n];
for(long long int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
long long int ans=a[n/2]-a[n/2-1];
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
solve();
}
} | 1 | 12,026,362 |
#include <bits/stdc++.h>
#define ROOP(i, N) for(int i=0; i++; i<N)
#define RVROOP(i, N) for(int i=N; i--; i>=0)
#define ALL(v) v.begin(), v.end()
const int INF = 1e9;
const int MAX = 510000;
const int MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
int K; cin>>K;
string S, ans; cin>>S;
if(S.size()<=K){
ans=S;
}
else{
ans=S.substr(0, K)+"...";
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
ll powmod(ll n, ll k, ll m) {
ll r=1;
for(; k>0; k >>=1) {
if(k&1) r=(r*n)%m;
n=(n*n)%m;
}
return r;
}
ll fact(ll n) {
ll a=1;
rep(i,n) {
a=a*(n-i);
}
return a;
}
ll pow(ll a, ll b) {
ll x=1;
rep(i,b) {
x=x*a;
}
return x;
}
int main() {
ll K;
string S;
cin >>K>>S;
if(S.size()<=K) {
cout<<S<<endl;
}
else {
rep(i,K) {
cout<<S.at(i);
}
cout<<"..."<<endl;
}
} | 1 | 5,465,383 |
#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
void MAIN() {
int a, b;
cin >> a >> b;
int t = abs(a - b);
if (t <= 1) cout << "Yay!" << '\n';
else cout << ":(" << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
} | #include <iostream>
using namespace std;
int main()
{
int n, m; cin >> n >> m;
if (n <= 8 && m <= 8) cout << "Yay!";
else cout << ":("; return 0;
} | 1 | 90,096,259 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int H, W;
cin >> H >> W;
vector<vector<char>> list(H, vector<char>(W));
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
cin >> list[i][j];
vector<bool> Hb(H, false), Wb(W, false);
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
if (list[i][j] == '#')
{
Hb[i] = true;
Wb[j] = true;
}
}
}
for (int i = 0; i < H; i++)
{
if(Hb[i])
{
for (int j = 0; j < W; j++)
{
if(Wb[j])
cout << list[i][j];
}
cout << endl;
}
}
} | #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 h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; ++i)
{
cin >> a[i];
}
vector<bool> col(w, false);
vector<bool> row(h, false);
for(int i = 0; i < h; ++i)
{
for(int j = 0; j < w; ++j)
{
if (a[i][j] == '#')
{
row[i] = true;
col[j] = true;
}
}
}
for(int i = 0; i < h; ++i)
{
if (!row[i]) continue;
for(int j = 0; j < w; ++j)
{
if (col[j]) cout << a[i][j];
}
cout << endl;
}
}
int main()
{
fastio;
solve();
return 0;
} | 1 | 53,946,301 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
const ll num[4] = {-1, 0, 1, 0};
int main(void)
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, k, r, s, p;
string str;
cin >> n >> k >> r >> s >> p >> str;
vector<char> vec(n);
ll ans = 0;
rep(i, 0, n)
{
char tmp;
if (str[i] == 'r')
tmp = 'p';
else if (str[i] == 's')
tmp = 'r';
else
tmp = 's';
if (i < k)
{
if (tmp == 'r')
ans += r;
else if (tmp == 's')
ans += s;
else
ans += p;
vec[i] = tmp;
}
else
{
if (tmp == vec[i - k])
{
if (vec[i - k] == 'r' && str[i + k] == 's')
tmp = 'p';
else if (vec[i - k] == 'r' && str[i + k] == 'p')
tmp = 'p';
if (vec[i - k] == 's' && str[i + k] == 'r')
tmp = 'r';
else if (vec[i - k] == 's' && str[i + k] == 'p')
tmp = 'p';
if (vec[i - k] == 'p' && str[i + k] == 'r')
tmp = 's';
else if (vec[i - k] == 'p' && str[i + k] == 's')
tmp = 'p';
}
else
{
if (tmp == 'r')
ans += r;
else if (tmp == 's')
ans += s;
else
ans += p;
vec[i] = tmp;
}
vec[i] = tmp;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
int n,k;
int r,s,p;
string t;
cin >> n >> k;
cin >> r >> s >> p;
cin >> t;
vector<string> enemy(k);
for(int i = 0; i < n; i++){
enemy[i%k].push_back(t[i]);
}
bool flag = 0;
long long ans = 0;
for(int i = 0; i < k; i++){
for(int j = 0; j < enemy.at(i).size(); j++){
if(j != 0 && enemy[i][j] == enemy[i][j-1] && flag == 0){
flag = 1;
continue;
}
flag = 0;
if(enemy[i][j] == 'r') ans += p;
else if(enemy[i][j] == 's') ans += r;
else if(enemy[i][j] == 'p') ans += s;
}
}
cout << ans << endl;
return 0;
} | 1 | 57,074,670 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =1001001001;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
return(gcd(b,a%b));
}
}
ll lcm(ll a, ll b){
return a*b/gcd(a,b);
}
ll isprime(ll n){
bool prime=true;
for(int i=2;i<n;i++){
if(n%i==0){
prime=false; break;
}
}
if(prime){cout<<n<<" is prime"<<endl;
}else{cout<<n<<" is not prime"<<endl;}
}
ll factorial(ll n){
ll a=1;ll b=n;
for(int i=0;i<n;i++){
a*=b;
b--;
}
return a;
}
ll comb(ll a,ll b){
ll c;
c=factorial(a)/(factorial(a-b)*factorial(b));
return c;
}
int main(){
cout<<fixed<<setprecision(10);
ll x,t;
cin>>x>>t;
if(x>t){
cout<<x-t<<endl;
}else{
cout<<0<<endl;
}
} | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int x , t;
cin >> x >> t;
int k = x - t;
if(k >= 0)cout << k << endl;
else cout << 0 << endl;
} | 1 | 10,855,544 |
#include<cstdio>
#include<iostream>
int main(void){
int d,sum;
while(scanf("%d",&d)!=EOF){
sum=0;
for(int i=d;i<600;i+=d){
sum+=i*i*d;
}
printf("%d\n",sum);
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int main(){
int x;
while(cin>>x){
int ans=0;
for(int i=x;i<=600-x;i+=x){
ans+=i*i*x;
}
cout<<ans<<endl;
}
} | 1 | 3,134,467 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(int i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef pair<ll,ll> Pi;
const int INF=(ll)(1LL<<30)-1;
const double INFd=100000000000.0;
const ll INFl=(ll)9223372036854775807;
const int MAX=10000;
const ll MOD=(ll)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a, b)*b;}
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int n,m;
pair<int,int> dp[10100];
bool comp(pair<int,int>& a,pair<int,int>& b){
return a.first>b.first;
}
int main(){
while(1){
cin>>n>>m;
if(n==0&&m==0)break;
int ans=0;
REP(i,n){
int t,s;
cin>>t>>s;
dp[i]=make_pair(s,t);
ans+=s*t;
}
sort(dp,dp+n,comp);
for(int i=0;i<n;i++){
if(m>dp[i].second){
m-=dp[i].second;
ans-=dp[i].first*dp[i].second;
}else{
ans-=m*dp[i].first;
break;
}
}
cout<<ans<<endl;
}
return 0;
} | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int64;
int main()
{
while(true) {
int n, m;
int64 ans = 0;
vector<pair<int, int> > dp;
scanf("%d%d", &n, &m);
if(n == 0)
break;
dp.resize(n);
for(int i = 0; i < n; ++i)
scanf("%d%d", &dp[i].second, &dp[i].first);
sort(dp.rbegin(), dp.rend());
for(int pos = 0; pos < n; ++pos) {
int d = dp[pos].second;
int p = dp[pos].first;
int x = min(d, m);
m -= x;
ans += (d - x) * (int64)p;
}
printf("%lld\n", ans);
}
return 0;
} | 1 | 66,468,215 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(int i=0;i<(int)n;++i)
#define rep2(i,n) for(int i=0;i<(int)n;++i)
#define rep3(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rep4(i,a,b,c) for(int i=(int)a;i<(int)b;i+=(int)c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#ifdef _DEBUG
#define debug1(a) cerr << #a << ": " << a << "\n"
#define debug2(a,b) cerr << #a << ": " << a << ", " << #b << ": " << b << "\n"
#define debug3(a,b,c) cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " << c << "\n"
#define debug4(a,b,c,d) cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " << c << ", " << #d << ": " << d << "\n"
#define debug(...) overload4(__VA_ARGS__,debug4,debug3,debug2,debug1)(__VA_ARGS__)
#define vecout(a) cerr << #a << ": [";rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "":",");}cerr << "]\n"
#else
#define debug(...)
#define vecout(a)
#endif
#define mp make_pair
void myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
void doset(int n){cout << fixed << setprecision(n);}
using ll = long long;
using ld = long double;
using dou = double;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod1 = 1000000007LL;
const ll mod2 = 998244353LL;
typedef pair<ll,ll> P;
template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool change(T& a,U& b){if(a > b){swap(a,b);return 1;}return 0;}
ll modpow(ll n,ll m,ll MOD){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n,ll m){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
template<class T>
inline bool isp(T n){
bool res = true;
if(n == 1 || n == 0)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
template<class T = int>
T in(){T x;cin >> x;return x;}
inline bool Yes(bool b){cout << (b ? "Yes\n":"No\n");return b;}
inline bool YES(bool b){cout << (b ? "YES\n":"NO\n");return b;}
int main(){
myset();
ll X,Y,A,B,C;
cin >> X >> Y >> A >> B >> C;
vector<ll> red(A),gre(B),non(C);
rep(i,A)cin >> red[i];
rep(i,B)cin >> gre[i];
rep(i,C)cin >> non[i];
sort(rall(red));sort(rall(gre));sort(rall(non));
vector<ll> aps;
rep(i,X)aps.push_back(red[i]);
rep(i,Y)aps.push_back(gre[i]);
rep(i,C)aps.push_back(non[i]);
sort(rall(aps));
ll ans = 0;
rep(i,X + Y)ans += aps[i];
cout << ans << "\n";
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <string>
#include <utility>
#include <cassert>
using namespace std;
typedef long long ll;
const int INF = 2e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> red, green, inv;
for (int i = 0; i < a; i++) {
int r;
cin >> r;
red.push_back(r);
}
for (int i = 0; i < b; i++) {
int r;
cin >> r;
green.push_back(r);
}
for (int i = 0; i < c; i++) {
int r;
cin >> r;
inv.push_back(r);
}
sort(red.rbegin(), red.rend());
sort(green.rbegin(), green.rend());
sort(inv.rbegin(), inv.rend());
red.erase(red.begin()+x, red.end());
green.erase(green.begin()+y, green.end());
ll sum = 0;
for (int c: inv) {
int min_r = red.empty() ? INF : red.back();
int min_g = green.empty() ? INF : green.back();
if (c <= min(min_r, min_g)) break;
sum += c;
if (min_r < min_g) {
red.pop_back();
} else {
green.pop_back();
}
}
for (int c: red) sum += c;
for (int c: green) sum += c;
cout << sum << endl;
return 0;
} | 1 | 42,410,851 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define begin_end(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll)(n) ; i++ )
#define DREP(i,m,n) for(ll i=(ll)(m) ; i > (ll)(n) ; i-- )
#define rep(i,n) REP(i,0,n)
#define m_p(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define p_b push_back
#define SZ(x) ((int)(x).size)
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
int main(){
string A = is();
ll len = A.size();
vector<ll> buckets(26, 0);
for (char c : A){
buckets[c-'a']++;
}
ll ans = 0;
rep(i, 26){
ans += buckets[i] * (len - buckets[i]);
}
ans /= 2;
ans++;
cout << ans << endl;
} | #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";}
int main(){
ll N;
string S;
cin >> S;
N = S.size();
vector<ll> c(26);
rep(i,N){
c[S[i] - 'a']++;
}
ll sum = 0;
rep(i,26){
sum += (c[i]*(c[i]-1))/2;
}
ll ans = 1 + N*(N-1)/2 - sum;
cout << ans << endl;
} | 1 | 71,179,080 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define PII pair<int,int>
#define PLL pair<LL,LL>
#define MP make_pair
#define F first
#define S second
#define INF INT_MAX
#define ALL(x) (x).begin(), (x).end()
#define DBG(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << endl
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class TIn>
using indexed_set = tree<
TIn, null_type, less<TIn>,
rb_tree_tag, tree_order_statistics_node_update>;
inline void optimizeIO()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int nmax = 2e5+7;
const LL LINF = 1e17;
string to_str(LL x)
{
stringstream ss;
ss<<x;
return ss.str();
}
map<int,int>posa;
map<int,int>posb;
int main()
{
optimizeIO();
int n;
cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++)
cin>>a[i];
vector<int>b = a;
sort(ALL(b));
for(int i=0;i<n;i++)
{
posa[a[i]] = i;
posb[b[i]] = i;
}
int cnt = 0;
for(int i=0;i<n;i++)
{
int val = a[i];
int pa = posa[val];
int pb = posb[val];
if(abs(pa-pb)%2==1)
cnt++;
}
cout<<cnt/2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int ara[100005], b[100005];
map<int, int>mp;
int main()
{
int n, x, res= 0, cnt= 0;
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &ara[i]), b[i]= ara[i];
sort(b+1, b+1+n);
for(int i=1; i<=n; i++)mp[ b[i] ]= ++cnt;
for(int i=1; i<=n; i++)ara[i]= mp[ ara[i] ];
for(int i=1; i<=n; i++)res+= abs(i-ara[i])%2;
printf("%d\n", res/2);
return 0;
} | 1 | 5,277,690 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; }
struct UnionFind {
private:
vector<int> child,tree;
vector<vector<int>> list;
public:
UnionFind(int v) {
tree.resize(v);
list.resize(v);
REP(i,v) tree[i] = i, list[i].push_back(i);
}
int root(int i){
if(i == tree[i]){
REP(j,child.size()) tree[child[j]] = i;
child.clear();
return i;
}
else{
child.push_back(i);
return i = root(tree[i]);
}
}
int size(int i){
return list[root(i)].size();
}
vector<int> nodes(int no){
return list[root(no)];
}
bool unit(int x, int y){
x = root(x);
y = root(y);
if(x==y) return false;
if(list[x].size() < list[y].size()) swap(x,y);
for(int no:list[y]) list[x].emplace_back(no);
tree[y] = x;
return true;
}
bool isUnit(int x, int y){
return root(x) == root(y);
}
};
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n,m;
cin>>n>>m;
vector<int> p(n);
REP(i,n) cin >> p[i],p[i]--;
UnionFind uf(n);
rep(i,m){
int x,y;
cin>>x>>y;
x--;y--;
uf.unit(x,y);
}
ll ans=0;
rep(i,n){
int num=p[i];
int posi=i;
if(uf.isUnit(num,i)) ans++;
}
cout<<ans<<endl;
} | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
#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++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T& t, const V& v) { t = v; }
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T& t, const V& v) {
for (auto& e : t) fill_v(e, v);
}
template <typename T>
bool chmax(T & a, const T & b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T & a, const T & b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define ARRAY_MAX 100005
const int INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
int dx[4] = { 1,0,0,-1 };
int dy[4] = { 0,1,-1,0 };
typedef struct union_find{
vector<ll> pa;
vector<ll> ra;
vector<ll> siz;
void init(ll n){
pa.resize(n);
ra.resize(n);
siz.resize(n);
for(ll i = 0;i < n;i++){
pa[i] = i;
ra[i] = 0LL;
siz[i] = 1LL;
}
}
ll find(ll x){
if(pa[x] == x){
return x;
}else{
return pa[x] = find(pa[x]);
}
}
void unite(ll x,ll y){
x = find(x);
y = find(y);
if(x == y){
return;
}
pa[y] = x;
siz[x] += siz[y];
}
bool same(ll x,ll y){
return find(x) == find(y);
}
}UF;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n,m;
cin >> n >> m;
vector<int> p(n);
for (int i = 0; i < n; i++)
{
cin >> p[i];
p[i]--;
}
UF tree;
tree.init(n+10);
for (int i = 0; i < m; i++)
{
int x,y;
cin >> x >> y;
x--;
y--;
if(x > y){
swap(x,y);
}
tree.unite(x,y);
}
int cnt = 0;
for (int i = 0; i < n; i++)
{
if(tree.same(i,p[i])){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 1 | 41,218,063 |
#include <iostream>
#include <string>
using namespace std;
int main() {
bool d[128] = { false };
bool flag = true;
string s;
cin >> s;
for (auto i : s) {
if (!d[i]) {
d[i] = true;
}
else {
flag = false;
break;
}
}
if (flag) {
cout << "yes" << endl;
}
else {
cout << "no" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <math.h>
#include <cstdlib>
#define rep(i,x) for(int i=0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 10010010010;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (a % b == 0) return b;
else return gcd(b, a % b);
}
int main() {
string S;
cin >> S;
map<char, bool> letter;
ll s = S.size();
bool ans = true;
rep(i, s) {
if (letter[S[i]])ans = false;
else letter[S[i]] = true;
}
if (ans) cout << "yes" << endl;
else cout << "no" << endl;
} | 1 | 86,583,854 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n == 0) break;
int s[n], i, sum = 0, ave = 0;
for(i = 0;i < n;i++){
cin >> s[i];
}
sort(s, s+n);
s[0] = 0;
s[n-1] = 0;
for(i = 0;i < n;i++){
sum += s[i];
}
ave = sum / (n-2);
cout << ave << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define LOOP(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) LOOP(i, 0, n)
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
int main(void) {
int cnt = 0;
vector<int> ans;
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> v;
int temp;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
}
sort(v.begin(), v.end());
for(int i=1; i<n-1; i++) {
cnt += v[i];
}
ans.push_back(cnt/(n-2));
cnt = 0;
}
for(int i=0; i<ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
} | 1 | 30,213,554 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
bool yes_or_no = true;
if (a >= b || a >= c || b >= c) yes_or_no = false;
if (yes_or_no) cout << "Yes";
else cout << "No";
cout << endl;
return 0;
} | #include<stdio.h>
#include<stdbool.h>
int main(void){
int a,b,c;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
printf(a<b&&b<c ? "Yes\n" : "No\n");
return 0;
} | 1 | 20,381,437 |
#include <stdio.h>
int main(){
int N, M;
scanf("%d %d", &N, &M);
int a1 = 0, a2 = 0, b1 = 0, b2 = 0;
for(a1=1; a1<N; a1++){a2 = a2+a1;}
for(b1=1; b1<M; b1++){b2 = b2+b1;}
(N+ M>= 2) ? printf("%d", a2 + b2) : printf("0");
return 0;} | #include <bits/stdc++.h>
using namespace std;
int f(int n) { return (n*(n-1))/2; }
int main() {
int N, M; cin >> N >> M;
cout << f(N) + f(M) << endl;
} | 1 | 20,469,276 |
#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>
#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>
#include <regex>
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,j,n) for(int i = j; i < n; i++)
#define rrep(i,j,n) for(int i = j-1; i >= n; i--)
#define prec(n) fixed << setprecision(n)
#define print_array(v) rep(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) printf(a?"Yes\n":"No\n")
#define fi first
#define se second
using namespace std;
int inf = 2147483647;
int64_t inf64 = 9223372036854775807;
int mod = 1e+7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
int x = max({a, b, c})*3 - (a+b+c);
cout << (x % 2 == 0 ? x/2 : x/2+2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
vector<int> v(3);
cin>>v[0]>>v[1]>>v[2];
sort(v.begin(),v.end());
v[1]-=v[0];v[2]-=v[0];v[0]=0;
int a=v[1],b=v[2];
if(a%2==0){cout<<b-a+a/2;}
else{cout<<a/2+b-a+2;}
} | 1 | 79,607,485 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define inf 10000000000000007
#define all(vec) vec.begin(),vec.end()
#define ggr getchar(); getchar();return 0;
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)return false;
}
return true;
}
int n, k, a[100010];
int ta, mu, rin, ans;
signed main() {
cin >> n >> k;
rep(i, n) {
cin >> a[i];
if (a[i] > 0)ta += a[i];
}
rep(i, n) {
if (i <= k - 1) {
if (a[i] > 0)mu += a[i];
rin += a[i];
}
else {
if (a[i - k] > 0)mu -= a[i - k];
rin -= a[i - k];
if (a[i] > 0)mu += a[i];
rin += a[i];
}
if (i > k - 2) {
ans = max({ ans,ta + rin - mu,ta - mu });
}
}
cout << ans << endl;
} | # include <iostream>
using namespace std;
long long N;
long long K;
long long a[100005];
long long prefixsum[100005];
long long pprefixsum[100005];
long long tempsum;
long long ans=0;
long long totalsum;
long long psum(long long left, long long right)
{
return prefixsum[right]-prefixsum[left-1];
}
long long ppsum(long long left, long long right)
{
return pprefixsum[right]-pprefixsum[left-1];
}
int main()
{
cin>>N>>K;
for (long long i=1; i<=N; i++)
{
cin>>a[i];
totalsum=totalsum+a[i];
}
for (long long i=1; i<=N; i++)
{
prefixsum[i]=prefixsum[i-1]+a[i];
}
for (long long i=1; i<=N; i++)
{
pprefixsum[i]=pprefixsum[i-1];
if (a[i]>0)
{
pprefixsum[i]=pprefixsum[i]+a[i];
}
}
for (long long i=1; i<=N-K+1; i++)
{
tempsum=psum(i, i+K-1);
if (tempsum>=0)
{
tempsum=tempsum+ppsum(1, i-1)+ppsum(i+K, N);
ans=max(ans, tempsum);
}
else
{
ans=max(ans, ppsum(1, i-1)+ppsum(i+K, N));
}
}
cout<<ans;
} | 1 | 16,552,628 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
string t;
vector<int> ans;
int count=0;
cin >> s >> t;
for(int i=0;i<=s.size()-t.size();i++){
count = 0;
for(int j=0;j<t.size();j++){
if(s.at(i+j)!=t.at(j)){
count++;
}
}
ans.push_back(count);
}
sort(ans.begin(), ans.end());
cout << ans.at(0) << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s, t;
int res = 1000;
cin >> s >> t;
for(int i = 0; i <= s.size() - t.size(); i++) {
int temp = 0;
for(int j = 0; j < t.size(); j++)
temp += (s[i + j] != t[j]);
res = min(res, temp);
}
cout << res;
return 0;
} | 1 | 54,373,210 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int arr[3];
cin >> arr[0] >> arr[1] >> arr[2];
sort(arr,arr+3);
cout << arr[0]+arr[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n ,x) for (int i = x; i < (int)(n); i++)
#define repBack(i, n) for (int i = n; i >= 0; i--)
#define dup(x,y) (((x)+(y)-1)/(y))
int main() {
vector<int> A(3);
rep(i,3)cin >> A[i];
sort(A.begin(),A.end());
cout << A[0]+A[1] << endl;
return 0;
} | 1 | 56,981,420 |
#include <bits/stdc++.h>
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8 fixed<<setprecision(8)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define CLR(a) memset((a), 0 ,sizeof(a))
using namespace std;
int main(void)
{
for(;;){
int n;
cin >> n;
if(!n) return 0;
int answer=0;
int l=0,r=0;
REP(i,n){
string step;
cin >> step;
if(step=="lu") l=1;
if(step=="ru") r=1;
if(step=="ld") l=0;
if(step=="rd") r=0;
if(answer%2!=l&&answer%2!=r) answer++;
}
cout << answer << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n) && n){
char prev[3] = "xy";
char now[3];
int ans = 0;
for (int i = 0; i < n; i++){
scanf("%s", now);
if (now[0] != prev[0] && now[1] == prev[1]) ans++;
strcpy(prev, now);
}
printf("%d\n", ans);
}
return (0);
} | 1 | 697,777 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
vector<ll> a(n);
rep(i, n){
cin >> a[i];
}
ll mx=0;
rep(i,n){
if(a[i]>mx+1){
ans+=(a[i]-1)/(mx+1);
if(mx==0)mx=1;
}
else if(a[i]>mx)mx=a[i];
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll A[100010];
int main()
{
cin >> N;
for(int i = 0; i < N; i++)cin >> A[i];
ll ans = A[0] - 1;
int mem = 2;
for(int i = 1; i < N; i++)
{
if(A[i] < mem)continue;
if(A[i] == mem)mem++;
else ans += (A[i] - 1) / mem;
}
cout << ans << endl;
return 0;
} | 1 | 79,911,803 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int>> g(n);
for(int i = 0; i < n - 1; ++i) {
int a, b; cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
bool ans = false;
function<int(int, int)> dfs = [&] (int v, int p) {
int up = 0;
for(auto to : g[v]) {
if(to == p) continue;
up += dfs(to, v);
}
if(up >= 2) ans = true;
return !up;
};
ans |= dfs(0, -1) != 0;
cout << (ans ? "First" : "Second") << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
int N;
bool used[100010];
bool flag = false;
vector<int> G[100010];
int dfs(int v, int p){
for(auto u : G[v]){
if(u != p) dfs(u, v);
}
if(!used[v]){
used[v] = true;
if(!used[p]) used[p] = true;
else flag = true;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for(int i = 1; i < N; i++){
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
used[0] = true;
dfs(1, 0);
cout << (flag ? "First" : "Second") << endl;
return 0;
} | 1 | 35,747,513 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
vec modcomb(ll n, ll k, ll m)
{
vec c(k+1, 0), inv(k+1, 0);
inv[1] = 1;
c[0] = 1; c[1] = n;
REP(i,2,k+1) {
inv[i] = m - inv[m%i] * (m / i) % m;
c[i] = (((c[i-1] * (n - i + 1)) % m) * inv[i]) % m;
}
return c;
}
int main()
{
ll X, Y;
cin >> X >> Y;
ll A = Y * 2 - X, B = X * 2 - Y;
if(A >= 0 && B >= 0 && A % 3 == 0 && B % 3 == 0) {
A /= 3; B /= 3;
vec C = modcomb(A + B, MIN(A,B), MOD);
PR(C[MIN(A,B)]);
}
else PR(0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int modPow(ll a, ll n, ll p) {
if (n == 0) return 1;
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main() {
ll X, Y; cin >> X >> Y;
if((X + Y) % 3 != 0 || (double)Y > 2 * (double)X || (double)Y < (double)X / 2) {
cout << 0 << endl;
return 0;
}
else if((X % 2 == 0 && Y == X / 2) || (Y % 2 == 0 && Y == 2 * X)) {
cout << 1 << endl;
return 0;
}
ll l = max((2 * X - Y) / 3, (ll)0);
ll s = max((2 * Y - X) / 3, (ll)0);
ll fact = 1;
for(int i = 2; i <= l + s; i++) fact = fact * i % mod;
ll invfact1 = 1;
for(int i = 1; i <= l; i++) invfact1 = invfact1 * modPow(i, mod - 2, mod) % mod;
ll invfact2 = 1;
for(int i = 1; i <= s; i++) invfact2 = invfact2 * modPow(i, mod - 2, mod) % mod;
ll ans = fact * invfact1 % mod;
ans = ans * invfact2 % mod;
cout << ans << endl;
return 0;
} | 1 | 44,028,429 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,cou=0,res=1;
cin >> n;
for(int i=1;i<=n;i++){
int a =i,counter=0;
if(i%2==0){
while(a>=0){
a /= 2;
counter++;
if(a%2==1) break;
}
}
if(counter>cou){
cou=counter;
res=i;
}
}
cout<<res<<endl;
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main(){
int n,box=0;
cin >> n;
int A[7] = {1,2,4,8,16,32,64};
for(int i=0;i<7;i++){
if(A[i]<=n){
swap(A[i],box);
}
}
cout << box;
return 0;
} | 1 | 12,251,247 |
#include <iostream>
using namespace std;
int main(){
string s;
while(cin>>s){
if(s == "0")break;
int sm = 0;
for(int i = 0; s.size( ) > i; i++){
sm += s[i]-'0';
}
cout << sm << endl;
}
} | #include <iostream>
using namespace std;
int main(){
string s;
while(true){
cin>>s;
if(s=="0") break;
int sum=0;
for(int i=0;i<s.length();i++){
int a=s[i]-'0';
sum+=a;
}
cout<<sum<<endl;
}
} | 1 | 57,488,026 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<vector<pair<ll, ll>>> cnt(3);
rep(i, N) {
cin >> A[i] >> B[i];
if(A[i] < B[i]) cnt[0].push_back({A[i], B[i]});
else if(A[i] == B[i]) cnt[1].push_back({A[i], B[i]});
else cnt[2].push_back({A[i], B[i]});
}
ll ans = 0;
if(cnt[0].size() == 0) {
ans = 0;
} else {
for(auto ele: cnt[0]) ans += ele.first;
for(auto ele: cnt[1]) ans += ele.first;
sort(all(cnt[2]), [&](pair<ll, ll>& p1, pair<ll, ll>& p2) {
return p1.second < p2.second;
});
rep(i, cnt[2].size()) {
if(i) ans += cnt[2][i].first;
else ans += cnt[2][i].first - cnt[2][i].second;
}
}
cout << ans << "\n";
return 0;
} | #include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int N;
int a[200010],b[200010];
int main(){
cin>>N;
int mB=2001001001;
LL sum=0;
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
if(a[i]>b[i] && b[i] < mB){
mB = b[i];
}
sum += b[i];
}
if(mB>=2001001001){
cout<<0<<endl;
return 0;
}
cout << sum - mB <<endl;
return 0;
} | 1 | 8,161,618 |
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define reverse(x) reverse(x.begin(), x.end())
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long,long long>
#define f first
#define s second
typedef long long ll;
const int mod = 1e9+7;
using namespace std;
int n, m;
int main(){
int x,a,b;
cin >> x >> a >> b;
if(-a+b <= 0){
cout << "delicious";
}else if(-a+b <= x){
cout << "safe";
}else {
cout << "dangerous";
}
} | #include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
const char* result = "dangerous";
if (B <= A) {
result = "delicious";
} else if (B - A <= X) {
result = "safe";
}
cout << result << endl;
return 0;
} | 1 | 68,089,495 |
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten53 300005
#define ten6 1000005
#define PI 3.1415926
#define pb(x) push_back(x)
#define all(x) x.begin(),x.end()
#define mkpr(x1,x2) make_pair(x1,x2)
typedef long long int ll;
ll num[55][2],point[55][2];
int main(void)
{
ll m,n,i,j,k=1,d,sum=0;
string s;
cin>>n>>m;
for(i=0;i<n;i++)
{
cin>>k>>d;
num[i][0]=k;
num[i][1]=d;
}
for(i=0;i<m;i++)
{
cin>>k>>d;
point[i][0]=k;
point[i][1]=d;
}
for(i=0;i<n;i++)
{
sum=d=k=0;
for(j=0;j<m;j++)
{
k=abs(num[i][0]-point[j][0])+abs(num[i][1]-point[j][1]);
if(!sum)
sum=k;
else if(k<sum)
{
d=j;
if(!k) break;
sum=k;
}
}
cout<<d+1<<endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> vn, vm;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
vn.push_back(make_pair(a, b));
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
vm.push_back(make_pair(a, b));
}
for (int i = 0; i < n; i++) {
int d = 0x3f3f3f3f;
int res = -1;
for (int j = 0; j < m; j++) {
int dd = abs(vn[i].first - vm[j].first) + abs(vn[i].second - vm[j].second);
if (dd < d) {
res = j;
d = dd;
}
}
cout << res + 1 << endl;
}
} | 1 | 6,290,342 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(long long x, long long y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N, A, B; cin >> N >> A >> B;
int ans = 0;
REP(i, N + 1)if (i % 10 + i % 100 / 10 + i % 1000 / 100 + i % 10000 / 1000 + i / 10000 >= A && i % 10 + i % 100 / 10 + i % 1000 / 100 + i % 10000 / 1000 + i / 10000 <= B)ans += i;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
auto calc = [&](int x){
int res = 0;
while(x){
res += x % 10;
x /= 10;
}
return res;
};
int ans = 0;
for(int i = 1; i <= n; i++){
int t = calc(i);
if(t >= a && t <= b)ans += i;
}
cout << ans << endl;
} | 1 | 50,383,054 |
#include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf 1e18
#define deci(x, y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define nitin ios_base::sync_with_stdio(false); cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
int32_t main() {
nitin;
int s;
cin>>s;
cout<<0<<" "<<0<<" ";
cout<<1000000000<<" "<<1<<" ";
int p;
if(s!=1000000000000000000)
p=(1000000000-s%1000000000);
else
p=0;
int x=p;
int y=(s+x)/1000000000;
cout<<x<<" "<<y;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF=1e18;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
ll s;
cin >> s;
ll x1,y1,x2,y2,x3,y3;
ll M=1000000000;
x1=0,y1=0;
x2=M;
y2=1;
x3=(M-s%M)%M;
y3=(s+x3)/M;
cout << x1 << " " <<y1 <<" " <<x2<<" " << y2 << " " <<x3<< " " <<y3<<endl;
} | 1 | 45,089,707 |
#include <bits/stdc++.h>
using namespace std;
void Main()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) {
cout << "Yes";
}
else {
cout << "No";
}
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
string s;
cin >> s;
if (s[2] == s[3] && s[4] == s[5])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 67,661,082 |
#include <stdio.h>
#include <string.h>
int main (){
int n,flag=1;
scanf ("%d",&n);
char s[n+1];
scanf ("%s",s);
int len = strlen(s);
if (n%2 != 0){
printf ("No");
}
else {
for (int i=0; i<len/2; i++){
if (s[i] != s[(n/2)+i]){
flag=0;
}
}
if (flag==1){
printf ("Yes");
}
else {
printf ("No");
}
}
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int a,b;
cin>>a;
string s;
cin>>s;
string s1,s2;
if(a%2==0){
s1=s.substr(0,(a/2));
s2=s.substr((a/2),a-1);
if((s1==s2)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 1 | 81,652,417 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 100005
int n;
int v[MAXX];
int main()
{
_FastIO;
cin >> n;
int k = n / 2;
vector<int> cnt(MAXX , 0);
vector<int> cn(MAXX , 0);
for(int i = 0; i < n; i++){
cin >> v[i];
if(i % 2)
cnt[v[i]]++;
else
cn[v[i]]++;
}
vector<pair<int , int> > x;
vector<pair<int , int> > y;
for(int i = 1; i <= 100000; i++){
if(cnt[i])
x.push_back({cnt[i] , i});
if(cn[i])
y.push_back({cn[i] , i});
}
if(x.size() == 1){
x.push_back({0 , 0});
}
if(y.size() == 1){
y.push_back({0 , 100001});
}
sort(x.begin() , x.end());
reverse(x.begin() , x.end());
sort(y.begin() , y.end());
reverse(y.begin() , y.end());
int a = x[0].second;
int b = y[0].second;
int c = x[1].second;
int d = y[1].second;
int e = x[0].first;
int f = y[0].first;
int g = x[1].first;
int h = y[1].first;
if(a != b){
int ans = k - e + k - f;
cout << ans << endl;
return 0;
}
int saleh = k - g + k - f;
int revan = k - e + k - h;
int ans = min(saleh , revan);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int guusuu[100005],kisuu[100005],mx1,mx2,x1,x2;
#define int long long
signed main() {
int n;
cin >> n;
int u;
for(int i = 0; i < n; i++) {
cin >> u;
if(i%2 == 0) {
guusuu[u]++;
if(mx1 < guusuu[u]) {
mx1 = guusuu[u];
x1 = u;
}
}
else{
kisuu[u]++;
if(mx2 < kisuu[u]) {
mx2 = kisuu[u];
x2 = u;
}
}
}
sort(guusuu,guusuu+100005);
sort(kisuu,kisuu+100005);
if(x1 != x2) {
cout << n-mx1-mx2 << endl;;
}
else {
cout << n-max(mx1+kisuu[100003],mx2+guusuu[100003]) << endl;
}
} | 1 | 388,171 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int mean = (a+b) / 2;
int amari = (a+b) % 2;
if(amari == 0) cout << mean << endl;
else cout << mean + 1 << endl;
} | #include <bits/stdc++.h>
#include <vector>
#include <math.h>
using namespace std;
int main(){
long long a,b; cin>>a>>b;
float avg = (a+b)/2.0;
if(avg == int(avg))
cout<<avg<<endl;
else
cout<<int(avg)+1<<endl;
return 0;
} | 1 | 34,746,461 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 0;
int count = 0;
rep2(i,1,n+1){
if(i%2!=0){
rep2(j,1,n+1){
if(i%j==0)count++;
}
}
if(count==8)ans++;
count = 0;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin>>N;
int ans=0;
if(N<105){
ans=0;
}
else if(N<135){
ans=1;
}
else if(N<165){
ans=2;
}
else if(N<189){
ans=3;
}
else if(N<195){
ans=4;
}
else{
ans=5;
}
cout<<ans<<endl;
} | 1 | 49,073,081 |
#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;
cin >> n;
vector<int> a(n), p(n), q(n);
rep(i, n) a[i] = i + 1;
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
sort(a.begin(), a.end());
int A = 0, B = 0, cnt = 0;
do
{
cnt++;
int cntA = 0, cntB = 0;
rep(i, n)
{
if (a[i] == p[i])
cntA++;
if (a[i] == q[i])
cntB++;
}
if (cntA == n)
A = cnt;
if (cntB == n)
B = cnt;
} while (next_permutation(a.begin(), a.end()));
cout << abs(A - B) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
int a[n],b[n];
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
int line[n];
rep(i,n) line[i] = i+1;
int count = 1;
int ansa = 0, ansb = 0;
bool flag = true;
do{
rep(i,n)
{
if(line[i] != a[i]) flag = false;
}
if(flag == true) ansa = count;
flag = true;
rep(i,n)
{
if(line[i] != b[i]) flag = false;
}
if(flag == true) ansb = count;
if(ansa > 0 && ansb > 0) break;
count++;
flag = true;
}while(next_permutation(line,line+n));
cout << abs(ansa - ansb) << endl;
} | 1 | 57,633,545 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vll a(n);
REP(i, n)
cin >> a[i];
sort(a.begin(), a.end());
auto result = unique(a.begin(), a.end());
a.erase(result, a.end());
cout << a.size() - (1-a.size()%2) << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ld long double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
vi A(100001,0);
rep(i,n){
int a; cin>>a;
A[a]++;
}
int ans,sum=0;
rep(i,100001){
sum+=max(A[i]-1,0);
}
ans = n-(sum+1)/2*2;
cout<<ans<<endl;
return 0;
} | 1 | 64,978,313 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int k; cin >> k;
int a, b; cin >> a >> b;
for(int i = a; i <= b; i++){
if(i % k == 0){
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(auto i=0;i<n;++i)
#define REPR(i,n) for(auto i=n;i>=0;--i)
#define REPI(itr,v) for(auto itr=v.begin();itr!=v.end();++itr)
#define REPIR(itr,v) for(auto itr=v.rbegin();itr!=v.rend();++itr)
#define FOR(i,a,b) for(auto i=a;i<b;++i)
#define SORT(v,n) sort(v, v+n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(),v.end()
#define llong long long
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair
#define SV(n,v) {int tmp;for(int i=0;i<n;++i){scanf("%d",&tmp);v.push_back(tmp);}}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
typedef pair<int,int> pii;
int main(){
int k, a, b;
cin >> k >> a >>b;
for(int i = a; i <= b; ++i){
if(i % k == 0){
cout << "OK\n";
return 0;
}
}
cout << "NG\n";
return 0;
} | 1 | 96,774,314 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = unsigned long long;
using P = pair<int, 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 (a > b) { a = b; return 1; } return 0; }
const ll INF = 1000000000000000000;
int main()
{
int N;
cin >> N;
vector<ll> A(N);
rep(i, N)cin >> A[i];
sort(ALL(A));
if(*A.begin() == 0)
{
cout << 0 << endl;
return 0;
}
if(*A.rbegin() > INF)
{
cout << -1 << endl;
return 0;
}
ll ans = 1;
rep(i, N) {
if(A[i] > INF/ans)
{
cout << -1 << endl;
return 0;
}
ans *=A[i];
if(ans > INF)
{
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define nes ios_base :: sync_with_stdio(0); cin.tie(0);
using namespace std;
ll des=1e18;
int main(){
nes;
int n;
cin>>n;
vector<ll>v(n);
ll mul=1;
for(int i=0;i<n;++i){
cin>>v[i];
if(v[i]==0){
cout<<0;return 0;
}
}
for(int i=0;i<n;++i){
if(mul>des/v[i]+des%v[i]){
cout<<"-1";return 0;
}
mul*=v[i];
}
if(mul>des){
cout<<"-1";return 0;
}
cout<<mul;
return 0;
} | 1 | 8,257,340 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m, h[100100], i, j, ans=0;
vector<long long> con[100100];
bool judge;
cin >> n >> m;
for(i=0;i<n;i++){
cin >> h[i];
}
for(i=0;i<m;i++){
int a, b;
cin >> a >> b;
a--;b--;
con[a].push_back(b);
con[b].push_back(a);
}
for(i=0;i<n;i++){
judge=true;
for(auto x : con[i]){
if(h[x]>=h[i]){
judge=false;
break;
}
}
if(judge){
ans++;
}
}
cout << ans <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main(){
int n,m; cin >> n >> m;
vector<int> h(n);
for(int i = 0; i < n; i++) cin >> h[i];
vector<bool> chk(n, true);
for(int i = 0; i < m; i++){
int a,b; cin >> a >> b;
a--; b--;
if(h[a] <= h[b]) chk[a] = false;
if(h[b] <= h[a]) chk[b] = false;
}
int ans = 0;
for(int i = 0; i < n; i++){
if(chk[i]) ans++;
}
cout << ans << endl;
return 0;
} | 1 | 68,226,056 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9+5;
constexpr long long INFLL = 1LL<<60;
constexpr double eps = (1e-9);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> a(h);
rep(i, h) cin >> a[i];
vector<vector<int>> d(h, vector<int>(w, INF));
vector<pair<int, int>> blacks;
rep(i, h) rep(j, w) {
if (a[i][j] == '#') {
blacks.emplace_back(i, j);
d[i][j] = 0;
}
}
int ans = 0;
while (!blacks.empty()) {
vector<pair<int, int>> new_blacks;
for (auto& b : blacks) {
int sh = b.first;
int sw = b.second;
rep(i, 4) {
int nh = sh + dx[i];
int nw = sw + dy[i];
if (nh < 0 || nw < 0 || h <= nh || w <= nw) continue;
if (a[nh][nw] == '#') continue;
a[nh][nw] = '#';
new_blacks.emplace_back(nh, nw);
}
}
if (new_blacks.empty()) break;
ans++;
blacks = new_blacks;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
#include <bits/stdc++.h>
#define rep(i,a,n) for(ll i = a;i < n;i++)
typedef long long ll;
using namespace std;
int main(){
ll h,w;
cin >> h >> w;
char a[h][w] = {};
ll dist[h][w] = {};
rep(i,0,h){
rep(j,0,w){
cin >> a[i][j];
if(a[i][j] == '.') dist[i][j] = LINF;
else dist[i][j] = 0;
}
}
rep(i,0,h){
rep(j,1,w){
dist[i][j] = min(dist[i][j],dist[i][j-1]+1);
}
}
rep(i,0,h){
rep(k,1,w){
ll j = w-k-1;
dist[i][j] = min(dist[i][j],dist[i][j+1]+1);
}
}
rep(i,1,h){
rep(j,0,w){
dist[i][j] = min(dist[i][j],dist[i-1][j]+1);
}
}
rep(k,1,h){
rep(j,0,w){
ll i = h-k-1;
dist[i][j] = min(dist[i][j],dist[i+1][j]+1);
}
}
ll ans = 0;
rep(i,0,h){
rep(j,0,w){
ans = max(ans,dist[i][j]);
}
}
cout << ans << endl;
} | 1 | 96,717,726 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
int a, b;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
cout << ((a % 3 && b % 3 && (a + b) % 3) ? "Impossible\n" : "Possible\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B;
scanf("%d%d", &A, &B);
if(A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0){
printf("Possible\n");
}
else{
printf("Impossible\n");
}
return 0;
} | 1 | 87,309,779 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i,i0,n) for(int (i)=(i0);(i)<(n);(i)++)
#define FORR(i,i0,n) for(int (i)=(n)-1; (i)>=(i0);(i)--)
#define SORT(x) sort(x.begin(),x.end())
#define SORTR(x) sort(x.begin(),x.end(),greater<int>())
#define rn return
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
using namespace std;
using ll = long long;
typedef std::pair<int,int> pii;
typedef std::pair<int,double> pid;
typedef std::vector<int> vi;
typedef std::vector<pii> vii;
#define PI 3.14159265358979323846264338327950L
const int mod = 1000000007;
void solve(){
int r,g,b,n;
cin >> r >> g >> b >> n;
int ans = 0;
for(int i = 0; i <= 3000; i++){
for(int j = 0; j <= 3000;j++){
int cur = i*r + g*j;
int need = n-cur;
if (need < 0) continue;
if (need%b == 0) ans++;
}
}
cout << ans;
}
int main(){
int T;
T = 1;
while(T--){
solve();
cout << endl;
}
} | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
using namespace std;
int main() {
long long R, G, B, N;
cin >> R >> G >> B >> N;
long long ans = 0;
long long val;
for (long long r = 0; r <= N / R; r++) {
for (long long g = 0; g <= ((N - r * R) / G); g++) {
val = N - R*r - G*g;
if (val % B == 0) {
ans += 1;
}
}
}
cout << ans << endl;
return 0;
} | 1 | 45,583,536 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
#include <sstream>
#include <cstdio>
#include <stack>
using namespace std;
int main()
{
int d;
while (cin >> d) {
long long int s = 0;
for (int i = 0; i+d < 600+1; i += d)
s += (d * i * i);
cout << s << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int d;
while(cin>>d){
int area=0;
for(int i=0;i<600;i+=d){
area += d*i*i;
}
cout<<area<<'\n';
}
return 0;
} | 1 | 60,572,985 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin>>n;
vector<ll> a(n),b(n),c;
ll suma=0,sumb=0;
rep(i,n){
cin>>a[i];
suma+=a[i];
}
ll cnt1=0,cnt2=0,s=0;
rep(i,n){
cin>>b[i];
if(a[i]<b[i]){
cnt1++;
s+=b[i]-a[i];
}
else if(a[i]>b[i]) c.push_back(a[i]-b[i]);
sumb+=b[i];
}
sort(all(c));
int i=c.size()-1;
while(s>0){
s-=c[i];
cnt2++;
i--;
}
if(suma<sumb) cout<<-1;
else cout<<cnt1+cnt2;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
ll suma = 0, sumb = 0;
REP(i, n) {
cin >> a[i];
suma += a[i];
}
REP(i, n) {
cin >> b[i];
sumb += b[i];
}
if(suma < sumb) {
cout << "-1" << endl;
return 0;
}
vector<ll> sa(n);
REP(i, n) sa[i] = a[i] - b[i];
sort(ALL(sa));
int ans = 0;
ll herasu = 0;
REP(i, n) {
if(sa[i] < 0) {
ans++;
herasu += sa[i];
}
}
REP_REV(i, n) {
if(herasu >= 0) break;
ans++;
herasu += sa[i];
}
cout << ans << endl;
return 0;
} | 1 | 93,957,162 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int>a(3);
for(int i=0;i<3;i++) cin>>a[i];
sort(a.begin(),a.end());
cout<<a[2]-a[0]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int a[3];
rep(i, 3) scanf("%d", &a[i]);
sort(a, a + 3);
printf("%d\n", a[1] - a[0] + a[2] - a[1]);
return 0;
} | 1 | 53,009,674 |
#include<iostream>
#include<stdio.h>
int main()
{
int a, b;
std::cin >> a >> b;
int d, r;
double f;
d = a / b;
r = a % b;
f = (double)a / (double)b;
printf("%d %d %.8lf\n", d, r, f);
return 0;
} | #include<stdio.h>
int main(){
int a,b;
scanf("%d %d",&a,&b);
printf("%d %d %lf\n",a/b,a%b,(double)a/b);
} | 1 | 32,047,097 |
#include <stdio.h>
#include <iostream>
#include <map>
std::map<char,char> hyou;
bool init()
{
hyou.clear();
int n;
std::cin >> n;
if(n==0)
return false;
for(int i=0; i<n; i++)
{
char c,d;
std::cin >> c >> d;
hyou[c] = d;
}
return true;
}
void solve()
{
char dust[500];
int n;
std::cin >> n;
std::cin.getline(dust,sizeof(dust));
for(int i=0; i<n; i++)
{
char out;
out = (char)getchar();
if(hyou.find(out) != hyou.end())
out = hyou[out];
putchar((int)out);
std::cin.getline(dust,sizeof(dust));
}
std::cout << std::endl;
return;
}
int main(void) {
while(init())
solve();
return 0;
} | #include <iostream>
#include <string>
#define rep(i, a, b) for(int i = a; i < b; i ++)
using namespace std;
int main() {
int n, m;
char A[100], B[100], C;
while(cin >> n, n) {
rep(i, 0, 100) {
A[i] = 0;
B[i] = 0;
}
rep(i, 0, n) {
cin >> A[i] >> B[i];
}
cin >> m;
rep(i, 0, m) {
cin >> C;
rep(j, 0, n) {
if(C == A[j]) {
C = B[j];
break;
}
}
cout << C;
}
cout << endl;
}
return 0;
} | 1 | 16,749,979 |
#include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a + b / 2 << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << 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 solve() {
int x, y; cin >> x >> y;
cout << x + y / 2 << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 1 | 23,371,736 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
int n, m;
vector<PII> _array;
int main() {
while ( ~scanf( "%d %d", &n, &m ) && n ) {
_array.resize( n );
for ( int i = 0; i < n; i++ ) {
scanf( "%d %d", &_array[ i ].second, &_array[ i ].first );
}
sort( _array.rbegin(), _array.rend() );
for ( int i = 0; i < n; i++ ) {
if ( m == 0 ) {
break;
}
int use_m = min( m, _array[ i ].second );
_array[ i ].second -= use_m;
m -= use_m;
}
int ans = 0;
for ( int i = 0; i < n; i++ ) {
ans += _array[ i ].first * _array[ i ].second;
}
printf( "%d\n", ans );
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin>>n>>m,n||m){
vector<P> v;
for(int i=0;i<n;++i){
int d,p;
cin >> d >> p;
v.push_back(P(p,d));
}
sort(v.begin(), v.end(), greater<P>());
int s = 0;
for(int i=0;i<n;++i) s+=v[i].first*v[i].second;
for(int i=0;i<n;++i){
m-=v[i].second;
s-=v[i].first*v[i].second;
if(m<0){
s+=v[i].first*(-m);
m=0;
break;
}
}
cout << s << endl;
}
return 0;
} | 1 | 62,295,905 |
#include<iostream>
using namespace std;
int main() {
int H, W; cin >> H >> W;
string C[H];
for (int i = 0; i < H; i++) {
cin >> C[i];
}
for (int i = 0; i < H; i++) {
for (int j = 0 ; j < W; j++) {
cout << C[i][j];
}
cout << endl;
for (int j = 0 ; j < W; j++) {
cout << C[i][j];
}
cout << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
cin >> H >> W;
vector<vector<char> > C(H, vector<char>(W));
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
cin >> C[i][j];
}
}
for(int i = 0; i < H * 2; i++) {
for(int j = 0; j < W; j++) {
cout << C[i / 2][j];
}
cout << endl;
}
} | 1 | 35,461,396 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main()
{
int n,k;
int p[6000];
int c[6000];
cin>>n>>k;
rep(i,n)cin>>p[i];
rep(i,n)p[i]--;
rep(i,n)cin>>c[i];
ll ans=(ll)-1e18;
for(int i=0;i<n;i++)
{
int si=i;
vector<int>s;
int x=si;
ll tot=0;
while(1)
{
x=p[x];
s.push_back(x);
tot+=c[x];
if(x==si)break;
}
ll t=0;
for(int i=0;i<s.size();i++)
{
if(i+1>k)break;
t+=c[s[i]];
ll now=0;
now=t;
if(tot>0)
{
now+=tot*((k-i-1)/s.size());
}
ans=max(ans,now);
}
}
cout <<ans;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_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 = 1e9 + 7;
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -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 Write(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
template <typename T> void Write(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); } }
template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }
struct Read {
std::size_t szi, szj;
Read(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;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Reads {
template <typename T> Reads(T& a) { std::cin >> a; }
template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
};
Read read;
}
int main() {
ll n, k; Reads(n, k);
vector<ll> p = Read(n);
vector<ll> c = Read(n);
rep(i, n) --p[i];
ll ans = -infll;
rep(i, n) {
ll tmp = 0LL;
ll score = 0LL;
ll cnt = 0LL;
int cur = i;
while (true) {
cur = p[cur];
score += c[cur];
++cnt;
if (cur == i)break;
}
int remain = k % cnt;
ll add = 0LL;
int stepNum = remain + cnt;
int cycleNum = max<int>(0, k / cnt - 1);
rep(j, stepNum) {
if (j >= k) break;
cur = p[cur];
add += c[cur];
chmax(ans, add);
chmax(ans, add + cycleNum * score);
}
}
Write(ans);
return 0;
} | 1 | 68,176,631 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
long N, M, V, P;
cin >> N >> M >> V >> P;
vector<long> A(N);
for (auto& x : A)
{
cin >> x;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
long h = 1;
while (h < N) {
h *= 2;
}
long t = h / 2;
long step = h / 2;
while (step > 0)
{
if (t >= N) {
step = step / 2;
if (step == 0) {
t--;
break;
}
t -= step;
continue;
}
long voted = N - t + P - 1;
long box = 0;
long flg = 1;
for (int i = t - 1; i >= P - 1; i--)
{
box += A[t] + M - A[i];
if (A[t] + M - A[i] < 0)
{
flg = -1;
break;
}
}
voted = N - t + P - 1 + box / M;
step = step / 2;
if (voted >= V && flg==1)
{
t += step;
}
else
{
if (step == 0) {
t--;
break;
}
t -= step;
}
}
cout << t + 1;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n,v,p;
ll m;
cin>>n>>m>>v>>p;
ll vec[n];
for(int i=0;i<n;i++){
cin>>vec[i];
}
ll z;
sort(vec,vec+n);
reverse(vec,vec+n);
if(vec[n-1]+m>=vec[p-1]){
if(v<=p){
cout<<n<<endl;
return 0;
}
if(v>p){
z=0;
for(int i=p-1;i<n-1;i++){
z+=vec[n-1]+m-vec[i];
}
if(z>=(v-p)*m){
cout<<n<<endl;
return 0;
}
}
}
int ok=p-1,ng=n-1,search;
for(int query=0;query<20;query++){
search=(ok+ng)/2;
if(vec[search]+m<vec[p-1]){
ng=search;
continue;
}
if(v<=p){
ok=search;
continue;
}
z=0;
for(int i=p-1;i<n;i++){
if(i!=search){
z+=min(m,vec[search]+m-vec[i]);
}
}
if(z>=(v-p)*m){
ok=search;
}
else{
ng=search;
}
}
cout<<ok+1<<endl;
} | 1 | 22,930,866 |
#include <bits/stdc++.h>
int main()
{
int a, b;
bool *table;
table = new bool[10000];
std::fill(table, table + 5000, false);
std::fill(table + 5000, table + 10000, true);
scanf("%d%d", &a, &b);
a--; b--;
int add = -100;
for (int i = 0; i < a; i++)
{
if (i % 50 == 0) add += 100;
table[i * 2 + add] = true;
}
add = 5000;
for (int i = 0; i < b; i++)
{
if (i % 50 == 0) add += 100;
table[i * 2 + add] = false;
}
printf("100 100\n");
for (int i = 0; i < 100; i++)
{
for (int j = 0; j < 100; j++)
printf("%c", table[i * 100 + j]?'.':'#');
printf("\n");
}
delete[] table;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define DEB2(X) cout<<X<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define DEB2(X) {}
#define END {}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
struct edge{int to,cost;};
const int INF=100000000000000000;
const int INF2=9223372036854775807;
const int MOD=1000000007;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define min(X,Y) (((int)(X)<(int)(Y))?(X):(Y))
#define max(X,Y) (((int)(X)>(int)(Y))?(X):(Y))
#define NP(X,Y) next_permutation(X,Y)
#define setdouble(X,Y) cout<<fixed<<setprecision(X)<<Y
int ceil2(int a,int b){if(a%b==0){return a/b;}else{return a/b+1;}}
int pow2(int a,int b){int r=1;for(int i=1;i<=b;i++){r*=a;}return r;}
int Log2(int a){int t=0;while(1){if(a==0||a==1){break;}a/=2;t++;}return t;}
int A,B;
char S[110][110];
signed main(){
cin>>A>>B;
REP(i,100){
REP(j,50){
S[j][i]='#';
S[j+50][i]='.';
}
}
A--,B--;
REP(i,50){
if(i%2)continue;
REP(j,100){
if(j%2==0){
continue;
}
if(A>0){
S[i][j]='.';
A--;
}
if(B>0){
S[i+51][j]='#';
B--;
}
}
}
cout<<100<<" "<<100<<endl;
REP(i,100){
REP(j,100){
cout<<S[i][j];
}
cout<<endl;
}
return 0;
} | 1 | 47,473,275 |
#include <iostream>
using namespace std;
main(){
int a, b, c, d;
while(cin >> a >> b >> c >> d){
int sum1, sum2;
sum1=a+b+c+d;
cin >> a >> b >> c >> d;
sum2=a+b+c+d;
if(sum1>=sum2) cout << sum1 << endl;
else cout << sum2 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a,b;
int S=0,T=0;
for (int i = 1; i <= 4; i++){
cin>>a;
S=S+a;
}
for (int i = 1; i <= 4; i++){
cin>>b;
T=T+b;
}
if(S>T){
cout<<S<<endl;
} else if(S<=T){
cout<<T<<endl;
}
return 0;
} | 1 | 51,303,554 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,m,k;
cin >> n >> m >> k;
bool flag = false;
for(int a=0;a<=m;a++){
for(int b=0;b<=n;b++){
if(b*(m-a)+a*(n-b) == k){
flag = true;
}
}
}
if(flag){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).size())
#define MAX(v) *max_element(all(v))
#define MIN(v) *min_element(all(v))
using namespace std; using ll = long long; using P = pair<int,int>;
using vl = vector<ll>; using vvl = vector<vl>;
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
inline void IN(void){return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const int dx[8] = {1,0,-1,0,1,1,-1,-1}; const int dy[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n,m,k;
IN(n,m,k);
bool f = false;
rep(l,n+1){
rep(c,m+1){
if(c*(n-l)+l*(m-c) == k) f = true;
}
}
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 59,012,577 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#define fi first
#define se second
#define pqueue priority_queue
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define int long long
#define mk(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ull> vull;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector< vector<ll> > vvll;
typedef vector<char> vc;
const int INF = 1e9 + 228;
const ll INFLL = 1e18;
const ll MOD = 1e9 + 7;
const ld eps = 1e-6;
const ld eps2 = 1e-9;
const ll MOD2 = 998244353;
const ll dosz = 5e5;
const ll SZ = (1<<18);
const ld PI = atan2l(0, -1);
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void solve(){
int n;
cin >> n;
vi nums(n);
for(int &i:nums)
cin >> i;
vi dp(n, 1000);
for(int i=1; i<n; i++){
dp[i] = max(dp[i-1], dp[i]);
for(int j=0; j<i; j++){
if(nums[j]<nums[i]){
dp[i] = max(dp[i], (dp[j]/nums[j])*nums[i] + dp[j]%nums[j]);
}
}
}
cout << dp[n-1] << endl;
}
signed main(){
fast_io();
srand(time(NULL));
cout << fixed << setprecision(12);
int q = 1;
while(q--)
solve();
} | #include <bits/stdc++.h>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T>
void view(T e) { std::cout << e << std::endl; }
template <typename T>
void view(const std::vector<T>& v) {
for (const auto& e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>>& vv) {
for (const auto& v : vv) {
view(v);
}
}
using namespace std;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
int main() {
int N;
cin >> N;
V<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
long long ans = 1000;
for (int i = 0; i < N - 1; ++i) {
if (A[i] < A[i + 1]) {
ans = ans / A[i] * A[i + 1] + ans % A[i];
}
}
cout << ans << endl;
return 0;
} | 1 | 72,378,489 |
#include <cstdio>
#define f(x)((x)*(x))
int main() {
int d;
while(scanf("%d",&d)!=EOF) {
int sum=0;
for(int i=1;i*d<=600-d;i++) {
sum+=f(i*d)*d;
}
printf("%d\n",sum);
}
} | #include <iostream>
using namespace std;
int main() {
const int max = 600;
int d;
while(cin >> d)
{
int s = 0;
int times = max / d;
for(int i = 1; i < times; i++)
{
s += i*i;
}
s *= d*d*d;
cout << s << endl;
}
return 0;
} | 1 | 92,405,276 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>ti(5);
for(int i=0;i<5;i++)
cin >> ti.at(i);
for(int i=0;i<5;i++){
for(int j=0;j<4;j++){
if((ti.at(j)%10!=0&&ti.at(j)%10<ti.at(j+1)%10)||ti.at(j+1)%10==0)
swap(ti.at(j),ti.at(j+1));
}
}
int ans=0;
for(int i=0;i<5;i++){
if(ans%10!=0)
ans=(ans/10+1)*10;
ans+=ti.at(i);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main()
{
vector<int> a(5);
int mv = 1000;
REP(i, 5) {
cin >> a[i];
if (a[i]%10 > 0) mv = min(mv, a[i]%10);
}
int ans=0;
REP(i,5){
ans+= ((a[i]+9)/10)*10;
}
if (mv != 1000){
ans = ans - 10 + mv;
}
cout << ans << endl;
return 0;
} | 1 | 35,184,518 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k;
cin>>a>>b>>c>>k;
for(int i=0;i<=k;i++){
int d=b,e=c;
for(int j=0;j<i;j++){
d*=2;
}
for(int j=i;j<k;j++){
e*=2;
}
if(a<d&&d<e){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | #include <iostream>
using namespace std;
int main(void){
int A, B, C, K;
cin >> A >> B >> C >> K;
while (A >= B) {
B *= 2;
K--;
}
while (B >= C) {
C *= 2;
K--;
}
if (K >= 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 17,838,212 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define per(i,s,n) for(int i=n-1;i>=s;i--)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
const ll INF=1001001001;
const ll mod=1000000007;
int main(){
ll a,b,c,d;cin>>a>>b>>c>>d;
ll ans=max(a*c,a*d);
ans=max(ans,b*c);
ans=max(ans,b*d);
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define xx first
#define yy second
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ull t;
t=1;
while(t--)
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll A[2]={a,b},B[2]={c,d};
ll i,j,ans=-1*(1e18);
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
ll p=A[i]*B[j];
ans=max(ans,p);
}
}
cout<<ans;
}
} | 1 | 76,938,799 |
#include<iostream>
#include<queue>
using namespace std;
typedef pair<int, int> pii;
pii dxdy[]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
char fld[20][20];
int d[20][20];
const int inf=1e8;
int main(){
while(1){
int W, H;
cin>> W>> H;
if(!(H||W)) break;
int sx, sy;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>> fld[i][j];
if(fld[i][j]=='@'){
sy=i;
sx=j;
}
}
}
for(int i=0; i<H; i++)for(int j=0; j<W; j++)d[i][j]=inf;
queue<pii> Q;
Q.push(pii(sy, sx));
d[sy][sx]=0;
while(!Q.empty()){
pii now=Q.front(); Q.pop();
for(pii dd: dxdy){
int ni=now.first+dd.first;
int nj=now.second+dd.second;
if(!(0<=ni&&ni<H&&0<=nj&&nj<W)) continue;
if(fld[ni][nj]=='#') continue;
if(d[ni][nj]<=d[now.first][now.second]+1) continue;
d[ni][nj]=d[now.first][now.second]+1;
Q.push(pii(ni, nj));
}
}
int ans=0;
for(int i=0; i<H; i++)for(int j=0; j<W; j++){
ans+=(d[i][j]!=inf);
}
cout<< ans<< endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define REP(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define RREP(i,a,b) for(int i=(int)(a); i>=b; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,n,0)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
#define dump(x) (cerr << #x << "=" << x << endl)
template<class T> ostream& osContainer(ostream& os,T c) { os<<'[';for(decltype(c.begin()) it=c.begin();it!=c.end();it++)os<<*it<<',';os<<']';return os; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { return osContainer(os,v); }
template<class T> ostream& operator<<(ostream& os,const set<T>& s) { return osContainer(os,s); }
template<class T> ostream& operator<<(ostream& os,const multiset<T>& s) { return osContainer(os,s); }
template<class T,class S> ostream& operator<<(ostream& os,const map<T,S>& m) { return osContainer(os,m); }
template<class T,class S> ostream& operator<<(ostream& os,const multimap<T,S>& m) { return osContainer(os,m); }
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p){ os << '(' << p.first << ',' << p.second << ')'; return os; }
const int dx[] = {0,1,0,-1};
const int dy[] = {1,0,-1,0};
char check[20][20];
char field[21][21];
void solve()
{
int w, h;
while (cin >> w >> h, w || h) {
memset(check, 0, sizeof(check));
int sx, sy;
rep(i, h) {
rep(j, w){
char c;
cin >> c;
field[i][j] = c;
if (c == '@') {
sy = i, sx = j;
check[sy][sx] = 1;
}
}
cin.ignore();
}
queue<pair<int, int>> q;
q.push(mp(sy, sx));
int s = 1;
while(!q.empty()) {
auto p = q.front();q.pop();
int y = p.first, x = p.second;
rep(i, 4) {
int ddy = y + dy[i], ddx = x + dx[i];
if (0 <= ddy && ddy < h && 0 <= ddx & ddx < w && field[ddy][ddx] == '.' && !check[ddy][ddx]) {
s++;
check[ddy][ddx] = 1;
q.push(mp(ddy, ddx));
}
}
}
cout << s << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(12);
solve();
} | 1 | 63,040,005 |
#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 vc = vector<char>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
cout << (100*n + 1800*m)*(ll)pow(2, m) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int mod=1e9+7;
const int MOD=998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;cin >> n >> m;
cout << ((n-m)*100+m*1900)*(1<<m) << endl;
} | 1 | 29,042,743 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int r, c;
cin >> r >> c;
if(r>9)cout << c;
else cout << c+100*(10-r);
} | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout << "Yes\n";
else cout << "No\n";
}
void abc_151a()
{
char C;
cin >> C;
cout << (char)((int)C + 1) << "\n";
}
void abc_152a()
{
int N, M;
cin >> N >> M;
if (N == M) cout << "Yes\n";
else cout << "No\n";
}
void abc_154a()
{
string S, T;
cin >> S >> T;
int a, b;
cin >> a >> b;
string U;
cin >> U;
if (S == U) cout << a - 1 << " " << b << "\n";
else cout << a << " " << b - 1 << "\n";
}
void abc_156a()
{
int N, R;
cin >> N >> R;
if (N >= 10) cout << R << "\n";
else cout << R + 100 * (10 - N) << "\n";
} | 1 | 15,159,764 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int n, k;
string s;
string solve() {
for (int i = 0; i < n; i++) {
if (s[i] != s[k-1]) {
s[i] = '*';
}
}
return s;
}
void input() {
cin >> n >> s >> k;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char target = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != target) S[i] = '*';
}
cout << S << endl;
return 0;
} | 1 | 51,299,245 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int n;cin>>n;
int x0 = 0,y0 = 0,t0 = 0;
rep(i,n) {
int t,x,y;cin>>t>>x>>y;
int d = (t-t0)-abs(x-x0)-abs(y-y0);
if(d>=0 && abs(d)%2==0){
x0 = x;
y0 = y;
t0 = t;
}
else {
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin>>N;
vector<int>t(N),x(N),y(N);
for(int i=0;i<N;i++)cin>>t[i]>>x[i]>>y[i];
int nx=0,ny=0;
for(int i=0;i<N;i++){
int d=abs(nx-x[i])+abs(ny-y[i]);
int T;
if(i==0)T=t[i];
else T=t[i]-t[i-1];
if(d>T){
cout<<"No"<<endl;
return 0;
}
if((T-d)%2){
cout<<"No"<<endl;
return 0;
}
nx=x[i];
ny=y[i];
}
cout<<"Yes"<<endl;
return 0;
} | 1 | 25,139,762 |
Subsets and Splits