code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 137
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
ll count = 0;
ll prev = -1;
cin >> N;
rep(i, N) {
ll temp;
cin >> temp;
if(temp == prev) {
count++;
prev = -1;
} else {
prev = temp;
}
}
cout << count << endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
static const int N = 100;
struct Matrix{int row, col;};
Matrix M[N];
int cost[N][N] = {0};
int prod(int begin, int end){
int mincost = 100000000, l = end - begin;
if(cost[begin][end] > 0){
return cost[begin][end];
} else {
if(l == 0){
mincost = 0;
} else if(l == 1){
cost[begin][end] = M[begin].row * M[begin].col * M[end].col;
mincost = cost[begin][end];
} else {
int temp;
for(int i = 0; i < l; i++){
temp = prod(begin, begin + i) + prod(begin + i + 1, end);
temp += M[begin].row * M[begin + i].col * M[end].col;
mincost = min(mincost, temp);
}
cost[begin][end] = mincost;
}
return mincost;
}
}
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> M[i].row >> M[i].col;
}
cout << prod(0, n - 1) << endl;
return 0;
} | 0 | 27,057,528 |
#include <stdio.h>
int main()
{
int K, X;
scanf("%d %d", &K, &X);
(K * 500 >= X)?
puts("Yes") : puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,k;
cin >> n >> k;
vector<pair<ll,ll>>cnt(n);
for(ll i=0;i<n;i++){
ll a,b;
cin >> a >> b;
cnt[i]=make_pair(a,b);
}
sort(cnt.begin(),cnt.end());
ll count=0;
ll ans;
for(ll i=0;i<n;i++){
count += cnt[i].second;
if(count>=k){
ans=cnt[i].first;
break;
}
}
cout << ans << endl;
} | 0 | 2,742,635 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
#define all(v) v.begin(), v.end()
#define si(v) int(v.size())
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)),v.end())
const ll mod = 1e9 + 7;
const ll infll = (1LL << 62) - 1;
const ll inf = (1LL << 30) - 1;
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
int a, b; cin >> a >> b;
if (a + b == 15) cout << "+" << endl;
else if (a * b == 15) cout << "*" << endl;
else cout << "x" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
int sum = 0;
for(int i = 1; i <= n; i++)
{
int x = i;
int tmp =0;
while(x)
{
tmp += x%10;
x /= 10;
}
if(tmp >= a && tmp <= b)
sum += i;
}
cout << sum << nl;
return 0;
} | 0 | 80,181,678 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K,S;
cin>>N>>K>>S;
vector<int>A(N);
for(int i=0;i<K;i++)
A.at(i)=S;
for(int i=K;i<N;i++){
if(S==1000000000){
A.at(i)=3;
}else{A.at(i)=1+S;}
}for(int i=0;i<N;i++)
cout<<A.at(i)<<endl;
return 0;
} | #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...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[],int n){
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
}
int main() {
int i,n,m,k,sum=0;
c_p_c();
int a,b;
cin>>n>>m;
pair<int ,int > p[n],c[m];
fo(i,n) cin>>p[i].F>>p[i].S;
fo(i,m) cin>>c[i].F>>c[i].S;
for (int i = 0; i < n; ++i)
{
int index=m;
int maxa=INF;
for (int j = 0; j < m; ++j)
{
if(abs(p[i].F-c[j].F) + abs(p[i].S-c[j].S) < maxa){
maxa=min(maxa,abs(p[i].F-c[j].F) + abs(p[i].S-c[j].S));
index=j+1;
}
}
cout<<index<<endl;
}
return 0;
} | 0 | 80,102,183 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1LL<<60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;
int main() {
ll h, w, n;
cin >> h >> w >> n;
ll p[10] = { };
p[0] = (h-2) * (w-2);
set<P> s;
REP(i, n){
int a, b;
cin >> a >> b;
a--;
b--;
int f[3][3] = { };
FOR(j, a-2, a+3){
FOR(k, b-2, b+3){
if(s.find({j, k}) != s.end()){
FOR(l, j-2, j+1){
FOR(m, k-2, k+1){
if(0 <= l && l < h && 0 <= m && m < w && -2 <= l-a && l-a <= 0 && -2 <= m-b && m-b <= 0){
f[l-a+2][m-b+2]++;
}
}
}
}
}
}
REP(j, 3){
REP(k, 3){
if(0 <= a-2+j && a+j < h && 0 <= b-2+k && b+k < w){
p[f[j][k]]--;
p[f[j][k]+1]++;
}
}
}
s.insert({a, b});
}
REP(i, 10){
cout << p[i] << endl;
}
} | # include <iostream>
using namespace std;
int main(){
int N, M;
int a, b, c, count;
int d[100][100], dc[100][100];
cin >> N >> M;
for(int n1 = 0; n1 < N; n1++) {
for(int n2 = 0; n2 < N; n2++) {
d[n1][n2] = 1001;
dc[n1][n2] = 0;
}
}
for(int m = 0; m < M; m++) {
cin >> a >> b >> c;
d[a-1][b-1] = c;
d[b-1][a-1] = c;
dc[a-1][b-1] = c;
dc[b-1][a-1] = c;
}
for(int k = 0; k < N; k++) {
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
count = 0;
for (int n1 = 0; n1 < N; n1++) {
for (int n2 = n1+1; n2 < N; n2++) {
if (d[n1][n2] - dc[n1][n2] < 0) {
count ++;
}
}
}
cout << count << endl;
return 0;
} | 0 | 64,295,002 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vector<ll>>;
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() {
ll n, m; cin >> n >> m;
vector<long long> vec(n);
ll num = 0;
ll LC = 1;
for(long long i = 0; i < n; i ++){
cin >> vec[i];
vec[i] = vec[i] / 2;
ll tmp = vec[i], count = 0;
while(tmp % 2 == 0){
count++;
tmp = tmp / 2;
}
if(i == 0){
num = count;
}else{
if(num != count){
cout << 0 << endl;
return 0;
}
}
LC = lcm(LC, vec[i]);
}
cout << (m / LC + 1) / 2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define pb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf INT64_MAX
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(x) x.begin(),x.end()
#define digits(x) floor(log10(x))+1
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
class dsu {
private:
int *id;
int* sz;
int root(int i) {
while (i != id[i]) {
id[i] = id[id[i]];
i = id[i];
}
return i;
}
public:
int n;
dsu(int v) {
n = v;
id = new int[n];
sz = new int[n];
for (int i = 0; i < n; i++) {
id[i] = i;
sz[i] = 0;
}
}
bool find(int p , int q) {
return root(p) == root(q);
}
void join(int p , int q) {
int i = root(p);
int j = root(q);
if (i == j) {
return;
}
if (sz[i] < sz[j]) {
id[i] = j ;
sz[j] += sz[i];
}
else {
id[j] = i;
sz[i] += sz[j];
}
}
};
class BIT {
private:
int* FT;
int n;
public:
void updateBIT(int index , int val) {
index += 1;
while (index <= n) {
FT[index] += val;
index += (index & (-index));
}
}
int getSum(int index) {
index += 1;
int sum = 0 ;
while (index > 0) {
sum += FT[index];
index -= (index & (-index));
}
return sum;
}
BIT(int* a , int v) {
n = v ;
FT = new int[n + 1];
for (int i = 1 ; i <= n ; i++) {
FT[i] = 0 ;
}
for (int i = 0 ; i < n ; i++) {
updateBIT(i, a[i]);
}
}
};
int nCr(int n , int r ) {
int p = 1, k = 1;
if (n - r < r ) {
r = n - r;
}
if (r != 0) {
while (r != 0) {
p *= n ;
k *= r ;
int m = __gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else {
p = 1;
}
return p ;
}
int modPower(int x, int y , int p) {
int res = 1;
if (y == 0) {
return 1;
}
x = x % p;
if (x == 0) {
return 0 ;
}
while (y > 0) {
if (y & 1) {
res = (res * x) % p;
}
y >>= 1;
x = (x * x) % p;
}
return res ;
}
int32_t main() {
FIO;
int n ;
cin >> n;
int k ;
cin >> k;
vi a(n);
for (int i = 0 ; i < n ; i++) {
cin >> a[i];
}
int count = 1;
int i = k ;
while (i < n) {
i += (k - 1);
count++;
}
cout << count;
return 0;
} | 0 | 97,468,405 |
#include"bits/stdc++.h"
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << ((abs(a - b) > d || abs(b - c) > d ) && abs(c - a) > d ? "No" : "Yes") << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
int dp[1 << 26];
int main() {
string s;
cin >> s;
int bit = 0, opt;
fill(dp, dp + (1 << 26), INF);
dp[0] = 0;
rep(i, s.size()) {
bit ^= (1 << (s[i] - 'a'));
opt = INF;
rep(j, 26) {
opt = min(opt, dp[bit ^ (1 << j)] + 1);
}
if (bit == 0) opt = 1;
dp[bit] = min(dp[bit], opt);
}
cout << opt << endl;
} | 0 | 68,042,717 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin>>N;
vector<char> vec(N);
for(int i=0;i<N;i++){
cin>>vec[i];
}
int ans=1;
for(int i=0;i<N-1;i++){
if(vec[i+1]!=vec[i]){
ans++;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
map<int,int> ac,wa;
int a=0,w=0;
rep(i,m){
int p;string s;cin>>p>>s;
if(s=="WA")wa[p]++;
else {
if(ac[p]==0){
ac[p]++;
a++;
w+=wa[p];
}
}
}
cout<<a<<" "<<w<<endl;
} | 0 | 68,887,392 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
void solve(){
int k, n;
cin >> k >> n;
vector<int> dis(n);
for(int i = 0; i < n; ++i) cin >> dis[i];
int bigger = 0;
int sum = 0;
for(int i = 0; i < n; ++i) {
int value;
if(i < n - 1) {
value = dis[i+1] - dis[i];
sum += value;
} else {
value = k - dis[i] + dis[0];
sum += value;
}
if(value > bigger) bigger = value;
}
cout << sum-bigger;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int N,K,R,S,P;
string T;
cin >> N >> K;
cin >> R >> S >> P;
cin >> T;
ll ans = 0;
ll count[T.length()];
for(int i=0;i<K;i++){
count[i]=0;
if(T[i]=='r') ans += P;
if(T[i]=='s') ans += R;
if(T[i]=='p') ans += S;
}
for(int i=K;i<T.length();i++){
count[i]=0;
if(T[i]!=T[i-K]){
if(T[i]=='r') ans += P;
if(T[i]=='s') ans += R;
if(T[i]=='p') ans += S;
count[i] = 0;
}else if(count[i-K]%2!=0){
if(T[i]=='r') ans += P;
if(T[i]=='s') ans += R;
if(T[i]=='p') ans += S;
count[i] = count[i-K]+1 ;
}else{
count[i] = count[i-K]+1 ;
}
}
cout << ans << endl;
} | 0 | 58,818,183 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int main() {
int N;
ll cnt = 0;
cin >> N;
vector<ll> A(N);
rep(i,N) {
cin >> A[i];
}
rep(i,N) {
if (A[i]%2==1 && A[i+1]>0 && i<N-1) {
A[i+1]--;A[i]++;
}
cnt += A[i]/2;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
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>;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;
const double pi = acos (-1.0);
const double eps = 1e-7;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ll a[N], res, sum;
bool used[N], is[61];
inline void boost () {
ios_base :: sync_with_stdio (NULL);
cin.tie (NULL), cout.tie (NULL);
}
inline void Solve () {
cin >> n;
for (int i = 1; i <= n; i ++) cin >> a[i], sum ^= a[i];
for (int bit = 60; bit >= 0; bit --) {
if (is[bit]) continue;
if (!(sum & (1ll << bit))) continue;
for (int i = 1; i <= n; i ++)
if (a[i] & (1ll << bit))
a[i] -= (1ll << bit);
}
for (int bit = 60; bit >= 0; bit --) {
int pos = -1;
for (int i = 1; i <= n; i ++) {
if (used[i]) continue;
if (a[i] & (1ll << bit)) {
if (pos == -1 || a[pos] < a[i])
pos = i;
}
}
if (pos != -1) {
used[pos] = 1;
for (int z = bit; z >= 0; z --)
if ((1ll << z) & a[pos])
is[z] = 1;
for (int i = 1; i <= n; i ++)
if (i != pos && ((a[i] & (1ll << bit)) > 0))
a[i] ^= a[pos];
}
}
for (int i = 1; i <= n; i ++) res ^= a[i];
cout << res + (sum ^ res);
}
main () {
boost ();
int tt = 1;
while (tt --) {
Solve ();
}
return 0;
} | 0 | 22,474,779 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define RFOR(i,e,s) for(int (i)=(e)-1;(i)>=(int)(s);(i)--)
#define RREP(i,e) RFOR(i,e,0)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
typedef priority_queue<int> PQI;
typedef priority_queue<PII> PQII;
const int Y = 1000;
int dsum[Y+1];
int main() {
memset(dsum, 0, sizeof(dsum));
FOR(i,1,Y+1) dsum[i] = dsum[i-1] + 200 - (i%3 ? 5 : 0);
int n;
scanf("%d ", &n);
REP(i,n) {
int y, m, d;
scanf("%d%d%d ", &y, &m, &d);
int res = dsum[y-1] + 20*(m-1) + d;
if (y%3) res -= (m-1)/2;
res = dsum[Y-1] + 1 - res;
printf("%d\n", res);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<ll>>;
#define MAX 1000000007
int main()
{
ll n;ll x,m;
cin >> n >> x >> m;
ll ans=0;
ll loop_st;
int loop_before=0;
int loop_num=0;
int loop_after=0;
ll loop_vol=0;
vector<bool> visit(m+1,false);
if(n<m){
rep(i,n){
ans+=x;
x*=x;
x%=m;
}
cout << ans;
return 0;
}
rep(i,m){
if(visit[x]==false){
ans+=x;
visit[x]=true;
x*=x;
x%=m;
loop_before++;
}else if(x==0){
cout << ans << endl;
return 0;
}else{
loop_st=x;
break;
}
}
while(loop_num==0||x!=loop_st){
loop_vol+=x;
x*=x;
x%=m;
loop_num++;
}
ans+=loop_vol*((n-loop_before)/loop_num);
loop_after=(n-loop_before)%loop_num;
rep(i,loop_after){
ans+=x;
x*=x;
x%=m;
}
cout << ans << endl;
} | 0 | 80,273,437 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
int main() {
long n, m;
long x, y, c;
vector<long> xs, ys;
cin >> n >> m;
cin >> c;
REP(i,n-1) {
cin >> x;
xs.push_back(x-c);
c = x;
}
cin >> c;
REP(i,m-1) {
cin >> y;
ys.push_back(y-c);
c = y;
}
x = 0;
y = 0;
vector<long> ks;
long t = n - 1;
ks.push_back(t);
REP(i,(t-1)/2) {
ks.push_back(ks.back() + t - 2 - 2 * i);
}
REP(i,t/2) {
ks.push_back(ks[t/2 - i - 1]);
}
REP(i,t) {
x += ks[i] * xs[i];
x %= MOD;
}
vector<long> ks2;
t = m - 1;
ks2.push_back(t);
REP(i,(t-1)/2) {
ks2.push_back(ks2.back() + t - 2 - 2 * i);
}
REP(i,t/2) {
ks2.push_back(ks2[t/2 - i - 1]);
}
REP(i,t) {
y += ks2[i] * ys[i];
y %= MOD;
}
cout << x * y % MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main() {
int h,w,a,b;
cin >> h>>w>>a>>b;
rep(i,b){
rep(j,a) cout << 0;
rep(j,w-a) cout << 1;
cout << endl;
}
rep(i,h-b){
rep(j,a) cout << 1;
rep(j,w-a) cout << 0;
cout << endl;
}
} | 0 | 94,354,931 |
#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;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(0));
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
int node = 0;
for (int i = 1; i <= n; i++) {
if (v[i].size() == 1) {
node = i;
break;
}
}
vector<int> visited(n + 1, 0);
visited[node] = 1;
long long int res = (long long int)node * (long long int)(n - node + 1);
vector<int> v1, v2;
v1.push_back(node);
while (v1.size() > 0) {
v2.clear();
for (auto now : v1) {
for (auto next : v[now]) {
if (visited[next] == 0) {
if (now < next) {
res += (long long int)(next - now) * (long long int)(n - next + 1);
} else {
res += (long long int)(now - next) * (long long int)next;
}
visited[next] = 1;
v2.push_back(next);
}
}
}
v1 = v2;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
int count = 0;
cin >> s;
if(s[0] == 'R' ||
s[1] == 'R' ||
s[2] == 'R'
)
count = 1;
if(s[0] == 'R' &&
s[1] == 'R'
||
s[1] == 'R' &&
s[2] == 'R'
)
count = 2;
if(s[0] == 'R' &&
s[1] == 'R' &&
s[2] == 'R'
)
count = 3;
cout << count << endl;
} | 0 | 41,083,756 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
long gcd(long a, long b) {
while (true) {
if (a < b) swap(a, b);
if (b == 0) return a;
a %= b;
}
}
int main(void) {
long N, X;
cin >> N >> X;
cout << (N / gcd(N, X) - 1) * 3 * gcd(N, X) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
bool b[33000];
int main() {
int n;
while (cin >> n&&n) {
int a=10000000, b=-100,x;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
a = min(a, x);
b = max(b, x);
}
sum -= a;
sum -= b;
double c = floor((double)sum / (double)(n - 2));
cout << c << endl;
}
} | 0 | 57,074,324 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 200000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int64_t ll;
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; }
string N;
int main() {
cin >> N;
ll tmp = 0;
rep(i, N.size()) {
tmp += N.at(i) - '0';
}
if (tmp%9==0)
{
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int tmp,cnt = 0;
map<int,int> num_cnt;
vector<int> num;
cin >> N;
for(int i = 0; i < N; i++){
cin >> tmp;
if(num_cnt.count(tmp))
num_cnt.at(tmp)++;
else{
num.push_back(tmp);
num_cnt[tmp] = 1;
}
}
for(int i = 0; i < num_cnt.size(); i++){
int suuzi = num[i];
if(num_cnt[suuzi] < suuzi)
cnt += num_cnt[suuzi];
else if(num_cnt[suuzi] > suuzi)
cnt += num_cnt[suuzi] - suuzi;
}
cout << cnt << endl;
} | 0 | 73,304,960 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
int n, k;
cin >> n >> k;
int64_t ans = 0;
map < int, int64_t > mods;
for (int i = 1; i <= n; ++i)
++mods[i % k];
for (int i = 1; i <= n; ++i) {
if ((i % k) == ((k - (i % k)) % k))
ans += mods[i % k] * mods[(k - (i % k)) % k];
}
cout << ans << '\n';
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define abdelrahman010 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
using namespace std;
const int N = 1e3 + 5;
int x , y , z , k;
ll a[N] , b[N] , c[N];
int main() {
abdelrahman010
cin >> x >> y >> z >> k;
for(int i = 0;i < x;i++)
cin >> a[i];
for(int i = 0;i < y;i++)
cin >> b[i];
for(int i = 0;i < z;i++)
cin >> c[i];
sort(a , a + x , greater<>());
sort(b , b + y , greater<>());
sort(c , c + z , greater<>());
vector<ll> v;
for(int i = 0;i < x;i++)
for(int j = 0;j < y;j++)
for(int l = 0;l < z;l++)
if((i + 1) * (j + 1) * (l + 1) <= k)
v.push_back(a[i] + b[j] + c[l]);
else
break;
sort(v.rbegin() , v.rend());
for(int i = 0;i < k;i++)
cout << v[i] << '\n';
return 0;
} | 0 | 62,420,542 |
#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdio>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
using namespace std;
const int N=100005;
int n,L,T,x,w,a[N],id;
int getint()
{
char ch;
while(!isdigit(ch=getchar()));
int x=ch-48;
while(isdigit(ch=getchar())) x=x*10+ch-48;
return x;
}
int main()
{
n=getint(),L=getint(),T=getint();
rep(i,1,n)
{
x=getint(),w=getint()==2?-1:1;
int dis=x+w*T;
if(dis>0) id=(id+dis/L)%n;
if(dis<0) id=(id+(dis+1)/L-1)%n;
a[i]=(dis%L+L)%L;
}
sort(a+1,a+1+n),id=(id+n)%n;
rep(i,id+1,n) printf("%d\n",a[i]);
rep(i,1,id) printf("%d\n",a[i]);
return 0;
} | #include <iostream>
using namespace std;
int m[50][50],a,b,c,d,e,cou;
void dfs(int i,int j){
if(i==b&&j==a)cou++;
if(m[i+1][j]==0&&i+1<=b)dfs(i+1,j);
if(m[i][j+1]==0&&j+1<=a)dfs(i,j+1);
}
int main(){
while(1){
cin >>a>>b;
if(a==0&&b==0)break;
for(int i=1;i<=b;i++){
for(int j=1;j<=a;j++){
m[i][j]=0;
}
}
cin >>c;
for(int i=0;i<c;i++){
cin >>d>>e;
m[e][d]=1;
}
cou=0;
dfs(1,1);
cout << cou <<endl;
}
return 0;
} | 0 | 11,318,824 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int N, Z, W;
cin >> N >> Z >> W;
int A[N]; rep(i, N) cin >> A[i];
if(N == 1) cout << abs(A[0]-W) << endl;
else{
cout << max( abs(A[N-1]-A[N-2]), abs(A[N-1]-W)) << endl;
}
return 0;
}
void solve(){} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
char a,b;
int count[2] = {0};
for(int i=0;i<S.size();i++){
if(i == 0){
a = S[i];
count[0]++;
continue;
}
if(S[i] == a){
count[0]++;
}
else{
if(count[1] == 0){
b = S[i];
count[1]++;
}
else if(S[i] == b){
count[1]++;
}
}
}
if(count[0] == 2 && count[1] == 2){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 | 44,476,873 |
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<ll> a(n);
vector<ll> sumb;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
sumb.push_back(a[i]);
for (int j = i+1; j < n; j++) {
sumb.push_back(sumb.back()+a[j]);
}
}
ll mask = 0;
for (int j = 40; j >=0; j--) {
ll tmp = 0;
for (int i = 0; i < sumb.size(); i++) {
if( (sumb[i] & (((ll)1<<j) | mask)) == (((ll)1<<j) | mask)) tmp++;
}
if(tmp>=k){
mask |= ((ll)1<<j);
}
}
std::cout << mask << std::endl;
} | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,ans;
ans=0;
cin>>n;
vector<int> v;
v.push_back(n);
for(int i=1;;i++)
{
if(n%2==0)
n/=2;
else
n=n*3+1;
v.push_back(n);
for(int k=0;k<i;k++)
{
if(v.at(i)==v.at(k))
{
ans=i+1;
break;
}
}
if(ans!=0)
break;
}
cout<<ans<<endl;
} | 0 | 4,445,216 |
#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 all(x) (x).begin(),(x).end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
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};
using Graph = vector<vector<int>>;
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;}
struct edge{ll to, cost;};
typedef pair<ll,ll> P;
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<P,vector<P>, greater<P> > que;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
};
class UnionFind
{
public:
int par[100005];
int depth[100005];
int nGroup[100005];
UnionFind(int n) {
init(n);
}
void init(int n) {
for(int i=0; i<n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
int root(int x) {
if(par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(x == y) return;
if(depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if(depth[x] == depth[y])
depth[x]++;
}
}
};
int main(){
ll n,m; cin>>n>>m;
ll a[n]={};
rep(i,n){
cin>>a[i];
}
UnionFind tree(n);
rep(i,m){
int x,y; cin>>x>>y;
tree.unite(x-1,y-1);}
ll ca = 0;
rep(i,n){
if(tree.same(a[i]-1,i)) ca++;
}
cout << ca << endl;} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
if(k<a)ans+=k;
else if(b-a>2)
{
ans+=a-1;
k-=a-1;
ans+=(b-a)*(k/2)+(k%2);
}
else
{
ans+=k;
}
cout<<ans<<"\n";
return 0;
} | 0 | 82,715,443 |
#include<cstdio>
#include<bits/stdc++.h>
typedef long long int ll;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for(int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b))
#define BIT(b, i) (((b) >> (i)) & 1)
#define LOG_F 1
#define LOG(...) if(LOG_F) fprintf(stderr, __VA_ARGS__)
using namespace std;
ll pow(int x, int n){
return n == 0 ? 1 : x * pow(x, n - 1);
}
int n,h,w;
int main(){
cin>>n>>h>>w;
int ans=0;
REP(i,n){
int a,b;
cin>>a>>b;
if(a>=h && b>=w)
ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
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 / gcd(a, b)* b;
}
int kan_hyaku(int n){
int kurai = 0;
for(int i=0;i<3;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ju(int n){
int kurai = 0;
for(int i=0;i<2;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ichi(int n){
int kurai = 0;
for(int i=0;i<1;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
ll keta(ll n){
ll wa = 1;
while(n>0){
wa *=10;
n--;
}
return wa;
}
double kan_half(int n){
double wa = 1;
while(n>0){
wa *= 0.5;
n--;
}
return wa;
}
ll facctorialMethod(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum = sum%1000000007 * i%1000000007;
}
return sum;
}
int zorocheck(string s){
int count = 0;
rep(i,s.size()){
if(s.at(i) == s.at(0)) count++;
}
if(count ==s.size()){
return 1;
}
else{
return 0;
}
}
int sannobekijou(int n){
int wa = 1;
while(n>0){
n--;
wa *=3;
}
return wa;
}
ll ketasuu(ll k){
ll wa = 0;
while(k > 0){
k /=10;
wa++;
}
return wa;
}
ll beki(ll f,ll num){
ll wa = 1;
while(num > 0){
wa *= f;
num--;
}
return wa;
}
ll fibona(ll num){
vector<ll>c(3);
c.at(0) = 1;
c.at(1) = 2;
c.at(2) = 3;
if(num == 1){
return c.at(0);
}
else if(num == 2){
return c.at(1);
}
else if(num == 3){
return c.at(2);
}
else{
for(ll i = 3; i < num;i++){
ll tmp;
tmp = c.at(1) + c.at(2);
tmp %= 1000000007;
c.at(0) = c.at(1);
c.at(1) = c.at(2);
c.at(2) = tmp;
}
return c.at(2);
}
}
int main() {
ll n,k;
cin >> n >> k;
k %=MOD;
vector<ll> s(n);
rep(i,n) cin >> s.at(i);
vector<ll>a(3);
ll count = 0;
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){
if(s.at(i) > s.at(j) ) {
count++;
count %= 1000000007;
}
}
}
a.at(0) = count;
count = 0;
vector<ll> b;
b = s;
s.insert(s.end(),b.begin(),b.end());
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){
if(s.at(i) > s.at(j) ) {
count++;
count %= 1000000007;
}
}
}
a.at(1) = count;
count = 0;
s.insert(s.end(),b.begin(),b.end());
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){
if(s.at(i) > s.at(j) ) {
count++;
count %= 1000000007;
}
}
}
a.at(2) = count;
if(k == 1){
cout << a.at(0) << endl;
return 0;
}
else{
ll ans;
vector<ll>c(2);
c.at(0) = a.at(1) - a.at(0);
c.at(1) = a.at(2) - a.at(1);
ll kata = c.at(1) - c.at(0);
ll sepe = c.at(0) - kata;
ll x = a.at(0)%MOD;
ll y = (kata%MOD) * ((((k-1)*k)/2)%MOD) ;
ll z = (sepe%MOD) * ((k-1)%MOD);
ans = x%MOD + y%MOD + z%MOD;
ans %=MOD;
cout << ans << endl;
}
} | 0 | 15,488,428 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
if(a=='H'&&b=='H')cout<<"H"<<endl;
else if(a=='D'&&b=='H')cout<<"D"<<endl;
else if(a=='H'&&b=='D')cout<<"D"<<endl;
else if(a=='D'&&b=='D')cout<<"H"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(k, K) {
vector<ll> B(N + 1);
rep(i, N) {
B[max(0LL, i - A[i])]++;
B[min(N, i + A[i] + 1)]--;
}
rep(i, N) B[i + 1] += B[i];
B.pop_back();
if(A == B) break;
A = B;
}
iter(i, A) cout << i << endl;
return 0;
} | 0 | 27,859,785 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void go(int x) {
cout << x << endl;
exit(0);
}
void solve() {
int x, y;
cin >> x >> y;
if(x == 0 || y == 0) {
if(x == 0) {
if(y >= 0) go(y - x);
else go(abs(y) + 1);
} else if(y == 0) {
if(x < 0) go(abs(x));
else go(abs(x) + 1);
}
}
if(x < y) {
if(x * 1LL * y >= 0) {
go(y - x);
} else {
go(1 + abs(abs(y) - abs(x)));
}
} else if(x == y) {
go(0);
} else {
if(x * 1LL * y >= 0) {
go(2 + abs(abs(x) - abs(y)));
} else {
go(1 + abs(abs(x) - abs(y)));
}
}
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int testcase = 1;
for(int i = 0; i < testcase; i++) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
const int MOD=1000000007;
const double pi = 3.141592653589793;
int main(){
string s;
cin>>s;
int n=s.length();
if(n==2){
if(s[0]==s[1])cout<<"1 2"<<endl;
else cout<<"-1 -1"<<endl;
return 0;
}
rep(i,n-1){
string t = s.substr(i,3);
if(t[0]==t[1]||t[1]==t[2]||t[0]==t[2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<-1<<" "<<-1<<endl;
} | 0 | 13,026,825 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ((i - b + 0.1) * (j - a + 0.1) > 0) {
cout << 0;
} else {
cout << 1;
}
}
cout << '\n';
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <numeric>
#include <ctime>
#include <bitset>
#include <cctype>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF (INT_MAX/2)
#define PI (2*acos(0.0))
#define EPS (1e-8)
#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dp[1001][1001];
int main(void){
ios_base::sync_with_stdio(0);
int N; cin >> N;
while(N--){
string a, b; cin >> a >> b;
memset(dp, 0, sizeof(dp));
for(int i = 0; i < a.size(); i++){
for(int j = 0; j < b.size(); j++){
if(a[i] == b[j]) dp[i+1][j+1] = dp[i][j] + 1;
else dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
}
}
cout << dp[a.size()][b.size()] << endl;
}
return 0;
} | 0 | 40,209,731 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int main() {
int x, t;
cin >> x >> t;
if(x-t < 0) print(0);
else print(x-t);
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
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;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n, k;
ll ans = -INF;
cin >> n >> k;
vector<vector<tuple<int, ll, ll>>> tri(n, vector<tuple<int, ll, ll>>(33,mt(0,-INF,-INF)));
int p;
ll c;
rep(i, n) {
cin >> p;
get<0>(tri[i][0]) = p-1;
}
rep(i, n) {
cin >> c;
get<1>(tri[i][0]) = c;
get<2>(tri[i][0]) = c;
}
for (int j = 0; j < 32;j++) {
rep(i, n) {
get<0>(tri[i][j+1]) = get<0>(tri[get<0>(tri[i][j])][j]);
get<1>(tri[i][j+1]) = get<1>(tri[i][j]) +
get<1>(tri[get<0>(tri[i][j])][j]);
get<2>(tri[i][j+1]) = max(get<2>(tri[i][j]),
get<1>(tri[i][j]) + get<2>(tri[get<0>(tri[i][j])][j]));
}
}
clog << endl;
ll now = 0LL;
int at;
rep(i,n){
at = i;
now = 0LL;
for (int j = 32; j >= 0; j--) {
if (k & (1LL << j)) {
chmax(ans, now + get<2>(tri[at][j]));
now += get<1>(tri[at][j]);
at = get<0>(tri[at][j]);
}
}
}
cout << ans << endl;
} | 0 | 61,499,811 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
typedef long double ld;
ll const MOD=1000000007;
typedef pair<ll,ll> P;
ll N;
ll A[100001];
ll sum[100001];
int main(){
cin>>N;
repn(i,N) cin>>A[i];
sort(A+1,A+N+1);
repn(i,N) sum[i]=sum[i-1]+A[i];
ll ans=1;
repn(i,N-1){
if(A[N-i+1]<=2*sum[N-i]) ans++;
else break;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010]={0,1,2,3,4,5,6,7,8,9};
int main()
{
int k,id=1;scanf("%d",&k);
for(int i=10; i<=k; )
{
ll x=a[id]*10,y=a[id++]%10;
if(y==0)
{
a[i++]=x;
a[i++]=x+1;
}
else if(y==9)
{
a[i++]=x+8;
a[i++]=x+9;
}
else
{
a[i++]=x+y-1;
a[i++]=x+y;
a[i++]=x+y+1;
}
}
printf("%lld\n",a[k]);
return 0;
} | 0 | 18,621,998 |
#include <iostream>
using namespace std;
int isintersecter(double x1,double y1,double x2,double y2,double px,double py,
double qx,double qy){
if(((py-y1)*(x1-x2)-(y1-y2)*(px-x1))*((qy-y1)*(x1-x2)-(y1-y2)*(qx-x1)) < 0)return 1;
else return 0;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,xy;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>xy)
{
if(isintersecter(x1,y1,x2,y2,x3,y3,xp,xy) ||
isintersecter(x2,y2,x3,y3,x1,y1,xp,xy) ||
isintersecter(x1,y1,x3,y3,x2,y2,xp,xy) )cout << "NO" << endl;
else cout << "YES" << endl;
}
} | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const int MAX_N=1e5;
const ll INF=1e18;
int N;
ll D[MAX_N];
map<ll,int> dmp;
int par[MAX_N],chl[MAX_N];
vector<int> G[MAX_N];
ll dist[MAX_N];
int main(){
cin>>N;
REP(i,N)cin>>D[i];
REP(i,N){
dmp[D[i]]=i;
}
REP(i,N){
par[i]=-1;
chl[i]=1;
}
bool flg=true;
{
auto ite=dmp.end();
ite--;
for(;;ite--){
if (ite==dmp.begin()){
break;
}
ll pd=ite->first-N+chl[ite->second]*2;
if (pd>=ite->first || dmp.find(pd)==dmp.end()){
flg=false;
break;
}
int pr=dmp[pd];
par[ite->second]=pr;
chl[pr]+=chl[ite->second];
}
}
if (flg){
int rot;
REP(i,N){
if (par[i]==-1){
rot=i;
}else{
G[i].push_back(par[i]);
G[par[i]].push_back(i);
}
}
queue<int > que;
REP(i,N){
dist[i]=INF;
}
que.push(rot);
dist[rot]=0;
while(!que.empty()){
int v=que.front();
que.pop();
for(auto e:G[v]){
if (dist[e]==INF){
dist[e]=dist[v]+1;
que.push(e);
}
}
}
ll sm=0;
REP(i,N)sm+=dist[i];
if (sm!=D[rot]){
flg=false;
}
}
if (flg){
REP(i,N){
if (par[i]!=-1){
cout<<i+1<<" "<<par[i]+1<<endl;
}
}
}else{
cout<<-1<<endl;
}
return 0;
} | 0 | 1,645,957 |
#include<bits/stdc++.h>
using namespace std;
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
#define ll long long
int main()
{
faster();
int t,n,x;
cin>>n>>x>>t;
int ans;
if(n%x==0) ans = n/x;
else ans = n/x + 1;
cout<<ans*t<<endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
#define ll long long
const int MAX=1e6;
const int MOD=1e9+7;
vector<ll> fact(MAX),inv(MAX),finv(MAX);
int X,Y;
void COMinit(){
fact[0]=fact[1]=1;
inv[1]=1;
finv[0]=finv[1]=1;
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll COM(int n,int k){
if(n<0||k<0||n<k) return 0;
return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
ll solve(int X,int Y){
if(2*Y-X<0||2*X-Y<0) return 0;
if((2*Y-X)%3!=0||(2*X-Y)%3!=0) return 0;
int N=(2*Y-X)/3;
int M=(2*X-Y)/3;
return COM(N+M,N);
}
int main(){
COMinit();
cin>>X>>Y;
cout<<solve(X,Y)<<endl;
return 0;
} | 0 | 58,007,117 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <sstream>
#include <assert.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <unordered_map>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(bool x) {cerr << (x ? "true" : "false");}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
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...);}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif
#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i,x,n) for(int i=x;i<=n;i++)
#define fr(i,x,n) for(int i=x;i>=n;i--)
struct _ { ios_base::Init i; _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); } } _;
int dx[] = { -1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
string s,t; cin>>s>>t;
cout<<t+s;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
vector<ll> v(4);
for(int i = 0; i < 4; i++) cin >> v[i];
ll ans = -2e18;
for(int i = 0; i < 2; i++){
for(int j = 2; j < 4; j++){
ans = max(ans, v[i] * v[j]);
}
}
cout << ans << '\n';
return 0;
} | 0 | 10,726,268 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
const double PI = acos(-1.0);
int dfs(int x, int depth, vvi &path, vi &checked){
int n = checked.size() - 1;
if (checked[x]) return 0;
if (depth == n) return 1;
checked[x] = 1;
int ans = 0;
rep2(i, 1, n + 1){
if (path[x][i]) ans += dfs(i, depth + 1, path, checked);
}
checked[x] = 0;
return ans;
}
int main() {
int n, m;
cin >> n >> m;
vvi path(n + 1, vi(n + 1));
rep(i, m){
int a, b;
cin >> a >> b;
path[a][b] = 1;
path[b][a] = 1;
}
vi checked(n + 1, false);
cout << dfs(1, 1, path, checked) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(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)=(n)-1; (i)>=(m); i--)
#define debug(x) cerr << #x << " = " << x << endl
typedef long long ll;
ll const MOD = 1e9+7;
int const inf = 1e9;
ll const INF = 1e18;
inline void ios_(){cin.tie(0); ios::sync_with_stdio(false);}
template<typename T> int size(const T& a){return (int)a.size();}
template<typename T> T Div(T a, T b){return (a + b - 1) / b;}
template<typename T> bool chmin(T& a, const T& b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, const T& b){if(a < b){a = b; return true;} return false;}
signed main(){
int n;
cin >> n;
int m = 0;
REP(i, n+1){
if(i*(i+1)/2 >= n){
m = i;
break;
}
}
RREP(i, m+1){
if(i <= n){
cout << i << endl;
n -= i;
}
if(n <= 0) break;
}
return 0;
} | 0 | 4,278,183 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define all(x) x.begin(),x.end()
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define testcase() int tc;cin>>tc;while(tc--)
#define clean(x) memset(x,0,sizeof(x))
const lli maxn = 1e5+9;
vector<lli> catlan(int n) {
vector<lli> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i ++) {
for (int j = 0; j < i; ++ j) {
dp[i] += dp[j] * dp[i - j - 1];
}
}
return dp;
}
lli b_ex(lli n,lli a){lli res=1;while(n){if(n%2==1)res*=a;n>>=1;a=a*a;}return res;}
lli ncr(lli n,lli k){lli ans=1;if(k>n-k)k=n-k;for(lli i=1;i<=k;i++){ans*=(n-i+1),ans=ans/i;}return ans;}
lli power(lli a , lli n){lli ans = 1;while(n){if(n % 2)ans = (ans * a) % mod;n /= 2;a = (a * a) % mod;}return ans;}
lli set_bits(lli n)
{
int c=0;
if(n==0)return 0;
while(n)
{
if((n&1)==1)
{
cout<<c<<" ";
}
c++;
n=n>>1;
}
return c;
}
lli lcm(lli a,lli b)
{
lli ans=(a*b)/(__gcd(a,b));
return ans;
}
int digit(lli n)
{
int res=(int)log10(n)+1;
return res;
}
void solve()
{
lli n;cin>>n;
int ans=INT_MAX;
for(lli i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
int res=max(digit(i),digit(n/i));
ans=min(ans,res);
}
}
cout<<ans<<endl;
}
int main()
{
FAST;solve();
} | #include <iostream>
using namespace std;
int main() {
int p[201], ans, t;
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max) {
if (m == 0 && n_min == 0 && n_max == 0) { break; }
for (int i = 0; i < m; i++) {
cin >> p[i];
}
ans = 0; t = 0;
for (int i = n_min; i <= n_max; i++) {
if (t <= p[i-1] - p[i]) {
ans = i;
t = p[i-1] - p[i];
}
}
cout << ans << endl;
}
return 0;
} | 0 | 12,973,831 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n,a,b; cin >> n >> a >> b;
vl num(3);
rep(i,n){
ll x; cin >> x;
if(x <= a) num[0]++;
else if(b+1 <= x) num[2]++;
else num[1]++;
}
cout << min({num[0],num[1],num[2]}) << endl;
} | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e16;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 2510;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,K;
cin >> n >> K;
vector<ll> h(n);
cins(all(h));
ll dp[n+1][n+1][n+1];
rep(i,n+1) rep(j,n+1) rep(k,n+1) dp[i][j][k] = INF;
dp[0][0][0] = 0;
rep(i,n){
rep(j,n){
rep(k,n){
if (i < k || j < k || i < j) continue;
chmin(dp[i+1][j+1][k+1],dp[i][j][k]);
ll plus;
if (i == k) plus = h[i];
else plus = (h[i-k-1] < h[i] ? h[i] - h[i-k-1] : 0);
chmin(dp[i+1][j][0],dp[i][j][k]+plus);
}
}
}
ll ans = INF;
rep(j,K+1){
rep(k,j+1){
chmin(ans,dp[n][j][k]);
}
}
PRINT(ans);
} | 0 | 12,265,466 |
#define DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#ifdef DEBUG
#define dbg(s) {s;}
#endif
#ifndef DEBUG
#define dbg(s)
#endif
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
#define int ll
#define i32 int32_t
#define RBTTYPE int
#define ordered_set tree<RBTTYPE, null_type, less<RBTTYPE>, rb_tree_tag,tree_order_statistics_node_update>
#define all(v) (v).begin(),(v).end()
typedef long long ll;
typedef long double ld;
typedef pair< int, int > pii;
typedef pair< ll, ll > pll;
int getInt () {
bool minus = false;
int result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-') minus = true; else result = ch-'0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result*10 + (ch - '0');
}
if (minus)
return -result;
else
return result;
}
ll gcd(ll x, ll y) {
if (x < y) return gcd(y, x);
if (y == 0) return x;
return gcd(y, x % y);
}
const ll mod = 1e9 + 7;
ll modexp(ll x, ll ex) {
ll ans = 1ll;
while (ex > 0) {
if (ex & 1ll) ans = (ans * x) % mod;
ex >>= 1ll;
x = (x * x) % mod;
}
return ans;
}
const int maxn = 1e6 + 7;
const ll inf = 1e9 + 7;
i32 main() {
IOS;
int n; cin >> n; n += n;
string s; cin >> s; int t = 1, op = 0, cur = 0;
for (int j = 0; j < n; j++) {
int d = (s[j] == 'B');
if (d == cur) { t *= op; op--; cur ^= 1; }
else { op++; cur ^= 1; }
t %= mod;
}
if (op > 0) { cout << 0 << endl; return 0; }
for (int j = 1; j <= n/2; j++) t = (t * j) % mod;
cout << t << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) (upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X))
#define debug(x) cerr<<#x<<':'<<x<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto xXx:v)cerr<<xXx<<' ';cerr<<endl;
#define Yes(X) if(X){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YES(X) if(X){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define ctoi(C) (C-'0')
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int,int>;
using pl = pair<long long,long long>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
const long long dx[] = {1,0,-1,0};
const long long dy[] = {0,1,0,-1};
const long long dx8[] = {1,1,0,-1,-1,-1,0,1};
const long long dy8[] = {0,1,1,1,0,-1,-1,-1};
const long long dx9[] = {1,1,0,-1,-1,-1,0,1,0};
const long long dy9[] = {0,1,1,1,0,-1,-1,-1,0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
long long max(long long x,int y){return max(x,(long long)y);}
long long max(int x,long long y){return max((long long)x,y);}
long long min(long long x,int y){return min(x,(long long)y);}
long long min(int x,long long y){return min((long long)x,y);}
ld func(ld& speed,ld t,ld max,ld lastspeed){
ld firstspeed = speed;
if(max <= lastspeed){
speed = min(speed+t,max);
if(max == speed){
return speed*t - (max-firstspeed)*(max-firstspeed)/2;
}
else{
return firstspeed*t + t*t/2;
}
}
if(firstspeed+t <= lastspeed){
speed = firstspeed+t;
return firstspeed*t + t*t/2;
}
if((firstspeed+lastspeed+t)/2 <= max){
speed = lastspeed;
ld t_first = (lastspeed-firstspeed+t)/2;
ld t_second = t-t_first;
ld first = firstspeed*t_first + t_first*t_first/2;
ld second = lastspeed*t_second + t_second*t_second/2;
return first + second;
}
speed = lastspeed;
ld t_first = max-firstspeed;
ld t_third = max-lastspeed;
ld t_second = t - t_first - t_third;
ld first = firstspeed*t_first + t_first*t_first/2;
ld second = max*t_second;
ld third = lastspeed*t_third + t_third*t_third/2;
return first+second+third;
}
signed main(){
ll N;
cin >> N;
ld t[N+2]={0},v[N+2]={0};
FOR(i,0,N)cin >> t[i+1];
FOR(i,0,N)cin >> v[i+1];
REP(i,1,N+1)chmin(v[i],v[i+1]+t[i]);
ld ans = 0;
ld speed = 0;
FOR(i,1,N+1){
ans += func(speed,t[i],v[i],v[i+1]);
}
cout << ans << endl;
} | 0 | 13,732,073 |
#include<iostream>
using namespace std;
struct Node{int parent,left,right;};
struct Node T[100001];
#define NIL -1
int D[100001],n,dim,child,v,l,s;
void getDepth(int u,int p){
D[u]=p;
if(T[u].right!=NIL) getDepth(T[u].right,p);
if(T[u].left!=NIL) getDepth(T[u].left,p+1);
}
void printchild(struct Node T[],int p,int d){
if(d==0){
if(T[p].left!=NIL){
cout<<T[p].left;
printchild(T,T[p].left,d+1);
}
}
else if(T[p].right!=NIL){
cout<<", "<<T[p].right;
printchild(T,T[p].right,d);
}
}
int main(){
cin>>n;
for(int i=0;i<n;i++) T[i].parent=T[i].right=T[i].left=NIL;
for(int i=0;i<n;i++){
cin>>v>>dim;
for(int j=0;j<dim;j++){
cin>>child;
if(j==0) T[v].left=child;
else T[l].right=child;
l=child;
T[child].parent=v;
}
}
for(int i=0;i<n;i++){
if(T[i].parent==NIL) s=i;
}
getDepth(s,0);
for(int i=0;i<n;i++){
cout<<"node "<<i<<": ";
cout<<"parent = "<<T[i].parent<<", ";
cout<<"depth = "<<D[i]<<", ";
if(T[i].parent==NIL) cout<<"root, [";
else if(T[i].left==NIL) cout<<"leaf, [";
else cout<<"internal node, [";
printchild(T,i,0);
cout<<"]"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(n,0);
dp[0] = 1000;
for(i = 1;i < n;++i){
dp[i] = dp[i - 1];
for(j = 0;j <= i-1;++j){
ll v = dp[j]/a[j];
ll w = dp[j] + (a[i] - a[j])*v;
dp[i] = max(dp[i], w);
}
}
cout << dp[n-1] << endl;
return 0;
} | 0 | 39,200,782 |
#include <stdio.h>
#include <map>
#include <string>
#include <string.h>
using namespace std;
map<string,int> words;
int alltoupper(char *s){
int i,l=strlen(s);
for(i=0;i<l;i++){
s[i] = tolower(s[i]);
}
}
int main(){
char s[32];
int max=0;
string my;
int maxlength=0;
string self;
while(scanf(" %s", s)!=EOF){
alltoupper(s);
string tmp(s);
if(words.find(tmp) != words.end()){
words[tmp]++;
if(words[tmp] > max) max = words[tmp],my = tmp;
}else{
words.insert(pair<string,int>(tmp,1));
if(maxlength < tmp.length()) maxlength = tmp.length(),self=tmp;
}
}
printf("%s %s\n", my.c_str(), self.c_str());
} | #include <iostream>
#include <string>
#include <map>
#include <queue>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(ll i = s;i<=n;i++)
#define rep_r(i,s,n)for(ll i = n-1;i>s;i--)
#define rep_re(i,s,n)for(ll i = n-1;i>=s;i--)
ll MOD = 1e9 + 7;
static const ll MAX_N = 100001;
ll p[MAX_N] = {};
ll s[MAX_N] = {};
ll uf(ll i) { return (p[i] == i) ? i : p[i] = uf(p[i]); }
void init_uf() { rep(i, 1, MAX_N) { p[i] = i; s[i] = 1; } }
void unite(ll x, ll y) {
x = uf(x); y = uf(y);
if (x == y) return;
if (p[x] > p[y]) swap(x, y);
s[x] += s[y];
p[y] = x;
}
ll q[100001] = {};
bool ans[100001] = {};
ll x_id[100001] = {};
ll y_id[100001] = {};
int main() {
init_uf();
ll n, m; cin >> n >> m;
repe(i, 1, n) cin >> q[i];
rep(i, 0, m) {
cin >> x_id[i] >> y_id[i];
unite(q[x_id[i]], q[y_id[i]]);
}
ll A = 0;
repe(i, 1, n) {
if (uf(q[i]) == uf(i)) {
A++;
}
}
cout << A << endl;
return 0;
} | 0 | 16,790,730 |
#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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
if(n==111)cout<<999<<endl;
if(n==119)cout<<991<<endl;
if(n==191)cout<<919<<endl;
if(n==199)cout<<911<<endl;
if(n==911)cout<<199<<endl;
if(n==919)cout<<191<<endl;
if(n==991)cout<<119<<endl;
if(n==999)cout<<111<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a,b;
cin >> a >> b;
if(a==b){
cout << a << endl;
return 0;
}
ll res;
if(a%2==0){
ll n=b-a+1;
if(n%4==0) res=0;
else if(n%4==2) res=1;
else if(n%4==1) res=b;
else if(n%4==3) res=1^b;
}
else{
ll n=b-a;
if(n%4==0) res=a;
else if(n%4==2) res=a^1;
else if(n%4==1) res=a^b;
else if(n%4==3) res=a^1^b;
}
cout << res << endl;
return 0;
} | 0 | 37,399,117 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N,i;
cin>>N>>i;
int ans=N-i+1;
cout<<ans<<endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
string str,str2;
cin>>str>>str2;
int a=0,b=0;
int num=1;
for(int j=0;j<str.size();j++){
if(str[j]>='0'&&str[j]<='9')num=str[j]-'0';
else{
switch(str[j]){
case 'm':a+=1000*num;num=1;break;
case 'c':a+=100*num;num=1;break;
case 'x':a+=10*num;num=1;break;
case 'i':a+=num;num=1;break;
}
num=1;
}
}
num=1;
for(int j=0;j<str2.size();j++){
if(str2[j]>='0'&&str2[j]<='9')num=str2[j]-'0';
else{
switch(str2[j]){
case 'm':b+=1000*num;num=1;break;
case 'c':b+=100*num;num=1;break;
case 'x':b+=10*num;num=1;break;
case 'i':b+=num;num=1;break;
}
num=1;
}
}
int c=a+b;
while(c>0){
if(c/1000>0){
if(c/1000==1)
cout<<'m';
else{
cout<<c/1000<<'m';
}
c=c%1000;
}else if(c/100>0){
if(c/100==1)
cout<<"c";
else
cout<<c/100<<'c';
c=c%100;
}else if(c/10>0){
if(c/10==1)
cout<<'x';
else
cout<<c/10<<'x';
c=c%10;
}else if(c>0){
if(c==1)
cout<<'i';
else
cout<<c<<'i';
c=0;
}
}
cout<<endl;
}
return 0;
} | 0 | 38,925,253 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,sum;
cin>>x>>a>>b;
sum=x+a;
if(b>sum)
cout<<"dangerous"<<endl;
else
{
if(sum>=b&&x>b)
cout<<"delicious"<<endl;
else
cout<<"safe"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) return a;
else return gcd(b,a%b);
}
bool is_prime[1000010];
void dfs(int d,ll num,vector<ll> &lunlun){
lunlun.push_back(num);
if(d == 10) return;
for (int i = -1; i <= 1; ++i) {
int tmp = num%10;
tmp += i;
if(tmp >= 0 && tmp <= 9){
dfs(d+1,10*num+tmp,lunlun);
}
}
}
int main() {
int k;
cin >> k;
vector<ll> ans;
for (int i = 1; i <= 9; ++i) {
dfs(1,i,ans);
}
sort(ans.begin(),ans.end());
cout << ans[k-1] << endl;
return 0;
} | 0 | 54,345,174 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
int res=0;
for(int i=0;i<g[now].size();i++){
int next=g[now][i];
if(used[next]) continue;
res^=dfs(next);
}
return(res+1);
}
int main(){
cin>>N;
for(int i=1;i<N;i++){
int x,y;
cin>>x>>y;
x--;
y--;
g[x].push_back(y);
g[y].push_back(x);
}
used[0]=true;
int ans=0;
for(int i=0;i<g[0].size();i++){
int grundy=dfs(g[0][i]);
ans^=grundy;
}
if(ans==0) cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> lines(h);
string s;
int cnt = 0;
for (int hi = 0; hi < h; hi++) {
cin >> s;
if (s.find("#") != string::npos) {
lines.at(cnt) = s;
cnt++;
}
}
for (int i = w-1; i > -1; i--) {
string tmp = "";
for (int j = 0; j < cnt; j++) {
tmp += lines.at(j).at(i);
}
if (tmp.find("#") == string::npos) {
for (int j = 0; j < cnt; j++) {
lines.at(j).erase(i, 1);
}
}
}
int i = 0;
while (i < cnt) {
cout << lines.at(i) << endl;
i++;
}
} | 0 | 71,137,028 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
ll ans=0;
ll cnt=0;
for (int i = 0; i < s.size(); ++i) {
if(s[i]=='B')cnt++;
else ans+=cnt;
}
cout <<ans <<endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
int n;
int sum = 0;
int flag = 0;
int p = 0;
string ud[100];
cin >> n;
if (n == 0)
return 0;
for(int i = 0; i < n; i++){
cin >> ud[i];
if(ud[i] == "ru" || ud[i] == "lu"){
p++;
}
if(ud[i] == "rd" || ud[i] == "ld"){
p--;
}
if(p % 2 == 0 && p != flag){
flag = p;
sum++;
}
}
cout << sum << "\n";
}
} | 0 | 70,131,437 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#include <vector>
#include <numeric>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
using ll =long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
ll N;
cin >> N;
vl A(N);
vl B(N);
for(ll i=0; i<N; i++){
cin >> A.at(i) >> B.at(i);
}
ll sum = 0;
for(ll i=N-1; i>=0; i--){
if((sum + A.at(i)) % B.at(i)==0){
sum += 0;
}
else{
sum += B.at(i) - ((sum + A.at(i)) % B.at(i));
}
}
cout << sum << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VL> VLL;
typedef pair<ll, ll> PL;
typedef map<ll, ll> MP;
typedef vector<pair<ll, ll>> PS;
template <class T, class U>
bool chmax(T &a, U b) {
if (a <= b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
bool chmin(T &a, U b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
int main() {
ll n,k,m,x=0,y=0,z = 0,h=0,w=0,ans=0,sum = 0, Max = -1, Min = 3e9+1;
string t;
bool ok=true;
cin >> n >> y;
for(int i=0; i<=n;i++){
for(int j=0; j<=n ;j++){
int k = n-i-j;
if(i*10000 + j*5000 + k*1000 == y && i+j+k==n && k>=0){
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1 << endl;
return 0;
} | 0 | 8,516,033 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r, d, x2000;
cin >> r >> d >> x2000;
int tmp = x2000;
for (int i = 1; i <= 10; i++) {
int next = tmp * r - d;
cout << next << endl;
tmp = next;
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100010],L[100010]; int n;
int lis(){
L[0]=a[0];
int l=1;
for(int i=1;i<n;i++){
if(a[i]>L[l-1]) L[l++]=a[i];
else{
*lower_bound(L,L+l,a[i])=a[i];
}
}
return l;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("%d\n",lis());
} | 0 | 26,720,368 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
s[5]=' ';
s[13]=' ';
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t X,Y;
int cnt = 0;
int64_t target;
cin >> X >> Y;
target = Y/X;
for(int64_t i=0;i<61;i++) {
if(((int64_t)1<<i) <= target) {
cnt++;
} else {
break;
}
}
cout << cnt << endl;
return 0;
} | 0 | 37,727,344 |
#include<cstdio>
long long a[100005];
long long upper[100005], lower[100005];
long long power[100005];
long long count[100005];
long long min(long long a,long long b){ return a>b?b:a; }
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i <= n; i++) scanf("%lld",&a[i]);
upper[n] = 0;
for(int i = n-1; i >= 0; i--){
upper[i] = upper[i+1]+a[i+1];
}
count[0] = 1-a[0];
int ok = 1; long long ans = 1;
if(count[0]>upper[0] || a[0]>1) ok = 0;
for(int i = 1; i <= n; i++){
if(2*count[i-1]<a[i]){
ok = 0;
break;
}
else{
count[i] = min(upper[i],2*count[i-1]-a[i]);
ans += count[i]+a[i];
}
}
if(!ok) printf("-1\n");
else printf("%lld\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d(ll x){
ll ans = 0;
while(x){
++ans;
x/=10;
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
ll dp[n+1];
dp[0]=0;
for(int i=1; i<=n; i++){
cin >> dp[i];
--dp[i];
dp[i]+=dp[i-1];
dp[i]%=k;
}
ll ans = 0;
map<int, int> mp;mp[0]=1;
for(int i=1; i<=n;i++){
if(i>=k) mp[dp[i-k]]--;
ans+= mp[dp[i]]++;
}
cout << ans;
return 0;
} | 0 | 76,536,420 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vvs = vector<vs>;
using vvb = vector<vb>;
int main() {
char s;
cin >> s;
if (isupper(s)) cout << 'A' << endl;
else cout << 'a' << endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;
using namespace std;
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
#define pll pair<ll,ll>
#define pii pair<int,int>
#define piiii pair<pii,pii>
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FO ifstream fin("a.in");ofstream fout("a.out");
#define TEST int testcase;cin>>testcase;while(testcase--)
#define all(x) (x).begin(),(x).end()
#define mset0(x) memset((x), 0, sizeof((x)));
#define mset1(x) memset((x), -1, sizeof((x)));
#define endl "\n"
#define plll pair<ll,pll>
#define logg2 0.30102999566398119521373889472449L
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const int maxn=2e5;
ll dp[maxn+1][13];
ll p=1;
map<int,int> mp1,mp2;
bool f(int i){
if(mp1[1] && i!=1) return(false);
for(int j=2;j*j<=i;j++){
if(i%j!=0) continue;
if(mp1[j] || mp1[i/j]) return(false);
}
return(true);
}
void solve(){
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
mp1[arr[i]]++;
}
int cnt=0;
for(auto pp:mp1){
if(pp.second!=1) continue;
if(f(pp.first)) cnt++;
}
cout<<cnt;
return;
}
int main(){
IO
solve();
return(0);
} | 0 | 14,844,792 |
#include <bits/stdc++.h>
#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 INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
int n, c, k;
cin >> n >> c >> k;
vector<ll>t(n, 0);
REP(i, n) {
cin >> t[i];
}
sort(ALL(t));
ll curr = 0;
ll ans = 0;
while(curr < n){
ll firstPassenger = curr;
bool ok = true;
ll on = 1;
curr++;
while (ok){
if (t[curr] <= t[firstPassenger]+k) on++;
else {
ok = false;
continue;
}
if (on > c) {
ok = false;
continue;
}
curr++;
}
ans++;
}
cout << ans << endl;
} | #include<iostream>
#include<cstdio>
#include<map>
using namespace std ;
int main(){
int n;
char a,b;
for(;;){
map<char,char> a2b;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> a >> b;
a2b[a]=b;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a2b.count(a)==0){
cout<<a;
}
else cout<<a2b[a];
}
cout<<endl;
}
return 0;
} | 0 | 77,010,249 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<long long int> a(5);
long long int high=10000000;
long long int pre=0;
for(long long int i=0; i<5; i++){
cin>>a.at(i);
if(a.at(i)%10!=0){
high=min(a.at(i)%10,high);
if(high==a.at(i)%10){
pre=i;
}
}
}
long long int ans=0;
for(long long int i=0; i<5; i++){
if(i==pre){
ans+=a.at(i);
}else{
if(a.at(i)%10==0){
ans+=a.at(i);
}else{
ans+=a.at(i)+(10-a.at(i)%10);
}
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Graph
{
public:
Graph(int n);
void Show() const;
private:
vector<vector<int>> m_graph;
};
Graph::Graph(int n) :
m_graph(n, vector<int>(n, 0))
{
for (int i = 0; i < n; ++i)
{
int u, k;
cin >> u >> k;
vector<int> list(k);
for (int j = 0; j < k; ++j)
{
cin >> list[j];
}
for (auto v : list)
{
m_graph[u-1][v-1] = 1;
}
}
}
void Graph::Show() const
{
for (auto a: m_graph)
{
for (int i = 0, size = a.size(); i < size; ++i)
{
cout << a[i];
if (i != size - 1)
{
cout << " ";
}
}
cout << endl;
}
}
int main(void)
{
int n;
cin >> n;
Graph graph(n);
graph.Show();
return 0;
} | 0 | 53,669,537 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d,i,ans,d_di;
while(cin>>d){
ans = 0;
for(i = d;i < 600;i += d){
ans += i*i*d;
}
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int n, k, s;
cin >> n >> k >> s;
vector<int> ans(n);
int prime;
if(s != 144701) prime = 144701;
else prime = 144497;
if(k == 0) {
rep(i, n) cout << prime << " ";
cout << endl;
return 0;
}
int kusa;
if(s == 1 || s == 2) kusa = s+1;
else kusa = s-1;
rep(i, n) {
if(i < k) ans[i] = s;
else ans[i] = kusa;
}
rep(i, n) cout << ans[i] << " ";
cout << endl;
return 0;
} | 0 | 63,275,107 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
int main() {
int n, k;
std::cin >> n >> k;
int ans = 1;
for (int i = 0; i < n; i++)
{
ans = std::min(ans * 2, ans + k);
}
std::cout << ans << "\n";
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct edge {
ll to;
ll cost;
};
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') return 0;
if (c == '1') return 1;
if (c == '2') return 2;
if (c == '3') return 3;
if (c == '4') return 4;
if (c == '5') return 5;
if (c == '6') return 6;
if (c == '7') return 7;
if (c == '8') return 8;
if (c == '9') return 9;
return -1;
}
char to_char(int i){
if (i == 0) return '0';
if (i == 1) return '1';
if (i == 2) return '2';
if (i == 3) return '3';
if (i == 4) return '4';
if (i == 5) return '5';
if (i == 6) return '6';
if (i == 7) return '7';
if (i == 8) return '8';
if (i == 9) return '9';
return ' ';
}
ll BS(vector<ll> V, ll Q) {
sort(V.begin(), V.end());
int L = -1;
int R = V.size();
while (R - L > 1) {
int M = (L + R) / 2;
if (V.at(M) < Q) L = M;
else R = M;
}
if (R == int(V.size())) return INF;
return V.at(R);
}
bool PN(int x) {
if (x <= 1) return false;
if (x == 2) return true;
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0) return false;
}
return true;
}
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1) ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
int main() {
cout << fixed << setprecision(16);
string A, B;
cin >> A >> B;
if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else if (B.size() > A.size()) {
cout << "LESS" << endl;
}
else {
for (int i = 0; i < int(A.size()); i++) {
if (ctoi(A.at(i)) > ctoi(B.at(i))) {
cout << "GREATER" << endl;
break;
}
else if (ctoi(A.at(i)) < ctoi(B.at(i))) {
cout << "LESS" << endl;
break;
}
if (i == int(A.size() - 1)) {
cout << "EQUAL" << endl;
break;
}
}
}
} | 0 | 47,115,557 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9+7;
#define REP(i,n) for (int i = 0; i < (n); i++)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll k;
cin >> k;
cout << 50 << endl;
ll a[50];
for (int i = 0; i < 50; i++) {
a[i] = i+k/50;
}
for (int i = 0; i < k%50; i++) {
a[49-i]++;
}
for (int i = 0; i < 50; i++) {
cout << a[i];
if (i != 49) cout << " ";
else cout << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
struct Node{
int parent;
int depth;
vector<int> children;
};
void solve(vector<struct Node> &node, int x){
for(int i=0;i<node[x].children.size();i++){
node[node[x].children[i]].depth += node[x].depth + 1;
solve(node, node[x].children[i]);
}
}
void printNode(vector<struct Node> node, int n){
for(int i=0;i<n;i++){
cout<<"node "<<i<<": parent = "<<node[i].parent<<", depth = "<<node[i].depth<<", ";
if(node[i].parent == -1)
cout<<"root";
else if(node[i].children.size() == 0)
cout<<"leaf";
else
cout<<"internal node";
cout<<", [";
for(int j=0;j<node[i].children.size();j++){
cout<<node[i].children[j];
if(j != node[i].children.size()-1)
cout<<", ";
}
cout<<"]"<<endl;
}
}
int main(){
int n, id, k, c, x;
vector<struct Node> node(100000);
cin>>n;
for(int i=0;i<n;i++){
node[i].parent = -1;
node[i].depth = 0;
}
for(int i=0;i<n;i++){
cin>>id>>k;
for(int j=0;j<k;j++){
cin>>c;
node[id].children.push_back(c);
node[c].parent = id;
}
}
for(int i=0;i<n;i++)
if(node[i].parent == -1)
x = i;
solve(node, x);
printNode(node, n);
return 0;
} | 0 | 19,383,918 |
#include <iostream>
using namespace std;
inline void swap(int a[], int i, int j){
int t = a[i]; a[i] = a[j]; a[j] = t;
}
void selection(int a[], int N)
{
int i, j, min;
for(i = 1; i < N; i++){
min = i;
for(j = i + 1; j <= N;j++)
if(a[min] > a[j]) min = j;
swap(a, min, i);
}
}
int main(){
int a[6];
for(int i = 1; i <= 5; i++){
int n;
cin >> n;
a[i] = n;
}
selection(a, 5);
for(int i = 5; i > 1; i--)
cout << a[i] << " ";
cout << a[1] << endl;
} | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
using namespace std;
int n;
vector<int> g[110000];
int v[110000];
int du[110000],root;
int sz[110000],f[110000];
void dfs(int x,int fa)
{
int tmp=0,maxx=0;
for (int i=0;i<g[x].size();i++)
if (g[x][i]!=fa)
{
dfs(g[x][i],x),sz[x]+=sz[g[x][i]];
tmp+=sz[g[x][i]]-f[g[x][i]];
f[x]+=f[g[x][i]];
maxx=max(maxx,sz[g[x][i]]-f[g[x][i]]);
}
if (sz[x]==0) {sz[x]=v[x];return;}
if (tmp-v[x]<0) {printf("NO\n");exit(0);}
int delta=tmp-v[x];
if (delta+delta>tmp||delta>tmp-maxx) {printf("NO\n");exit(0);}
f[x]+=delta*2;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&v[i]);
for (int i=1;i<n;i++)
{
int x,y;
scanf("%d %d",&x,&y);
g[x].push_back(y);
g[y].push_back(x);
du[x]++,du[y]++;
}
if (n==2)
{
if (v[1]==v[2]) printf("YES\n");
else printf("NO\n");
return 0;
}
for (int i=1;i<=n;i++)
if (du[i]!=1)
{
root=i;
break;
}
int all=0;
dfs(root,0);
if (sz[root]!=f[root]) printf("NO\n");
else printf("YES\n");
return 0;
} | 0 | 81,319,366 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#define txto freopen("output.txt", "w", stdout);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return vector< vector<ll> >(n, vector<ll>(m));}
bool compare(char &s1,char &s2){return s1 > s2;}
bool sortmahstyle(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
if(a.second > b.second )
return true;
if( a.second==b.second && a.first > b.second )
return true;
return false;
}
ll const mod = 1e9+7;
ll const inf = 1e6+2;
ll fact[inf];
void factfill()
{
fact[0]=1;
for(ll i=1; i<inf; i++)
fact[i] = ( fact[i-1]*i ) % mod;
}
ll powmod(ll a, ll b)
{
ll res = 1;
while(b){
if(b%2) res = ( res*a )%mod;
a = (a*a)%mod;
b/=2;
}
return res;
}
ll inv(ll x)
{
return powmod(x,mod-2) % mod;
}
ll choose(ll n, ll r)
{
return ( (fact[n]* inv(fact[n-r] ) )%mod *inv(fact[r]))%mod;
}
void solve()
{
ll n; cin >> n;
cout << n*(n+1)/2 ;
}
int main() {
Knucklehead
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t;
t=1;
f(testcases,0,t){
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i < 1000; i++) {
int a[3] = {i / 100, (i / 10) % 10, i % 10};
int cou = 0;
for(int j = 0; j < n; j++) {
if(a[cou] == (s[j] - '0')) cou++;
if(cou == 3) break;
}
if(cou == 3) ans++;
}
cout << ans << endl;
return 0;
} | 0 | 92,246,314 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> si( string s ){
vector<char> A(s.size()) ;
for( int i=0 ; i<s.size() ; i++ ){
A.at(i) = s.at(i) ;
}
vector<ll> a(s.size()) ;
for( int i=0 ; i<s.size() ; i++ ){
a.at(i) = A.at(i) - '0' ;
}
return a ;
}
int main() {
string S ;
cin >> S ;
for( int tmp=0 ; tmp< ( 1 << 4 ) ; tmp++ ){
bitset<4> p(tmp) ;
string K = S ;
vector<ll> A = si(S) ;
ll ans = 0 ;
for( int i=0 ; i<4 ; i++ ){
if( p.test(i) ){
A.at(3-i) *= -1 ;
K.insert( (3-i) , "-" ) ;
}
else{
if( i != 3 ){
K.insert( (3-i) , "+" ) ;
}
}
ans += A.at(3-i) ;
}
if( ans == 7 ){
cout << K << "=7" << endl;
break;
}
}
} | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
const ll A = 1000005;
ll euclidean_gcd(ll a, ll b) {
if(a < b) return euclidean_gcd(b, a);
ll r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
int solve(){
ll N;
cin >> N;
vector <ll> a(N,0);
string pc = "pairwise coprime";
string sc = "setwise coprime";
string nc = "not coprime";
vector <ll> c(A,0);
REP(i,N)
{
cin >> a[i];
c[a[i]]++;
}
bool pairwise = true;
for(int i = 2; i < A; i++)
{
int cnt = 0;
for(int j = i; j < A; j+=i)
{
cnt += c[j];
}
if(cnt > 1)
{
pairwise = false;
}
}
if(pairwise)
{
cout << pc << endl;
return 0;
}
int g = a[0];
for(int i = 1; i < N; ++i)
{
g = euclidean_gcd(g,a[i]);
}
if(g == 1)
{
cout << sc << endl;
return 0;
}
cout << nc << endl;
return 0;
}
int main()
{
solve();
return 0;
} | 0 | 78,796,787 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<int, int>> ans;
if (N % 2 == 1) {
for (int l = 1, r = N - 1; l < r; l++, r--) {
ans.emplace_back(l, r);
}
} else {
bool flag = false;
for (int l = 1, r = N - 1; l < r; l++, r--) {
if (!flag && r - l <= N / 2) {
--r;
flag = true;
}
ans.emplace_back(l, r);
}
}
for (int i = 0; i < M; i++) {
printf("%d %d\n", ans[i].first, ans[i].second);
}
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using LDOUBLE = long double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline SDWORD inputSDWORDPlus(void)
{
SDWORD lNumber = 0;
for (;;) {
char c = getchar();
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
} else {
return lNumber;
}
}
}
#define MAX_H (300000)
#define MAX_W (300000)
int main(void)
{
SDWORD lH = inputSDWORDPlus();
SDWORD lW = inputSDWORDPlus();
SDWORD lM = inputSDWORDPlus();
static SDWORD s_alCntH[MAX_H];
static SDWORD s_alCntW[MAX_W];
SDWORD lMaxH = 0;
SDWORD lMaxW = 0;
vector<pair<SDWORD, SDWORD>> vpairlTgtPos;
for (SDWORD lIdx = 0 ; lIdx < lM; lIdx++) {
SDWORD lTgtH = inputSDWORDPlus() - 1;
SDWORD lTgtW = inputSDWORDPlus() - 1;
s_alCntH[lTgtH]++;
s_alCntW[lTgtW]++;
vpairlTgtPos.emplace_back(make_pair(lTgtH, lTgtW));
}
for (SDWORD lIdx = 0; lIdx < lH; lIdx++) {
lMaxH = max(lMaxH, s_alCntH[lIdx]);
}
for (SDWORD lIdx = 0; lIdx < lW; lIdx++) {
lMaxW = max(lMaxW, s_alCntW[lIdx]);
}
SDWORD lCntMaxH = 0;
SDWORD lCntMaxW = 0;
for (SDWORD lIdx = 0; lIdx < lH; lIdx++) {
if (s_alCntH[lIdx] == lMaxH) {
lCntMaxH++;
}
}
for (SDWORD lIdx = 0; lIdx < lW; lIdx++) {
if (s_alCntW[lIdx] == lMaxW) {
lCntMaxW++;
}
}
SQWORD sqCntMaxPos = 0;
SDWORD lMaxHW = lMaxH + lMaxW;
for (auto pos: vpairlTgtPos) {
if (s_alCntH[pos.first] + s_alCntW[pos.second] == lMaxHW) {
sqCntMaxPos++;
}
}
if (sqCntMaxPos == (SQWORD)lCntMaxH * (SQWORD)lCntMaxW) {
printf("%ld\n", lMaxHW - 1);
} else {
printf("%ld\n", lMaxHW);
}
return 0;
} | 0 | 51,449,742 |
#include <iostream>
int main(){
int i,x;
i=1;
while(true){
std::cin>>x;
if(x == 0) break;
std::cout << "Case "<< i << ": " << x << std::endl;
i++;
}
return 0;
} | #include <iostream>
bool is_right_triangle(const int a, const int b, const int c)
{
bool ret;
int aa;
int bb;
int cc;
aa = a * a;
bb = b * b;
cc = c * c;
if (aa + bb == cc || bb + cc == aa || cc + aa == bb){
ret = true;
}
else {
ret = false;
}
return ret;
}
int main()
{
int n;
int a;
int b;
int c;
std::cin >> n;
for (int i = 0; i < n; i++){
std::cin >> a >> b >> c;
if (is_right_triangle(a, b, c)){
std::cout << "YES" << std::endl;
}
else {
std::cout << "NO" << std::endl;
}
}
return 0;
} | 0 | 77,545,840 |
#include <iostream>
int main(int argc, char* argv[] ){
int a,b;
std::cin >> a >> b;
const char* exp = (a == b) ? "==":
(a<b)? "<" : ">" ;
std::cout<<"a "<<exp<<" b"<<std::endl;
} | #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);
ll N, A, B;
cin >> N >> A >> B;
if(A+B-1 > N || A*B < N) cout << -1 << endl;
else {
ll rem = N-(A+B-1);
vector<ll> v;
auto build = [&]() {
rep(i, A) rrep(j, B) {
if(i != 0 && j != B-1 && rem == 0) {
REP(k, i+1, A) v.push_back(B*k+j);
return;
}
v.push_back(B*i+j);
if(i != 0 && j != B-1) rem--;
}
};
build();
vector<ll> u;
rep(i, v.size()) u.push_back(v[i]);
sort(all(u));
vector<ll> ans;
rep(i, v.size()) {
ans.push_back(lower_bound(all(u), v[i])-begin(u)+1);
}
rep(i, N) {
if(i) cout << ' ';
cout << ans[i];
}
cout << "\n";
}
return 0;
} | 0 | 33,277,326 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 2e5 + 7;
struct Fen {
int f[N];
void clear() {
for (int i = 0; i < N; ++i) f[i] = 0;
}
void add(int i, int x) {
for (; i < N; i |= i + 1)
f[i] += x;
}
int get(int i) {
int ans = 0;
for (; i >= 0; i &= i + 1, --i) ans += f[i];
return ans;
}
int get(int l, int r) {
return get(r) - get(l - 1);
}
} f;
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n;
cin >> n;
vector <int> p(n);
vector <int> c;
for (int i = 0; i < n; ++i) {
cin >> p[i];
c.app(p[i]);
}
sort(all(c));
vector <int> bad[2];
for (int i = 0; i < n; ++i) {
p[i] = lower_bound(all(c), p[i]) - c.begin();
if ((i ^ p[i]) & 1) {
bad[i & 1].app(i);
}
}
if (bad[0].size() != bad[1].size()) {
cout << "LMAO" << endl;
}
cout << bad[0].size() << endl;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n;
cin >> n;
vector<ll> arr(n+1, 0);
for(auto& val: arr)
cin >> val;
vector<ll> rem(n+1, 0);
rem[0] = 1;
for(int i = 0; i <= n; i++) {
if (i > 0) rem[i] = rem[i-1]*2;
rem[i] -= arr[i];
if (rem[i] < 0) {
cout << -1 << endl;
return 0;
} else if (rem[i] >= 1e14) {
rem[i] = 1e14;
}
}
ll ans = 0;
for(int i = n; i >= 0; i--) {
ll upper = rem[i] + arr[i];
if (i < n)
arr[i] += arr[i+1];
arr[i] = min(arr[i], upper);
ans += arr[i];
}
cout << ans << endl;
return 0;
} | 0 | 8,487,162 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(),(a).end()
typedef pair<int,int> P;
typedef long long ll;
int main() {
int a,b;
cin >> a >> b;
if(b > a){
swap(a,b);
}
rep(i,a){
cout << b;
}
cout << endl;
return 0;
} | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; i++ )
#define repll(n) for( ll i = 0 ; i < n ; i++ )
#define REPll(n) for( ll i = 1 ; i <= n ; i++ )
#define rep2(n) for( int j = 0 ; j < n ; j++ )
#define REP2(n) for( int j = 1 ; j <= n ; j++ )
#define repll2(n) for( ll j = 0 ; j < n ; j++ )
#define REPll2(n) for( ll j = 1 ; j <= n ; j++ )
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a , b;
cin >> a >> b;
cout << ( a - 1 ) * ( b - 1 );
} | 0 | 85,933,218 |
#include <cstring>
#include <iostream>
using namespace std;
int n, m, sum;
int main()
{
cin >> n >> m >> sum;
for (int i = 1; i <= m; i++)
{
cout << sum << " ";
}
int temp = n - m;
for (int i = 1; i <= temp; i++)
{
if (sum == 1e9)
{
cout << sum - 1 << " ";
}
else
cout << sum + 1 << " ";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main(){
ll n, k;
cin >> n >> k;
vector<p> array;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
array.push_back(p(a, b));
}
sort(array.begin(), array.end());
ll ans = 0, sum = 0;
while(sum < k){
sum += array[ans].second;
ans++;
}
cout << array[ans - 1].first << endl;
} | 0 | 55,135,469 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define EPS 1e-10
using namespace std;
unsigned long long int a[100000]={};
unsigned long long int fib(long long int n){
if(a[n]!=0)return a[n];
if(n==0)return 1;
if(n==1)return 1;
return a[n]=fib(n-1)+fib(n-2);
}
int main(){
int a;
cin>>a;
cout<<fib(a)<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
int cumsum[60 * 60 * 24];
int to_sec(string S){
return stoi(S.substr(0, 2)) * 60 * 60 + stoi(S.substr(3, 2)) * 60 + stoi(S.substr(6,2));
}
int main(void){
while(true){
int n;
cin >> n;
if(n == 0){
break;
}
for(int i = 0; i < 60 * 60 * 24; i++){
cumsum[i] = 0;
}
for(int i = 0; i < n; i++){
string s1;
string s2;
cin >> s1 >> s2;
cumsum[to_sec(s1)] ++;
cumsum[to_sec(s2)] --;
}
for(int i = 1; i < 60 * 60 * 24; i++){
cumsum[i] += cumsum[i - 1];
}
int ans = 0;
for(int i = 0; i < 60 * 60 * 24; i++){
ans = max(ans, cumsum[i]);
}
cout << ans << endl;
}
return 0;
} | 0 | 36,569,292 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
int i,j,k;
main()
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(k>=n) cout<<x*n<<endl;
else
{
cout<<(k*x)+(n-k)*y<<endl;
}
} | #include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
class Dice{
public:
int face[7];
int nowFace;
int center;
int top;
int bottom;
int left;
int right;
Dice(int num[]){
for(int i = 1; i <= 6; i++){
face[i] = num[i];
}
center = 1;
top = 5;
bottom = 2;
left = 4;
right = 3;
}
void move(char command){
switch(command){
case 'E':
top = top;
bottom = bottom;
right = center;
center = left;
left = 7 - right;
break;
case 'N':
left = left;
right = right;
top = center;
center = bottom;
bottom = 7 - top;
break;
case 'S':
left = left;
right = right;
bottom = center;
center = top;
top = 7 - bottom;
break;
case 'W':
top = top;
bottom = bottom;
left = center;
center = right;
right = 7 - left;
break;
}
}
void rotateRight(){
right = bottom;
bottom = left;
left = 7 - right;
}
void setCenter(int _center){
int diceIndex = 0;
for(int i = 1; i <= 6; i++){
if(_center == face[i]){
diceIndex = i;
break;
}
}
switch(diceIndex){
case 1:
break;
case 2:
move('N');
break;
case 3:
move('W');
break;
case 4:
move('E');
break;
case 5:
move('S');
break;
case 6:
move('S');
move('S');
break;
}
}
void setBottom(int _bottom){
int diceIndex = 0;
for(int i = 1; i <= 6; i++){
if(_bottom == face[i]){
diceIndex = i;
break;
}
}
while(bottom != diceIndex){
rotateRight();
}
}
void printDebug(){
cout << "center: " << center << endl;
cout << "top: " << top << endl;
cout << "bottom: " << bottom << endl;
cout << "left: " << left << endl;
cout << "right: " << right << endl;
}
void print(){
cout << face[right] << endl;
}
};
int main(){
int face[7];
int num;
for(int i = 1; i <= 6; i++){
cin >> num;
face[i] = num;
}
int rows;
cin >> rows;
for(int i = 0; i < rows; i++){
Dice dice(face);
int center;
cin >> center;
dice.setCenter(center);
int bottom;
cin >> bottom;
dice.setBottom(bottom);
dice.print();
}
return 0;
} | 0 | 39,777,800 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define fi first
#define se second
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define v(T) vector<T>
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> void Print(vector<T> v) {
F0R(i, v.size()) {
cout << v[i] << ' ';
}
cout << newl;
}
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
#if 1
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
i64 X;
cin >> N >> X;
vector<i64> as(51), bs(51);
as[0] = bs[0] = 1;
F0R(i, 50) {
as[i + 1] = as[i] * 2 + 1;
bs[i + 1] = bs[i] * 2 + 3;
}
i64 r = 0;
auto eat = [&](auto eat, int level)->void {
if (!level) {
if (X) {
r++;
X--;
}
return;
}
X--;
if (X <= 0) return;
if (X < bs[level - 1]) {
eat(eat, level - 1);
return;
}
X -= bs[level - 1];
r += as[level - 1];
if (X <= 0) return;
X--; r++;
if (X <= 0) return;
if (X < bs[level - 1]) {
eat(eat, level - 1);
return;
}
X -= bs[level - 1];
r += as[level - 1];
X--;
};
eat(eat, N);
cout << r;
}
#endif | #include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i,a,b) for(Re int i = a;i <= b;++i)
#define ROF(i,a,b) for(Re int i = a;i >= b;--i)
#define SFOR(i,a,b,c) for(Re int i = a;i <= b;i+=c)
#define SROF(i,a,b,c) for(Re int i = a;i >= b;i-=c)
#define CLR(i,a) memset(i,a,sizeof(i))
#define BR printf("--------------------\n")
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 100+5;
int N,a[MAXN],cnt[MAXN];
int main(){
scanf("%d",&N);
FOR(i,1,N) scanf("%d",a+i),cnt[a[i]]++;
std::sort(a+1,a+N+1);
if(a[N-1] != a[N]) {puts("Impossible");return 0;}
cnt[a[N]] -= 2;
FOR(i,1,a[N]-1){
int d = std::max(i,a[N]-i);
if(!cnt[d]){
puts("Impossible");return 0;
}
cnt[d]--;
}
FOR(i,1,(a[N]+1)/2){
if(cnt[i]){
puts("Impossible");return 0;
}
}
puts("Possible");
return 0;
} | 0 | 445,648 |
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>
using namespace std;
#define FOR(i, a, b) for(int (i)=(a);(i)<(b);(i)++)
#define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)
#define REP(i, n) FOR((i), 0, (n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>
void print_container(T &container, string delim=" ") {
bool first = true;
for(auto &t: container){
if(!first){
cout << delim;
}
first = false;
cout << t;
}
cout << endl;
}
ll dot(pll v1, pll v2){
return v1.first * v2.first + v1.second * v2.second;
}
int main() {
int n;
cin >> n;
vector<pll> dat(n);
REP(i, n){
cin >> dat[i].first >> dat[i].second;
}
ll maxx = 0;
REP(i, n){
pll vec = dat[i];
if(vec.first == 0 && vec.second == 0)
continue;
pll vec1 = make_pair(vec.second, -vec.first);
pll vec2 = make_pair(-vec.second, vec.first);
ll num1 = 0, num2 = 0;
pll p1 = {0, 0}, p2 = {0, 0};
REP(j, n){
ll dot1 = dot(vec1, dat[j]);
ll dot2 = dot(vec2, dat[j]);
if(dot1 > 0 || (dot1 == 0 && dot(dat[i], dat[j]) < 0)){
p1.first += dat[j].first;
p1.second += dat[j].second;
}
if(dot2 > 0 || (dot2 == 0 && dot(dat[i], dat[j]) > 0)){
p2.first += dat[j].first;
p2.second += dat[j].second;
}
}
num1 = dot(p1, p1);
num2 = dot(p2, p2);
maxx = max({maxx, num1, num2});
}
printf("%.14f\n", sqrt(maxx));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,q;
cin >> n >> q;
vector<vector<int>> to(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
to[x].push_back(y);
to[y].push_back(x);
}
queue<int> que;
que.push(0);
vector<int> cnt(n,0);
vector<int> ans(n,-1);
rep(i,q){
int x,y;
cin >> x >> y;
x--;
cnt[x]+=y;
}
while(!que.empty()){
int x=que.front();que.pop();
for(int y:to[x]){
if(ans[y]!=-1) continue;
que.push(y);
cnt[y]+=cnt[x];
}
ans[x]++;
}
rep(i,n) cout << cnt[i] << endl;
} | 0 | 14,804,644 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int m,h,i;
string str;
cin >> str;
while(str != "-") {
cin >> m;
for(i=0;i<m;i++) {
cin >> h;
string left = str.substr(0,h);
str.erase(0,h);
str+=left;
}
cout << str << endl;
cin >> str;
}
} | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int s=S.size();
if (s==1||s==2) {
cout << S.at(0) << endl;
}
else {
if (s%2==0) {
for (int i=0; i<s/2-1; i++) {
cout << S.at(2*i);
}
cout << S.at(s-2) << endl;
}
else {
for (int j=0; j<(s-1)/2; j++) {
cout << S.at(2*j);
}
cout << S.at(s-1) << endl;
}
}
} | 0 | 70,469,231 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl a(n);
rep(i, n) {
cin >> a[i];
}
sort(all(a));
ll left = -1;
ll right = n;
while(right - left > 1) {
ll x = (left + right)/2;
vector<vector<bool>> dp(n+1, vector<bool>(k+1, false));
dp[0][0] = true;
rep(i, n) {
exrep(j, 0, k) {
if(dp[i][j]) {
dp[i+1][j] = true;
}
if(i == x) {
continue;
}
if(j >= a[i] && dp[i][j - a[i]]) {
dp[i+1][j] = true;
}
}
}
bool noneed = true;
exrep(j, max(0LL, k-a[x]), k-1) {
if(dp[n][j]) {
noneed = false;
}
}
if(noneed) {
left = x;
}
else {
right = x;
}
}
out(right);
re0;
} | #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
int main()
{
ll N, M;
cin >> N >> M;
priority_queue<ll> Q;
REP(i,0,N) {
ll a;
cin >> a;
Q.push(a);
}
REP(i,0,M) {
ll v = Q.top(); Q.pop();
Q.push(v/2);
}
ll sum = 0;
while(!Q.empty()) {
sum += Q.top();
Q.pop();
}
PR(sum);
return 0;
} | 0 | 83,438,167 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n, m, d, p, res, cnt[11];
while (cin >> n >> m, n | m) {
res = 0;
for (int i = 0; i < 11; ++i)
cnt[i] = 0;
for (int i = 0; i < n; ++i) {
cin >> d >> p;
cnt[p] += d;
}
for (int i = 10; i > 0; --i) {
if (m > cnt[i]) {
m -= cnt[i];
} else {
res += i * (cnt[i] - m);
m = 0;
}
}
cout << res << endl;
}
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
for (int i = N; i <= 999; i++) {
int num = i;
int a = num / 100;
num = num % 100;
int b = num / 10;
num = num % 10;
if (a == b && b == num) {
printf("%d\n", i);
return 0;
}
}
return 0;
} | 0 | 1,904,288 |
#include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
using namespace std;
int main()
{
lli t,n,i,ans=0;
cin>>n;
map<string,lli>m;
string s[n];
for(i=0;i<n;i++){
cin>>s[i];
sort all(s[i]);
m[s[i]]++;
}
map<string,lli>::iterator it;
for(it=m.begin();it!=m.end();it++){
t=it->second;
if(t>1){
t--;
ans+=(t*(t+1))/2;
}
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long> V(n);
for(int i = 0; i < n; i++){
cin >> V[i];
}
long long ans = 0;
for(int l = 0; l <= min(k, n); l++){
for(int r = 0; l + r <= min(k, n); r++){
vector<long long> v;
long long tmp = 0;
for(int i = 0; i < l; i++){
v.push_back(V[i]);
tmp += V[i];
}
for(int i = 0; i < r; i++){
v.push_back(V[n-1-i]);
tmp += V[n-1-i];
}
sort(v.begin(), v.end());
for(int i = 0; i < min((int)v.size(), k - l - r); i++){
if(v[i] < 0) tmp -= v[i];
}
ans = max(tmp, ans);
}
}
cout << ans << endl;
} | 0 | 56,943,896 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
int dictionaly_size;
while(true){
cin >> dictionaly_size;
if(dictionaly_size == 0){
break;
}
map<char, char> change;
for(int i = 0; i < dictionaly_size; i++){
char key, value;
cin >> key >> value;
change[key] = value;
}
int word_count;
cin >> word_count;
string words(word_count, ' ');
char tmp;
for( string::iterator itr = words.begin(); itr != words.end(); itr++){
cin >> tmp;
map<char, char>::iterator itr_m = change.find(tmp);
if( itr_m != change.end() ){
*itr = itr_m->second;
}else{
*itr = tmp;
}
}
cout << words << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int N,x,y,visited[100010] = {0};
vector<vector<int>> v(100010);
int dfs(int n){
visited[n] = 1;
int g = 0;
if(n!=1 && v[n].size()==1) return 0;
for(int i=0;i<v[n].size();i++){
int s = v[n][i];
if(visited[s]==0){
if((n==1 && v[n].size()==1) || n!=1 && v[n].size()==2) return dfs(s)+1;
else{
g ^= dfs(s)+1;
}
}
}
return g;
}
int main(){
cin >> N;
for(int i=0;i<N-1;i++){
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
cout << (dfs(1)==0? "Bob":"Alice") << endl;
} | 0 | 6,620,657 |
#include <iostream>
#include <vector>
#include <algorithm>
#define INF 1010101010
using namespace std;
int main()
{
int n, m, o;
cin >> n >> m >> o;
vector<int> r(o);
for (int i = 0; i < o; i++) {
cin >> r[i];
r[i]--;
}
sort(r.begin(), r.end());
vector<vector<int>> a(n, vector<int>(n, INF));
for (int i = 0; i < m; i++) {
int s, t, u;
cin >> s >> t >> u;
s--;
t--;
a[s][t] = u;
a[t][s] = u;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
a[j][k] = min(a[j][k], a[j][i] + a[i][k]);
}
}
}
int mn = INF;
do {
int tmp = 0;
for (int i = 0; i < o - 1; i++) {
tmp += a[r[i]][r[i + 1]];
}
mn = min(mn, tmp);
} while (next_permutation(r.begin(), r.end()));
cout << mn << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
if( a < b && b < c ){
cout << "Yes" << endl;
return 0;
}
while(k--){
if( a >= b ){
b = b*2;
}
else if( b >= c ){
c = c*2;
}
if( a < b && b < c ){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0 ;
} | 0 | 47,771,519 |
#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 a, b;
char solve() {
if (a + b == 15) return '+';
if (a * b == 15) return '*';
return 'x';
}
void input() {
cin >> a >> b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 1000000000000
#define MOD 10000007
typedef long long ll;
int main(){
int n;cin>>n;
vector<int> v;
rep(i,n){
int a;cin>>a;
v.push_back(a);
}
ll ans=INF;
FOR(i,-100,100){
ll t=0;
rep(j,n){
t+=(v[j]-i)*(v[j]-i);
}
ans=min(ans,t);
}
cout<<ans<<endl;
} | 0 | 35,953,205 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;
int main(){
int n, sum=100000;
int i, j, k;
int tot, ans, num;
cin >> n;
for(i=0; i<n; i++){
sum *= 1.05;
if(sum%1000 != 0) sum = (sum/1000+1)*1000;
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll X, Y;
int main(){
cin >> X >> Y;
ll n = (X+Y)/3;
ll a = X - n;
ll b = Y - n;
ll result = 0;
if ( 2*a+b != X || 2*b+a != Y || a < 0 || b < 0 ){
result = 0;
}
else {
COMinit();
result = COM(n,a);
}
cout << result << endl;
return 0;
} | 0 | 34,056,668 |
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn(1e5 + 5);
int n, a[maxn];
ll sum, cur, x, v[maxn];
int main() {
int i;
scanf("%d", &n);
if (n == 1) return puts("YES"), 0;
for (i = 1; i <= n; ++i) scanf("%d", &a[i]), sum += a[i];
cur = (ll)n * (n + 1) / 2;
if (sum % cur) return puts("NO"), 0;
sum /= cur, a[0] = a[n], cur = 0;
for (i = 1; i <= n; ++i) {
if ((a[i - 1] + sum - a[i]) % n) return puts("NO"), 0;
x = (a[i - 1] + sum - a[i]) / n;
if (x < 0) return puts("NO"), 0;
cur += x;
}
if (cur != sum) return puts("NO"), 0;
return puts("YES"), 0;
} | using namespace std;
#include <bits/stdc++.h>
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
signed main() {
int w,h;cin>>w>>h;
vi p(w),q(h);
vector<pii> pq;
rep(i,w){
cin>>p[i];
pq.pb(mp(p[i], 0));
}
rep(i,h){
cin>>q[i];
pq.pb(mp(q[i], 1));
}
sort(all(pq));
int hcnt=h+1, wcnt=w+1;
int ans = 0;
rep(i, h+w){
int cost = pq[i].first;
int t = pq[i].second;
dump(i, cost, t);
if (t==0) {
wcnt--;
ans += cost*hcnt;
}
else{
hcnt--;
ans += cost*wcnt;
}
dump(i,ans,hcnt,wcnt);
}
cout << ans << endl;
return 0;
} | 0 | 3,816,471 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
string s;
cin >> s;
bool oka = false;
bool okb = false;
bool okc = false;
rep(i, 3){
if (s[i] == 'a') oka = true;
else if (s[i] == 'b') okb = true;
else if (s[i] == 'c') okc = true;
}
if (oka && okb && okc) cout << "Yes\n";
else cout << "No\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph = vector<vector<pair<ll, ll>>>;
int main()
{
ll N, M; cin >> N >> M;
vll A(N);
rep(i, N) {
cin >> A[i];
}
vll sum(N);
ll k = 0;
rep(i, N) {
if (i == 0) sum[i] = A[i]; else sum[i] = A[i] + sum[i-1];
}
sum.insert(sum.begin(), 0);
map<ll, ll> mp;
rep(i, sum.size()) {
mp[sum[i] % M]++;
}
ll cnt = 0;
for (auto p : mp) {
cnt += p.second * (p.second - 1) / 2;
}
cout << cnt << endl;
return 0;
} | 0 | 26,210,143 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long long ll;
int D;
int main(){
cin>>D;
string ans="Christmas";
for(int i=0;i<25-D;i++){
ans+=" Eve";
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
ll gcd(ll a,ll b) {return b ? gcd(b,a%b) : a;}
const long long INF = 1LL << 60;
const int mod = 1000000007;
const double PI = acos(-1.0);
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int main () {
ll a,b;
cin >> a>>b;
ll A,B;
if(a%2==0&&b%2==0){
if((b-a)/2%2==0){
cout << b <<endl;
return 0;
}
else {
ll ans = b^1;
cout << ans <<endl;
return 0;
}
}
if(a%2==0&&b%2==1){
if((b-a+1)/2%2==0){
cout << 0 <<endl;
return 0;
}
else {
cout << 1 <<endl;
return 0;
}
}
if(a%2==1&&b%2==0){
if((b-1-a)/2%2==0){
ll ans = a^b;
cout << ans <<endl;
return 0;
}
else {
ll ans = a^b^1;
cout << ans <<endl;
return 0;
}
}
if(a%2==1&&b%2==1)
{
if((b-a)/2%2==0){
cout << a<<endl;
return 0;
}
else{
ll ans = a^1;
cout << ans <<endl;
return 0;}
}
} | 0 | 34,032,497 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll MX = ll(1e9)+7;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n) {
int a;
cin >> a;
m[a]++;
}
for(auto p : m) {
if(p.second > 1) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
int main()
{
ll n, h , w;
cin >> n >> h >> w;
int ans = 0;
rep(i,n) {
ll a, b; cin >> a >> b;
if (a >= h && b >= w)
ans++;
}
cout << ans << endl;
return 0;
} | 0 | 75,076,221 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,M;
cin >> N >> M;
vector<int> X(N + 1);
vector<int> Y(M + 1);
cin >> X[0] >> Y[0];
rep(i,N) {
cin >> X[i + 1];
}
rep(j,M) {
cin >> Y[j + 1];
}
sort(X.begin(),X.end());
sort(Y.begin(),Y.end());
if (X[N] < Y[0]) {
cout << "No War" << endl;
}
else {
cout << "War" << endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll n;
cin>>n;
vector<int> va(n);
for(ll i=0;i<n;i++){
ll a;
cin>>a;
va[i]=a;
}
sort(va.begin(),va.end(),greater<>());
int last=-1;
int cnt=0;
vector<ll> memo;
for(int i=0;i<n;i++){
if(last!=va[i]){
last=va[i];
cnt=1;
continue;
}else{
cnt++;
}
if(cnt>=2){
memo.push_back(va[i]);
cnt-=2;
}
if(memo.size()==2) break;
}
if(memo.size()>=2){
cout<<memo[0]*memo[1]<<endl;
}else{
cout<<0<<endl;
}
return 0;
} | 0 | 66,531,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PrePro ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define fr(i,n) for(ll i = 0; i < n; i++)
#define fre(i,a,b) for(ll i = a; i <= b; i++)
#define fb(i,n) for(ll i = n; i >= 0; i--)
#define fbe(i,a,b) for(ll i = a; i >= b; i--)
#define umap(x,y) unordered_map<x,y>
#define uset(x) unordered_set<x>
#define vv(x) vector<x>
#define pp(x,y) pair<x,y>
#define prar(a,n) fr(i,n){cout << a[i] << " ";}
#define inar(a,n) fr(i,n){cin >> a[i];}
#define mk make_pair
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define MAX 1000001
inline ll gcd(ll a, ll b){
if(b == 0){
return a;
}
return gcd(b,a%b);
}
inline ll pwr(ll a, ll b, ll modulo = mod){
if(a == 0 && b == 0){
return 0;
}
ll ans = 1;
while(b > 0){
if(b&1){
ans = ((ans%modulo) * (a%modulo))%modulo;
}
b >>= 1;
a = ((a%modulo) * (a%modulo))%modulo;
}
return (ans+modulo)%modulo;
}
inline ll modInverse(ll a, ll p){
return pwr(a,p-2,p);
}
ll dfs(vv(vv(char)) &arr, vv(vv(ll)) &dp, ll &n, ll &m, ll i, ll j){
if(i == n-1 && j == m-1){
return dp[i][j] = 1%mod;
}
if(dp[i][j] != -1){
return dp[i][j]%mod;
}
ll op1 = 0, op2 = 0;
if(i+1 < n && arr[i+1][j] == '.'){
op1 = dfs(arr,dp,n,m,i+1,j);
}
if(j+1 < m && arr[i][j+1] == '.'){
op2 = dfs(arr,dp,n,m,i,j+1);
}
return dp[i][j] = ((op1%mod)+(op2%mod))%mod;
}
void solve(){
ll n, m;
cin >> n >> m;
vv(vv(char)) arr(n,vv(char)(m));
fr(j,n){
inar(arr[j],m);
}
vv(vv(ll)) dp(n,vv(ll)(m,-1));
cout << dfs(arr,dp,n,m,0,0)%mod << endl;
}
int main(){
PrePro
ll t = 1;
fr(i,t){
solve();
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
ll x[n+1]={};
ll y[n+1]={};
ll z[n+1]={};
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
z[i]=abs(x[i])+abs(y[i]);
}
for(int i=0;i<n;i++){
if(z[i]%2!=z[0]%2){
cout<<"-1"<<endl;
return 0;
}
}
vector<ll> d;
for(int i=30;i>=0;i--){
d.push_back(1<<i);
}
if(z[0]%2==0) d.push_back(1ll);
int m=d.size();
cout<<m<<endl;
for(int i=0;i<m-1;i++) cout<<d[i]<<" ";
cout<<d[m-1]<<endl;
for(int i=0;i<n;i++){
ll u=x[i]+y[i];
ll v=x[i]-y[i];
vector<char> ans;
for(int j=0;j<m;j++){
if(u>=0){
if(v>=0){
ans.push_back('R');
u-=d[j];
v-=d[j];
}else{
ans.push_back('U');
u-=d[j];
v+=d[j];
}
}else{
if(v>=0){
ans.push_back('D');
u+=d[j];
v-=d[j];
}else{
ans.push_back('L');
u+=d[j];
v+=d[j];
}
}
}
for(int j=0;j<m;j++) cout<<ans[j];
cout<<endl;
}
return 0;
} | 0 | 56,301,032 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int w,h,x,y,r;
cin>>w>>h>>x>>y>>r;
if(x<r||x>w-r||y<r||y>h-r)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
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=1e18;
int main(){
ll n;
cin >> n;
ll bi=(n-1)%2;
deque<ll> de;
rep(i,n){
ll a;
cin >> a;
if(i%2==bi){
de.push_front(a);
}
else{
de.push_back(a);
}
}
rep(i,n){
ll v=de.front();
de.pop_front();
if(i) cout << " ";
cout << v;
}
cout << endl;
return 0;
} | 0 | 88,543,267 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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 rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n;
cin >> n;
int ans = 0;
for(int i = 1;i<n;i++){
if(i!= n-i)ans++;
}
cout<<ans/2<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(ll i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for(ll i = (n-1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
constexpr int MOD = 1000000007;
int mod(int a)
{
int res = a % MOD;
if(res < 0) {
return res + MOD;
}
return res;
}
int mul_mod(int a, int b)
{
ll res = ((ll)a * (ll)b) % MOD;
return mod((int)res);
}
int pow_mod(int a, int b)
{
ll res = 1;
while (b > 0) {
if(b & 1) {
res = res * (ll)a % (ll)MOD;
}
a = mul_mod(a, a);
b >>= 1;
}
return (int)res;
}
int inv_mod(int a)
{
return pow_mod(a, MOD - 2);
}
int div_mod(int a, int b)
{
return mul_mod(a, inv_mod(b));
}
constexpr int FAC_MAX = 100000;
ll fac[FAC_MAX], finv[FAC_MAX], inv[FAC_MAX];
void com_init()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com_mod(int a, int b){
if (a < b) return 0;
if (a < 0 || b < 0) return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> t(n), a(n);
rep (i, n) cin >> t[i];
rep (i, n) cin >> a[i];
vector<bool> amb(n);
vector<int> h(n);
bool valid = true;
rep (i, n) {
if (i == 0) {
amb[0] = false;
} else {
amb[i] = (t[i] == t[i - 1]);
}
h[i] = t[i];
}
reprev (i, n) {
bool now;
if (i == n - 1) {
now = false;
} else {
now = (a[i] == a[i + 1]);
}
if (now && amb[i]) chmin(h[i], a[i]);
else if (now) valid &= (a[i] >= h[i]);
else if (amb[i]) {
amb[i] = false;
valid &= (h[i] >= a[i]);
h[i] = a[i];
}
else valid &= (a[i] == h[i]);
}
if (!valid) cout << "0\n";
else {
ll ans = 1;
rep (i, n) {
if (amb[i]) ans = mul_mod(ans, h[i]);
}
cout << ans << "\n";
}
return 0;
} | 0 | 93,494,638 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define si(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define sl(a) scanf("%lld",&a)
#define sl2(a,b) scanf("%lld%lld",&a,&b)
#define pb push_back
#define mk make_pair
#define loop(n) for(int i=0; i<n; i++)
#define FOR(a,b) for(int i=a; i<=b; i++)
#define sz size()
#define ff first
#define ss second
#define mem(a,val) memset(a, val, sizeof(a))
#define md 1000000007
#define pi acos(-1.0)
ll a[200010], cnt=0;
bool vis[100010];
vector<ll>g[100010];
void dfs(ll rt)
{
vis[rt]=1;
int f=0;
for(auto x: g[rt])
{
if(a[x]>=a[rt]) f=1;
}
if(!f) cnt++;
}
int main()
{
ll t,n,i,j,k,l,r,mn=0, mx=0,m,u,v;
sl2(n,m);
for(int i=1; i<=n; i++)
sl(a[i]);
for(int i=0; i<m; i++)
{
sl2(u,v);
g[u].pb(v);
g[v].pb(u);
}
for(int i=1; i<=n; i++)
{
if(vis[i]==0)
{
if(g[i].sz==0) cnt++, vis[i]=1;
else dfs(i);
}
}
cout<<cnt;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >>S;
int count=0;
if(S.at(0)=='A'){
if(islower(S.at(1))){
for(int i=2;i<S.size()-1;i++){
if(S.at(i)=='C'){
count ++;
}
else if(isupper(S.at(i))){
cout <<"WA"<<endl;
return 0;
}
}
}
else{
cout<<"WA"<<endl;
return 0;
}
}
else{
cout <<"WA"<<endl;
return 0;
}
if(islower(S.at(S.size()-1))){
if(count==1){
cout <<"AC"<<endl;
}
else{
cout <<"WA"<<endl;
return 0;
}
}
else{
cout <<"WA"<<endl;
return 0;
}
} | 0 | 24,097,197 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char ch;
int cnt[26] = {};
while(cin >> ch){
if('a' <= ch && ch <= 'z'){
cnt[ch - 'a']++;
}
else if('A' <= ch && ch <= 'Z'){
cnt[ch - 'A']++;
}
}
for(int i = 0; i < 26; i++){
printf("%c : %d\n", 'a' + i, cnt[i]);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
string S; cin >> S;
ll len = S.length();
for (int i = 0; i < S.length(); i+=2) {
len -= 2;
string s1 = S.substr(0, len/2);
string s2 = S.substr(len/2, len/2);
if (s1 == s2) {
cout << s1.length() * 2 << endl;
break;
}
}
} | 0 | 69,124,876 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod =1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> T maxt(T x,T y) {if (x>y) return x;else return y;}
template<class T> T mint(T x,T y) {if (x>y) return y;else return x;}
double print_double(double d){printf("%.7f", d);}
vector<ll> divisor(ll n) {
vector<ll> ret;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
struct edge {
int from;
int to;
ll cost;
};
vector<ll> bellman_ford (vector<edge> edges, int V, int E, int r, ll INF = 100000000000) {
vector<ll> cost_to(V,INF);
cost_to[r] = 0;
rep(i,V) {
rep(j,E) {
edge e = edges[j];
if (cost_to[e.from]==INF) continue;
if (cost_to[e.to] > cost_to[e.from] + e.cost) {
cost_to[e.to] = cost_to[e.from] + e.cost;
if (i==V-1) {
printf("NEGATIVE CYCLE\n");
return {};
}
}
}
}
return cost_to;
}
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
vector<int> cnt;
void dfs(const vector<vector<int>> &G, int v, int p) {
for (auto nv : G[v]) {
if (nv == p) continue;
dfs(G, nv, v);
}
cnt[v] = 1;
for (auto c : G[v]) {
if (c == p) continue;
cnt[v] += cnt[c];
}
}
int sdig(int d){
int ans = 0;
rep(i,7) if (d>>i&1) ans++;
return ans;
}
int main() {
ll N,K;
cin >> N >> K;
vector<ll> A(N);
rep(i,N) cin >> A[i];
if (K>*max_element(A.begin(),A.end())) {
cout << "IMPOSSIBLE\n";
return 0;
}
ll tmp = A[0];
rep2(i,1,N){
tmp = __gcd(tmp,A[i]);
}
rep(i,N) {
if ((A[i]-K)%tmp==0) {
cout << "POSSIBLE\n";
return 0;
}
}
cout << "IMPOSSIBLE\n";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
long long multi = 1;
vector<long long> a;
for(int i = 0; i < n; i++){
long long x; cin >> x;
a.push_back(x);
if(x == 0){
cout << 0;
return 0;
}
}
for(int i = 0; i < n; i++){
if(a.at(i) <=1000000000000000000/multi)
multi *=a.at(i);
else{
cout << -1;
return 0;
}
}
cout << multi;
} | 0 | 54,276,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll i=0; i<n; i++)
#define frep(i,m,n) for(ll i=m; i<=n; i++)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
ll n, k, ans = -1*INF; cin >> n >> k;
vector<ll> p(n), c(n);
rep(i, n) {
cin >> p[i];
p[i]--;
}
rep(i, n) cin >> c[i];
rep(i, n) {
ll m = -1*INF, now = p[i];
vector<ll> sum(1, 0);
sum.push_back(c[now]);
while(now != i) {
ll len = sum.size();
now = p[now];
sum.push_back(sum[len-1]+c[now]);
}
ll len = sum.size()-1;
if(k < len) {
frep(j, 1, k) {
if(m < sum[j]) m = sum[j];
}
}
else if(sum[len] < 0) {
frep(j, 1, len) {
if(m < sum[j]) m = sum[j];
}
}
else {
frep(j, 0, k%len) {
if(m < sum[j]) m = sum[j];
}
ll a = sum[len]*(k/len) + m;
frep(j, 0, len) {
if(m < sum[j]) m = sum[j];
}
ll b = sum[len]*(k/len-1) + m;
if(a < b) m = b;
else m = a;
}
if(ans < m) ans = m;
}
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n;
ll d, a;
cin>>n>>d>>a;
vector<pair<ll, ll> > v(n);
rep(i, n){
ll x, h;
cin>>x>>h;
v[i] = make_pair(x, h);
}
sort(v.begin(), v.end());
queue<pair<ll, ll> > que;
ll ans = 0;
ll tot = 0;
rep(i, n){
ll x = v[i].first;
ll h = v[i].second;
while(!que.empty() && que.front().first<x){
tot -= que.front().second;
que.pop();
}
h -= tot;
if(h>0){
ll num = (h+a-1)/a;
ans += num;
ll damage = num*a;
tot += damage;
que.emplace(x+2*d, damage);
}
}
cout<<ans<<endl;
return 0;
} | 0 | 70,679,545 |
#include<bits/stdc++.h>
#define ll long long int
#define st string
#define con continue
#define br break
#define rt return 0
#define fr first
#define sec second
using namespace std;
int main(){
ll n,m,i,x,j,mx=0,t,k,b=0,a=0,ans=0,c=0;
ll mn;
st s,str; char strn;
cin>>n;
mn=n-1;
ll ara[n+1],bra[n+1],taj[n+1];
for(i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
b++;
ans=((n/i)+i)-2;
mn=min(mn,ans);
}
}
if(!b)cout<<n-1;
else cout<<mn<<endl;
rt;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
int n , m;
cin >> n >> m;
vector <string> v(n);
for (string &s : v)
cin >> s;
sort(v.begin(),v.end());
for (string &s : v)
cout << s;
}
int main(){
In_The_Name_Of_Allah_The_Merciful
#ifndef ONLINE_JUDGE
freopen("SuhaibSawalha1.txt","r",stdin);
#endif
Suhaib_Sawalha();
Alhamdulillah
} | 0 | 67,172,646 |
#include<bits/stdc++.h>
using namespace std;
int x,y;
int main(){
cin>>x>>y;
if(x<y&&x>1){
cout<<"Bob"<<endl;
}
else if(x>y&&y>1){
cout<<"Alice"<<endl;
}
else if(x<y&&x==1){
cout<<"Alice"<<endl;
}
else if(x>y&&y==1){
cout<<"Bob"<<endl;
}
else if(x==y){
cout<<"Draw"<<endl;
}
} | #include <bits/stdc++.h>
#define fi first
#define se second
#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 rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
const ll mod = 1000000007LL;
ll dp[100100][2];
vector<int> G[100100];
vector<int> visit(100100,0);
void dfs(int u, int p){
dp[u][0] = 1;
dp[u][1] = 1;
for(auto v: G[u]){
if(v == p) continue;
dfs(v,u);
dp[u][0] = dp[u][0]*(dp[v][0]+dp[v][1])%mod;
dp[u][1] = dp[u][1]*dp[v][0]%mod;
}
}
int main() {
int n;
cin >> n;
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(0,-1);
cout<<(dp[0][0]+dp[0][1])%mod<<endl;
return 0;
} | 0 | 50,654,285 |
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int a[200005];
int book[200005];
int main()
{
int n,m;
int l,r,t;
scanf("%d %d",&n,&m);
t=m;
memset(book,0,sizeof(book));
while(t--)
{
scanf("%d %d",&l,&r);
for(int i=l;i<=r;i++)
{
book[i]++;
}
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(book[i]==m)
ans++;
}
printf("%d\n",ans);
return 0;
} | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <inttypes.h>
using namespace std;
int main()
{
int32_t N;
scanf("%d", &N);
int32_t t[101];
int32_t T = 0;
for (int32_t i = 0; i < N; i++) {
scanf("%d", &t[i]);
T += t[i];
}
int32_t v[101];
for (int32_t i = 0; i < N; i++) {
scanf("%d", &v[i]);
}
double max_v[40001];
int32_t max_v_index = 0;
for (int32_t i = 0; i < N; i++) {
for (int32_t j = 0; j < 2 * t[i]; j++) {
if (i > 0 && j == 0)
max_v[max_v_index++] = min(v[i - 1], v[i]);
else
max_v[max_v_index++] = v[i];
}
}
max_v[0] = 0;
max_v[2 * T] = 0;
for (int32_t i = 1; i < 2 * T + 1; i++)
max_v[i] = min(max_v[i], max_v[i - 1] + 0.5);
for (int32_t i = 2 * T - 1; i >= 0 ; i--)
max_v[i] = min(max_v[i], max_v[i + 1] + 0.5);
double res = 0;
for (int32_t i = 0; i < 2 * T; i++) {
res += min(max_v[i], max_v[i + 1]) * 0.5;
if (max_v[i] != max_v[i + 1])
res += 0.5 * 0.5 / 2;
}
printf("%.17f\n", res);
return 0;
} | 0 | 20,989,582 |
#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;
stack<int> sta;
int main(void)
{
int a;
while(scanf("%d", &a)!=EOF){
if(a)
sta.push(a);
else{
cout<<sta.top()<<endl;
sta.pop();
}
}
return 0;
} | #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(ll i=0;i<(ll)n;++i)
#define rep2(i,n) for(ll i=0;i<(ll)n;++i)
#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)
#define rep4(i,a,b,c) for(int i=(ll)a;i<(ll)b;i+=(ll)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()){cerr << a[i];cerr << (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 0;
ll res = 1;
n %= MOD;
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;}
ll __lcm(ll a,ll b){
return a / __gcd(a,b) * b;
}
int main(){
myset();
ll N,K;
cin >> N >> K;
vector<ll> vec(N);
rep(i,N)cin >> vec[i];
ll ans = 0;
ll M = min(N,K);
rep(i,M + 1){
ll push = K - i;
rep(j,i + 1){
vector<ll> cho;
ll R = i - j;
rep(k,j)cho.emplace_back(vec[k]);
for(int k = N - 1;k >= N - R;k--){
cho.emplace_back(vec[k]);
}
sort(all(cho));
ll cnt = 0;
ll neg = 0;
for(ll x : cho){
if(x < 0){
if(neg < push){
neg++;
}
else{
cnt += x;
}
}
else{
cnt += x;
}
}
chmax(ans,cnt);
}
}
cout << ans << "\n";
} | 0 | 34,239,147 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll x[1005], y[1005];
int main() {
scanf("%d", &n);
bool flag;
for (int i = 1; i <= n; ++i) {
scanf("%lld%lld", x + i, y + i);
x[i] += y[i];
if (i == 1) flag = !(x[i] % 2);
else if (x[i] % 2 == flag) return puts("-1"), 0;
y[i] = x[i] - 2 * y[i];
}
printf("%d\n", 31 + flag);
for (int i = 0; i <= 30; ++i)
printf("%d ", 1 << i);
if (flag) printf("1");
puts("");
for (int i = 1; i <= n; ++i) {
if (flag) ++x[i], ++y[i];
x[i] += (1ll << 31) - 1 - flag, y[i] += (1ll << 31) - 1 - flag;
for (int j = 0; j <= 30; ++j) {
static char s[2][2] = {{'L', 'D'}, {'U', 'R'}};
putchar(s[x[i] >> j + 1 & 1][y[i] >> j + 1 & 1]);
}
if (flag) putchar('R');
puts("");
}
} | #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;
class UnionFind
{
private:
::std::vector<int> par;
::std::vector<int> rank;
public:
UnionFind(int n):par(n), rank(n){
for(int i=0; i<n; i++){
par[i] = i;
rank[i] = 0;
}
}
int root(int x){
if (par[x]==x) return x;
return par[x] = root(par[x]);
}
bool same(int x, int y){
return root(x)==root(y);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if (rx==ry) return;
if (rank[rx]>rank[ry]){
par[ry] = rx;
}else{
par[rx] = ry;
if (rx==ry) rank[ry]++;
}
}
};
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m; cin>>n>>m;
UnionFind uf(n);
vi p(n);
rep(i,n) cin>>p[i];
rep(i,m){
int x,y; cin>>x>>y; x--; y--;
uf.unite(x,y);
}
int ans=0;
rep(i,n){
if (uf.same(i,p[i]-1)) ans++;
}
cout<<ans<<endl;
return 0;
} | 0 | 52,756,579 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = (s); i <= (int)(n); i++)
int a[200010];
int b[200010];
int main() {
long long n;
long long x,m;
long long ans;
long long p,p_max,p_round;
long long ansm;
long long mm,mn;
cin >> n >> x >> m ;
rep(i, m) b[i]=-1;
p=x;
rep(i, m){
b[p]=i;
p=p*p;
p%=m;
if (b[p]>=0){
p_max=i+1;
p_round=i+1-b[p];
break;
}
}
if (n<2*p_max){
p=x;
ans=0;
rep(i, n){
ans+=p;
p=p*p;
p%=m;
}
cout << ans << endl;
return 0;
}
ansm=0;
rep(i,p_round){
ansm+=p;
p=p*p;
p%=m;
}
mm=n-2*p_max;
mm/=p_round;
mn=n-mm*p_round;
ans=mm*ansm;
p=x;
rep(i,mn){
ans+=p;
p=p*p;
p%=m;
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template<typename T> inline string toString(const T &a){
ostringstream oss;
oss << a;
return oss.str();
};
int main(){
int N;
cin >> N;
vector<double> l(N+2),r(N+2),v(N+2);
l[0] = 0.0;
r[0] = 0.0;
v[0] = 0.0;
double T_sum = 0;
for(int i=1; i<=N; i++){
int T;
cin >> T;
l[i] = T_sum;
T_sum += T;
r[i] = T_sum;
}
for(int i=1; i<=N; i++){
cin >> v[i];
}
cerr << T_sum << endl;
l[N+1] = T_sum;
r[N+1] = T_sum;
v[N+1] = 0.0;
double ans = 0.0;
double v_pre = 0.0;
for(double a=0.50; a<=T_sum; a+=0.50){
double v_now = INF;
for(int i=0; i<=N+1; i++){
if(a < l[i]){
chmin(v_now, v[i]+(l[i]-a));
}else if(r[i] < a){
chmin(v_now, v[i]+(a-r[i]));
}else{
chmin(v_now, v[i]);
}
}
ans += 0.2500*(v_pre + v_now);
v_pre = v_now;
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
} | 0 | 76,705,228 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
ll m, a, r, c, h;
int main(void)
{
ll n, ans;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ans = a[0];
REP(i,1,n){
ans = __gcd(ans,a[i]);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=998244353;
const ll INF=1000000010;
const ll LINF=1000000000000000010;
int dx[8]={0,0,1,1,1,-1,-1,-1};
int dy[8]={1,-1,1,-1,0,1,-1,0};
int main(){
ll s=1;
int keta=0;
char c;
bool f=false;
for(int i=1;i<=11;i++){
cout<<"? "<<s<<endl;
cin>>c;
keta=i-1;
if(c=='N'){
f=true;
break;
}
s*=10;
}
if(!f){
s=1;
for(int i=1;i<10;i++){
cout<<"? "<<s+1<<endl;
cin>>c;
if(c=='Y'){
cout<<"! "<<s<<endl;
return 0;
}
s*=10;
}
}
int now=1;
s=0;
while(1){
if(now==keta){
int en=0;
if(keta==1){
en=1;
}
for(int i=9;i>=en;i--){
cout<<"? "<<(s+i)*10<<endl;
cin>>c;
if(c=='N'){
cout<<"! "<<s+i+1<<endl;
return 0;
}
}
cout<<"! "<<s+en<<endl;
return 0;
}else{
int ok=0,ng=10;
while(ng-ok>1){
int mid=(ng+ok)/2;
cout<<"? "<<s+mid<<endl;
cin>>c;
if(c=='Y'){
ok=mid;
}else{
ng=mid;
}
}
s+=ok;
}
now++;
s*=10;
}
} | 0 | 34,479,198 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
int main(){
int n,k,r,s,p;
string t;
cin >> n >> k;
cin >> r >> s >> p;
cin >>t;
long long int sum = 0;
vector<bool> win(n,true);
bool pre = false;
for(int i=0;i<n;i++){
if(win[i]){
if(t[i]=='r'){
sum += p;
}
if(t[i]=='s'){
sum += r;
}
if(t[i]=='p'){
sum += s;
}
if(i+k<n && t[i]==t[i+k]){
win[i+k]=false;
}
}
}
cout << sum << endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
#include <functional>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
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;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>;
const ll INF = 1001001001001001001;
const double pi = acos(-1);
int main()
{
int n, k;
cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2)
{
cout << -1 << endl;
return 0;
}
cout << (n - 1) * n / 2 - k << endl;
for (int i = 2; i <= n; i++)
{
cout << 1 << " " << i << endl;
}
int cnt = 0;
for (int i = 2; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
if (cnt >= (n - 1) * (n - 2) / 2 - k)
{
return 0;
}
cnt++;
cout << i << " " << j << endl;
}
}
return 0;
} | 0 | 17,378,999 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
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;
}
signed main() {
init();
vll a(3);
rep(i, 3) {
cin >> a[i];
}
SORT(a);
ll ans = 0;
rep(i, 3) {
if (i == 0) continue;
ans += a[i] - a[i - 1];
}
COUT(ans);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
const long long MOD = 1000000007;
long long factorial(long long n) {
long long ret = 1;
for (long long i = 2; i <= n; ++i) {
ret *= i;
ret %= MOD;
}
return ret;
}
long long modPow(long long n, long long p) {
if (p == 0) {
return 1;
}
else if (p % 2 == 0) {
long long x = modPow(n, p / 2);
return x * x % MOD;
}
else {
long long x = modPow(n, p / 2);
return ((x * x % MOD) * n) % MOD;
}
}
void Main() {
long long X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return;
}
long long generation = (X + Y) / 3;
if (!(generation <= X && X <= 2 * generation && generation <= Y && Y <= 2 * generation)) {
cout << 0 << endl;
return;
}
long long fgen = factorial(generation);
long long fXmgen = factorial(X - generation);
long long f2genmX = factorial(2 * generation - X);
long long ans = fgen * modPow(fXmgen, MOD - 2);
ans %= MOD;
ans *= modPow(f2genmX, MOD - 2);
ans %= MOD;
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | 0 | 67,802,038 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s; bool finish=false;
for(int i='a'; i<'z'; i++){
for(int j=0; j<s.size(); j++){
if(s[j]==i) break;
if(j==s.size()-1){
finish=true;
s.push_back(i);
}
}
if(finish) break;
}
string t=s;
if(finish==false){
if(s=="zyxwvutsrqponmlkjihgfedcba") s="-1";
else{
next_permutation(s.begin(), s.end());
for(int i=0; i<s.size(); i++){
if(s[i]!=t[i]) s.erase(s.begin()+i+1, s.end());
}
}
}
cout<<s<<endl;
} | #include <random>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <stack>
using namespace std;
typedef long long ll;
int main() {
vector<int> X, Y;
int N, K;
cin >> N >> K;
vector<pair<int, int> > P;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
X.push_back(x);
Y.push_back(y);
P.emplace_back(x, y);
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
long long ans = 7e18;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
for (int k = 0; k < N; k++) {
for (int l = k + 1; l < N; l++) {
int cnt = 0;
for (int m = 0; m < N; m++) {
cnt += X[i] <= P[m].first && P[m].first <= X[j] &&
Y[k] <= P[m].second && P[m].second <= Y[l];
}
if (cnt >= K) {
ans = min(ans, 1ll * (X[j] - X[i]) * (Y[l] - Y[k]));
}
}
}
}
}
cout << ans << endl;
} | 0 | 11,554,464 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n,k;cin>>n>>k;
long long ans=0;
const int MOD=1000000007;
for(long long i=k;i<=n+1;i++){
long long low=(i+1)*i/2;
long long tmp=n-i+1;
long long high=(n+2)*(n+1)/2 -(tmp+1)*tmp/2;
ans+=high-low+1;
ans%=MOD;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll INF =ll(1e18)+5;
ll H,W;
vector<std::string> s;
bool onBoard(int y,int x){
if(y>=0 && y<H && x>=0 && x<W){
return true;
}
return false;
}
void solve(){
priority_queue<pair<ll,P>,vector<pair<ll,P>>,greater<pair<ll,P>>> q;
ll d[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
d[i][j] =INF;
}
}
int dy[] = {0,1};
int dx[] = {1,0};
q.push(make_pair(0,P(0,0)));
d[0][0] =0;
while(!q.empty()){
P p = q.top().second;
ll di = q.top().first;
q.pop();
if(di>d[p.first][p.second]){
continue;
}
for(int i=0;i<2;i++){
ll ny = p.first + dy[i];
ll nx = p.second + dx[i];
if(!onBoard(ny,nx)){
continue;
}
if(s[p.first][p.second] == '.' && s[ny][nx] != s[p.first][p.second]){
if(d[ny][nx] > d[p.first][p.second]+1){
d[ny][nx] = d[p.first][p.second]+1;
q.push(make_pair(d[ny][nx],P(ny,nx)));
}
continue;
}else{
if(d[ny][nx] > d[p.first][p.second]){
d[ny][nx] = d[p.first][p.second];
q.push(make_pair(d[ny][nx],P(ny,nx)));
}
}
}
}
ll ans = d[H-1][W-1];
if(s[0][0] == '#'){
ans ++;
}
cout << ans << endl;
}
int main(){
scanf("%lld",&H);
scanf("%lld",&W);
s.resize(W);
for(int i = 0 ; i < W ; i++){
std::cin >> s[i];
}
solve();
return 0;
} | 0 | 32,018,014 |
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
typedef long long int ll;
int main()
{
int n;
string s;
cin >>n >>s;
int ans=0;
for(char i='0';i <= '9';i++)
{
for(char k='0';k<='9';k++)
{
for(char j='0';j<='9';j++)
{
queue<char> q;
q.push(i);
q.push(j);
q.push(k);
for(int l=0;l<s.size();l++)
{
if(q.front()==s[l])
{
q.pop();
}
if(q.size()==0)
{
ans++;
break;
}
}
}
}
}
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int y,m,d;
cin>>y>>m>>d;
int sum=0;
if(y%3==0){
sum=201-(m-1)*20-d;
}else{
for(int i=m+1;i<=10;i++){
sum+=19+i%2;
}
sum+=20-d+m%2;
}
for(int i=y+1;i<1000;i++){
if(i%3==0){
sum+=200;
}else{
sum+=195;
}
}
cout<<sum<<endl;
}
} | 0 | 20,501,745 |
#include <iostream>
using namespace std;
int DIVISOR(int num1, int num2, int num3) {
int TIMES = 0;
for (int i = num1; i <= num2; i++) {
if (num3 % i == 0) {
TIMES++;
}
}
return TIMES;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << DIVISOR(a, b, c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const string JpyStr = "JPY";
const int BtcJpyRate = 380000;
int main()
{
int n;
cin >> n;
double sum = 0;
for (int i = 0; i < n; ++i)
{
double input;
cin >> input;
string unit;
cin >> unit;
sum += (unit == JpyStr ? input : input * BtcJpyRate);
}
cout << setprecision(12) << fixed;
cout << sum << endl;
} | 0 | 73,230,467 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N,M;
string S;
cin >> N>>M;
ll P[M],Y[M],P_tmp[M],Y_tmp[M];
REP(i, M)
cin >> P[i] >> Y[i];
REP(i,M){
P_tmp[i] = P[i];
Y_tmp[i] = Y[i];
}
vector<tuple<ll,ll, ll>> t(M);
REP(i,M)t.at(i) = make_tuple(P[i], Y[i],i);
sort(t.begin(), t.end());
vector<ll> num(M);
ll count = 1;
REP(i, M-1)
{
if (get<0>(t.at(i)) == get<0> (t.at(i + 1)))
{
num.at(i) = count;
count++;
}
else{
num.at(i) = count;
count = 1;
}
}
num.at(M-1) = count;
vector<tuple<ll, ll, ll, ll>> t1(M);
REP(i,M){
t1.at(i) = make_tuple(get<2>(t.at(i)), get<0>(t.at(i)), get<1>(t.at(i)), num.at(i));
}
sort(t1.begin(), t1.end());
REP(i,M){
printf("%06d", get<1>(t1.at(i)));
printf("%06d\n", get<3>( t1.at(i)));
}
} | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
int main(){
int n,m;
cin >> n >> m;
vector<vector<pp>> e(n+1,vector<pp>(0));
vector<int> b(n+1,-inf);
rep(i,m){
int f,g,h;
cin >> f >> g >> h;
e[f].push_back(mk(g,h));
e[g].push_back(mk(f,-h));
}
for(int k=1;k<=n;k++){
if (b[k]!=-inf) continue;
queue<int> q;
q.push(k);
b[k]=0;
while(!q.empty()){
int f=q.front();
q.pop();
rep(i,e[f].size()){
int u=e[f][i].first,y=e[f][i].second;
if (b[u]==-inf){
b[u]=b[f]+y;
q.push(u);
}
else{
if (b[u]!=b[f]+y){
cout << "No" << endl;
return 0;
}
}
}
}
}
cout << "Yes" << endl;
} | 0 | 7,829,406 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) {
cin >> s[i];
}
VV cx(h, V(w, -1));
VV cy(h, V(w, -1));
rep(i, h) {
int cnt = 0;
int pos = 0;
rep(j, w) {
if (s[i][j] == '.') cnt++;
if (s[i][j] == '#' || j == w - 1) {
if (j == w - 1) j++;
REP(k, pos, j) {
if (s[i][k] == '#') continue;
cx[i][k] = cnt;
}
cnt = 0;
pos = j;
}
}
}
rep(i, w) {
int cnt = 0;
int pos = 0;
rep(j, h) {
if (s[j][i] == '.') cnt++;
if (s[j][i] == '#' || j == h - 1) {
if (j == h - 1) j++;
REP(k, pos, j) {
if (s[k][i] == '#') continue;
cy[k][i] = cnt;
}
cnt = 0;
pos = j;
}
}
}
int ans = -1;
rep(i, h) rep(j, w) {
chmax(ans, cx[i][j] + cy[i][j] - 1);
}
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main() {
string S;
string T;
do {
cin >> S;
cin >> T;
} while (S.length() - T.length() < 0 && S.length() >=1000 && T.length() >= 1000);
int min_num = 10001;
for (int i = 0; i < S.length() - T.length()+1; i++) {
int count_num = 0;
for (int j = 0; j < T.length(); j++) {
if (S[i + j] != T[j]) {
count_num++;
}
}
if (count_num < min_num) {
min_num = count_num;
}
}
cout << min_num;
return 0;
} | 0 | 71,182,029 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a/gcd(a, b) * b;
}
vector<bool> seen;
ll ans;
ll N, M;
void dfs(const Graph &G, int v, int counter) {
if(counter == N-1){
ans++;
}
else{
for (auto next_v : G[v]) {
if (seen[next_v]) continue;
seen[v] = true;
dfs(G, next_v, counter+1);
seen[v] = false;
}
}
}
int main()
{
cout << fixed << setprecision(15);
cin >> N >> M;
Graph G(N);
seen.assign(N, false);
REP(i, M){
ll a, b;
cin >> a >> b;
G[a-1].push_back(b-1);
G[b-1].push_back(a-1);
}
ans = 0;
dfs(G, 0, 0);
cout << ans << endl;
return 0;
} | #include<algorithm>
#include<cassert>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<iomanip>
#include<map>
#include<numeric>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<stack>
#include<sstream>
#include<complex>
#define pb push back
#define clr clear()
#define sz size()
#define fs first
#define sc second
#define rep(i,a) for(int i=0;i<(int)(a);i++)
#define rrep(i,a) for(int i=(int)(a)−1;i>=0;i−−)
#define all(a) (a).begin(),(a).end()
#define EQ(a,b) (abs((a)−(b)) < EPS)
#define INIT(a) memset(a,0,sizeof(a))
using namespace std;
typedef double D;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
const D EPS = 1e-8;
const int INF = 1e8;
const D PI = acos(-1);
int v;
int n;
int a,b,c;
int d[20][20];
void WarshallFloyd(void){ rep(k,v)rep(i,v)rep(j,v)d[i][j] = min(d[i][j],d[i][k]+d[k][j]); }
int main(){
while(cin >> n,n){
rep(i,20){
rep(j,20)d[i][j] = INF;
d[i][i] = 0;
}
v = 0;
rep(i,n){
cin >> a >> b >> c;
v = max(v,max(a,b));
d[a][b] = d[b][a] = c;
}
v++;
WarshallFloyd();
int res = -1, dis = INF;
rep(i,v){
int tmp = 0;
rep(j,v)tmp += d[i][j];
if(dis > tmp){
dis = tmp; res = i;
}
}
cout << res << " " << dis << endl;
}
} | 0 | 96,206,563 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
double n; cin >> n;
double k; cin >> k;
double ans = 0;
for(ll i = 1; i <= n; ++i){
ll cnt = 0, tmp = i;
while(tmp < k){
tmp *= 2;
cnt++;
}
ans += (double(1) / double(n)) * double(pow((double(1)/ double(2)), double(cnt)));
}
cout << setprecision(12) << ans;
cout << fixed;
return 0;
} | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define bit(n) (1LL<<(n))
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b, const ll mod=MOD) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b, const ll mod=MOD) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b, const ll mod=MOD) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b, const ll mod=MOD) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n; ll m; cin >> n >> m;
vll a(n); for(auto& e : a) cin >> e, e %= m;
vll sum(n+1);
ll res = 0LL;
map<ll, int> hist;
hist[0]++;
rep(i, n){
sum[i+1] = ADD(sum[i], a[i], m);
res += hist[sum[i+1]];
hist[sum[i+1]]++;
}
cout << res << endl;
return 0;
} | 0 | 36,367,955 |
Subsets and Splits