code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
signed main(){
int n, k;
cin >> n >> k;
priority_queue<int> q;
rep(i,n){
int l; cin >> l;
q.push(l);
}
int ans = 0;
while(k--){
ans += q.top();
q.pop();
}
cout << ans << endl;
} | #include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
void dfs(vector<vector<pair<int,ll>>> &graph,
int now, int past,ll sum, vector<ll> &dist){
dist[now]=sum;
for(auto next:graph[now]){
if(next.first==past)continue;
dfs(graph, next.first, now, sum+next.second, dist);
}
}
int main(){
int n;
cin >> n;
vector<vector<pair<int,ll>>> graph(n);
vector<ll> dist(n);
rep(i, 0, n-1){
int a, b;
ll c;
cin >> a >> b >> c;
a--, b--;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int q, k;
cin >> q >> k;
k--;
dfs(graph, k, -1, 0, dist);
vector<ll>ans(q);
rep(i, 0, q){
int x, y;
cin >> x >> y;
ans[i] = dist[x-1]+dist[y-1];
}
rep(i, 0, q)cout<< ans[i] << endl;
return 0;
} | 0 | 70,601,734 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
bool chk=false;
int A;
cin >> A;
vector<int> B(1000000);
B.at(0)=A;
int count=0;
for(int i=1; i<10000001; i++)
{
if(A%2==0)
{
A=A/2;
B.at(i)=A;
count++;
}
else
{
A=3*A+1;
B.at(i)=A;
count++;
}
for(int j=0; j<i; ++j)
{
if(B.at(i)==B.at(j))
{
chk=true;
}
}
if(chk)
{
break;
}
}
cout << count+1 <<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n-1);
rep(i, n-1) cin >> b[i];
a[0] = b[0];
for(int i = 1; i < n; i++){
if(i == n-1){
a[i] = b[i-1];
break;
}
a[i] = min(b[i-1], b[i]);
}
int ans = 0;
rep(i, n) ans += a[i];
cout << ans << endl;
} | 0 | 28,323,601 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n, k;
int ans = 0, r = 0;
cin >> n >> k;
for(int i = 0; i < n; i++){
if(pow(2,i) > k){
ans += k;
r++;
}
}
cout << ans + pow(2,n-r) << endl;
} | #include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000000000000000
#define ll long long
#define mm(arr) memset(arr, 1, sizeof(arr))
#define scanArray(a,n) for(ll i = 0; i < n; i++){cin >> a[i];}
using namespace std;
int main(){
FAST
int n,h; cin >> n >> h;
int a[n];
int cnt;
scanArray(a,n);
for(int i=0; i<n; i++){
if(a[i]>=h){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 0 | 45,546,635 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
for (int i = 0; i < 3; i++) cin >> V.at(i);
sort(V.rbegin(), V.rend());
if (V.at(0) == V.at(1) && V.at(1) == V.at(2)) return cout << 0 << "\n", 0;
int ans = 0;
int tmp = V.at(0) - V.at(1);
ans += tmp;
V.at(2) += tmp;
tmp = V.at(0) - V.at(2);
if (tmp % 2 == 0) cout << ans + tmp / 2 << "\n";
else cout << ans + tmp / 2 + 2 << "\n";
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int pre=0, cnt=0, res=0;
rep(i, n){
int h;
cin >> h;
if(pre>=h){
cnt++;
}else{
res = max(res, cnt);
cnt = 0;
}
pre = h;
}
res = max(res, cnt);
cout << res << endl;
return 0;
} | 0 | 13,658,066 |
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
int main(){
q a,b;
cin>>a>>b;
cout<<a-b+1;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vb = vector<bool>;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T> void pr(const complex<T>& x) { cout << x; }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void print() { pr("\n"); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); print(ts...);
}
}
using namespace output;
ll N, L, T;
vll solve(vll pos, vb dir) {
ll s = 0;
while (s < N && !dir[s]) ++s;
if (s == N) {
vll ans (N);
F0R(i, N) {
ans[i] = ((pos[i] - T) % L + L) % L;
}
return ans;
}
ll opp = 0;
F0R(i, N) if (!dir[i]) ++opp;
ll bumps = opp * ((2 * T) / L);
F0R(i, N) if (!dir[i]) {
ll dist = 0;
if (pos[i] < pos[s])
dist = L - pos[s] + pos[i];
else
dist = pos[i] - pos[s];
if (dist < ((2 * T) % L)) bumps++;
}
vll ans (N);
vll spots (N);
F0R(i, N) {
ll npos;
if (dir[i])
npos = (pos[i] + T) % L;
else
npos = (((pos[i] - T) % L) + L) % L;
spots[i] = npos;
}
sort(spots.begin(), spots.end());
int i = 0;
while (spots[i] != (pos[s] + T) % L) ++i;
F0R(j, N) ans[(s + bumps + j) % N] = spots[(i + j) % N];
return ans;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N >> L >> T;
vll pos (N);
vb dir (N);
F0R(i, N) {
ll x, d; cin >> x >> d;
pos[i] = x;
dir[i] = (d == 1);
}
vll ans = solve(pos, dir);
for (ll x : ans) print(x);
} | 0 | 95,601,506 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int mx4[] = {0,1,0,-1};
int my4[] = {1,0,-1,0};
int INF = 2e6;
ll MOD = 1e9 + 7;
int main(){
string s,t; cin >> s >> t;
s += s;
int n = s.size(),N = t.size();
for(int i = 0;i < n;i++){
if(s[i] == t[0]){
bool ok = true; int k = 0;
for(int j = i;j < i + N;j++){
if(s[j] == t[k]) {
k++;
continue;
}
ok = false;
}if(ok) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
string s;cin>>s;
ll k;cin>>k;
ll pos=0;
for(ll i=0;i<int(s.size());++i){
if(s[i]!='1'){
pos=i;break;
}
}
if(k>=pos+1){
cout<<s[pos];
}
else{
cout<<1;
}
} | 0 | 48,098,567 |
#include<iostream>
#include<queue>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
priority_queue<int>L;
priority_queue<int,vector<int>,greater<int>>R;
for (size_t i = 0; i < M; i++)
{
int l,r;
cin>>l>>r;
L.push(l);
R.push(r);
}
int ans=0;
for (size_t i = 1; i < N+1; i++)
{
if(i>=L.top()&&i<=R.top())
{
++ans;
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
while (T--) MAIN();
} | 0 | 93,854,223 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = false;
int K = (S.size() - T.size());
for (int i = 0; i <= K; i++) {
vector<char> B(F);
for (int j = 0; j < F; j++) {
if (S.at(j) == '?') {
B.at(j) = 'a';
}
else {
B.at(j) = S.at(j);
}
}
int k = 0;
bool good = true;
for (int j = i; j < i + D; j++) {
if (S.at(j) == '?') {
B.at(j) = T.at(k);
}
else if (S.at(j) != T.at(k)) {
good = false;
break;
}
else {
B.at(j) = S.at(j);
}
k++;
}
if (good) {
ok = true;
if (ans > B) {
for (int j = 0; j < F; j++) {
ans.at(j) = B.at(j);
}
}
}
}
if (ok) {
for (int j = 0; j < F; j++) {
cout << ans.at(j);
}
cout << endl;
}
else {
cout << "UNRESTORABLE" << endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout<<"\n";
long long prime[1000000];
void sieve()
{
prime[0]=0;
prime[1]=0;
for(int i=2;i<1000000;i++)
prime[i]=1;
for(int i=2;i*i<1000000;i++)
if(prime[i]==1)
for(int j=i*i;j<1000000;j+=i)
prime[j]=0;
}
bool isPrime(int n)
{
if (n <= 1)
return false;
for (ll i = 2; i <= floor(sqrt(n)); i++)
if (n % i == 0)
return false;
return true;
}
int factorial(int n)
{
int f=1;
for(int i = 1;i<=n ; i++)
f = (f*i)%mod;
return f;
}
int gcd(int a, int b)
{
return !b ? a : gcd(b, a % b);
}
int lcm(int a, int b)
{
return (a / gcd(a, b)) * b;
}
int fastExponentiation(int n, int x, int modulo)
{
int res = 1;
while(x > 0)
{
if(x & 1)
res = (res*n) % modulo;
x = x >> 1;
n = (n * n) % modulo;
}
return res;
}
int power(int n , int p )
{
if(p==0)
return 1;
int res = power((n*n)%mod,p/2);
if(p%2==1)
res = (n*res)%mod;
return res;
}
bool isPowerOfTwo(int n)
{
return n && (!(n&(n-1)));
}
bool isSet(int n,int i)
{
return n & (1 << i);
}
bool valid_coordinate(ll x,ll y,ll n,ll m)
{
if(x<0 || y<0)
return false;
else if(x>=n || y>=m)
return false;
else
return true;
}
int sod(int n)
{
int sum=0;
while(n)
{
sum+=(n%10);
n/=10;
}
return sum;
}
void solve()
{
int a,b,count=0;
cin>>a>>b;
for(int i=1;i<a;i++){
for(int j=i+1;j<=a;j++)
count++;
}
for(int i=1;i<b;i++){
for(int j=i+1;j<=b;j++)
count++;
}
cout<<count<<endl;
}
int32_t main()
{
solve();
return 0;
} | 0 | 98,196,808 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
string A,B;
cin >> A >> B;
if(A.size()>B.size()){
cout << "GREATER" <<endl;
}else if(A.size()<B.size()){
cout <<"LESS"<<endl;
}else{
if((int)A[0] > (int)B[0]){
cout << "GREATER" <<endl;
}else if((int)A[0] < (int)B[0]){
cout << "LESS" <<endl;
}else{
cout << "EQUAL" <<endl;
}
}
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#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; }
template<typename T>
vector<T> table(int n, T v) { return vector<T>(n, v); }
template <class... Args>
auto table(int n, Args... args) {
auto val = table(args...);
return vector<decltype(val)>(n, move(val));
}
const ll INF = 1e16;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 200005;
string grid[100];
string w = "",bl = "";
int now = 0;
bool flag = 1;
void make(int a,int b){
if (flag && a == 1){
int c;
if (b%50 == 0) c = b/50;
else c = b/50+1;
rep(i,3*c){
grid[i+now] = w;
}
rep(i,c){
rep(j,50){
if (b == 0) break;
grid[now+3*i+1][2*j] = '#';
b--;
}
}
now += 3*c;
cout << now << " " << 100 << '\n';
rep(i,now){
PRINT(grid[i]);
}
}
else if (b == 1){
int c;
if (a%50 == 0) c = a/50;
else c = a/50+1;
rep(i,3*c){
grid[i+now] = bl;
}
rep(i,c){
rep(j,50){
if (a == 0) break;
grid[now+3*i+1][2*j] = '.';
a--;
}
}
now += 3*c;
cout << now << " " << 100 << '\n';
rep(i,now){
PRINT(grid[i]);
}
}
else{
if (flag){
rep(i,3){
grid[i+now] = w;
}
a--;
rep(i,50){
if (b == 1){
break;
}
grid[now+1][i*2] = '#';
b--;
}
now += 3;
flag = 0;
make(a,b);
}
else{
rep(i,3){
grid[i+now] = bl;
}
b--;
rep(i,50){
if (a == 1){
break;
}
grid[now+1][i*2] = '.';
a--;
}
now += 3;
flag = 1;
make(a,b);
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
rep(i,100){
w += '.';
bl += '#';
}
make(a,b);
} | 0 | 29,161,007 |
#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, k;
cin>>n>>k;
vector<int> v(n);
rep(i, n) cin>>v[i];
vector<int> imo(n+1);
rep(j, min(k, (int)log2(n)+100)){
imo = vector<int>(n+1);
rep(i, n){
imo[max(0, i-v[i])]++;
imo[min(i+(v[i]+1), n)]--;
}
int bef = 0;
rep(i, n){
bef+=imo[i];
v[i] = bef;
}
}
rep(i, n) cout<<v[i]<<" ";
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int H, W; cin >> H >> W;
vector<string> s(H);
rep(i, H) cin >> s[i];
rep(i, H) rep(j, W) {
if(s[i][j] == '#') {
bool t = false;
if((i>0&&s[i-1][j]=='#') || (j>0&&s[i][j-1]=='#') || (i<H-1&&s[i+1][j]=='#') || (j<W-1&&s[i][j+1]=='#'))
t = true;
if(!t) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | 0 | 59,741,886 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd __gcd
#define append push_back
#define str to_string
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define sswap(a,b) {a=a^b;b=a^b;a=a^b;}
#define swap(a,b) {auto temp=a; a=b; b=temp;}
#define init(dp) memset(dp,-1,sizeof(dp));
#define set0(dp) memset(dp,0,sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i,n) for(ll i=0;i<n;i++)
typedef long long int ll;
#define int ll
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf= INT_MAX;
constexpr int MAXSIZE = int(1e6)+5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 100006;
void fastio(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll mod_pow(ll a,ll b,ll p){
ll res=1;
a%=p;
while(b>0){
if(b&1==1) res=((res%p)*(a%p))%p;
a=(a%p*a%p)%p;
b>>=1;
}
return res;
}
int32_t main(){
fastio();
int n , p;
cin >> n >> p;
string s;
cin >> s;
int ans = 0;
if( p == 2 || p == 5){
for(int i = 0; i < n; i++){
if((s[i]-'0')%p == 0) ans += (i + 1);
}
cout << ans;
return 0;
}
int sum = 0;
map<int,int>f;
reverse(all(s));
f[0] = 1;
for(int i = 0; i < n; i++){
sum = (s[i] - '0') * mod_pow(10,i,p) + sum;
sum %= p;
f[sum]++;
}
for(auto i:f){
int k = i.ss;
ans += (k * ( k - 1)) /2;
}
cout << ans;
} | #include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
int main(int argc, char const* argv[])
{
int n;
cin >> n;
int k;
for(int i = 1; i < 1000; i++){
if(2 * n == i * (i + 1)){
k = i;
break;
}else if(2 * n < i * (i + 1)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << k + 1 << endl;
vector<vector<int> > vec;
vec.resize(k + 1);
int fin = 1;
for(int i = 0; i < k; i++){
for(int j = 0; j < k - i; j++){
vec[i].pb(fin + j);
}
for(int j = 0; j < k - i; j++){
vec[j + i + 1].pb(fin + j);
}
fin = fin + k - i;
}
for(int i = 0; i < k + 1; i++){
cout << k << " ";
for(int j = 0; j < k; j++){
cout << vec[i][j];
if(j != k - 1)cout << " ";
}
cout << endl;
}
return 0;
} | 0 | 96,730,247 |
#include<bits/stdc++.h>
using namespace std;
int main (){
int x,a,b;
cin>>a>>b>>x;
if( a<= x ){
if(a+b>=x)cout<<"YES";
else cout<<"NO";
}
else cout<<"NO";
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector<int> G[102];
int d[102];
int main()
{
int n,u,k,v;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> u >> k;
for(int j = 0; j < k; ++j){
cin >> v;
G[u].push_back(v);
}
}
fill(d,d + n + 1, -1);
queue<int> que;
que.push(1);
d[1] = 0;
while(!que.empty()){
int p = que.front(); que.pop();
for(vector<int>::iterator it = G[p].begin(); it != G[p].end(); ++it){
if(d[*it] == -1){
d[*it] = d[p] + 1;
que.push(*it);
}
}
}
for(int i = 1; i <= n; ++i){
cout << i << ' ' << d[i] << endl;
}
} | 0 | 10,647,454 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
int memo[2][2001][2001][2] = {};
int dfs(VI &a, VI &b, int &n, int x, int y, int t, bool bo=true) {
if (memo[t][x][y][bo] > -1) return memo[t][x][y][bo];
if (x == n || y == n) return memo[t][x][y][bo] = abs(a[x] - b[y]);
if (t == 0) {
if (!bo) return memo[t][x][y][bo] = dfs(a,b,n,max(x,y)+1,y,0);
return memo[t][x][y][bo] = max(dfs(a,b,n,max(x,y)+1,y,0), dfs(a,b,n,x,max(x,y)+1,1));
} else {
if (!bo) return memo[t][x][y][bo] = dfs(a,b,n,max(x,y)+1,y,1);
return memo[t][x][y][bo] = min(dfs(a,b,n,max(x,y)+1,y,0), dfs(a,b,n,x,max(x,y)+1,1));
}
}
void solve() {
int n,z,w;
cin >> n >> z >> w;
VI a(n+1), b(n+1);
int in;
a[0] = z; b[0] = w;
REP(i,0,n) {
cin >> in;
a[i+1] = b[i+1] = in;
}
REP(i,0,2) REP(j,0,n+1) REP(k,0,n+1) REP(l,0,2) memo[i][j][k][l] = -1;
cout << dfs(a,b,n,0,0,0,false) << endl;
}
int main() {
solve();
return 0;
} | #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() {
ll x, y;
cin >> x >> y;
if (x % y == 0) {
cout << -1 << endl;
} else {
vector<ll> cand = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
for(auto val: cand) {
if ((x*val) % y != 0) {
cout << (x*val) << endl;
return 0;
}
}
return 0;
}
return 0;
} | 0 | 39,853,961 |
#include <bits/stdc++.h>
using namespace std;
std::vector<int> v;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ans = B-A;
if(ans%2==0){
cout << "Alice";
}else{
cout<<"Borys";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
ll c= 0, mx= 0, n;
cin>> n;
ll h[n];
cin>> h[0];
for(int i=1; i<n; i++ )
{
cin>> h[i];
if(h[i]> h[i-1])
{
if(mx< c)
mx= c;
c= 0;
}
else
c++;
}
cout << (c> mx? c: mx);
nl;
return 0;
} | 0 | 55,109,402 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)x.size()
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }
ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }
int dx[] = { 0, 0, +1, -1, -1 +1, -1, +1 };
int dy[] = { +1, -1, 0, 0, -1, +1, +1, -1 };
const int mx = 1e5+123;
int lev[mx];
vi adj[mx];
int par[mx];
void bfs ( int s )
{
mem ( lev, -1 );
queue<int> q;
q.push ( s );
while ( !q.empty() ) {
int u = q.front();
q.pop();
for ( auto v : adj[u] ) {
if ( lev[v] == -1 ) {
lev[v] = lev[u] + 1;
par[v] = u;
q.push( v );
}
}
}
}
int main()
{
optimize();
int n, m;
cin >> n >> m;
for ( int i = 1; i <= m; i++ ) {
int u, v;
cin >> u >> v;
adj[u].PB ( v );
adj[v].PB ( u );
}
bfs ( 1 );
for ( int i = 2; i <= n; i++ ) {
if ( lev[i] == -1 ) return cout << "No", 0;
}
cout << "Yes\n";
for ( int i = 2; i <= n; i++ ) cout << par[i] << endl;
return 0;
} | #include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int main() {
int64_t N, sum = 0;
cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
sum += A[i];
}
int64_t oneMove = N * (N + 1) / 2;
if (sum % oneMove) {
puts("NO");
return 0;
}
int64_t k = sum / oneMove, cnt = 0;
rep(i, N) {
int d = A[(i+1)%N] - A[i] - k;
if (d % N) {
puts("NO");
return 0;
}
cnt += abs(d / N);
}
puts(cnt == k ? "YES" : "NO");
} | 0 | 98,460,499 |
#include <iostream>
#include <utility>
#include <string>
using namespace std;
struct Card{char suit; int value;};
void bubbleSort(struct Card C[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(C[j].value<C[j-1].value) swap(C[j],C[j-1]);
}
}
}
void selectionSort(struct Card C[],int n){
for(int i=0;i<n;i++){
int minj=i;
for(int j=i;j<n;j++){
if(C[j].value<C[minj].value) minj=j;
}
swap(C[i],C[minj]);
}
}
int main(){
int n; cin >> n;
struct Card C[n],D[n];
for(int i=0;i<n;i++){
string str;
cin >> str;
C[i].suit=str[0];
D[i].suit=str[0];
C[i].value=str[1]-'0';
D[i].value=str[1]-'0';
}
bubbleSort(C,n);
for(int i=0;i<n;i++){
if(i==n-1) cout << C[i].suit << C[i].value << endl;
else cout << C[i].suit << C[i].value << " ";
}
cout << "Stable" << endl;
selectionSort(D,n);
for(int i=0;i<n;i++){
if(i==n-1) cout << D[i].suit << D[i].value << endl;
else cout << D[i].suit << D[i].value << " ";
}
bool isStable=true;
for(int i=0;i<n;i++){
if(C[i].suit != D[i].suit){
isStable=false;
break;
}
}
if(isStable) cout << "Stable" << endl;
else cout << "Not stable" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
#define dump(x) cerr<<#x<<": "<<x<<endl;
#define bit(k) (1LL<<(k))
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << "{" <<p.first << ", " << p.second << "}";
return os;
}
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; }
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = (ll)1e9+7;
const double PI = acos(-1.0);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N, A, B;
cin >> N >> A >> B;
if((B-A)&1){
cout << "Borys" << endl;
}
else{
cout << "Alice" << endl;
}
} | 0 | 68,926,549 |
#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>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#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; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
vector<vector<int>> ans;
void rec (ll m, ll mstart, ll k, ll kstart) {
eprintf("%lld %lld %lld %lld\n", m, mstart, k, kstart);
if (m <= 0) return;
rep (i, m) {
ans[kstart].push_back(mstart + i);
ans[kstart + i + 1].push_back(mstart + i);
}
rec(m - 1, mstart + m, k - 1, kstart + 1);
}
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n; cin >> n;
ll ng = 0, ok = n;
while (ok - ng > 1) {
ll med = (ok + ng) / 2;
if (med * (med + 1) / 2 >= n) ok = med;
else ng = med;
}
if (ok * (ok + 1) / 2 != n) {
cout << "No\n"; return 0;
}
ll m = ok, k = ok + 1;
ans.resize(k);
rec(m, 1, k, 0);
cout << "Yes\n" << k << "\n";
rep (i, k) {
cout << m << " ";
rep (j, ans[i].size()) cout << ans[i][j] << " \n"[j + 1 == j_len];
}
return 0;
} | #include <iostream>
using namespace std;
bool check( char c )
{
char C[5+4+2+1] = "yuiophjklnm";
for ( int i = 0; i < 5+4+2+1; i++ ) {
if ( c == C[i] ) return true;
}
return false;
}
int main( void )
{
string input;
while ( cin >> input && input != "#" ) {
int answer = 0;
bool flag = check( input[0] );
for ( string ::iterator it = input.begin(); it != input.end(); it++ ) {
if ( flag != check( *it ) ) {
answer++;
}
flag = check( *it );
}
cout << answer << endl;
}
return 0;
} | 0 | 27,907,382 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
int a,c;
cin >> n;
for (int i = 1;; ++i) {
if (n <= i*(i + 1) / 2) {
a = i;
break;
}
}
c = a*(a + 1) / 2 - n;
for (int i = 1; i <= a; ++i) {
if (i !=c) {
cout << i << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int n, d, x; cin >> n >> d >> x;
int choco = x;
for (int i = 0; i < n; i++) {
int a; cin >> a;
int j = 0;
while (j * a + 1 <= d) {
choco++;
j++;
}
}
cout << choco << endl;
return 0;
} | 0 | 414,363 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,l,r) for (ll i = (ll)l; i < (ll)(r); i++)
const ll mod = 998244353;
ll N;
vector<ll> D;
int main(){
cin >> N;
map<int,int> m;
D.assign(N,0);
rep(i,0,N){
cin >> D[i];
m[D[i]]++;
}
if(D[0]!=0 || m[0]>1){
cout << 0 << endl;
return 0;
}
int cnt = 0;
ll ans = 1;
ll pre = 1;
ll pre_d = -1;
for(auto &e : m){
cnt++;
if(pre_d+1 != e.first){
cout << 0 << endl;
return 0;
}
if(cnt<=2){
pre_d = e.first;
pre = e.second;
continue;
}
rep(i,0,e.second){
ans *= pre;
ans %= mod;
}
pre_d = e.first;
pre = e.second;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
char neighbor(char me, char other, char answer) {
if (answer == 'o') {
if (me == 'S') {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
} else {
if (other == 'S') {
return 'W';
} else {
return 'S';
}
}
} else {
if (me == 'S') {
if (other == 'S') {
return 'W';
} else {
return 'S';
}
} else {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
}
}
}
int main() {
int n;
string s;
cin >> n >> s;
char st[4][2]{{'S', 'S'}, {'S', 'W'}, {'W', 'S'}, {'W', 'W'}};
for (int i = 0; i < 4; i++) {
char t[n]{st[i][0], st[i][1]};
char last = neighbor(t[0], t[1], s[0]);
for (int j = 1; j < n - 1; j++) {
t[j+1] = neighbor(t[j], t[j-1], s[j]);
}
if (last == t[n-1] && t[0] == neighbor(t[n-1], t[n-2], s[n-1])) {
for (int k = 0; k < n; k++) {
cout << t[k];
}
cout << endl;
return 0;
}
}
cout << -1 << endl;
} | 0 | 69,986,526 |
#include<iostream>
#include<string>
using namespace std;
class dice{
public:
int d[6];
void rolls(string str){
for(int i = 0; str[i] != '\0'; i++)
roll(str[i]);
}
void roll(char in){
int direc[4][6]={
{1,5,2,3,0,4},
{3,1,0,5,4,2},
{4,0,2,3,5,1},
{2,1,5,0,4,3}
};
int news;
int temp_d[6];
if(in =='N')news = 0;
if(in =='E')news = 1;
if(in =='S')news = 2;
if(in =='W')news = 3;
for(int i = 0;i < 6;i++)
temp_d[i] = d[direc[news][i]];
for(int i = 0;i < 6;i++)
d[i] = temp_d[i];
}
void print(void){
for(int i = 0;i < 6; i++){
cout << d[i];
if(i==6-1)cout << endl;
else cout << " ";
}
}
};
int main(){
dice d1;
int q;
string str;
int ue, mae;
int index;
for(int i = 0;i < 6; i++)
cin >> d1.d[i];
cin >> q;
for(int t = 0; t < q; t++){
cin >> ue >> mae;
for(int i = 0;i < 6; i++){
if(d1.d[i] == ue)index = i;
}
char cmd[6][4]={"", "N", "W", "E", "S", "SS"};
d1.rolls(cmd[index]);
for(int i = 0;i < 6; i++){
if(d1.d[i] == mae)index = i;
}
char cmd2[6][5]={"", "", "ENW", "NES", "ESSW", ""};
d1.rolls(cmd2[index]);
cout << d1.d[2] << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
int k;
cin >> k;
int n = s.size();
vector<vector<ll>> dp1(n+1,vector<ll>(k+1)), dp2(n+1,vector<ll>(k+1));
dp1.at(0).at(0) = 1;
rep(i,n) {
int d = s.at(i) - '0';
if(d==0){
rep(j,k+1){
dp1.at(i+1).at(j) = dp1.at(i).at(j);
}
} else {
rep(j,k+1){
dp2.at(i+1).at(j) += dp1.at(i).at(j);
}
rep(j,k){
dp1.at(i+1).at(j+1) = dp1.at(i).at(j);
dp2.at(i+1).at(j+1) += dp1.at(i).at(j) * (d-1);
}
}
rep(j,k+1){
dp2.at(i+1).at(j) += dp2.at(i).at(j);
}
rep(j,k){
dp2.at(i+1).at(j+1) += dp2.at(i).at(j) * 9;
}
}
ll ans = dp1.at(n).at(k) + dp2.at(n).at(k);
cout << ans << endl;
return 0;
} | 0 | 36,710,720 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
using namespace std;
long long H,W,N;
bool in_area(long long x, long long y){
return x >=1 && y >= 1 && x+2 <= H && y+2 <= W;
}
int main(){
while(cin >> H >> W >> N){
vector< pair<long long,long long> > v(N+10);
vector< pair<long long,long long> > s;
set < pair<long long,long long> > S;
long long ans[10] = {0};
for(int i=0;i<N;i++){
int a, b;
cin >> a >> b;
v[i] = make_pair(a,b);
}
for(int i=0;i<v.size();i++){
for(int k=0;k<3;k++){
for(int l=0;l<3;l++){
if(in_area(v[i].first-k,v[i].second-l)){
s.push_back(make_pair(v[i].first-k,v[i].second-l));
S.insert(make_pair(v[i].first-k,v[i].second-l));
}
}
}
}
if(s.size()!=0){
sort(s.begin(),s.end());
long long j = 0, count = 1;
while(j<=s.size()-2){
if(s[j] == s[j+1]){
count++;
j++;
}else{
ans[count]++;
count = 1;
j++;
}
}
ans[count]++;
}
ans[0] = (H-2)*(W-2) - S.size();
for(int i=0;i<10;i++){
cout << ans[i] << endl;
}
}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long long num_order(long long X){
long long ans=0;
while(true){
if(X==0){
break;
}
else{
X/=10;
ans++;
}
}
return ans;
}
int main() {
long long L,R;
cin>>L>>R;
long long ans=2018;
if(R-L>=2019){
ans=0;
}
else{
for(long long i=L;i<R;i++){
for(long long j=i+1;j<=R;j++){
ans=min(ans,((i%2019)*(j%2019))%2019);
}
}
}
cout<<ans<<endl;
} | 0 | 43,706,007 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int LCS(string X, string Y) {
int m, n;
m = X.size();
n = Y.size();
int c[m + 1][n + 1];
for (int i = 0; i <= m; ++i) {
c[i][0] = 0;
}
for (int i = 0; i <= n; ++i) {
c[0][i] = 0;
}
X = ' ' + X;
Y = ' ' + Y;
int maxl = 0;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
if (X[i] == Y[j]) {
c[i][j] = c[i - 1][j - 1] + 1;
} else {
c[i][j] = max(c[i - 1][j], c[i][j - 1]);
}
maxl = max(maxl, c[i][j]);
}
}
return maxl;
}
int main() {
int q;
scanf("%d", &q);
for (int i = 0; i < q; ++i) {
string X, Y;
cin >> X >> Y;
cout << LCS(X, Y) << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int m[51], f[51], r[51];
int total;
int i = 0;
while (cin >> m[i] >> f[i] >> r[i], m[i] + f[i] + r[i] != -3) { i++; }
i = 0;
while (1)
{
if (m[i] == -1 && f[i] == -1 && r[i] == -1) break;
total = m[i] + f[i];
if (m[i] == -1 || f[i] == -1)
{
cout << "F" << endl;
}
else if (total < 30)
{
cout << "F" << endl;
}
else if (30 <= total && total < 50)
{
if (50 <= r[i])
{
cout << "C" << endl;
}
else
{
cout << "D" << endl;
}
}
else if (50 <= total && total < 65)
{
cout << "C" << endl;
}
else if (65 <= total && total < 80)
{
cout << "B" << endl;
}
else
{
cout << "A" << endl;
}
i++;
}
return 0;
} | 0 | 42,586,244 |
#include <bits/stdc++.h>
using namespace std;
int main() {unsigned long long int Q,H,S,D,N;
cin >> Q >> H >> S >> D >>N;
unsigned long long int ans;
if(8*Q<=4*H && 8*Q<=2*S && 8*Q <=D)
{ans=4*Q*N;}
else if (4*H<=2*S && 4*H<=D)
{ans=2*H*N;}
else if (2*S<=D)
{ans=S*N;}
else{
if(N%2==0)
{ans=N*D/2;}
else {
if(8*Q<=4*H && 8*Q<=2*S)
{ans = (N-1)/2*D + 4*Q;}
else if(4*H<=2*S)
{ans = (N-1)/2*D + 2*H;}
else
{ans = (N-1)/2*D + S;}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX
#define MIN_I INT_MIN
#define MAX_UI UINT_MAX
#define MAX_LL LLONG_MAX
#define MIN_LL LLONG_MIN
#define MAX_ULL ULLONG_MAX
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef pair<ll,ll> PLL;
typedef pair<char,int> PCI;
typedef pair<int,char> PIC;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<ll,char> PLC;
typedef pair<char,ll> PCL;
typedef pair<double,double> PDD;
inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}
const double MAX_V = 100.5;
int main(void){
SPEEDUP
cout << setprecision(15);
int N;cin >> N;
vector<double> t(N);
vector<double> t_(N+1);
vector<double> v(N);
rep(i,N) cin >> t[i];
rep(i,N) cin >> v[i];
t_[0] = 0.0;
rep(i,N) t_[i+1] = t_[i]+t[i];
double T = t_[N];
double time = 0.0;
vector<double> w((int)T*2+1);
while(time <= T){
double v_ = MAX_V;
v_ = min(v_,time);
v_ = min(v_,T-time);
rep(i,N){
if(time <= t_[i]) v_ = min(v_, v[i] + t_[i] - time);
else if(time <=t_[i+1]) v_ = min(v_, v[i]);
else v_ = min(v_, v[i] + time -t_[i+1]);
}
int index = (int)2*time;
w[index] = v_;
time+=0.5;
}
double ans = 0.0;
rep(i,w.size()-1) ans += 0.25*(w[i]+w[i+1]);
cout << ans << endl;
return 0;
} | 0 | 89,827,258 |
#include<iostream>
#include<vector>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int getRoot(int x) {
if (r[x] < 0) return x;
return r[x] = getRoot(r[x]);
}
bool belongTo(int x, int y) {
int rx = getRoot(x);
int ry = getRoot(y);
return rx == ry;
}
void unite(int x, int y) {
int rx = getRoot(x);
int ry = getRoot(y);
if (rx == ry) return;
r[rx] += r[ry];
r[ry] = rx;
}
int size(int x) {
return -r[getRoot(x)];
}
};
int main() {
int N,M,x,y,i,ans=0;
cin>>N>>M;
UnionFind UF(N);
vector<int> p(N);
for (i=0;i<N;i++) cin>>p[i];
for (i=0;i<M;i++) {
cin>>x>>y;
UF.unite(x-1, y-1);
}
for (i=0;i<N;i++) {
if (p[i]-1 == i || UF.belongTo(i,p[i]-1)) ans++;
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
vector<int> A(100,0);
for(int i=2;i<=N;i++){
int j=i;
for(int k=2;k<=j/k;k++)
for(;j%k==0;j/=k)
A[k]++;
if(j!=1)
A[j]++;
}
vector<int> B(0);
for(int i=0;i<50;i++)
if(A[i])
B.push_back(A[i]);
int M=B.size(),ans=0;
for(int i=0;i<M;i++){
if(B[i]>=74)
ans++;
for(int j=0;j<M;j++){
if(i==j)continue;
if(B[i]>=24 && B[j]>=2)
ans++;
if(B[i]>=14 && B[j]>=4)
ans++;
if(i>=j)
continue;
for(int k=0;k<M;k++)
if(i!=k && j!=k && B[i]>=4 && B[j]>=4 && B[k]>=2)
ans++;
}
}
cout<<ans<<endl;
} | 0 | 51,146,319 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};
#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;
int main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int width, height, n;
while(true){
cin >> width >> height;
if(width == 0 && height == 0){
break;
}
cin >> n;
vector<PII> bad(n);
VVI table(height, VI(width));
REP(i, n){
int x, y;
cin >> x >> y;
x--;
y = height - y;
table[y][x] = -1;
}
table[height - 1][0] = 1;
int value;
for(int y = height -1; y >= 0; --y){
REP(x, width){
if(table[y][x] == -1) continue;
if(x > 0){
value = table[y][x -1];
table[y][x] += value > -1 ? value : 0;
}
if(y < height - 1){
value = table[y + 1][x];
table[y][x] += value > -1 ? value : 0;
}
}
}
cout << table[0][width -1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<int> alpha(26,51);
for (int i = 0; i < n; i++) {
vector<int> tmp(26);
for (char c : s[i]) {
tmp[c - '0' - 49]++;
}
for(int j = 0; j < 26; j++) {
alpha[j] = min(tmp[j], alpha[j]);
}
}
for (int i = 0; i < 26; i++) {
for(int j = 0; j < alpha[i]; j++){
char r = (i + 49) + '0';
cout << r;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 52,132,227 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<int> A(N); unordered_map<int, int> mp;
REP(i, 0, N) {
cin >> A[i]; mp[A[i]] = i;
}
sort(ALL(A));
int ans = 0;
REP(i, 0, N) {
if ((i % 2 == 0) != (mp[A[i]] % 2 == 0)) ans++;
}
cout << ans / 2 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int64_t>> c(n,vector<int64_t>(8));
int64_t b=0;
for(int i=0;i<n;i++){
vector<int64_t> xyz(3);
cin>>xyz.at(0)>>xyz.at(1)>>xyz.at(2);
b+=abs(xyz.at(0))+abs(xyz.at(1))+abs(xyz.at(2));
for(int j=0;j<8;j++){
int k=j;
int64_t s=0;
for(int d=0;d<3;d++){
s+=xyz.at(d)*(k%2==0?1:-1);
k/=2;
}
c.at(i).at(j)=s;
}
}
int64_t a=0;
for(int x=0;x<8;x++){
vector<vector<int64_t>> p(n+1,vector<int64_t>(m+1,-b));
for(int i=0;i<=n;i++)
p[i][0]=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m&&j<=i;j++)
p[i][j]=max(p[i-1][j],p[i-1][j-1]+c.at(i-1).at(x));
a=max(a,p[n][m]);
}
cout<<a<<endl;
} | 0 | 26,934,688 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(int argc, char **argv)
{
int V, E;
cin >> V >> E;
vector<vector<int>> A(V);
vector<int> B(V);
for (int i = 0; i < E; i++) {
int s, t;
cin >> s >> t;
A[s].push_back(t);
B[t]++;
}
vector<bool> U(V);
vector<int> L;
queue<int> S;
for (int i = 0; i < V; i++) {
if (B[i] || U[i])
continue;
S.push(i);
U[i] = true;
while (!S.empty()) {
auto c = S.front();
S.pop();
L.push_back(c);
for (auto a: A[c]) {
if (--B[a] == 0 && !U[a]) {
S.push(a);
U[a] = true;
}
}
}
}
for (auto l: L)
cout << l << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define int ll
void f(int n,int m){
vector<P> v(n);
int sum=0;
rep(i,n){
int a,b;
cin>>a>>b;
v.push_back(P(b,a));
sum+=a*b;
}
sort(all(v));
reverse(all(v));
rep(i,n){
sum-=v[i].F*min(v[i].S,m);
m-=v[i].S;
if(m<0) break;
}
cout<<sum<<endl;
}
signed main(){
int n,m;
while(1){
cin>>n>>m;
if(!n) break;
f(n,m);
}
} | 0 | 26,284,205 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int N;
vector<int> h;
queue<P> que;
void nextPair(int l, int r) {
int nl = l;
for (int nr = nl; nr <= r; ++nr) {
if (h.at(nr) == 0) {
if (nr != nl) {
que.push(make_pair(nl, nr - 1));
}
nl = nr + 1;
}
}
if (nl <= r) {
que.push(make_pair(nl, r));
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
h.resize(N);
for (auto &x : h) cin >> x;
int ans = 0;
nextPair(0, N - 1);
while (!que.empty()) {
auto p = que.front();
que.pop();
int l = p.first, r = p.second;
int minh = INT_MAX;
for (int i = l; i <= r; ++i) {
minh = min(minh, h.at(i));
}
ans += minh;
for (int i = l; i <= r; ++i) {
h.at(i) -= minh;
}
nextPair(l, r);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int n,m;
cin >> n >> m;
string a[n],b[m];
rep(i,n) cin >> a[i];
rep(i,m) cin >> b[i];
bool next = false;
rep(i,n-m+1){
rep(j,n-m+1){
next = false;
rep(v,m){
rep(u,m){
if(a[i+v][j+u] != b[v][u]) next = true;
if(next) break;
}
if(next) break;
}
if(!next){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | 0 | 72,711,444 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector <pair<int, int >> pair(n);
rep(i,n){
cin>>pair[i].first>>pair[i].second;
}
sort(pair.begin(), pair.end());
ll sum=0;
priority_queue<int> salary;
int j=0;
for(int i=1; i<m+1; i++){
for( j; pair[j].first<=i; j++){
salary.push(pair[j].second);
}
if(salary.empty()) continue;
else{
sum+=salary.top();
salary.pop();
}
}
cout<<sum;
} | #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*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N, K;
cin >> N >> K;
vector<vector<ll> > s(N);
for (ll i = 0; i < N; ++i) {
ll t, d;
cin >> t >> d;
t--;
s[t].push_back(d);
}
for (auto &v : s) {
sort(v.begin(), v.end(), greater<ll>());
if (v.empty()) v.push_back(-INF);
}
sort(s.begin(), s.end(), [&](vector<long long> a, vector<long long> b) {
return a[0] > b[0];});
ll cur = 0;
priority_queue<ll> que;
for (ll i = 0; i < K; ++i) {
cur += s[i][0];
for (int j = 1; j < s[i].size(); ++j) que.push(s[i][j]);
}
for (int i = K; i < N; ++i){
for (int j = 0; j < s[i].size(); ++j){
que.push(s[i][j]);
}
}
ll res = cur + K*K;
for (ll x = K-1; x >= 1; --x) {
ll v = s[x][0];
ll w = que.top();
if (v < w) {
que.pop(); cur += w;
que.push(v); cur -= v;
}
res = max(res, cur + x*x);
}
cout << res << endl;
return 0;
} | 0 | 88,360,090 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1LL << 60;
#define PI 3.14159265359
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
int gcd(int a, int b){
if(b == 0) return a;
else return gcd(b, a%b);
}
long long lcm (int a, int b){
return (long long) a*b /gcd(a,b);
}
int main(){
int N;
cin>> N;
int A[N+1], B[N];
rep(i,N+1)cin >> A[i];
rep(i,N)cin >> B[i];
long long ans = 0;
rep(i,N){
if(B[i] >= A[i]){
B[i] = B[i]-A[i];
if(B[i] >= A[i+1]){
ans += A[i]+ A[i+1];
A[i+1] = 0;
}else{
A[i+1]-= B[i];
ans += A[i]+B[i];
}
}else{
ans += B[i];
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define INF 1000000000
#define MOD 1000000007
#define MAXN 1000005
using namespace std;
char matrix[1002][1002];
ll dp[1002][1002];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests=1,t=1;
while(tests--)
{
ll i,j,h,w;
cin>>h>>w;
rep(i,1,h)
{
rep(j,1,w)
cin>>matrix[i][j];
}
dp[h][w]=1;
for(i=h;i>=1;i--)
{
for(j=w;j>=1;j--)
{
if(matrix[i][j]=='#') continue;
dp[i][j]+=dp[i+1][j]+dp[i][j+1];
dp[i][j]%=MOD;
}
}
cout<<dp[1][1];
}
return 0;
} | 0 | 2,774,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << endl;
else cout << "Alice" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define rep_one(i,n) FOR(i,1,n+1)
#define rrep(i,n) for(int i=n-1;i<=0;--i)
#define loop while(true)
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
typedef long long ll;
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
const ll MAX = 10000000;
const ll MIN = 0;
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; }
using pl = pair<ll, ll>;
using ps = pair<int, string>;
int main() {
ll N; sl(N);
ll ans = 0;
rep_one(i,N) {
ll c = N/i;
ans += c*i*(c+1)/2;
}
cout << ans << endl;
return 0;
} | 0 | 99,955,661 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
long n, a[100010];
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int idx = 0;
vector<pair<int, int>> ans;
while(a[idx] < 0) idx++;
if(idx == 0) {
for(int i = 1; i < n-1; ++i) {
ans.emplace_back(a[0], a[i]);
a[0] -= a[i];
}
ans.emplace_back(a[n-1], a[0]);
a[n-1] -= a[0];
} else if(idx == n) {
for(int i = 0; i < n-1; ++i) {
ans.emplace_back(a[n-1], a[i]);
a[n-1] -= a[i];
}
} else {
for(int i = idx; i < n-1; ++i) {
ans.emplace_back(a[0], a[i]);
a[0] -= a[i];
}
for(int i = 0; i < idx; ++i) {
ans.emplace_back(a[n-1], a[i]);
a[n-1] -= a[i];
}
}
cout << a[n-1] << endl;
for(auto p : ans) cout << p.first << " " << p.second << endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e18
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define MAX 1000
#define ll long long
#define P pair<int,int>
#define cout_set(n) cout << setprecision(10) << (n) << endl;
const double PI=3.14159265358979323846;
using namespace std;
const int mod = 1000000007;
int vy[4] ={1,-1,0,0}, vx[4] = {0,0,-1,1};
int correct(string s,string t){
int c=1;
rep(i,t.length()){
if(s[i] != t[i]){
if(s[i] != '?'){
c = -1;
break;
}
}
}
return c;
}
signed main(){
string s,t; cin >> s >> t;
int start=-1;
for(int i=0;i<s.length()-t.length()+1;i++){
if(correct( s.substr(i,t.length()), t) == 1){
start = i;
}
}
if(start == -1) {
cout << "UNRESTORABLE" << endl;
return 0;
}
string ans = s;
ans.replace(start,t.length(),t);
rep(i,ans.length())
if(ans[i] == '?') ans.replace(i,1,"a");
cout << ans << endl;
return 0;
} | 0 | 33,965,400 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
int R;cin>>R;
if(R<1200){
cout<<"ABC"<<endl;
}else if(R<2800){
cout<<"ARC"<<endl;
}else{
cout<<"AGC"<<endl;
}
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define pb push_back
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const int MOD = 1e9 + 7;
const ll ZER = 0;
int main(){
ll n, x, m;
cin >> n >> x >> m;
Graph G(m);
ll tmp = x;
ll cnt = 0;
vector<ll> v;
while(1){
G[x].push_back(x * x % m);
if(G[x].size() == 2)break;
cnt++;
v.pb(x);
x = x * x % m;
}
ll c = 0, l;
x = tmp;
while(1){
if(G[x].size() == 2)break;
c++;
x = x * x % m;
}
l = cnt - c;
ll res = 0;
x = tmp;
if(n <= cnt){
rep(i, n)res += v[i];
}
else {
rep(i, cnt)res += v[i];
n -= cnt;
REP(i, c, cnt - 1){
res += (v[i] * (n / l));
}
n %= l;
rep(i, n)res += v[c + i];
}
cout << res << endl;
} | 0 | 72,807,228 |
#include <bits/stdc++.h>
using namespace std;
long long dp[90];
int main()
{
char X, Y;
cin >> X >> Y;
if (X < Y)
cout << "<" << endl;
else if (X == Y)
cout << "=" << endl;
else
cout << '>' << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int A, B, C, D;
A = s.at(0) - '0';
B = s.at(1) - '0';
C = s.at(2) - '0';
D = s.at(3) - '0';
for (int tmp; tmp < (1 << 3); tmp++){
bitset<3> bit(tmp);
int sum = A;
char op1 = '-';
char op2 = '-';
char op3 = '-';
if(bit.test(0)){
sum += B;
op1 = '+';
}
else sum -= B;
if(bit.test(1)){
sum += C;
op2 = '+';
}
else sum -= C;
if(bit.test(2)){
sum += D;
op3 = '+';
}
else sum -= D;
if (sum == 7){
cout << A << op1 << B << op2 << C << op3 << D << "=7" << endl;
return 0;
}
}
} | 0 | 82,034,384 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#define din cin
#else
stringstream dummy;
#define dout dummy.str(""); dummy.clear(stringstream::goodbit); dummy
#endif
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif
#define disp(A) dout << #A << " = " << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef unsigned long long ll;
const int INF = 999;
int main() {
int n; din>>n;
int s, g, numOfAdjacent;
int adjacent[101];
bool adjacencyMatrix[101][101] = {0};
rep(i,0,n) {
din>>s>>numOfAdjacent;
rep(j,0,numOfAdjacent) {
din>>g;
adjacencyMatrix[s][g]=1;
}
}
rep(i,1,n+1) {
rep(j,1,n+1) {
dout<<(j==1?"":" ")<<adjacencyMatrix[i][j];
}
dout<<endl;
}
#ifdef INPUTFILE
inputfile.close();
#endif
#ifdef OUTPUTFILE
outputfile.close();
cout << "\"" << OutputFilePath << "\"" << endl;
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1);
int sum = 0;
for(int i=1; i<=n; i++){
cin >> a[i];
sum+=a[i];
}
vector<int> b(n+1);
for(int i=1; i<=n; i++){
for(int j=1; j<=i; j++){
b[i]+=a[j];
}
}
int ans = 2e9;
for(int i=1; i<n; i++){
ans = min(ans,abs(b[i]-(sum-b[i])));
}
cout << ans << endl;
return 0;
} | 0 | 46,776,054 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int main() {
int n;
cin >> n;
int ans = n / 2 - (n % 2 == 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> levelup(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N,M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> ks(M,vector<int>(N,0));
vector<int> p(M);
for(int i=0;i<M;i++){
cin >> k[i];
for(int j=0;j<k[i];j++){
cin >> ks[i][j];
}
}
for(int i=0;i<M;i++){
cin >> p[i];
}
int inde = 1;
for(int i=0;i<N;i++){
inde *= 2;
}
vector<int> vec(N,0);
int countans=0;
int count = 0;
for(int i=0;i<inde;i++){
for(int j=0;j<M;j++){
int countt=0;
for(int l=0;l<k[j];l++){
if(vec[ks[j][l]-1]==1){
countt++;
}
}
if(countt%2==p[j]){
count++;
}
}
if(count==M){
countans++;
}
if(i==inde-1){
break;
}
count = 0;
vec = levelup(vec,N);
}
cout << countans << endl;
} | 0 | 64,964,494 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Br cout<<endl
#define int long long
#define fe first
#define se second
#define double long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define PT(x) cout << (x) << endl
#define last(x) prev(x.end())
#define PTT(x) cout << (#x) << " is " << (x) << endl
#define lets_go ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int M = 1e9 + 7;
const int N = 2e5 + 10;
const int IM = 1e15 + 37;
const double PI = 3.1415926535897932384;
inline void PP(int n) { cout << n << " ";}
void PV(vi v) { for (int i = 0 ; i < v.size() ; i++) cout << v[i] << " " ; cout << endl;}
void PVV(vii v) {for (int i = 0 ; i < v.size() ; i++) cout << v[i].first << " " << v[i].second << endl;}
void PA(int v[], int n, int x = 0) { for (int i = x ; i < n + x; i++)cout << v[i] << ' ' ; cout << endl;}
void IN(int a[], int n, int x = 0) {for (int i = x; i < n + x; i++)cin >> a[i];}
inline void op() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
lets_go
int n, k;
cin >> n >> k;
int h[n + 10] = {0};
IN(h, n, 1);
int dp[n] = {0};
for (int i = 2; i <= n; i++) {
int j = i - 1, u = k;
dp[i] = IM;
while (j >= 1 && u--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
j--;
}
}
int ans = dp[n];
PT(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
vector<long long> P(N + 1, 0);
for (long long i = 1; i <= N; i++)
{
long long p;
cin >> p;
P[p] = i;
}
multiset<long long> s;
s.insert(0);
s.insert(0);
s.insert(N + 1);
s.insert(N + 1);
long long ans = 0;
long long n1, n2, m1, m2;
for (long long i = N; i > 0; i--)
{
s.insert(P[i]);
auto itr = s.find(P[i]);
n1 = P[i];
n1 += -*--itr - 1;
n2 = *itr;
n2 += -*--itr - 1;
itr = s.find(P[i]);
m1 = -P[i];
m1 += *++itr - 1;
m2 = -*itr;
m2 += *++itr - 1;
long long count = 0;
count += (n2 + 1) * (m1 + 1) + (m2 + 1) * (n1 + 1);
ans += i * count;
}
cout << ans << endl;
} | 0 | 23,415,032 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll ksm(ll b,ll p)
{
ll ans=1;
while(p>0)
{
if(p%2==1)
ans=(ans*b)%mod;
b=(b*b)%mod;
p/=2;
}
return ans;
}
ll f[500010],anss;
int main()
{
int n,k;
cin>>n>>k;
for(ll i=k;i>=1;i--)
{
ll cnt=k/i;
f[i]=ksm(cnt,n);
for(ll j=2*i;j<=k;j+=i)
{
f[i]=(f[i]+mod-f[j])%mod;
}
}
for(ll i=1;i<=k;i++)
{
anss+=f[i]*i;
anss%=mod;
}
cout<<anss;
} | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
#define debug4(a,b,c,d) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<", "<<#d<<" = "<<(d)<<endl;
using namespace std;
#define mod 1000000007
long long modexpo(long long x, long long p){
int res = 1;x = x%mod;
while(p){
if(p%2)res = res * x;
p >>= 1;
x = x*x % mod;
res %= mod;
}
return res;
}
struct compare{
bool operator() (const pair<int,int> a, const pair<int,int> b) const{
return a.first < b.first;
}
};
int32_t main(){
IOS
int a,b,c,d;
cin >> a >> b >> c >> d;
a--;
int x = a/c;
int y = b/c;
x += a/d;
y += b/d;
int l = c*d;
l /= __gcd(c,d);
int e = a/l;
int f = b/l;
a++;
cout << b-a+1 - ((y-f) - (x - e)) << endl;
} | 0 | 33,662,037 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int n;
vector<int> rec(int i, vector<int> b) {
if (b.size() == n) return b;
b.insert(b.end(), i + 1);
b.insert(b.begin(), i + 2);
return rec(i + 2, b);
}
int main() {
int n, a;
cin >> n;
deque<int> d;
rep(i, n) {
cin >> a;
if (i % 2 == n % 2) {
d.push_back(a);
} else {
d.push_front(a);
}
}
rep(i, n) {
cout << d[i];
if (i != n - 1) cout << ' ';
}
cout << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int A[100010];
rep(i, N) cin >> A[i];
sort(A, A + N, greater<int>());
if(N == 2) {
cout << A[0] - A[1] << endl;
cout << A[0] << " " << A[1] << endl;
return 0;
}
int ans = A[0];
int num1 = -INF, num2 = -INF;
if(A[N - 1] >= 0) {
num1 = A[N - 1];
num2 = A[N - 2];
A[N - 2] = A[N - 1] - A[N - 2];
N--;
}
rep(i, N - 1) {
ans += abs(A[i + 1]);
}
cout << ans << endl;
if(num1 != -INF) {
cout << num1 << " " << num2 << endl;
}
int x = A[0], y = A[N - 1];
rep(i, N - 2) {
if(A[i + 1] > 0) {
cout << y << " " << A[i + 1] << endl;
y -= A[i + 1];
} else {
cout << x << " " << A[i + 1] << endl;
x -= A[i + 1];
}
}
cout << x << " " << y << endl;
return 0;
} | 0 | 4,022,458 |
#include <stdio.h>
typedef long long ll;
int main() {
int k;
scanf("%d", &k);
ll a[100005];
for (int i = 0; i < k; i++) {
scanf("%lld", &a[i]);
}
ll mn = 2;
ll mx = 2;
for (int i = k - 1; i >= 0; i--) {
if (mn % a[i]) {
mn += a[i] - mn % a[i];
}
mx = mx - mx % a[i] + a[i] - 1;
if (mn > mx) {
puts("-1");
return 0;
}
}
printf("%lld %lld", mn, mx);
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; } return false; }
ll INF = 1001001001;
ll LINF = 1001001001001001001ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vl as(n);
cin>>as;
ll l = -1, r = LINF;
while (l + 1 < r) {
ll m = (l + r) / 2;
ll temp = m;
bool f = true;
rep(i, n) {
ll c = (as[i] + m - n + 1) / (n + 1);
if ((as[i] + m - n + 1) % (n + 1)) c++;
if (temp >= c) temp -= c;
else {
f = false;
break;
}
}
if (f) r = m;
else l = m;
}
ll u = max(0ll, r - 100000);
for (ll m = u; m < r; ++m) {
ll temp = m;
bool f = true;
rep(i, n) {
ll d = (as[i] + m - n + 1);
ll c = d / (n + 1);
if (d >= 0 && d % (n + 1)) c++;
c = max(c, 0ll);
if (temp >= c) temp -= c;
else {
f = false;
break;
}
}
if (f) {
cout<<m<<endl;
return 0;
}
}
cout<<r<<endl;
} | 0 | 32,346,213 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, a;
cin >> n >> k;
vector<bool> A(n, false);
for(int i = 0; i < k; i++){
cin >> d;
for(int j = 0; j < d; j++){
cin >> a;
A.at(a - 1) = true;
}
}
int count = 0;
for(int i = 0; i < n; i++){
if(!A.at(i)) count++;
}
cout << count << endl;
} | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;
#define INF (1ll<<60)
int main(int argc, char const *argv[]) {
int n;cin>>n;
vector<long long> a(n);
for(int i=0;i<n;++i)cin>>a[i];
int ll=0,r=n;
while(r>ll+1){
int m = (ll+r)/2;
map<long long, int> ma;
long long l=0;
bool b = true;
if(m==1){
for(int i=0;i<n-1;++i){
if(a[i+1]<=a[i])b=false;
}
}
else{
for(int i=0;i<n;++i){
int aa = a[i];
if(aa<=l){
vector<long long> tmp(0);
for(auto itr=ma.end();itr!=ma.begin();){
itr--;
if((itr->first)>aa)tmp.push_back(itr->first);
else break;
}
for(auto i:tmp)ma.erase(i);
while(aa>1&&ma.find(aa)!=ma.end()&&ma[aa]>=m-1){
ma.erase(aa);
aa--;
}
if(ma.find(aa)!=ma.end()&&ma[aa]>=m-1){
b=false;
break;
}
else{
if(ma.find(aa)!=ma.end())ma[aa]++;
else ma[aa]=1;
}
}
l = a[i];
}
}
if(b)r=m;
else ll=m;
}
cout<<r<<endl;
return 0;
} | 0 | 93,619,261 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int max1,max2;
max1 = max(a[0],a[1]);
max2 = min(a[0],a[1]);
for(int i=2; i<n; i++){
if(max1 < a[i]){
max2 = max1;
max1 = a[i];
}
else if (max1 == a[i]){
max2 = a[i];
}
else if(max1 > a[i] && a[i] > max2){
max2 = a[i];
}
}
int ans;
rep(i,n){
if(a[i] == max1){
ans = max2;
}
else{
ans = max1;
}
cans;
}
return 0;
} | #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 FORR(i, m, n) for(int i = (m);i >= (n);i--)
#define SORT(v, n) std::sort(v, v+n);
#define VSORT(v) std::sort(v.begin(), v.end());
#define VRSORT(v) std::sort(v.rbegin(), v.rend());
#define ll long long
#define pb(a) push_back(a)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
const int INF = 99999999;
const ll LINF = 9999999999999;
typedef pair<ll, ll> LP;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
ll N, M, a[110000] = {};
int main() {
cin >> N >> M;
REP(i, 110000) {
a[i] = INF;
}
REP(i, M) {
ll tmp;
cin >> tmp;
a[tmp] = 0;
}
a[0] = 1;
if (a[1] == INF) a[1] = 1;
FOR(i,2, N+2) {
if (a[i] == INF) {
a[i] = a[i - 1] + a[i - 2];
a[i] = a[i] % 1000000007;
}
}
cout << a[N] << endl;
} | 0 | 5,636,218 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<a[k-1];
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
using P = pair<int,int>;
typedef long long ll;
int main()
{
int n; cin >> n;
string s[n];
rep(i, n)
cin >> s[i];
set<string> st;
char e = s[0].back();
st.insert(s[0]);
rep1(i, n)
{
if (e != s[i].front())
{
cout << "No"; return 0;
}
if (st.count(s[i]))
{
cout << "No"; return 0;
}
e = s[i].back();
st.insert(s[i]);
}
cout << "Yes\n";
return (0);
} | 0 | 82,536,771 |
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string hantei(string line);
int main(void){
string line;
vector<string> result;
while (getline(cin, line)){
if (line == "."){
return 0;
}
cout << hantei(line) << endl;
}
return 0;
}
string hantei(string line){
stack<char> left;
stack<char> right;
for (int i=0; i<line.size(); ++i){
if ((line[i] == '(') || (line[i] == '[')){
left.push(line[i]);
}
if ((line[i] == ')') || (line[i] == ']')){
right.push(line[i]);
}
if (!left.empty()){
if ((left.top() == '(') && (line[i] == ')')){
left.pop();
right.pop();
}
else if ((left.top() == '[') && (line[i] == ']')){
left.pop();
right.pop();
}
}
}
if (left.empty() && right.empty()){
return "yes";
}
else{
return "no";
}
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int i,c=0;
string s,a;
cin>>s>>a;
for(i=0;i<3;i++)
{
if(s[i]==a[i])
c++;
}
cout<<c<<endl;
return 0;
} | 0 | 41,681,272 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 998244353;
int main() {
int count[4] = {};
rep(i, 3) {
int a, b;
cin >> a >> b;
a--;
b--;
count[a]++;
count[b]++;
}
sort(count, count + 4);
if (count[0] == 1 && count[1] == 1 && count[2] == 2 && count[3] == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
vector<string> s;
vector<int> cnt;
string ss,str;
getline(cin,str);
string longest="";
string max;
int maxv=-1;
str+=" ";
for(int i = 0; i < str.size() ; i ++ ){
if(str[i] == ' '){
bool used=true;
for(int j = 0 ; j < s.size() ; j ++){
if(s[j] == ss){
cnt[j]++;
if(maxv<cnt[j]){
longest=ss;
maxv=cnt[j];
}
ss="";
used=false;
}
}
if(used){
s.push_back(ss);
cnt.push_back(1);
/*
if(s.size() == 1){
longest=ss;
max=ss;
maxv=ss.size();
}
if(ss.size()>max.size())max=ss;
ss="";
}
}else{
ss+=str[i];
}
}
cout<<longest<<" ";
cout<<max<<endl;
/*
for(int i = 0 ; i < s.size() ; i ++){
cout<<s[i]<<endl;;
}
cout<<endl;
} | 0 | 70,515,216 |
#include <iostream>
#include <vector>
using namespace std;
void solve()
{
int n, k;
while(cin >> n >> k, n || k)
{
int max = 0;
int sum = 0;
vector<int> Vec(n);
for(int i = 0; i < n; ++i)
{
cin >> Vec[i];
}
for(int i = 0; i < k; ++i)
{
sum += Vec[i];
}
if(max < sum)
{
max = sum;
}
for(int i = 1; i + k - 1 < n; ++i)
{
sum -= Vec[i - 1];
sum += Vec[i + k - 1];
if(max < sum)
{
max = sum;
}
}
cout << max << endl;
}
}
int main()
{
solve();
return(0);
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
const int64_t MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
vector<int> t(n), a(n);
rep(i, n)
{
cin >> t[i];
}
rep(i, n)
{
cin >> a[i];
}
vector<int> ub(n), lb(n);
fill(ub.begin(), ub.end(), numeric_limits<int>::max());
fill(lb.begin(), lb.end(), 1);
rep(i, n)
{
if (i == 0) {
ub[i] = lb[i] = t[i];
} else {
ub[i] = min(ub[i], t[i]);
if (t[i] > t[i - 1]) {
lb[i] = max(lb[i], t[i]);
}
}
}
rrep(i, n)
{
if (i == n - 1) {
ub[i] = min(ub[i], a[i]);
lb[i] = max(lb[i], a[i]);
} else {
ub[i] = min(ub[i], a[i]);
if (a[i] > a[i + 1]) {
lb[i] = max(lb[i], a[i]);
}
}
}
int64_t result = 1;
rep(i, n)
{
int64_t x = max(0, ub[i] - lb[i] + 1);
x %= MOD;
result *= x;
result %= MOD;
}
cout << result << endl;
return 0;
} | 0 | 86,845,960 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
int ans = INF;
REP(i,S.size()-2){
int x = 100*(S[i]-'0') + 10*(S[i+1]-'0') + (S[i+2]-'0');
ans = min(ans, abs(753-x));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n;
cin >> n;
vi a(n+1, 0), t(n+1, 0), mHeight(n, 0);
repf(i, n) cin >> t[i];
rep(i, n) cin >> a[i];
repf(i, n){
if(t[i] == t[i-1]) continue;
mHeight[i-1] = t[i];
if(a[i-1] < t[i]){
cout << 0 << endl;
return 0;
}
}
for(ll i=n-1; i>=0; i--){
if(a[i] == a[i+1]) continue;
if(mHeight[i] == 0){
mHeight[i] = a[i];
if(t[i+1] < a[i]){
cout << 0 << endl;
return 0;
}
}
else if(mHeight[i] != a[i]){
cout << 0 << endl;
return 0;
}
}
ll ans = 1;
rep(i, n){
if(mHeight[i] == 0){
ans *= min(t[i+1], a[i]);
ans %= MODV;
}
}
cout << ans << endl;
} | 0 | 2,413,958 |
#include <iostream>
#include <cstdio>
using namespace std;
void print_array(int *x, int n)
{
for (int k = 0; k < n; ++k)
{
if (k == n- 1)
{
printf("%d\n", x[k]);
}
else
{
printf("%d ", x[k]);
}
}
}
int main(int argc, char const *argv[])
{
int input_size, min, count = 0;
cin >> input_size;
int array[input_size];
for (int i = 0; i < input_size; ++i)
{
cin >> array[i];
}
for (int i = 0; i < input_size; ++i)
{
min = i;
for (int j = i; j < input_size; ++j)
{
if(array[j] < array[min])
{
min = j;
}
}
if(min != i) count++;
int temp = array[min];
array[min] = array[i];
array[i] = temp;
}
print_array(array, input_size);
printf("%d\n", count);
return 0;
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
int now = 0;
int xx = 0;
int yy = 0;
bool ok = 1;
rep(i,n){
int t,x,y;
cin >> t >> x >> y;
int dis = abs(xx-x) + abs(yy-y);
if(dis>t-now){
if(ok) cout << "No" << endl;
ok = 0;
}else{
if(dis%2 != (t-now)%2){
if(ok) cout << "No" << endl;
ok = 0;
}
}
now = t; xx = x; yy = y;
}
if(ok) cout << "Yes" << endl;
return 0;
} | 0 | 55,972,030 |
#include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
int gi() {
int a;
scanf("%d", &a);
return a;
}
ll gli() {
ll a;
scanf("%lld", &a);
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = gi();
int a = gi();
int b = gi();
printf((b-a)%2 ? "Borys\n" : "Alice\n");
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
main(){
int dp[20][20];
int W,H,N;
cin >> W >> H;
while(W){
cin >> N;
fill(dp[0],dp[20],0);
for(int i = 0;i < N;i++){
int a,b;
cin >> a >> b;
dp[b-1][a-1] = -1;
}
dp[0][0] = 1;
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
if(i && j && dp[i-1][j] == -1 && dp[i][j-1] == -1 || (!i && !j) || dp[i][j] == -1)continue;
if(!i || dp[i-1][j] == -1){
dp[i][j] = dp[i][j-1];
}else if(!j || dp[i][j-1] == -1){
dp[i][j] = dp[i-1][j];
}else{
dp[i][j] = dp[i][j-1] + dp[i-1][j];
}
}
}
if(dp[H-1][W-1] == -1)dp[H-1][W-1] = 0;
cout << dp[H-1][W-1] << endl;
cin >> W >> H;
}
} | 0 | 63,188,222 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<ll> a(X), b(Y), c(Z);
rep(i, X) cin >> a[i];
rep(i, Y) cin >> b[i];
rep(i, Z) cin >> c[i];
vector<ll> ab;
rep(i, X){
rep(j, Y){
ab.push_back(a[i]+b[j]);
}
}
sort(all(ab));
reverse(all(ab));
vector<ll> tmpv;
rep(i, min(3000, (int)ab.size())){
tmpv.push_back(ab[i]);
}
vector<ll> res;
rep(i, tmpv.size()){
rep(j, Z){
res.push_back(tmpv[i]+c[j]);
}
}
sort(all(res));
reverse(all(res));
rep(i, K){
cout << res[i] << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, w, ans = 0, count = 0;
string s, t;
vector<pair<string, pair<lli, lli>>> pr;
cin >> n >> a >> b;
if (a > b)
{
cout << 0 << endl;
}
else if (n == 1 && a != b)
{
cout << 0 << endl;
}
else if (n == 1 && a == b)
{
cout << 1 << endl;
}
else
{
c = b - a + 1;
ans = c * (n - 2) - (n - 3);
cout << ans << endl;
}
} | 0 | 39,487,780 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n;
cin >> n;
cout << 800 * n - n / 15 * 200 << endl;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> b(n);
long long sum_a = 0, sum_b = 0;
for(long long i = 0; i < n; i++){
cin >> a[i];
sum_a += a[i];
}
for(long long i = 0; i < n; i++){
cin >> b[i];
sum_b += b[i];
}
if(sum_b < sum_a){
printf("No\n");
return 0;
}
long long operation = sum_b - sum_a;
long long count1 = 0;
long long count2 = 0;
for(long long i = 0; i < n; i++){
if(a[i] < b[i]){
count1 += (b[i] - a[i])/2;
}
else if(a[i] > b[i]){
count2 += a[i] - b[i];
}
}
if(count1 >= count2){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 27,090,860 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N, A, B;
cin >> N >> A >> B;
if(N==1 && A!=B){
cout << 0 << endl;
}
else if(N==1 && A==B){
cout << 1 << endl;
}
else if(B<A){
cout << 0 << endl;
}
else{
cout << (B*(N-1)+A)-(B+A*(N-1))+1 << endl;
}
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,h;
cin >> n >> h;
vll a(n),b(n);
ll amax = 0;
REP(i,n){
cin >> a[i] >> b[i];
amax = max(amax,a[i]);
}
sort(rALL(b));
ll ans = 0;
REP(i,n){
if(h<=0) break;
if(b[i]<amax) break;
h-=b[i];
ans++;
}
if(h>0){
ans += (h-1)/amax+1;
}
cout << ans << endl;
return 0;
} | 0 | 80,144,048 |
#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;
}
vector<vector<int>> d(10, vector<int>(10, 1000000));
void warshall_floyd(int n) {
rep(k,n) rep(i,n) {
rep(j,n) {
d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
}
}
}
ll g1(ll n, int p) {
if (n == 0) return 0;
return n/p + g1(n/p, p);
}
ll g2(ll n, int p) {
ll res = g1(n/2, p);
if (p == 2) res += n/2;
return res;
}
int main()
{
ll n; cin >> n;
if (n % 2 == 1) {
cout << 0 << endl;
} else {
cout << min(g2(n,2), g2(n,5)) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
while(1){
int n ; cin >> n ; if(!n) break;
int* a=new int[n];
for(int i=0;i<n;i++) cin >> a[i];
int MAX=a[0];
for(int i=0;i<n;i++){
int temp=0;
for(int j=i;j<n;j++){
temp+=a[j];
if(temp>MAX) MAX=temp;
};
};
cout << MAX << '\n' ;
delete[] a;
};
} | 0 | 23,543,567 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int32_t main(){
IOS
int n,k;
cin>>n>>k;
int h[n];
for(int i=0;i<n;i++) cin>>h[i];
int t =0;
int ans = 0;
int dp[n+1];
for(int i=0;i<=n;i++) dp[i]= INT_MAX;
dp[1]=0;
for(int i=1;i<=n;i++){
for(int j = i+1;j<=n&&j<=i+k;j++){
dp[j] = min(dp[j],dp[i]+ abs(h[j-1]-h[i-1]));
}
}
cout <<dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<string> &o) {
string a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> numbers(n), values(n);
rep(i, n) cin >> numbers[i] >> values[i];
vector<ll> candidate;
{
ll sum = 0;
rep(i, n) {
if ((k | numbers[i]) == k) sum += values[i];
}
candidate.push_back(sum);
}
rep(i, 35) {
bool d = (k >> i) & 1;
if (!d) continue;
ll sum = 0;
ll target = k >> (i + 1);
rep(j, n) {
ll l = numbers[j];
bool b = ((l >> i) & 1);
if (b) continue;
ll c = (l >> (i + 1));
if ((target | c) != target) continue;
sum += values[j];
}
candidate.push_back(sum);
}
cout << *max_element(candidate.begin(), candidate.end()) << endl;
} | 0 | 1,649,084 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> p, q;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a == 1)p.insert(b);
if (b == n)q.insert(a);
}
bool ret = false;
for (auto x:p) {
if (q.find(x) != q.end())ret = true;
}
cout << (ret ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return 0;
} | #include <bits/stdc++.h>
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;
}
void debug() { cerr << "\n"; }
template <class T> void debug(const T &x) { cerr << x << "\n"; }
template <class T, class... Args> void debug(const T &x, const Args &... args) {
cerr << x << " ";
debug(args...);
}
template <class T> void debugVector(const vector<T> &v) {
for(const T &x : v) {
cerr << x << " ";
}
cerr << "\n";
}
using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
set<int> se;
for(int i = 0; i < 3; i++) {
int a;
cin >> a;
se.insert(a);
}
cout << se.size() << endl;
} | 0 | 81,832,943 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n;
vector<int>a(1000000);
vector<int>b(1000000);
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),std::greater<>());
cout<<10*a[0]+a[1]+a[2]<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for(int i = start; i < (int)(end); ++i)
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i,0,n){
int a, b;
cin >> a >> b;
if(m < a) continue;
jobs[a-1].push_back(b);
}
priority_queue<int> q;
ll ans = 0;
rep(i,0,m) {
for(int j: jobs[i]){
q.push(j);
}
if(q.empty()) continue;
ans += q.top();
q.pop();
}
cout << ans << endl;
return 0;
} | 0 | 30,641,957 |
#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
string itos(int n){
stringstream ss;
ss << n;
return ss.str();
}
string table = "mcxi";
int value[] = {1000,100,10,1};
int from(string s){
int num = 0;
int ans = 0;
for(int i = 0 ; i < s.size() ; i++){
if(~table.find(s[i])){
int p = table.find(s[i]);
if(num == 0) num = 1;
ans += value[p] * num;
num = 0;
}else{
num = num * 10 + s[i] - '0';
}
}
return ans + num;
}
string to(int n){
string ans = "";
for(int i = 0 ; i < 4 ; i++){
int g = n / value[i];
if(g > 1) ans += itos(g);
if(g >= 1) ans += table[i];
n -= g * value[i];
}
return ans;
}
int main(){
int T; cin >> T;
while(T--){
string a,b;
cin >> a >> b;
cout << to(from(a)+from(b)) << endl;
}
} | #include<iostream>
using namespace std;
int main () {
int H,W;
cin >> H >> W;
while (H || W) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (!i || i == H - 1 || !j || j == W - 1) {
cout << "#";
} else {
cout << ".";
}
}
if (W > 0) {
cout << endl;
}
}
cout << endl;
cin >> H >> W;
}
return 0;
} | 0 | 1,967,586 |
#include <iostream>
using namespace std;
void solve() {
int a, b, c;
cin >> a >> b >> c;
printf("%s\n", (a == b && b == c) ? "Yes" : "No");
}
int main() {
solve();
return 0;
}; | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
#define co2(i,j) cout << i << " " << j << endl;
#define co3(i) cout << i << " ";
#define po(i) cout << i.first << " " << i.second << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0) cerr << " :";
debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll ctoi(char c) {
switch (c) {
case '0': return 0; case '1': return 1; case '2': return 2;
case '3': return 3; case '4': return 4; case '5': return 5;
case '6': return 6; case '7': return 7; case '8': return 8;
case '9': return 9; default: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.first > secondElof.first;
}
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vll flag, D; vll path;
template <typename T>
struct BIT {
ll n; vector<T> bit[2];
BIT(ll n_) { init(n_); }
void init(ll n_) {
n = n_ + 1;
for (ll p = 0; p < 2; p++) bit[p].assign(n, 0);
}
void add_sub(ll p, ll i, T x) {
for (ll idx = i; idx < n; idx += (idx & -idx)) {
bit[p][idx] += x;
}
}
void add(ll l, ll r, T x) {
add_sub(0, l, -x * (l - 1));
add_sub(0, r, x * (r - 1));
add_sub(1, l, x);
add_sub(1, r, -x);
}
T sum_sub(ll p, ll i) {
T s(0);
for (ll idx = i; idx > 0; idx -= (idx & -idx)) s += bit[p][idx];
return s;
}
T sum(ll i) { return sum_sub(0, i) + sum_sub(1, i) * i; }
T query(ll l, ll r) { return sum(r - 1) - sum(l - 1); }
T value(ll i) { return sum(i) - sum(i - 1); }
ll binarySearch(ll key) {
ll left = 0;
ll right = n + 1;
while (right - left > 1) {
ll mid = left + (right - left) / 2;
if (value(mid) >= key) right = mid;
else left = mid;
}
return right;
}
};
int main() {
ll D, A;
cin >> N >> D >> A;
vpll M(N);
for (i = 0; i < N; i++) {
cin >> M[i].first >> M[i].second;
}
sort(M.begin(), M.end());
BIT<ll> B(N);
vl X(N);
map<ll,ll> Xz;
for (i = 0; i < N; i++) {
B.add(i + 1, i + 2, M[i].second);
X[i] = M[i].first;
Xz[M[i].first] = i + 1;
}
for (i = 0; i < N; i++) {
ll left = i + 1;
ll right = left;
if (X[N - 1] <= X[i] + 2 * D) right = N;
else {
right = Xz[*upper_bound(X.begin(), X.end(), X[i] + 2 * D)] - 1;
}
if (B.value(i + 1) > 0) {
ll P = (B.value(i + 1) - 1) / A + 1;
ans += P;
B.add(left, right + 1, -P * A);
}
}
co(ans);
} | 0 | 27,256,243 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
vector<ll> T;
void input() {
cin >> N;
T = vector<ll>(N);
rep(i, N) cin >> T[i];
}
ll gcd(ll a, ll b) {
while (b) {
ll tmp = a % b;
a = b;
b = tmp;
}
return a;
}
ll lcm(ll a, ll b) {
if (a < b) swap(a, b);
return (a / gcd(a, b)) * b;
}
int main() {
input();
ll ans = 1;
rep(i, N) ans = lcm(ans, T[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int ans = 0;
int l = 0, r = s.size() -1;
while (l < r) {
if (s[l] == s[r]) {
++l; --r;
continue;
}
if (s[l] == 'x') {
++l;
++ans;
continue;
}
if (s[r] == 'x') {
--r;
++ans;
continue;
}
ans = -1;
break;
}
cout << ans << endl;
return 0;
} | 0 | 47,432,158 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a-1] = 0;
}
}
int cnt = 0;
for(int &x : s) cnt += x;
cout << cnt << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vvl vector<vl>
#define pii pair<int, int>
#define pli pair<ll, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
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) {
if (b == 0) return a;
else return gcd(b, a % b);
}
ll keta(ll n){
string s = to_string(n);
ll num = s.size();
return num;
}
const ll INF = 1LL << 60;
const int dh[4] = {1,0,-1,0};
const int dw[4] = {0,1,0,-1};
struct Edge{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w){}
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, int>;
class UnionFind{
public:
vi Parent;
UnionFind(int n){
Parent = vi(n,-1);
}
int root(int a){
if(Parent[a] < 0) return a;
return Parent[a] = root(Parent[a]);
}
bool issame(int a, int b){
return root(a) == root(b);
}
int size(int a){
return -Parent[root(a)];
}
bool merge(int a, int b){
a = root(a);
b = root(b);
if(a == b) return false;
if(size(a) < size(b)) swap(a,b);
Parent[a] += Parent[b];
Parent[b] = a;
return true;
}
};
vi MP(string s){
vi A(s.size()+1);
A[0] = -1;
int j = -1;
rep(i,s.size()) {
while(j >= 0 && s[i] != s[j]) j = A[j];
j++;
A[i+1] = j;
}
return A;
}
vi Manacher(string s){
vi R(s.size());
int i = 0, j = 0;
while(i < s.size()){
while(i-j >= 0 && i+j < s.size() && s[i-j] == s[i+j]) ++j;
R[i] = j;
int k = 1;
while(i-k >= 0 && i+k < s.size() && k+R[i-k] < j) R[i+k] = R[i-k], k++;
i += k; j -= k;
}
return R;
}
vi Z_algorithm(string &s){
vi Z(s.size());
Z[0] = s.size();
int i = 1, j = 0;
while(i < s.size()){
while(i+j < s.size() && s[j] == s[i+j]) j++;
Z[i] = j;
if(j == 0){++i; continue;}
int k = 1;
while(i+k < s.size() && k+Z[k] < j) Z[i+k] = Z[k], ++k;
i += k; j -= k;
}
return Z;
}
const int MAX = 1e6+1;
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(ll n, ll k){
if(n >= MAX){
ll tmp = 1;
rep(i,k){
tmp *= (n-i);
tmp %= MOD;
}
return tmp*finv[k]%MOD;
}
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll POW(ll x, ll n){
ll ret = 1;
if(n < 0){
n *= -1;
x = inv[x];
}
while(0 < n){
if(n%2 == 0){
x = x*x%MOD;
n /= 2;
}
else{
ret = ret*x%MOD;
n--;
}
}
return ret;
}
int main(){
int n,m; cin >> n >> m;
vvl x(n,vl(3));
rep(i,n) cin >> x[i][0] >> x[i][1] >> x[i][2];
vl s(n);
ll ans = 0;
rep(bit,(1 << 3)) {
rep(i,n) {
ll sum = 0;
rep(j,3) {
if(bit & (1 << j)) sum += x[i][j];
else sum -= x[i][j];
}
s[i] = sum;
}
sort(all(s),greater<ll>());
ll sum = 0;
rep(i,m) sum += s[i];
chmax(ans, sum);
}
cout << ans << endl;
} | 0 | 10,134,123 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define rsrt(s) sort(s.rbegin(),s.rend())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5+5;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
#endif
boost
ll n;
cin >> n;
vector <double> v(n);
for(ll i=0;i<n;i++) cin >> v[i];
srt(v);
double ans=(v[0]+v[1])/2;
for(ll i=2;i<n;i++)
{
ans+=v[i];
ans/=2;
}
cout << fixed << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int n;
vector<int> mat[100];
cin >> n;
for(int i=0;i<n;i++){
int u,k;
cin >> u >> k;
for(int j=0;j<k;j++){
int v;
cin >> v;
mat[i].push_back(v-1);
}
}
int d[100];
for(int i=0;i<n;i++) d[i]=(-1);
queue<int> nb;
nb.push(0);
d[0]=0;
while(!nb.empty()){
for(vector<int>::iterator it=mat[nb.front()].begin();it!=mat[nb.front()].end();it++){
if(d[*it]==-1){
d[*it]=d[nb.front()]+1;
nb.push(*it);
}
}
nb.pop();
}
for(int i=1;i<=n;i++)
cout << i << ' ' << d[i-1] << endl;
return 0;
} | 0 | 99,796,802 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int m, int n) {
int a, b, c;
a = max(m, n);
b = min(m, n);
c = a%b;
while (c > 1) {
a = b;
b = c;
c = a%b;
}
if (c == 1) return 1;
else return b;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c % gcd(a, b) == 0) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int A,B;
cin>>A>>B;
string S;
cin>>S;
bool ans=true;
rep(i,A+B+1){
if(i!=A){
if(48<=int(S[i])&&int(S[i])<=57){
}
else{
ans=false;
break;
}
}
else{
if(S[i]!='-'){
ans=false;
break;
}
}
}
if(ans==true){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | 0 | 5,134,620 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
int digit[3];
for(int i=N;i<=999;i++){
bool flag=false;
string num=to_string(i);
if(num[0]==num[1]&&num[1]==num[2]) flag=true;
if(flag){
cout<<i<<endl;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N=2e5;
#define endl "\n"
struct dsu{
int g[N];
void init(){for(int i=0;i<=N;i++)g[i]=i;}
int find(int x){return x==g[x]?x:g[x]=find(g[x]);}
void uni(int u,int v){
int pu=find(u),pv=find(v);
if(pu!=pv)g[pu]=pv;
}
}dis;
int main(){
ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
int n,q;cin>>n>>q;
dis.init();
while(q--){
int mode;cin>>mode;
int u,v;cin>>u>>v;
if(mode==0){
dis.uni(u,v);
}
else{
if(dis.find(u)==dis.find(v))cout<<1<<endl;
else cout<<0<<endl;
}
}
} | 0 | 89,675,143 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(it) it.begin(), it.end()
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPU(i, a, b, s) for(int i = a; i < b; i += s)
#define REPD(i, a, b, s) for(int i = a; i > b; i -= s)
#define endl "\n"
ll INF = 2e18;
ll MOD = 1e9 + 7;
int i, j, k, t;
int f(int x) {
if(x % 2 == 0) {
return x / 2;
} else {
return 3 * x + 1;
}
}
int main() {
int s;
cin >> s;
int now, next;
unordered_map<int, int> m;
now = s;
m[s] = 1;
REPU(i, 2, 1000001, 1) {
next = f(now);
if(m.find(next) == m.end()) {
m[next] = 1;
} else {
cout << i << endl;
exit(0);
}
now = next;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}
template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
int l = vv.size();
if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n " ) << vv[i] << (i==l-1 ? " ]" : ""); }
return o;
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) {
freopen(filename.c_str(), "r", stdin);
}
int main(){
ios_base::sync_with_stdio(0);
int n, k; cin >> n >> k;
if(k > (n-1)*(n-2)/2){
cout << -1 << endl;
return 0;
}
vector<pii> es;
REP(i,1,n) es.emplace_back(i, n);
int cnt = (n-1)*(n-2)/2 - k;
REP(i,1,n-1){
REP(j,i+1,n){
if(cnt == 0) break;
es.emplace_back(i, j);
cnt--;
}
if(cnt == 0) break;
}
printf("%d\n", es.size());
for(auto e : es) printf("%d %d\n", e.fi, e.se);
return 0;
} | 0 | 81,107,026 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N;
cin>>N;
map<int,int>k;
for(int i=2;i<=N;i++){
int cur=i;
for(int j=2;j*j<=cur;j++){
while(cur%j==0){k[j]++;cur/=j;}
}
if(cur!=1){k[cur]++;}
}
map<int,int>num;
for(int i=1;i<=75;i++){
for(auto c:k){
if(c.second>=i-1){num[i]++;}
}
}
cout<<num[75]+num[25]*(num[3]-1)+(num[5]-1)*num[15]+num[5]*(num[5]-1)*(num[3]-2)/2<<endl;
return 0;
} | #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 double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
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();
ll S;
cin >> S;
map<ll, ll> m;
ll before = S;
m[before]++;
ll index = 0;
while (1) {
ll next = 0;
if (before % 2 == 0) {
next = before / 2;
} else {
next = 3 * before + 1;
}
if (m[next] == 1) {
COUT(index + 2);
return 0;
}
before = next;
index++;
m[next]++;
}
return 0;
} | 0 | 5,097,004 |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int dp[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>dp[i][j];
}
}
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
for(int x=0;x<3;x++)
{
for(int y=0;y<3;y++)
{
if(dp[x][y]==arr[i])
dp[x][y]=0;
}
}
}
for(int i=0;i<3;i++)
{
if(dp[i][0]==0 && dp[i][1]==0 && dp[i][2]==0)
{
cout<<"Yes\n";
return;
}
}
for(int i=0;i<3;i++)
{
if(dp[0][i]==0 && dp[1][i]==0 && dp[2][i]==0)
{
cout<<"Yes\n";
return;
}
}
if(dp[0][0]==0 && dp[1][1]==0 && dp[2][2]==0)
{
cout<<"Yes\n";
return ;
}
if(dp[0][2]==0 && dp[1][1]==0 && dp[2][0]==0)
{
cout<<"Yes\n";
return;
}
cout<<"No\n";
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define NIL -1
struct Matrix {
Matrix(int r, int c)
: r(r), c(c){
}
int r;
int c;
};
int costs[101][101];
void init_costs() {
for(int i=0; i<101; i++) {
for(int j=0; j<101; j++) {
costs[i][j] = NIL;
}
}
}
int cost(vector<Matrix>& ms, int start, int end) {
if(costs[start][end] != NIL) {
return costs[start][end];
}
if(start == end) {
costs[start][end] = 0;
return 0;
}
if(end - start == 1) {
Matrix s = ms.at(start);
Matrix e = ms.at(end);
int c = s.r * s.c * e.c;
costs[start][end] = c;
return c;
}
vector<int> cs;
for(int i=start; i<end; i++) {
int c1 = cost(ms, start, i);
int c2 = cost(ms, i+1, end);
int c3 = ms.at(start).r * ms.at(i).c * ms.at(end).c;
cs.push_back(c1 + c2 + c3);
}
int c = *min_element(cs.begin(), cs.end());
costs[start][end] = c;
return c;
}
int solve(vector<Matrix>& ms) {
return cost(ms, 0, ms.size()-1);
}
int main() {
init_costs();
int n;
cin >> n;
vector<Matrix> ms;
for(int i=0; i<n; i++) {
int r, c;
cin >> r >> c;
ms.push_back(Matrix(r, c));
}
cout << solve(ms) << endl;
} | 0 | 55,656,156 |
#include<iostream>
int main(){
int n,a[10000];
int na = -1000001,nb = 1000001;
long long sum = 0;
std::cin>>n;
for(int i = 0; i < n; ++i){
std::cin>>a[i];
if(na < a[i])
na = a[i];
if(nb > a[i])
nb = a[i];
sum += a[i];
}
std::cout<<nb<<" "<<na<<" "<<sum<<std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int dp[2050];
const int mod=1e9+7;
int main(){
int n;
cin>>n;
dp[0]=1;
for(int i=3;i<=n;++i)
for(int j=3;j<=i;++j){
dp[i]+=dp[i-j];
if(dp[i]>=mod)dp[i]-=mod;
}
cout<<dp[n]<<endl;
return 0;
} | 0 | 86,031,785 |
#include <iostream>
using namespace std;
int main()
{
int top, stop, sstop, obj;
top = stop = sstop = 0;
for (int i = 0; i < 10; i++){
cin >> obj;
if (obj > top){
sstop = stop;
stop = top;
top = obj;
}else if (obj > stop){
sstop = stop;
stop = obj;
}else if (obj > sstop){
sstop = obj;
}
}
cout << top << "\n" << stop << "\n" << sstop << endl;
} | #include <cstdio>
#include <iostream>
#include <stdlib.h>
using namespace std;
namespace {
struct Node {
char suit;
int value;
};
int SelectionSort(Node* a, int n) {
int nswap = 0;
for (int i = 0; i < n; ++i) {
int minj = i;
for (int j = i + 1; j < n; ++j) {
if (a[j].value < a[minj].value) {
minj = j;
}
}
if (i != minj) {
++nswap;
const Node t = a[i];
a[i] = a[minj];
a[minj] = t;
}
}
return nswap;
}
int BubbleSort(Node* a, int n) {
int nswap = 0;
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j >= 1; --j) {
if (a[j].value < a[j - 1].value) {
const Node t = a[j - 1];
a[j - 1] = a[j];
a[j] = t;
++nswap;
}
}
}
return nswap;
}
void Print(const Node* a, int n) {
for (int i = 0; i < n; ++i) {
if (i > 0) printf(" ");
printf("%c%d", a[i].suit, a[i].value);
}
printf("\n");
}
bool IsStable(const Node* a, const Node* b, int n) {
for (int i = 0; i < n; ++i) {
if (a[i].value == b[i].value && a[i].suit != b[i].suit) {
return false;
}
}
return true;
}
}
int main() {
int n;
cin >> n;
Node in[36];
Node a[36];
Node b[36];
char buf[4];
for (int i = 0; i < n; ++i) {
cin >> buf;
in[i].suit = buf[0];
in[i].value = atoi(&buf[1]);
a[i] = in[i];
b[i] = in[i];
}
BubbleSort(a, n);
Print(a, n);
printf("Stable\n");
SelectionSort(b, n);
Print(b, n);
if (IsStable(a, b, n)) {
printf("Stable\n");
} else {
printf("Not stable\n");
}
return 0;
} | 0 | 57,858,497 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
int K;
string S;
cin >> K >> S;
if(S.size()<=K) {
cout << S << endl;
return 0;
}
else{
rep(i,K){
cout << S.at(i);
}
cout << "..."<< endl;
return 0;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
string g;
rep(i,s.length()){
if(s[i]=='B') {
if(g.length()>0) g.pop_back();
}
else g.push_back(s[i]);
}
cout<<g;
return 0;
} | 0 | 12,330,515 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
while(y){
if(y%2){res=res*tmp%MOD;}
y>>=1;
tmp=tmp*tmp%MOD;
}
return res;
}
ll nature(ll a){
if(a>=0){return(a);}
else{return(-1*a);}
}
ll prime(ll a){
if(a==2){return 1;}
else if(a%2==0 || a==1){return 0;}
for(ll i=3;i*i<=a;i+=2){if(a%i==0){return 0;}}
return 1;
}
vector<int> Z;
void z_algorithm(string str){
Z.resize(str.size());
Z.at(0)=str.size();
int m=1,n=0;
while(m<(int)str.size()){
while(m+n<(int)str.size()&&str.at(n)==str.at(m+n)){n++;}
Z.at(m)=n;
if(n==0){
m++;
continue;
}
int k=1;
while(k+Z.at(k)<n){
Z.at(m+k)=Z.at(k);
k++;
}
m+=k;
n-=k;
}
}
template <typename T>
struct BIT{
int n;
vector<T> bit[2];
void init(int n_){
n=n_+1;
for(int j=0;j<2;j++){
bit[j].assign(n,0);
}
}
void add_sub(int p,int i,T x){
for(int j=i;j<n;j+=j&-j){
bit[p][j]+=x;
}
}
void add(int l,int r,T x){
add_sub(0,l,-x*(l-1));
add_sub(0,r+1,x*r);
add_sub(1,l,x);
add_sub(1,r+1,-x);
}
T sum_sub(int p,int i){
T s(0);
for (int j=i;j>0;j-=j&-j){
s+=bit[p][j];
}
return s;
}
T sum(int i,int j){
return sum_sub(0,j)+sum_sub(1,j)*j-sum_sub(0,i-1)-sum_sub(1,i-1)*(i-1);
}
T binary_search_sum1(int key){
if(key<=0){
return 0;
}
else{
int x=0,r=1;
while(r<n){
r=r<<1;
}
for(int length=r;length>0;length=length>>1){
if(x+length<n&&sum(x+1,x+length)<key){
key-=sum(x+1,x+length);
x+=length;
}
}
return x+1;
}
}
T binary_search_sum2(int key){
key++;
if(key<=0){
return 0;
}
else{
int x=0,r=1;
while(r<n){
r=r<<1;
}
for(int length=r;length>0;length=length>>1){
if(x+length<n&&sum(x+1,x+length)<key){
key-=sum(x+1,x+length);
x+=length;
}
}
return x;
}
}
};
template<typename T>
struct BIT2D{
int H,W;
vector<vector<T>> bit;
void init(int H_,int W_){
H=H_+1;
W=W_+1;
bit.assign(H,vector<T>(W,0));
}
void add(int h,int w,T x){
for(int i=h;i<H;i+=i&-i){
for(int j=w;j<W;j+=j&-j){
bit[i][j]+=x;
}
}
}
T sum(int h,int w){
T s=0;
for(int i=h;i>0;i-=i&-i){
for(int j=w;j>0;j-=j&-j){
s+=bit[i][j];
}
}
return s;
}
T partsum(int h,int w,int hh,int ww){
return sum(hh,ww)+sum(h-1,w-1)-sum(hh,w-1)-sum(h-1,ww);
}
};
int main(){
int N,K;
cin>>N>>K;
vector<int> A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
}
BIT<int> rock;
rock.init(N);
for(int i=1;i<=N;i++){
rock.add(i,i,A.at(i-1));
}
vector<int> copy(N);
for(int i=0;i<K;i++){
for(int i=1;i<=N;i++){
copy.at(i-1)=rock.sum(i,i);
}
for(int i=1;i<=N;i++){
rock.add(i,i,-1*rock.sum(i,i));
}
for(int i=1;i<=N;i++){
int left=max(1,i-copy.at(i-1)),right=min(N,i+copy.at(i-1));
rock.add(left,right,1);
}
int check=0;
for(int i=1;i<=N;i++){
if(rock.sum(i,i)==N){check++;}
}
if(check==N){break;}
}
for(int i=1;i<=N;i++){
cout<<rock.sum(i,i)<<" ";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,k;
cin>>n>>k;
long double ans=0;
for(int i=1;i<=n;i++){
int x=0;
int tmp=i;
long double xx=1;
while(tmp<k){
x++;
tmp*=2;
xx/=(long double)2;
}
ans+=xx;
}
ans/=(long double)n;
cout<<fixed<<setprecision(12)<<ans<<endl;
} | 0 | 27,616,022 |
#include<iostream>
using namespace std;
bool Eratosthenes[999999+30];
int main()
{
int n,pos;
int c;
while(cin>>n)
{
c=0;
Eratosthenes[1]=false;
for(int i=2; i<=n; i++) Eratosthenes[i]=true;
for(int i=2; i<=n; i++)
{
if(Eratosthenes[i]==true)
{
pos=2*i;
while(pos<=n)
{
Eratosthenes[pos]=false;
pos=pos+i;
}
}
}
for(int i=1; i<=n; i++)
{
if(Eratosthenes[i]==true)
c++;
}
cout<<c<<endl;
}
return 0;
} | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
vector< vector<int> > G(10001);
queue<int> que;
int n_v, n_e, u, v;
int in_degree[10001], ans[10001], idx;
int main(){
memset(in_degree, 0, sizeof(in_degree));
scanf("%d %d", &n_v, &n_e);
for(int i=0; i<n_e; i++){
scanf("%d %d", &u, &v);
G[u].push_back(v);
in_degree[v] += 1;
}
idx = 0;
for(int i=0; i<n_v; i++)
if(in_degree[i]==0){
ans[idx++] = i;
que.push(i);
}
while(!que.empty()){
u = que.front();
que.pop();
for(int i=0; i<G[u].size(); i++){
v = G[u][i];
in_degree[v] -= 1;
if(in_degree[v]==0){
ans[idx++] = v;
que.push(v);
}
}
}
for(int i=0; i<n_v; i++)
printf("%d\n", ans[i]);
return 0;
} | 0 | 70,543,413 |
#include<bits/stdc++.h>
#define lld long long
#define pb push_back
#define mk make_pair
#define MAX (lld)1e18+7
#define lim (lld)1e9+7
#define MAX2 (lld)2e5+9
#define ff first
#define ss second
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const lld mod=lim;
lld power(lld x, lld y, lld p)
{ lld res = 1; x = x % p; if (x == 0) return 0;
while (y > 0)
{ if (y & 1) res = (res*x) % p; y = y>>1; x = (x*x) % p; }
return res; }
lld extend_gcd(lld a, lld b, lld& x, lld& y) {
if (b == 0) { x = 1;y = 0;return a;}
lld x1, y1;
lld d = extend_gcd(b, a % b, x1, y1);
x = y1; y = x1 - y1 * (a / b);return d; }
lld rowNum[]={-1,0,0,1};
lld colNum[]={0,-1,1,0};
int main()
{
fastio
lld n,x,m;
cin>>n>>x>>m;
map<lld,lld> cnt;
lld nxt = x;
lld sum=0;
cnt[x]++;
sum+=x;
lld idx=n;
for(lld i=1;i<min(n,m);i++)
{
nxt = (nxt*nxt)%m;
if(cnt.find(nxt)!=cnt.end())
{
idx=i;
break;
}
else
{
sum+=nxt;
cnt[nxt]++;
}
}
cnt.clear();
cnt[nxt]++;
lld len=1;
std::vector<lld> cycsum;
cycsum.pb(nxt);
lld lensum=nxt;
for(lld i=idx;i<min(n,m+idx);i++)
{
nxt = (nxt*nxt)%m;
if(cnt.find(nxt)!=cnt.end())
{
break;
}
else
{
len++;
cycsum.pb(nxt);
lensum+=nxt;
cnt[nxt]++;
}
}
lld cycles = (n-(idx))/len;
sum = sum + ((cycles)*(lensum));
for(lld i=0;i<(n-idx)-cycles*len;i++)
{
sum+=cycsum[i];
}
cout<<sum<<endl;
} | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#define tc(t) int t; cin>>t; while(t--)
#define sz(v) int((v).size())
#define pb push_back
const int maxm = 1000000000 + 7;
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
int ans = sqrt(n);
for (int i = sqrt(n); i >= 2; i--)
{
if (n % i == 0)
{
cout << i + (n / i) - 2 << endl;
return 0;
}
}
cout << n - 1 << endl;
} | 0 | 8,437,775 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
int n;
cin >> n;
string s, t;
cin >> s >> t;
for (int i = 0; i < n; i++)
{
cout << s[i] << t[i];
}
cout << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for(ll i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for(ll i = 0; i < n; ++i) {
cin >> b[i];
}
ll beat = 0;
for(ll i = 0; i < n; ++i) {
ll up = min(a[i], b[i]);
beat += up;
a[i] -= up;
b[i] -= up;
ll slant = min(a[i + 1], b[i]);
beat += slant;
a[i + 1] -= slant;
b[i] -= slant;
}
cout << beat << endl;
} | 0 | 24,830,101 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
typedef long long ll;
typedef unsigned long long ull;
int a[2000];
int main()
{
int N, Z, W;
cin >> N >> Z >> W;
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;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vector<int> v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli a,b,c;
cin>>a>>b>>c;
a%=b;
lli ac=a%b;
while(a!=0){
if(a%b==c){
out("YES");
return 0;
}
a+=ac;
a%=b;
}
out("NO");
} | 0 | 53,017,938 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
typedef struct {
ll x, y, z;
}cake_t;
int main() {
ll N, M; cin >> N >> M;
vector<cake_t> cake(N);
for (int i = 0; i < N; i++) {
cin >> cake[i].x >> cake[i].y >> cake[i].z;
}
ll ans = -1e14;
for (int i = 0; i < 8; i++) {
ll an = 0;
int temp = i;
vector<int> bit(3);
vector<ll> scr(N);
for (int j = 0; temp > 0; j++) {
bit[j] = temp % 2;
temp /= 2;
}
for (int k = 0; k < N; k++) {
if (bit[0]) scr[k] += cake[k].x;
else scr[k] -= cake[k].x;
if (bit[1]) scr[k] += cake[k].y;
else scr[k] -= cake[k].y;
if (bit[2]) scr[k] += cake[k].z;
else scr[k] -= cake[k].z;
}
sort(scr.begin(), scr.end(), greater<ll>());
for (int k = 0; k < M; k++) {
an += scr[k];
}
ans = max(ans, an);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,S;
int count = 0;
cin >> K >> S;
for(int i=0; i<=K; i++)
{
for(int j=0; j<=K; j++)
{
if(0 <= S-i-j && S-i-j <= K)
{
count += 1;
}
}
}
cout << count << endl;
return 0;
} | 0 | 87,347,191 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i,n) for (ll i=(ll)n-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
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; }
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX6 1001001
#define MAX7 10010010
#define SENTINEL 2000000000
#define INF 1<<30
#define INFTY 1LL<<60
#define MAX_INT INT_MAX
#define Endl '\n'
#define CLR(mat) memset(mat, 0, sizeof(mat))
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
const int MOD = 998244353;
inline ll mod_add(ll a,ll b){return (a+b)%MOD;}
inline ll mod_sub(ll a,ll b){return (a+MOD-b)%MOD;}
inline ll mod_mul(ll a,ll b){return ((a%MOD)*(b%MOD))%MOD;}
inline ll mod_pow(ll x,ll n,ll mod=(ll)MOD){ll res=1;while(n>0){
if(n&1)res=res*x%mod;
x=x*x%mod;n>>=1;}return res;}
inline ll mod_inv(ll x){return mod_pow(x,MOD-2);}
inline ll mod_div(ll a, ll b){return mod_mul(a,mod_inv(b));}
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll n;
int main(){
cin>>n;
VI a(n);rep(i,n)cin>>a[i];
ll res=0;
int right=0;
int sum=0;
for(int left=0;left<n;left++){
while(right<n && (sum^a[right])==(sum+a[right])){
sum+=a[right];
right++;
}
res+=right-left;
if(left==right)right++;
else{
sum-=a[left];
}
}
cout<<res<<endl;
} | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
llong ans=0;
for(int i=0; i<=25; i++){
for(int j=0; j<=25; j++){
if(i*4+j*7==N){
ans++;
}
}
}
if(ans>0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | 0 | 69,426,438 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
int main()
{
int n;
cin>>n;
int *h = new int[n];
rep(i,n) cin>>h[i];
ll ans = 0;
for(int i = 0; i < n; i++){
bool ok = true;
for(int j = 0; j < i; j++){
if( h[j] > h[i]){
ok = false;
break;
}
}
if( ok == true) ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
int keta(int n){
int 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;
}
int main() {
int n;
cin >> n;
vector<int>b(n-1);
rep(i,n-1) cin >> b.at(i);
int sum = 0;
sum += b.at(0);
rep(i,n-2){
sum += min(b.at(i),b.at(i+1));
}
sum += b.at(n-2);
cout << sum << endl;
} | 0 | 94,902,983 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ROF(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
#define SUM(a) accumulate(all(a),0)
#define pb push_back
#define fst first
#define snd second
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
string s; cin >> s;
int sz = s.size();
int x,y; cin >> x >> y;
vi d;
int pos = 0;
d.pb(0);
while(pos < sz){
if(s[pos] == 'T'){
pos++;
d.pb(0);
}else{
int tmp = 0;
while(s[pos] == 'F'){
pos++;
tmp++;
}
d.back() += tmp;
}
}
vvi dpx((d.size()+1)/2, vi(2*sz+1)), dpy(d.size()/2, vi(2*sz+1));
dpx[0][d[0]+sz] = true;
int i = 2;
while(i < d.size()){
rep(j,2*sz+1){
if(j - d[i] >= 0)
dpx[i/2][j] |= dpx[i/2 - 1][j - d[i]];
if(j + d[i] <= 2*sz)
dpx[i/2][j] |= dpx[i/2 - 1][j + d[i]];
}
i += 2;
}
if(d.size() >= 2)
dpy[0][d[1]+sz] = dpy[0][-d[1]+sz] = true;
i = 3;
while(i < d.size()){
rep(j,2*sz+1){
if(j - d[i] >= 0)
dpy[i/2][j] |= dpy[i/2 - 1][j - d[i]];
if(j + d[i] <= 2*sz)
dpy[i/2][j] |= dpy[i/2 - 1][j + d[i]];
}
i += 2;
}
dump(d,dpx,dpy);
int f = dpx[(d.size()-1)/2][x+sz];
if(d.size() >= 2) f &= dpy[d.size()/2 - 1][y+sz];
else f &= (y == 0);
if(f)
cout << "Yes\n";
else
cout << "No\n";
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
main(){
int n,x;
cin>>n>>x;
int ans=0;
ans+=n;
int res=n-x;
while(res){
if(res%x==0){
ans+=(2*res/x-1)*x;
break;
}
else {
ans+=(2*(res/x))*x;
int tmp=res;
res=x;
x=tmp%x;
}
}
cout<<ans<<endl;
} | 0 | 18,617,144 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int64_t> x(n);
vector<int64_t> y(n);
int p;
int64_t f=0;
for(int i=0;i<n;i++){
cin>>x.at(i)>>y.at(i);
if(i==0)
p=abs(x.at(0)+y.at(0))%2;
else if(p!=abs(x.at(i)+y.at(i))%2){
cout<<-1<<endl;
return 0;
}
f=max(f,abs(x.at(i)+y.at(i)));
}
vector<int64_t> d;
int64_t b=1;
while(b<=f){
if(p==0&&b==1)
d.push_back(1);
d.push_back(b);
b*=2;
}
reverse(d.begin(),d.end());
cout<<d.size()<<endl;
for(int i=0;i<d.size();i++)
cout<<d.at(i)<<(i+1<d.size()?" ":"");
cout<<endl;
for(int i=0;i<n;i++){
for(int j=0;j<d.size();j++){
if(y.at(i)+x.at(i)>=0){
if(y.at(i)-x.at(i)>=0){
cout<<'U';
y.at(i)-=d.at(j);
}else{
cout<<'R';
x.at(i)-=d.at(j);
}
}else{
if(y.at(i)-x.at(i)>=0){
cout<<'L';
x.at(i)+=d.at(j);
}else{
cout<<'D';
y.at(i)+=d.at(j);
}
}
}
cout<<endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int res = 0;
int target = 2;
int state = 0;
for(int i=0;i<n;i++){
string s; cin >> s;
if(s[1] == 'u') state++;
else state--;
if(state == target){
res++;
target = 2-target;
}
}
cout << res << endl;
}
} | 0 | 91,696,316 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
#include <bitset>
#include <complex>
#include <cmath>
#include <array>
#include <numeric>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pint> vpint;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=100050;
int main() {
int N;
cin>>N;
vll A;
ll sxor=0;
for(int i=0;i<N;i++){
ll a;
cin>>a;
A.pb(a);
sxor^=a;
}
for(int i=0;i<N;i++)
A[i]&=~sxor;
int r=0;
for(int idx=60;idx>=0;idx--){
bool flag=0;
for(int i=r;i<N;i++){
if((A[i]>>idx)&1){
swap(A[i],A[r]);
flag=1;
break;
}
}
if(flag){
for(int i=0;i<N;i++){
if(i!=r && ((A[i]>>idx)&1))
A[i]^=A[r];
}
r++;
}
}
ll ans=0;
for(int i=0;i<N;i++)
ans^=A[i];
cout<<2LL*ans+sxor<<endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define SUM(...) accumulate(ALL(__VA_ARGS__),0LL)
#define DSUM(...) accumulate(ALL(__VA_ARGS__),0.0)
using namespace std;
using ll = long long;
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;}
template<class T> inline auto max(const T& a){ return *max_element(ALL(a)); }
template<class T> inline auto min(const T& a){ return *min_element(ALL(a)); }
inline ll gcd(ll a,ll b){if(b == 0) return a;return gcd(b,a%b);}
inline ll lcm(ll a,ll b){ll g = gcd(a,b);return a / g * b;}
void print() { std::cout << '\n'; }
template <class T>void print(const T &x) {std::cout << x <<'\n';}
template <class T, class... Args>void print(const T &x, const Args &... args) {std::cout << x << " ";print(args...);}
const int INF = 2002002002;
void solve(long long a, long long b, long long c){
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
set<int> ans;
REP(i, 3) {
int tmp;
cin >> tmp;
ans.insert(tmp);
}
print(ans.size());
return 0;
} | 0 | 72,926,989 |
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define all(c) (c).begin(), (c).end()
#define tr(i,c) for(auto i=(c).begin();i!=(c).end();i++)
#define rtr(i,c) for(auto i=(c).rbegin();i!=(c).rend();i++)
#define rep(i,b) for(auto i=0;i<(b);i++)
#define pb push_back
#define sz(c) int((c).size())
struct node {
int key;
node *prev, *next;
};
node *head, head_s, *tail, tail_s;
void insert(int x) {
node *next = head->next;
node *nd = new node;
nd->key = x;
nd->next = next;
nd->prev = head;
next->prev = nd;
head->next = nd;
}
void del_node(node *nd) {
if (nd == head || nd == tail) return;
node *next = nd->next;
node *prev = nd->prev;
prev->next = next;
next->prev = prev;
delete nd;
}
void del(int x) {
for (node *nd = head->next; nd != tail; nd = nd->next) {
if (nd->key == x) {
del_node(nd);
return;
}
}
}
void del_first() { del_node(head->next); }
void del_last() { del_node(tail->prev); }
void init_root() {
head = &head_s;
tail = &tail_s;
head->next = tail;
head->prev = head;
tail->next = tail;
tail->prev = head;
}
int main(int argc, char **argv)
{
init_root();
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
char buf[32];
int x;
scanf("%s", buf);
string cmd(buf);
if (cmd == "insert") {
scanf("%d", &x);
insert(x);
} else if (cmd == "delete") {
scanf("%d", &x);
del(x);
} else if (cmd == "deleteFirst") {
del_first();
} else if (cmd == "deleteLast") {
del_last();
}
}
const char *sp = "";
for (auto nd = head->next; nd != tail; nd = nd->next) {
printf("%s%d", sp, nd->key);
sp = " ";
}
putchar('\n');
return 0;
} | #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 | 97,747,903 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int N;
cin >> N;
cout << 0 << endl;
string S;
cin >> S;
string S0 = S;
if(S == "Vacant") return 0;
int l=1,r=N;
while(true){
int mid = (l+r) / 2;
cout << mid << endl;
cin >> S;
if(S == "Vacant") return 0;
if(mid % 2 == 0 && S == S0){
l = mid;
}else if(mid % 2 == 1 && S != S0){
l = mid;
}else{
r = mid;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.end()
#define pb(i) push_back(i)
#define PB() pop_back()
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define Fi first
#define Se second
const int maxx=1e6+9;
void solve(){
int n;
cin>>n;
int maxm=INT_MIN;
int smaxm=INT_MIN;
vi arr(n);
for(int i=0;i<n;i++){
int x;
cin>>x;
arr[i]=x;
if(x>=maxm){
smaxm=maxm;
maxm=x;
}
else if(x>=smaxm){
smaxm=x;
}
}
for(int i=0;i<n;i++){
if(arr[i]==maxm){
cout<<smaxm<<endl;
}
else{
cout<<maxm<<endl;
}
}
}
int main() {
faster;
int t=1;
while(t-->0){
solve();
}
return 0;
} | 0 | 76,997,785 |
#include <atcoder/all>
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, q;
cin >> n >> q;
vector<ll> t(q), u(q), v(q);
rep(i, q) { cin >> t[i] >> u[i] >> v[i]; }
atcoder::dsu d(n);
rep(i, q) {
if (t[i]) {
cout << d.same(u[i], v[i]) << endl;
} else {
d.merge(u[i], v[i]);
}
}
return 0;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>=1;i--)
#define all(vec) vec.begin(),vec.end()
#define sortt(vec) sort((vec).begin(),(vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef tuple<ll,ll,ll> tlll;
typedef tuple<int,int,int> tiii;
const ll mod=1e9+7;
const int inf=1<<30;
const ll lnf=1ll<<60;
ll val[60][100010];
ll to[60][100010];
int main(){
ll n,x,m;
cin >> n >> x >> m;
rep(j,m){
val[0][j]=j;
to[0][j]=(ll)j*j%m;
}
rep(i,60-1)rep(j,m){
val[i+1][j]=val[i][j]+val[i][to[i][j]];
to[i+1][j]=to[i][to[i][j]];
}
ll next=x,ans=0;
for(int i=60-1;i>=0;i--){
if((n>>i)&1){
ans+=val[i][next];
next=to[i][next];
}
}
cout << ans << endl;
} | 0 | 32,196,608 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string str_t, str_h;
int T = 0, H = 0;
for(int i=0; i< n; i++){
cin >> str_t >> str_h;
if(str_t > str_h) T += 3;
else if (str_t < str_h) H += 3;
else {T++; H++;}
}
cout << T << ' ' << H << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define mp(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll IINF = INT_MAX;
const int N = 1e5 + 5;
vi fac[N];
ll cnt[N];
ll fpow(ll a, ll b) {
if (b == 0) return 1;
if (b == 1) return a % MOD;
ll ret = fpow(a, b / 2);
ret = (ret * ret) % MOD;
if (b & 1) ret = (ret * a) % MOD;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
for (ll j = 1; j * j <= 1ll * i; j++) {
if (i % j == 0) {
fac[i].pb(j);
if (j != i / j && j != 1) fac[i].pb(i / j);
}
}
}
ll ans = 0;
for (int i = k; i >= 1; i--) {
int banyak = k / i;
cnt[i] = (cnt[i] + fpow(banyak, n)) % MOD;
ans = (ans + 1ll * i * cnt[i]) % MOD;
for (int fa: fac[i]) {
cnt[fa] = (cnt[fa] - cnt[i] + MOD) % MOD;
}
}
cout << ans << '\n';
return 0;
} | 0 | 82,395,707 |
#include <iostream>
int main(int argc, char const *argv[])
{
int a, b, c, answer;
answer = 0;
std::cin >> a >> b >> c;
for (int i = a;i <= b;i++) {
if ((c % i) == 0) {
answer++;
}
}
std::cout << answer << std::endl;
return 0;
} | #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;
} | 0 | 3,974,146 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> void PrintVector(const vector<T> &vec) {for (auto val : vec) cout << val << " "; cout << endl;}
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<Pll> prime_factorize(ll N) {
vector<Pll> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
int n;
map<ll, int> sisuu;
ll rec(map<ll, int> ::iterator p, ll mul)
{
if (p == sisuu.end())
{
if (mul == 1) return 1;
else return 0;
}
ll ans = 0;
rep(i, p->second + 1)
{
if (mul % (i + 1) != 0) continue;
p++;
ans += rec(p, mul / (i + 1));
--p;
}
return ans;
}
int main()
{
cin >> n;
Rep(i, 2, n + 1)
{
auto ps = prime_factorize(i);
for (auto it : ps) sisuu[it.first] += it.second;
}
cout << rec(sisuu.begin(), 75) << endl;
} | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
ll int MOD=998244353;
#define INF 2*1e9
#define N 310000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
int par[N],grade[N];
void init(int n){
rep2(i,1,n){
par[i]=i;
grade[i]=0;
}
}
int root(int x){
return par[x]==x?x: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(grade[x]<grade[y]){
par[x]=y;
}
else{
par[y]=x;
if(grade[x]==grade[y]) grade[x]++;
}
}
ll int n,m,color[N];
vector<int> v[N];
int dfs(int a,int b){
if(color[a]==b) return 1;
if(color[a]!=0&&color[a]!=b) return 0;
color[a]=b;
b*=-1;
bool ans=true;
rep(i,v[a].size()){
ans=ans&dfs(v[a][i],b);
}
return ans;
}
main(){
cin>>n>>m;
init(n);
rep(i,m){
int u,w;
cin>>u>>w;
v[u].pb(w);v[w].pb(u);
unite(u,w);
}
bool used[N]={};
ll int a=0,b=0,c=0;
rep2(i,1,n){
int r=root(i);
if(used[r])continue;
used[r]=1;
if(grade[r]==0){
a++; continue;
}
if(dfs(r,1)) b++;
else c++;
}
cout<<((2*n-1)*a-a*(a-1)+2*b*b+2*b*c+c*c);
return 0;
} | 0 | 8,017,350 |
#include <iostream>
int main(){
int a,b;
while(std::cin >> a >> b, (a|b)){
[&a,&b] () -> void { if(a > b){ std::swap(a,b); } } ();
std::cout << a << " " << b << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
int ii() { int x; scanf("%d", &x); return x; }
long long il() { long long x; scanf("%lld", &x); return x; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); }
void od(double x) { printf("%.15f ", x); }
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}}
void br() { putchar('\n'); }
#define gcd __gcd
int lcm(int a, int b){return a / gcd(a, b) * b;}
#define ALL(a) a.begin(),a.end()
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; i++ )
#define rep(i,n) REP(i,0,n)
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define PB push_back
#define SZ(x) ((int)(x).size)
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " ";
}
return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
int main(){
ll k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b || k <= a){
cout << k + 1 << endl;
return (0);
}
ll ans = 1;
k -= (a - 1);
ans += a-1;
cout << ( k % 2 == 0 ? ans + (k / 2) * (b-a) : ans + 1 + ((k - 1) / 2) * (b-a) ) << endl;
} | 0 | 5,352,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef pair<ll, ll> LP;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
#define fs first
#define sc second
int main() {
string s,t;
cin>>s>>t;
int n=s.size();
rep(i,n){
if(s==t) {
cout<<"Yes"<<endl;
return 0;
}
s=s.back()+s.substr(0,n-1);
}
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
template<class T> void chmax(T &a, const T &b){if(a<b) a=b;}
template<class T> void chmin(T &a, const T &b){if(b<a) a=b;}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
vi dp;
int main() {
int n; cin >> n;
dp.reserve(100001);
int a; cin >> a;
dp.eb(a);
rep(i, 0, n) {
cin >> a;
if(dp.back() < a) dp.eb(a);
else *lower_bound(all(dp), a) = a;
}
P(len(dp));
return 0;
} | 0 | 83,511,835 |
#include <iostream>
int main()
{
int N, A, B;
std::cin >> N >> A >> B;
int cnt=0;
for(int i=0; i<N+1; i++)
{
int fig_sum = i/10000 + (i-(i/10000)*10000)/1000 + (i-(i/1000)*1000)/100 + (i-(i/100)*100)/10 + (i-(i/10)*10);
if(A <= fig_sum && fig_sum <= B)
cnt+=i;
}
std::cout << cnt << std::endl;
} | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
#define INF 20000000
int N, M, R, d[200][200], r[8], ans = INT_MAX;
bool used[8];
void dfs(int cnt, int las, int dis) {
if (cnt >= R) {
if (ans > dis) ans = dis;
return;
}
for (int i=0; i<R; i++) {
if (!used[i]) {
used[i] = true;
if (las == -1) dfs(cnt+1, i, 0);
else dfs(cnt+1, i, dis + d[r[las]][r[i]]);
used[i] = false;
}
}
return ;
}
int main() {
cin >> N >> M >> R;
for (int i=0; i<R; i++) {
cin >> r[i];
r[i]--;
}
int A, B, C;
for (int i=0; i<N; i++)
for (int j=0; j<N; j++)
d[i][j] = INF;
for (int i=0; i<N; i++)
d[i][i] = 0;
for (int i=0; i<M; i++) {
cin >> A >> B >> C;
A--;
B--;
if (d[A][B] > C) d[A][B] = d[B][A] = 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]);
for (int i=0; i<R; i++)
used[i] = false;
dfs(0, -1, 0);
cout << ans << endl;
return 0;
} | 0 | 73,545,224 |
#include<iostream>
using namespace std;
int main(void){
int i;
int j;
for(i = 1;i < 10;i++){
for(j = 1;j < 10;j++){
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(true){
int n,k,max=-1e9,sum=0;
cin >> n >> k;
if(n==0) break;
int ar[n];
for(int i = 0;i<n;i++){
int a;
cin >> a;
ar[i]=a;
}
for(int i=0;i<k;i++){
sum += ar[i];
}
for(int j=0;j<n-k+1;j++){
if(sum>max) max=sum;
sum = sum + ar[k+j] - ar[j];
}
cout << max <<endl;
}
} | 0 | 54,248,732 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N , K;
cin >> N >> K;
vector<ll> P(N), C(N);
for (int i = 0; i < N; ++i) cin >> P[i], --P[i];
for (int i = 0; i < N; ++i) cin >> C[i];
vector<vector<int>> next(60, vector<int>(N));
vector<vector<ll>> val(60, vector<ll>(N)), all(60, vector<ll>(N));
for (int v = 0; v < N; ++v) {
next[0][v] = P[v];
val[0][v] = all[0][v] = C[v];
}
for (int d = 0; d + 1 < 60; ++d) {
for (int v = 0; v < N; ++v) {
next[d+1][v] = next[d][next[d][v]];
val[d+1][v] = val[d][v] + val[d][next[d][v]];
all[d+1][v] = max(all[d][v], val[d][v] + all[d][next[d][v]]);
}
}
ll res = -INF;
for (int v = 0; v < N; ++v) {
ll sum = 0;
ll offset = v;
for (int d = 59; d >= 0; --d) {
if (K & (1LL<<d)) {
res = max(res, sum + all[d][offset]);
sum += val[d][offset];
offset = next[d][offset];
}
}
}
cout << res << endl;
return 0;
} | #include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define repr(i, from) for (ll i = from - 1; i >= 0; --i)
#define all(vec) vec.begin(), vec.end()
#define unless(cond) if (!(cond))
#define fi first
#define se second
using namespace std;
typedef long long ll;
template <typename T>
using V = vector<T>;
using VL = V<ll>;
using VVL = V<VL>;
template <typename T, typename U>
using P = pair<T, U>;
using PL = P<ll, ll>;
using VPL = V<PL>;
template <typename T>
inline bool chmax(T& a, T b);
template <typename T>
inline bool chmin(T& a, T b);
void print_ints(vector<ll> v);
template <typename T>
void drop(T a);
const ll INF = 1e18;
void solve() {
ll N, M, D;
cin >> N >> M >> D;
double pair_res = D == 0 ? 1.0 / N : 2 * (N - D) / pow(N, 2);
double res = (M - 1) * pair_res;
cout << fixed << setprecision(10) << res << endl;
}
struct exit_exception : public std::exception {
const char* what() const throw() { return "Exited"; }
};
#ifndef TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
try {
solve();
} catch (exit_exception& e) {
}
return 0;
}
#endif
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print_ints(vector<ll> v) {
rep(i, v.size()) {
if (i > 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
template <typename T>
void drop(T res) {
cout << res << endl;
throw exit_exception();
} | 0 | 44,266,661 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int start = max(A, C);
int end = min(B, D);
int ans = end - start;
if (ans > 0) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int k; cin>>k;
vector<ll> lun;
priority_queue<ll, vector<ll>, greater<ll>> pq;
for (int i = 1; i < 10; ++i) pq.push(i);
while (!pq.empty()) {
if (lun.size() > k+100) break;
ll cur = pq.top(); pq.pop();
lun.push_back(cur);
ll a = cur%10;
ll nxt_p = (a+1)%10;
ll nxt_m = (a-1)%10;
ll nxt_z = a;
if (a != 9) pq.push(cur*10+nxt_p);
if (a != 0) pq.push(cur*10+nxt_m);
pq.push(cur*10+nxt_z);
}
sort(lun.begin(), lun.end());
cout << lun[k-1] << '\n';
return 0;
} | 0 | 17,728,947 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n>> m;
if(n>=2&&m>=2){
cout << n*(n-1)/2 + m*(m-1)/2;
}
else if(n==1 && m==1){
cout << 0;
}
else{
cout << max(n,m)*(max(n,m)-1)/2;
}
} | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < N; ++i) {
ll b;
cin >> b;
B.at(i) = b;
b_sum += b;
}
if (a_sum < b_sum) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
vector<bool> chage(N, false);
ll chage_num = 0;
for (ll i = 0; i < N; ++i) {
if (A.at(i) < B.at(i)) {
chage.at(i) = true;
chage_num += B.at(i) - A.at(i);
ans += 1;
}
}
vector<ll> can_chage;
for (ll i = 0; i < N; ++i) {
if (chage.at(i)) {
continue;
}
can_chage.push_back(A.at(i) - B.at(i));
}
sort(can_chage.begin(), can_chage.end());
reverse(can_chage.begin(), can_chage.end());
ll temp = 0;
for (ll i = 0; i < can_chage.size(); ++i) {
if (temp >= chage_num) {
break;
}
temp += can_chage.at(i);
ans += 1;
}
cout << ans << endl;
} | 0 | 44,404,702 |
#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, string> P;
typedef tuple<int, string, string> T;
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);
string s, t;
bool solve() {
return s == t.substr(0, (int)s.size());
}
void input() {
cin >> s >> t;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << (solve()?"Yes":"No") << endl;
} | #include<iostream>
#include<map>
using namespace std;
int main() {
int n, m;
while(cin>>n>>m &&!(n==0 && m==0)) {
map<int, int, greater<int> > myMap;
for(int i=0; i<n; i++) {
int d, p;
cin>>d>>p;
map<int, int>::iterator tmpItr;
tmpItr = myMap.find(p);
if(tmpItr == myMap.end()) {
myMap.insert(make_pair(p, d));
}
else {
myMap[tmpItr->first] += d;
}
}
for(int i=m; 0<i && !myMap.empty(); i--) {
map<int, int>::iterator itr = myMap.begin();
myMap[itr->first]--;
if(myMap[itr->first] == 0) {
myMap.erase(itr->first);
}
}
int ans = 0;
map<int, int>::iterator itr = myMap.begin();
while(itr != myMap.end()) {
ans += itr->first*itr->second;
itr++;
}
cout<<ans<<endl;
}
} | 0 | 23,449,019 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(auto &t:x) cout<<t<<" "; cout<<endl;
#define ff first
#define ss second
#define pb push_back
#define initialize(a,v) for(int i=0;i<a.size();++i) a[i]=v;
#define all(x) x.begin(),x.end()
#define mpt(mp) for(auto it=mp.begin();it!=mp.end();it++)
#define trav(x) for(int i=0;i<(int)x.size();++i)
#define mkp(a,b) make_pair(a,b)
#define sz(x) (int)x.size()
int noofdig(int N)
{
return floor(log10(N))+1;
}
ll f(ll a)
{
return 0;
}
void pre()
{
}
void solve()
{
double d,t,s;
cin>>d>>t>>s;
double time_taken=d/s;
if(time_taken<=t)
{
cout<<"Yes"<<endl;
}
else
cout<<"No"<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
{
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll H,N;cin >> H >> N;
vector<ll> A(N);
vector<ll> B(N);
ll Amax = 0;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
Amax = max(Amax,A[i]);
}
ll Ha = H + Amax + 1;
vector<vector<ll>> DP(N+1,vector<ll>(Ha,-1));
DP[0][0] = 0;
for(int i=1;i<=N;i++){
for(int j=0;j<Ha;j++){
DP[i][j] = DP[i-1][j];
if(A[i-1]<=j){
if(DP[i-1][j-A[i-1]]>=0){
if(DP[i][j]>=0){
DP[i][j] = min(DP[i][j],DP[i-1][j-A[i-1]]+B[i-1]);
}else{
DP[i][j] = DP[i-1][j-A[i-1]]+B[i-1];
}
}
if(DP[i][j-A[i-1]]>=0){
if(DP[i][j]>=0){
DP[i][j] = min(DP[i][j],DP[i][j-A[i-1]]+B[i-1]);
}else{
DP[i][j] = DP[i][j-A[i-1]]+B[i-1];
}
}
}
}
}
ll ans = -1;
for(int j=H;j<Ha;j++){
if(DP[N][j]>=0){
if(ans == -1){
ans = DP[N][j];
}else{
ans = min(ans,DP[N][j]);
}
}
}
cout << ans << endl;
} | 0 | 77,767,651 |
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 200010;
int a[N];
int n, s;
int main()
{
int n;
long long res = 0;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d",&a[i]);
int j = 0;
long long tmp = 0, sum = 0;
for(int i = 1; i <= n; i++)
{
while(j + 1 <= n && (tmp ^ a[j + 1]) == sum + a[j + 1])
{
sum += a[j + 1];
tmp ^= a[j + 1];
j++;
}
if(tmp == sum)
res += j - i + 1;
sum -= a[i];
tmp ^= a[i];
}
printf("%lld\n",res);
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int iINF = 1001001001;
const long long llINF = 1LL << 60;
ll getGCD(ll a, ll b)
{
if (b == 0) return a;
return getGCD(b, a % b);
}
int main()
{
int n, k; cin >> n >> k;
vector<int> a(n);
bool isFoundOdd = false;
rep(i, n) {
cin >> a[i];
if (a[i] % 2 == 1) isFoundOdd = true;
}
if (n == 1 && k != a[0]) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
else if (n == 1) {
cout << "POSSIBLE" << endl;
return 0;
}
sort(ALL(a));
if (a.back() < k) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
if (!isFoundOdd && k % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
ll gcd = llINF;
rep(i, n - 1) {
gcd = min(gcd, getGCD(a[i], a[i + 1]));
}
if (k % gcd != 0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
cout << "POSSIBLE" << endl;
return 0;
} | 0 | 19,872,928 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main(){
int N,H,W;
cin>>N>>H>>W;
int cnt=0;
for(int i=0;i<N;i++){
int a,b;
cin>>a>>b;
if(a>=H&&b>=W){cnt++;}
}
cout<<cnt<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x3fffffffffffffff;
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
int main(){
int n,a,b; scanf("%d%d%d",&n,&a,&b);
printf((a+b)&1?"Borys\n":"Alice\n");
return 0;
} | 0 | 57,866,046 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int,int> P;
const int inf=1000000007;
const ll mod=1000000007;
const double PI=3.14159265358979323846;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
ll gcd(ll a, ll b){
if (b==0) return a;
else return gcd(b,a%b);
}
int cans(bool f){
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
int main(){
int X,Y;
bool f = false;
cin >> X >> Y;
rep(i,X+1){
if(i*2 + (X-i)*4 == Y) f = true;
}
cans(f);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
using int64 = long;
int64 nCr(int64 n, int64 r) {
if (n <= r) return 1;
__int128 nn = 1;
__int128 rr = 1;
for (__int128 i=0; i<r; i++) {
nn *= n - i;
rr *= i+1;
}
return nn / rr;
}
void power_solve(const int& n, const int& p, const vector<int>& cnt) {
int64 ans = (1LL << cnt[0]);
int64 tmp = 0;
for (int64 i=p; i<=cnt[1]; i+=2) tmp += nCr(cnt[1], i);
ans *= tmp;
cout << ans << endl;
}
void solve(const int& n, const int& p, const vector<int>& cnt) {
if (p == 1 && cnt[1] == 0) {
cout << 0 << endl;
return;
}
if (p == 0 && cnt[0] == n) {
cout << (1LL << n) << endl;
return;
}
cout << (1LL << (n-1)) << endl;
}
int main () {
int n,p;
cin >> n >> p;
vector a(n,0);
for (int i=0; i<n; i++) cin >> a[i];
vector cnt(2,0);
for (const auto &item : a) cnt[item%2]++;
solve(n, p, cnt);
} | 0 | 54,988,431 |
#include<stdio.h>
int main(){
int i,h,data[250];
scanf("%d",&h);
for(i=0;i<h;++i) scanf("%d",&data[i]);
for(i=0;i<h;++i){
printf("node %d:",i+1);
printf(" key = %d, ",data[i]);
if(i!=0) printf("parent key = %d, ",data[(i-1)/2]);
if(i*2+1<h) printf("left key = %d, ",data[i*2+1]);
if(i*2+2<h) printf("right key = %d, ",data[i*2+2]);
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100001
vector<pi> adj[N];
int dfs_num[N], dfs_min[N];
int wh[N];
vector<int> adj2[N];
vector<vector<int>> scc;
stack<int> st;
int it;
void tarjan(int cur){
dfs_num[cur] = dfs_min[cur] = ++it;
st.push(cur);
for(auto &i: adj[cur]){
if(!dfs_num[i.e1])
tarjan(i.e1);
dfs_min[cur] = min(dfs_min[cur], dfs_min[i.e1]);
}
if(dfs_num[cur] == dfs_min[cur]){
scc.push_back({});
int cr;
do{
cr = st.top(); st.pop();
dfs_min[cr] = 0x7f7f7f7f;
wh[cr] = scc.size()-1;
scc.back().push_back(cr);
}while(cr != cur);
}
}
bool k = 1;
int dp[N];
void d1(int v, int s){
dp[v] = s;
FORR(i,adj[v]){
int ile = s+i.e2;
if(!~dp[i.e1])
d1(i.e1,ile);
else if(dp[i.e1] != ile)
k = 0;
}
}
bool vis[N];
int ls = -1;
int itt;
int tt[N];
void topo(int v){
vis[v] = 1;
FORR(i,adj[v]){
if(!vis[i.e1]) topo(i.e1);
}
tt[--itt] = v;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,m;
sc(n,m);
while(m--){
int l,r,w;
sc(l,r,w);
--l,--r;
adj[l].pb({r,w});
}
for(int i = 0; i < n; ++i){
if(!dfs_num[i]){
tarjan(i);
}
}
FORR(i,scc)
if(i.size() > 1) REE("No")
itt = n;
FOR(i,0,n){
if(!vis[i]) topo(i);
}
memset(dp,-1,n<<2);
FOR(i,0,n){
if(!~dp[tt[i]])
d1(tt[i],0);
}
cout << (k ? "Yes" : "No");
} | 0 | 3,620,771 |
#include <stdio.h>
int main(){
int n,i;
char s[100];
scanf("%d %s", &n,&s);
if(n % 2 != 0){
printf("No");
return 0;
}
for(i = 0; i < n/2; i++){
if(s[i] != s[n/2 + i]){
printf("No");
return 0;
}
}
printf("Yes");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> v[100010];
bool win = false;
int search(int curr, int prev) {
if (win) return -1;
int c = 0;
for (auto &next: v[curr]) {
if (next == prev) continue;
c += search(next, curr);
}
if (c >= 2) win = true;
return (c + 1) % 2;
}
int main() {
int n; cin >> n;
for (int i = 0; i < n-1; i++) {
int a, b; cin >> a >> b; a--; b--;
v[a].emplace_back(b);
v[b].emplace_back(a);
}
if (search(0, -1) == 1) win = true;
if (win) cout << "First" << endl;
else cout << "Second" << endl;
return 0;
} | 0 | 84,015,236 |