code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<max(c-a+b,0);
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
signed main(){
int h,w,n;
cin>>h>>w>>n;
set<pii> pos;
rep(i,n){
int x,y;
cin>>y>>x;
x--,y--;
pos.insert(pii(y,x));
}
vector<int> c(10,0);
set<pii> used;
for(auto elm : pos){
int y,x;
tie(y,x) = elm;
for(int i=-2;i<=0;i++){
for(int j=-2;j<=0;j++){
int ddy = y+i;
int ddx = x+j;
if( ddy<0 || ddx<0 || ddy+2>=h || ddx+2>=w || used.count(pii(ddy,ddx)) )continue;
used.insert(pii(ddy,ddx));
int sum = 0;
rep(ii,3){
rep(jj,3){
if(pos.count(pii(ddy+ii,ddx+jj)))sum++;
}
}
c[sum]++;
}
}
}
rep(i,c.size()){
if(i==0)cout<<(h-2)*(w-2)-used.size()<<endl;
else cout<<c[i]<<endl;
}
}
| 0 | 26,232,523 |
#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<ii> a;
int x;
int64 ret = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
a.push_back({x, 0});
ret += (int64)x * (m + 1);
}
for (int i = 0; i < m; ++i) {
scanf("%d", &x);
a.push_back({x, 1});
ret += (int64)x * (n + 1);
}
sort(a.begin(), a.end(), [](const ii x, const ii y) {
return x.first < y.first;
});
int cnt[2] = {0};
for (auto& it : a) {
int x = it.first, k = it.second;
ret -= (int64)cnt[1 - k] * x;
++cnt[k];
}
printf("%lld\n", ret);
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
rep(i, N) cin >> A[i];
long long ans = 0, digit = 0;
int right = 0;
rep(left, N) {
while (right < N && digit + A[right] == (digit ^ A[right])) {
digit += A[right];
++right;
}
ans += right - left;
if (left == right) ++right;
else digit -= A[left];
}
cout << ans << endl;
return 0;
}
| 0 | 86,841,397 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for(int i=1;i<sz;i++)cout<<" "<<a[i];cout<<endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int>pi;
typedef pair<ll,ll>pll;
const int N=100010;
vector<string>v;
string s;
bool match(int sx,int vx)
{
for(int i=0;i<v[vx].size();i++)
if(s[sx+i]!=v[vx][i])return 0;
return 1;
}
int main()
{
IOS;
v.pb("dreameraser");
v.pb("dreamerase");
v.pb("dreamer");
v.pb("dream");
v.pb("eraser");
v.pb("erase");
int i=0;
cin>>s;
int l=s.length();
while(i<l)
{
bool f=0;
for(int j=0;j<v.size();j++)
{
if(match(i,j))
{
f=1;
i+=v[j].size();
break;
}
}
if(f==0)break;
}
if(i==l)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i] = min(a[i], k);
}
sort(a.begin(), a.end());
int l = 0,r = n;
while (l < r) {
int mid = (l + r) / 2;
bitset<5005> b;
b[0] = 1;
for (int j = 0; j < n; ++j) {
if (j == mid) continue;
b |= (b << a[j]);
}
bool req = 0;
for (int j = 0; j < k; ++j) {
if (b[j] && j + a[mid] >= k) req = 1;
}
if (req) r = mid;
else l = mid + 1;
}
cout << l << '\n';
}
| 0 | 98,217,653 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int a[5];
for(int i = 0;i<5;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+5);
reverse(a,a+5);
for(int i = 0;i < 5;i++)
{
printf("%d",a[i]);
if(i <= 3) printf(" ");
}
printf("\n");
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
double x1,y1,x2,y2,x3,y3,x4,y4;
int n;
cin >> n;
for(int i=0;i<n;i++){
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
x2-=x1; y2-=y1;
x4-=x3; y4-=y3;
if(x2*y4-y2*x4==0) printf("YES\n");
else printf("NO\n");
}
return 0;
}
| 0 | 99,756,848 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define LB lower_bound
#define UB upper_bound
#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 LL INF = 1e9;
const LL MOD = 1e9+7;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define FI first
#define SE second
int main() {
int A,B,C;
cin >> A >> B >> C;
if(A+B >= C) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9 * 2;
double eps = 1e-10;
int main() {
string s, t(""), ans_c(""), ans_s("");
map<string, int> cnt;
getline(cin, s);
for(int i = 0; i < s.size(); ++i){
if(s[i] == ' '){
cnt[t]++;
if(ans_s.length() < t.length())
ans_s = t;
t = "";
}
else{
t += s[i];
}
}
if(ans_s.length() < t.length())
ans_s = t;
int maxim = 0;
for(auto it = cnt.begin(); it != cnt.end(); ++it){
if(maxim < (*it).second){
maxim = (*it).second;
ans_c = (*it).first;
}
}
cout << ans_c << " " << ans_s << endl;
return 0;
}
| 0 | 80,972,163 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
string s;
cin>>s;
int ans=0;
for(i=0;i<s.length();){
cerr<<"i:"<<i<<endl;
if((s[i]=='0'&&s[i+1]=='1')||(s[i]=='1'&&s[i+1]=='0')){
s.erase(s.begin()+i);
s.erase(s.begin()+i);
if(i!=0)i--;
ans+=2;
}else{
i++;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin>>s>>t;
int start;
for(int i=s.size()-1;i>=0;i--){
string u=s.substr(i,t.size());
if(t.size()!=u.size())continue;
bool flag=true;
for(int j=0;j<t.size();j++){
if(t[j]!=u[j]&&u[j]!='?'){
flag=false;
break;
}
}
if(flag){
for(int j=0;j<u.size();i++,j++){
s[i]=t[j];
}
rep(j,s.size()){
if(s[j]=='?')s[j]='a';
}
cout<<s<<endl;
return 0;
}
}
cout<<"UNRESTORABLE"<<endl;
return 0;
}
| 0 | 92,930,324 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> indexed_multiset;
int n ;
long long ans;
vector<int>b,a,ab;
bool vis[10004];
int main(){
cin>>n;
for(int i = 0; i < n ; i++){
string s ;cin>>s;
for(int j = 1 ; j<(int)s.size() ;j++){
if(s[j]=='B'&& s[j-1]=='A'){
ans++;
}
}
if(s[0]=='B' &&s[(int)s.size() - 1]=='A')
ab.push_back(i);
else if(s[0]=='B')b.push_back(i);
else if(s[(int)s.size() - 1] == 'A')a.push_back(i);
}
int aa = a.size() , bb = b.size() , aabb = ab.size();
if(aa){
aa--;
while(aabb){
aabb--;
ans++;
}
if(bb){
bb--;
ans++;
}
while(aa&&bb){
aa--;bb--;
ans++;
}
}else{
if(aabb){
ans+=(aabb-1);
if(bb)ans++;
}
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
#define F first
#define S second
#define REP(i, a, b, c) for(int i = a; i <= b; i+=c)
#define pb push_back
#define int long long int
#define MOD 1000000007
using namespace std;
vector<int> tree[100001];
int dp[100001][2];
int solve(int u, bool constr, int pr)
{
if (dp[u][constr] != -1)
return dp[u][constr];
int ans = 0;
int w1 = 1;
for (int child : tree[u]) {
if (child != pr)
{
w1 = (w1 * solve(child, 0, u)) % MOD;
}
}
ans = (ans + w1) % MOD;
if (!constr)
{
int w2 = 1;
for (int child : tree[u]) {
if (child != pr)
{
w2 = (w2 * solve(child, 1, u)) % MOD;
}
}
ans = (ans + w2) % MOD;
}
return dp[u][constr] = ans;
}
int32_t main()
{
ios :: sync_with_stdio(false); cin.tie(0);
int t = 1;
for (int i9 = 1; i9 <= t; i9++)
{
int n;
cin >> n;
n--;
memset(dp, -1, sizeof(dp));
while (n--)
{
int x, y;
cin >> x >> y;
tree[x].pb(y);
tree[y].pb(x);
}
cout << solve(1, 0, -1);
}
}
| 0 | 82,021,679 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
REP(i,n-1) {
ans *= (k-1);
}
cout << ans << endl;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll i,fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=0,i=0;while(n/10>0){i++;d++;}return d;}
llfor;ll ans=0;
int main(){
char s[30];
cin>>s;
ll n=strlen(s);
map<char,ll>map;
if(n!=26){
rep(i,0,n){
map[s[i]]++;
}
cout<<s;
rep(i,0,26){
if(map[i+'a']==0){
char c='a'+i;
cout<<c<<endl;
return 0;
}
}
}
char t[30]="zyxwvutsrqponmlkjihgfedcba";
if(!strcmp(s,t)){
char c[5]="-1";
pr(c);
return 0;
}
ll k=0,m;
rrp(i,n,0){
map[s[i]]++;
ll mx=s[i]-'a';
rep(j,mx+1,26){
if(map['a'+j]!=0){
s[i]='a'+j;
rep(k,0,i+1){
cout<<s[k];
}
pnn;return 0;
}
}
}
return 0;}
| 0 | 21,456,446 |
#include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>
#include <numeric>
#include <iomanip>
#include <cstring>
using namespace std;
using ll=long long;
#define FOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(),(a).end()
#include <iostream>
#include <cmath>
using namespace std;
bool isPrimeNum( ll x ){
if( x <= 1 ){
return false;
}
int n = (int)sqrt( (double)x );
for( int i = 2; i <= n; i++ ){
if( x % i == 0 ){
return false;
}
}
return true;
}
ll myPow(ll x, ll n, ll m){
if(n == 0)
return 1;
if(n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
constexpr ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll abs(ll a,ll b){
if(a>=b)return a-b;
if(a<b)return b-a;
}
constexpr double dabs(double a,double b){
if(a>=b)return a-b;
if(a<b)return b-a;
}
constexpr ll min(ll a,ll b){
if(a>=b)return b;
if(a<b)return a;
}
constexpr ll max(ll a,ll b){
if(a>=b)return a;
if(a<b)return b;
}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
int root(int A) {
if (Parent[A] < 0) return A;
return Parent[A] = root(Parent[A]);
}
int size(int A) {
return -Parent[root(A)];
}
bool connect(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;
}
};
long long fac[510000], finv[510000], inv[510000];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if(flag){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return;
}
void YN(bool flag) {
if(flag){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return;
}
std::vector<int> enum_div(int n)
{
std::vector<int> ret;
for(int i=1 ; i*i<=n ; ++i)
{
if(n%i == 0)
{
ret.push_back(i);
if(i!=1 && i*i!=n)
{
ret.push_back(n/i);
}
}
}
ret.push_back(n);
return ret;
}
void Ssort(int no, char *month[]){
int i, j;
char *temp;
for(i=0; i<no; i++){
for(j=i+1; j<no; j++){
if(strcmp((month[i]),(month[j]))>0){
temp = *(month+i);
*(month+i) = *(month+j);
*(month+j) = temp;
}
}
}
}
using namespace std;
struct Edge {
ll to;
ll weight;
Edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<Edge>>;
int main() {
ll n, Z,W;
cin>>n>>Z>>W;
ll x[n];
FOR(i,0,n-1){
cin>>x[i];
}
if(n==1){
cout<<max( abs(x[n-1],W) ,0)<<endl;
}else{
cout<<max( abs(x[n-1],W) , abs(x[n-2],x[n-1]))<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod = MOD7;
void ERROR(int num) { cout << "ERROR" << num << endl; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
rep(i,N) cin >> a[i] >> b[i] >> c[i];
vector<vector<int>> dp(N+5,vector<int>(3));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for(int i = 1; i < N; i++){
dp[i][0] = max(dp[i-1][1]+a[i], dp[i-1][2]+a[i]);
dp[i][1] = max(dp[i-1][0]+b[i], dp[i-1][2]+b[i]);
dp[i][2] = max(dp[i-1][0]+c[i], dp[i-1][1]+c[i]);
}
cout << max(dp[N-1][0], max(dp[N-1][1], dp[N-1][2])) << endl;
}
| 0 | 97,129,356 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
string s;
char b[26]={};
int a[26]={};
int j;
for(int l=0; l<26; l++){
b[l]='a'+l;
}
while(getline(cin, s)){
for(int i=0; i<s.size(); i++){
if(s[i]>='A'&&s[i]<='Z'){
s[i]=s[i]-'A'+'a';
}
j=s[i]-'a';
a[j]++;
}
}
for(int k=0; k<26; k++){
cout<<b[k]<<" "<<':'<<" "<<a[k]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
if(A%3==0||B%3==0 || (A+B)%3==0){
cout<<"Possible"<<endl;
}else{
cout << "Impossible" << endl;
}
return 0;
}
| 0 | 6,892,048 |
#include <iostream>
#include <string>
using namespace std;
int main() {
char left[15] = {'q', 'a', 'z', 'w', 's', 'x', 'e', 'd', 'c', 'r',
'f', 'v', 't', 'g', 'b'};
char right[11] = {'y', 'h', 'n', 'u', 'j', 'm', 'i', 'k', 'o', 'l', 'p'};
while (true) {
string s;
cin >> s;
if (s[0] == '#') return 0;
int t[s.size()] = {0};
for (int i = 0; i < 11; i++) {
if (s[0] == right[i]) {
t[0] = 1;
break;
}
}
for (int i = 1; i < s.size(); i++) {
for (int j = 0; j < 11; j++) {
if (s[i] == right[j]) {
t[i] = 1;
break;
}
}
}
int count = 0;
for (int i = 0; i < s.size() - 1; i++)
if (t[i] != t[i+1]) count++;
cout << count << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> data.at(i).at(j);
}
}
vector<int> row;
vector<int> col;
for (int i = 0; i < H; i++) {
bool flag = true;
for (int j = 0; j < W; j++)
{
if( data.at(i).at(j) == '#' )
{
flag = false;
}
}
if (flag == true)
{
row.push_back(i);
}
}
for (int i = 0; i < W; i++) {
bool flag = true;
for (int j = 0; j < H; j++)
{
if( data.at(j).at(i) == '#' )
{
flag = false;
}
}
if (flag == true)
{
col.push_back(i);
}
}
for (int i = 0; i < H; i++)
{
bool flag = false;
for (int x: row)
{
if(x == i)
{
flag = true;
break;
}
}
if (flag == true)
{
continue;
}
for (int j = 0; j < W; j++)
{
flag = false;
for (int x: col)
{
if(x == j)
{
flag = true;
break;
}
}
if(flag == false)
{
cout << data.at(i).at(j);
}
}
cout << endl;
}
}
| 0 | 69,934,193 |
#include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define next nxt
int n,x[N],y[N],next[N],p[N],f[N];
int travel(int x){
int ans=0;
for (int t=p[x];t;t=next[t])
if (y[t]!=f[x])
f[y[t]]=x,ans+=travel(y[t]);
return ans^1;
}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=read();
for (int i=1;i<=n-1;i++){
x[2*i-1]=y[2*i]=read();
y[2*i-1]=x[2*i]=read();
next[2*i-1]=p[x[2*i-1]];p[x[2*i-1]]=2*i-1;
next[2*i]=p[x[2*i]];p[x[2*i]]=2*i;
}
printf(travel(1)?"First\n":"Second\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;
int main(){
int A,B;cin>>A>>B;
vector<vector<char>> S(100,vector<char>(100,'.'));
for(int i=50;i<100;i++){
for(int j=0;j<100;j++){
S[i][j]='#';
}
}
A--;B--;
for(int i=0;i<=(B-1)/50;i++){
if(i!=(B-1)/50){
for(int j=0;j<50;j++){
S[2*i][2*j]='#';
}
}else{
for(int j=0;j<(B-1)%50+1;j++){
S[2*i][2*j]='#';
}
}
}
for(int i=0;i<=(A-1)/50;i++){
if(i!=(A-1)/50){
for(int j=0;j<50;j++){
S[2*i+55][2*j]='.';
}
}else{
for(int j=0;j<(A-1)%50+1;j++){
S[2*i+55][2*j]='.';
}
}
}
cout<<100<<" "<<100<<endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
cout<<S[i][j];
}
cout<<endl;
}
}
| 0 | 60,538,377 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100005;
int n,size[N],fa[N];
map<ll,int> mp;
struct node{int id;ll dis;}p[N];
bool cmp(const node &A,const node &B){return A.dis>B.dis;}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%lld",&p[i].dis),p[i].id=i,mp[p[i].dis]=i;
sort(p+1,p+n+1,cmp);
for (int i=1;i<n;i++)
{
size[p[i].id]++;
ll fa_Di=p[i].dis-n+2*size[p[i].id];
if (!mp.count(fa_Di)) return puts("-1"),0;else fa[p[i].id]=mp[fa_Di];
if (fa[p[i].id]==p[i].id) return puts("-1"),0;
size[fa[p[i].id]]+=size[p[i].id];
}
for (int i=1;i<n;i++) p[n].dis-=size[p[i].id];
if (p[n].dis) return puts("-1"),0;
for (int i=1;i<=n;i++)
if (fa[i]) printf("%d %d\n",i,fa[i]);
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 998244353
#define INF2 1000000000000000000
#define int long long
int Mul(int a, int b) {
return ((a % mod) * (b % mod)) % mod;
}
int square(int x) {
return (x * x) % mod;
}
int power(int x, int y) {
if (y == 0) return 1;
else if (y == 1) return x % mod;
else if (y % 2 == 0) return square(power(x, y / 2)) % mod;
else return square(power(x, y / 2)) * x % mod;
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int cnt[100010] = {};
int k = 0;
rep(i, N) {
int d; cin >> d;
if((i == 0 && d != 0) || (i != 0 && d == 0)) {
cout << 0 << endl;
return 0;
}
cnt[d]++;
k = max(k, d);
}
int ans = 1;
rep(i, k) {
ans = Mul(ans, power(cnt[i], cnt[i + 1]));
}
cout << ans << endl;
return 0;
}
| 0 | 78,700,392 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define no {cout << -1; return;}
void solve() {
int a, p;
cin >> a >> p;
cout << (a * 3 + p) / 2;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
const ll MOD = 998244353;
const ll INF = 1e18;
using namespace std;
main(){
#ifdef XOX
freopen("D:\\V S Code\\cpp\\competitiveProgramming\\Input.txt", "r", stdin);
freopen("D:\\V S Code\\cpp\\competitiveProgramming\\OPT.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll d = 0, s = 0;
ll u, v;
for(int i = 0; i < n; i++){
cin >> u >> v;
d += v, s += u*v;
}
cout << d - 1ll + ((s - 1) / 9ll);
}
| 0 | 92,791,361 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
int main() {
int n;
bool f = 1;
cin >> n;
vector<string>s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
}
for (int i = 0; i < n-1; i++) {
if (s.at(i)[s[i].size() - 1] != s.at(i + 1)[0])f = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i!=j&&s.at(i) == s.at(j))f = 0;
}
}
if (f == 1)cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
Graph G;
vector<int> points;
vector<int> ans;
void dfs(int v, int sum, int p) {
ans[v] = sum + points[v];
for (auto nv : G[v]) {
if (nv == p) continue;
dfs(nv, ans[v], v);
}
return;
}
int main() {
int N, Q;
cin >> N >> Q;
G.resize(N);
rep(i, N-1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].push_back(b);
G[b].push_back(a);
}
points.resize(N, 0);
while (Q--) {
int p, x;
cin >> p >> x;
p--;
points[p] += x;
}
ans.resize(N, 0);
dfs(0, 0, -1);
for (auto a : ans) cout << a << endl;
}
| 0 | 14,875,298 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main() {
int n;
cin>>n;
ll ans=0;
int amari=-5;
rep(i,n){
ll x;
cin>>x;
if(x>0 && amari+1==i) {
ans++;
x--;
}
ans+=x/2;
if(x%2==1) amari=i;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int height[10];
for (int i = 0; i < 10; i++) {
cin>>height[i];
}
for (int i = 0; i < 10; i++) {
for (int j = i; j < 10; j++) {
int max = height[i];
int c = i;
if (height[j] > max) {
max = height[j];
c = j;
}
int temp;
temp = height[c];
height[c] = height[i];
height[i] = temp;
}
}
cout<<height[0]<<endl;
cout<<height[1]<<endl;
cout<<height[2]<<endl;
return 0;
}
| 0 | 69,213,029 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n,s,i,j,a,b,c=0;;
cin>>n>>s;
if(n==0&&s==0)break;
for(i=0;i<(1<<10);i++){
a=0;b=0;
for(j=0;j<=9;j++){
if((i>>j)&1!=0){
a+=j;b++;
}
}
if(a==s&&b==n){
c++;
}
}
cout<<c<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int md;
int add(int x, int y) {
x += y;
if (x >= md) {
x -= md;
}
return x;
}
int mul(int x, int y) {
return (int)((long long)x * y % md);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n >> md;
string s;
cin >> s;
map<int, int> m;
long long ans = 0;
int dec = 1;
int cur = 0;
if (md == 2) {
long long cnt = 0;
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
if (dig % 2 == 0) {
cnt++;
}
ans += cnt;
}
cout << ans << '\n';
return 0;
}
if (md == 5) {
long long cnt = 0;
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
if (dig % 5 == 0) {
cnt++;
}
ans += cnt;
}
cout << ans << '\n';
return 0;
}
for (int i = n - 1; i >= 0; i--) {
int dig = (s[i] - '0');
cur = add(cur, mul(dec, dig));
if (cur == 0) ans++;
ans += m[cur];
m[cur]++;
dec = mul(dec, 10);
}
cout << ans << '\n';
return 0;
}
| 0 | 22,784,785 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
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> P;
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 REVERSE(c) reverse((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 long long INF = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(void){
int N; cin >> N;
cout << N/3 << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i< N; i++) cin >> A[i];
map<long long, long long> m;
m[A[0]]++;
m[0]++;
for(int i = 1; i < N; i++){
A[i] += A[i - 1];
m[A[i]]++;
}
long long ans = 0;
for(auto v: m){
ans += v.second*(v.second - 1) / 2;
}
cout << ans << endl;
}
| 0 | 53,195,085 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int main(){
int n; cin>>n;
ll sum=0;
for(int i=1; i<=1e7; i++){
sum+=i;
if(n<sum){
for(int j=1; j<=i; j++){
if(j==sum-n) continue;
cout << j << endl;
}
return 0;
}
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1)
{
cin >> mon[i];
}
vector<int> hero(N);
rep(i, N)
{
cin >> hero[i];
}
long long defeat = 0;
rep(i, N)
{
if (hero[i] > mon[i])
{
defeat += mon[i];
int diff = hero[i] - mon[i];
defeat += std::min(diff, mon[i + 1]);
mon[i + 1] = std::max(0, mon[i + 1] - diff);
}
else
{
defeat += hero[i];
}
}
cout << defeat << endl;
return 0;
}
| 0 | 95,085,800 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " " << (x + x == w && y + y == h) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, H;
cin >> N >> H;
vector<int> a(N),b(N);
for (int i=0;i<N;i++) cin >> a[i] >> b[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
int ans = INF;
for (int i=0;i<=N;i++){
if (i > 0) H-=b[i-1];
int cnt = 0;
if (H > 0) cnt = (H+a[0]-1)/a[0];
ans = min(ans, i+cnt);
}
cout << ans << "\n";
}
| 0 | 52,038,837 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intput(i) cout << i << endl
#define ll long long
#define stringput(s) cout << (string)(s) << endl
int main(){
int N;
cin >> N;
if(N < 1200) cout << "ABC" << endl;
else if(1199 < N && N < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
char buf[2];
scanf("%s",buf);
if(buf[0] == 'a' || buf[0] == 'i' || buf[0] == 'u' || buf[0] == 'e' || buf[0] == 'o'){
printf("vowel\n");
}else{
printf("consonant\n");
}
return 0;
}
| 0 | 52,221,600 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
char b;
cin >> b;
if (b == 'A') {
cout << "T" << endl;
}
else if (b == 'T') {
cout << "A" << endl;
}
else if (b == 'G') {
cout << "C" << endl;
}
else if (b == 'C') {
cout << "G" << endl;
}
}
|
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <string>
#include <map>
using namespace std;
int ChangeTimesFormat(string str){
int h = atoi(str.substr(0,2).c_str());
int m = atoi(str.substr(3,2).c_str());
int s = atoi(str.substr(6,2).c_str());
int time = h*60*60+m*60+s;
return time;
}
int main(){
int n;
while(cin>>n&&n!=0){
map<int,pair<int,int> > m;
for(int i = 0; i < n; i++){
string from;
string to;
cin>>from>>to;
int ft=ChangeTimesFormat(from);
int tt=ChangeTimesFormat(to);
m[ft].first++;
m[tt].second++;
}
int maxLine=0;
int cnt=0;
for(map<int,pair<int,int> >::iterator it = m.begin(); it!=m.end(); it++){
cnt+=it->second.second;
if(cnt<it->second.first){
maxLine+=it->second.first-cnt;
cnt=0;
}
else{
cnt-=it->second.first;
}
}
cout<<maxLine<<endl;
}
return 0;
}
| 0 | 19,231,464 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 500005
#define INF INT_MAX
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define PF push_front
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
#define mod 1000000007
int main()
{
FAST;
int n; int a, b;
cin >> n >> a >> b;
for(int i = a; i <= b; i ++){
if(i % n == 0 ){
cout << "OK";
return 0;
}
}
cout << "NG";
}
|
#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 n;
vector<int> a;
void update(int i, int x);
int query(int x, int y, int k, int l, int r);
int main(){
int h, w, m, colmax=0;
cin >> h >> w >> m;
n = w;
rep(i, 30) {
if ((n - 1) < 1 << i) {
n = 1 << i;
break;
}
}
rep(i, 2 * n - 1) { a.push_back(0); }
vector<int> col(h, 0), row(w, 0);
vector<int> tmph;
vector<vector<int>> collist(h, tmph);
rep(i, m){
int x, y;
cin >> x >> y;
col[x-1]++;
row[y-1]++;
colmax = max(colmax, col[x-1]);
collist[x-1].push_back(y-1);
}
vector<int> cind;
vector<vector<int>> cmax;
rep(i, h){
if(col[i]==colmax){
cind.push_back(i);
cmax.push_back(collist[i]);
}
}
rep(i, w){
update(i, row[i]);
}
int clen=cmax.size(), res=0;
rep(i, clen){
int clislen = cmax[i].size();
rep(j, clislen){
update(cmax[i][j], row[cmax[i][j]]-1);
}
res = max(res, query(0, n, 0, 0, n));
rep(j, clislen) {
update(cmax[i][j], row[cmax[i][j]]);
}
}
cout << colmax + res << endl;
return 0;
}
void update(int i, int x) {
i += n - 1;
a[i] = x;
while (i > 0) {
i = (i - 1) / 2;
a[i] = max(a[i * 2 + 1], a[i * 2 + 2]);
}
}
int query(int x, int y, int k, int l, int r) {
if (r <= x || y <= l) return 0;
if (x <= l && r <= y)
return a[k];
else {
int vl = query(x, y, k * 2 + 1, l, (l + r) / 2);
int vr = query(x, y, k * 2 + 2, (l + r) / 2, r);
return max(vl, vr);
}
}
| 0 | 77,057,058 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int dp[1000000];
string S;
int main() {
cin >> S; dp[0] = 1;
for (int i = 0; i < S.size(); i++) {
if (dp[i] == 0)continue;
if (i + 5 <= S.size() && S.substr(i, 5) == "dream")dp[i + 5] = 1;
if (i + 7 <= S.size() && S.substr(i, 7) == "dreamer")dp[i + 7] = 1;
if (i + 5 <= S.size() && S.substr(i, 5) == "erase")dp[i + 5] = 1;
if (i + 6 <= S.size() && S.substr(i, 6) == "eraser")dp[i + 6] = 1;
}
if (dp[S.size()] == 1)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<utility>
using namespace std;
int main(){
int V, E;
cin >> V >> E;
vector<pair<int, int> > edge(E);
for (int i = 0; i < E; i++) {
cin >> edge[i].first >> edge[i].second;
}
vector<int> ans;
vector<int> state(V, 1);
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
if (state[i] != 2) state[i] = 1;
}
for (int i = 0; i < edge.size(); i++) {
state[edge[i].second] = 0;
}
for (int i = 0; i < V; i++) {
if (state[i] == 1) {
ans.push_back(i);
state[i] = 2;
for (int j = 0; j < edge.size(); j++) {
if (edge[j].first == i) {
edge.erase(edge.begin() + j);
j--;
}
}
break;
}
}
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
return 0;
}
| 0 | 58,897,190 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define rep1(i,n) for (int i=1; i<=(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fst first
#define scd second
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
map<string,int> ms;
cin >> n;
rep(i,n) { string s; cin >> s; ms[s]++; }
cin >> m;
rep(i,m) { string s; cin >> s; ms[s]--; }
int ans = 0;
for (auto p : ms) {
ans = max(ans, p.scd);
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int a[100009], b[100009];
int main(){
int n, k, mask;
scanf("%d %d",&n, &k);
for(int i = 0; i < n; i++){
scanf("%d %d", a+i, b+i);
}
k++;
long long ans = 0;
for(int bit = 30; bit >= 0; bit--){
if((k >> bit) & 1){
mask = k ^ (1<<bit);
mask |= (1<<bit) - 1;
long long cur = 0;
for(int i = 0; i < n; i++){
if((a[i] & mask) == a[i]){
cur += b[i];
}
}
ans = max(ans, cur);
}
}
printf("%lld\n", ans);
return 0;
}
| 0 | 13,010,192 |
#include <iostream>
using namespace std;
int main(){
int money = 100000;
int n;
cin >> n;
while (n--)
{
money *= 1.05;
if (money % 1000 != 0)
{
money += 1000 - (money % 1000);
}
}
cout << money << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n = 0, v = 0;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
int s[5][4][11] = {0};
cin >> n;
for (int i = 0; i < n; i++){
cin >> a >> b >> c >> d;
s[a][b][c] = s[a][b][c] + d;
}
for (int j = 1; j <= 4; j++){
for (int k = 1; k <= 3; k++){
for (int l = 1; l <= 10; l++){
cout << " ";
cout << s[j][k][l];
}
cout << endl;
}
if (j != 4){
for (int nj = 0; nj < 20; nj++){
cout << "#";
}
cout << endl;
}
}
return 0;
}
| 0 | 1,531,116 |
#pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
const int dx[4]={ 1,0,-1,0 };
const int dy[4]={ 0,1,0,-1 };
int a, b;
signed main(){
cin >> a >> b;
if(a+b == 15) cout << "+" << endl;
else if(a*b == 15) cout << "*" << endl;
else cout << "x" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++){
int x;
cin >> x;
A.at(i) = x - i - 1;
}
sort(A.begin(), A.end());
int b = A.at(N / 2);
int64_t ans = 0;
for (int i = 0; i < N; i++){
ans += abs(b - A.at(i));
}
cout << ans << endl;
}
| 0 | 20,762,400 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
string S;
cin >> S;
int ans =1;
int f = S[0];
for (int i = 0; i < n; ++i)
{
if (S[i] != f)
++ans;
f = S[i];
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long power(long long a, long long b,long long m) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a %m;
a = a * a %m;
b >>= 1;
}
return res;
}
int pp[50];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
pp[0]=1;
for(int i=1;i<=35;i++)
pp[i]=(pp[i-1]*2);
int n,k;
cin>>n>>k;
int a[n],b[n];
for(int i=0;i<n;i++)
cin>>a[i]>>b[i];
int mx=0;
for(int j=0;j<n;j++)
{
if((k&a[j])==a[j])
mx+=b[j];
}
for(int i=0;i<31;i++)
{
if(k&(pp[i]))
{
int tot=0;
for(int j=0;j<n;j++)
{
int z=(k&a[j]);
z=a[j]-z;
if(z<pp[i] && (a[j]&pp[i])==0)
{
tot+=b[j];
}
}
mx=max(mx,tot);
}
}
cout<<mx;
}
| 0 | 78,867,308 |
#include<bits/stdc++.h>
using namespace std ;
#define endl '\n'
string make(string s,int k)
{
string ans="";
for(int i=0;i<k;i++)
ans+=s;
return ans;
}
int32_t main()
{
string s;
cin>>s;
int n=s.size();
if(n==1){
cout<<'0';return 0;
}
string f,se;
if(n&1){
f=make("01",n/2)+"0";
se=make("10",n/2)+"1";
}
else{
f=make("01",n/2);
se=make("10",n/2);
}
int cnt1=0,cnt2=0;
for(int i=0;i<n;i++)
{
if(s[i]!=f[i])
cnt1++;
else
cnt2++;
}
cout<<min(cnt1,cnt2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for(int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
void in(){}
template<typename F, typename... R>
bool in(F& f, R&... r){
if(cin >> f){in(r...);return true;}
else return false;
}
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
void print(){}
template<typename F, typename... R>
void print(F f, R... r){out(f), indent(), print(r...);}
#define debughead(x) cerr << "Line " << __LINE__ << ": " << #x << ": "
#define debugout(x) cerr << (x) << " "
#define debugindent() cerr << '\n'
#define debug(x) debughead(x), debugout(x), debugindent()
const int INF = 1e18, MOD = 1e9 + 7;
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;}
main(){
INCANT;
int n, k, tmp, tmp2, res = -INF;
string s;
in(n, k);
int a[n + 1] = {}, sum[n + 1] = {}, psum[n + 1] = {};
rep(i, 1, n + 1){
in(a[i]);
sum[i] = sum[i - 1] + a[i];
psum[i] = psum[i - 1] + max(0LL, a[i]);
}
rep(i, k, n + 1){
tmp = sum[i] - sum[i - k];
tmp2 = psum[n] - psum[i] + psum[i - k];
chmax(res, max(0LL, tmp) + tmp2);
}
print(res);
}
| 0 | 57,856,579 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
mp[0] = 1;
long long ans = 0;
int sum = 0;
rep(i,n) {
(sum += a[i]) %= m;
ans += mp[sum] ++ ;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
bool flag = true;
int n,tong[maxn],maxx,minn;
int main()
{
scanf("%d",&n);
minn = n;
for (int i = 1; i <= n; i++)
{
int x;
scanf("%d",&x);
tong[x]++;
maxx = max(maxx,x);
}
if (tong[maxx] <= 1)
flag = false;
tong[maxx] -= 2;
for (int i = 2; i <= maxx; i++)
{
int temp = max(i - 1,maxx - i + 1);
minn = min(minn,temp + 1);
if (!tong[temp])
flag = false;
tong[temp]--;
}
for (int i = 1; i < minn; i++)
if (tong[i])
flag = false;
if (flag)
puts("Possible");
else
puts("Impossible");
return 0;
}
| 0 | 17,875,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
long h, w, k;
cin >> h >> w >> k;
vector<vector<char>> corg(h, vector<char>(w));
for (long i = 0; i < h; i++) {
for (long j = 0; j < w; j++) {
char tmp;
cin >> tmp;
corg.at(i).at(j) = tmp;
}
}
long n = h + w;
long ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
vector<vector<char>> c(h, vector<char>(w));
for (long row = 0; row < h; row++) {
for (long col = 0; col < w; col++) {
c.at(row).at(col) = corg.at(row).at(col);
}
}
for (int i = 0; i < n; ++i) {
if (bit & (1 << i)) {
if (i < h) {
c.at(i) = vector<char>(w, 'r');
} else {
for (long ii = 0; ii < h; ii++) {
c.at(ii).at(i - h) = 'r';
}
}
}
}
long count = 0;
for (long ii = 0; ii < h; ii++) {
for (long jj = 0; jj < w; jj++) {
if (c.at(ii).at(jj) == '#') {
count++;
}
}
}
if (count == k) {
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int ans = 0;
for (int i = 0; i < sz(t); i++) {
ans += s[i] != t[i];
}
cout << ans << '\n';
}
| 0 | 41,564,623 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
int days(int y,int m,int d){
int res=0;
res += (y-1)*195 + ((y-1)/3)*5;
if(y%3==0) res += (m-1)*20;
else res += (m-1)*20 - ((m-1)/2);
res += d-1;
return res;
}
int main(){
int n;
cin >> n;
int mill = days(1000,1,1);
rep(i,n){
int y,m,d;
scanf("%d %d %d", &y, &m, &d);
printf("%d\n", mill - days(y,m,d));
}
}
|
#include <iostream>
using namespace std;
int main() {
string S;
string S_tmp_5 = "";
string S_tmp_6 = "";
string S_tmp_7 = "";
cin >> S;
do {
if (S.size() == 5 || S.size() == 6|| S.size() == 7){
if(S == "dream" || S == "erase" || S == "eraser" || S == "dreamer"){
cout << "YES" << endl;
return 0;
}else{
cout << "NO" << endl;
return 0;
}
}
S_tmp_5 = S.substr(S.size() - 5, 5);
S_tmp_6 = S.substr(S.size() - 6, 6);
S_tmp_7 = S.substr(S.size() - 7, 7);
if (S_tmp_5 == "dream" || S_tmp_5 == "erase"){
S = S.substr(0, S.size() - 5);
if(S.size() == 0){
cout << "YES" << endl;
return 0;
}
}
else if (S_tmp_6 == "eraser" ){
S = S.substr(0, S.size() - 6);
if(S.size() == 0){
cout << "YES" << endl;
return 0;
}
}
else if (S_tmp_7 == "dreamer" ){
S = S.substr(0, S.size() - 7);
if(S.size() == 0){
cout << "YES" << endl;
return 0;
}
}
else{
cout << "NO" << endl;
return 0;
}
}while (true);
return 0;
}
| 0 | 73,792,386 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {return (!b ? a : gcd(b, a % b));}
bool cmp(int a,int b){return a>b;}
const ll mod = 1e9 + 7;
const int INF32 = 1<<30;
const ll INF64 = 1LL<<60;
const ld pi = 3.141592653589793;
const int N = 5e5 + 10;
void solve(){
int n;cin >> n;
vector<string>s(n);
for(int i = 0;i<n;i++) cin >> s[i];
for(int i = 0;i<n-1;i++)
for(int j = i+1;j<n;j++){
if(s[i]==s[j]) {cout << "No";return;}
}
for(int i = 0;i<n-1;i++){
char c = s[i][s[i].size()-1];
if(s[i+1][0]!=c){cout <<"No";return;}
}
cout << "Yes";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
solve();
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int A, B,N;
int sum,ans = 0;;
int cur =10;
cin >> N >> A >> B;
for(int i = 1;i <= N;i++){
sum = 0;
cur = i;
while(cur > 0){
sum += cur%10;
cur /= 10;
}
if( A <= sum && sum <= B)
ans += i;
}
cout << ans << endl;
return 0;
}
| 0 | 62,298,148 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
int main(){
double a, b, C;
cin >> a >> b >> C;
double S, L, h;
S = a * b * sin(PI*C/180) * 0.5;
L = a + b + sqrt(a*a + b*b - 2 * a * b * cos(PI*C/180));
h = 2 * S / a;
printf("%.04lf\n", S);
printf("%.04lf\n", L);
printf("%.04lf\n", h);
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>
using namespace std;
#define DEBUG_
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template <typename T>
std::string printVector(const std::vector<T> &data)
{
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
signed main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
VI p(N);
REP(i,N) cin >> p[i];
VI a(N);
a[0] = 1;
REP(i,N){
a[i] = a[i-1] + 20002;
}
VI b = a;
reverse(b.begin(),b.end());
REP(i,N){
a[p[i]-1] += i;
}
REP(i,N) cout << a[i] << " ";
cout << endl;
REP(i,N) cout << b[i] << " ";
cout << endl;
}
| 0 | 91,431,468 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
vi a({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]<<endl;
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = (int)1e7 + 7;
ll sum[MAX_N];
bool visit[MAX_N];
int main()
{
memset(sum, 0LL, sizeof(sum));
memset(visit, false, sizeof(visit));
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 1; i < MAX_N; ++i){
sum[i] = sum[i-1] + (ll)i;
}
ll N; cin >> N;
vector<ll> res; res.clear();
if (N == 1LL){
res.push_back(1LL);
}else
if (N == 2LL){
res.push_back(2LL);
}else
if (N == 3LL){
res.push_back(2LL);
res.push_back(1LL);
}else{
ll ans = (ll)(lower_bound(sum, sum + MAX_N, N) - sum);
res.push_back(ans);
visit[ans] |= true;
ll remain = N - ans;
ll curr = ans - 1LL;
while(remain > 0LL){
for (int i = curr; i > 0; --i){
if (!visit[i] && remain - i >= 0LL){
visit[i] |= true;
res.push_back((ll)i);
remain -= (ll)i;
break;
}
}
}
}
rep (i, res.size()){
cout << res[i] << endl;
}
return 0;
}
| 0 | 85,330,596 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define ALL(vec) vec.begin(),vec.end()
#define PRINT(vec) printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");
#define SCAN(vec) for(auto &i:vec)scanf("%ld",&i)
#define fi first
#define se second
const int MOD = 1e9+7;
const ll INF = 1e18;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
int n;
scanf("%d", &n);
char s[n+1];
scanf("%s", s);
ll alp[26] = {};
REP(i, 0, n) alp[s[i]-'a']++;
ll ans = 1;
REP(i, 0, 26){
ans *= alp[i] + 1;
ans %= MOD;
}
printf("%ld\n", ans-1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define REPS(i,n) for (ll i = 1; i<=(ll)(n); i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j) vector<vector<ll>> name(i,vector<ll>(j))
#define vec2f(name,i,j,k) vector<vector<ll>> name(i,vector<ll>(j,k))
#define vec3(name,i,j,k) vector<vector<vector<ll>>> name(i,vector<vector<ll>>(j,vector<ll>(k)))
#define vec3f(name,i,j,k,l) vector<vector<vector<ll>>> name(i,vector<vector<ll>>(j,vector<ll>(k,l)))
#define vec4(name,i,j,k,l) vector<vector<vector<vector<ll>>>> name(i,vector<vector<vector<ll>>>(j,vector<vector<ll>>(k,vector<ll>(l))))
#define vec4f(name,i,j,k,l,m) vector<vector<vector<vector<ll>>>> name(i,vector<vector<vector<ll>>>(j,vector<vector<ll>>(k,vector<ll>(l,m))))
#define pb push_back
#define MOD 1000000007
#define MOD2 998244353
#define PI 3.141592653
#define INF 100000000000000
#define N 110000
vector<ll> minht(N);
vector<ll> maxht(N);
vector<ll> minha(N);
vector<ll> maxha(N);
vector<ll> t(N);
vector<ll> a(N);
vector<ll> minh(N);
vector<ll> maxh(N);
int main(){
ll n; cin >> n;
REP(i,n){
cin >> t[i];
if (i==0) minht[i]=maxht[i]=t[i];
else if (i==n-1) {maxht[i]=t[i]; minht[i]=0;}
else if (t[i]>t[i-1]) minht[i]=maxht[i]=t[i];
else {maxht[i]=t[i]; minht[i]=0;}
}
REP(i,n){
cin >> a[i];
}
FORD(i,n-1,0){
if (i==n-1) minha[i]=maxha[i]=a[i];
else if (i==0) {maxha[i]=a[i]; minha[i]=0;}
else if (a[i]>a[i+1]) minha[i]=maxha[i]=a[i];
else {maxha[i]=a[i]; minha[i]=0;}
}
REP(i,n){
maxh[i]=min(maxha[i],maxht[i]);
minh[i]=max(minha[i],minht[i]);
}
ll ans = 1;
REP(i,n){
if (maxh[i]<minh[i]) ans = 0;
else if (minh[i]==0) ans = (ans*maxh[i])%MOD;
else ans = (ans*(maxh[i]-minh[i]+1))%MOD;
}
cout << ans << endl;
}
| 0 | 79,352,835 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
long long x, y;
scanf("%lld%lld", &x, &y);
puts(abs(x - y) <= 1 ? "Brown" : "Alice");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define ittr(x,v) for(auto x=v.begin();x!=v.end();x++)
#define itr(x,n) for(int x=0;x<n;x++)
#define itrab(x,a,b) for(int x=a;x<b;x++)
#define itpr(v) ittr(x,v)cout<<*x<<" "; cout nn
#define itppr(v) ittr(x,v)cout<<(*x).ff<<" "<<(*x).ss<<" "; cout nn
#define sz(x) (ll)((x).size())
#define dTor(x) ((x)*pi)/180.0
#define pi 3.14159265359
#define INF 1000000000
#define INFF 1000000000000000000
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef map<ll,ll> ml;
typedef set<ll> sl;
typedef string str;
typedef pair<ll, ll> pl;
typedef vector< pl > vpl;
typedef map<pl,ll> mpl;
typedef set< pl > spl;
typedef vector<str> vst;
typedef vector<vl> vvl;
const ll M=1000000007;
const ll N=998244353;
ll power(ll x, ll y, ll p){
ll 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;
}
ll inv(ll x, ll m){
return power(x,m-2,m);
}
ll nCr(ll n, ll r){
vl fac(10);
if (r==0)
return 1;
return (fac[n]*inv(fac[r],M)%M*inv(fac[n-r],M)%M)%M;
}
struct comp{
template<typename T>
bool operator()(const T &a, const T &b){
if (a.ff==b.ff)
return (a.ss<b.ss);
else
return (a.ff<b.ff);
}
};
bool mod(const pair<ll,ll> &a, const pair<ll,ll> &b){
if(a.ff!=b.ff)
return (a.ff<b.ff);
else
return (a.ss>b.ss);
}
void sieve(){
vector<bool> pr(1000000+1,1);
for(ll i=2;i*i<=1000000;i++)
if(pr[i]==1)
for(ll j=i*i;j<=1000000;j+=i)
pr[j]=0;
}
bool isValid(ll i, ll j, ll n, ll m){
if(i>=0&&i<n&&j>=0&&j<m){
return true;
}
return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
standardVar;
ll a,b,c;
cin>>a>>b>>c>>k;
ll sum=0;
sum+=min(a,k);
k-=min(a,k);
k-=min(b,k);
sum-=min(c,k);
cout<<sum nn;
return 0;
}
| 0 | 54,753,440 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su 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 frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#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...);}
void f()
{
int a[4];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[2]-a[0]<<nl;
}
int main()
{
su;
f();
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
#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()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
ll qp(ll a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm (ll a, ll b){return a/gcd(a,b)*b;}
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
void solve() {
ll X,Y,Z,K;cin >> X >> Y >> Z >> K;
vec taste;
vec A(X),B(Y),C(Z);
vec AB;
cin >> A >> B >> C;
rep(i,X){
rep(j,Y){
AB.push_back(A[i]+B[j]);
}
}
sort(all(AB), greater<ll>());
AB.resize(K);
rep(i,K){
rep(j,Z){
taste.push_back(AB[i]+C[j]);
}
}
sort(all(taste), greater<ll>());
rep(i,K){
cout << taste[i] << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout << fixed << setprecision(10);
solve();
return 0;
}
| 0 | 20,873,883 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int A,B;
cin>>A>>B;
if(A<=8&&B<=8){cout<<"Yay!"<<endl;}
else{cout<<":("<<endl;}
return 0;}
|
#include <iostream>
int main() {
int a;
int x[101];
int y[101];
for (int i = 0; i < 101; i++) {
x[i] = -1;
y[i] = -1;
}
bool bingo[3][3];
for (int j = 0; j < 3; j++) {
for (int i = 0; i < 3; i++) {
std::cin >> a;
x[a] = i;
y[a] = j;
bingo[j][i] = false;
}
}
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
int b;
std::cin >> b;
if (x[b] > -1 && y[b] > -1) {
bingo[y[b]][x[b]] = true;
}
}
bool yes = false;
for (int j = 0; j < 3; j++) {
if (bingo[j][0] && bingo[j][1] && bingo[j][2])
yes = true;
}
for (int i = 0; i < 3; i++) {
if (bingo[0][i] && bingo[1][i] && bingo[2][i])
yes = true;
}
if (bingo[0][0] && bingo[1][1] && bingo[2][2])
yes = true;
if (bingo[2][0] && bingo[1][1] && bingo[0][2])
yes = true;
if (yes)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
| 0 | 43,705,122 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 1000000007
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n, ans = 0, sum = 0 ; cin >> n ;
map <int,int> cnt;
cnt[0]=1;
while (n--){
int a; cin >> a;
sum += a;
ans += cnt[sum];
cnt[sum]++;
}
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,K;
ll x[55];
ll y[55];
int main(){
cin >> n >> K;
vector<ll> dx;
vector<ll> dy;
for(ll i=0;i<n;i++){
cin >> x[i] >> y[i];
dx.push_back(x[i]);
dy.push_back(y[i]);
}
sort(dx.begin(),dx.end());
sort(dy.begin(),dy.end());
ll res=abs(dx[n-1]-dx[0])*abs(dy[n-1]-dy[0]);
for(ll i=0;i<n;i++){
for(ll k=i+1;k<n;k++){
for(ll j=0;j<n;j++){
for(ll l=j+1;l<n;l++){
ll lx=dx[i],rx=dx[k],ly=dy[j],ry=dy[l];
ll count=0;
for(ll c=0;c<n;c++){
if(lx<=x[c]&&x[c]<=rx&&ly<=y[c]&&y[c]<=ry) count++;
}
if(K<=count) res=min(res,abs(rx-lx)*abs(ry-ly));
}
}
}
}
cout << res << endl;
return 0;
}
| 0 | 20,174,079 |
#include <bits/stdc++.h>
using namespace std;
long long n,m,i,j,ans,x,y;
int main(){
cin>>n;
while (n--){
cin>>x>>y;
if (x==1&&y==1){
cout<<"0\n";
continue;
}
if (x==y||abs(x-y)==1){
cout<<(min(x,y)-1)*2<<endl;
continue;
}
ans=((long long)(sqrt(x*y)));
if (ans*ans>=x*y) ans--;
if (ans*(ans+1)>=x*y){
cout<<ans*2-2<<endl;
continue;
}
cout<<ans*2-1<<endl;
}
return 0;
}
|
#include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[j+1]);
}
}
}
for(int i = 0; i < k; i++) {
sum += p[i];
}
cout << sum << endl;
}
| 0 | 65,937,892 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int tc; tc=1;
while(tc--){
int a,b,c; cin>>a>>b>>c;
if(a == b) cout<<c;
if(a == c) cout<<b;
if(b == c) cout<<a;
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
const int MOD = 1e9 + 7;
const int SZ = 1e6;
template <int N, int M> struct Fact {
int mod[N + 1];
int inv_mod[N + 1];
constexpr Fact() : mod(), inv_mod() {
mod[0] = 1;
for (int i = 0; i < N; ++i) {
mod[i + 1] = (mod[i] * (i + 1)) % M;
}
inv_mod[N] = power(mod[N], M - 2);
for (int i = N - 1; i >= 0; --i) {
inv_mod[i] = (inv_mod[i + 1] * (i + 1)) % M;
}
}
constexpr int power(int a, int b) {
int r = 1;
while (b > 0) {
if ((b & 1) != 0)
r = (r * a) % M;
a = (a * a) % M;
b >>= 1;
}
return r;
}
constexpr int comb(int n, int r) {
return (((mod[n] * inv_mod[r]) % M) * inv_mod[n - r]) % M;
}
constexpr int homo(int n, int r) { return comb(n + r - 1, n - 1); }
};
Fact<SZ, MOD> facmod;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int X, Y;
cin >> X >> Y;
int x = X, y = Y;
if ((x + y) % 3 != 0) {
cout << "0\n";
return 0;
}
int n = (x + y) / 3;
x -= n;
y -= n;
if (x < 0 || y < 0) {
cout << "0\n";
return 0;
}
cout << facmod.comb(n, x) << endl;
return 0;
}
| 0 | 66,104,000 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int i = min(A, B) + 1;
int cnt = 0;
while (K != 0) {
--i;
if (A % i == 0 && B % i == 0) {
--K;
}
}
cout << i << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
const ll dv = 1000000007;
vector<ll> dy = {1,0,-1,0};
vector<ll> dx = {0,1,0,-1};
int main(){
ll h,w;cin >> h >> w;
vector<string> a(h);
rep(i,h) cin >> a.at(i);
vector<vector<ll>> dist(h,vector<ll>(w,-1));
queue<P> q;
auto push = [&]( ll y, ll x, ll d ){
if( dist.at(y).at(x) != -1 ) return;
dist.at(y).at(x) = d;
q.push(make_pair(y,x));
};
for(ll i=0;i<h;++i){
for(ll j=0;j<w;++j){
if( a.at(i).at(j) == '#' ){
push(i,j,0);
}
}
}
while( !q.empty() ){
P p = q.front();q.pop();
ll d = dist.at(p.first).at(p.second);
for(ll i=0;i<4;++i){
ll ny = p.first + dy.at(i);
ll nx = p.second + dx.at(i);
if( ny >= 0 && ny < h && nx >= 0 && nx < w ){
push(ny,nx,d+1);
}
}
}
ll ans = -10;
rep(i,h){
rep(j,w){
ans = max(ans,dist.at(i).at(j));
}
}
cout << ans << endl;
return 0;
}
| 0 | 15,278,072 |
#include <stdio.h>
int main(){
int a, b;
scanf("%d", &a);
scanf("%d", &b);
int ans=1;
for (int i = 0; i<a; i++){
if(ans<b){
ans= ans*2;
}else{
ans= ans + b;
}
}
printf("%d", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool a=true;
char C='a';
vector<string> W(N);
for(int i=0;i<N;i++){
cin >> W.at(i);
if(i!=0){
if(W.at(i).at(0)!=C){
a=false;
}
}
C=W.at(i).at(W.at(i).size()-1);
}
sort(W.begin(),W.end());
for(int i=0;i<N-1;i++){
if(W.at(i)==W.at(i+1)){
a=false;
}
}
if(a){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
| 0 | 43,839,678 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputLongArray(a,N) long a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputIntArray2(a,b,N) int a[N]; int b[N]; for(int i=0;i<N;i++){cin >> a[i] >> b[i];}
#define output(answer) cout << answer << endl;
#define fN(i,N) for(int i=0; i<N; i++)
#define fSE(i,s,e) for(int i=s; i<=e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i,N) for(int i=0; i<N; i++)
#define cinv(v,N) vector<int> v(N); for(int i=0; i<N; i++){ cin >> v[i]; }
#define mt make_tuple
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define all(v) (v).begin(),(v).end()
#define show(v) FOR(i,v.size()){ cout << v[i] << " "; } cout << endl;
#define showshow(v) FOR(i,v.size()){ FOR(j,v[i].size()){ cout << v[i][j] << " "; } cout << endl; }
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
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 LIMIT = 1e6;
vector<ll> FacMod(LIMIT), InvMod(LIMIT), FacInvMod(LIMIT);
const int dpComTableLIMIT = 3e3+1;
vector<vector<ll>> Com(dpComTableLIMIT,vector<ll>(dpComTableLIMIT,0));
const int ComKTableLIMIT = 1e7;
vector<ll> ComK(ComKTableLIMIT);
void DPComInit(){
for(int i=0; i<dpComTableLIMIT; i++){ Com[i][0] = 1; }
for(int i=1; i<dpComTableLIMIT; i++){
for(int j=1; j<dpComTableLIMIT; j++){
Com[i][j] = (Com[i-1][j-1]+Com[i-1][j])%MOD;
}
}
}
void ComKInit(ll N){
for(int i=0; i<=ComKTableLIMIT; i++){
if(0<i && i<=N/2){
ComK[i] = (ComK[i-1]*(N-i+1)/i)%MOD;
}else if(i==0){
ComK[i] = 1;
}else if(N/2<i && i<=N){
ComK[i] = ComK[N-i];
}else{
ComK[i] = -1;
}
}
}
void ComInit(){
FacMod[0] = FacMod[1] = 1;
InvMod[0] = 0; InvMod[1] = 1;
FacInvMod[0] = FacInvMod[1] = 1;
for(int i=2; i<LIMIT; i++){
FacMod[i] = FacMod[i-1]*i%MOD;
InvMod[i] = -InvMod[MOD%i]*(MOD/i)%MOD + MOD;
FacInvMod[i] = FacInvMod[i-1] * InvMod[i]%MOD;
}
}
ll ComMod(int n, int k){
if(n>=0 && k>=0 && n>=k){
return FacMod[n]*(FacInvMod[k]*FacInvMod[n-k]%MOD)%MOD;
}else{
return 0;
}
}
ll power(ll x, ll y){
if(y < 0){
return 0;
}else if(y == 0){
return 1LL;
}else if(y%2 == 0){
return power(x,y/2)*power(x,y/2);
}else{
return power(x,y-1)*x;
}
}
ll mpower(ll x, ll y, ll m){
if(y < 0){
return 0;
}else if(y == 0){
return 1LL;
}else if(y%2 == 0){
return mpower(x,y/2,m)*mpower(x,y/2,m)%m;
}else{
return mpower(x,y-1,m)*x%m;
}
}
bool compare_by_second(pair<ll,ll> a, pair<ll,ll> b){
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
class UnionFind {
vector<int> parent;
vector<int> rank;
public:
UnionFind(int N);
int root(int x);
void unite(int x, int y);
bool isUnited(int x, int y);
int getRank(int x);
};
UnionFind::UnionFind(int N):parent(N),rank(N,1){
for(int i=0; i<N; i++){parent[i]=i;}
}
int UnionFind::root(int x){
if(parent[x] == x) return x;
return root(parent[x]);
}
void UnionFind::unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
if(rank[x] >= rank[y]){parent[ry] = rx; rank[y]+=1;}
else{parent[rx] = ry; rank[x]+=1;}
}
bool UnionFind::isUnited(int x, int y) {
int rx = root(x);
int ry = root(y);
parent[x]=rx; parent[y]=ry;rank[x]=2;rank[y]=2;
return rx == ry;
}
int UnionFind::getRank(int x){
return rank[x];
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll X, Y, Z, K; cin >> X >> Y >> Z >> K;
vector<ll> a(X), b(Y), c(Z);
FOR(i,X){ cin >> a[i]; }
FOR(i,Y){ cin >> b[i]; }
FOR(i,X){ cin >> c[i]; }
sort(all(a),greater<ll>());
sort(all(b),greater<ll>());
sort(all(c),greater<ll>());
priority_queue<tuple<ll,ll,ll,ll>> pq;
pq.push(make_tuple(a[0]+b[0]+c[0],0,0,0));
set<tuple<ll,ll,ll>> s;
s.insert(make_tuple(0,0,0));
for(int num=0; num<K; num++){
tuple<ll,ll,ll,ll> t = pq.top(); pq.pop();
ll tmp = get<0>(t);
ll i = get<1>(t);
ll j = get<2>(t);
ll k = get<3>(t);
tuple<ll,ll,ll> ta = make_tuple(i+1,j,k);
tuple<ll,ll,ll> tb = make_tuple(i,j+1,k);
tuple<ll,ll,ll> tc = make_tuple(i,j,k+1);
if(i+1<=X-1 && s.find(ta) == s.end()){
s.insert(ta);
pq.push(make_tuple(a[i+1]+b[j]+c[k],i+1,j,k));
}
if(j+1<=Y-1 && s.find(tb) == s.end()){
s.insert(tb);
pq.push(make_tuple(a[i]+b[j+1]+c[k],i,j+1,k));
}
if(k+1<=Z-1 && s.find(tc) == s.end()){
s.insert(tc);
pq.push(make_tuple(a[i]+b[j]+c[k+1],i,j,k+1));
}
cout << tmp << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
int main() {
int n; cin >> n;
int tmp;
string s;
string ans = "";
vector<vector<int>> v(n,vector<int>(26,0));
rep(i,n){
cin >> s;
rep(j,s.size()){
v[i][(int)(s[j]-'a')] ++;
}
}
rep(i,26){
tmp = 100000;
rep(j,n){
tmp = min(tmp,v[j][i]);
if(tmp == 0) break;
if(j == n-1){
rep(k,tmp){
ans += char('a' + i);
}
}
}
}
cout << ans;
return 0;
}
| 0 | 82,241,092 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int abs(int a) {
return a >= 0 ? a : -a;
}
int main() {
int n, z, w;
cin >> n >> z >> w;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << abs(a[0] - w) << endl;
} else {
cout << max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1])) << endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#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), b(n), diff(n);
ll sum_a = 0, sum_b = 0;
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n){
sum_a += a[i], sum_b += b[i];
diff[i] = a[i]-b[i];
if(diff[i] < 0) diff[i] = (1LL<<50);
}
sort(all(diff));
if(sum_a < sum_b){
cout << -1 << endl;
return 0;
}
ll excess = sum_a - sum_b;
ll cnt = 0, pos = 0;
for(; pos<n; pos++){
if(cnt + diff[pos] > excess) break;
else cnt += diff[pos];
}
cout << n-pos << endl;
}
| 0 | 94,879,616 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll x, y;
cin >> x >> y;
int ans=0;
while(true){
ans ++;
y /=2;
if(x>y){
break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;++i)
#define repf(i,n) for(int i=0;i<=n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define eachdo(v, e) for(const auto& e : v)
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (ll)distance(v.begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (ll)distance(v.begin(), upper_bound((v).begin(), (v).end(), e))
ll mpow(ll a, ll n,ll mod=MOD){ll res=1;while(n>0){if(n&1)res=res*a%mod;a=a*a%mod;n>>=1;}return res;}
template<class T1, class T2> ll bcount(T1 v, T2 a){return upper_index(v,a)-lower_index(v,a);}
template<class T> bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
template<class T> void debug2(T v){rep(i,v.size()){rep(j,v[i].size())cout<<v[i][j]<<" ";cout<<endl;}}
template<class T> void rdv(T &v){rep(i,v.size())cin>>v[i];}
template<class T> void rdvv(T &v){rep(i,v.size()){rep(j,v[i].size())cin>>v[i][j];}}
int main(){
ll H,W,D; cin >> H >> W >> D;
ll lw = (H*W+D-1)/D;
vector<vector<pair<ll,ll>>> list(D,vector<pair<ll,ll>>(lw));
rep(i,H){
rep(j,W){
ll a; cin >> a;
--a;
list[a%D][a/D] = make_pair(i,j);
}
}
vvl d(D,vl(lw+1,0));
rep(i,D){
rep(j,lw-1){
d[i][j+2] = d[i][j+1] + abs(list[i][j+1].first - list[i][j].first) + abs(list[i][j+1].second - list[i][j].second);
}
}
ll Q; cin >> Q;
rep(i,Q){
ll a,b; cin >> a >> b;
--a;--b;
cout << d[b%D][(b/D)+1] - d[a%D][a/D+1] << endl;
}
return 0;
}
| 0 | 12,468,807 |
#include <bits/stdc++.h>
using namespace std;
int cnt[200010];
main(void){
int n,k;cin >> n >> k;
for(int i=0;i<n;i++){
int a;cin >> a;
cnt[a-1]++;
}
sort(cnt,cnt+n);
int ans=0;
for(int i=0;i<n-k;i++) ans+=cnt[i];
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 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);
ll N, M, K;
cin >> N >> M >> K;
for(int i = 0; i <= N; i++){
for(int j = 0; j <= M; j++){
if((N - i) * j + i * (M - j) == K){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0 | 7,865,056 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb push_back
#define mp std::make_pair
#define endl "\n"
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
const ll MOD=1e9+7;
const ll MAX=1e7;
const ll INF=(1ll<<60);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
struct Binary_indexed_tree{
int N;
vi bit;
Binary_indexed_tree(int n):N(n){
bit.resize(N+1,0);
}
void add(int x,int a){
for(x;x<=N;x+=(x&-x)) bit[x]+=a;
}
ll sum(int x){
ll ret=0;
for(x;x>0;x-=(x&-x)) ret+=bit[x];
return ret;
}
ll lower_bound(ll X){
if(sum(N)<X) return -1;
ll ret=0,memo=1,sum=0;
while(memo*2<=N) memo*=2;
while(memo>0){
if(memo+ret<=N&&sum+bit[memo+ret]<X){
sum+=bit[memo+ret];
ret+=memo;
}
memo/=2;
}
return ret+1;
}
};
struct Union_Find{
ll N;
vi par;
vi siz;
Union_Find(int n):N(n){
par.resize(N);
siz.resize(N,1);
rep(i,0,N) par[i]=i;
}
ll root(ll X){
if(par[X]==X) return X;
return par[X]=root(par[X]);
}
bool same(ll X,ll Y){
return root(X)==root(Y);
}
void unite(ll X,ll Y){
X=root(X);
Y=root(Y);
if(X==Y) return;
par[X]=Y;
siz[Y]+=siz[X];
siz[X]=0;
}
ll size(ll X){
return siz[root(X)];
}
};
ll modpow(ll X,ll Y){
ll sum=X,cnt=1;
vi A;
while(cnt<=Y){
A.pb(sum);
sum*=sum;
sum%=MOD;
cnt*=2;
}
int M=A.size();
ll ret=1;
REP(i,1,M){
if(Y>=(1ll<<M-i)){
Y-=(1ll<<M-i);
ret*=A[M-i];
ret%=MOD;
}
}
return ret;
}
ll 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;
}
}
ll COM(ll n,ll r){
if(n<r||n<0||r<0) return 0;
return fac[n]*finv[r]%MOD*finv[n-r]%MOD;
}
signed main(){
string S; cin>>S;
ll N=S.size();
ll memo=0;
std::map<ll,ll> dp;
dp[0]=0;
rep(i,0,N-1){
ll X=S[i]-'a';
memo^=(1ll<<X);
ll me=memo;
if(!dp.count(me)) dp[me]=INF;
rep(j,0,26){
memo^=(1ll<<j);
if(dp.count(memo))dp[me]=std::min(dp[me],dp[memo]+1);
memo^=(1ll<<j);
}
}
ll X=S[N-1]-'a';
memo^=(1ll<<X);
ll ans=INF;
rep(j,0,26){
memo^=(1ll<<j);
if(dp.count(memo)) ans=std::min(ans,dp[memo]+1);
memo^=(1ll<<j);
}
if(dp.count(memo)) ans=std::min(ans,dp[memo]+1);
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a > b)
cout << "Alice" << endl;
else if(a < b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
return 0;
}
| 0 | 78,990,357 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
template<class T> inline bool chmin(T &a, T b) {if (a>b) {a = b; return 1;} return 0;};
template<class T> inline bool chmax(T &a, T b) {if (a<b) {a = b; return 1;} return 0;};
typedef long long int ll;
const long long INF = 1LL << 60;
int N, A, B, C;
int l[10];
ll dfs(vector<int> &vec, ll &ans){
if ((int)vec.size()==N){
int a[3] = {};
int nonzero = 0;
rep(i,N){
if (vec[i]==3) continue;
a[vec[i]] += l[i];
nonzero++;
}
if (nonzero<3 || a[0]==0 || a[1]==0 || a[2]==0) return INF;
ll point = 10*(nonzero - 3);
point += abs(a[0]-A) + abs(a[1]-B) + abs(a[2]-C);
return point;
}
for (int v=0;v<=3;v++){
vec.push_back(v);
ll res = dfs(vec,ans);
chmin(ans, res);
vec.pop_back();
}
return ans;
}
int main(){
cin >> N >> A >> B >> C;
rep(i,N) cin >> l[i];
vector<int> init;
ll ans = INF;
cout << dfs(init, ans) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int N,K; cin>>N>>K;
vector<int> A(N+1,0);
for(int i=0;i<N;i++){
int a; cin>>a;
A[a]++;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
int count=0;
int ans=0;
for(int i=0;i<=N;i++){
if(count<K){
count++;
}
else{
ans+=A[i];
}
}
cout<<ans;
return 0;
}
| 0 | 85,643,644 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s = a;
sort(s.rbegin(), s.rend());
rep(i, n) {
int ans = s[0];
if (s[0] == a[i])
ans = s[1];
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vector<ll> > vvl;
typedef vector<vector<P> > vvp;
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 ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int>vec(n);
while(true){
int l=0,r=n;
cout << 0 << endl;
string s;
cin >> s;
if(s[0]=='V')return 0;
else if(s[0]=='M')vec[0]=1;
else vec[0]=0;
while(true){
int m=(r+l)/2;
cout << m << endl;
string t;
cin >> t;
if(t[0]=='V')return 0;
else if(t[0]=='M')vec[m]=1;
else vec[m]=0;
if((m-l)%2^vec[m]==vec[l])l=m;
else r=m;
}
}
return 0;
}
| 0 | 1,402,772 |
#include <iostream>
#include <cstring>
using namespace std;
int ans = 0, array[100],mini;
void BubbleSort(int A[], int n) {
for (int i = 0; i < n; i++) {
mini=i;
for (int j = i; j < n; j++) {
if (A[j]<A[mini])
mini = j;
}
swap(A[i],A[mini]);
if (i!=mini) ans++;
}
}
int main() {
int n;
cin >> n;
memset(array, 0, sizeof(array));
for (int i = 0; i < n; i++)
cin >> array[i];
BubbleSort(array, n);
for (int i = 0; i < n; i++) {
cout << array[i];
if (i != n - 1) cout << ' ';
}
cout << endl << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;cin>>s;
int ans=753;
rep(i,s.size()-2){
string str="";
str+=s.at(i);
str+=s.at(i+1);
str+=s.at(i+2);
int x=stoi(str);
if(abs(x-753)<ans){
ans=abs(x-753);
}
}
cout<<ans<<endl;
}
| 0 | 50,334,009 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
string A, B, C;
cin>>A>>B>>C;
if(A[A.size()-1]==B[0] && B[B.size()-1]==C[0]) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a >> b >> k;
int tk = a, ao = b;
for (int i = 0; i < k; ++i) {
if (i % 2 == 0) {
if (tk & 1) {
tk--;
}
ao += tk / 2;
tk /= 2;
} else {
if (ao & 1) {
ao--;
}
tk += ao / 2;
ao /= 2;
}
}
cout << tk << " " << ao << endl;
return 0;
}
| 0 | 36,877,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char X,Y;
cin >> X >> Y ;
int x=(int)(X-'A'),y=(int)(Y-'A');
if(x>y) cout << '>' << endl;
else if(x<y) cout << '<' << endl;
else cout << '=' << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int64_t i=ini;i<n;i++)
#define _rep(i,ini,n) for(int64_t i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t N,K; cin>>N>>K;
vector<int64_t> A(N);
rep(n,0,N) cin>>A.at(n);
vector<int64_t> Lfall(N,0),Rfall(N,0);
rep(i,0,N){
rep(j,0,N){
if(j<i && A.at(j)<A.at(i)) Lfall.at(i)++;
if(i<j && A.at(j)<A.at(i)) Rfall.at(i)++;
}
}
int64_t ans=0;
rep(n,0,N){
int64_t val=((K*(K-1))/2)%MOD;
val*=(Lfall.at(n)+Rfall.at(n))%MOD;
val%=MOD;
val+=(K*Rfall.at(n))%MOD;
val%=MOD;
ans+=val;
ans%=MOD;
}
cout<<ans<<endl;
}
| 0 | 96,379,291 |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
const int MOD = 1000000007;
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
int main() {
ll N,ans=1;
string S;
cin >> N >> S;
for(int i=1;i<N;i++){
if(S[i-1]!=S[i]) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <climits>
#include <iomanip>
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define debug(x) cout << #x << " = " << x << "\n"
const long double PI = 3.141592653589793236L;
typedef long long int ll;
typedef long double ld;
using namespace std;
void solve()
{
string s;
cin >> s;
ll count = 0;
ll n = s.size();
for (ll i=0; i<n; i++)
{
count += s[i]-'0';
}
if (count % 9 == 0)
{
cout << "Yes";
return;
}
cout << "No";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
while (T--)
{
solve();
}
return 0;
}
| 0 | 16,951,556 |
#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 v[51];
rep(i, N) cin >> v[i];
sort(v, v + N);
double ans = v[0];
rep(i, N - 1) {
ans = (ans + v[i + 1]) / 2.0;
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define LL(x) ll x; scanf("%lld",&x)
#define INPUT(x) cin >> x
#define REP1(x,n) for(int x = 0; x < n; x++)
#define REP2(x,s,e) for(int x = s; x <= e; x++)
#define RREP1(x,n) for(int x = n-1; x >= 0; x--)
#define RREP2(x,s,e) for(int x = s; x >= e; x--)
#define BR printf("\n")
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
typedef long long ll;
int main(){
int A[100][100];
INT(N);INT(E);
REP1(i,N){
REP1(j,N){
if(i != j){
A[i][j] = INF_INT;
}else{
A[i][j] = 0;
}
}
}
REP1(i,E){
INT(s);INT(t);INT(d);
A[s][t] = d;
}
REP1(k,N){
REP1(i,N){
if (A[i][k] == INF_INT) continue;
REP1(j,N){
if (A[k][j] == INF_INT) continue;
A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
}
}
}
REP1(i,N){
if(A[i][i] < 0){
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
REP1(i,N){
REP1(j,N){
if (A[i][j] == INF_INT) {
cout << "INF";
}else{
cout << A[i][j];
}
if (j+1 != N)cout << " ";
}
cout << endl;
}
return 0;
}
| 0 | 8,598,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int r,g,b,n;
cin >> r >> b >>g >> n;
int x=n/r;
int y=n/b;
ll ans =0;
rep(i,x+1){
rep(j,y+1){
ll m=i*r+j*b;
if((n-m)%g==0 && n>=m)ans++;
}
}
cout << ans << endl;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=2e5+5;
int main(void){
int N;
cin >> N;
int C[N-1],S[N-1],F[N-1];
rep(i,N-1) cin >> C[i] >> S[i] >> F[i];
for(int i=0;i<N-1;i++){
int now=0;
for(int j=i;j<N-1;j++){
now=max(now,S[j]);
now=((now+F[j]-1)/F[j])*F[j];
now+=C[j];
}
cout << now << endl;
}
cout << 0 << endl;
}
| 0 | 13,394,893 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll n,a[200010],number[200010]={0};
ll sum=0;
cin>>n;
rep(i,n){
cin>>a[i];
sum+=number[a[i]];
number[a[i]]++;
}
rep(i,n)cout<<sum-(number[a[i]]-1)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n) - 1, 0, i)
#define upto(f, t, i) for(int i##_to_ = (t), i = (f); i <= i##_to_; i++)
#define uptil(f, t, i) for(int i##_to_ = (t), i = (f); i < i##_to_; i++)
#define downto(f, t, i) for(int i##_to_ = (t), i = (f); i >= i##_to_; i--)
#define downtil(f, t, i) for(int i##_to_ = (t), i = (f); i > i##_to_; i--)
typedef long double LD;
#define long long long
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 2
#define _LIBCPP_DEBUG2 2
#define ln << endl
#else
#define debug false
#define ln << '\n'
#endif
#define tb << '\t'
#define sp << ' '
int pyon[1<<26];
signed main() {
if(!debug) {
cin.tie(0);
ios::sync_with_stdio(0);
}
times(1<<26, i) pyon[i] = INT_MAX-486;
string S; cin >> S;
vector<int> d(S.size()+1);
int z = 0;
pyon[z] = 0;
times(S.size(), i) {
d[i+1] = pyon[z] + 1;
z ^= 1 << (S[i] - 'a');
d[i+1] = min(d[i+1], pyon[z] + 1);
times(26, j) {
d[i+1] = min(d[i+1], pyon[z ^ (1<<j)] + 1);
}
pyon[z] = min(pyon[z], d[i+1]);
if(debug) cout << z << ":" << pyon[z] sp;
}
if(debug) {
cout ln;
times(d.size(), i) cout << (i?" ":"") << d[i]; cout ln;
}
cout << d[S.size()] ln;
return 0;
}
| 0 | 49,169,255 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int A[N];
int B[N];
for(int i=0;i<N;i++){
cin>>A[i];
B[i]=A[i];
}
sort(A,A+N);
reverse(A,A+N);
for(int i=0;i<N;i++){
if(B[i]==A[0]){
cout<<A[1]<<endl;
}else{
cout<<A[0]<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
long h, w, k;
cin >> h >> w >> k;
vector<vector<char>> corg(h, vector<char>(w));
for (long i = 0; i < h; i++) {
for (long j = 0; j < w; j++) {
char tmp;
cin >> tmp;
corg.at(i).at(j) = tmp;
}
}
long n = h + w;
long ans = 0;
for (int bit = 0; bit < (1 << n); ++bit) {
vector<vector<char>> c(h, vector<char>(w));
for (long row = 0; row < h; row++) {
for (long col = 0; col < w; col++) {
c.at(row).at(col) = corg.at(row).at(col);
}
}
for (int i = 0; i < n; ++i) {
if (bit & (1 << i)) {
if (i < h) {
c.at(i) = vector<char>(w, 'r');
} else {
for (long ii = 0; ii < h; ii++) {
c.at(ii).at(i - h) = 'r';
}
}
}
}
long count = 0;
for (long ii = 0; ii < h; ii++) {
for (long jj = 0; jj < w; jj++) {
if (c.at(ii).at(jj) == '#') {
count++;
}
}
}
if (count == k) {
ans++;
}
}
cout << ans << endl;
}
| 0 | 47,433,508 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
using namespace std;
int strtotime(string str){
int hour = stoi(str.substr(0,2));
int minute = stoi(str.substr(3,2));
int second = stoi(str.substr(6,2));
return(hour*3600+minute*60+second);
}
int main(int argc, char* argv[]){
int n;
vector<vector<string>> strarray;
vector<int> answers;
while(1){
char tmp[100];
scanf("%s", tmp);
string str = tmp;
if(str=="0") break;
n = stoi(str);
vector<tuple<int, int>> timearray;
for(int i=0; i<n;i++){
scanf("%s", tmp);
string str1 = tmp;
int start=strtotime(str1);
scanf("%s", tmp);
string str2 = tmp;
int end=strtotime(str2);
tuple<int, int> times = make_tuple(start, end);
timearray.push_back(times);
}
sort(timearray.begin(), timearray.end());
for(int i=0; i<n; i++){
}
vector<int> train;
train.push_back(0);
int answer=1;
for(int i=1; i<n; i++){
bool flag=true;
for(int j=0; j<(int)train.size(); j++){
if(get<0>(timearray[i])>=get<1>(timearray[train[j]])){
train[j] = i;
flag=false;
break;
}
}
if(flag){
train.push_back(i);
for(int j=0; j<(int)train.size(); j++){
}
answer++;
}
}
answers.push_back(answer);
}
for(int i=0; i<(int)answers.size(); i++){
printf("%d\n", answers[i]);
}
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair
template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }
const double EPS=1e-10;
int sig(double r){return (r<-EPS)?-1:(r>EPS)?1:0;}
struct Pt{
double x,y;
Pt(){}
Pt(double x,double y) : x(x),y(y) {}
Pt operator+(const Pt &a) const {return Pt(x+a.x,y+a.y);}
Pt operator-(const Pt &a) const {return Pt(x-a.x,y-a.y);}
Pt operator*(const Pt &a) const {return Pt(x*a.x-y*a.y,x*a.y+y*a.x);}
Pt operator-() const {return Pt(-x,-y);}
Pt operator*(const double &k) const {return Pt(x*k,y*k);}
Pt operator/(const double &k) const {return Pt(x/k,y/k);}
double abs() const {return sqrt(x*x+y*y);}
double abs2()const{return x*x+y*y;}
double arg()const{return atan2(y,x);}
double dot(const Pt&a)const{return x*a.x+y*a.y;}
double det(const Pt&a)const{return x*a.y-y*a.x;}
bool operator<(const Pt &a)const{return (x!=a.x)?(x<a.x):(y<a.y);}
bool operator==(const Pt&a)const{return (sig(x-a.x)==0&&sig(y-a.y)==0);}
};
ostream &operator<<(ostream &os,const Pt &a){os<<"("<<a.x<<","<<a.y<<")";return os;}
double tri(Pt a, Pt b, Pt c){return (b-a).det(c-a);}
bool iLS(Pt a,Pt b,Pt c,Pt d){
return (sig(tri(a,b,c))*sig(tri(a,b,d))<=0);
}
int main() {
Pt a,b,c,x;
for(;~scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&x.x,&x.y);){
if(iLS(a,b,c,x)||iLS(a,c,b,x)||iLS(b,c,a,x)){
puts("NO");
}else{
puts("YES");
}
}
return 0;
}
| 0 | 49,844,262 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define LL long long int
const LL MOD=2019;
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
LL l,r;
bool check(LL i){
LL x=l/2019;
x*=2019;
if((l<=x+i&&x+i<=r)||(l<=x+i+2019&&x+i+2019<=r)) return 1;
return 0;
}
bool check1(LL i){
LL x=l/2019;
x*=2019;
LL a=0;
if((l<=x+i&&x+i<=r)) a++;
if((l<=x+i+2019&&x+i+2019<=r)) a++;
if((l<=x+i+2*2019&&x+i+2*2019<=r)) a++;
if(a>=2) return 1;
else return 0;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
while(t--){
LL i,j,ans=1e18;cin>>l>>r;
fo(i,0,2019){
fo(j,0,2019){
if(i!=j){
if(check(i)&&check(j)){
ans=min(ans,i*j%MOD);
}
}
else{
if(check1(i)){
ans=min(ans,i*i%MOD);
}
}
}
}
cout<<ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int a, b; cin >> a >> b;
int cnt = 0;
while (a <= b) {
string s = to_string(a++);
if (s == string(s.rbegin(), s.rend())) cnt++;
}
cout << cnt << '\n';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
| 0 | 94,564,169 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int kotae=0;
int ichi=0;
int zero=0;
int n=s.size();
for(int i=0;i<n;i++){
if(s[i]=='0')zero++;
else ichi++;
}
kotae=min(ichi,zero)*2;
cout<<kotae<<endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <iostream>
#include <string>
#include <set>
#include <map>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair <int, int> P;
int A[SIZE], B[SIZE];
int main()
{
int n, k; cin >> n >> k;
for (int i = 0; i < n; i++) cin >> A[i] >> B[i];
ll ret = 0;
for (int i = 0; i < n; i++) if ((k | A[i]) == k) ret += B[i];
for (int i = 0; i <= 30; i++)
{
if (!(k >> i & 1)) continue;
ll now = 0;
for (int j = 0; j < i; j++) now |= 1 << j;
for (int j = i + 1; j <= 30; j++) if (k >> j & 1) now |= 1 << j;
ll sum = 0;
for (int j = 0; j < n; j++) if ((now | A[j]) == now) sum += B[j];
ret = max(ret, sum);
}
cout << ret << endl;
return 0;
}
| 0 | 11,950,762 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <queue>
#include <cmath>
#include <stack>
#define int64 long long int
using namespace std;
int main()
{
int i, n;
priority_queue<int> qu;
for(i=0; i<5; i++) {
cin >> n;
qu.push(n);
}
for(i=0; i<5; i++) {
cout << qu.top();
qu.pop();
if(i != 4) cout << ' ';
else cout << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll,ll>
#define mi map<ll,ll>
#define vec vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define mod 1000000007
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repi(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=a;i>=b;i--)
#define mp make_pair
#define mit map<ll,ll>::iterator
#define sit set<ll>::iterator
#define pit pair<ll,ll>::iterator
#define tr(container, it) for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)
using namespace std;
ll xo(ll x, ll y)
{
return (x | y) & (~x | ~y);
}
ll bin_Expo(ll x,ll n)
{
if(x==0)
return 0;
if(n==0)
return 1;
else if(n%2 == 0)
return bin_Expo(x*x,n/2);
else
return x*bin_Expo(x*x,(n-1)/2);
}
ll mod_Expo(ll x,ll n,ll M)
{
if(x==0)
return 0;
if(n==0)
return 1;
else if(n%2 == 0)
return mod_Expo((x*x)%M,n/2,M);
else
return (x*mod_Expo((x*x)%M,(n-1)/2,M))%M;
}
ll NcR(int n, int r)
{
ll p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
ll m=__gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else
p = 1;
return p;
}
bool prime_check(ll x)
{
bool prime = (x >= 2);
for (ll i = 2; i * i <= x; i++)
{
if (x % i == 0)
{
prime = false;
break;
}
}
return prime;
}
ll logg(ll base,ll x)
{
return (ll)(log(x)/log(base));
}
ll n,m,s[2005],t[2005],dp[2005][2005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS=1;
while(TESTS--)
{
ll i,j,ans,x,sum,c,k,w,h,y;
cin>>n>>m;
repi(i,1,n)
cin>>s[i];
repi(i,1,m)
cin>>t[i];
memset(dp,0,sizeof(dp));
repi(i,1,n)
{
repi(j,1,m)
{
dp[i][j]=(dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]+mod)%mod;
if(s[i]==t[j])
dp[i][j]=(dp[i][j]+1+dp[i-1][j-1])%mod;
}
}
cout<<1+dp[n][m];
}
return 0;
}
| 0 | 25,990,486 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
getline(cin, s);
for (size_t i = 0; i < s.size(); ++i) {
const char c = s[i];
if (c >= 'a' && c <= 'z') {
printf("%c", c - 0x20);
} else if (c >= 'A' && c <= 'Z') {
printf("%c", c + 0x20);
} else {
printf("%c", c);
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec)
{ for (auto v : vec) os << v << ' '; os << '\n'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa)
{ os << '(' << pa.first << ',' << pa.second << ')'; return os; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T)
{ cerr << " " << H; debug_out(T...); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int n;
cin >> n;
int ans = 0;
REP(i, 1, n) {
if (to_string(i).size() % 2 == 1) ans++;
}
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0 | 27,188,142 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define chmin(a, b) (a) = min((ll)(a), (ll)(b))
#define chmax(a, b) (a) = max((ll)(a), (ll)(b))
#define I(x) cin >> x;
#define D(x) cerr << (x) << " ";
#define BR cerr << "\n";
#define P(x) cout << (x) << endl;
#define FIX cout << fixed << setprecision(10);
const int ARRAY = 100005;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
const int MOD = 1e9 + 7;
ll N = 0;
ll ret = 0;
int main(void){
ll r, _D, x;
I(r);
I(_D);
I(x);
REP(i, 10) {
x = r * x - _D;
P(x)
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<int> a(m); rep(i, m) cin >> a[i];
vector<int> cnt = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> dp(n+10, -INF);
vector<int> prev(n+10, -1);
dp[0] = 0;
rep(i, n) {
rep(j, m) {
if ((dp[i+cnt[a[j]]] < dp[i] + 1) || ((dp[i+cnt[a[j]]] == dp[i] + 1) && prev[i+cnt[a[j]]] < a[j])) {
dp[i+cnt[a[j]]] = dp[i] + 1;
prev[i+cnt[a[j]]] = a[j];
}
}
}
vector<int> ans;
int i = n;
while (i > 0) {
int num = prev[i];
ans.push_back(num);
i -= cnt[num];
}
sort(ans.rbegin(), ans.rend());
rep(i, ans.size()) {
cout << ans[i];
}
cout << endl;
return 0;
}
| 0 | 64,166,476 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e3;
const long long MOD = (long long)1e9 + 7;
int data[N+5];
int datb[N+5];
long long dp[N+5][N+5];
int main() {
for (int i=0; i<N+3; i++) {
for (int j=0; j<N+3; j++) {
dp[i][j] = 1;
}
}
int n,m; scanf("%d %d", &n, &m);
for (int i=1; i<=n; i++) scanf("%d", data+i);
for (int j=1; j<=m; j++) scanf("%d", datb+j);
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % MOD;
if (data[i] != datb[j]) {
dp[i][j] = (dp[i][j] + MOD - dp[i-1][j-1]) % MOD;
}
}
}
printf("%lld\n", dp[n][m]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int 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; }
const int MAX =200005;
const int MOD =1000000007;
signed main(){
int n;
cin>>n;
int x,y,p[n],q[n];
for(int i=0;i<n;i++){
cin>>x>>y;
p[i]=x+y;
q[i]=x-y;
}
for(int i=1;i<n;i++)if(abs(p[i])%2!=abs(p[0])%2){
cout<<-1<<endl;
return 0;
}
if(p[0]%2==0){
cout<<32<<endl;
for(int i=30;i>=0;i--)cout<<(1ll<<i)<<' ';
cout<<1<<endl;
for(int j=0;j<n;j++){
for(int i=30;i>=0;i--){
if(p[j]>=0){
p[j]-=(1ll<<i);
if(q[j]>=0){
cout<<'R';
q[j]-=(1ll<<i);
}else{
cout<<'U';
q[j]+=(1ll<<i);
}
}else{
p[j]+=(1ll<<i);
if(q[j]>=0){
cout<<'D';
q[j]-=(1ll<<i);
}else{
cout<<'L';
q[j]+=(1ll<<i);
}
}
}
if(p[j]>=0){
p[j]-=(1ll<<0);
if(q[j]>=0){
cout<<'R';
q[j]-=(1ll<<0);
}else{
cout<<'U';
q[j]+=(1ll<<0);
}
}else{
p[j]+=(1ll<<0);
if(q[j]>=0){
cout<<'D';
q[j]-=(1ll<<0);
}else{
cout<<'L';
q[j]+=(1ll<<0);
}
}
cout<<endl;
}
}else{
cout<<31<<endl;
for(int i=30;i>=0;i--)cout<<(1ll<<i)<<' ';
cout<<endl;
for(int j=0;j<n;j++){
for(int i=30;i>=0;i--){
if(p[j]>=0){
p[j]-=(1ll<<i);
if(q[j]>=0){
cout<<'R';
q[j]-=(1ll<<i);
}else{
cout<<'U';
q[j]+=(1ll<<i);
}
}else{
p[j]+=(1ll<<i);
if(q[j]>=0){
cout<<'D';
q[j]-=(1ll<<i);
}else{
cout<<'L';
q[j]+=(1ll<<i);
}
}
}
cout<<endl;
}
}
}
| 0 | 92,277,978 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
if (n % k == 0)
{
std::cout << 0 << endl;
return 0;
}
std::cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
#define ll long long int
#define mod (long long)(1e9+7)
#define endl '\n'
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0) ;
#define pi (acos(-1))
#define F first
#define S second
ll fp(ll n , ll p )
{
if(p==0)
return 1;
if(p==1)
return n ;
ll res = fp(n,p/2);
res=((res)*(res)) ;
if(p%2)
res=(res*n) ;
return res ;
}
int main()
{
ENGZ;
double w,h,x,y ;
cin>>w >>h >> x >> y ;
long double ans = (w*h) ;
ans/=2 ;
bool f = 0 ;
if(x == w/2.0 && y == h/2.0)f=1 ;
cout<<setprecision(9) <<fixed ;
cout<<ans <<" " <<f <<endl ;
return 0;
}
| 0 | 51,432,875 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
float total = 0;
cin >>N;
for(int i=0;i<N;i++){
float x_i;
string u_i;
cin >> x_i >> u_i;
if(u_i == "JPY"){
total += x_i;
}
else{
total += (x_i * 380000.0);
}
}
cout << total << endl;
}
|
#include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <algorithm>
#define FOREVER for (;;)
#define FOR(i,a,b) \
for (int (i)=(a);(i)<(b);(i)++)
#define REP(i,a,b) \
for (int (i)=(a);(i)<=(b);(i)++)
#define log(exp) \
printf(#exp" = %d\n", exp)
#define INF 100000000
using namespace std;
const int maxn = 10+3;
int graph[maxn][maxn];
set<int> Set;
int main(void) {
int N;
while (cin>>N && N) {
FOR(i,0, maxn) FOR(j, 0, maxn) graph[i][j] = INF;
FOR(i,0,10) graph[i][i] = 0;
REP(i,1,N) {
int u,v,d;
cin>>u>>v>>d;
graph[u][v] = graph[v][u] = d;
Set.insert(u);
Set.insert(v);
}
FOR(k,0,10)
FOR(i,0,10)
FOR(j,0,10)
graph[i][j] = min(graph[i][j], graph[i][k]+graph[k][j]);
int ans = INF, ansNode = 0;
set<int>::iterator it;
for (it = Set.begin(); it!=Set.end(); it++) {
int node = *it;
int res = 0;
set<int>::iterator anotherIt;
for (anotherIt = Set.begin(); anotherIt!=Set.end(); anotherIt++)
res+=graph[node][*anotherIt];
if (res<ans) ans = res, ansNode = node;
}
printf("%d %d\n", ansNode, ans);
Set.clear();
}
return 0;
}
| 0 | 93,167,107 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int N, K, S;
cin >> N >> K >> S;
if (S == mod-7) {
for (int i = 0; i < K; i++) cout << S << " ";
for (int i = 0; i < N - K; i++) cout << S - 1 << " ";
}
else {
for (int i = 0; i < K; i++) cout << S << " ";
for (int i = 0; i < N - K; i++) cout << S + 1 << " ";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
const int maxm = 5e5 + 5;
const ll inf = 2147483647;
int n, m, k;
int a[101], b[101];
int main(){
int n;
cin>>n;
for(int i = 0; i < n; i++)cin>>a[i];
for(int i = 1; i < n; i++){
b[i] = a[i] - a[i - 1];
}
ll sum = 1000, k;
for(int i = 1; i < n; i++){
if(b[i] <= 0)continue;
k = sum / a[i - 1];
sum += (k * b[i]);
}
cout<<sum;
return 0;
}
| 0 | 922,494 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a[4];
int main() {
for (int i=0; i<6; i++) {
int t; cin >> t; a[t-1]++;
} sort(a,a+4);
for (int i=0; i<4; i++) {
if ((i==2 || i==3) && a[i]>=2) continue;
if ((i==0 || i==1) && a[i]>=1) continue;
cout << "NO"; return 0;
}
cout << "YES";
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, P; cin >> N >> P;
long long A[N];
long long odd = 0, even = 0;
for (int i = 0; i < N; i++)
{
cin >> A[i];
if(A[i] % 2 == 1) odd++;
}
long long ans = 0;
if(odd == 0){
if(P == 0) ans = 1LL<<N;
else ans = 0;
}
else ans = 1LL<<(N-1);
cout << ans << endl;
}
| 0 | 63,048,420 |
#include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
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;}
typedef pair<ll,ll> P;
int main()
{
int ww,hh,n;
cin >> ww >> hh >>n;
vector<int> W(ww+1);
vector<int> H(hh+1);
rep(i,ww+1)W[i]=0;
rep(i,hh+1)H[i]=0;
int xf=0,xl=ww;
int yf=0,yl=hh;
rep(i,n)
{
int x,y,a;
cin>>x >> y >>a;
if(a==1){
xf = max(xf,x);
}else if(a==2){
xl = min(xl,x);
}else if(a==3){
yf = max(yf,y);
}else{
yl = min(yl,y);
}
}
if( (xl-xf)<=0||0>=(yl-yf)){
cout<<0<<endl;
return 0;
}
int ans = (xl-xf)*(yl-yf);
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 all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1000000007;
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
int main(){
int N, M;
cin >> N >> M;
vector<int> A(N);
rep(i, N){
cin >> A[i];
A[i] /= 2;
}
ll ans = A[0];
for(int i = 1; i < N; i++){
ll next = lcm(A[i], ans);
int a = next / ans, b = next / A[i];
while(1){
if(a % 2 != b % 2){
ans = INF;
break;
}
else if( a % 2 == 0 && b % 2 == 0){
a /= 2;
b /= 2;
}
else {
ans = next;
break;
}
}
if(ans == INF) break;
}
int sum = 0;
for(int i = 1; i * ans <= M; i +=2 ) sum++;
cout << sum << endl;
}
| 0 | 85,522,680 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
A.at(i)--;
}
int cnt = 0, temp = 0;
for(;;){
if(temp == 1){
cout << cnt << endl;
break;
}
if(cnt >= N){
cout << -1 << endl;
break;
}
cnt++;
temp = A.at(temp);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a/gcd(a, b) * b;
}
int main()
{
cout << fixed << setprecision(15);
string A, B, C;
cin >> A >> B >> C;
ll a, b, c;
a = A.length();
b = B.length();
c = C.length();
if(A[a-1] == B[0] && B[b-1] == C[0]){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
}
| 0 | 45,821,592 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e7 + 1;
int n, m, k;
long long int cs[N];
int main(){
int n;
cin >> n;
long long int sum = 0;
for(int i = 1; i <= n; i++){
for(int j = i; j <= n ; j += i)
cs[j]++;
sum += 1LL * i * cs[i];
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,a;
cin>>n;
cin>>a;
if((n%500)>a){
cout<<"No";
}
else{
cout<<"Yes";
}
return 0;
}
| 0 | 69,585,287 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define _FILE(s) freopen(#s".in", "r", stdin); freopen(#s".out", "w", stdout)
#define gi get_int()
int get_int()
{
int x = 0, y = 1; char ch = getchar();
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') y = -1, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x * y;
}
char ch[4] = {'R', 'G', 'B', 'Y'};
int main()
{
int n = gi, m = gi, k = gi;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int x = (i + j + m) / k % 2, y = (i - j + m) / k % 2;
printf("%c", ch[x * 2 + y]);
}
printf("\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define mii map<int, int>
#define pii pair<int, int>
#define pq priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define rep(i,a,b) for(int i = a; i < b; i++)
#define repd(i,a,b) for(int i = a; i>= b; i--)
int32_t main()
{
int n, x, m, a;
cin>>n>>x>>m;
vector<int> v;
a = x%m;
int ans = 0;
rep(i, 0, n)
{
if(find(v.begin(), v.end(), a) != v.end())
break;
ans += a;
v.pb(a);
a = (a*a)%m;
if(i == n-1)
{
cout<<ans;
return 0;
}
}
int p = find(v.begin(), v.end(), a) - v.begin();
int count = 0, s = v.size();
ans = 0;
rep(i, 0, p)
{
ans += v[i];
n--;
}
a = 0;
rep(i, p, s)
a = a+v[i];
ans += a*(n/(s - p));
count = n%(s - p);
int i = p;
while(count--)
ans += v[i++];
cout<<ans;
return 0;
}
| 0 | 21,865,670 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
while(k>0){
vector<int> imos(n+1);
vector<pair<int,int>> qu;
rep(i,n){
qu.push_back({max(0,i-a[i]),min(n-1,i+a[i])});
}
rep(i,n){
imos[qu[i].first]++;
imos[qu[i].second+1]--;
}
vector<int> na(n);
na[0] = imos[0];
rep1(i,n-1){
na[i] = imos[i] + na[i-1];
}
swap(a,na);
k--;
rep(i,n) {
if(a[i]!=n) break;
else if(i==n-1) k=0;
}
}
rep(i,n) cout << a[i] <<" ";
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';
const int N = 101, INF = 1e9;
int f[N][N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout.setf(ios::fixed); cout.precision(20);
#endif
int n, m;
cin >> n >> m;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
if (i != j)
f[i][j] = INF;
vector <vector <int> > ed;
for (int i = 0; i < m; ++i) {
int u, v, c;
cin >> u >> v >> c;
ed.app({u, v, c});
f[u][v] = f[v][u] = c;
}
for (int k = 1; k <= n; ++k)
for (int u = 1; u <= n; ++u)
for (int v = 1; v <= n; ++v)
f[u][v] = min(f[u][v], f[u][k] + f[k][v]);
int ans = 0;
for (auto e : ed) {
int u = e[0], v = e[1], c = e[2];
bool us = 0;
for (int s = 1; s <= n; ++s)
for (int t = 1; t <= n; ++t)
us |= f[s][u] + c + f[v][t] == f[s][t];
ans += !us;
}
cout << ans << endl;
}
| 0 | 13,905,538 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#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 _GLIBCXX_DEBUG
int main(){
ll K; cin>>K;
ll A,B; cin>>A>>B;
bool judge=false;
rep(i,B-A+1){
if((A+i)%K==0) judge =true;
else continue;
}
if(judge) cout<<"OK"<<endl;
else cout<<"NG"<<endl;
}
|
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
int n;
while(1){
cin>>n;
if(n==0)return 0;
V<string> s(n);
for(int i=0;i<n;i++)cin>>s[i];
int l=0,r=0,u=0,d=1,ans=0;
for(int i=0;i<n;i++){
if(s[i]=="lu")l=1;
if(s[i]=="ru")r=1;
if(s[i]=="ld")l=0;
if(s[i]=="rd")r=0;
if(u){
if(l==0&&r==0){
ans++;
u=0;d=1;
}
}
if(d){
if(l==1&&r==1){
ans++;
u=1;d=0;
}
}
}
cout<<ans<<endl;
}
}
| 0 | 86,505,741 |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int minSequenceSize(string x, string y)
{
int x_len = x.size();
int y_len = y.size();
int map[x_len][y_len] = {};
for (int i = 0; i < x_len; i++)
{
for (int j = 0; j < y_len; j++)
{
if (i == 0)
{
map[0][j] = 0;
continue;
}
if (j == 0)
{
map[i][0] = 0;
continue;
}
if (x[i] == y[j])
{
map[i][j] = map[i - 1][j - 1] + 1;
continue;
}
if (x[i] != y[j])
{
map[i][j] = max(map[i - 1][j], map[i][j - 1]);
continue;
}
}
}
return map[x_len - 1][y_len - 1];
}
int main()
{
int q;
cin >> q;
for (int i = 0; i < q; i++)
{
string x, y;
cin >> x >> y;
x = " " + x;
y = " " + y;
int ans = minSequenceSize(x, y);
cout << ans << endl;
}
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<set>
#include<ctime>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
inline void write(int a){
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(int a){
write(a); puts("");
}
inline int read()
{
int x = 0; char ch = getchar(); bool positive = 1;
for (; !isdigit(ch); ch = getchar()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
const int N=200005;
int nedge,flag,cd[N],n,m,nextt[N],son[N],ed[N];
inline void dfs(int p,int fa){
if(flag)return; int sum=0;
for(int i=son[p];i;i=nextt[i])if(ed[i]!=fa)dfs(ed[i],p);
for(int i=son[p];i;i=nextt[i])if(ed[i]!=fa){
if(!cd[ed[i]])sum++;
}
if(sum>1){
flag=true; return;
}
cd[p]=sum;
}
inline void aedge(int a,int b){
nextt[++nedge]=son[a]; cd[a]++;
son[a]=nedge;
ed[nedge]=b;
}
int main(){
n=read();
for(int i=1;i<n;i++){
int s1=read(),s2=read();
aedge(s1,s2); aedge(s2,s1);
}
dfs(1,0);
if(flag||cd[1]==0)puts("First"); else puts("Second");
}
| 0 | 56,726,804 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
vector<ll>vec(3);
ll a=0;
for(ll i=0;i<3;i++){
cin>>vec.at(i);
a+=vec.at(i);
}
sort(vec.begin(),vec.end());
cout<<a-vec.at(2)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#define fo(i, n) for( int i = 0; i < n; i++ )
const int INF = 1e9;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int resto = c % b;
int at = 1;
int soma = 0;
set<int> jafoi;
while ( true ) {
soma += (a * at);
soma %= b;
if ( soma == resto ) {
cout << "YES\n";
break;
}
if ( jafoi.find(soma) != jafoi.end() ) {
cout << "NO\n";
break;
}
jafoi.insert(soma);
}
return 0;
}
| 0 | 62,507,698 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
EACH(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
REP(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
REP(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
bool isPrime[1000006];
ll cnt[1000007] = {0};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
fill(isPrime, isPrime+1000006, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= 1000005; ++i) {
for (int j = i*2; j <= 1000005; j += i) {
isPrime[j] = false;
}
}
REP(i, 1000006) {
cnt[i+1] = cnt[i] + (isPrime[i] ? 1 : 0);
}
int N;
while ( cin >> N ) {
cout << cnt[N+1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<ld> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<vector<ll>> vvll;
typedef vector<vector<ld>> vvd;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
typedef vector<vector<str>> vvs;
typedef vector<pair<ll, ll>> vpll;
typedef vector<tuple<ll, ll, ll>> vtlll;
const ld PI = acos(-1.0);
const ll MAX = 9000000000000000000;
const ll MIN = -9000000000000000000;
const ld DMAX = 4500;
const ld DMIN = -4500;
const ll MOD = 1000000007;
template <typename T>
void fin(T a)
{
cout << a << endl;
exit(0);
}
ll GetDigit(ll num)
{
return log10(num) + 1;
}
vector<ll> enum_div(ll n)
{
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret.push_back(i);
if (i * i != n)
{
ret.push_back(n / i);
}
}
}
sort(begin(ret), end(ret));
return ret;
}
ll modpow(ll x, ll n, ll mod = MAX)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll factorial(ll n)
{
if (n > 0)
return n * factorial(n - 1);
else
return 1;
}
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void Main()
{
ll x, y; cin >> x >> y;
ll flag = 0;
if(abs(x) == abs(y))
{
if(x == y) fin(0);
else fin(1);
}
if(x >= 0&&y > 0)
{
if(x > y) fin(2 + max(x, y) - min(x, y));
else fin(max(x, y) - min(x, y));
}
if(x < 0&&y < 0)
{
if(abs(x) < abs(y)) fin(2 + max(abs(x), abs(y)) - min(abs(x), abs(y)));
else fin(max(abs(x), abs(y)) - min(abs(x), abs(y)));
}
if(x < 0&&y > 0)
{
if(abs(x) < abs(y)) fin(1 + max(abs(x), abs(y)) - min(abs(x), abs(y)));
else fin(1 + abs(x) - y);
}
if(x > 0&&y < 0)
{
if(x < abs(y)) fin(1 + abs(y) - x);
else fin(1 + x - abs(y));
}
if(x == 0)
{
if(x < y) fin(y);
else fin(abs(y) + 1);
}
if(y == 0)
{
if(x > y) fin(1 + x);
else fin(abs(x));
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
Main();
return 0;
}
| 0 | 12,240,642 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<iomanip>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
int N, K; cin >> N >> K;
int tmp, cnt;
long double ans=0.0, t;
for(int i=1; i<=N; i++){
tmp = i;
t = 1.0/N;
while(tmp < K){
tmp *= 2;
t *= 0.5;
}
ans += t;
}
cout << std::fixed << std::setprecision(15) << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
#define pb push_back
#define ppp pop_back
#define pii pair<int,int>
#define fi first
#define se second
#define stie std::tie
#define vec vector
#define forn(i, l, r) for (int i=l; i<=r; i++)
#define emp empty
#define beg begin
#define ins insert
#define cle clear
#define era erase
#define que queue
#define pque priority_queue
#define mset multiset
#define deq deque
#define sta stack
#define con const
#define rsz resize
#define ass assign
#define lowb lower_bound
#define uppb upper_bound
template<class T> void mini(T& a, T b) { a = min(a, b); }
template<class T> void maxi(T& a, T b) { a = max(a, b); }
template<class T1, class T2> ostream& operator<<(ostream &out, pair<T1, T2> a) { return out << a.first << " " << a.second; }
template<class T> ostream& operator<<(ostream& out, vector<T> a) { for (auto& i : a) out << i << " "; return out; }
template<class T> ostream& operator<<(ostream& out, set<T> a) { for (auto& i : a) out << i << " "; return out; }
template<class T> ostream& operator<<(ostream& out, multiset<T> a) { for (auto& i : a) out << i << " "; return out; }
template<class T1, class T2> ostream& operator<<(ostream& out, map<T1, T2> a) { for (auto& i : a) out << i << "\n"; return out; }
template<class T1, class T2> ostream& operator<<(ostream& out, unordered_map<T1, T2> a) { for (auto& i : a) out << i << "\n"; return out; }
template<class T> ostream& operator<<(ostream& out, queue<T> a) { while (!a.empty()) { cout << a.front() << " "; a.pop(); } return out; }
template<class T> ostream& operator<<(ostream& out, deque<T> a) { while (!a.empty()) { cout << a.front() << " "; a.pop_front(); } return out; }
template<class T> ostream& operator<<(ostream& out, priority_queue<T> a) { while (!a.empty()) { cout << a.top() << "\n"; a.pop(); } return out; }
template<class T> void out(T a) { cout << a << endl; }
template<class T1, class T2> void out(T1 a, T2 b) { cout << a << " " << b << endl; }
template<class T1, class T2, class T3> void out(T1 a, T2 b, T3 c) { cout << a << " " << b << " " << c << endl; }
template<class T1, class T2, class T3, class T4> void out(T1 a, T2 b, T3 c, T4 d) { cout << a << " " << b << " " << c << " " << d << endl; }
template<class T> void out(vector<vector<T>> a) { for (vector<T> i : a) out(i); }
void out() { cout << "OK" << endl; }
template<class T> void sort(vector<T>& a) { sort(a.begin(), a.end()); }
template<class T> void uniq(vector<T>& a) { sort(a); a.erase(unique(a.begin(), a.end()), a.end()); }
template<class T> vector<T> set_int(vector<T> a, vector<T> b) { sort(a); sort(b); vector<T> res; set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res)); return res; }
clock_t start_time; double get_time() { return (double)(clock() - start_time) / CLOCKS_PER_SEC; }
#if __SIZEOF_INT128__ >= 16
typedef __int128 LL;
istream& operator>>(istream& in, __int128& a) { int64_t b; cin >> b; a = b; return in; }
ostream& operator<<(ostream& out, const __int128 a) {
unsigned __int128 b = a < 0 ? -a : a; char buf[128]; char* c = end(buf); do { --c; *c = "0123456789"[b % 10]; b /= 10; } while (b);
if (a < 0) { --c; *c = '-'; } int len = end(buf) - c; out.rdbuf()->sputn(c, len); return out;
}
#endif
con int N = 1e5 + 5;
ll a[N];
void Solve() {
int n;
cin >> n;
forn(i, 1, n) cin >> a[i];
ll ans = 0;
ll last = 0;
forn(i, 1, n+1) {
if (!a[i]) {
ans += last / 2;
last = 0;
}
else {
last += a[i];
}
}
out(ans);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
start_time = clock();
Solve();
return 0;
}
| 0 | 59,225,064 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;cin>>N;
vector<int>V(N+1);
for(int X=1;X<=N;X++){
cin>>V[X];
}
int I=0;
for(int X=1;X<=N;X++){
if(V[X]>V[X-1]){
I+=V[X]-V[X-1];
}
}
cout<<I<<endl;
}
|
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main(){
int meter[10];
int a,i,j,temp;
char str[1024];
for(i = 0;i < 10;i++){
scanf("%d",&a);
meter[i] = a;
}
for (i = 0; i < 10; i++) {
for (j = 9; j > i; j--) {
if (meter[j - 1] < meter[j]) {
temp = meter[j];
meter[j] = meter[j - 1];
meter[j - 1]= temp;
}
}
}
for(i = 0;i < 3;i++){
printf("%d\n",meter[i]);
}
return 0;
}
| 0 | 15,971,516 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,m,n,maxi=0,f=0,g=0,mini=INF,sum=0;
ll k;
string str,stra;
cin>>n>>str>>a;
a--;
rep(i,str.length()){
if(str[i]!=str[a]) cout<<"*";
else cout<<str[a];
}
ln;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
int divr[maxn];
void divisor()
{for(int i=2;i<sqrt(maxn);i++)
{
if(!divr[i])
{
for(int j=i*i;j<maxn;j+=i)if(!divr[j])divr[j]=i;
}
}
for(int i=1;i<maxn;i++)if(!divr[i])divr[i]=i;
}
int main()
{
string s;
cin>>s;
int ct0=0,ct1=0;
for(int i=0;i<s.length();i++)
{
if(s[i]=='1')ct1++;
else ct0++;
}
cout<<2*min(ct1,ct0);
}
| 0 | 22,919,531 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int K; cin >> K;
ll A[K]; rep(i, K) cin >> A[i];
ll ulim = 2, dlim = 2;
for(int i = K-1; i >= 1; i--){
ulim = (ulim - (ulim % A[i])) + A[i] - 1;
ulim -= (ulim % A[i-1]);
if(dlim % A[i-1] > 0){
dlim += (A[i-1] - dlim % A[i-1]);
}
if(ulim == 0){
cout << -1 << endl;
return 0;
}
}
ll s0 = ulim+A[0]-1;
ll s1 = dlim;
rep(i, K){
if(s0 % A[i] > 0) s0 -= s0 % A[i];
if(s1 % A[i] > 0) s1 -= s1 % A[i];
}
if(s0 == 2 && s1 == 2) cout << dlim << " " << ulim+A[0]-1 << endl;
else cout << -1 << endl;
return 0;
}
void solve(){}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int>> g(n,vector<int>());
for (int i = 0; i < n; i++)
{
int u,k;
cin >> u >> k;
for (int j = 0; j < k; j++)
{
int v;
cin >> v;
v--;
g[i].push_back(v);
}
}
vector<int> dist(n,-1);
dist[0] = 0;
queue<int> q;
q.push(0);
while(!q.empty()){
int node = q.front();
q.pop();
for(int next:g[node]){
if(dist[next]!=-1) continue;
dist[next] = dist[node]+1;
q.push(next);
}
}
for (int i = 0; i < n; i++)
{
cout << i+1 << " " << dist[i] << endl;
}
}
| 0 | 69,856,073 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,l[52],i,j,sum=0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>l[i];
}
sort(l,l+n);
for(j=n-1;j>=n-k;j--){
sum+=l[j];
}
cout<<sum;
return 0;
}
|
#include <cstring>
#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 <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)
const int MXN = 1e5 + 5;
const long long MNN = 2e3 + 200;
const long long MOD = 10;
const long long INF = 1e18;
const int OO = 1e9 + 500;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
llong n;
llong b[MXN], mx, cnt[65], ans;
llong sum;
llong maxXor(llong n){
for (long long q = 60; q >= 0; --q) {
for(llong j = 1; j <= n; j++) {
if(((1LL << q) & b[j])) {
int ok = 1;
for (long long t = q + 1; t <= 60; ++t) {
if (((1LL << t) & b[j]) != 0) {
ok = 0;
break;
}
}
if (ok == 0) continue;
for (int t = 1; t <= n; ++t) {
if (t == j) continue;
if ((1LL << q) & b[t]) {
b[t] ^= b[j];
}
}
break;
}
}
}
llong res = 0;
for (llong i = 1; i <= n; i++) {
res ^= b[i];
}
return res;
}
int main(){
ios;
cin >> n;
for(llong i = 1; i <= n; i++){
cin >> b[i];
for(llong j = 61; j >= 0; j--){
if((b[i] >> j) & 1){
cnt[j]++;
}
}
}
for(llong i = 0; i <= 61; i++){
if(cnt[i] % 2 == 1){
ans += (1LL << i);
for(llong j = 1; j <= n; j++) {
if((b[j] >> i) & 1){
b[j] ^= (1LL << i);
}
}
}
}
for(int i = 1; i <= n; i++) {
sum ^= b[i];
}
llong mx = maxXor(n);
cout << (sum ^ mx) + mx + ans;
return 0;
}
| 0 | 62,606,203 |
#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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout<<fixed<<setprecision(x)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int two(int n){
ll ans=1;
rep(i,n){
ans*=2;
}
return ans;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s,t; cin>>s>>t;
sort(s.begin(),s.end());
sort(ALL(t));
reverse(ALL(t));
if(s<t)cout<<"Yes\n";
else cout <<"No\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b,ll c){if(a==b)out(c);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi ans;
int cnt,n;
bool solve(int a,int b){
if(b<=0)return false;
if(b==1){
if(a<cnt)return false;
rep(i,cnt)ans[i]=n-cnt+1+i;
return true;
}
if(b>=cnt-a+1){
rep(i,b)ans[i]=n-cnt+b-i;
REP(i,b,cnt)ans[i]=n-cnt+i+1;
return true;
}
rep(i,a)ans[cnt-a+i]=n-cnt+i+1;
cnt-=a;
return solve(a,b-1);
}
int main(){
ll a,b;cin>>n>>a>>b;
ans=vi(n);
if(a>n||b>n)dame(-1);
if(a==n){
if(b!=1)dame(-1);
rep(i,n)ans[i]=i+1;
outv(ans);
return 0;
}
if(b==n){
if(a!=1)dame(-1);
rep(i,n)ans[i]=n-i;
outv(ans);
return 0;
}
if(a==1||b==1)dame(-1);
if(a+b>n+1)dame(-1);
cnt=n-a;
rep(i,a)ans[n-i-1]=a-i;
if(solve(a,b-1))outv(ans);
else dame(-1);
}
| 0 | 38,977,091 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
int n, i, A, B, mid, mid2;
vector<int> data;
pair<int, int> best;
int main()
{
scanf("%d", &n);
data.resize(n);
for (auto& e: data) scanf("%d", &e);
sort(data.begin(), data.end());
A = data.back();
mid = A / 2;
mid2 = (A + 1) / 2;
best = mp(A + 3, -1);
for (auto e : data) {
if (e == A) continue;
if (e <= mid) {
best = min(best, mp(mid - e, e));
} else {
best = min(best, mp(e - mid2, e));
}
}
B = best.second;
printf("%d %d", A, B);
return 0;
}
|
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
#define mp make_pair
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1ll << 60;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int N;
ll A[int(1e5 + 5)], DP[int(1e5 + 5)];
int main(){
cin >> N;
fill(DP, DP + N + 1, 1e16);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] <= DP[0]){
DP[0] = A[i]; continue;
}
int L = 0, R = N;
while (R - L > 1){
int Mid = (L + R) / 2;
if (DP[Mid] < A[i]) L = Mid;
else R = Mid;
}
DP[R] = A[i];
}
for (int i = 0; i <= N; i++){
if (DP[i] == 1e16){
cout << i << endl; return 0;
}
}
return 0;
}
| 0 | 83,578,486 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
cout << (s < t ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll n;cin >> n;
vl v(n);rep(i,n)cin >> v[i];
ll ng=0,ok=INF;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
ll res=mid;
rep(i,n){
res-=res%v[i];
}
if(res>=2)ok=mid;
else ng=mid;
}
pl ans={ok,-1};
ok=0;ng=INF;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
ll res=mid;
rep(i,n){
res-=res%v[i];
}
if(res<=2)ok=mid;
else ng=mid;
}
ans.se=ok;
bool check=true;
ll res=ans.fi;
rep(i,n)res-=res%v[i];
if(res!=2)check=false;
rep(i,n)ok-=ok%v[i];
if(ok!=2)check=false;
if(check&&ans.fi<=ans.se)cout << ans.fi <<" " << ans.se << endl;
else cout << -1 <<endl;
}
| 0 | 87,222,464 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int a[4];
int main() {
rep(i, 4) cin >> a[i];
sort(a, a+4);
if (a[0] == 1 && a[1] == 4 && a[2] == 7 && a[3] == 9) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: " << v[__i] << endl; \
}\
}while(0)
#else
#define Print(v) ((void)0)
#define PrintVec(v) ((void)0)
#endif
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = int64_t;
const int HMax = 1005;
const int WMax = 1005;
const int M = 1e9 + 7;
ll dp[HMax][WMax];
int main(int, const char**)
{
int H, W;
cin >> H >> W;
vector<string> grid(H);
rep(i, H)
{
cin >> grid[i];
}
dp[0][0] = 1;
struct Point
{
int x;
int y;
};
queue<Point> q;
q.push({0, 0});
rep(i, H)
{
rep(j, W)
{
if(i == 0 && j == 0 && grid[0][0] == '.')
{
dp[0][0] = 1;
continue;
}
if(grid[i][j] == '.')
{
auto u = i == 0 ? 0 : dp[i - 1][j];
auto l = j == 0 ? 0 : dp[i][j - 1];
dp[i][j] = (u + l) % M;
}
}
}
cout << dp[H - 1][W - 1] << endl;
return 0;
}
| 0 | 16,829,309 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD =1000000007;
ll modPow(ll a, ll n) {
if (n == 0) return 1;
if (n == 1) return a % MOD;
if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
ll t = modPow(a, n / 2);
return (t * t) % MOD;
}
ll modComb(ll n,ll a){
ll x=1,y=1;
rep(i,a){
x*=n-i;
x%=MOD;
y*=i+1;
y%=MOD;
}
y=modPow(y,MOD-2);
return (x*y)%MOD;
}
int main(){
ll X,Y,m,n;
cin >> X >> Y;
if((X+Y)%3!=0){
cout << 0 << endl;
return 0;
}
m=(2*X-Y)/3;
n=(2*Y-X)/3;
if(n<0||m<0){
cout << 0 << endl;
return 0;
}
cout << modComb(n+m,n) << endl;
}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int (i)=(n); (i)>=(0); (i)--)
#define SIZE(x) ((int)(x).size())
#define GCD(a, b) int gcd(int a,int b){return b?gcd(b,a%b):a;}
#define QP(a, b) int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define all(v) (v).begin(),(v).end()
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
template<typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
typedef vector<int, int> vint;
typedef pair<int,int> pint;
typedef vector<pint>vpint;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1LL << 60;
const ll MOD = 1000000007LL;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
if(s[2] == s[3] && s[4] == s[5]) cout << "Yes";
else cout << "No";
cout << endl;
return 0;
}
| 0 | 50,757,177 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,left,right;
int n,m;
while(1){
cin>>s;
if(s=="-")break;
cin>>n;
for(int i=0;i<n;i++){
cin>>m;
left=s.substr(0,m);
right=s.substr(m,s.length());
s=right+left;
}
cout<<s<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(2);
int k;
cin >> a[0] >> a[1] >> k;
int times = 0;
int side = 0;
while(1){
if(a[side] % 2 == 1) a[side] -= 1;
a[side] /= 2;
a[(side+1)%2] += a[side];
side += 1;
side %= 2;
times += 1;
if(times == k) break;
}
cout << a[0] << " " << a[1] << endl;
return 0;
}
| 0 | 38,033,175 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int n,t,i,j;
string s;
int c[26],m[26];
cin >> n;
fill(m,m+26,50);
for(i=0;i<n;i++){
cin >> s;
fill(c,c+26,0);
for(j=0;j<s.size();j++)
c[(int)(s[j]-'a')]++;
for(j=0;j<26;j++)
m[j]=min(m[j],c[j]);
}
for(i=0;i<26;i++)
for(j=0;j<m[i];j++)
cout << (char)('a'+i);
cout << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#define nmax_def 110000
#define Cmax_def 2200
#define mod 1000000007
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Inf 1000000000000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int main() {
int N, K;
cin >> N >> K;
vl H(N + 1);
rep(i, N + 1) {
if (i == 0) {
H[0] = 0;
continue;
}
cin >> H[i];
}
vector<vector<vl>> dp(N + 1);
rep(n, N + 1) {
dp[n].resize(K + 1);
rep(k, K + 1) {
dp[n][k].resize(N + 1);
rep(r, N + 1) {
dp[n][k][r] = Inf;
}
}
}
dp[0][0][0] = 0;
rep(n, N + 1) {
if (n == 0)
continue;
rep(k, K + 1) {
rep(r, N + 1) {
ll Hdiff = max(H[n] - H[r], (ll)0);
dp[n][k][n] = min(dp[n][k][n], dp[n - 1][k][r] + Hdiff);
if (k == K)
continue;
dp[n][k + 1][r] = min(dp[n][k + 1][r], dp[n - 1][k][r]);
}
}
}
ll ans = Inf;
rep(k, K + 1) {
rep(r, N + 1) {
ans = min(ans, dp[N][k][r]);
}
}
cout << ans << endl;
return 0;
}
| 0 | 17,831,902 |
#include <iostream>
using namespace std;
const int nmax=100005;
long long sum,a[nmax],d[nmax];
int n,i;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum+=a[i];
}
if(sum%(1LL*n*(n+1)/2))
{
cout<<"NO";
return 0;
}
long long k=(sum/((1LL*n*(n+1)/2)));
a[n+1]=a[1];
for(i=1;i<=n;i++)
{
d[i]=a[i+1]-a[i];
if(k-d[i]<0||(k-d[i])%n)
{
cout<<"NO";
return 0;
}
}
cout<<"YES";
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Write(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
template <typename T> void Write(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }
struct Read {
std::size_t szi, szj;
Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
std::vector<std::pair<T, U>> a(szi);
for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
}
};
struct Reads {
template <typename T> Reads(T& a) { std::cin >> a; }
template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
};
Read read;
}
int main() {
int n = read;
vector<ll> a = Read(n);
vector<ll> b = Read(n);
ll cnt = 0;
rep(i, n) {
ll dif = b[i] - a[i];
if (dif > 0) {
cnt += dif / 2;
}
else if (dif < 0) {
cnt += dif;
}
}
Write(Yes(cnt >= 0));
return 0;
}
| 0 | 45,256,794 |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int a,b;
int main()
{while(1){
cin>>a>>b;
if(!a&&!b) return 0;
cout<<min(a,b)<<' '<<max(a,b)<<endl;
}}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
int main() {
INIT;
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(ALL(A));
vector<ll> sum(N, 0);
sum[0] = A[0];
reps(i, 1, N) { sum[i] = sum[i - 1] + A[i]; }
ll ans = 1;
repr(i, N - 2) {
if (sum[i] * 2 >= A[i + 1]) {
ans++;
} else {
break;
}
}
cout << ans << endl;
return 0;
}
| 0 | 84,958,510 |
#include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define all(v) v.begin(),v.end()
#define pb push_back
#define endl '\n'
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pi;
typedef pair<long long,long long> pll;
typedef set<int> si;
const ll mod = 1e9 + 7;
const ll modl=998244353;
const double pie=3.1415926535;
ull power(ull x,ull y){
if(y==0) return 1;
else{
if(y%2==0) return power(x*x,y/2);
else return x*power(x*x,(y-1)/2);
}
}
ll mod_power(ll x, ll y, ll m)
{
ll r = 1;
x = x % m;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
r = (r*x) % m;
y = y/2;
x = (x*x) % m;
}
return r;
}
ll gcd(ll x,ll y){
if(y==0)return x;
return gcd(y,x%y);
}
int main(){
boost;
int TESTS=1;
while(TESTS--){
int h,n;
cin>>h>>n;
int sum=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
sum+=x;
}
if(sum>=h)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
signed main() {
int n, m;
long double sum = 0;
cin >> n >> m;
vector<int> vec(n);
rep(i, n) {
cin >> vec[i];
sum += vec[i];
}
sort(vec.rbegin(), vec.rend());
if (vec[m - 1] >= sum / (4 * m)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0 | 56,452,689 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int main(){
string s;
cin >> s;
char ans = '0';
map<char, int> mp;
for (char c: s) {
mp[c]++;
}
if (mp.size()==26) {
cout << "None" << endl;
return 0;
}
rep(i, 26) {
if (mp['a'+i]==0) {
ans = 'a'+i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 2000005 ;
int pre[maxn];
int dis[maxn];
int Find(int x)
{
if(pre[x]==x)
return x;
int r=Find(pre[x]);
dis[x]=dis[pre[x]]+dis[x];
return pre[x]=r;
}
int Union(int x, int y, int z)
{
int fx = Find(x);
int fy = Find(y);
if (fx == fy)
return (z == dis[y] - dis[x]);
pre[fy] = fx;
dis[fy] = dis[x] + z - dis[y];
return 1;
}
int x[maxn];
int y[maxn];
int z[maxn];
int main()
{
int n, m;
int flag = 1;
cin >> n >> m;
for (int i = 1; i <= n; i++)
pre[i]=i;
for (int i = 1; i <= m; i++)
{
cin >> x[i] >> y[i] >> z[i];
}
for(int i =1;i<=m;i++)
{
flag = Union(x[i], y[i], z[i]);
if(flag == 0)
goto end;
}
end:
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0 | 9,523,303 |
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
using namespace std;
int main()
{
int n,ta=0,ha=0;
string a,b;
cin >> n;
vector<string> taro;
vector<string> hana;
for(int i=0;i<n;i++){
cin >> a >> b;
taro.push_back(a);
hana.push_back(b);
for(int j=0;j<10000;j++){
if(taro[i] == hana[i]){
ta++;
ha++;
break;
}
if(taro[i].substr(0,j) > hana[i].substr(0,j)){
ta += 3;
break;
}
else if(hana[i].substr(0,j) > taro[i].substr(0,j)){
ha+=3;
break;
}
}
}
cout << ta <<" "<< ha << 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))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
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;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
signed main() {
ll N, M;
cin >> N >> M;
vector<P> p;
rep(i, N) {
ll a, b;
cin >> a >> b;
p.pb({a, b});
}
SORT(p);
ll ans = 0;
ll count = 0;
rep(i, N) {
P pp = p[i];
rep(j, pp.second) {
ans += pp.first;
count++;
if (count == M) {
COUT(ans);
return 0;
}
}
}
return 0;
}
| 0 | 99,270,976 |
#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 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll H,W;
cin >> H >> W;
if(H%3==0||W%3==0){
cout << 0 << endl;
}else{
ll ans = min(H,W);
FOR(i,H/3-5,H/3+5){
FOR(j,W/2-5,W/2+5){
if(i<0||i>H-1||j<0||j>W-1) continue;
ll x = i*W;
ll y = (H-i)*j;
ll z = (H-i)*(W-j);
ll MAX = max(x,max(y,z));
ll MIN = min(x,min(y,z));
ans = min(ans,MAX-MIN);
}
}
FOR(i,W/3-5,W/3+5){
FOR(j,H/2-5,H/2+5){
if(i<0||i>W-1||j<0||j>H-1) continue;
ll x = i*H;
ll y = (W-i)*j;
ll z = (W-i)*(H-j);
ll MAX = max(x,max(y,z));
ll MIN = min(x,min(y,z));
ans = min(ans,MAX-MIN);
}
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
ll mod_pow(ll x, ll n){
ll ans=1;
x%=MOD;
while(n!=0){
if(n&1) ans=ans*x%MOD;
x=x*x%MOD;
n=n>>1;
}
return ans%MOD;
}
int main(){
int N,K; cin >> N >> K;
ll ans=0;
map<int,ll> ma;
for(int i=K;i>=1;i--){
int tmp=K/i;
ll res=mod_pow(tmp,N);
for(int j=2;j<=tmp;j++){
ll k=i*j;
res=(res-ma[k]+MOD)%MOD;
}
ma[i]=res;
ans+=(res*i)%MOD;
ans%=MOD;
}
cout << ans << endl;
}
| 0 | 41,041,167 |
#include <iostream>
using namespace std;
int n,banyak[100010],total,maks=0,a;
int main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a;
banyak[a]++;
}
for(int i=1;i<=100000;i++) {
total=banyak[i]+banyak[i+1]+banyak[i-1];
if(maks<total) {
maks=total;
}
}
cout<<maks<<endl;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "Yes";
int h, w;
cin >> h >> w;
vector<string> S(h);
for (int i = 0; i < h; ++i)
{
cin >> S[i];
}
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
for (int i = 0; i < h; ++i)
{
for (int j = 0; j < w; ++j)
{
if (S[i][j] == '#')
{
bool can = false;
for (int k = 0; k < 4; ++k)
{
int ni = i + dx[k];
int nj = j + dy[k];
if (ni < 0 || ni > h - 1)
{
continue;
}
if (nj < 0 || nj > w - 1)
{
continue;
}
if (S[ni][nj] == '#')
{
can = true;
}
}
if (can == false)
{
ans = "No";
}
}
}
}
cout << ans << endl;
}
| 0 | 19,912,040 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if ((a < b) && (b < c)) {
cout << "Yes\n";
} else{
cout << "No\n";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
#define M 16777216
#define L 14
int H[M][L] = { 0 };
int getChar(char ch) {
if (ch == 'A') return 0;
else if (ch == 'C') return 1;
else if (ch == 'G') return 2;
else if (ch == 'T') return 3;
}
long long getKey(string str) {
long long sum = 0, p = 1, i;
for (i = 0; i < str.size(); i++) {
sum += p * (getChar(str[i]));
p *= 4;
}
return sum;
}
int find(string str)
{
return H[getKey(str)][str.size()];
}
int insert(string str)
{
return ++H[getKey(str)][str.size()];
}
int main() {
int i, n;
string str, cmd;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> cmd >> str;
if (cmd == "insert") {
insert(str);
}
else if (cmd == "find")
{
if (find(str)) {
cout << "yes" << endl;
}
else {
cout << "no" << endl;
}
}
}
return 0;
}
| 0 | 91,684,230 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<P> d;
rep(i, n) {
int a, b;
cin >> a >> b;
d.push_back({a, b});
}
sort(d.begin(), d.end());
ll ans = 0;
rep(i, n) {
int buy = min(m, d[i].second);
ans += (ll)d[i].first * buy;
m -= buy;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int m, k;
cin >> m >> k;
int power = 1;
for(int i = 1; i <= m; i++){
power = power * 2;
}
if(k >= power){
cout << "-1";
return 0;
}
if(m == 1 && k == 1){
cout << "-1";
return 0;
}
if(m == 1 && k == 0){
cout << "0 0 1 1";
return 0;
}
else{
for(int i = 0; i < power; i++){
if(i == k){
continue;
}
cout << i << ' ';
}
cout << k << ' ';
for(int i = power - 1; i >= 0; i--){
if(i == k){
continue;
}
cout << i << ' ';
}
cout << k << ' ';
}
return 0;
}
| 0 | 96,716,878 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.