code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define fs first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define LB(a,x) lb(all(a), x) - a.begin()
#define UB(a,x) ub(all(a), x) - a.begin()
#define printfdouble(x) printf("%.12f\n",(x))
#define chartoint(c) (int)((c) - '0')
#define chartoll(c) (long long)((c) - '0')
#define MOD 1000000007
#define itn int
#define enld endl
#define ednl endl
#define icn cin
#define Endl endl
#define stirng string
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
using Graph = vector<vector<int>>;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b){if(b<a){a=b; return 1;} return 0;}
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
ll H,W; cin >> H >> W;
ll tmp = 100100100100100100;
reps(h,1,H-1){
ll h1 = (H-h)/2;
chmin(tmp, max(max(h*W, h1*W),(H-h-h1)*W) - min(min(h*W, h1*W),(H-h-h1)*W));
ll w1 = W/2;
chmin(tmp, max(max(h*W, w1*(H-h)),(W-w1)*(H-h)) - min(min(h*W, w1*(H-h)),(W-w1)*(H-h)));
}
reps(w,1,W-1){
ll w1 = (W-w)/2;
chmin(tmp, max(max(w*H, w1*H),(W-w-w1)*H) - min(min(w*H, w1*H),(W-w-w1)*H));
ll h1 = H/2;
chmin(tmp, max(max(w*H, h1*(W-w)),(H-h1)*(W-w)) - min(min(w*H, h1*(W-w)),(H-h1)*(W-w)));
}
cout << tmp << ednl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
typedef long long ll;
ll dp[100000];
int v[100000];
int main()
{
int n, k;
while (scanf("%d%d", &n, &k), n|k) {
for (int i=0; i<n; ++i) scanf("%d", v+i);
dp[k-1] = 0;
for (int i=0; i<k; ++i) dp[k-1] += v[i];
for (int i=k; i<n; ++i) dp[i] = dp[i-1] - v[i-k] + v[i];
printf("%lld\n", *std::max_element(dp+k-1, dp+n));
}
return 0;
}
| 0
| 82,412,691
|
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int main(){
priority_queue<int> q;
string cmd;
while(cin>>cmd && cmd!= "end"){
if(cmd == "insert"){
int k;
cin >> k;
q.push(k);
}else if(cmd == "extract"){
int k = q.top();
q.pop();
cout << k << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int min(int a,int b)
{
return a<=b? a:b;
}
int main()
{
int n,i,sum=0;
cin>>n;
int arr[2*n];
for(i=0 ; i<2*n ; i++)
cin>>arr[i];
sort(arr,arr+2*n);
for(i=0 ; i<2*n ;)
{
sum=sum+min(arr[i],arr[i+1]);
i=i+2;
}
cout<<sum;
}
| 0
| 9,959,158
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end()
#define fi first
#define se second
#define foe(i,a,b) for(ll i=a;i<b;i++)
#define sz(s) s.size()
#define mem(a,s) memset(a,s,sizeof(a))
#define all(v) v.bi,v.ei
#define MAX 8000000000000000064LL
#define MIN -8000000000000000064LL
ll add(ll a, ll b){return (a%MOD + b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll sub(ll a, ll b){return (a%MOD - b%MOD + ((MAX)/MOD)*MOD)%MOD;}
ll mul(ll a, ll b){return ((a%MOD)*(b%MOD) + ((MAX)/MOD)*MOD)%MOD;}
bool isPrime(ll n)
{
if (n <= 1)
return false;
for (ll i = 2; i*i <= n; i++)
if (n % i == 0)
return false;
return true;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = mul(res,a);
a = mul(a,a);
b >>= 1;
}
return res%MOD;
}
bool compare(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.se>b.se);
}
ll lcm(ll a,ll b)
{
return(a*b)/__gcd(a,b);
}
ll fact[1000007]={0};
ll expo(ll x, ll y) {ll res=1;x=x%MOD;while(y>0){if(y&1)res=(1ll*res*x)%MOD;
y=y>>1;x=(1ll*x*x)%MOD;} return res;}
void facto() {fact[0]=1;fact[1]=1;for(ll i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%MOD;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(expo(fact[r],MOD-2)))%MOD; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res;}
ll npr(ll n,ll r) {facto(); ll res=1; res=fact[n]; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res; }
int const N=2e5+9;
int const INF = 1e9+5;
void solve()
{
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<ll>v1,v2,v3;
foe(i,0,a)
{
ll d;
cin>>d;
v1.pb(d);
}
foe(i,0,b)
{
ll d;
cin>>d;
v2.pb(d);
}
foe(i,0,c)
{
ll d;
cin>>d;
v3.pb(d);
}
sort(all(v1),greater<ll>());
sort(all(v2),greater<ll>());
for(ll i=0;i<x;i++)
{
v3.pb(v1[i]);
}
foe(i,0,y)
{
v3.pb(v2[i]);
}
sort(all(v3),greater<ll>());
ll ans=0;
foe(i,0,x+y)
{
ans+=v3[i];
}
cout<<ans<<'\n';
}
int main()
{
fast
{
solve();
}
}
|
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int a, b;
cin >> a >> b;
int i = 1;
while((int)(i * 0.08) <= a && (int)(i * 0.1) <= b)
{
double x = i * 0.08;
double y = i * 0.1;
if ((int)x == a && (int)y == b)
{
cout << i;
return 0;
}
i++;
}
cout << -1;
return 0;
}
| 0
| 86,100,935
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
vector<int>h(n);
int ans=0,mx=0;
for (int i = 0; i < n; ++i) {
cin >>h[i];
if(h[i]>=mx){
ans++;
mx=h[i];
}
}
cout <<ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
ll n, k;
vector<ll> a(20);
ll solve (vector<ll> &d) {
ll mx = 0, res = 0, p = 0;
rep(i, k) {
while (p < d[i]) {
mx = max(mx, a[p]);
p++;
}
res += max(mx+1-a[p], 0ll);
mx = max(mx+1, a[p]);
p++;
}
return res;
}
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
ll ans = 1e15;
rep(i, 1<<n) {
vector<ll> d;
rep(j, n) if (i>>j & 1) d.push_back(j);
sort(all(d));
if (d.size() != k) continue;
ans = min(ans, solve(d));
}
cout << ans << endl;
return 0;
}
| 0
| 78,194,871
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
char a,b;
cin>>a>>b;
if(a=='H'&&b=='H'||a=='D'&&b=='D')cout<<'H'<<endl;
else cout<<'D'<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
string s;
cin >> n >> s >> k;
int kk = k - 1;
for(int i = 0; i < n; i++){
if(s[i] == s[kk]){
cout << s[i];
}
else{
cout << "*";
}
}
return 0;
}
| 0
| 37,755,445
|
#include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
return vector<vector<T>>( r, vector<T>( c, v ) ) ;
}
template<class T>
auto matrix( int o1, int o2, int o3, T v ){
return vector<vector<vector<T>>>( o1, vector<vector<T>>( o2, vector<T>( o3, v ) ) ) ;
}
#define v vector
int power( int x, int n ){
if( n == 0 ) return 1 ;
else if( n & 1 ) return ( x * power( (x*x) % mod, n / 2 ) ) % mod ;
return power( (x*x) % mod, n / 2 ) % mod ;
}
template<class T> void __print( v<T> &arr ){
int n = arr.size() ;
cerr << "[ " ;
for( int i = 0 ; i < n ; i++ ) {
cerr << arr[i] ;
if( i != n - 1 ) cerr << ", " ;
}
cerr << " ]" << endl ;
}
template<class T> void __print( T arr[], int n ){
cerr << "[ " ;
for( int i = 0 ; i < n ; i++ ) {
cerr << arr[i] ;
if( i != n - 1 ) cerr << ", " ;
}
cerr << " ]" << endl ;
}
#define print(x) cerr << "{ " << #x << " : " << x << " } " ;
#define println(x) cerr << "{ " << #x << " : " << x << " }" << endl ;
int solve( int n ){
int cnt = 0, c = 0 ;
for( int i = 2 ; i * i <= n ; i++ ){
c = 0 ;
while( n % i == 0 ){
n /= i ;
++c ;
}
if( c >= 0 ){
cnt += floor(( -1 + sqrt(1 + 8*c) ) * 1.0 / 2) ;
}
}
if( n > 2 ) ++cnt ;
return cnt ;
}
signed main(){
int n ; cin >> n ;
cout << solve(n) << endl ;
return 0 ;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
map<int,int> mp;
rep(i,N) {
int a;
cin >> a;
++mp[a];
}
int ans = 0;
for(auto e:mp){
int f = e.first;
int s = e.second;
if(f>s) ans+=s;
else if(f<s) ans+=(s-f);
}
cout << ans << endl;
}
| 0
| 97,179,886
|
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main(){
int k;
cin >> k;
vector<int> v(33);
v[1]=1;
v[2]=1;
v[3]=1;
v[4]=2;
v[5]=1;
v[6]=2;
v[7]=1;
v[8]=5;
v[9]=2;
v[10]=2;
v[11]=1;
v[12]=5;
v[13]=1;
v[14]=2;
v[15]=1;
v[16]=14;
v[17]=1;
v[18]=5;
v[19]=1;
v[20]=5;
v[21]=2;
v[22]=2;
v[23]=1;
v[24]=15;
v[25]=2;
v[26]=2;
v[27]=5;
v[28]=4;
v[29]=1;
v[30]=4;
v[31]=1;
v[32]=51;
cout << v[k] << endl;
}
|
#include<stdio.h>
main(){
int n,x;
int i,j,k;
int num;
int sum;
while(1){
num = 0;
scanf("%d %d",&n,&x);
if(n == 0 && x == 0) break;
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
for(k=j+1;k<=n;k++){
sum = i+j+k;
if(sum == x){
num++;
}
}
}
}
printf("%d\n",num);
}
return 0;
}
| 0
| 84,045,259
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
vector<ll>ok;
vector<ll>ng;
vector<P>ans;
void f(){
if(ng.empty()){
return;
}
ll copy=min(ng.size(),ok.size());
auto addok=[&](){
ll c=ok.back();ll d=ng.back();
ok.pop_back();ng.pop_back();
ans.push_back({c,d});
ok.push_back(c-d);
};
auto addng=[&](){
ll c=ok.back();ll d=ng.back();
ok.pop_back();ng.pop_back();
ans.push_back({d,c});
ng.push_back(d-c);
};
for (ll i = 0; i < copy; ++i) {
if(ok.size()>ng.size())addng();
else addok();
}
f();
}
int main(){
ll n;cin >>n;
vector<ll>a(n);
for (int i = 0; i < n; ++i) {
cin >>a[i];
}
sort(all(a));
if(a[n-1]<0){
ok.push_back(a.back());
a.pop_back();
}
reverse(all(a));
if(a[n-1]>=0){
ng.push_back(a[n-1]);
a.pop_back();
}
for (auto e:a) {
if(e>=0)ok.push_back(e);
if(e<0)ng.push_back(e);
}
f();
cout <<ok[0]<<endl;
for(auto p:ans){
cout <<p.first<<" "<<p.second<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define trav(var, container) for(auto& var: container)
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_pbds;
using ld = long double;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
struct chash {
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return __builtin_bswap64(x*C); }
};
ll my_ceil(ll a, ll b) {
if(a <= 0) return 0;
ll x = a + b - 1;
if(x >= b) return x / b;
return 1;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
ll h;
cin >> n >> h;
vector<pair<ll, ll>> v(n);
ll maxA = LLONG_MIN;
for(auto& i: v) {
cin >> i.first >> i.second;
maxA = max(maxA, i.first);
}
sort(all(v), [](auto& a, auto& b) {
return a.second > b.second;
});
ll ans = LLONG_MAX;
ll cum_sum = 0;
ans = my_ceil(h, maxA);
int cnt = 0;
for(auto& i: v) {
ll b = i.second;
cum_sum += b;
++cnt;
ans = min(my_ceil(h - cum_sum, maxA) + cnt, ans);
}
cout << ans;
return 0;
}
| 0
| 88,711,611
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
long long K;
cin >> K;
string T = S + S;
string T_ = S + S + S;
long long N = S.size();
long long count = 0;
for (int i = 1; i < N; i++){
if (S[i] == S[i - 1]){
count++;
i++;
}
}
long long count_ = 0;
for (int i = 1; i < 2 * N; i++){
if (T[i] == T[i - 1]){
count_++;
i++;
}
}
count_ -= count;
long long count__ = 0;
for (int i = 1; i < 3 * N; i++){
if (T_[i] == T_[i - 1]){
count__++;
i++;
}
}
count__ -= count + count_;
if (count == count_) cout << count * K << endl;
else {
if (count_ == count__){
cout << count + count_ * (K - 1) << endl;
}
else {
if (K % 2 == 0) cout << (K / 2) * (count + count_) << endl;
else cout << count + (count + count_) * ((K - 1) / 2) << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define nmax 200001
#define pll pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define fill_nums(A,n) for(ll i=0;i<n;i++) scanf("%lld",&A[i]);
#define fill_edges(adj,m) for(ll i=0;i<m;i++) {ll a, b; scanf("%lld %lld",&a,&b); adj[a-1].pb(b-1); adj[b-1].pb(a-1);}
#define fill_direct(adj,m) for(ll i=0;i<m;i++) {ll a, b; scanf("%lld %lld",&a,&b); adj[a-1].pb(b-1);}
#define PI 3.141592654
double findang(ll a_, ll b_) {
if(!a_ && !b_)
return 0;
double a = abs(a_), b = abs(b_);
double ang = acos(a/sqrt(a*a+b*b));
if(a_>=0 && b_<0)
return 2*PI - ang;
if(a_<0 && b_<=0)
return PI + ang;
if(a_<0 && b_>0)
return PI - ang;
return ang;
}
int main() {
ll n; cin>>n;
vector<pll> A(n);
vector<pair<double, int>> angs(n);
for(int i=0;i<n;i++) {
cin>>A[i].first>>A[i].second;
angs[i] = mp(findang(A[i].first, A[i].second), i);
}
sort(ALL(angs));
ll maxi = 0;
for(int i=0;i<n;i++) {
ll x = 0;
ll y = 0;
for(int j=0;j<n;j++) {
int idx = (i+j)%n;
x += A[angs[idx].second].first;
y += A[angs[idx].second].second;
maxi = max(maxi, x*x+y*y);
}
}
cout<<fixed<<setprecision(10);
cout<<sqrt((double)maxi)<<endl;
return 0;
}
| 0
| 5,339,160
|
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
int main(){
ios_base::sync_with_stdio(0);
int n;
cin>>n;
vi a(n);
forn(i,n) cin>>a[i];
sort(all(a));
int cnt=1, max_cnt=1, i=0, j=1;
while(i<n && j<n)
{
if(a[j]-a[i]<=2)
{
j++;
cnt++;
}
else
{
max_cnt = max(max_cnt, cnt);
i++;
cnt--;
}
}
max_cnt = max(max_cnt, cnt);
cout<<max_cnt<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i,n) for(int i=0; i<(int)(n);i++)
#define REP(i,s,t) for(int i=s; i<t; i++)
#define RNG(i,s,t,u) for(int i=s; i<t; i+=u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
int main(){
int n;
cin >> n;
vector<int> dp(n+1,1e8);
dp.at(0) = 0;
vector<int> add(1,1);
REP(i,1,20){
int tmp = pow(6,i);
if(tmp > n) break;
add.push_back(tmp);
}
REP(i,1,20){
int tmp = pow(9,i);
if(tmp > n) break;
add.push_back(tmp);
}
REP(i,1,n+1){
for(int x : add){
if(i-x<0) continue;
dp.at(i) = min(dp.at(i), dp.at(i-x)+1);
}
}
cout << dp.at(n) << endl;
}
| 0
| 38,380,960
|
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << 180 * (n - 2) << endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string l;
cin >> l;
s64 dp[l.size() + 1][2];
rep (i, l.size() + 1)
{
rep (j, 2)
{
dp[i][j] = 0;
}
}
dp[0][0] = 1;
rep (i, l.size())
{
if (l[i] == '0')
{
dp[i + 1][0] += dp[i][0];
dp[i + 1][1] += dp[i][1] * 3 % MOD;
}
else
{
dp[i + 1][0] += dp[i][0] * 2 % MOD;
dp[i + 1][1] += (dp[i][1] * 3 % MOD + dp[i][0] % MOD) % MOD;
}
}
cout << (dp[l.size()][0] + dp[l.size()][1]) % MOD << "\n";
return 0;
}
| 0
| 12,048,760
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int X;
X = N-(K-1);
cout<<X<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define 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(){
char c;
cin >> c;
string s = "aiueo";
for (char x: s) {
if (c==x) {
cout << "vowel" << endl;
return 0;
}
}
string ans = "consonant";
cout << ans << endl;
return 0;
}
| 0
| 77,629,314
|
#include <bits/stdc++.h>
using namespace std ;
#define An setprecision(16)
int main(){
int N,A,B;
cin >> N >> A >> B;
int c;
int F=0,S=0,T=0;
for(int i=1;i<=N;i++){
cin >> c;
if(c<=A)F++;
else if(c<=B)S++;
else T++;
}
int ans = min(F,min(S,T));
cout << ans << endl;
}
|
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
long long int cou[2][70];
int main(){
long long int N;
cin>>N;
for(long long int i=0;i<N;i++){
long long int pa;
cin>>pa;
for(long long int i=0;i<61;i++){
cou[pa%2][i]++;
pa/=2;
}
}
long long int ans=0;
long long int rui2=1;
for(long long int i=0;i<61;i++){
ans+=((((cou[0][i]*cou[1][i])%1000000007)*rui2)%1000000007);
ans%=1000000007;
rui2*=2;
rui2%=1000000007;
}
cout<<ans<<endl;
return 0;
}
| 0
| 23,876,588
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
string s;
vector<ll> appear(26, 0);
cin >> s;
for (ll i = 0; i < s.size(); i++) {
appear[s[i] - 'a']++;
}
if(s.size()<26){
for (ll i = 0; i < 26; i++) {
if(appear[i]==0){
s += ('a' + i);
break;
}
}
}
else{
ll flag = 32;
for (ll i = s.size() - 1; i > 0; i--) {
if (s[i-1] < s[i]){
flag = i;
break;
}
}
if (flag == 32){
cout << -1 << endl;
return 0;
}
string t = s.substr(flag, s.end() - s.begin() - flag+1);
s.erase(s.begin() + flag, s.end());
ll plus = INF;
ll tt;
for (ll i = 0; i < t.size(); i++) {
tt = t[i]-'a';
if (s[s.size()-1] < t[i]) chmin(plus, tt);
}
s.pop_back();
s += ('a' + plus);
}
cout << s << endl;
}
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
int maps[50][50];
int inf=0x3f3f3f3f;
void floyd(int n)
{
for(int k=0;k<=n;k++)
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
{
if(maps[i][j]>maps[i][k]+maps[k][j])
maps[i][j]=maps[i][k]+maps[k][j];
}
}
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
int u,v,w;
int ma=-1;
memset(maps,inf,sizeof(maps));
for(int i=0;i<=50;i++) maps[i][i]=0;
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&u,&v,&w);
ma=max(ma,u);
ma=max(ma,v);
if(maps[u][v]>w)
{
maps[u][v]=maps[v][u]=w;
}
}
floyd(ma);
int mi=inf,sum,num;
for(int i=0;i<=ma;i++)
{
sum=0;
for(int j=0;j<=ma;j++)
{
sum=sum+maps[i][j];
}
if(mi>sum) mi=sum,num=i;
}
printf("%d %d\n",num,mi);
}
return 0;
}
| 0
| 88,921,689
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef long int li;
int main()
{
IOS;
int n;
cin>>n;
string s;
cin>>s;
bool ok=true;
if(n%2!=0)
ok=false;
for(int i=0;i<n/2;i++){
if(s[i]!=s[n/2+i])
ok=false;
}
if(ok)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <cctype>
#include<cstdio>
#include <string>
#include<algorithm>
using namespace std;
int main(){
while(true){
string s;
cin>>s;
if(s=="-")break;
int n;
cin>>n;
for(int i=0;i<n;i++){
int j;
cin>>j;
s=s.substr(j)+s.substr(0,j);
}
cout<<s<<endl;
}
return 0;
}
| 0
| 950,053
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
string A, B, C;
cin >> A >> B >> C;
if(A[A.size()-1] == B[0] && B[B.size()-1] == C[0]){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
}
|
#include <iostream>
using namespace std;
int n,a[1000010];
int st[1000010];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),st[a[i]]++;
int cnt=n;
for(int i=1;i<=n;++i){
for(int j=1;j*j<=a[i];++j){
if(a[i]%j==0){
int x=a[i]/j,y=j;
if(st[x]&&(x!=a[i]||st[x]>1)){
cnt--;
break;
}
if(st[y]&&(y!=a[i]||st[y]>1)){
cnt--;
break;
}
}
}
}
cout<<cnt<<endl;
return 0;
}
| 0
| 22,858,497
|
#include<stdio.h>
#include<math.h>
int main()
{
long long int a,b,ans;
double s;
scanf("%lld %lf",&a,&s);
b=round(s*100);
ans=a*b/100;
printf("%lld",ans);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, K; cin >> N >> K;
vector<ll> x(N);
vector<ll> y(N);
rep(i, N){
cin >> x[i] >> y[i];
}
ll ans = (1e18) * 5;
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++){
for (int k = 0; k < N; k++){
for (int l = 0; l < N; l++){
if(x[i] <= x[j] && y[k] <= y[l]){
int cnt = 0;
for (int m = 0; m < N; m++){
if(x[m] >= x[i] && x[m] <= x[j] && y[m] >= y[k] && y[m] <= y[l]){
cnt++;
}
}
if(cnt >= K){
ans = min(ans, (x[j] - x[i]) * (y[l] - y[k]));
}
}
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 28,871,407
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M=1000000007;
int main(){
int N;cin>>N;
vector<int> h(N);
rep(i,N) cin>>h[i];
vector<int> dp(N+1);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<=N;i++){
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]));
}
cout<<dp[N-1]<<endl;
}
|
#include <algorithm>
#include <cstdio>
#include <vector>
class PriorityQueue {
std::vector<int> v_;
public:
void insert(int i)
{
v_.push_back(i);
upto(v_.size()-1);
}
int extract_max()
{
const auto max = v_.front();
v_[0] = v_.back();
v_.pop_back();
downto(0);
return max;
}
private:
void upto(int k)
{
while (k > 0) {
auto p = (k-1)/2;
if (v_[p] > v_[k]) {
break;
}
std::swap(v_[p], v_[k]);
k = p;
}
}
void downto(int k)
{
const auto n = static_cast<int>(v_.size());
while (k < n/2) {
auto c = 2*k + 1;
if (c+1 < n && v_[c] < v_[c+1]) {
++c;
}
if (v_[c] < v_[k]) {
break;
}
std::swap(v_[k], v_[c]);
k = c;
}
}
};
int main()
{
PriorityQueue pq;
char buf[7+1];
int k;
while (true) {
std::scanf("%7s", buf);
if (buf[0] == 'i') {
std::scanf("%d", &k);
pq.insert(k);
} else if (buf[1] == 'x') {
auto max = pq.extract_max();
std::printf("%d\n", max);
} else {
break;
}
}
}
| 0
| 66,157,896
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K1,K2,H1,H2,M;cin>>K1>>H1>>K2>>H2>>M;
cout<<((K2-K1)*60)+(H2-H1)-M<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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 MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;
ll DP[3][110][5];
int main(){
string S;
ll K;
cin >> S >> K;
ll N = S.length();
REP(i,N+1){
REP(j,3){
REP(k,2){
DP[k][i][j] = 0;
}
}
}
DP[0][0][0] = 1;
REP(i,N){
int n = S[i] - '0';
for(int j = 0; j <= 3; j++){
for(int k = 0; k < 10; k++){
if(k < n){
if(k == 0){
DP[1][i+1][j] += DP[0][i][j];
DP[1][i+1][j] += DP[1][i][j];
}
else{
DP[1][i+1][j+1] += DP[0][i][j];
DP[1][i+1][j+1] += DP[1][i][j];
}
}
else if(k == n){
if(k == 0){
DP[0][i+1][j] += DP[0][i][j];
DP[1][i+1][j] += DP[1][i][j];
}
else{
DP[0][i+1][j+1] += DP[0][i][j];
DP[1][i+1][j+1] += DP[1][i][j];
}
}
else{
DP[1][i+1][j+1] += DP[1][i][j];
}
}
}
}
ll ans = 0;
REP(i,2){
ans += DP[i][N][K];
}
cout << ans << endl;
return 0;
}
| 0
| 33,327,483
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int odd=0;
rep(i,N){
int cnt=0;
int A=i+1;
while(A!=0){
cnt++;
A/=10;
}
if(cnt%2==1){
odd++;
}
}
cout<<odd<<endl;
}
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const ll MOD = 1e9 + 7;
int main(){
ll N; cin>>N;
set<ll> fact;
for(ll i = 1; i*i<=N; ++i){
if(N%i == 0){
fact.insert(i);
fact.insert(N/i);
}
}
ll ans = 0;
for(auto x: fact){
if(x == 1)continue;
if(N/x == N/(x-1LL)){
ans += x-1LL;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 30,547,644
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.1415926535897932;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
int L;
cin >> L;
double v_max;
v_max = (L / 3.0)*(L / 3.0)*(L / 3.0);
printf("%.8f", v_max);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
int n;ll l;
cin >> n >> l;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
vector<ll> sum(n+1);
sum[0] = 0;
rep(i,n){
sum[i+1] = sum[i] + a[i];
}
rep(i,n-1){
if(sum[i+2]-sum[i]>=l){
cout << "Possible" << "\n";
for(int j=1;j<=i;++j){
cout << j << "\n";
}
for(int j=n-1;j>=i+2;--j){
cout << j << "\n";
}
cout << i+1 << "\n";
return 0;
}
}
cout << "Impossible" << "\n";
return 0;
}
| 0
| 6,726,740
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class point {
public:
int x, y;
point() {}
point(int _x, int _y) {
x = _x;
y = _y;
}
};
class list_node {
public:
list_node *prev, *next;
point data;
list_node(list_node *_prev, list_node *_next, point _data) {
prev = _prev;
next = _next;
data = _data;
}
};
class list {
public:
list_node *front, *back;
list() {
front = new list_node(0, 0, point());
back = new list_node(front, 0, point());
front->next = back;
}
~list() {
list_node *node = front;
while (node) {
list_node *next = node->next;
delete node;
node = next;
}
}
list_node* insert_next(list_node *node, point data) {
list_node *pre_next = node->next;
node->next = new list_node(node, pre_next, data);
pre_next->prev = node->next;
return node->next;
}
list_node* push_front(point data) {
return insert_next(front, data);
}
list_node* push_back(point data) {
return insert_next(back->prev, data);
}
list_node* get_first() {
return front->next;
}
list_node* get_last() {
return back->prev;
}
void remove(list_node *node) {
list_node *prev = node->prev;
list_node *next = node->next;
prev->next = next;
next->prev = prev;
delete node;
}
};
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int bfs(vector<string> &cell) {
int h = cell.size(), w = cell[0].size();
list q;
vector<vector<int>> d(h, vector<int>(w, -1));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (cell[i][j] == '#') {
q.push_back(point(i, j));
d[i][j] = 0;
}
}
}
int max_d = 0;
while (q.get_first() != q.back) {
point p = q.get_first()->data;
q.remove(q.get_first());
max_d = d[p.x][p.y];
for (int i = 0; i < 4; ++i) {
point to(p.x + dx[i], p.y + dy[i]);
if (to.x < 0 || to.y < 0 || to.x >= h || to.y >= w) continue;
if (d[to.x][to.y] != -1) continue;
d[to.x][to.y] = d[p.x][p.y] + 1;
q.push_back(to);
}
}
return max_d;
}
int main() {
int h, w;
cin >> h >> w;
vector<string> cell(h, string());
for (int i = 0; i < h; ++i) cin >> cell[i];
cout << bfs(cell) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
template< typename T >
void warshall_floyd(Matrix< T > &g, T INF) {
for(int k = 0; k < g.size(); k++) {
for(int i = 0; i < g.size(); i++) {
for(int j = 0; j < g.size(); j++) {
if(g[i][k] == INF || g[k][j] == INF) continue;
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
int main() {
int V, E;
scanf("%d %d", &V, &E);
Matrix< int > mat(V, vector< int >(V, INT_MAX));
for(int i = 0; i < V; i++) mat[i][i] = 0;
for(int i = 0; i < E; i++) {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
mat[x][y] = z;
}
warshall_floyd(mat, INT_MAX);
for(int i = 0; i < V; i++) {
if(mat[i][i] < 0) {
puts("NEGATIVE CYCLE");
return 0;
}
}
for(int i = 0; i < V; i++) {
for(int j = 0; j < V; j++) {
if(j > 0) putchar(' ');
if(mat[i][j] == INT_MAX) printf("INF");
else printf("%d", mat[i][j]);
}
putchar('\n');
}
}
| 0
| 64,037,362
|
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, y,ans=0;
cin >> x >> y;
if (x * y == 0) {
ans = abs(x) + abs(y);
if (y < x)ans++;
}
else if (x * y < 0) {
ans = abs(abs(x) - abs(y)) + 1;
}
else if (0 < x * y) {
ans = abs(abs(x) - abs(y));
if (y < x)ans += 2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
int cul(int n){
vector<int> ar(10,0);
int re = 0;
rep(i,10){
ar[i] = n % 10;
n /= 10;
re += ar[i];
}
return re;
}
int main() {
int n; cin >> n;
int ans = 0;
if (n % cul(n) == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 92,392,026
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin >> n >> m;
long long a[100005];
for(int i=0; i<n; i++) cin >> a[i];
long long p=1;
for(int i=0; i<n; i++){
long long x=1;
while(a[i]%2==0){
a[i] /= 2;
x *= 2;
}
if(i==0){
p=x;
} else if(p != x){
cout << 0 << endl;
return 0;
}
}
p /= 2;
long long s=1;
for(int i=0; i<n; i++){
s = s/__gcd(s,a[i])*a[i];
if(s*p>m){
cout << 0 << endl;
return 0;
}
}
cout << (m+s*p)/(2*s*p) << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int M=3e5+5;
int a[M];
int b[M];
map<pair<int,int>,bool>mp;
int main()
{
int n,m,q;
scanf("%d%d%d",&n,&m,&q);
while(q--)
{
int x,y;
scanf("%d%d",&x,&y);
a[x]++;
b[y]++;
mp[make_pair(x,y)]=1;
}
int ma=0,mb=0;
for(int i=1;i<=n;i++)
{
ma=max(ma,a[i]);
}
for(int i=1;i<=m;i++)
{
mb=max(mb,b[i]);
}
vector<int>aa,bb;
for(int i=1;i<=n;i++)
{
if(a[i]==ma) aa.push_back(i);
}
for(int i=1;i<=m;i++)
{
if(b[i]==mb) bb.push_back(i);
}
for(auto i:aa)
{
for(auto j:bb)
{
if(mp.count(make_pair(i,j))==0)
{
printf("%d\n",ma+mb);
return 0;
}
}
}
printf("%d\n",ma+mb-1);
return 0;
}
| 0
| 7,267,928
|
#include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
string input, longest, many;
int len = 0, count = 0;;
map<string, int> wordCount;
while(cin >> input){
if(len < input.size()){
len = input.size();
longest = input;
}
wordCount[input]++;
if(count < wordCount[input]){
count = wordCount[input];
many = input;
}
}
cout << many << ' ' << longest << endl;
}
|
#include <cstdio>
#include <vector>
#include <climits>
using namespace std;
inline int MIN(int a,int b){
return ((a)<(b)?(a):(b));
}
int minimumProduct(int left, int right, vector<pair<int,int> >& mat, vector<vector<int> >& product) {
if(left==right) return 0;
if(product[left][right]!=-1) {
return product[left][right];
}
int i,min=INT_MAX;
for(i=left; i<right; ++i) {
min=MIN(min,minimumProduct(left,i,mat,product)
+minimumProduct(i+1,right,mat,product)
+mat[left].first*mat[right].second*((i==right-1)?mat[right].first:mat[i].second));
}
return product[left][right]=min;
}
int main() {
int n;
int i,j;
vector<pair<int,int> > mat;
vector<vector<int> > product;
scanf("%d",&n);
mat.resize(n);
product.resize(n);
for(i=0; i<n; ++i) {
product[i].resize(n);
scanf("%d%d",&mat[i].first,&mat[i].second);
for(j=0; j<n; ++j) {
product[i][j]=-1;
}
}
printf("%d\n",minimumProduct(0,n-1,mat,product));
return 0;
}
| 0
| 11,877,002
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p[i];
}
int L;
cin>>L;
vector<vector<int>> dp(N,vector<int>(17));
for(int j=0;j<17;j++){
for(int i=0;i<N;i++){
if(j==0){
if(p[i]+L>=p[N-1]){
dp[i][0]=N-1;
}
else{
int b=lower_bound(p.begin(),p.end(),p[i]+L+1)-p.begin();
dp[i][0]=b-1;
}
}
else{
dp[i][j]=dp[dp[i][j-1]][j-1];
}
}
}
int Q;
cin>>Q;
for(int l=0;l<Q;l++){
int a,b;
cin>>a>>b;
a--,b--;
if(a>b){
swap(a,b);
}
int Z=1;
for(int i=16;i>=0;i--){
if(dp[a][i]<b){
Z+=(1<<i);
a=dp[a][i];
}
}
cout<<Z<<endl;
}
}
|
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
int d,r;
double a,b,f,w;
f=0.0;
a=0.0;
b=0.0;
w=0.00000;
cin>>a>>b;
d=a/b;
r=(int)a%(int)b;
f=(double)a/(double)b;
cout<<d<<' '<<r<<' '<<fixed<<setprecision(5)<<f<<endl;
}
| 0
| 20,400,188
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1000000000;
int main() {
int N;
cin >> N;
cout << N*(N+1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin>> c;
for(int i = 0; i < c.size(); i++){
if(c.at(i) == 'a'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'i'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'u'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'e'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'o'){
cout << "vowel" << endl;
}
else{
cout << "consonant" <<endl;
}
}
}
| 0
| 75,197,706
|
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define REPR(i,n) for(int i=n-1;i>=0;i--)
#define FORR(i,n,m) for(int i=n-1;i>=m;i--)
#define ARR(array) for(int i=0;i<array.size();i++)
#define all(in) (in).begin(),(in).end()
#define ALL(in,K) (in),(in)+(K)
#define INF 1e18
#define MOD 1000000007
#define SIZE 10005
#define PI 3.14159265358979323846
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; }
ll input(){
ll a;
cin >> a;
return a;
}
int main(){
string s;
cin >> s;
int ans = 0;
for(char c: s)if(c=='x')ans++;
cout << ((ans<8)?"YES":"NO") << endl;
}
| 0
| 54,726,858
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
int k;
scanf("%d",&k);
int cnt=0;
while(b<=a) cnt++,b*=2;
while(c<=b) cnt++,c*=2;
if(cnt<=k) puts("Yes");
else puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
long long a[N];
for (int i=0; i<N; i++) cin >> a[i];
long long total=1000000000000000;
for (int tmp=0; tmp<(1<<15); tmp++) {
bitset<15> s(tmp);
int k=0;
long long count=0;
long long b=a[0];
for (int i=0; i<N; i++) {
if (i==0) {
k++;continue;
}
if (s[i]) {
k++;
if (b<a[i]) {
b=a[i];continue;
}
b++;
count+=(b-a[i]);
}
b=max(b,a[i]);
}
if (K==k) total=min(total,count);
}
cout << total << endl;
}
| 0
| 74,314,425
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
unordered_map<int,list<int> > um;
int mod=1000000007;
void solve()
{
int r,c;
cin>>r>>c;
char a[r][c];
for(int i=0; i<r; i++){
cin>>a[i];
}
int dp[r][c];
memset(dp,0,sizeof(dp));
dp[r-1][c-1]=1;
for(int i=r-1; i>=0; i--){
for(int j=c-1; j>=0; j--){
if(a[i][j]=='#'){
continue;
}
if(i+1<r && a[i][j]!='#'){
dp[i][j]+=dp[i+1][j];
dp[i][j]=dp[i][j]%(mod);
}
if(j+1<c && a[i][j]!='#'){
dp[i][j]+=dp[i][j+1];
dp[i][j]=dp[i][j]%(mod);
}
}
}
cout<<dp[0][0];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--){
solve();
cout<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,n;
cin>>h>>n;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
sum+=a[i];
}
if(sum>=h)
cout<<"Yes\n";
else
cout<<"No\n";
exit(0);
}
| 0
| 12,353,750
|
#include <iostream>
using namespace std;
void print20sharps()
{
for(int i = 0; i < 20; i++) {
cout << "#";
}
cout << endl;
}
int main(){
int n, b, f, r, v;
cin >> n;
int bldg_01[3][10], bldg_02[3][10], bldg_03[3][10], bldg_04[3][10];
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 10; j++) {
bldg_01[i][j] = 0;
bldg_02[i][j] = 0;
bldg_03[i][j] = 0;
bldg_04[i][j] = 0;
}
}
for(int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
if(b == 1) bldg_01[f-1][r-1] += v;
if(b == 2) bldg_02[f-1][r-1] += v;
if(b == 3) bldg_03[f-1][r-1] += v;
if(b == 4) bldg_04[f-1][r-1] += v;
}
for(int i = 0; i < 4; i++) {
for(int j = 0; j < 3; j++) {
for(int k = 0; k < 10; k++) {
if(i == 0) cout << " " << bldg_01[j][k];
if(i == 1) cout << " " << bldg_02[j][k];
if(i == 2) cout << " " << bldg_03[j][k];
if(i == 3) cout << " " << bldg_04[j][k];
}
cout << endl;
}
if(i == 3) break;
print20sharps();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI =3.14159265358979323846;
const ll M=1e9+7;
const ll inf=1e18;
const ll ms=2e5+5;
fast;
ll ans,temp;
void solve()
{
string s;cin>>s;
for(int i=0;i<3;i++)
{
temp*=10;
temp+=s[i]-'0';
}ans=abs(753ll-temp);
for(int i=3;i<s.size();i++)
{
temp=(temp%100)*10+s[i]-'0';
ans=min(abs(753ll-temp),ans);
}
cout<<ans<<endl;
}
int main()
{
{
solve();
}
return 0;
}
| 0
| 36,135,437
|
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza4321
#define y1 myrza1234
#define OK puts("OK")
using namespace std;
const int N = (int)1e5 + 5;
const int INF = 0x3f3f3f3f;
main() {
int x, a;
cin >> x >> a;
if (x < a) {
puts("0");
} else {
puts("10");
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define ld long double
int const M=2e5+10,M2=1e6+10,mod=1e9+7,mod2=1e9+9,inf=1e18+30;
int mn[M],cnt[M],x[M],y[M];
int32_t main()
{
int n,m;
cin>>n>>m;
int l=0,r=0,sum=0;
for(int i=1;i<=n;i++)cin>>x[i];
for(int i=1;i<=m;i++)cin>>y[i];
sort(x+1,x+n+1);
sort(y+1,y+m+1);
for(int i=1;i<=n;i++)
{
int tmp=x[i];
l+=tmp*(i-1);
l-=sum;
sum+=tmp;
}
sum=0;
for(int i=1;i<=m;i++)
{
int tmp=y[i];
r+=tmp*(i-1);
r-=sum;
sum+=tmp;
}
l%=mod,r%=mod;
cout<<(l*r)%mod;
}
| 0
| 45,663,992
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
static const int INF = 2000000000;
int main(){
ll n, m;
cin >> n >> m;
ll ans;
if (2*n >= m){
ans = m / 2;
} else {
ans = n;
m -= 2 * n;
ans += m / 4;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld",&a)
#define sf(a) scanf("%d",&a)
#define pf(a) printf("%d\n",a)
#define pfl(a) printf("%lld\n",a)
#define FOR(x,n) for(ll x=1;x<=n;++x)
#define pii pair< ll , ll >
#define mp(a,b) make_pair(a,b)
#define UNIQUE(v) v.resize(distance(v.begin(),unique(v.begin(),v.end())))
#define mod 1000000007
#define INF 2e18
#define EPS 1e-15
#define f1 first
#define f2 second
#define all(v) v.begin(),v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("out.txt","w",stdout)
int main(){
string s;
cin>>s;
string t = s;
reverse(all(t));
if( s==t ){
bool ck=1;
ll n = s.size();
t = "";
for(ll i=0;i<(n-1)/2;i++){
t += s[i];
}
string m = t;
reverse(all(m));
if ( m != t ) ck=0;
t = "";
for(ll i=(n+3)/2-1;i<n;i++){
t += s[i];
}
reverse(all(m));
if( m!= t ) ck=0;
if( ck ){
printf("Yes\n");
}
else{
printf("No\n");
}
}
else{
printf("No\n");
}
}
| 0
| 2,602,271
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a[100005],b[100005],c[100005];
ll sum;
ll M;
ll amari(ll i,ll j){
if(i%j>=0){
return i%j;
}else{
return i%j+j;
}
}
int main(void){
cin>>n;
ll SUM=n*(n+1)/2;
cin>>a[0];
sum=sum+a[0];
for(int i=1;i<n;i++){
cin>>a[i];
sum=sum+a[i];
b[i-1]=a[i]-a[i-1];
}
b[n-1]=a[0]-a[n-1];
if(sum%SUM!=0){
cout<<"NO"<<endl;
return 0;
}
ll k=sum/SUM;
for(int i=0;i<n;i++){
b[i]=b[i]-k;
if(b[i]%n!=0||b[i]>0){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define Pint pair<int, int>
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
int main() {
int N, M; cin >> N >> M;
int a[M], b[M];
vector<int> imos(N + 1, 0);
rep(i, M) {
cin >> a[i] >> b[i];
imos[a[i] - 1] += 1;
imos[b[i] - 1] += -1;
}
bool ok = true;
rep(i, N) {
imos[i + 1] += imos[i];
if(imos[i + 1] % 2) ok = false;
}
if(M == 1) ok = false;
if(ok) {
cout << "YES" << endl;
}else {
cout << "NO" << endl;
}
}
| 0
| 68,637,268
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int n;
cin >> n;
for(int i = 0; i < n; i++){
string op;
int b, e;
cin >> op;
cin >> b >> e;
if(op == "print"){
cout << s.substr(b, e-b+1) << endl;
}else{
string x, y, z;
x = s.substr(0, b);
z = s.substr(e+1, s.size()-(e+1));
if(op == "replace"){
string r;
cin >> y;
}else{
y = s.substr(b, e-b+1);
reverse(y.begin(), y.end());
}
s = x + y + z;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,a[N],fa[22][N],L,q,x,y;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d%d",&L,&q);
for (int i=1;i<n;i++){
int l=i+1,r=n;
while (l<r){
int mid=(l+r+1)/2;
if (a[i]+L>=a[mid])l=mid;
else r=mid-1;
}
fa[0][i]=l;
}
fa[0][n]=n;
for (int i=1;i<=19;i++)
for (int j=1;j<=n;j++)fa[i][j]=fa[i-1][fa[i-1][j]];
while (q--){
scanf("%d%d",&x,&y);
if (x==y){
puts("0");
continue;
}
if (x>y)swap(x,y);
int ans=0;
for (int i=19;i>=0;i--)
if (fa[i][x]<y)x=fa[i][x],ans+=1<<i;
printf("%d\n",ans+1);
}
}
| 0
| 77,850,386
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int dataN,i,j,tmp;
string str;
cin>>str;
for(i=str.length()-1;0<=i;i--){
cout<<str[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> d(N);
for(int i = 0 ; i < N ; i++){
cin >> d.at(i);
}
int sum = 0;
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < N ; j++){
if(i != j){
sum += d.at(i) * d.at(j);
}
}
}
cout << sum/2 << endl;
return 0;
}
| 0
| 42,259,238
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int d,i,ans,d_di;
while(cin>>d){
ans = 0;
for(i = d;i < 600;i += d){
ans += i*i*d;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
const int maxn=100010;
using namespace std;
vector<int>G[maxn];
int n,m;
int sg[maxn];
void calc(int cur,int pre)
{
for(int i=0;i<G[cur].size();i++){
if(G[cur][i]==pre)
continue;
calc(G[cur][i],cur);
sg[cur]^=(sg[G[cur][i]]+1);
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;i++){
int from, to;
scanf("%d %d",&from,&to);
G[from].push_back(to);
G[to].push_back(from);
}
calc(1,0);
printf("%s",sg[1]?"Alice":"Bob");
return 0;
}
| 0
| 41,860,731
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N;
cin >> N;
ll ans = 1e8;
vector<ll> six(0), nine(0);
int tmp = 1;
while (true) {
six.push_back(tmp);
tmp *= 6;
if (N < tmp) break;
}
tmp = 1;
while (true) {
nine.push_back(tmp);
tmp *= 9;
if (N < tmp) break;
}
reverse(six.begin(), six.end());
reverse(nine.begin(), nine.end());
for (int i = 0; i <= N; i++) {
ll cnt = 0;
ll a = i, b = N - i;
int j = 0;
while (a > 0) {
while (six[j] <= a) {
cnt++;
a -= six[j];
}
j++;
}
j = 0;
while (b > 0) {
while (nine[j] <= b) {
cnt++;
b -= nine[j];
}
j++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
int N, K;
ll mul(ll a, ll b) {
return (a%MOD)*(b%MOD) % MOD;
}
ll add(ll a, ll b) {
return ((a%MOD)+(b%MOD) + MOD) % MOD;
}
ll mpow(ll a, ll b) {
if (b == 0) return 1;
if (b & 1) return mul(a, mpow(a, b - 1));
ll tmp = mpow(a, b / 2);
return mul(tmp, tmp);
}
ll multiple[200000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
ll ans = 0;
for (int i = K; i >= 1; i--) {
multiple[i] = mpow(K / i, N);
for (int j = 2 * i; j <= K; j += i) multiple[i] = add(multiple[i], -multiple[j]);
ans = add(ans, multiple[i] * i);
}
cout << ans << '\n';
return 0;
}
| 0
| 83,876,046
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin >> n;
vector<int> a(200000);
vector<ll> memo(200000+1, 0);
for(int i=0; i<n; i++){
cin >> a[i];
memo[a[i]]++;
}
ll sum=0;
for(int i=1; i<=n; i++){
if(memo[i]<2) continue;
else{
sum += memo[i]*(memo[i]-1)/2;
}
}
for(int i=0; i<n; i++){
ll ans = sum - (memo[a[i]]-1);
cout <<ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main (void) {
string s, s2, p;
getline(cin,s);
getline(cin,p);
s2 = s+s;
if (s2.find(p)!=string::npos) {
cout<<"Yes"<<endl;
} else {
cout<<"No"<<endl;
}
}
| 0
| 21,784,641
|
#include <iostream>
using namespace std;
bool tst (int n, const string &s, const string &t, int pos) {
for (int i = 0; i + pos < n; i++) {
if (s[i + pos] != t[i]) return false;
}
return true;
}
int main () {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
if (tst(n, s, t, i)) {
cout << n + i << '\n';
return 0;
}
}
cout << 2 * n << '\n';
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
{ 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};
constexpr int A_MAX = 200000;
int main() {
string s,t;
cin >> s >> t;
int n = s.length(), m = t.length();
int succeeded_index = -1;
for(int i=0;i<n;++i) {
bool ok = true;
for(int j=0;j<m;++j) {
ok &= (s[i+j] == '?' || s[i+j] == t[j]);
}
if(ok) {
succeeded_index = i;
}
}
if(succeeded_index == -1) {
cout << "UNRESTORABLE\n";
return 0;
}
for(int i=0;i<n;++i) {
if(succeeded_index <= i && i < succeeded_index+m) {
cout << t[i-succeeded_index];
} else if(s[i] == '?') {
cout << 'a';
} else {
cout << s[i];
}
}
}
| 0
| 69,531,150
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int N,M,R;
cin>>N>>M>>R;
int r[R];
rep(i,0,R){
cin>>r[i];
r[i]--;
}
sort(r,r+R);
int d[N][N];
rep(i,0,N){
rep(j,0,N){
d[i][j]=20000000;
}
}
rep(i,0,N){
d[i][i]=0;
}
rep(i,0,M){
int a,b,c;
cin>>a>>b>>c;
d[a-1][b-1]=c;
d[b-1][a-1]=c;
}
rep(k,0,N){
rep(i,0,N){
rep(j,0,N){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
int ans=200000000;
do{
int cur=0;
rep(i,0,R-1){
cur+=d[r[i]][r[i+1]];
}
ans=min(ans,cur);
} while(next_permutation(r,r+R));
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> a;
for(int i = 0; i < n; ++i){
int p,q;
cin >> p >> q;
a.push_back({p,q});
}
sort(a.begin(),a.end());
long long int res = 0;
int c = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j < a[i].second; ++j){
++c;
res += a[i].first;
if (c == m){
break;
}
}
if(c == m){
break;
}
}
cout << res << endl;
}
| 0
| 73,646,715
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
int n,k;
cin >> n >> k;
vl a(n);
rep(i,n){
cin >> a[i];
}
ll ans = 1LL<<60;
rep(d,1<<(n-1)){
bitset<14> b(d);
if(b.count() < k-1)continue;
ll tmp = 0,now = a[0];
rep(i,n-1){
bool c = false;
if(b[i]){
if(now >= a[i+1]){
tmp+=now-a[i+1]+1;
c = true;
}
}
if(c)now = now+1;
else now = max(now,a[i+1]);
}
mins(ans,tmp);
}
print(ans);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<bool> isexist1(b, false);
{
int cur = a % b;
while(!isexist1[cur]){
isexist1[cur] = true;
cur += a;
cur %= b;
}
}
vector<int> plusnum;
for(int i = 1; i < b; i++){
if(isexist1[i]) plusnum.push_back(i);
}
vector<bool> memo(b*100, false);
memo[0] = true;
for(int i = 1; i < b*100; i++){
for(auto p : plusnum){
if(i-p >= 0 && memo[i-p]){
memo[i] = true;
break;
}
}
}
string ans = "NO";
for(int i = c; i < b*100; i += b){
if(memo[i]){
ans = "YES";
}
}
cout << ans << endl;
return 0;
}
| 0
| 58,438,450
|
#include <iostream>
#include <stdlib.h>
#include <string>
#define rep(i, n) for(int i = 1; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
rep(i, n+1){
string num = to_string(i);
if(num.size() % 2 != 0) ans++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <functional>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
#define MOD 1000000007;
#define LIMIT 1000000000000000000;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define int long long
typedef pair<int, int> P;
struct Setup {
Setup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} SETUP;
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;
}
const ll INF = 1LL << 60;
class Edge {
private:
int m_from, m_to, m_cost;
public:
Edge(int f, int t, int c = 1) :
m_from(f), m_to(t), m_cost(c) {}
int from() const {
return m_from;
}
int to() const {
return m_to;
}
int cost() const {
return m_cost;
}
Edge& operator=(const int x) {
m_cost = x;
return *this;
}
bool operator<(const Edge& e) const {
return m_cost < e.cost();
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void warshall_floyd(Graph& graph, int inf) {
const int v = graph.size();
for (int k = 0; k < v; k++) {
for (int i = 0; i < v; i++) {
for (int j = 0; j < v; j++) {
if (graph[i][k].cost() == inf || graph[k][j].cost() == inf) continue;
graph[i][j] = min(graph[i][j].cost(), graph[i][k].cost() + graph[k][j].cost());
}
}
}
}
Graph gen_graph(const int n, const int inf) {
Graph g(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int cost = (i == j) ? 0 : inf;
g[i].push_back(Edge(i, j, cost));
}
}
return g;
}
signed main() {
auto graph = gen_graph(4, INF);
for (int i = 0; i < 3; i++) {
int a, b; cin >> a >> b; a--, b--;
graph[a][b] = graph[b][a] = 1;
}
warshall_floyd(graph, INF);
bool ok = false;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (graph[i][j].cost() == 3) {
ok = true;
}
}
}
cout << (ok ? "YES" : "NO") << endl;
}
| 0
| 11,415,425
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
string N;
int K;
int dp[110][3][5];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> K;
int L = N.size();
dp[0][0][0] = 1;
rep(i, L) {
int D = N[i]-'0';
rep(j, 2) rep(k, K+1) {
int max_d = j==0 ? D+1:10;
rep(d, max_d) {
int nk = k+(d!=0 ? 1:0);
if (nk>K) continue;
dp[i+1][j|(d<D)][nk] += dp[i][j][k];
}
}
}
cout << dp[L][0][K]+dp[L][1][K] << endl;
}
|
#include <bits/stdc++.h>
#define fs first
#define sc second
#define mx 100005
#define mod 1000000007
#define pii pair<int, int>
#define ll long long
#define mkp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
int main()
{
int n;
scanf("%d", &n);
ll ara[n];
for(int i = 0; i<n; i++){
scanf("%lld", &ara[i]);
}
int lim = 61;
ll ans = 0;
for(int i = 0; i<lim; i++){
int c = 0;
for(int j = 0; j<n; j++){
if(ara[j]&(1ll<<i)) c++;
}
if(c & 1){
for(int j = 0; j<n; j++){
ara[j] = ara[j]&(~(1ll<<i));
}
ans |= (1ll << i);
}
}
ll basis[62];
memset(basis, 0, sizeof basis);
for(int j = 0; j<n; j++){
for(int i = lim-1; i>=0; i--)
{
if(ara[j]&(1ll<<i)){
if(!basis[i]){
basis[i] ^= ara[j];
break;
}
ara[j] ^= basis[i];
}
}
}
ll nw = 0;
for(int i = lim-1; i>=0; i--)
if(nw < (nw^basis[i])) nw ^= basis[i];
printf("%lld\n", 2ll*nw+ans);
return 0;
}
| 0
| 33,415,923
|
#include <iostream>
#include <string>
int main()
{
int N;
std::string S;
std::cin >> N;
std::cin >> S;
if (N%2==0) {
bool flg = true;
for (int i=0; i<N/2; i++) {
if (S[i] != S[N/2+i]) {
flg = false; break;
}
}
if (flg) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
}
else std::cout << "No" << std::endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<int> W(N, 0);
for (int i = 0; i < N; ++i) cin >> W[i];
int a = 0, b = 0, i = 0, j = N - 1;
while (i <= j) {
if (a <= b) {
a += W[i], i++;
}
else {
b += W[j], j--;
}
}
printf("%d\n", abs(a - b));
}
| 0
| 87,131,994
|
#pragma GCC optimize("O3")
#pragma GCC optimize("-Ofast", "-funroll-all-loops", "-ffast-math")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LL = long long;
#define eps 1e-8
#define fi first
#define se second
#define endl '\12'
#define eb emplace_back
#define SZ(a) int32_t(a.size())
#define ALL(x) (x).begin(), (x).end()
#define trav(a, x) for (auto &a : x)
#define LOG(FMT...) fprintf(stderr, FMT)
#define close \
std::ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define FOR(i, x, y) for (LL i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) for (LL i = (x), _##i = (y); i > _##i; --i)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define CASET \
int ___T; \
cin >> ___T; \
for (int __CS = 1; __CS <= ___T; __CS++)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
constexpr int mod = 1e9 + 7;
constexpr int Erica = 998244353;
mt19937 dlsrand(random_device{}());
mt19937 mrand(std::chrono::system_clock::now().time_since_epoch().count());
int rnd(int x) { return mrand() % x; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll ex_gcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
ll ret = ex_gcd(b, a % b, y, x);
y -= a / b * x;
return ret;
}
LL bin(LL x, LL n, LL MOD) {
LL ret = MOD != 1;
for (x %= MOD; n; n >>= 1, x = x * x % MOD)
if (n & 1) ret = ret * x % MOD;
return ret;
}
int norm(int x) { return x >= mod ? (x - mod) : x; }
inline LL get_inv(LL x, LL p) { return bin(x, p - 2, p); }
inline ll get_inv(ll a) {
ll x, y;
ex_gcd(a, mod, x, y);
return norm(x + mod);
}
template <class T>
inline void umin(T &x, T y) {
x = x > y ? y : x;
}
template <class T>
inline void umax(T &x, T y) {
x = x < y ? y : x;
}
template <class T>
inline void dec(T &x, T y) {
x -= y;
if (x < 0) x += mod;
}
template <class T>
inline void add(T &x, T y) {
x += y;
if (x >= mod) x -= mod;
}
const double PI = acos(-1.0);
constexpr int INF = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3f;
constexpr ull base = 2333, P_1 = 19260817, P_2 = 999998639;
constexpr int maxn =
1e6 + 10;
int n, d;
vi a[maxn];
int calc(int x) { return x * x; }
int main() {
cin >> n >> d;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < d; j++) {
int x;
cin >> x;
a[i].eb(x);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
int tp = 0;
for (int k = 0; k < d; k++) {
tp += calc(a[i][k] - a[j][k]);
}
int m = sqrt(tp);
if (m * m == tp) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n)
{
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < n; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind
{
public:
vector<ll> Parent;
UnionFind(ll N)
{
Parent = vector<ll>(N, -1);
}
ll find(ll A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A)
{
return -Parent[find(A)];
}
bool Union(ll A, ll B)
{
A = find(A);
B = find(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b)
{
return (((a % MOD) * (b % MOD)) % MOD);
}
ll powMod(ll a, ll p)
{
if (p == 0)
{
return 1;
}
else if (p % 2 == 0)
{
ll half = powMod(a, p / 2);
return mulMod(half, half);
}
else
{
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b)
{
return (a + b - 1) / b;
}
int main()
{
long long N;
scanf("%lld", &N);
vector<string> S(N);
for (int i = 0; i < N; i++)
{
cin >> S[i];
}
ll ans = 0;
int a = 0;
for (int b = 0; b < N; b++)
{
bool can = true;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
int newX = (i + a) % N;
int newY = (j + b) % N;
int newA = (newY - a);
int newB = (newX - b);
if(newA < 0){
newA+=N;
}
if(newB < 0){
newB+=N;
}
if (S[i][j] != S[newA][newB])
{
can = false;
}
}
if(!can){
break;
}
}
if (can)
{
ans++;
}
}
cout << ans * N << endl;
return 0;
}
| 0
| 48,989,739
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int a,b; cin >> a >> b;
bool jud = false;
if(a %3 == 0 || b %3 == 0 || (a+b) %3 == 0){
jud = true;
}
if(jud) cout << "Possible" << endl;
else cout << "Impossible" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define f(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define fm(i, a, b) for (long long i = a; i > b; i--)
#define repm(i, a, b) for (long long i = a; i >= b; i--)
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define pqmaxi priority_queue<int>
#define pqmaxl priority_queue<ll>
#define pqmini priority_queue<int, vi, greater<int>>
#define pqminl priority_queue<ll, vl, greater<ll>>
#define all(x) x.begin(), x.end()
#define test \
ll test; \
cin >> test; \
while (test--)
#define pb(i) push_back(i)
#define mp(i, j) make_pair(i, j)
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL)
int main()
{
fast;
ll n;
cin >> n;
vl v(n);
f(i, 0, n)
{
cin >> v[i];
}
ll min1 = mod;
ll max1 = -mod;
f(i, 0, n)
{
min1 = min(min1, v[i]);
max1 = max(max1, v[i]);
}
ll ans = mod;
f(j, min1, max1 + 1)
{
ll cst = 0;
f(i, 0, n)
{
cst += (v[i] - j) * (v[i] - j);
}
ans = min(ans, cst);
}
cout << ans;
}
| 0
| 90,830,468
|
#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;
}
|
#include <iostream>
using namespace std;
int main(){
while (1){
int n;
int input[5001];
int max1;
cin >> n;
if (n == 0) break;
for (int i = 0; i < n; i++){
cin >> input[i];
}
max1 = input[0];
for (int i = 0; i < n; i++){
int sum = 0;
for (int j = i; j < n; j++){
sum += input[j];
max1 = max(max1, sum);
}
}
cout << max1 << endl;
}
return 0;
}
| 0
| 92,375,509
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (c-b <= 0)
cout << "delicious" << endl;
else if(c-b <= a)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
}
|
#define _USE_MATH_DEFINES
#include <array>
#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>
#include <random>
#include <ctime>
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;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
int main() {
int n;
scanf("%d", &n);
vector<int64> pos, neg;
for (int i = 0; i < n; ++i) {
int64 x;
scanf("%lld", &x);
if (x >= 0) {
pos.push_back(x);
} else {
neg.push_back(x);
}
}
sort(pos.begin(), pos.end(), greater<int64>());
sort(neg.begin(), neg.end());
if (pos.empty()) {
pos.push_back(neg.back());
neg.pop_back();
}
if (neg.empty()) {
neg.push_back(pos.back());
pos.pop_back();
}
int64 ret = 0;
for (auto& it : pos) ret += it;
for (auto& it : neg) ret -= it;
printf("%lld\n", ret);
if (pos.size() <= neg.size()) {
printf("%lld %lld\n", pos[0], neg[0]);
int64 last = pos[0] - neg[0];
for (int i = 1; i < pos.size(); ++i) {
printf("%lld %lld\n", neg[i], last);
last = neg[i] - last;
printf("%lld %lld\n", pos[i], last);
last = pos[i] - last;
}
for (int i = pos.size(); i < neg.size(); ++i) {
printf("%lld %lld\n", last, neg[i]);
last = last - neg[i];
}
} else {
printf("%lld %lld\n", neg[0], pos[0]);
int64 last = neg[0] - pos[0];
for (int i = 1; i < neg.size(); ++i) {
printf("%lld %lld\n", pos[i], last);
last = pos[i] - last;
printf("%lld %lld\n", neg[i], last);
last = neg[i] - last;
}
for (int i = neg.size(); i < pos.size() - 1; ++i) {
printf("%lld %lld\n", last, pos[i]);
last = last - pos[i];
}
printf("%lld %lld\n", pos.back(), last);
}
return 0;
}
| 0
| 67,330,061
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(){
string s;
cin >> s;
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
if (s == "abc"){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
using namespace std;
int main() {
long n;
cin >> n;
string s,t;
unordered_map <string, int> dic;
for (int i=0;i<n;i++){
cin >> s >> t;
if(s == "insert"){
dic[t] = 1;
}else{
if(dic[t] == 1){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
}
}
}
| 0
| 51,082,757
|
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 8003;
string s;
int x, y;
vector <pii> a, b;
bool can[N][2 * N];
void make(string s, vector <pii> &a, vector <pii> &b) {
try {
a.clear(); b.clear();
int cnt = 0, flip = 0;
s += 'T';
for (auto x: s) {
if (x == 'T') {
if (!flip) {
if (a.size() == 0)
a.push_back(make_pair(cnt, cnt));
else
a.push_back(make_pair(cnt, -cnt));
}
else b.push_back(make_pair(cnt, -cnt));
cnt = 0;
flip = 1 - flip;
} else cnt++;
}
} catch (exception ex) {
return;
}
}
bool canReach(int des, vector <pii> c) {
memset(can, 0, sizeof(can));
can[0][N] = true;
int n = c.size();
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 2 * N; j++)
if (can[i - 1][j]) {
can[i][j + c[i - 1].first] = can[i][j + c[i - 1].second] = true;
}
}
return can[n][des + N];
}
int main() {
try {
cin >> s >> x >> y;
make(s, a, b);
if (canReach(x, a) && canReach(y, b)) {
cout << "Yes";
} else cout << "No";
} catch (exception ex) {
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char neighbor(char me, char other, char answer) {
if (answer == 'o') {
if (me == 'S') {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
} else {
if (other == 'S') {
return 'W';
} else {
return 'S';
}
}
} else {
if (me == 'S') {
if (other == 'S') {
return 'W';
} else {
return 'S';
}
} else {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
}
}
}
int main() {
int n;
string s;
cin >> n >> s;
char st[4][2]{{'S', 'S'}, {'S', 'W'}, {'W', 'S'}, {'W', 'W'}};
for (int i = 0; i < 4; i++) {
char t[n]{st[i][0], st[i][1]};
char last = neighbor(t[0], t[1], s[0]);
for (int j = 1; j < n - 1; j++) {
t[j+1] = neighbor(t[j], t[j-1], s[j]);
}
if (last == t[n-1] && t[0] == neighbor(t[n-1], t[n-2], s[n-1])) {
for (int k = 0; k < n; k++) {
cout << t[k];
}
cout << endl;
return 0;
}
}
cout << -1 << endl;
}
| 0
| 40,598,801
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for(int i=0; i<N; i++){
cin >> vec.at(i);
}
vector<int> copy(N);
for(int i=0; i<N; i++){
copy.at(i) = vec.at(i);
}
sort(copy.begin(),copy.end());
map<int,int> mp;
for(int i=0; i<N; i++){
mp[copy.at(i)] = i;
}
vector<bool> change(N);
for(int i=0; i<N; i++){
if(i %2 == mp[vec.at(i)] %2){
change.at(i) = true;
}
else{
change.at(i) = false;
}
}
int ans = 0;
for(int i=0; i<N-1; i++){
if(!change.at(i)){
if(!change.at(i+1)){
change.at(i) = true;
change.at(i+1) = true;
ans++;
}
else{
swap(change.at(i),change.at(i+1));
}
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void rotation_N(int* dise){
int tmp[6];
tmp[0] = dise[1];
tmp[1] = dise[5];
tmp[2] = dise[2];
tmp[3] = dise[3];
tmp[4] = dise[0];
tmp[5] = dise[4];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotation_E(int* dise){
int tmp[6];
tmp[0] = dise[3];
tmp[1] = dise[1];
tmp[2] = dise[0];
tmp[3] = dise[5];
tmp[4] = dise[4];
tmp[5] = dise[2];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotation_S(int* dise){
int tmp[6];
tmp[0] = dise[4];
tmp[1] = dise[0];
tmp[2] = dise[2];
tmp[3] = dise[3];
tmp[4] = dise[5];
tmp[5] = dise[1];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotation_W(int* dise){
int tmp[6];
tmp[0] = dise[2];
tmp[1] = dise[1];
tmp[2] = dise[5];
tmp[3] = dise[0];
tmp[4] = dise[4];
tmp[5] = dise[3];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotation_spin(int* dise){
int tmp[6];
tmp[0] = dise[0];
tmp[1] = dise[2];
tmp[2] = dise[4];
tmp[3] = dise[1];
tmp[4] = dise[3];
tmp[5] = dise[5];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
int main(){
int dise[6];
int n;
vector<int> ans;
for(int i = 0; i < 6; i++){
cin >> dise[i];
}
cin >> n;
for(int i = 0; i < n; i++){
int top, front;
cin >> top >> front;
if(dise[1] == top){
rotation_N(dise);
}
else if(dise[4] == top){
rotation_S(dise);
}
while(dise[0] != top){
rotation_E(dise);
}
while(dise[1] != front){
rotation_spin(dise);
}
ans.push_back(dise[2]);
}
for(int i = 0; i < ans.size(); i++){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 53,495,492
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 10000000
#define base10_8 100000000
#define base10_9 1000000000
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vector<ll>
string ans_Yes = "Yes";
string ans_No = "No";
string ans_yes = "yes";
string ans_no = "no";
ll A;
ll B;
ll C;
ll N;
ll M;
ll K;
ll ltmp;
string stmp;
double dtmp;
vector<ll> G[2*base10_5+10];
ll root_point[2*base10_5+10]={};
ll value[2*base10_5+10]={};
ll visited[2*base10_5+10]={};
void calcValue(ll target,ll parent_point){
value[target] += parent_point;
visited[target]=1;
rep(gi,G[target].size()){
ll next = G[target][gi];
if(visited[next]==0) calcValue(next,value[target]);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
cin >> M;
ll from,to;
rep(ni,N-1){
cin >> from;
cin >> to;
G[from].push_back(to);
G[to].push_back(from);
}
ll target,point;
rep(mi,M){
cin >> target;
cin >> point;
root_point[target]+=point;
}
for( ll ni = 1 ; ni <=N ; ni++ ){
value[ni] = root_point[ni];
}
calcValue(1,0);
for( ll ni = 1 ; ni <=N ; ni++ ){
cout << value[ni] << " ";
}
}
|
#include <iostream>
using namespace std;
#define MAX 2000005
int C[MAX], n, A[MAX], B[MAX];
void countingSort(int A[], int B[], int k)
{
for(int i=0; i<=k; i++)
C[i] = 0;
for(int j=1; j<=n; j++)
C[A[j]]++;
for(int i=1; i<=k ;i++)
C[i] += C[i-1];
for(int i=n; i>=1; i--)
{
B[C[A[i]]] = A[i];
C[A[i]]--;
}
}
int main()
{
cin >> n;
cin >> A[1];
int max = A[1];
for(int i=2; i<=n; i++)
{
cin >> A[i];
if(max < A[i])
max = A[i];
}
countingSort(A,B,max);
for(int i=1; i<=n-1; i++)
cout << B[i] << " ";
cout << B[n] << endl;
return 0;
}
| 0
| 84,222,688
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[5010], p[5010];
int vis[5010];
long long sum;
vector<long long> pre;
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++i)
scanf("%d", &p[i]);
for(int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
long long ans = -1e18;
for(int i = 1; i <= n; ++i)
{
memset(vis, 0, sizeof(vis));
pre.clear();
int st = i;
sum = 0;
while(!vis[st])
{
vis[st] = 1;
pre.push_back(sum += a[st]);
st = p[st];
}
int len = pre.size();
int t = k/len, m = k%len;
for(int i = 2; i < len; ++i)
pre[i] = max(pre[i], pre[i-1]);
if(t >= 1)
{
ans = max(ans, pre[len-1]-pre[0]);
ans = max(ans, pre[m]-pre[0]+t*sum);
ans = max(ans, pre[len-1]-pre[0]+(t-1)*sum);
}else{
ans = max(ans, pre[m]-pre[0]);
}
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i,s,n) for(int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int a[3];
rep(i, 3) cin >> a[i];
sort(a, a + 3);
int ans = 0;
int i, j, k;
if(abs(a[0] - a[1]) % 2 == 0)
i = 0, j = 1, k = 2;
else if(abs(a[0] - a[2]) % 2 == 0)
i = 0, j = 2, k = 1;
else if(abs(a[1] - a[2]) % 2 == 0)
i = 1, j = 2, k = 0;
ans += abs(a[i] - a[j]) / 2;
int m = max(a[i], a[j]);
a[i] = m, a[j] = m;
int p = a[i], q = a[k];
if(p > q){
if((p - q) % 2 == 0){
ans += (p - q) / 2;
}else{
ans += (p + 1 - q) / 2 + 1;
}
}else{
ans += q - p;
}
cout << ans << endl;
return 0;
}
| 0
| 46,411,804
|
#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--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int changeDoubleToInt(string decimal){
decimal.erase(1, 1);
int n_decimal = atoi(decimal.c_str());
return n_decimal;
}
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
double l;
cin >> l;
double x = l/3;
double ans = pow(x,3);
printf("%.10f\n", ans);
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l; i<r; i++)
{
int L=i%2019;
for (int j = i+1; j <= r; j++)
{
int R=j%2019;
int ama=(L*R)%2019;
if (ama<mi)
{
mi=ama;
if (mi==0)
{
cout << 0 << endl;
return 0;
}
}
}
}
cout << mi << endl;
}
| 0
| 51,248,526
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
long long K;
cin >> N >> K;
vector<int> P( N );
for( int i = 0; i < N; i++ ) {
int p;
cin >> p;
p--;
P[i] = p;
}
vector<long long> C( N );
for( int i = 0; i < N; i++ ) {
cin >> C[i];
}
long long ans = INT64_MIN;
set<int> st;
for( int j = 0; j < N; j++ ) {
if( st.count( j ) ) continue;
vector<int> vi;
int now = j;
long long sum = 0;
set<int> st1;
for( int i = 0; i < N * 2; i++ ) {
if( st1.count( now ) ) {
st.insert( st1.begin(), st1.end() );
break;
}
st1.insert( now );
now = P[now];
sum += C[now];
vi.push_back( now );
}
int n = vi.size();
long long ma = 0;
long long k = K;
if( k / n > 1 ) {
if( sum > 0 ) ma += sum * (k / n - 1);
k -= (k / n - 1) * n;
}
for( int j = 0; j < n; j++ ) {
long long aa = 0;
for( int l = 0; l < k; l++ ) {
aa += C[ vi[(j + l) % n] ];
ans = max( ans, ma + aa );
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vll = vector<long long>;
using vp = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using vvll = vector<vector<long long>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, T b) { if (b<a) {a=b; return 1;} return 0;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, a, b;
cin >> h >> w >> a >> b;
rep(i, h) {
rep(j, w) {
if (i < b && j < a) {
cout << 0;
} else if (i < b) {
cout << 1;
} else if (j < a) {
cout << 1;
} else {
cout << 0;
}
}
cout << endl;
}
}
| 0
| 94,061,428
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
if((A - B) % 2){
cout << "Borys" << "\n";
} else {
cout << "Alice" << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main(){
int n, k;
cin >> n >> k;
if (k > (n-1)*(n-2)/2){
cout << -1 << endl;
return 0;
}
vector<P> ans;
rep(i, n-1) ans.push_back(make_pair(1, i+2));
int cnt = (n-1)*(n-2)/2 - k;
if (cnt == 0) {
cout << ans.size() << endl;
rep(j, ans.size()) cout << ans[j].first << " " << ans[j].second << endl;
return 0;
}
for(int p = 2; p <= n; p++){
for(int q = p+1; q <= n; q++){
ans.push_back(make_pair(p,q));
cnt--;
if (cnt == 0) {
cout << ans.size() << endl;
rep(j, ans.size()) cout << ans[j].first << " " << ans[j].second << endl;
return 0;
}
}
}
}
| 0
| 14,040,341
|
#include <iostream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::vector;
typedef pair<int, int> PII;
int main(void) {
int n;
int m;
int answer;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
answer = 0;
vector<PII> road(n);
for (int i = 0; i < n; i ++) {
cin >> road[i].second >> road[i].first;
}
sort(road.begin(), road.end(), std::greater<PII>());
for (int i = 0; i < n; i ++) {
if (m <= 0) {
answer += road[i].first * road[i].second;
continue;
} else if (m > 0) {
m -= road[i].second;
if (m <= 0) {
answer += -m * road[i].first;
}
}
}
cout << answer << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1)/b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
int nmax=200000;
vvec g(nmax);
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
double n,m;
cin>>n>>m;
double ans=0;
double cnt=1;
double rui=pow(2,m);
double memo=rui;
while(true){
ans+=((double)1900*m+(double)100*(n-m))*cnt*memo;
cnt++;
memo=1-rui;
memo*=rui;
if(((double)1900*m+(double)100*(n-m))*cnt*memo<0.0000000000000001) break;
}
cout<<(int)ans<<endl;
}
| 0
| 10,050,165
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1E9 + 7, N = 100005;
string s;
int n, a[N], dp[N][2];
int solve(int idx, int f)
{
if (idx == n)
return 1;
else if (dp[idx][f] != -1)
return dp[idx][f];
int ans = 0, lim = 1;
if (f)
lim = a[idx];
for (int i = 0; i <= lim; ++i)
{
int nf = f;
if (f)
{
if (i < lim)
nf = 0;
}
if (i)
ans = (1LL * ans + (2 * solve(idx + 1, nf)) % MOD) % MOD;
else
ans = (1LL * ans + solve(idx + 1, nf)) % MOD;
}
return dp[idx][f] = ans;
}
int main(int argc, char const *argv[])
{
cin >> s;
n = s.length();
for (int i = 0; i < n; ++i)
{
a[i] = s[i] - '0';
}
memset(dp, -1, sizeof(dp));
cout << solve(0, 1);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
typedef pair<int, int> P;
ll modnum = 1e9+7;
int main() {
int n,k; cin >> n >> k;
int maximum = (n-1)*(n-2)/2;
if(maximum < k) cout << -1 << endl;
else {
vector<P> res;
for(int i=1; i < n; i++) res.emplace_back(i, n);
int rem = maximum - k;
int ci = 1, cj = 2;
for(int i=0; i < rem; i++) {
res.emplace_back(ci, cj);
cj++;
if(cj == n) {
ci++;
cj = ci + 1;
}
}
cout << res.size() << endl;
for(auto p : res) cout << p.first << " " << p.second << endl;
}
return 0;
}
| 0
| 13,573,674
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long LL;
using namespace std;
int main()
{
LL A,B,K,cnt=0;
scanf("%lld%lld%lld",&A,&B,&K);
for(LL i=A;i>=1;i--)
{
if(A%i==0&&B%i==0)
cnt+=1;
if(cnt==K)
{
printf("%lld\n",i);
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
int main() {
int n, k;
scanf("%d %d", &n, &k);
ld res = 0;
for (int i = 1; i <= n; i++) {
ld temp = 1.0 / n;
for (int j = i; j < k; j *= 2) {
temp *= 0.5;
}
res += temp;
}
printf("%.12Lf", res);
return 0;
}
| 0
| 72,568,070
|
#include<stdio.h>
int main(){
char c[1000];
int i,x;
int sum;
int co;
while(1){
co=0;
sum=0;
scanf("%s",&c);
for(i=0;;i++){
if(c[i]=='\0'){
co=i;
break;
}
}
if(c[0]=='0')break;
for(i=0;i<co;i++){
x =c[i]-'0';
sum+=x;
}
printf("%d\n",sum);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 2e3;
const int MOD = 1e9+7;
int n,m;
int a[N+5],b[N+5];
int memo[N+5][N+5];
int dp(int idx1, int idx2){
if(idx1 > n || idx2 > m) return 0;
int &ret = memo[idx1][idx2];
if(ret!=-1) return ret;
ret = dp(idx1+1,idx2);
ret = (ret+dp(idx1,idx2+1))%MOD;
ret = (ret-dp(idx1+1,idx2+1)+MOD)%MOD;
if(a[idx1] == b[idx2]){
ret = (ret+dp(idx1+1,idx2+1)+1)%MOD;
}
return ret;
}
int main(){
memset(memo,-1,sizeof(memo));
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
int ans = dp(1,1);
printf("%d\n",(ans+1)%MOD);
return 0;
}
| 0
| 62,143,827
|
#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
const vector<int> calcV(string s) {
int n = s.size();
map<char, int> usedMap;
vector<int> retV(n);
int count = 0;
for(int i = 0; i < n; ++i) {
if(usedMap.find(s[i]) == usedMap.end()) {
usedMap[s[i]] = count++;
}
retV[i] = usedMap[s[i]];
}
return retV;
}
int main() {
string s, t;
cin >> s;
cin >> t;
if(calcV(s) == calcV(t))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sort(all(x), greater<int>())
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) int x;cin >> x
#define cill(x) LL x;cin >> x
#define cis(x) string x;cin >> x
#define co(x) cout << x << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define truecheck assert
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef long long int64;
template<class T,class U>bool chmax(T &a, const U &b) { if (a<b) { a=b; return true; } return false; }
template<class T,class U>bool chmin(T &a, const U &b) { if (b<a) { a=b; return true; } return false; }
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
int main() {
fastcin();
cout << fixed << setprecision(10);
cii(r);
auto ans = (r < 1200)
?"ABC"
:(r < 2800)
?"ARC"
:"AGC";
co(ans);
return 0;
}
| 0
| 39,091,598
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int a = N / X;
if(N % X != 0) T *= a + 1;
if(N % X == 0) T *= a;
cout << T << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
bool comp(vector<int> a, vector<int> b){
return a[0] < b[0];
}
int time(string str){
int s = (int)str[7] - '0' + ((int)str[6] - '0')*10;
int m = (int)str[4] - '0' + ((int)str[3] - '0')*10;
int h = (int)str[1] - '0' + ((int)str[0] - '0')*10;
return s + 60*m + 3600*h;
}
int main(){
while(1){
int n; cin >> n;
if(!n) break;
vector<vector<int> > train(2*n, vector<int> (2));
for(int i = 0; i < n; i++){
string s;
cin >> s;
train[i][0] = 2*time(s) + 1;
train[i][1] = 1;
cin >> s;
train[n + i][0] = 2*time(s) - 1;
train[n + i][1] = -1;
}
sort(train.begin(), train.end(), comp);
int count = 0;
int ans = 0;
for(int i = 0; i < 2*n; i++){
if(train[i][1] == 1) count++;
else count--;
ans = max(ans, count);
}
cout << ans << endl;
}
return 0;
}
| 0
| 88,515,628
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main(){
ll A, B, X;
cin >> A >> B >> X;
if((X >= A) && (X <= A + B))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <complex>
using namespace std;
typedef long long ll;
typedef double R;
typedef complex<R> P;
const R EPS = 1e-10;
const R PI = acos(-1);
int sgn(R a) {
if (a < -EPS) return -1;
if (a > EPS) return 1;
return 0;
}
bool near(P a, P b) {
return !sgn(abs(a-b));
}
double cross(const P &a, const P &b) { return imag(conj(a)*b); }
double dot(const P &a, const P &b) { return real(conj(a)*b); }
void solve() {
P p[4];
for (int i = 0; i < 4; i++) {
R x, y;
cin >> x >> y;
p[i] = P(x, y);
}
if (!sgn(cross(p[0]-p[1], p[2]-p[3]))) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
solve();
}
return 0;
}
| 0
| 44,384,296
|
#include<bits/stdc++.h>
#define ll long long int
#define ar array
#define pb push_back
#define input(arr,n) for(int i = 0; i<n; i++) cin>>arr[i]
const int mod = 1e9+7;
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,ans = 0;
cin>>n;
for(int i = 1; i<n; i++)
{
int h = n-i;
for(int j = 1; j*j<=h; j++)
if(h%j==0)
{
ans++;
if(j*j!=h) ans++;
}
}
cout<<ans<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
}
}
int main(){
cin >> n >> m;
rep(i, 0, n) cin >> s[i];
rep(i, 0, m) cin >> t[i];
init();
rep(i, 1, n+1) {
rep(j, 1, m+1) {
if(s[i-1] == t[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
dp[i][j] += (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod;
dp[i][j] += mod;
dp[i][j] %= mod;
}
}
cout << (dp[n][m]+1) % mod << endl;
return 0;
}
| 0
| 24,390,834
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long sum = 0;
for (long long i = 1; i <= N; i++) {
sum += i * (N / i) * (N / i + 1) / 2;
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define mod (1000000007)
long int vis[100002] = {0};
vector<long int> g[100002];
void dfs(int u,long int x,long int &value)
{
value = max(value,x);
for(auto v : g[u])
{
if(vis[v] == 0){
x++;
dfs(v,x,value);
}
x = 0;
}
}
int main() {
long long int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
while(t--){
long int n,m,x = 0,y = 0,start = 0,end = 0,index = 0,z;
cin >> n >> m;
long long int arr[n][m];
char ch[n][m];
for(int i = 0;i<n;i++)
for(int j = 0;j<m;j++)
cin >> ch[i][j];
start = 1;
for(int i = 1;i<m;i++)
{
if(start && ch[0][i] != '#')
arr[0][i] = 1;
else{
start = 0;
arr[0][i] = 0;
}
}
start = 1;
for(int i = 1;i<n;i++)
{
if(start && ch[i][0] != '#')
arr[i][0] = 1;
else{
start = 0;
arr[i][0] = 0;
}
}
arr[0][0] = 0;
for(int i = 1;i<n;i++)
{
for(int j = 1;j<m;j++)
{
if(ch[i][j] == '#')
arr[i][j] = 0;
else
arr[i][j] = (arr[i-1][j]%mod + arr[i][j-1]%mod)%mod;
}
}
cout << arr[n-1][m-1];
}
}
| 0
| 2,022,320
|
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss second
#define lli long long int
#define pb push_back
#define pf push_front
#define mkp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<lli,lli>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define INF 1e9
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define endl "\n"
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
lli maxm(lli a, lli b)
{
return (a >= b ? a : b);
}
lli minm(lli a, lli b)
{
return (a <= b ? a : b);
}
lli power(lli x, lli y, lli p)
{
lli 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;
}
lli nCrmodp(lli n, lli r, lli p)
{
if (r == 0)
return 1;
if (r == 1)
return n;
lli pro = 1, k = n;
while (k > r)
{
pro *= k;
pro %= p;
--k;
}
k = 2;
while (k <= (n - r))
{
pro *= power(k, (p - 2), p);
pro %= p;
++k;
}
return pro;
}
string num_str(lli n, lli k)
{
string str = "";
lli x = n;
while (x != 0)
{
string s = to_string(x % k);
str = s + str;
x /= k;
}
return str;
}
lli first_big(lli n, lli k, lli arr[])
{
lli l = 0;
lli r = n - 1;
lli leftGreater = n;
while (l <= r) {
lli m = l + (r - l) / 2;
if (arr[m] > k) {
leftGreater = m;
r = m - 1;
}
else
l = m + 1;
}
return leftGreater;
}
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#define MAXN 100005
vector<int>adj[MAXN];
lli arr[MAXN][2];
vector<bool>vis;
lli dfs(int s, int par, bool st)
{
vis[s] = true;
int indx = 0;
if (st == 1)
indx = 1;
if (arr[s][indx] == -1)
{
if (adj[s].size() == 1 && s != 1)
arr[s][indx] = 1;
else
{
lli pro = 1;
if (indx == 1)
for (auto it : adj[s])
{
if (it != par)
pro *= dfs(it, s, false);
pro %= mod;
}
else
for (auto it : adj[s])
{
if (it != par)
pro *= (dfs(it, s, true) + dfs(it, s, false));
pro %= mod;
}
arr[s][indx] = pro;
}
}
return arr[s][indx];
}
int main()
{
c_p_c();
int n, u, v;
cin >> n;
vis.rsz(n + 1, false);
memset(arr, -1, sizeof(arr));
for (int i = 1; i < n; ++i)
{
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
if (n == 1)
cout << "2\n";
else
cout << (dfs(1, 0, true) + dfs(1, 0, false)) % mod << endl;
return 0;
}
|
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
#define rng(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i,n) rng(i,0,n)
#define gnr(i,l,r) for(size_t i=(r)-1;i>=(l);i--)
#define per(i,b) gnr(i,0,b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
using namespace std;
const int MOD = 1e9+7;
const int INF = 1e18;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1,1,0,-1,-1,-1,0,1};
const int dy8[8] = {0,1,1,1,0,-1,-1,-1};
const double pi = acos(-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 gcd(int a,int b){return b?gcd(b,a%b):a;}
int n,a,b,c;
vector<int> l;
#define A 0
#define B 1
#define C 2
#define N 3
int ans = INF;
void dfs(string s){
if(s.size()==n){
int numa,numb,numc;
numa = count(ALL(s),'A');
numb = count(ALL(s),'B');
numc = count(ALL(s),'C');
if(min({numa,numb,numc})==0) return;
int cjA = 10*(numa-1);
int cjB = 10*(numb-1);
int cjC = 10*(numc-1);
int lnA,lnB,lnC; lnA=lnB=lnC=0;
for (int i = 0; i < s.size(); i++) {
if(s[i]=='A') lnA += l[i];
if(s[i]=='B') lnB += l[i];
if(s[i]=='C') lnC += l[i];
}
ans = min(ans,cjA+cjB+cjC + abs(a-lnA)+abs(b-lnB)+abs(c-lnC));
return;
}
dfs(s+'A');
dfs(s+'B');
dfs(s+'C');
dfs(s+'N');
}
void solve(){
std::ifstream in("sample.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> a >> b >> c;
l.resize(n);
rep(i,n) cin >> l[i];
dfs("");
cout << ans << endl;
}
signed main() {
solve();
return 0;
}
| 0
| 81,311,074
|
#include <stdio.h>
int main() {
char A, B, C;
scanf("%c %c %c", &A, &B, &C);
if(A==B && A!=C)
puts("Yes");
if(B==C && B!=A)
puts("Yes");
if(A==C && B!=A)
puts("Yes");
if(A==B && A==C)
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ull mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
void solve() {
int n, k; sc(n); sc(k);
int a[n]; fo(i, n) sc(a[i]);
int g = 0;
int el = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if (a[i] > a[j]) g++;
else if (a[i] < a[j]) el++;
}
}
ull num1 = (ull) k * (k+1);
num1 /= 2; num1 %= mod;
ull num2 = (ull) k * (k-1);
num2 /= 2; num2 %= mod;
num1 *= (ull) g; num1 %= mod;
num2 *= (ull) el; num2 %= mod;
ull ans = (num1 + num2) % mod;
cout << ans;
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 0
| 80,677,618
|
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long
#define vi vector <int>
#define pii pair <int, int>
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i,n) for (int i = 0; i < (int) (n); ++ i)
#define foreach(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); ++ it)
inline int read() {
int x = 0, f = 1, c = getchar();
for (;!isdigit(c);c = getchar()) if (c == '-') f ^= 1;
for (; isdigit(c);c = getchar()) x = x * 10 + c - '0';
return f ? x : -x;
}
int n;
ll d[100005];
map <ll, int> st;
vector <pii> e;
int siz[100005];
vi g[100005];
ll dfs(int u, int p) {
ll dd = 0;
rep(i, g[u].size()) if (g[u][i] != p) dd += siz[g[u][i]] + dfs(g[u][i], u);
return dd;
}
int main() {
n = read();
rep(i, n) scanf("%lld", &d[i]);
rep(i, n) st[d[i]] = i;
int rt = st.begin() -> second;
rep(i, n) siz[i] = 1;
while (!st.empty()) {
ll mx = st.rbegin() -> second;
if (mx == rt) break;
st.erase(d[mx]);
ll nxd = d[mx] - (n - 2 * siz[mx]);
if (!st.count(nxd)) {
puts("-1");
return 0;
}
siz[st[nxd]] += siz[mx];
e.pb(mp(mx, st[nxd]));
g[mx].pb(st[nxd]); g[st[nxd]].pb(mx);
}
if (dfs(rt, -1) != d[rt]) {
puts("-1");
return 0;
}
rep(i, e.size()) printf("%d %d\n", e[i].first + 1, e[i].second + 1);
return 0;
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
int main() {
string s;
cin >> s;
int next = s.at(0)-'0';
int count = 0;
for (int i = 1; i < s.size(); ++i) {
next ^= 1;
if ((s.at(i)-'0') != next) {
if (next == 1) {
s.at(i) = '1';
} else {
s.at(i) = '0';
}
count++;
}
}
cout << count << endl;
return 0;
}
| 0
| 64,991,143
|
#include <iostream>
using namespace std;
int main()
{
string x,y;
cin>>x>>y;
int z=y.length();
int cnt=0;
for(int i=0;i<z;i++)
{
if(x[i]!=y[i])
{
cnt++;
}
}
cout<<cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod = 1e9 + 7, Nmax = 1e5 + 5;
ll fact[Nmax], ifact[Nmax];
int ap[Nmax], n, i, x, rest;
ll comb(int n, int k)
{
if(n < k) return 0;
return fact[n] * ifact[k] % Mod * ifact[n-k] % Mod;
}
ll power(ll a, int b)
{
if(!b) return 1;
if(b&1) return a * power(a*a%Mod, b/2) % Mod;
return power(a*a%Mod, b/2);
}
int main()
{
cin.sync_with_stdio(false);
fact[0] = ifact[0] = 1;
cin >> n;
for(i=1; i<=n+1; ++i)
{
cin >> x;
if(ap[x]) rest = n + 1 - (i - ap[x] + 1);
else ap[x] = i;
fact[i] = fact[i-1] * i % Mod;
}
ifact[n+1] = power(fact[n+1], Mod-2);
for(i=n; i; --i) ifact[i] = ifact[i+1] * (i+1) % Mod;
for(i=1; i<=n+1; ++i)
cout << (comb(n+1, i) - comb(rest, i-1) + Mod) % Mod << '\n';
return 0;
}
| 0
| 63,217,856
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll moder = 1000000007;
int main(){
ll n,k;
cin>>n>>k;
long long ret = 0;
for(ll i=k; i<=n+1; i++){
ll lower = i*(i-1)/2;
lower%=moder;
ll upper = n*i-i*(i-1)/2;
ret+=upper-lower+1;
ret%=moder;
}
cout<<ret;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n, z, w;
cin >> n >> z >> w;
vl a(n);
rep(i, n) cin >> a[i];
ll ans;
if(n == 1)
ans = abs(a[0] - w);
else {
ans = max(abs(a[n - 1] - w), abs(a[n - 2] - a[n - 1]));
}
cout << ans << endl;
}
| 0
| 18,953,671
|
#include <iostream>
#include <vector>
#include <algorithm>
class Point{
public:
int i;
int j;
Point(int i,int j) : i(i),j(j) {}
};
class Roads{
int a;
int b;
std::vector<Point> stop;
public:
Roads(int a,int b) : a(a),b(b) {}
void setStop(Point p){
if ( p.i > 0 && p.i < a+1 && p.j > 0 && p.j < b+1 ) {
stop.push_back(p);
}
}
int choice(const int si,const int sj);
};
int Roads::choice(const int si,const int sj){
auto isStoped = std::find_if(stop.begin(),stop.end(),
[&](Point p){
if (p.i == si && p.j == sj) {
return true;
}else{
return false;
}
}
);
if (isStoped != stop.end()) {
return 0;
}
if ( si > a-1 ){
if( sj > b-1) {
return 1;
}else{
return choice(si,sj+1);
}
}else{
if ( sj > b-1 ) {
return choice(si+1,sj);
}else{
return choice(si+1,sj) + choice(si,sj+1);
}
}
}
int main(){
while (true) {
int a,b;
std::cin >> a >> b;
if (a==0 && b==0) {
return 0;
}
Roads r(a,b);
int n;
std::cin >> n;
for (int i=0; i < n; ++i) {
int xi,yi;
std::cin >> xi >> yi;
Point p(xi,yi);
r.setStop(p);
}
std::cout << r.choice(1,1) << std::endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
#define NIL -1
const int maxn = 100010;
struct Node{int p,l,r;};
Node T[maxn];
int n,D[maxn];
int depth(int u,int d){
D[u] = d;
if(T[u].l!=NIL) depth(T[u].l,d+1);
if(T[u].r!=NIL) depth(T[u].r,d);
}
int main() {
int id,k,m,c,i,left,start=0;
scanf("%d",&n);
m = n;
for(i=0;i<n;i++)
T[i].p=T[i].l=T[i].r=NIL;
while(n--){
scanf("%d %d",&id,&k);
for(i=0;i<k;i++){
scanf("%d",&c);
if(i==0) T[id].l = c;
else T[left].r = c;
left = c;
T[c].p = id;
}
}
for(i=0;i<m;i++)
if(T[i].p==NIL) start = i;
depth(start,0);
for(i=0;i<m;i++){
printf("node %d: parent = %d, depth = %d, ",i,T[i].p,D[i]);
if(T[i].p==NIL) printf("root");
else if(T[i].l==NIL) printf("leaf");
else printf("internal node");
printf(", [");
int help = T[i].l,j=0;
while(help!=NIL){
if(j) printf(", ");
printf("%d",help);
help = T[help].r;
j++;
}
printf("]\n");
}
return 0;
}
| 0
| 65,329,098
|
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
string S;
cin >> S;
int ans = MOD;
for (int i = 0; i < S.size() - 2; i++)
{
string tmp = S.substr(i, 3);
int tmp2 = atoi(tmp.c_str());
ans = min(ans, abs(tmp2 - 753));
}
cout << ans;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
bool sortByVal(const pair<string, int> &a,
const pair<string, int> &b)
{
return (a.second < b.second);
}
int main(){
int n;
cin>>n;
map<string,long long>mp;
for(int i=0;i<n;i++){
string s;
cin>>s;
sort(s.begin(),s.end());
mp[s]++;
}
long long cnt=0;
for(map<string,long long>::iterator it = mp.begin();it!= mp.end();it++){
long long y = it->second;
cnt += (y)*(y-1)/2;
}
cout<<cnt<<endl;
return 0;
}
| 0
| 33,056,671
|
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
string s;
int gx, gy;
bool valid(int x) { return (0 <= x && x < 16004); }
bool ok(int goal, vector<int> vec, bool first=false) {
vector<int> cur(16004), next(16004);
cur[8002] = true;
rep(i, vec.size()) {
rep(j, 16004) {
if (valid(j + vec[i])) next[j + vec[i]] |= cur[j];
if (!first && valid(j - vec[i])) next[j - vec[i]] |= cur[j];
}
first = false;
cur.swap(next);
next.clear();
next.resize(16004);
}
return cur[goal];
}
int main() {
cin >> s >> gx >> gy;
gx += 8002;
gy += 8002;
int cnt = 0;
int cnt_dir = 0;
vector<int> vec[2];
rep(i, s.size()) {
if (s[i] == 'F') {
cnt++;
} else {
vec[cnt_dir % 2].push_back(cnt);
cnt = 0;
cnt_dir++;
}
}
if (cnt) vec[cnt_dir % 2].push_back(cnt);
bool ans = true;
ans &= ok(gx, vec[0], true);
ans &= ok(gy, vec[1]);
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(ll, n, m);
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> s(n + 1);
rep(i, n) s[i + 1] = s[i] + a[i];
ll ans = 0;
map<ll, ll> seen;
rep(i, n + 1) {
ans += seen[s[i] % m];
++seen[s[i] % m];
}
out(ans);
}
| 0
| 30,826,827
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
int N;
int D[111111];
int w[111111];
int d[111111];
signed main(){
cin>>N;
map<int,int>uku;
rep(i,N){
cin>>D[i];
uku[D[i]]=i;
}
fill_n(w,N,1);
vpint lis;
rep(i,N)lis.pb({D[i],i});
sort(all(lis));reverse(all(lis));
vpint ans;
rep(i,N-1){
int v=lis[i].se;
int tmp=N-w[v];
int fo=D[v]+w[v]-tmp;
if(fo>=D[v]||uku.find(fo)==uku.end()){
cout<<-1<<endl;
return 0;
}
ans.pb({v,uku[fo]});
w[uku[fo]]+=w[v];
d[uku[fo]]+=d[v]+w[v];
}
int r=lis.back().se;
if(D[r]!=d[r]){
cout<<-1<<endl;
return 0;
}
rep(i,ans.size())cout<<ans[i].fi+1<<" "<<ans[i].se+1<<endl;
return 0;
}
|
#include <stdio.h>
#include <stack>
int main(void)
{
using namespace std;
stack<int> stk;
int n;
while(scanf("%d",&n)==1)
{
if(!n)
{
printf("%d\n",stk.top());
stk.pop();
}
else
{
stk.push(n);
}
}
return 0;
}
| 0
| 23,367,259
|
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int h,n;
const int N=1e3+2,M=1e4+2;
vector<pair<int, int>>a;
int dp[N][M];
int sol(int ind,int remain)
{
d(ind,remain);
if(remain<=0)
{
return 0;
}
if(ind>=n)
{
return INT_MAX;
}
if(dp[ind][remain]!=-1)
{
return dp[ind][remain];
}
int take=a[ind].ss+sol(ind,remain-a[ind].ff);
int notake=sol(ind+1,remain);
return dp[ind][remain]=min(take,notake);
}
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
cin>>h>>n;
a.resize(n);
for(i=0;i<n;i++)
{
cin>>a[i].ff>>a[i].ss;
}
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
{
dp[i][j]=-1;
}
}
cout<<sol(0,h);
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINT(X) if(ci-cn+16>cm){while((ct=readchar())>='0')(X)=(X)*10+ct-'0';}else{while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';}
using namespace std;
uint16_t d, k;
uint32_t M = 0;
int_fast64_t c, sd = 0, sc = 0;
const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char readchar() {
if(ci-cn==cm){fread_unlocked(cn,1,cm,stdin);ci=cn;}
return *ci++;
}
int main() {
READINT(M);
while(M--) {
d = 0;
READINT(d);
c = 0;
READINT(c);
sc += c;
sd += c * d;
}
printf("%lld\n", --sc + --sd / 9);
return 0;
}
| 0
| 47,413,093
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s; cin>>s;
int n=s.size();
ll ans=0;
int b=0;
int i=0;
for (int i=0; i<n; i++){
if(s[i]=='B') b++;
if(s[i]=='W') ans+=b;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r)
{
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
template <typename T, T N>
class UnionFind {
T parent_[N];
T rank_[N];
T size_[N];
public:
UnionFind();
T Root(T idx);
bool IsSame(T x, T y);
void Unite(T x, T y);
T GetSize(T idx);
};
template <typename T, T N>
UnionFind<T, N>::UnionFind()
{
for (T i = 0; i < N; i++) {
parent_[i] = i;
rank_[i] = 0;
size_[i] = 1;
}
}
template <typename T, T N>
T UnionFind<T, N>::Root(T idx)
{
return parent_[idx] == idx ? idx : parent_[idx] = Root(parent_[idx]);
}
template <typename T, T N>
bool UnionFind<T, N>::IsSame(T x, T y)
{
return Root(x) == Root(y);
}
template <typename T, T N>
void UnionFind<T, N>::Unite(T x, T y)
{
x = Root(x);
y = Root(y);
if (x == y) {
return;
}
if (rank_[x] < rank_[y]) {
parent_[x] = y;
size_[y] += size_[x];
} else {
parent_[y] = x;
size_[x] += size_[y];
if (rank_[x] == rank_[y]) {
rank_[x]++;
}
}
}
template <typename T, T N>
T UnionFind<T, N>::GetSize(T idx)
{
return size_[Root(idx)];
}
long long pow_mod(long long n, long long p, long long m)
{
if (p == 0) {
return 1;
}
if (p % 2 == 0) {
long long t = pow_mod(n, p / 2, m);
return t * t % m;
}
return n * pow_mod(n, p - 1, m) % mod;
}
long long nCr_mod(long long n, long long r)
{
long long x = 1;
for (long long i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
long long a = 1;
for (long long i = 1; i <= r; i++) {
a *= i;
a %= mod;
}
long long y = pow_mod(a, mod - 2, mod) % mod;
return x * y % mod;
}
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;
}
bool is_leap(long long y)
{
return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}
void next_day(long long& y, long long& m, long long& d)
{
d++;
if (d > last_days[m - 1] + (m == 2 && is_leap(y) ? 1 : 0)) {
d = 1;
m++;
}
if (m > 12) {
y++;
m = 1;
}
}
long long fib(long long n)
{
long long a = 0, b = 1;
for (int i = 0; i < n; i++) {
long long t = a;
a = b;
b = a + t;
}
return a;
}
int main()
{
std::string s;
std::cin >> s;
std::map<char, bool> m;
for (auto c : s) {
m[c] = true;
}
char abc[] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z' };
if (s.size() != 26) {
for (auto c : abc) {
if (!m[c]) {
std::cout << s << c << std::endl;
return 0;
}
}
}
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] != 'z') {
for (auto c : abc) {
if (!m[c] && s[i] < c) {
s.pop_back();
std::cout << s << c << std::endl;
return 0;
}
}
}
m[s[i]] = false;
s.pop_back();
}
std::cout << -1 << std::endl;
}
| 0
| 71,765,040
|
#include <iostream>
#include <vector>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
vector<vector<int>> dist(10, vector<int>(10, -1));
for(int i = 0; i < N; ++i) {
int a, b, c;
cin >> a >> b >> c;
dist[a][b] = dist[b][a] = c;
dist[a][a] = 0;
dist[b][b] = 0;
}
for(int k = 0; k < 10; ++k) {
for(int i = 0; i < 10; ++i) {
for(int j = 0; j < 10; ++j) {
if(dist[i][k] == -1 || dist[k][j] == -1) continue;
const int nd = dist[i][k] + dist[k][j];
if(dist[i][j] == -1 || dist[i][j] > nd) {
dist[i][j] = nd;
}
}
}
}
int town = -1;
int sum = -1;
for(int i = 0; i < 10; ++i) {
int tmp = 0;
bool valid = false;
for(int j = 0; j < 10; ++j) {
if(dist[i][j] != -1) {
tmp += dist[i][j];
valid = true;
}
}
if(valid && (sum == -1 || tmp < sum)) {
town = i;
sum = tmp;
}
}
cout << town << ' ' << sum << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
while(solve()) ;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
string s,t;
cin >> s >> t;
vector<vector<int>> dp(s.size()+1,vector<int>(t.size()+1,0));
dp[0][0] = 0;
rep(i,s.size()) dp[i+1][0] = i+1;
rep(j,t.size()) dp[0][j+1] = j+1;
rep(i,s.size())rep(j,t.size()){
dp[i+1][j+1] = min(dp[i+1][j],dp[i][j+1]) + 1;
dp[i+1][j+1] = min(dp[i+1][j+1],dp[i][j] + (s[i]==t[j]?0:1));
}
cout << dp.back().back() << endl;
return 0;
}
| 0
| 13,394,259
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<(n); i++)
#define REPS(i, n) for(int i=0; i<=(n); i++)
#define FOR(i, a, b) for(int i=a; i<(b); i++)
#define FORS(i, a, b) for(int i=a; i<=(b); i++)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main(){
int N, R;
cin >> N >> R;
if(N>=10) cout << R << endl;
else cout << R+100*(10-N) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
if(a < b) {a = b; return true;}
return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
if(a > b) {a = b; return true;}
return false;
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
os << p.first << ":" << p.second;
return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if(i) os << " ";
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string s; cin >> s;
int n = SZ(s);
map<ll, int> mp;
mp[0] = 0;
ll now = 0;
REP(i, n) {
now ^= 1ll << (s[i] - 'a');
int mi = mp.find(now) != mp.end() ? mp[now] : INF;
REP(j, 26) {
ll tmp = now ^ (1ll<<j);
if(mp.find(tmp) != mp.end()) chmin(mi, mp[tmp] + 1);
}
mp[now] = mi;
}
cout << max(1, mp[now]) << endl;
}
| 0
| 93,957,243
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
int c=1;
cin >> a;
cin >> b;
while(a>0){
c = c*b;
if (b/c==1){
b--;
}
a--;
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int parent[2000005];
int div1[100005];
int min_indx[900005];
int count1 = 0;
int height = 0;
int max_indx[200005];
void dfs(int node)
{
vis[node] = 1;
min_indx[count1] = node;
max_indx[node] = min(max_indx[node], count1);
count1++;
child[node] = height++;
for (int i = 0; i < vec[node].size(); i++)
{
if (!vis[vec[node][i]])
{
dfs(vec[node][i]);
min_indx[count1] = node;
max_indx[node] = min(max_indx[node], count1);
count1++;
}
}
height--;
}
int MAXN = 200005;
int LOGMAXN = (int)log2(200005) + 1;
int M[200005][60];
void process2(int A[], int N)
{
int i, j;
for (i = 0; i < N; i++)
M[i][0] = i;
for (j = 1; 1 << j <= N; j++)
for (i = 0; i + (1 << j) - 1 < N; i++)
if (A[M[i][j - 1]] < A[M[i + (1 << (j - 1))][j - 1]])
M[i][j] = M[i][j - 1];
else
M[i][j] = M[i + (1 << (j - 1))][j - 1];
}
vector<int> vec1;
int lev[200005];
int dis[200005];
bool cmp(pair<int, int> &a,
pair<int, int> &b)
{
return a.second < b.second;
}
int32_t main()
{
int n, m;
cin >> n >> m;
if (n <= 8 && m <= 8)
cout << "Yay!"
<< "\n";
else
{
cout << ":("
<< "\n";
}
return 0;
}
| 0
| 72,243,061
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1000000;
int main() {
int N;
ll a[200005];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll r = 0, ans = 0, sum1 = 0, sum2 = 0;
for (int i = 1; i <= N; i++) {
while (sum1==sum2 && r <= N) {
r++;
sum1 += a[r];
sum2 ^= a[r];
}
ans += r-i;
sum1 -= a[i];
sum2 ^= a[i];
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans[100009];
struct ss
{
ll v;
ll pos;
}a[100009];
const bool com(const ss &a,const ss&b)
{
if(a.v>b.v)return 1;
else if(a.v==b.v)
{
return a.pos<b.pos;
}
return 0;
}
int main()
{
ll n;
scanf("%lld",&n);
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i].v);
a[i].pos=i;
}
sort(a+1,a+1+n,com);
a[n+1].v=0;
ll tmp=1;
ll num=a[1].pos;
for(ll i=2;i<=n+1;i++)
{
if(a[i].v==a[i-1].v)tmp++;
else
{
ans[num]+=(a[i-1].v-a[i].v)*tmp;
tmp++;
}
if(a[i].pos<num)
{
num=a[i].pos;
}
}
for(ll i=1;i<=n;i++)
{
printf("%lld\n",ans[i]);
}
}
| 0
| 97,810,140
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
int main() {
#ifdef local
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n; cin >> n;
int m = 1 << n;
vector<int> a(m);
vector<pii> c(m);
for(int i = 0; i < m; i++) {
cin >> a[i];
c[i] = make_pair(a[i], 0);
}
auto add = [&](pii &a, const pii &b) {
if(a.se < b.fi) {
a.se = b.fi;
if(a.fi < a.se) swap(a.fi, a.se);
if(a.se < b.se) a.se = b.se;
}
};
for(int i = 1; i < m; i <<= 1)
for(int j = 0; j < m; j += i * 2)
for(int k = 0; k < i; k++)
add(c[i + j + k], c[j + k]);
vector<int> ans(m);
for(int i = 1; i < m; i++) {
ans[i] = c[i].fi + c[i].se;
ans[i] = max(ans[i], ans[i - 1]);
cout << ans[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define loop(i, n) for(int i = 0 ; i < n ; ++i)
#define rloop(i, n) for(int i = int(n)-1 ; i >= 0 ; --i)
#define loopOne(i, n) for(int i = 1 ; i <= n; ++i)
#define range(i, a, b) for(int i = int(a) ; i <= int(b) ; ++i)
#define sz(x) int(x.size())
void GO(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const ll N = 1e5+100, OO = 1e9;
int mx = -OO, mn = OO;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int arr[N], n, memo[N], res;
int Solve(int idx){
if(memo[idx] != -1) return memo[idx];
int op1 = OO, op2 = OO;
if(idx + 1 >= n) return 0;
op1 = abs(arr[idx]-arr[idx+1]) + Solve(idx+1);
if(idx + 2 < n)
op2 = abs(arr[idx]-arr[idx+2]) + Solve(idx+2);
return memo[idx] = min(op1, op2);
}
int main() {
GO();
scanf("%d", &n);
for(int i = 0; i < n; ++i){
scanf("%d", arr+i);
}
memset(memo, -1, sizeof(memo));
printf("%d", Solve(0));
return 0;
}
| 0
| 54,099,864
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x) cout<<"debug: "<<x<<endl
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;}
int n, m, ans;
int main(){
cin >> n >> m;
if(n > 1) ans += (n*(n-1))/2;
if(m > 1) ans += (m*(m-1))/2;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
#define lld long double
#define endl "\n"
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vi vector<int>
#define vch vector<char>
#define sll set<ll>
#define sch set<ch>
#define vpll vector< pair<ll,ll> >
#define vpii vector< pair<int,int> >
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mll map<ll, ll>
#define mcll map<char,ll>
#define sz(container) ll((container).size())
#define fill(a,b) memset(a, b, sizeof(a))
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
lld pi=3.1415926535897932;
const ll MOD=1e9+7;
const ll dx[4]={-1, 0, 1, 0} , dy[4]={0, 1, 0, -1};
const ll dxx[8]={-1, -1, 0, 1, 1, 1, 0, -1} , dyy[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll lcm(ll a, ll b)
{
ll g=__gcd(a, b);
return a/g*b;
}
ll binpow(ll a, ll b, ll m)
{
a %= m;
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
bool isPrime(ll n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_io;
ll T=1;
For(i,1,T)
{
ll h,w,m;cin>>h>>w>>m;
map<ll,ll>row,col;
map<pair<ll,ll>, ll>tg;
ll mx1=0,mx2=0;
vll rmx,cmx;
For(j,1,m)
{
ll a,b;cin>>a>>b;
a--;b--;
row[a]++;col[b]++;
mx1=max(mx1,row[a]);
mx2=max(mx2,col[b]);
tg[mp(a,b)]=1;
}
For(j,0,h-1)
{
if(mx1==row[j]) rmx.pb(j);
}
For(j,0,w-1)
{
if(mx2==col[j]) cmx.pb(j);
}
ll ch=0;
For(j,0,sz(rmx)-1)
{
For(k,0,sz(cmx)-1)
{
if(tg[mp(rmx[j],cmx[k])]!=1)
{
ch=1;break;
}
}
}
if(ch) cout<<mx1+mx2;
else cout<<mx1+mx2-1;
}
}
| 0
| 94,086,173
|
#include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, A, B, C;
ll mp(vector<ll>& which_stick, vector<ll>& L)
{
ll res = -30;
vector<ll> length(3, 0);
for (ll i = 0; i < N; ++i)
{
if (which_stick.at(i) == 3)
{
continue;
}
res += 10;
length.at(which_stick.at(i)) += L.at(i);
}
for (ll i = 0; i < 3; ++i)
{
if (length.at(i) == 0)
{
return INF;
}
}
res += abs(A - length.at(0)) + abs(B - length.at(1)) + abs(C - length.at(2));
return res;
}
void next(vector<ll>& which_stick)
{
which_stick.at(N - 1) += 1;
for (ll i = N - 1; i >= 0; --i)
{
if (which_stick.at(i) < 4)
{
return;
}
if (i == 0)
{
which_stick.at(0) = -1;
return;
}
which_stick.at(i) %= 4;
which_stick.at(i - 1) += 1;
}
return;
}
int main()
{
cin >> N >> A >> B >> C;
vector<ll> L(N);
vector<ll> which_stick(N, 0);
ll pattern = pow(4, N);
for (ll i = 0; i < N; ++i)
{
cin >> L.at(i);
}
ll ans = INF;
for (ll i = 0; i < pattern; ++i)
{
ans = min(ans, mp(which_stick, L));
next(which_stick);
}
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define LB(a,x) lb(all(a), x) - a.begin()
#define UB(a,x) ub(all(a), x) - a.begin()
#define MOD 1000000007
#define itn int
#define enld endl
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b){if(b<a){a=b; return 1;} return 0;}
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
int main(){
int N,K; cin >> N >> K;
if(K == 1) cout << 0 << endl;
else{
cout << N - K << enld;
}
return 0;
}
| 0
| 34,779,865
|
#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;
cin >> S;
int ans = 0;
int leftcnt = 0;
char leftcol;
rep(i,S.size()) {
if (leftcnt == 0) {
leftcol = S.at(i);
++leftcnt;
} else if (leftcnt > 0) {
if (S.at(i) == leftcol) ++leftcnt;
else {
ans += 2;
--leftcnt;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using ch = char;
using db = double;
using bl = bool;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vch = vector<char>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
#define rep(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define vrep(i, vec) for(auto& i : vec)
#define vin(vec) for(auto& i : vec) cin >> i
#define all(v) v.begin(), v.end()
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b;return true;} return false;}
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b;return true;} return false;}
const ll mod = 1000000007;
const ll inf = 1LL << 60;
int main(){
st s;
ll k, n;
cin >> s >> k;
n = s.size();
vvll dp1(n + 1, vll(k + 1, 0)), dp2(n + 1, vll(k + 1, 0));
dp2.at(0).at(0) = 1;
rep(i, 0, n)rep(j, 0, k + 1){
if(s.at(i) == '0'){
dp1.at(i + 1).at(j) += dp1.at(i).at(j);
dp2.at(i + 1).at(j) += dp2.at(i).at(j);
if(j < k) dp1.at(i + 1).at(j + 1) += dp1.at(i).at(j) * 9;
}
else{
dp1.at(i + 1).at(j) += dp1.at(i).at(j) + dp2.at(i).at(j);
if(j < k){
dp1.at(i + 1).at(j + 1) += dp1.at(i).at(j) * 9 + dp2.at(i).at(j) * (s.at(i) - '1');
dp2.at(i + 1).at(j + 1) += dp2.at(i).at(j);
}
}
}
cout << dp1.at(n).at(k) + dp2.at(n).at(k) << endl;
}
| 0
| 79,850,476
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
int cost = 0;
cost += min(a,b);
cost += min(c,d);
cout << cost << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const int MAX = 64;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
V<ll> a(n);
rep(i, n) cin >> a[i];
V<V<P>> bits(n, V<P>(MAX, {0, 0}));
for (int i = 0; i < n; i++) {
rep(j, MAX) {
bits[i][j] = (i > 0) ? bits[i - 1][j] : P({0, 0});
if (a[i] >> j & 1)
bits[i][j].first++;
else
bits[i][j].second++;
}
}
ll ans = 0;
rep(i, n - 1) {
V<P> b = bits[n - 1];
rep(j, MAX) {
b[j].first -= bits[i][j].first;
b[j].second -= bits[i][j].second;
}
ll e = 1;
rep(j, MAX) {
if (a[i] >> j & 1) {
ans += b[j].second * e % mod;
} else {
ans += b[j].first * e % mod;
}
ans %= mod;
e = e * 2 % mod;
}
}
cout << ans << endl;
}
| 0
| 91,454,879
|
#include<iostream>
using namespace std;
int f(int x){
int y;
y=x*x;
return y;}
int main(){
int d,e,ans;
while(cin>>d){
ans=0;
e=600/d;
for(int i=0;i<e;i++){
ans+=f(i*d)*d;}
cout<<ans<<endl;}}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1000000000000000000;
int main(){
int n; cin >> n;
ll ans=1;
vector<ll> a(100100);
for(int i=0; i<n; i++){
cin >> a[i];
if(a[i]==0){
cout << "0\n";
return 0;
}
}
for(int i=0; i<n; i++){
if(a[i]<=inf/ans){
ans *= a[i];
}else{
ans = -1;
break;
}
}
cout << ans << "\n";
}
| 0
| 49,233,907
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = true;
if (s.at(0) != 'A')ans = false;
if (!('a' <= s.at(1) && s.at(1) <= 'z'))ans = false;
if (!('a' <= s.at(s.length() - 1) && s.at(s.length() - 1) <= 'z'))ans = false;
int big = 0;
for (int i = 2; i <= s.length()-2; i++) {
if ('A' <= s.at(i) && s.at(i) <= 'Z')big++;
}
if (big == 0 || big >= 2)ans = false;
if (ans)cout << "AC" << endl;
else cout << "WA" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h.at(i);
int wa=0;
rep(i,n) wa += h.at(i);
int mi = 1000;
int miwa = 0;
int i=0;
for(;;){
int b = 0;
mi = 1000;
for(int i=0;i<n;i++){
if(h.at(i) == 0 ){
for(int k=b; k<i;k++){
mi = min(mi,h.at(k));
}
for(int k=b; k<i;k++){
h.at(k) -= mi;
}
if(mi != 1000){
wa -= mi * (i-b);
miwa += mi;
}
b = i+1;
mi = 1000;
}
else if(i == n-1){
i++;
for(int k=b; k<i;k++){
mi = min(mi,h.at(k));
}
for(int k=b; k<i;k++){
h.at(k) -= mi;
}
if(mi != 1000){
wa -= mi * (i-b);
miwa += mi;
}
b = i+1;
mi = 1000;
}
}
if(wa == 0)break;
}
cout << miwa <<endl;
}
| 0
| 13,696,858
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
cin >> s;
bool ans=true,ccheck=false;
for(int i=0;i<s.size();i++){
if(i==0){
if(s[i]!='A'){
ans=false;
break;
}
}else if(i>=2 && i<=s.size()-2 && s[i]=='C'){
if(ccheck){
ans = false;
break;
}else{
ccheck=true;
}
}else{
if(isupper(s[i])){
ans=false;
break;
}
}
}
if(ans && ccheck)cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int solve(int arr[],int n){
int res=0;
for (int i =0; i<= n - 1; i++) {
int val = 0;
for (int j =i; j<= n - 1; j++) {
val = val + arr[j];
if (val % 2 != 0)
res++;
}
}
return (res);
}
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c>=a && c<=b){
cout<<"Yes"<<endl;
return 0;
}
cout<<"No"<<endl;
return 0;
}
| 0
| 85,224,401
|
#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 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 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;
}
|
#include <bits/stdc++.h>
using namespace std;
int steps(int x1, int y1, int x2, int y2) {
return max(x1-x2,x2-x1) + max(y1-y2,y2-y1);
}
int main() {
int N;
cin >> N;
vector<vector<int>> p(N, vector<int>(3));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> p.at(i).at(j);
}
}
bool b = 1;
int c = steps(0,0,p.at(0).at(1),p.at(0).at(2)) - p.at(0).at(0);
if (c > 0 || (c % 2) == -1) {
b = 0;
goto FF;
}
for (int i = 1; i < N; i++) {
int d = steps(p.at(i).at(1), p.at(i).at(2), p.at(i-1).at(1), p.at(i-1).at(2)) - (p.at(i).at(0) - p.at(i-1).at(0));
if (d > 0 || (d % 2) == -1) {
b = 0;
break;
}
}
FF:
if (b == 1) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0
| 5,426,941
|
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int d;
while(scanf("%d", &d) != EOF){
int ans = 0;
for(int i=0; i<600; i+=d)
ans += i*i;
printf("%d\n", ans*d);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
bool ispal(string s){
int n = s.size();
for(int i = 0; i < n/2; i++){
if(s[i] != s[n - i - 1])return 0;
}
return 1;
}
int main(){
FAST
string s; cin >> s;
int n = s.size();
string s2 = "", s3 = "";
for(int i = 0; i < n/2; i++){
s2 += s[i];
}
for(int i = (n + 1)/2; i < n; i++){
s3 += s[i];
}
if(ispal(s) && ispal(s2) && ispal(s3)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
| 0
| 2,391,131
|
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define ceil(a,b) (((a)+(b)-1)/(b))
#define dist(a,b) max((a)-(b),(b)-(a))
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
template< template<class ...> class Ctn,class T>
std::ostream& operator<<(std::ostream& os,const Ctn<T>& v){
auto itr=v.begin();
while(itr!=v.end()){
if(itr!=v.begin())cout << " ";
cout << *(itr++);
}
return os;
}
int main(){
int n,k; cin >>n >>k;
int m=n;
double ans=0,p=1;
while(k){
if(n>=k){
ans+=(n-k+1)*p;
n=k-1;
}
p/=2.0;
if(k<=1) break;
k=ceil(k,2);
if(df)print(k);
}
printf("%.15lf\n",ans/m);
}
|
#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; }
int main() {
int a=0,b=0;
int i;
for(i=0;i<4;i++){
a+=in();
}
for(i=0;i<4;i++){
b+=in();
}
cout<<max(a,b)<<endl;
}
| 0
| 7,656,676
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
int z;
cin >> z;
int a;
int b;
int c;
int d;
d = z % 10;
z -= d;
c = (z % 100) / 10;
z -= c * 10;
b = (z % 1000) / 100;
a = (z - b * 100) / 1000;
int eq;
char o1, o2, o3;
for (int bit = 0; bit < (1 << 3); bit++) {
if (bit & (1 << 0)) {
eq = a + b;
o1 = '+';
}
else {
eq = a - b;
o1 = '-';
}
if (bit & (1 << 1)) {
eq = eq + c;
o2 = '+';
}
else {
eq = eq - c;
o2 = '-';
}
if (bit & (1 << 2)) {
eq = eq + d;
o3 = '+';
}
else {
eq = eq - d;
o3 = '-';
}
if (eq == 7) {
cout << a << o1 << b << o2 << c << o3 << d << "=7" << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
for(int i = 0; i < S.size(); i++) {
if(S == T) {
cout << "Yes" << endl;
return 0;
}
S = S[S.size()-1]+S.substr(0,S.size()-1);
}
cout << "No" << endl;
}
| 0
| 1,793,405
|
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#define ll long long
#define dd double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r,d,x;
cin>>r>>d>>x;
int t=10;
int x1;
while(t--){
x1=(r*x)-d;
cout<<x1<<endl;
x=x1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
#endif
int n;
cin>>n;
vector<ll> a(n);
ll ans = 1e18,x = 0,y=0;
for(int i=0;i<n;i++){
cin>>a[i];
x += a[i];
}
for(int i=0;i<n-1;i++){
y+=a[i];
x-=a[i];
ans = min(ans,abs(x-y));
}
cout << ans << endl;
}
| 0
| 39,029,350
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int k,a,b;
cin>>k>>a>>b;
if(b-a>2)
{
if(k<a+1)
{
cout<<k+1;
}
else
{
int z=a;
k-=a-1;
int tt=(k/2);
int ans=a+(tt*(b-a));
ans+=(k%2);
cout<<ans;
}
}
else
{
int z=k+1;
cout<<z;
}
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
using namespace std;
template<class T> inline T cabs(const T &x) { return x > 0 ? x : (-x); }
template<class T> inline T gcd(const T &x, const T &y) { return (y == 0) ? x : gcd(y, x % y); }
template<class T> inline T sgn(const T &x) { return (x > 0) - (x < 0); }
#define dbg(x) cout << #x << " = " << (x) << endl
#define dbg2(x,y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define dbg3(x,y,z) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl
#define dbg4(x,y,z,w) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #w << " = " << w << endl
#define out(x) cout << (x) << endl
#define out2(x,y) cout << (x) << " " << (y) << endl
#define out3(x,y,z) cout << (x) << " " << (y) << " " << (z) << endl
#define out4(x,y,z,w) cout << (x) << " " << (y) << " " << (z) << " " << (w) << endl
int main()
{
int N;
cin >> N;
int step = 0, sum = 0;
do {
step ++;
sum += step;
} while( sum < N );
int skip = sum - N;
step = 0, sum = 0;
do {
step ++;
if( step == skip ) ;
else {
printf("%d\n", step);
sum += step;
}
} while( sum < N );
return 0;
}
| 0
| 65,651,934
|
#include <stdio.h>
int ceilindex(int sec_array[],int l,int r,int key){
while(r-l>1){
int m = l+(r-l)/2;
if(sec_array[m]>=key)
r = m;
else l = m;
}
return r;
}
int findNumberOfLIS(int nums[],int n){
int sec_array[n];
int len;
sec_array[0] = nums[0];
len = 1;
for(int i =1; i<n; i++){
if(nums[i]<sec_array[0])
sec_array[0] = nums[i];
else if(nums[i]>sec_array[len-1])
sec_array[len++] = nums[i];
else {
sec_array[ceilindex(sec_array,-1,len-1,nums[i])] = nums[i];
}
}
return len;
}
int main(){
int n;
scanf("%d",&n);
int nums[n];
for(int i = 0; i<n; i++){
scanf("%d",&nums[i]);
}
printf("%d\n",findNumberOfLIS(nums,n));
return 0;
}
|
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF (1e9)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
int N, H;
cin >> N >> H;
vector<pair<ll, int>> A(N), B(N);
REP(i, N){
int a, b; cin >> a >> b;
A[i] = {a, i};
B[i] = {b, i};
}
sort(ALL(A), greater<P>());
sort(ALL(B), greater<P>());
ll a0 = A[0].first;
ll cumsum = 0;
ll ans = INF;
REP(i, N){
cumsum += B[i].first;
if (cumsum < H){
ans = min(ans, (i+1 + (H-cumsum+a0-1)/a0));
} else {
ans = min(ans, (ll)(i+1));
}
}
print(ans);
return 0;
auto func = [&](int n){
int cnt = 0;
ll damage = 0;
REP(i, N){
if (B[i].first > A[0].first){
damage += B[i].first;
cnt++;
if (cnt >= n) break;
}
}
if (cnt < n){
damage += A[0].first * (n - cnt);
}
return damage;
};
int ok = 1e9;
int ng = 0;
while (ok - ng > 1){
int mid = (ok + ng) / 2;
if (func(mid) >= H){
ok = mid;
} else {
ng = mid;
}
}
print(ok);
return 0;
}
| 0
| 44,638,960
|
#include <iostream>
using namespace std;
int main (void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c << endl;
}else if (b == c) {
cout << a << endl;
}else if (c == a) {
cout << b << endl;
}
return 0;
}
|
#include <cstdio>
int m,nmin,nmax;
int P[205];
int diff[205];
int main(){
while(scanf("%d%d%d",&m,&nmin,&nmax)&&m&&nmin&&nmax){
for(int i=1;i<=m;i++) scanf("%d",P+i);
for(int i=1;i<=m-1;i++) diff[i]=P[i]-P[i+1];
int ans=nmax,difference=diff[ans];
for(int i=nmax;i>=nmin;i--)
if (diff[i]>difference) ans=i,difference=diff[i];
printf("%d\n",ans);
}
return 0;
}
| 0
| 44,289,466
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#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 a,b,c,d,ans=0;
cin>>a>>b>>c>>d;
int fifth=(c*d)/__gcd(c,d) ;
ans = (b-a+1) - ((b/c-(a-1)/c)+(b/d-(a-1)/d)) ;
ans += ((b/fifth-(a-1)/fifth));
cout << ans << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#define forr(i,a) for(int i = a; i >= 0; i--)
#define fori(i,m) for(auto i = m.begin(); i != m.end(); i++)
#define sz(s) int(s.size())
#define cls(a,car) memset(a,car,sizeof (a))
using namespace std;
typedef long long ll;
const int N = 1 * 1e5 + 5;
const ll mod = 1e9 + 7;
const int INF = INT_MAX;
const ll INFCAD = ll(INT_MAX) * 2 + 1;
int toInt(const string &s){
if(s[0] == '-')
return -(s[1] - '0');
return (s[0] - '0');
}
int main(){
ll n,m;
cin >> n >> m;
if(n >= m)
cout << m / 2 << '\n';
else{
ll ans = 0;
ll aux = min(n,m / 2);
ans += aux;
m -= aux * 2;
if(m > 0)
ans += m / 4;
cout << ans << '\n';
}
return 0;
}
| 0
| 3,434,743
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
void dfs(string op,int now,int i)
{
if(i==4)
{
if(now==7)
{
for(int i =0 ;i<3;i++)cout<<s[i]<<op[i+1];
cout<<s.back();
cout<<"=7"<<endl;
exit(0);
}
return;
}
dfs(op+'+',now+s[i]-'0',i+1);
if(i)dfs(op+'-',now-s[i]+'0',i+1);
}
int main()
{
cin >> s;
dfs("",0,0);
}
|
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793
int main(){
int H, W, A, B; cin >> H >> W >> A >> B;
rep(i, B){
rep(j, A){
cout << 0;
}
rep(j, W-A){
cout << 1;
}
cout << endl;
}
rep(i, H-B){
rep(j, A){
cout << 1;
}
rep(j, W-A){
cout << 0;
}
cout << endl;
}
}
| 0
| 25,528,880
|
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.1415926535897932384626;
long long int mod = 1000000007;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "RULD";
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll rui(ll abc,ll bed){
if(bed==0){return 1;}
else{
ll ced = rui(abc,bed/2);
ced *= ced;
ced %= mod;
if(bed%2==1){ced*=abc; ced%=mod;}
return ced;
}
}
ll i,j,k,ii,jj;
ll n,m,num;
ll a,b,c,d,e,f,g,h,w;
ll x[800005],y[800005],z[900005];
char s[500005];
ll len[500];
bool dame;
int main(){
cin>>n;
for(i=0;i<n;i++){
cin>>x[i]>>y[i];
}
len[31] = 1;
for(i=30;i>=0;i--){
len[i] = len[i+1] * 2;
}
a = abs(x[0]) + abs(y[0]);
for(i=0;i<n;i++){
if((x[i] + y[i] - a) % 2 == 1){
dame = true;
}
}
if(dame){
p(-1);
return 0;
}
if(a%2==0){
for(i=0;i<n;i++){
x[i] += 1;
}
p(33);
for(i=0;i<32;i++){
pe(len[i]);
}
p(1);
}else{
p(32);
for(i=0;i<32;i++){
pe(len[i]);
}
el;
}
for(i=0;i<n;i++){
ll posx = 0;
ll posy = 0;
for(j=0;j<32;j++){
ll knum = -1;
ll ksum = INF;
ll lenx,leny;
for(k=0;k<4;k++){
lenx = dx[k] * len[j];
leny = dy[k] * len[j];
if(ksum > abs(x[i] - (posx + lenx)) + abs(y[i] - (posy + leny))){
ksum = abs(x[i] - (posx + lenx)) + abs(y[i] - (posy + leny));
knum = k;
}
}
posx += dx[knum] * len[j];
posy += dy[knum] * len[j];
pu(dir[knum]);
}
if(a%2==0){
pu("L");
}
el;
}
return 0;
}
|
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<ll> a(n);
vector<ll> psum(n+1);
vector<ll> sum( n+1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
sum[i+1] = sum[i]+a[i];
psum[i+1] = psum[i];
if(a[i]>0){
psum[i+1] += a[i];
}
}
ll result = -1e18;
for (int i = 0; i < n-k+1; i++) {
result = max(result,psum[n]-( psum[i+k]-psum[i] )+max( (ll)0, sum[i+k]-sum[i] ) );
}
std::cout << result << std::endl;
}
| 0
| 70,916,394
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.