code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,C,K;
cin>>N>>C>>K;
vector<int>T(N);
for(int i=0;i<N;++i)cin>>T[i];
sort(T.begin(),T.end());
int count=0;
for(int i=0;i<N;){
int s=i;
while(T[i]-T[s]<=K && i-s<C && i<N)++i;
++count;
}
cout<<count;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P = pair<int,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; }
signed main(){
int x,y,z,k;
cin >> x >> y >> z >> k;
vint A(x);
vint B(y);
vint C(z);
rep(i,0,x) cin >> A[i];
rep(i,0,y) cin >> B[i];
rep(i,0,z) cin >> C[i];
sort(A.rbegin(),A.rend());
sort(B.rbegin(),B.rend());
sort(C.rbegin(),C.rend());
vint ABC;
rep(a,0,x){
rep(b,0,y){
if((a+1)*(b+1) > k) break;
rep(c,0,z){
if((a+1)*(b+1)*(c+1) > k) break;
ABC.push_back(A[a] + B[b] + C[c]);
}
}
}
sort(ABC.rbegin(),ABC.rend());
rep(i,0,min(k,x*y*z)){
cout << ABC[i] << endl;
}
}
| 0
| 75,481,694
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string str, ope, p, str_rev;
int q, a, b;
cin >>str >>q;
for(int i=0; i<q; i++){
cin >>ope >>a >>b;
if(ope=="replace"){
cin >>p;
str.replace(a, p.size(), p);
}else if(ope=="reverse"){
str_rev=str.substr(a, b-a+1);
reverse(str_rev.begin(), str_rev.end());
str.replace(a, str_rev.size(), str_rev);
}else{
cout <<str.substr(a, b-a+1) <<endl;
}
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<vector>
#include<iomanip>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll v[205];
ll x[20000005];
ll a[10000005];
ll b[10000005];
ll dp[10005][10005];
ll ex = 1000000007;
int dx[4] = { 1,-1,0,0 };
int dy[4] = { 0,0,1,-1 };
typedef pair<ll, ll> P;
double q[200005];
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
int main() {
ll n, m;
cin >> n >> m;
if (n*2 >= m) {
cout << m / 2<< endl;
return 0;
}
else {
ll count = n;
m -= 2* n;
count += m / 4;
cout << count << endl;
return 0;
}
}
| 0
| 97,938,619
|
#include <iostream>
using namespace std;
int main(void)
{
int n;
cin >> n;
while (n--){
int y, m, d;
cin >> y >> m >> d;
int cnt = 0;
int x;
while (1){
if (y == 1000 && m == 1 && d == 1){
break;
}
d++;
if (d == 20 && ((y % 3) != 0) && (m % 2) == 0){
m++;
d = 1;
}
else if (d == 21 && ((y % 3 == 0) || (m % 2 != 0))){
m++;
d = 1;
}
if (m == 11){
m = 1;
y++;
}
cnt++;
}
cout << cnt << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
ll modexpo(ll a,ll b)
{
ll ans=1LL;
while(b>0)
{
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
int n,m;
int dp[205][205];
int R;
ll res;
bool used[9];
vector<int> r(9);
void dfs(int c,int last,ll dist){
if(c==R+1){
if(res>dist)res=dist;
return ;
}
for(int i=1;i<=R;i++){
if(!used[i]){
used[i]=true;
if(last==-1)dfs(c+1,i,0);
else dfs(c+1,i,dist+dp[r[last]][r[i]]);
used[i]=false;
}
}
}
int main()
{
cin>>n>>m>>R;
for(int i=1;i<=R;i++)cin>>r[i];
for(int i=0;i<=200;i++)for(int j=0;j<=200;j++)dp[i][j]=1e9;
for(int i=0;i<=200;i++)dp[i][i]=0;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
if(dp[a][b]>c){
dp[a][b]=c;
dp[b][a]=c;
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
res=1LL<<30;
dfs(1,-1,0);
cout<<res;
}
| 0
| 34,548,025
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
int main(){
int a, b, c, d1, d2, d3;
cin>> a >> b >> c;
d1=abs(a-b);
d2=abs(a-c);
d3=abs(b-c);
cout<< min(min(d1+d2, d1+d3), d2+d3) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int K; cin >> K;
ll A[K]; rep(i, K) cin >> A[i];
ll ulim = 2, dlim = 2;
for(int i = K-1; i >= 1; i--){
ulim = (ulim - (ulim % A[i])) + A[i] - 1;
ulim -= (ulim % A[i-1]);
if(dlim % A[i-1] > 0){
dlim += (A[i-1] - dlim % A[i-1]);
}
if(ulim == 0){
cout << -1 << endl;
return 0;
}
}
ll s0 = ulim+A[0]-1;
ll s1 = dlim;
rep(i, K){
if(s0 % A[i] > 0) s0 -= s0 % A[i];
if(s1 % A[i] > 0) s1 -= s1 % A[i];
}
if(s0 == 2 && s1 == 2) cout << dlim << " " << ulim+A[0]-1 << endl;
else cout << -1 << endl;
return 0;
}
void solve(){}
| 0
| 50,101,336
|
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main(void) {
io;
int N; cin >> N;
vector<int> input(N);
long long ans = INT_MAX;
for (int i = 0; i < N; i++) cin >> input[i];
for (int i = -100; i <= 100; i++) {
long long sum(0);
for (int k = 0; k < N; k++) {
sum += (input[k]-i) * (input[k]-i);
}
ans = min(sum, ans);
}
cout << ans << "\n";
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d) \
vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll D = 0, S = 0;
ll M;
cin >> M;
vl d(M), c(M);
REP(i, M) {
cin >> d[i] >> c[i];
D += c[i];
S += d[i] * c[i];
}
cout << D - 1 + ((S - 1) / 9) << endl;
return 0;
}
| 0
| 97,664,169
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N, K; cin >> N >> K;
vector<pair<int, int>> M(N);
set<int> S;
for(int i = 0; i < N; i++) {
int A; cin >> A;
A--;
S.insert(A);
M[A].second = A;
M[A].first++;
}
sort(M.begin(), M.end());
int ans = 0;
int i = 0;
while(S.size() > K) {
if(M[i].first != 0) {
ans += M[i].first;
S.erase(M[i].second);
}
i++;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
struct Dice{
int num[6];
};
void move(struct Dice *dice, string str){
int store[6];
for(int i=0;i<str.length();i++){
for(int j=0;j<6;j++){
store[j] = (*dice).num[j];
}
switch(str[i]){
case 'N':
(*dice).num[0] = store[1];
(*dice).num[1] = store[5];
(*dice).num[5] = store[4];
(*dice).num[4] = store[0];
break;
case 'E':
(*dice).num[0] = store[3];
(*dice).num[3] = store[5];
(*dice).num[5] = store[2];
(*dice).num[2] = store[0];
break;
case 'S':
(*dice).num[0] = store[4];
(*dice).num[4] = store[5];
(*dice).num[5] = store[1];
(*dice).num[1] = store[0];
break;
case 'W':
(*dice).num[0] = store[2];
(*dice).num[2] = store[5];
(*dice).num[5] = store[3];
(*dice).num[3] = store[0];
break;
}
}
}
int main(){
struct Dice dice;
int q, front, top;
for(int i=0;i<6;i++){
cin>>dice.num[i];
}
cin>>q;
for(int i=0;i<q;i++){
cin>>top>>front;
int x;
for(int j=0;j<6;j++){
if(dice.num[j] == top) x = j;
}
switch(x){
case 0:
break;
case 1:
move(&dice, "N");
break;
case 2:
move(&dice, "W");
break;
case 3:
move(&dice, "E");
break;
case 4:
move(&dice, "S");
break;
case 5:
move(&dice, "NN");
break;
}
for(int j=1;j<5;j++){
if(dice.num[j] == front) x = j;
}
switch(x){
case 1:
x = 2;
break;
case 2:
x = 4;
break;
case 3:
x = 1;
break;
case 4:
x = 3;
break;
}
cout<<dice.num[x]<<endl;
}
return 0;
}
| 0
| 73,695,957
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<complex>
#include<deque>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define gcd(a,b) __gcd(a,b)
#define MEM(a,x) memset(a,x,sizeof(a))
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int N=1e5+5;
template<class T>inline void read(T &res)
{
char c;T flag=1;
while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}
int a[50]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
};
int main(){
int n;
cin>>n;
cout<<a[n-1]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i,n) for (ll i=(ll)n-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX6 1001001
#define MAX7 10010010
#define SENTINEL 2000000000
#define INF 1<<30
#define INFTY 1LL<<60
#define MAX_INT INT_MAX
#define Endl '\n'
#define CLR(mat) memset(mat, 0, sizeof(mat))
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
const int MOD = 1000000007;
inline ll mod_add(ll a,ll b){return (a+b)%MOD;}
inline ll mod_sub(ll a,ll b){return (a+MOD-b)%MOD;}
inline ll mod_mul(ll a,ll b){return ((a%MOD)*(b%MOD))%MOD;}
inline ll mod_pow(ll x,ll n,ll mod=(ll)MOD){ll res=1;while(n>0){
if(n&1)res=res*x%mod;
x=x*x%mod;n>>=1;}return res;}
inline ll mod_inv(ll x){return mod_pow(x,MOD-2);}
inline ll mod_div(ll a, ll b){return mod_mul(a,mod_inv(b));}
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int h,w,d;
int A[310][310];
int q;
int cost[MAX6];
int main(){
cin>>h>>w>>d;
int n=h*w;
map<int,P>m;
rep(i,h)rep(j,w){
cin>>A[i][j];
m[A[i][j]-1]=P(i,j);
}
CLR(cost);
rep(i,n){
cost[i+d]=cost[i]+abs(m[i].fi-m[i+d].fi)+abs(m[i].se-m[i+d].se);
}
cin>>q;
rep(i,q){
int l,r;cin>>l>>r;
cout<<cost[r-1]-cost[l-1]<<endl;
}
}
| 0
| 24,747,037
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
char fi[100][100];
int main(){
int a,b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(i<50)fi[i][j]='#';
else fi[i][j]='.';
}
}
a--; b--;
for(int i=0;i<50;i++){
for(int j=0;j<100;j++){
if(a==0)break;
if(i%2==0&&j%2==0){
fi[i][j]='.';
a--;
}
}
if(a==0)break;
}
for(int i=51;i<100;i++){
for(int j=0;j<100;j++){
if(b==0)break;
if(i%2==0&&j%2==0){
fi[i][j]='#';
b--;
}
}
if(b==0)break;
}
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
cout << fi[i][j];
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e15;
const int MOD = 1e9+7;
const ll LINF = 1e18;
ll n,A,B,C;
vll l;
ll ans=INF;
void rec(ll i,ll a,ll b,ll c, ll cost){
if(i==n){
if(!a||!b||!c) return;
chmin(ans,abs(A-a)+abs(B-b)+abs(C-c)+cost);
return;
}
rec(i+1,a,b,c,cost);
rec(i+1,a+l[i],b,c,a==0?cost:cost+10);
rec(i+1,a,b+l[i],c,b==0?cost:cost+10);
rec(i+1,a,b,c+l[i],c==0?cost:cost+10);
}
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
cin>>n>>A>>B>>C;
l.resize(n);
rep(i,n) cin>>l[i];
rec(0,0,0,0,0);
cout<<ans<<endl;
}
| 0
| 21,851,564
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = 1e9+7;
int32_t main()
{
int n, m;
cin >> n >> m;
vector<string> in(n);
rep(i, n)
{
cin >> in[i];
}
int dp[n][m];
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
rep(i, n)
{
rep(j, m)
{
if(in[i][j] == '#')
continue;
if(i-1 >= 0)
dp[i][j] += dp[i-1][j];
if(j-1 >= 0)
dp[i][j] += dp[i][j-1];
dp[i][j] %= mod;
}
}
cout << dp[n-1][m-1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
const int mod = 1000000007;
const ll INF = 1LL<<50;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
return a / GCD(a, b) * b;
}
int main(){
string S;
cin>>S;
bool dream=false,erase=false;
int p=0;
while(p<S.size()){
if(dream){
if((p<S.size()-4)&&(S.substr(p,5)=="erase")){
p+=5;
dream=false;
erase=true;
}
else if((p<S.size()-1)&&(S.substr(p,2)=="er")){
p+=2;
dream=false;
}
else if((p<S.size()-4)&&(S.substr(p,5)=="dream")){
p+=5;
dream=true;
}
else{
cout<<"NO"<<endl;
return 0;
}
}
else if(erase){
if(S[p]=='r'){
erase=false;
p++;
}
else if((p<S.size()-4)&&(S.substr(p,5)=="erase")){
p+=5;
erase=true;
}
else if((p<S.size()-4)&&(S.substr(p,5)=="dream")){
p+=5;
erase=false;
dream=true;
}
else{
cout<<"NO"<<endl;
return 0;
}
}
else{
if((p<S.size()-4)&&(S.substr(p,5)=="erase")){
p+=5;
erase=true;
}
else if((p<S.size()-4)&&(S.substr(p,5)=="dream")){
p+=5;
dream=true;
}
else{
cout<<"NO"<<endl;
return 0;
}
}
}
cout<<"YES"<<endl;
return 0;
}
| 0
| 98,537,102
|
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
ll ugauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return a/b; else return (a+(a>0?-1:1))/b+1; }
ll lgauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return (a+(a>0?-1:1))/b-1; else return a/b; }
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
size_t random_seed; struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
int main(void) {
ll n; cin >> n;
vll a(1ll<<n); cin >> a;
vector<P> dp(1ll<<n);
rep(i, 1ll<<n) {
dp[i] = P(-1, a[i]);
}
rep(i, n) rep(j, 1<<n) if (!(j & (1ll << i))) {
P x = dp[j];
P y = dp[j | (1ll << i)];
vll cand;
if (x.fi != -1) cand.pb(x.fi);
if (y.fi != -1) cand.pb(y.fi);
if (x.se != -1) cand.pb(x.se);
if (y.se != -1) cand.pb(y.se);
sort(all(cand));
reverse(all(cand));
dp[j | (1ll << i)] = P(cand[0], cand[1]);
}
ll ret = -1;
repi(k, 1, 1ll<<n) {
chmax(ret, dp[k].fi + dp[k].se);
cout << ret << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const int INF = 0x3f3f3f3f;
const int maxn = 1100000;
double a[maxn];
void run_case()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
sort(a + 1, a + 1 + n);
double ans = a[1];
for (int i = 2; i <= n; i++)
{
ans = (ans + a[i]) / 2;
}
cout << ans << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
run_case();
cout.flush();
return 0;
}
| 0
| 94,809,246
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define vi vector<int>
template <class t, class u>
bool chmax(t &a, u b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class t, class u>
bool chmin(t &a, u b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
signed main()
{
int n, k;
cin >> n >> k;
ll ans = 0;
int r, s, p;
cin >> r >> s >> p;
string str;
cin >> str;
rep(i, n)
{
if (i < k)
{
if (str[i] == 'r')
{
ans += p;
}
if (str[i] == 'p')
{
ans += s;
}
if (str[i] == 's')
{
ans += r;
}
}
else {
if(str[i]==str[i-k]){
str[i] = 0;
}
else {
if (str[i] == 'r')
{
ans += p;
}
if (str[i] == 'p')
{
ans += s;
}
if (str[i] == 's')
{
ans += r;
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#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 all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template < typename T > string tost( const T& n ) { ostringstream stm; stm << n; return stm.str();}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
int const INF = 1001001001;
ll H,W;
ll solve(ll H, ll W) {
ll res;
if(H % 3 == 0) res = 0;
else res = W;
rrep(h,H) {
vl S(3);
S[0] = h * W;
S[1] = (H - h) * (W/2);
S[2] = (H - h) * (W - (W/2));
sort(all(S));
chmin(res, S[2]-S[0]);
}
return res;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W;
ll ans = min(solve(H, W), solve(W, H));
cout << ans << endl;
return 0;
}
| 0
| 43,527,169
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int lmax = *max_element(L.begin(), L.end());
int rmin = *min_element(R.begin(), R.end());
int d = rmin - lmax + 1;
if (d < 0)
d = 0;
cout << d << endl;
return 0;
}
|
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
int n, m, v, p;
vint a;
bool check(int i) {
int x = a[i] + m;
if (x < a[p-1]) return false;
ll y = (ll)(v-((p-1)+(n-i-1)+1))*m;
if (y <= 0) return true;
for (int j = p-1; j <= i-1; j++) {
y -= x - a[j];
}
if (y <= 0) return true;
else return false;
}
int main() {
cin >> n >> m >> v >> p;
a.assign(n+1,-inf);
rep(i,n) cin >> a[i];
sort(rall(a));
int l = 0, r = n;
while (r-l > 1) {
int mid = (r+l)/2;
if (check(mid)) l = mid;
else r = mid;
}
cout << l+1 << endl;
}
| 0
| 63,908,206
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void b_abc111(void) {
int n;
cin >> n;
int sho = n / 111;
int amari = n % 111;
if(amari!=0){
sho++;
}
cout << 111 * sho << endl;
}
int main()
{
b_abc111();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
vector<int> N(4);
REP(i,4)cin >> N[i];
sort(ALL(N));
int A = N[0]*1000 + N[1] + N[2]*10+N[3]*100;
cout << (A == 1974?"YES":"NO") << "\n";
}
| 0
| 21,083,986
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(void) {
int a[3];
int aMax = 0;
for (int i = 0; i < 3; i++) {
scanf("%d", &a[i]);
aMax = max(aMax, a[i]);
}
int diffSum = 0;
for (int i = 0; i < 3; i++) {
diffSum += aMax - a[i];
}
if (diffSum % 2 == 0) printf("%d\n", diffSum / 2);
else printf("%d\n", diffSum / 2 + 2);
return 0;
}
|
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
using namespace std;
string addDigit(string s){
while(s.size() < 6){
s = "0"+s;
}
return s;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
vector<pair<int,int>> inp;
map<int,vector<int>> mp;
for(int i = 0; i < m; ++i){
int p,y;
cin >> p >> y;
inp.push_back(make_pair(p,y));
mp[p].push_back(y);
}
map<pair<int,int>, string> mp2;
for(auto it = mp.begin(); it != mp.end(); ++it){
vector<int> vec = it->second;
sort(vec.begin(),vec.end());
string s = addDigit(to_string(it->first));
for(int i = 0; i < vec.size(); ++i){
string t = addDigit(to_string(i+1));
mp2[make_pair(it->first,vec[i])] = s+t;
}
}
for(pair<int,int> p:inp){
cout << mp2[p] << endl;
}
return 0;
}
| 0
| 54,444,325
|
#include<iostream>
using namespace std;
int main(){
int n;
int n1,n2,st;
n1=1;
n2=1;
st=1;
cin >>n;
for(int i=1;i<n;i++){
st=n1+n2;
n1=n2;
n2=st;
}
cout <<st<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<ll>>;
using Graph = vector<vector<ll>>;
using VI = vector<int>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VC = vector<char>;
using PI = pair<int, int>;
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF = 1LL<<60;
const int mod = 1000000007;
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 H, N;
vector<int> A, B;
vector<vector<ll>> dp(1010, vector<ll>(10010, INF));
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> H >> N;
A.resize(N); B.resize(N);
REP(i, N) {
cin >> A[i] >> B[i];
}
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= H; j++) {
chmin(dp[i + 1][j], dp[i][j]);
if (j + A[i] >= H) {
chmin(dp[i + 1][H], dp[i + 1][j] + B[i]);
} else {
chmin(dp[i + 1][j + A[i]], dp[i + 1][j] + B[i]);
}
}
}
cout << dp[N][H] << endl;
return 0;
}
| 0
| 75,667,332
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector <int> a(n);
map <int, int> cnt;
for (int i = 0; i < n; i++) {
cin >> a[i];
++cnt[a[i]];
}
ll ans = 0;
for (auto &i : cnt) {
ans += (ll)i.y * (i.y - 1ll) / 2ll;
}
for (int i = 0; i < n; i++) {
ans -= (ll)cnt[a[i]] * (cnt[a[i]] - 1ll) / 2ll;
ans += (ll)(cnt[a[i]] - 1ll) * (cnt[a[i]] - 2ll) / 2ll;
cout << ans << '\n';
ans += (ll)cnt[a[i]] * (cnt[a[i]] - 1ll) / 2ll;
ans -= (ll)(cnt[a[i]] - 1ll) * (cnt[a[i]] - 2ll) / 2ll;
}
}
|
#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);
int n,k;
cin>>n>>k;
vin l(n);
rep(i,0,n)cin>>l[i];
sort(all(l));reverse(all(l));
int ans=0;
rep(i,0,k){
ans+=l[i];
}
cout<<ans<<endl;
}
| 0
| 64,542,794
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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; }
i64 n, a[101010], m;
i64 d[101010];
void solve(){
cin >> n >> m;
for(int i = 0; i < n; i++){
cin >> a[i];
d[i+1] = d[i]+a[i];
}
bool ok = 0;
for(int i = 2; i <= n; i++){
if(d[i]-d[i-2] >= m){
ok = 1;
cout << "Possible" << endl;
for(int j = 1; j < i-1; j++){
cout << j << endl;
}
for(int j = n-1; j >= i; j--){
cout << j << endl;
}
cout << i-1 << endl;
break;
}
}
if(!ok){
cout << "Impossible" << endl;
}
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
while(t--){
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max()/4;
const int n_max = 1e5+10;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << ' ';
}
cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
}
template<class T, class U>
void print(pair<T,U> &p){
print(p.first, p.second);
}
int main(){
ll n; cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
auto f = [&](vector<ll> &a){
ll sum = 0;
rep(i,n)sum += a[i] / n;
ll c;
rep(i,n){
c = a[i] / n;
a[i] -= c * n;
a[i] += sum - c;
}
ans += sum;
return sum != 0;
};
ll cnt = 0;
while(f(a)){cnt++;};
debug(cnt);
cout << ans << endl;
}
| 0
| 27,432,386
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
char c=s[0];
int ans=1;
for(int i=1;i<4;++i){
if(s[i]==c) ++ans;
else{
c=s[i];
ans=1;
}
if(ans==3){
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
vector<string> res;
vector<int> rei;
string maxstr;
string inp;
while(cin>>inp){
if(maxstr.size() < inp.size()){
maxstr = inp;
}
bool used = true;
for(int i = 0 ; i < res.size() ; i ++){
if(res[i] == inp){
rei[i]++;
used = false;
}
}
if(used){
res.push_back(inp);
rei.push_back(1);
}
}
string sizee = "";
int maxw = 0;
for(int i = 0 ; i < res.size() ; i ++){
if(maxw < rei[i]){
sizee = res[i];
maxw = rei[i];
}
}
cout<<sizee<<" "<<maxstr<<endl;
}
| 0
| 21,480,007
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[3];
cin>>s[0]>>s[1]>>s[2];
if(s[0]=='R' && s[1]=='R' &&s[2]=='R')
cout<<"3";
else if(s[0]=='R' && s[1]=='S')
cout<<"1";
else if((s[0]=='S' && s[1]=='R' && s[2]=='R')||(s[0]=='R' && s[1]=='R' && s[2]=='S'))
cout<<"2";
else if(s[0]=='S' && s[1]=='S' &&s[2]=='S')
cout<<"0";
else cout<<"1";
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <list>
#include <ctime>
#include <complex>
#include <bitset>
#include <tuple>
#include <functional>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 1000000007LL
#define rep(i,a,n) for (int i=a ; i<n ; i++)
#define per(i,a,n) for (int i=n-1 ; i>=a ; i--)
#define LLINF 100000000000000005LL
#define INF (int)1e9+1
#define endl '\n'
#define pb push_back
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string)s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
using llong = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<long long>;
using PII = pair<int, int>;
int n;
vector<vector<int>> f;
vector<vector<llong>> dp;
llong dfs(int node, int color, int prnt) {
llong& ret = dp[node][color];
if (ret != -1) return ret;
ret = 1;
rep(i, 0, f[node].size()) {
if (color == 0 && f[node][i] != prnt) {
ret *= (dfs(f[node][i], 0, node) + dfs(f[node][i], 1, node));
ret %= MOD;
}
if (color == 1 && f[node][i] != prnt) {
ret *= dfs(f[node][i], 0, node);
ret %= MOD;
}
}
return ret;
}
int main() {
IOS;
cin >> n;
f = vector<vector<int>>(n);
dp = vector<vector<llong>>(n, vector<llong>(2, -1));
rep(i, 0, n-1) {
int x, y;
cin >> x >> y;
x--; y--;
f[x].push_back(y);
f[y].push_back(x);
}
int ans1 = dfs(0, 0, -1);
int ans2 = dfs(0, 1, -1);
cout << (ans1 + ans2) % MOD;
return 0;
}
| 0
| 52,714,956
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,s1,s2,s3;
cin>>a>>b>>c>>d;
s1=abs(a-b);
s2=abs(a-c);
s3=abs(b-c);
if(s2<=d){
cout<<"Yes";
}
else{
if(s1<=d && s3<=d){
cout<<"Yes";
}
else{
cout<<"No";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool valid(int lx,int ux,int ly,int uy,int x,int y){
return lx<=x&&x<ux&&ly<=y&&y<uy;
}
ll power(ll x,ll p){
if(p==0)return 1;
ll res=power(x*x%mod,p/2);
if(p%2==1)res=res*x%mod;
return res;
}
int main()
{
int k;
cin>>k;
queue<ll> que;
rep(i,9)que.push(i+1);
rep(i,k-1){
ll cur = que.front();que.pop();
ll tmp = cur%10;
repi(i,tmp-1,tmp+2){
if(i<0 || i>=10)continue;
que.push(cur*10+(ll)i);
}
}
cout<<que.front()<<endl;
return 0;
}
| 0
| 18,467,766
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<bool> x(pow(10, 5));
int c = 0;
for(int i = 0; i < N; i++) {
int a;
cin >> a;
a--;
if(x[a]) c++;
else x[a] = true;
}
if(c % 2) c++;
cout << N - c << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename KeyType, typename ValueType>
std::pair<KeyType,ValueType> get_max( const std::map<KeyType,ValueType>& x ) {
using pairtype=std::pair<KeyType,ValueType>;
return *std::max_element(x.begin(), x.end(), [] (const pairtype & p1, const pairtype & p2) {
return p1.second < p2.second;
});
}
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
int main() {
int n;
cin >> n;
vector<int> dn(n);
rep(i, n) cin >> dn[i];
int cnt = 0;
sort(dn.begin(), dn.end());
for (int i = 1; i <= 1e5; i++) {
auto iter_upper = upper_bound(dn.begin(), dn.end(), i);
if (iter_upper == dn.end()) break;
if (iter_upper - dn.begin() == dn.end() - iter_upper) ++cnt;
}
cout << cnt << endl;
return 0;
}
| 0
| 6,334,656
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {
int N;
cin>>N;
int zero;
cin>>zero;
if(zero!=0){cout<<0<<endl;return 0;}
vector<int> D(N-1);
rep(i,N-1){cin>>D.at(i);}
sort(D.begin(),D.end());
int num=1,before=1,now=0;
ll ans=1;
rep(i,N-1){
if(D.at(i)==num){
now++;
ans*=before;
ans%=MOD2;
}
else{
num++;
before=now;
ans*=before;
ans%=MOD2;
now=0;
if(D.at(i)==num){
now++;
}
else{cout<<0<<endl;return 0;}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
const int INF = 1001001001;
using P = pair<ll, ll>;
int main(void){
ll H, W, M;
cin >> H >> W >> M;
vector<ll> h(M), w(M);
map<P, ll> mp;
REP(i, M){
cin >> h[i] >> w[i];
h[i]--; w[i]--;
mp[P(h[i], w[i])]++;
}
vector<ll> a(H, 0), b(W, 0);
REP(i, M) a[h[i]]++, b[w[i]]++;
ll c = *max_element(ALL(a));
ll d = *max_element(ALL(b));
vector<ll> p, q;
REP(i, H) if(a[i] == c) p.emplace_back(i);
REP(i, W) if(b[i] == d) q.emplace_back(i);
ll n = p.size(), m = q.size();
ll ans = c+d-1;
REP(i, n) REP(j, m){
if(mp[P(p[i], q[j])] == 0){
ans = c+d;
break;
}
}
cout << ans << endl;
return 0;
}
| 0
| 94,693,455
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=998244353;
const int MAX=1e5+10;
const ll INF=1e18;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,n) {
cin >> a[i];
b[i]=a[i];
}
sort(b.begin(),b.end(),greater<>());
rep(i,n) {
if (a[i]==b[0]) cout << b[1] << endl;
else cout << b[0] << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n, u, k, v;
vector< vector< int > > list;
vector< int > dist;
queue< int > que;
cin >> n;
list.resize(n);
dist.resize(n);
for(int i=0;i<n;++i){
cin >> u >> k;
dist[i] = -1;
for(int j=0;j<k;++j){
cin >> v;
list[u-1].push_back(v-1);
}
}
que.push(0);
dist[0] = 0;
while(!que.empty()){
int cur = que.front();
vector< int > branch = list[cur];
que.pop();
for(vector< int >::iterator it=branch.begin();it<branch.end();++it){
if(dist[*it] == -1){
que.push(*it);
dist[*it] = dist[cur] + 1;
}
}
}
for(int i=0;i<n;++i){
cout << i+1 << " " << dist[i] << endl;
}
return 0;
}
| 0
| 35,781,562
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<int> cnt(100005, 0);
for (int i = 0; i < N; i++) {
int a; cin >> a;
cnt[a+1]++;
}
int mx = 0;
for (int i = 1; i <= 100001; i++) {
mx = max(mx, cnt[i-1] + cnt[i] + cnt[i+1]);
}
cout << mx << '\n';
}
|
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
lll ii,jj,kk,ll,mm;
vector<int> ret;
int h,w,k;
cin >> h >> w >> k;
int matrix[h][w];
int tmpm[h][w];
string tmp;
for(ii=0;ii<h;ii++){
cin >> tmp;
for(jj=0;jj<w;jj++){
if(tmp[jj] == '.'){
matrix[ii][jj] = 0;
}
else{
matrix[ii][jj] = 1;
}
}
}
int selecth[h],selectw[w];
int sum = 0;
for(ii=0;ii<pow(2,h);ii++){
for(jj=0;jj<pow(2,w);jj++){
memcpy(tmpm,matrix,sizeof(tmpm));
for(ll=0;ll<h;ll++){
if( (( ii >> ll ) & 1) == 1){
selecth[ll] = 1;
}
else{
selecth[ll] = 0;
}
}
for(ll=0;ll<w;ll++){
if( (( jj >> ll ) & 1) == 1){
selectw[ll] = 1;
}
else{
selectw[ll] = 0;
}
}
for(ll=0;ll<h;ll++){
if(selecth[ll] == 1){
for(mm=0;mm<w;mm++){
tmpm[ll][mm] = 0;
}
}
}
for(ll=0;ll<w;ll++){
if(selectw[ll] == 1){
for(mm=0;mm<h;mm++){
tmpm[mm][ll] = 0;
}
}
}
int cnt = 0;
for(ll=0;ll<h;ll++){
for(mm=0;mm<w;mm++){
if(tmpm[ll][mm] == 1){
cnt ++;
}
}
}
if(cnt == k){
sum++;
}
}
}
cout << sum;
return 0;
}
| 0
| 82,677,392
|
#include <iostream>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int ans = 0;
for (int i = 0; i < 1000; i++) {
int dig[3] = {i/100, i/10%10, i%10};
int flag = 0;
for (int j = 0; j < N; j++) {
if (dig[flag] + '0' == s[j]) flag++;
if (flag == 3) break;
}
if (flag == 3) ans++;
}
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int num[5]={0},i;
for(i=0;i<5;i++){
cin>>num[i];
}
sort(num,num+5);
for(i=0;i<5;i++){
cout<<num[4-i];
if(i!=4){
cout<<' ';
}
}
cout<<endl;
return 0;
}
| 0
| 13,958,675
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
int main(void){
int n,i;
ll a,p=1ll,ans=0ll;
cin >> n;
for(i=0; i<n; ++i){
cin >> a;
ans += (a-1)/p;
if((a-1)/p){
a = 1ll;
}
if(a==p){
++p;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define ALL(obj) (obj).begin(),(obj).end()
#define pii pair<int32,int32>
#define pll pair<int64,int64>
#define pb(a) push_back(a)
#define mp make_pair
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int32 k;
cin >> k;
vector<int32> a(k);
REP(i,k)cin >> a[i];
if(a[k-1] != 2){
cout << -1 << endl;
return 0;
}
int32 mn = 2;
FORR(i,k-2,0){
int32 k = (mn - 1) / a[i] + 1;
mn = a[i] * k;
}
int32 mx = 3;
FORR(i,k-2,0){
int32 k = mx / a[i] + 1;
mx = a[i] * k - 1;
}
if(mn > mx){
cout << -1 << endl;
}else{
cout << mn << " " << mx << endl;
}
return 0;
}
| 0
| 25,631,953
|
#include <iostream>
#include <list>
#include <stack>
using namespace std;
int main() {
list<int> stat;
for (int i = 0, in; cin >> in; i++, stat.push_back(in));
stack<int> stacK;
for (list<int>::iterator it = stat.begin(); it != stat.end(); it++, it = stat.begin()) {
if (*it == 0) {
cout << stacK.top() << endl;
stacK.pop();
} else
stacK.push(*it);
stat.pop_front();
}
}
|
#include<iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
while (n != 0 || x != 0) {
if (x < 6 || x > 3 * n - 3) {
cout << 0 << endl;
cin >> n >> x;
continue;
}
int a, b, c;
a = x / 3;
b = (x - a) / 2;
c = x - (a + b);
while (c < n) {
if (a == 1) {
if (b == 2) {
break;
}
b--;
} else {
a--;
}
c++;
}
while (a > 1 && b < n - 1) {
a--;
b++;
}
int cnt = 0;
while (a <= n - 2) {
cnt += (c + 1 - b) / 2;
a++;
b--;
while (b <= a) {
b++;
c--;
}
if (b >= c) {
break;
}
}
cout << cnt << endl;
cin >> n >> x;
}
return 0;
}
| 0
| 81,274,068
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define reps(i,s,n) for(int i=s, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
const char sp = ' ';
using namespace std;
int main(void){
string A;
cin>>A;
ll co[26];
MEMSET(co, 0);
ll ans=1;
rep(i, A.size()){
ans+=i-co[A[i]-'a'];
co[A[i]-'a']++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
rep(i,m) {
cin >> p[i] >> y[i];
p[i]--;
}
vector<vector<int>> vals(n);
rep(i,m) vals[p[i]].push_back(y[i]);
rep(i,n) sort(all(vals[i]));
rep(i,m){
int v = p[i];
printf("%06d", v+1);
int id = lower_bound(vals[v].begin(), vals[v].end(), y[i])- vals[v].begin();
printf("%06d\n", id+1);
}
}
| 0
| 60,837,575
|
#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>
#include <numeric>
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);
int n;
string s;
cin >> n >> s;
int ans = 0;
rep (num, 1000)
{
string t = to_string(num);
int m = t.size();
t = string(3 - m, '0') + t;
int idx = 0;
rep (i, n)
{
if (idx < 3 && s[i] == t[idx]) ++idx;
}
if (idx == 3) ++ans;
}
cout << ans << "\n";
return 0;
}
|
#include "iostream"
#include "algorithm"
using namespace std;
int main()
{
int n, *a,l;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << a[n - 1] << ' ';
for (int i = 0; true; i++) {
if (a[n - 1] / 2 < a[i]) {
l = i;
break;
}
}
if (l == n - 1)cout << a[l - 1] << endl;
else if (a[n - 1] / 2 - a[l - 1] < a[l] - a[n - 1] / 2)cout << a[l-1] << endl;
else cout << a[l] << endl;
return 0;
}
| 0
| 11,867,133
|
#include <cstdio>
#include <cctype>
#include <vector>
#include <iostream>
#include <algorithm>
#define MAXN (100000 + 5)
int n, c, k;
int t[MAXN * 2];
int ans;
int main()
{
scanf("%d%d%d", &n, &c, &k);
for (int i = 0; i < n; ++i)
{
scanf("%d", &t[i]);
}
std::sort(t, t + n);
for (int i = 0, j = 0; i < n; i = j)
{
for (; j < i + c && t[j] <= t[i] + k; ++j);
++ans;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto up = upper_bound(arr.begin(),
arr.end(), p);
return up - arr.begin();
}
bool vis[200005];
vector<int> vec[2000005];
int child[2000005];
int parent[2000005];
int div1[100005];
void dfs(int node)
{
vis[node] = 1;
for (int i = 0; i < vec[node].size(); i++)
{
if (!vis[vec[node][i]])
{
parent[vec[node][i]] = node;
dfs(vec[node][i]);
}
}
}
void bfs(int node)
{
queue<int> qu;
qu.push(node);
vis[1] = 1;
while (!qu.empty())
{
int top = qu.front();
qu.pop();
vis[top] = 1;
for (int i = 0; i < vec[top].size(); i++)
{
if (!vis[vec[top][i]])
{
parent[vec[top][i]] = top;
qu.push(vec[top][i]);
vis[vec[top][i]] = 1;
}
}
}
}
void belman(int n, int m, vector<pair<int, pair<int, int>>> vec, int dis[])
{
for (int i = 0; i <= n + m - 1; i++)
{
for (int j = 0; j < vec.size(); j++)
{
int u = vec[j].second.first;
int v = vec[j].second.second;
int w = vec[j].first;
if (dis[u] + w < dis[v])
{
dis[v] = dis[u] + w;
}
}
}
}
int fun(int a, int b)
{
if (a > b)
return 0;
if (a == b)
return 1;
else
{
return fun(a + 1, b) + fun(a, b - a);
}
}
int32_t main()
{
int n;
cin >> n;
vector<int> vec;
int ans = 0;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
if (temp > n)
{
ans++;
}
else
{
vec.push_back(temp);
}
}
map<int, int> mp;
for (auto itr : vec)
mp[itr]++;
for (auto itr : mp)
{
if (itr.first > itr.second)
{
ans += (itr.second);
}
else
{
ans += (itr.second - itr.first);
}
}
cout << ans << "\n";
return 0;
}
| 0
| 50,275,534
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,m;
cin >> n >> m;
vector<int> a(m),b(m),c(m);
rep(i,m) cin >> a[i] >> b[i] >> c[i], --a[i], --b[i];
vector<vector<int>> d(n,vector<int>(n,1e9));
rep(i,n) d[i][i] = 0;
rep(i,m) d[a[i]][b[i]] = d[b[i]][a[i]] = c[i];
rep(k,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
int ans = 0;
rep(i,m) if(d[a[i]][b[i]]<c[i]) ++ans;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long lcm(long long a,long long b){
return a*b/__gcd(a,b);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long n,m;
cin>>n>>m;
vector<long long> v(n);
long long lc=1ll;
for(int i=0;i<n;i++){
long long tm;
cin>>tm;
tm/=2ll;
lc=lcm(lc,tm);
v[i]=2ll*tm;
}
int f1=0,f2=0;
for(int i=0;i<n;i++){
if((lc)%v[i]==0ll){
f1=f2=1;
}
}
if(f1&&f2)
cout<<0;
else
cout<<(m/lc)/2ll+((m/lc)%2ll)<<'\n';
return 0;
}
| 0
| 3,059,543
|
#include <iostream>
using namespace std;
int main (int argc, char* argv[])
{
int a, b;
cin >> a >> b;
if (a < -1000) return 0;
if (1000 < b) return 0;
if (a < b) cout << "a < b" << endl;
else if (a > b) cout << "a > b" << endl;
else cout << "a == b" << endl;
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define i_7 1000000007
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000
int main(){
ll k;cin>>k;
ll p=k/50,q=k%50;
ll a[50];for(int i=0;i<=49;i++)a[i]=p+49;
while(q--){
ll min=a[0],minx=0;
for(int i=1;i<=49;i++)if(min>a[i]){min=a[i];minx=i;}
for(int i=0;i<=49;i++){
if(i==minx)a[i]+=50;
else a[i]--;
}
}cout<<50<<endl;
for(int i=0;i<=49;i++)cout<<a[i]<<" ";
return 0;
}
| 0
| 54,800,699
|
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl
#define coYES cout << "YES" << endl
#define coyes cout << "yes" << endl
#define coNo cout << "No" << endl
#define coNO cout << "NO" << endl
#define cono cout << "no" << endl
#define BIT_FLAG_0 (1<<0)
int gcd(int a, int b){
if(a%b == 0){
return b;
}else{
return gcd(b, a%b);
}
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll digit_sum(ll a){
ll ans=0;
while(a>0){
ans+=a%10;
a/=10;
}
return ans;
}
int main(){
string s;
cin >> s;
string a = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < 26; i++) {
for (int j = 0, l = s.length(); j < l; j++) {
if (s[j] == a[i]) {
break;
}
if (j == l - 1 && s[j] != a[i]) {
cout << a[i] << endl;
return 0;
}
}
}
cout << "None" << endl;
return 0;
}
|
#include<iostream>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
ll H, W;
cin >> H >> W;
ll ans=1000000000000, mins, maxs;
ll tmp, tmp1, tmp2, tmp3;
if(H%3==0 || W%3==0){
ans = 0;
}
for(ll i=1; i<H; i++){
tmp=W/2;
tmp1=i*W;
tmp2=(H-i)*tmp;
tmp3=(H-i)*(W-tmp);
maxs = max(tmp1,max(tmp2,tmp3));
mins = min(tmp1,min(tmp2,tmp3));
tmp=maxs-mins;
if(tmp<ans){
ans=tmp;
}
tmp=(H-i)/2;
tmp1=i*W;
tmp2=tmp*W;
tmp3=(H-i-tmp)*W;
maxs = max(tmp1,max(tmp2,tmp3));
mins = min(tmp1,min(tmp2,tmp3));
tmp=maxs-mins;
if(tmp<ans){
ans=tmp;
}
}
for(ll i=1; i<W; i++){
tmp=H/2;
tmp1=i*H;
tmp2=(W-i)*tmp;
tmp3=(W-i)*(H-tmp);
maxs = max(tmp1,max(tmp2,tmp3));
mins = min(tmp1,min(tmp2,tmp3));
tmp=maxs-mins;
if(tmp<ans){
ans=tmp;
}
tmp=(W-i)/2;
tmp1=i*H;
tmp2=tmp*H;
tmp3=(W-i-tmp)*H;
maxs = max(tmp1,max(tmp2,tmp3));
mins = min(tmp1,min(tmp2,tmp3));
tmp=maxs-mins;
if(tmp<ans){
ans=tmp;
}
}
cout << ans << endl;
return 0;
}
| 0
| 96,320,586
|
#include <iostream>
using namespace std;
int selectionSort(int *a, int n) {
int counter = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (a[j] < a[minj]) minj = j;
}
if (a[i] > a[minj]) {
swap(a[i], a[minj]);
counter++;
}
}
return counter;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int counter;
counter = selectionSort(a, n);
for (int i = 0; i < n; i++) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
cout << counter << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
const int NULLNodeKey = 2000000001;
const int heap_offset = 1;
int get_left(vector<int> binary_heap, int index) {
int left_child_index = 2 * index;
if(left_child_index > binary_heap.size() - heap_offset) {
return NULLNodeKey;
}
return binary_heap[left_child_index];
}
int get_right(vector<int> binary_heap, int index) {
int right_child_index = 2 * index + 1;
if(right_child_index > binary_heap.size() - heap_offset) {
return NULLNodeKey;
}
return binary_heap[right_child_index];
}
int get_parent(vector<int> binary_heap, int index) {
int parent_index = (index % 2 == 0 ? index : index - 1) / 2;
if(parent_index < 1) {
return NULLNodeKey;
}
return binary_heap[parent_index];
}
int main() {
int heap_size;
vector<int> binary_heap;
cin >> heap_size;
binary_heap.resize(heap_size + 1);
for(int i = 1; i <= heap_size; i++ ) {
cin >> binary_heap[i];
}
for(int i = 1; i <= heap_size; i++ ) {
cout << "node " << i << ": ";
cout << "key = " << binary_heap[i] << ", ";
int parent = get_parent(binary_heap, i);
if(parent != NULLNodeKey) {
cout << "parent key = " << parent << ", ";
}
int left = get_left(binary_heap, i);
if(left != NULLNodeKey) {
cout << "left key = " << left << ", ";
}
int right = get_right(binary_heap, i);
if(right != NULLNodeKey) {
cout << "right key = " << right << ", ";
}
cout << endl;
}
}
| 0
| 10,555,588
|
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int64_t a){if(a<=1)return false;for(int64_t i=2;(int64_t)i*i<=a;i++){if(a%i==0)return false;}return true;}
int get_adp(double x, int n){return (int)round((x-(int)x)*pow(10,n))%10;}
int64_t sigma(int64_t s, int64_t n){return n*(2*s+n-1)/2;}
int main()
{
int64_t ans = 0;
int n, temp, r = 0, g = 0, b = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
{
if (s[i] == 'R')
r++;
else if (s[i] == 'G')
g++;
else
b++;
}
ans = (int64_t)r * g * b;
for (int i = 1; i <= n / 2; i++)
{
for (int j = i; j < n - i; j++)
{
if (s[j] != s[j - i] && s[j] != s[j + i] && s[j - i] != s[j + i])
ans--;
}
}
ans = (ans < 0 ? 0 : ans);
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define INF 922337203685477580
typedef long long ll;
ll dp[110][110];
ll matrix[110][2];
int main() {
int N;
cin >> N;
REP(i, N) {
cin >> matrix[i][0] >> matrix[i][1];
}
for (int i = 0; i < N; i++) {
dp[i][i] = 0;
}
for (int l = 2; l <= N; l++) {
for (int i = 0; i < N - l + 1; i++) {
int j = i + l - 1;
dp[i][j] = INF;
for (int k = i; k < j; k++) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + matrix[i][0] * matrix[k][1] * matrix[j][1]);
}
}
}
cout << dp[0][N - 1] << endl;
return 0;
}
| 0
| 22,906,292
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
inline void io()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
}
int main()
{
io();
int n;
cin >> n;
int mx = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
{
int h;
cin >> h;
ans += (h >= mx);
mx = max(mx, h);
}
cout << ans;
return 0;
}
|
#pragma GCC optimize("Ofast")
#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
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
signed main()
{
string s;
cin >> s;
int n = s.size();
for (int i = 1; i < n; i++)
{
string S = s.substr(0, n - i);
int N = S.size();
if (N % 2 == 0)
{
if (S.substr(0, S.size() / 2) == S.substr(S.size() / 2, S.size() / 2))
{
cout << S.size() << endl;
return 0;
}
}
}
return 0;
}
| 0
| 98,212,237
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string S;
cin >> S;
int cnt = 0;
for(int i = 0; i < S.size() - 1; ++i) {
if (S[i]!=S[i+1]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isOK(int ma, int n) {
for (int i = ma; i >= 1; --i) {
if (n >= i) {
n -= i;
}
}
return n == 0;
}
int main() {
int n;
cin >> n;
int left = 0, right = n;
int ma = n;
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, n)) {
right = mid;
ma = mid;
} else
left = mid;
}
for (int i = ma; i >= 1; --i) {
if (n >= i) {
n -= i;
cout << i << endl;
}
}
}
| 0
| 19,419,417
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
using Graph = vector<vector<int>>;
int main() {
int A,P;
cin >> A >> P;
cout << (A*3+P)/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define each(a,b) for(auto& (a): (b))
#define pct __builtin_popcountll
#define all(a) a.begin(),a.end()
#define sz(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define rev(v) reverse((v).begin(),(v).end());
#define so(v) sort((v).begin(), (v).end());
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vp = vector<P>;
using vt = vector<T>;
using vs = vector<string>;
int main() {
string a;
cin >> a;
int ct=0;
int b = sz(a);
rep(i,b) {
if (a.at(i) == 'x') {
ct++;
}
}
if (ct < 8) {
cout<<"YES"<<endl;
}
else {
cout << "NO" << endl;
}
return 0;
}
| 0
| 20,232,678
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
#define MAX_N 55
ll C[MAX_N][MAX_N];
void make() {
rep(i, MAX_N) {
C[i][1] = i;
C[i][i] = 1;
C[0][i] = 1;
C[i][0] = 1;
}
REP(i, 1, MAX_N) rep(j, i) {
if(i-1 < 0 || j-1 < 0) continue;
C[i][j] = C[i-1][j] + C[i-1][j-1];
}
}
ll comb(ll n, ll r) {
if(n < 0) return 0;
else if(n < r) return 0;
else return C[n][r];
}
int main() {
make();
int N, P;
cin >> N >> P;
vector<int> A(N);
vector<int> cnt(2);
rep(i, N) {
cin >> A[i];
cnt[A[i]%2]++;
}
ll odd = 0, even = 0;
for(int i=P; i<=cnt[1]; i+=2) odd += comb(cnt[1], i);
rep(i, cnt[0]+1) even += comb(cnt[0], i);
cout << odd * even << endl;
return 0;
}
|
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
#include <utility>
#include <tuple>
#define INF 1000000000000
const long long MOD = 998244353;
using namespace std;
typedef long long llong;
#define debug cout << "Hello" << endl;
void dfs(llong prev_node, llong node, map<llong, llong> &Table, vector<llong> &ans, vector<vector<llong> > &graph){
ans[node] += ans[prev_node];
ans[node] += Table[node];
for(int i=0; i<graph[node].size(); i++){
dfs(node, graph[node][i], Table, ans, graph);
}
return;
}
int main(){
llong N,Q;
cin >> N >> Q;
llong a,b;
vector<vector<llong> > graph(N);
vector<vector<llong> > directed_graph(N);
vector<llong> ans(N, 0);
map<llong, llong> Table;
llong p,x;
queue<llong> Queue;
vector<bool> visited(N, false);
llong node;
for(int i=0; i<N-1; i++){
cin >> a >> b;
graph[a-1].push_back(b-1);
graph[b-1].push_back(a-1);
}
for(int i=0; i<Q; i++){
cin >> p >> x;
Table[p-1] += x;
}
ans[0] += Table[0];
Queue.push(0);
while(!Queue.empty()){
node = Queue.front();
Queue.pop();
visited[node] = true;
for(int i=0; i<graph[node].size(); i++){
if(visited[graph[node][i]]){
continue;
}
Queue.push(graph[node][i]);
directed_graph[node].push_back(graph[node][i]);
}
}
for(int i=0; i<directed_graph[0].size(); i++){
dfs(0, graph[0][i], Table, ans, directed_graph);
}
for(int i=0; i<ans.size()-1; i++){
cout << ans[i] << " ";
}
cout << ans[ans.size()-1] << endl;
return 0;
}
| 0
| 28,857,126
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<int> S(N);
for (int i = 0; i < N; i++){
cin >> S[i];
}
vector<int> T(M);
for (int i = 0; i < M; i++){
cin >> T[i];
}
vector<vector<long long>> dp(N + 1, vector<long long>(M + 1, 0));
for (int i = 0; i < N; i++){
for (int j = 0; j < M; j++){
dp[i + 1][j + 1] += dp[i + 1][j];
dp[i + 1][j + 1] += dp[i][j + 1];
if (S[i] == T[j]){
dp[i + 1][j + 1] ++;
} else {
dp[i + 1][j + 1] += MOD - dp[i][j];
}
dp[i + 1][j + 1] %= MOD;
}
}
cout << (dp[N][M] + 1) % MOD << endl;
}
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll nCr(int n, int r){
ll num = 1;
for(int i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
int main(){
int N;
cin >> N;
vector<ll> A(N+1), B(N);
for(int i = 0; i < N+1; i++) cin >> A[i];
for(int i = 0; i < N; i++) cin >> B[i];
ll sum = 0;
for(int i = 0; i < N; i++){
if(B[i] > A[i]){
sum += A[i] + min(B[i] - A[i], A[i+1]);
A[i + 1] = max(A[i + 1] - (B[i] - A[i]), ll(0));
}else sum+= B[i];
}
cout << sum << endl;
}
| 0
| 87,684,961
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define all(x) begin(x), end(x)
#define x first
#define y second
typedef long long ll;
typedef long double ld;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using normal_queue = priority_queue<T, vector<T>, greater<T>>;
const int MAX_N = 2e5 + 10;
int a[MAX_N];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
bool oneflag = 1;
for (int i = 1; i < n; ++i) {
if (a[i - 1] >= a[i]) {
oneflag = 0;
}
}
if (oneflag)
return cout << "1\n", 0;
int l = 1, r = n;
while (r - l > 1) {
int mid = (l + r) / 2;
bool flag = 1;
vector<pair<int, int>> current;
for (int i = 1; i < n; ++i) {
if (a[i - 1] < a[i])
continue;
while (current.size() && current.back().x >= a[i])
current.pop_back();
int cnt = a[i] - 1;
while (current.size() && current.back().x == cnt && current.back().y == mid - 1) {
current.pop_back();
--cnt;
}
if (cnt == -1) {
flag = 0;
break;
}
if (current.size() && current.back().x == cnt) {
++current.back().y;
} else {
current.push_back({cnt, 1});
}
}
if (flag)
r = mid;
else
l = mid;
}
cout << r << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
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 INF = 1LL << 60;
int main() {
ll N,M;
cin >> N >> M ;
ll s[10][10];
ll k[10];
ll p[10];
rep(i,M){
cin >> k[i];
rep(j,k[i]){
cin >> s[i][j];
}
}
rep(i,M){
cin >> p[i];
}
int ans=0;
for(int bit=0;bit<(1<<N);bit++){
int res=0;
for(int i=0;i<M;i++){
int cnt=0;
for(int j=0;j<k[i];j++){
if(bit&(1<<s[i][j]-1)){
cnt++;
}
}
if(cnt%2==p[i]){
res++;
}
}
if(res==M){
ans++;
}
}
cout << ans << endl;
}
| 0
| 99,110,115
|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(int argc, char* argv[])
{
double x1,y1,x2,y2;
double distance;
cin >> x1 >> y1 >> x2 >> y2;
distance = sqrt(pow(x1-x2,2.0)+pow(y1-y2,2.0));
printf("%.8lf\n",distance);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<functional>
using namespace std;
typedef long long int ll;
int main(){
ll n, a, b;
cin >> n >> a >> b;
if(a+b-1 > n || n > a*b){
cout << -1 << endl;
return 0;
}
for(int i = 0; i < b; i++){
cout << b-i << ' ';
}
if(a==1) {
cout << endl;
return 0;
}
int q = (n-b)/(a-1);
for(int i = q; i >= 1; i--){
for(int j = 0; j < a-1;j++){
cout << n-(q-i)*(a-1)-(a-2)+j << ' ';
}
}
for(int i = b+1; i <= n-q*(a-1); i++){
cout << i << ' ';
}
cout << endl;
return 0;
}
| 0
| 92,624,199
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define debug(x) cout << #x << ": " << x << endl
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
const ll LINF = 1e16;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if (m == 0 && nmin == 0 && nmax == 0)break;
vector<int> P(m);
for (int i = 0; i < m; i++) cin >> P[i];
int MAX = -1;
int ret = 0;
for (int i = nmin; i <= nmax; i++) {
if (P[i - 1] - P[i] >= MAX) {
MAX = P[i - 1] - P[i];
ret = i;
}
}
cout << ret << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int G[110][110];
int n;
int u, k, v;
void print_matrix(int N) {
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
printf("%d", G[i][j]);
if (j < N-1) {
printf(" ");
}
}
printf("\n");
}
}
void make_matrix() {
fill(&G[0][0], &G[0][0]+110*110, 0);
scanf("%d", &n);
for (int i=0; i<n; i++) {
scanf("%d%d", &u, &k);
u--;
for (int j=0; j<k; j++) {
scanf("%d", &v);
v--;
G[u][v] = 1;
}
}
}
void bfs(int src) {
queue<int> Q;
int D[110];
fill(D, D+110, -1);
D[src] = 0;
Q.push(src);
while (! Q.empty()) {
int cur = Q.front();
Q.pop();
for (int i=1; i<=n; i++) {
if (G[cur-1][i-1] == 1 && D[i] == -1) {
D[i] = D[cur] + 1;
Q.push(i);
}
}
}
for (int i=1; i<=n; i++) {
printf("%d %d\n", i, D[i]);
}
}
int main() {
make_matrix();
bfs(1);
}
| 0
| 2,330,504
|
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,b) for(ll i=(b)-1, i>=a; --i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scanv(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No");
#define YES(flag) cout<<((flag)? "YES":"NO");
#define be begin
#define pb push_back
#define fi first
#define se second
#define square(x) x*x
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
template<class T>T
chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T>T
chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
string s;int w;
void input(){
cin>>s>>w;
}
void src(){
for(int i=0;i<s.length();i+=w){
cout<<s[i];
}
}
int main(int argc,char* argv[]){
ios::sync_with_stdio(false);
input();
src();
}
|
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
ll n;
int x,m;
cin >> n >> x >> m;
vector<int> check(m+5,0);
vector<ll> suma(m+5,0);
vector<ll> a(m+5);
a.at(1) = x;
suma.at(1) = x;
check.at(x) = 1;
int loop = 0;
int first = 0;
ll loopsum = 0;
ll firstsum = 0;
for(int i=2; i<=m+5; i++){
a.at(i) = a.at(i-1)*a.at(i-1);
if(a.at(i)>=m) a.at(i)%=m;
if(check.at(a.at(i))==0) {
check.at(a.at(i)) = i;
suma.at(i)=suma.at(i-1)+a.at(i);
}else{
loop = i-check.at(a.at(i));
first = max(0, check.at(a.at(i))-1);
loopsum = suma.at(i-1)-suma.at(first);
firstsum = suma.at(first);
break;
}
}
int k = first;
if(n<first) k=n;
ll p = (n-k)/loop;
ll r = n-k-loop*p;
if(r<0) r=0;
ll ans = suma.at(k) + loopsum*p + suma.at(first+r) - suma.at(first);
cout << ans;
}
| 0
| 43,677,487
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
const ll MOD=998244353;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
sort(s.begin(),s.end());
bool flag=1;
rep(i,3) {
if ((s[i]!=s[i+1]) ^ (i%2!=0)) flag=0;
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll MOD = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 5010;
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)return 0;
return (x / gcd(x, y) * y);
}
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll dx[4] = { 0,0,-1,1 };
ll dy[4] = { -1,1,0,0 };
ll dp[101010];
ll par[101010];
ll rank2[101010];
void init(ll n) {
rep(i, n) {
par[i] = i;
rank2[i] = 0;
}
}
ll find(ll x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)return;
if (rank2[x] < rank2[y]) {
par[x] = y;
}
else {
par[y] = x;
if (rank2[x] == rank2[y]) {
rank2[x]++;
}
}
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
char c[2010][2010];
int main() {
string s, t;
cin >> s >> t;
ll n = s.length();
vector<ll>start(26, -1);
vector<ll>goal(26, -1);
rep(i, n) {
ll target1 = s[i] - 'a';
ll target2 = t[i] - 'a';
if (start[target1] != -1 || goal[target2] != -1) {
if (start[target1] != target2 || goal[target2] != target1) {
puts("No");
return 0;
}
}
else {
start[target1] = target2;
goal[target2] = target1;
}
}
puts("Yes");
}
| 0
| 36,840,649
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s;
vector<int> p(M);
int switch_count = 0;
int light_count = 0;
int result_count = 0;
for(int i = 0; i < M; i++) {
cin >> k[i];
vector<int> tmp(k[i]);
for(int j = 0; j < k[i]; j++) {
cin >> tmp[j];
}
s.push_back(tmp);
}
for(int i = 0; i < M; i++) {
cin >> p[i];
}
for(int biti = 0; biti < (1<<N); biti++) {
light_count = 0;
for(int j = 0; j < M; j++) {
switch_count = 0;
for(int l : s[j]) {
if(biti & (1<<(l-1))) {
switch_count++;
}
}
if(switch_count % 2 == p[j]) {
light_count++;
}
}
if(light_count == M) {
result_count++;
}
}
cout << result_count << endl;
return 0;
}
|
#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 (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector<ll> data(n);
REP(i, n) { cin >> data[i]; }
ll ans = 0;
REP(d, 60) {
ll one_cnt = 0;
REP(i, n) {
if (data[i] >> d & 1) one_cnt++;
}
ll now = one_cnt * (n - one_cnt) % MOD;
REP(j, d) {
now *= 2;
now %= MOD;
}
ans += now;
ans %= MOD;
}
cout << ans << endl;
}
| 0
| 50,791,359
|
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n,ans = 1;
string s;
cin >> n >> s;
char tmp = s.at(0);
for(int i=1;i<n;i++){
if(s.at(i)!=tmp){
ans++;
tmp = s.at(i);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
cin>>n;
std::deque<int> deq;
deq.emplace_back(0);
int sum=0;
for (int i=0;i<=n;i++) {
if (i!=n) {
cin>>a;
deq.emplace_back(a);
sum+=abs(deq[i]-deq[i+1]);
} else {
deq.emplace_back(0);
sum+=abs(deq[i]-0);
}
}
for (int j=1;j<=n;j++) {
int tmp=sum;
tmp-=abs(deq[j-1]-deq[j]);
tmp-=abs(deq[j]-deq[j+1]);
tmp+=abs(deq[j-1]-deq[j+1]);
cout<<tmp<<endl;
}
}
| 0
| 94,330,679
|
#include<iostream>
using namespace std;
int main(){
int N,M,P;
while(cin>>N>>M>>P){
if(N==0)break;
int c=0;
int d[1100]={},cn=0;
for(int i=1;i<=N;i++){
cin>>c;
d[i]=c;
cn+=c;
}
if(d[M]==0){
cout<<0<<endl;
}
else{
cout<<((cn*(100-P))-((cn*(100-P))%d[M]))/d[M]<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
ll n;
cin >> n;
ll b[n-1];
for (ll i=0;i<=n-2;i++)
{
cin >> b[i];
}
ll ans=b[0];
for (ll i=0;i<=n-3;i++)
{
ans=ans+min(b[i],b[i+1]);
}
ans=ans+b[n-2];
cout << ans << endl;
return 0;
}
| 0
| 43,317,277
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main(){
ll n;
cin >> n;
ll t=0;
ll x=0,y=0;
bool ok=true;
rep(i,n){
ll cur,nx,ny;
cin >> cur >> nx >> ny;
ll d=abs(x-nx)+abs(y-ny);
ll dt=cur-t;
if(d<=dt && (dt-d)%2==0){
t=cur;
x=nx;
y=ny;
}
else{
ok=false;
break;
}
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0; cin >> n >> k;
vector<ll> num(k, 0);
for (int i = 1; i <= n; i++)
num[i%k]++;
for (ll a = 0; a < k; a++) {
if ((k-a)%k*2%k == 0)
ans += num[a] * num[(k-a)%k] * num[(k-a)%k];
}
cout << ans << endl;
return 0;
}
| 0
| 9,046,269
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pii pair<int, int>
#define inf 1e9
#define LB lower_bound
#define UB upper_bound
const int mod = 1000000007;
using namespace std;
ll gcd(ll a,ll b){
if(a==0)return b;
return gcd(b%a,a);
}
ll lcm(ll a, ll b){
return (a*b)/gcd(a,b);
}
int prime[100007];
void SieveOfEratosthenes(int n)
{
memset(prime, -1, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == -1)
{
for (int i=p*p; i<=n; i += p)
prime[i] = p;
}
}
}
int lps(string s){
int len = 0;
int n = s.length();
int dp[n];
dp[0] = 0;
for(int i=1; i<n; i++){
if(s[i] == s[len]){
len++;
dp[i] = len;
continue;
}
if(len!=0){
len = dp[len-1];
i--;
continue;
}
dp[i]=0;
}
return dp[n-1];
}
ll power(unsigned ll x,unsigned ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = res*x;
y = y>>1;
x = x*x;
}
return res;
}
vector<pair<ll, ll>> pFactor;
void factorize(long long n)
{
int count = 0;
while (!(n % 2)) {
n >>= 1;
count++;
}
if (count)
pFactor.pb({2,count});
for (long long i = 3; i <= sqrt(n); i += 2) {
count = 0;
while (n % i == 0) {
count++;
n = n / i;
}
if (count)
pFactor.pb({i,count});
}
if (n > 2)
pFactor.pb({n,1});
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int r=0;
int c=0;
for(int i=0; i<s.length(); i++){
if(s[i]=='R'){
c++;
}else{
r = max(r, c);
c=0;
}
}
r=max(r,c);
cout<<r<<endl;
}
|
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i,s,n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
#define bn '\n'
template <typename T>
ostream& operator<<(ostream& os, vector<T> &V){
int N = V.size();
REP(i,N){
os << V[i];
if (i!=N-1) os << " ";
}
os << "\n";
return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, pair<T,S> const&P){
os << "(";
os << P.first;
os << " , ";
os << P.second;
os << ")";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> &S){
auto it=S.begin();
while(it!=S.end()){
os << *it;
os << " ";
it++;
}
os << "\n";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T> &q){
for(auto it=q.begin();it<q.end();it++){
os<<*it;
os<<" ";
}
os<<endl;
return os;
}
vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};
#pragma endregion
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,A,B;
cin >> N >> A >> B;
if(abs(B-A)&1) cout << "Borys" << bn;
else cout << "Alice" << bn;
}
| 0
| 59,569,370
|
#include <bits/stdc++.h>
using namespace std;
#define N 300005
int sum[N], cc[N], number[N];
void update(int *pen,int ind,int v) {
while(ind<N) {
pen[ind] += v;
ind += ind&(-ind);
}
}
int query(int *pen,int ind) {
int ret = 0;
while(ind>0) {
ret += pen[ind];
ind = ind&(ind-1);
}
return ret;
}
void solve() {
int n;scanf("%d",&n);
for(int i=0;i<n;++i) {
int a;scanf("%d",&a);
number[a]++;
}
int numType = 0;
for(int i=1;i<=n;++i) {
if(number[i]>0) {
update(sum,number[i],number[i]);
update(cc, number[i],1);
++numType;
}
}
for(int k=1;k<=n;++k) {
int l = 0,r = n/k,mid;
while(l<r) {
mid = (l+r+1)/2;
int kCC = query(cc, mid);
long long qsum = query(sum, mid);
qsum += (long long)(numType-kCC)*mid;
if(qsum>= mid*k) {
l = mid;
} else {
r = mid-1;
}
}
printf("%d ",l);
}
putchar('\n');
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n, a, b, c;
vector<int> abc;
vector<int> vec;
ll ans = INF;
int check(ll st) {
vector<int> r(3, 0);
vector<int> cost(3, 0);
int cnt = 0;
while(st) {
if(st % 10 != 4) {
int idx = st % 10 - 1;
if (r[idx] != 0) {
cost[idx] += 10;
}
r[idx] += vec[n-1-cnt];
};
st /= 10;
cnt++;
}
int tmp = 0;
rep(i, 3) {
if (r[i] == 0) {
return -1;
}
tmp += cost[i] + abs(r[i] - abc[i]);
}
return tmp;
}
void dfs(ll st, int cnt) {
if (cnt == n) {
int tmp = check(st);
if (tmp != -1) {
ans = min(ans, (ll)tmp);
}
return;
}
reps(i,1,5) {
ll nxt = st * 10 + i;
dfs(nxt, cnt+1);
}
return;
}
int main()
{
cin >> n >> a >> b >> c;
abc.push_back(a);
abc.push_back(b);
abc.push_back(c);
vec.resize(n, 0);
rep(i,n) cin >> vec[i];
dfs(0, 0);
cout << ans << endl;
return 0;
}
| 0
| 21,964,699
|
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
#include <functional>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int>>;
const ll LINF = 1001002003004005006ll;
const ll INF = 1001001001;
const double pi = acos(-1);
int main()
{
int n;
cin >> n;
string s, t;
cin >> s >> t;
for (int i = 0; i < n; i++)
{
cout << s[i] << t[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
void solve0() {
int n; cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> dp(n,LINF);
rep(i,n) {
*lower_bound(dp.begin(), dp.end(), a[i]) = a[i];
}
auto itr = lower_bound(dp.begin(), dp.end(), LINF);
cout << itr-dp.begin() << '\n';
}
template <class T>
class SegTree {
int n;
vector<T> data;
T def;
function<T(T,T)> operation;
function<T(T,T)> update;
T _query(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) return def;
if (a <= l && r <= b) return data[k];
else {
ll c1 = _query(a, b, 2*k+1, l, (l+r)/2);
ll c2 = _query(a, b, 2*k+2, (l+r)/2, r);
return operation(c1, c2);
}
}
public:
SegTree(size_t _n, T _def, function<T(T,T)> _operation, function<T(T,T)> _update) :
def(_def), operation(_operation), update(_update){
n = 1;
while (n < _n) {n *= 2;}
data = vector<T>(2*n-1, def);
}
T query(T a, T b) {return _query(a,b,0,0,n);}
void change(T i, T x) {
i += n-1;
data[i] = update(data[i],x);
while (i>0) {
i = (i-1)/2;
data[i] = operation(data[i*2+1], data[i*2+2]);
}
}
T operator[](int i) {return data[i+n-1];}
};
void solve1() {
int n; cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> b(a);
sort(b.begin(), b.end());
b.erase(unique(b.begin(), b.end()), b.end());
vector<ll> c(n);
rep(i,n) {
c[i] = lower_bound(b.begin(), b.end(), a[i])-b.begin();
}
SegTree<ll> rmq(114514,0,[](ll x, ll y){return max(x,y);},[](ll a, ll x){return x;});
rep(i,n) {
ll x = rmq.query(0, c[i]);
rmq.change(c[i],x+1);
}
cout << rmq.query(0,114514) << '\n';
}
int main(int argc, char const *argv[]) {
solve1();
return 0;
}
| 0
| 29,017,464
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<P,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
int main(){
vector<ll> A(5,0);
for(ll i=0;i<5;i++)cin>>A[i];
vector<ll> B(5,0);
ll ans=0;
for(ll i=0;i<5;i++)ans+=((A[i]+9)/10)*10;
for(ll i=0;i<5;i++)B[i]=(10-(A[i]%10))%10;
sort(B.begin(), B.end());
print(ans-B[4])
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const int MOD = 1000000007;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int N;cin >> N;
map<int,int> A;
rep(i,N){
int a;cin >> a;
A[a]++;
}
int even = 0;
int odd = 0;
for(auto b : A){
int c = b.S;
if(c % 2 == 0)even++;
else odd++;
}
if(even == 0)cout << odd << endl;
else if(even % 2 == 0)cout << even + odd << endl;
else cout << even + odd - 1 << endl;
}
| 0
| 20,248,272
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,flag=0;
cin >> N;
for(int i=0;i<3;i++){
if(N%10==7) flag++;
N/=10;
}
if(flag){
cout<<"Yes";
}else{
cout<<"No";
}
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int A[200010];
int sta[1000010],dep[1000010];
bool check(int mid)
{
int head=0;
sta[head]=0,dep[head]=0;
for(int i=1;i<=n;i++)
{
if(A[i]>dep[head]){
head++;
dep[head]=A[i];
sta[head]=0;
sta[head-1]++;
}
else{
while(dep[head]>=A[i])head--;
int now=A[i]-1;
while(head>=0&&dep[head]==now&&sta[head]>=mid)
{
now--;
head--;
}
if(head<0)return false;
if(dep[head]!=now){
head++;
sta[head]=1;
dep[head]=now;
}
sta[++head]=0;
dep[head]=A[i];
sta[head-1]++;
}
}
return true;
}
int main()
{
scanf("%d",&n);
bool flag=true;
for(int i=1;i<=n;i++)
{
scanf("%d",&A[i]);
if(A[i]<=A[i-1])flag=false;
}
if(flag){
printf("1\n");
return 0;
}
int l=1,r=n;
while(l+1<r){
int mid=(l+r)>>1;
if(check(mid))r=mid;
else l=mid;
}
printf("%d\n",r);
return 0;
}
| 0
| 20,064,937
|
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
ll n;
cin>>n;
vector<ll>a(n);
map<ll,ll>num;
for(ll i=0;i<n;i++){
cin >>a.at(i);
if(num.count(a.at(i))){
num.at(a.at(i))++;
}
else{num[a.at(i)]=1;}
}
ll tmp=0;
ll tmp2;
for(auto num1:num){
tmp2=num1.second*(num1.second-1)/2;
tmp+=tmp2;
}
for(ll i=0;i<n;i++){
cout <<tmp-(num.at(a.at(i))*(num.at(a.at(i))-1)/2-(num.at(a.at(i))-1)*(num.at(a.at(i))-2)/2)<<endl;
}
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
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 pow(int base, int n) {
if (n == 0) {
return 1;
} else {
return base * (pow(base, n-1));
}
}
int main(void) {
int A, B, C, K;
cin >> A >> B >> C >> K;
const int mx = pow(3, K);
bool ok = false;
for (int bits = 0; bits < mx; bits++) {
int cur = bits;
int a = 0, b = 0, c = 0;
for (int trial = 0; trial < K; trial++) {
switch (cur % 3) {
case 0:
a++;
break;
case 1:
b++;
break;
case 2:
c++;
break;
default:
break;
}
cur /= 3;
}
int res_a = A * pow(2, a);
int res_b = B * pow(2, b);
int res_c = C * pow(2, c);
if (res_a < res_b && res_b < res_c) {
ok = true;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| 0
| 94,330,234
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; string S; cin >> N >> K >> S;
vector<int> v;
if(S.at(0) == '1') v.push_back(0);
char c = S.at(0);
for (int i = 0; i < N; i++) {
int cnt = 1;
while(i + 1 < N) {
if(S.at(i + 1) == c) {
i++; cnt++;
}
else break;
}
v.push_back(cnt);
if (c == '0') c = '1';
else c = '0';
}
int l = v.size();
vector<int> b(l + 1, 0);
for (int i = 0; i < l; i++) b.at(i + 1) = b.at(i) + v.at(i);
int ans = 0;
for (int i = 0; i < l; i += 2) {
if (i == 0) {
int r = min(l, 2 * K);
ans = b.at(r);
} else {
int r = min(l, i + 2 * K);
ans = max(ans, b.at(r) - b.at(i - 1));
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
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++)
typedef long long ll;
typedef pair<int,int> pii;
ll sum[2005][2005];
const ll MOD = 1e9+7;
int main(){
int n,m;
cin>>n>>m;
vector<ll>s(n+1,0);
vector<ll>t(m+1,0);
rep(i,n){
cin>>s[i+1];
}
rep(i,m){
cin>>t[i+1];
}
rep(i,2005) sum[0][i]=1;
rep(i,2005) sum[i][0]=1;
REP(i,n){
REP(j,m){
if(s[i]==t[j]){
sum[i][j]=(sum[i-1][j]+sum[i][j-1])%MOD;
}
else{
sum[i][j]=(0-sum[i-1][j-1]+sum[i-1][j]+sum[i][j-1]+MOD)%MOD;
}
}
}
cout<<sum[n][m]<<endl;
return 0;
}
| 0
| 98,845,775
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
char a, b;
cin >> a >> b;
if (a < b) cout << "<\n";
else if (a > b) cout << ">\n";
else cout << "=\n";
return (0);
}
|
#include<bits/stdc++.h>
#define int long long int
#define endl "\n"
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define loop(i,n) for(int i=0;i<(n);i++)
#define fors(a,b,i) for(int i=(a);i<=(b);i++)
#define ford(a,b,i) for(int i=(a);i>=(b);i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fastm_fast ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
using namespace std;
const int mod = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define S second
#define F first
const int MAX = 1e5;
void sujho()
{
int n,k;
cin >> n >> k;
vector<int> v(n);
loop(i,n) cin >> v[i];
vector<int> dp(n+1,INT_MAX);
dp[0] = 0;
for(int i = 1; i < n; i++)
{
for(int j = 1; j <= k; j++)
{
if(i - j < 0 ) break;
dp[i] = min(dp[i] , dp[i-j] + abs(v[i] - v[i-j]));
}
}
cout<<dp[n-1]<<endl;
}
int32_t main()
{
fastm_fast;
{
sujho();
}
return 0;
}
| 0
| 55,235,294
|
#include<stdio.h>
int main(void)
{
int a,b,c,d,e,f,g,h,x,y;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
scanf("%d",&g);
scanf("%d",&h);
x=a+b+c+d;
y=e+f+g+h;
if(x>=y){
printf("%d\n",x);
}
else{
printf("%d\n",y);
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
void solve()
{
vector<int> fibo;
fibo.push_back(1);
fibo.push_back(1);
for (int i = 2; i <= 44; ++i)
{
fibo.push_back(fibo[i - 1] + fibo[i - 2]);
}
int n;
cin >> n;
cout << fibo[n] << endl;
}
int main()
{
solve();
return(0);
}
| 0
| 3,304,200
|
#include <iostream>
#include <string>
#include <ctype.h>
using namespace std;
int main(int argc, char *argv[])
{
string input;
getline(cin, input);
for (int i = 0; i < input.size(); i++)
{
if (islower(input[i]))
{
input[i] = toupper(input[i]);
}
else
{
input[i] = tolower(input[i]);
}
}
cout << input << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int N,i;
cin>>N>>i;
cout<<N-i+1;
return 0;
}
| 0
| 41,307,753
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
vector<string> Bubble(vector<string> s, int n){
for(int i=0; i<n; i++){
for(int j = n-1; j>=i+1; j--){
if( s[j][1]-'0' < s[j-1][1]-'0' ) swap(s[j], s[j-1]);
}
}
return s;
}
vector<string> Select(vector<string> s, int n){
for(int i=0; i<n; i++){
int minj = i;
for(int j = i; j<n; j++){
if( s[j][1]-'0' < s[minj][1]-'0' ) minj = j;
}
swap(s[i], s[minj]);
}
return s;
}
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for(int i=0; i<n; i++) cin >> s[i];
vector<string> a = Bubble(s, n);
vector<string> b = Select(s, n);
for(int i=0; i<n-1; i++) cout << a[i] << " ";
cout << a[n-1] << endl;
cout << "Stable" << endl;
for(int i=0; i<n-1; i++) cout << b[i] << " ";
cout << b[n-1] << endl;
cout << ( a == b ? "Stable" : "Not stable" ) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const vector<int> v = {0, -1, 0, 1};
const vector<int> h = {-1, 0, 1, 0};
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H+1, vector<char>(W+1));
queue<vector<int>> que;
vector<vector<int>> dist(H+1, vector<int>(W+1, -1));
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> s.at(i).at(j);
if (s.at(i).at(j) == '#') {
que.push({i, j});
dist.at(i).at(j) = 0;
}
}
}
int maxDist = 0;
while (!que.empty()) {
vector<int> current = que.front();
int x = current.at(0);
int y = current.at(1);
que.pop();
for (int i = 0; i < 4; i++) {
int nx = x + v.at(i);
int ny = y + h.at(i);
if (nx < 1 || nx > H || ny < 1 || ny > W) continue;
if (dist.at(nx).at(ny) != -1) continue;
if (s.at(nx).at(ny) == '#') continue;
dist.at(nx).at(ny) = dist.at(x).at(y) + 1;
que.push({nx, ny});
maxDist = max(maxDist, dist.at(nx).at(ny));
}
}
cout << maxDist << endl;
return 0;
}
| 0
| 26,298,847
|
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
long i,s=1;
for(i=1;i<=n;i=i+1){
s=s*i;
}
cout<<s<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int n1 = a.size();
int n2 = b.size();
int dp[n1+1][n2+1];
rep(i,n1+1)rep(j,n2+1)dp[i][j] = 0;
rep(i,n1)rep(j,n2){
if(a[i] == b[j]&&dp[i+1][j] == dp[i][j+1]&&dp[i][j] ==dp[i+1][j])dp[i+1][j+1] = dp[i+1][j]+1;
else dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
}
cout << dp[n1][n2] << endl;
}
return 0;
}
| 0
| 80,872,671
|
#include<iostream>
using namespace std;
int main(){
int n,m;
int counter=0;
int sum = 0;
while(1) {
cin >> n >> m;
if (n == 0 && m ==0) break;
for (int i = 1; i <= n -2; i++) {
for (int j = i+1; j <= n -1;j++) {
for (int k = j+1; k <= n; k++) {
sum = i + j + k;
if(sum == m) counter += 1;
}
}
}
cout << counter << endl;
counter = 0;
}
return 0;
}
|
#include<string>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
string S, P, S_twice;
bool y_n = false;
getline(cin,S);
getline(cin,P);
S_twice = S + S;
int lenS, lenP, i;
lenS = S.length();
lenP = P.length();
for(i=0;i<lenS;i++){
if(strncmp(P.c_str(), S_twice.c_str(), lenP) == 0){
y_n = true;
}
S_twice.erase(0, 1);
}
if(y_n == true){
cout << "Yes\n";
}else{
cout << "No\n";
}
return 0;
}
| 0
| 47,732,188
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << "[*] " #x ": " << x << endl
#define debug(x) x
#else
#define dump(x)
#define debug(x)
#endif
typedef long long ll;
decltype(1) main() {
string s;
cin >> s;
for (char& c : s) {
cout << (c == '1' ? '9' : '1');
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <limits.h>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
ll N,A,B,D,L[10];
ll ANS=LINF;
void dfs(ll P,ll i,ll C[10]){
if(i==N){
ll a=0,b=0,c=0,AL=0,BL=0,CL=0;
rep(j,N){
if(C[j]==1){
a++;
AL+=L[j];
}
if(C[j]==2){
b++;
BL+=L[j];
}
if(C[j]==3){
c++;
CL+=L[j];
}
}
if(a==0 || (b==0 || c==0) ){
return;
}
ll SUM=((a+b+c)-3)*10;
SUM+=abs(AL-A)+abs(BL-B)+abs(CL-D);
ANS=min(ANS,SUM);
return;
}
else{
rep(j,4){
C[i]=j;
dfs(P,i+1,C);
}
}
}
int main(){
cin >> N >> A >> B >> D;
rep(i,N){
cin >> L[i];
}
ll C[10];
rep(i,9){
C[i]=0;
}
dfs(0,0,C);
cout << ANS << endl;
}
| 0
| 17,222,554
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define inf 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 1000005
#define mid(l, r) l + (r - l) / 2
#define veci vector<int>
#define vecl vector<ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define umapi unordered_map<ll, ll>
#define umapc unordered_map<char, int>
#define endl "\n"
#define pui pair<int, pair<int,int> >
using namespace std;
vector<int> ans(N+1,N);
unordered_map<int,veci> mp;
int n,m;
void bfs() {
queue<int> q;
q.push(1);
while(!q.empty()) {
int size = q.size();
while(size--) {
int temp = q.front();
q.pop();
for(auto it : mp[temp]) {
if(ans[it] == N) {
ans[it] = temp;
q.push(it);
}
}
}
}
}
void solve(){
cin>>n>>m;
rep(i,m) {
int a , b;
cin>>a >>b;
mp[a].pb(b);
mp[b].pb(a);
}
bfs();
bool check = true;
for(int i=2; i<=n; i++) {
if(ans[i] == N) {
check = false;
break;
}
}
if(check == false) {
cout<<"No";
} else {
cout<<"Yes"<<endl;
for(int i=2; i<=n; i++) {
cout<<ans[i]<<endl;
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while (t--)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
vll b(n+1);
rep(i, n) b[i+1] = b[i] + a[i];
map<ll, int> cnt;
rep(i, n+1) cnt[b[i]]++;
ll ans = 0;
for (auto p : cnt) {
if (p.second <= 1) continue;
ans += (ll)p.second * (p.second - 1) / 2;
}
cout << ans << endl;
return 0;
}
| 0
| 280,100
|
#include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string S,T;
const ll MOD = (1e+9) + 7;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> matP;
vec a(2002,0);
mat dp(2,vec(2001,-1));
ll dfs(bool xturn, ll num){
if(dp[xturn][num] != -1) return dp[xturn][num];
ll ans = abs(a[0] - a[num]);
reps(i,1,num){
ans = xturn ? max(ans, dfs(xturn^1, i)) : min(ans, dfs(xturn^1, i));
}
dp[xturn][num] = ans;
return ans;
}
int main() {
cin>>N>>H>>W;
rep(i,N) cin>>a[N-1-i];
a[N] = W;
cout<<dfs(1,N)<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define scan4Int(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
typedef long long ll;
using namespace std;
int main() {
int n, m, total = 0;
scan2Int(n, m);
int as[n];
rep(i, n) {
cin >> as[i];
total += as[i];
}
double border = (double) total / (4 * m);
rep(i, n) {
if (as[i] >= border)
m -= 1;
if (m <= 0) break;
}
if (m <= 0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 0
| 25,819,939
|
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len;
cin >> len;
int big = 0;
map<int, int> m;
for(int i = 0; i < len; i++) {
int a;
cin >> a;
m[a]++;
m[a - 1]++;
m[a + 1]++;
if(m[a] > big) {
big = m[a];
}
if(m[a + 1] > big) {
big = m[a + 1];
}
if(m[a - 1] > big) {
big = m[a - 1];
}
}
cout << big;
}
| 0
| 23,913,542
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
const int INF = 1e9+5;
int main(){
int N;
cin>>N;
vector<pair<int,int>> A,B;
rep(i,N){
int x,y;cin>>x>>y;
A.push_back({y,x});
}
rep(i,N){
int x,y;cin>>x>>y;
B.push_back({x,y});
}
sort(all(A), greater<pair<int, int>>());
sort(all(B));
vector<bool> f(N, false);
rep(i,N){
int c = B[i].first;
int d = B[i].second;
rep(j,N){
int a = A[j].second;
int b = A[j].first;
if(f[j])continue;
if(a < c && b < d){
f[j] = true;
break;
}
}
}
int cnt =0;
rep(i,N){
if(f[i])cnt++;
}
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n; cin >> n;
ll t[n + 1]; memset(t, -1, sizeof(t));
rep(i, 2, n){
if(t[i] == -1){
for(ll j = 2; j * i <= n; j++){
t[j * i] = i;
}
}
}
ll ans = 0;
rep(i, 1, n - 1){
if(i == 1){
ans++;
}else if(t[i] == -1){
ans += 2;
}else{
map<ll, ll> mp;
ll x = i;
while(t[x] != -1){
if(mp.find(t[x]) == mp.end()){
mp[t[x]] = 0;
}
mp[t[x]]++;
x /= t[x];
}
if(mp.find(x) == mp.end()){
mp[x] = 0;
}
mp[x]++;
ll y = 1;
for(auto it = mp.begin(); it != mp.end(); it++){
y *= (*it).second + 1;
}
ans += y;
}
}
print(ans)
return 0;
}
| 0
| 27,263,548
|
#include <cmath>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
int main() {
using i64 = long long;
int n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (auto &e : h) {
std::cin >> e;
}
h.insert(h.begin(), 0);
h.insert(h.end(), 0);
n += 2;
k = n - k - 1;
static constexpr i64 Inf = std::numeric_limits<i64>::max() / 2;
std::vector<i64> dp(n, Inf);
dp[0] = 0;
for (int l = 0; l != k; l += 1) {
std::vector<i64> nx(n, Inf);
for (int i = 0; i != n; i += 1) {
for (int j = 0; j != i; j += 1) {
chmin(nx[i], dp[j] + std::abs(h[i] - h[j]));
}
}
dp = std::move(nx);
}
std::cout << dp.back() / 2 << std::endl;
}
|
#include<iostream>
using namespace std;
string str1,str2;
int main()
{
cin>>str1>>str2;
int len1 = str1.length();
int len2 = str2.length();
if (len1 < len2)cout<<"LESS"<<endl;
else
if (len1 > len2)cout<<"GREATER"<<endl;
else
{
for (int i = 0 ; i < len1; i++)
{
if (str1[i] > str2[i]) {cout<<"GREATER"<<endl; return 0 ;}
else
if (str1[i] < str2[i])
{
cout<<"LESS"<<endl;
return 0;
}
}
cout<<"EQUAL"<<endl;
}
return 0;
}
| 0
| 43,199,524
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbegin(),(a).rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define ru(x,y) (((x)+(y)-1)/(y))
#define fi first
#define se second
#define eb emplace_back
#define fcout cout << fixed << setprecision(15)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vl = vector<ll>;
template<typename T> void Yes(T flag) {
cout << (flag ? "Yes" : "No") << endl;
}
template<typename T> void pv(vector<T> vec) {
cout << "[";
for(auto& v : vec) { cout << v << ","; }
cout << "]" << endl;
}
template<>
void pv(vector<P> vec) {
cout << "[";
for(auto& v : vec) {
cout << "<" << v.fi << ","<< v.se << ">" << ",";
}
cout << "]" << endl;
}
template<typename T> void pv2(vector<vector<T>> vec) {
for(auto& v : vec) pv(v);
}
int main() {
int n;cin >> n;
ll ans = 0;
orep(i,n-1) {
ans += (n-1) / i;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<stdlib.h>
using namespace std;
struct Node{
int key;
Node* next;
Node* prev;
};
struct List{
Node* nil;
void init(){
nil=(Node*)malloc(sizeof(Node));
nil->next=nil;
nil->prev=nil;
nil->key=0;
}
Node* find(int key){
for(Node* i=nil->next;i!=nil;i=i->next){
if(i->key==key)return i;
}
return nil;
}
void insert(Node *x){
x->next=nil->next;
nil->next->prev=x;
nil->next=x;
x->prev=nil;
}
void add(int x){
Node* p = (Node*)malloc(sizeof(Node));
p->key=x;
insert(p);
}
void delete_x(int key){
Node* x=find(key);
if(x==nil)return;
x->prev->next=x->next;
x->next->prev=x->prev;
free(x);
}
void deleteFirst(){
Node* x = nil->next;
x->prev->next=x->next;
x->next->prev=x->prev;
free(x);
}
void deleteLast(){
Node* x = nil->prev;
x->prev->next=x->next;
x->next->prev=x->prev;
free(x);
}
void output(){
int flg=0;
for(Node* i=nil->next;i!=nil;i=i->next){
if(flg)cout<<' ';
cout<<i->key;
flg=1;
}
cout<<endl;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
List list;
list.init();
int n,x;
string str;
cin>>n;
for(int i=0;i<n;i++){
cin>>str;
if(str=="insert"){
cin>>x;
list.add(x);
}else if(str=="delete"){
cin>>x;
list.delete_x(x);
}else if(str=="deleteFirst"){
list.deleteFirst();
}else {
list.deleteLast();
}
}
list.output();
}
| 0
| 7,434,345
|
#include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
vector<int> p(n);
rep(i, m){
cin >> k[i];
s[i].resize(k[i]);
rep(j, k[i]){
cin >> s[i][j];
s[i][j];
}
}
rep(i, m)cin >> p[i];
int ans = 0;
rep(i, 1<<n){
int cnt1 = 0;
rep(j, m){
int cnt2 = 0;
rep(l, k[j]){
if(i & 1<<(s[j][l]-1))cnt2++;
}
if(cnt2%2==p[j])cnt1++;
}
if(cnt1==m)ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n;
cin >> n;
vector<pair<int,int>> a;
for(int i = 0 ; i < n ;i++){
int x;
cin >> x;
a.push_back(make_pair(x,i));
}
sort(a.begin(), a.end());
vector<int> ans(n);
for(int i = 0 ; i < n ; i++){
int id = a[i].second;
cout << id + 1 << "\n";
}
}
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
#ifdef DEBUG
int TEST_CASES = 2;
while(TEST_CASES--){
#endif
solve();
#ifdef DEBUG
}
#endif
return 0;
}
| 0
| 74,510,074
|
#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>;
int main() {
int n;
cin >> n;
V<string> s(n);
rep(i, n) cin >> s[i];
int ans(0);
rep(i, n) {
int S = s[i].length();
rep(j, S - 1) {
if (s[i][j] == 'A' && s[i][j + 1] == 'B') ans++;
}
}
int a(0), b(0), ab(0);
rep(i, n) {
if (s[i].back() == 'A' && s[i][0] == 'B')
ab++;
else if (s[i].back() == 'A')
a++;
else if (s[i][0] == 'B')
b++;
}
if (ab > 1) ans += ab - 1;
if (ab > 0) {
if (a > 0) {
a--;
ans++;
}
if (b > 0) {
b--;
ans++;
}
}
ans += min(a, b);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif
ll n,m;
cin>>n>>m;
vector<ll> a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]=a[i]/2;
}
ll lcm=a[0];
ll prev;
for(int i=1;i<n;i++)
{
prev=lcm;
lcm=(lcm*a[i])/(__gcd(lcm,a[i]));
if(lcm<prev)
{
cout<<0<<endl;
return 0;
}
if((lcm/a[i])%2==0)
{
cout<<0<<endl;
return 0;
}
}
ll ans=(m/(lcm));
long double div=2;
ans=ceil(ans/div);
cout<<ans;
return 0;
}
| 0
| 77,013,577
|
#include <iostream>
#include <stdio.h>
#include <cctype>
int main(void)
{
std::string st;
getline(std::cin, st);
for(int i = 0 ; i < st.size();i++ ){
char ch = st[i];
if (std::islower(ch)){
ch = std::toupper(ch);
}
else if (std::isupper(ch)){
ch = std::tolower(ch);
}
else {
}
printf("%c", ch);
}
printf("\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,a[200009],m,k,ans=0,fl=0;
string s;
cin>>s;
for(int i=0;i<3;i++)
{
if(s[i]!=s[0])
ans=1;
}
if(ans==1)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
}
| 0
| 56,650,946
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string S;
cin>>S;
int ans=0;
rep(i,S.size()-1){
if(S.at(i)!=S.at(i+1)){
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
const ll INF=1ll<<32;
int main(){
ll v,e;
cin>>v>>e;
ll G[v][v];
rep(i,v){
rep(j,v){
G[i][j]=INF;
if(i==j)G[i][j]=0;
}
}
rep(i,e){
ll s,t,d;
cin>>s>>t>>d;
G[s][t]=d;
}
rep(k,v){
rep(i,v){
rep(j,v){
if(G[i][k]!=INF&&G[k][j]!=INF){
G[i][j]=min(G[i][j],G[i][k]+G[k][j]);
}
}
}
}
rep(i,v){
rep(j,v){
if(G[i][j]+G[j][i]<0){
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
}
}
rep(i,v){
rep(j,v){
if(G[i][j]==INF){cout<<"INF";}
else cout<<G[i][j];
if(j==v-1){
cout<<endl;
}
else cout<<' ';
}
}
}
| 0
| 49,789,729
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int H,W,d;
int x;
char c[5] = "RYGB";
int main()
{
scanf("%d%d%d",&H,&W,&d);
for(int i = 1;i <= H; ++ i)
{
for(int j = 1;j <= W; ++ j)
{
int x = (W + i + j) / d % 2;
int y = (W + i - j) / d % 2;
printf("%c",c[x * 2 + y]);
}
printf("\n");
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:vec) cout<<itr<<' ';
cout<<endl;
}
typedef pair<ll,ll> P;
const ll mod=1e9+7;
const ll inf=1e15;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin>>n>>m;
vector<int> a(m);
rep(i,m) cin>>a[i];
sort(begin(a),end(a),greater<ll>());
map<int,int> cnt;
cnt[1]=2,cnt[2]=5,cnt[3]=5,cnt[4]=4;
cnt[5]=5,cnt[6]=6,cnt[7]=3,cnt[8]=7,cnt[9]=6;
vector<int> dp(n+1,-1e9);
dp[0]=0;
FOR(i,1,n+1){
rep(j,m){
if(i-cnt[a[j]]>=0) dp[i]=max(dp[i],dp[i-cnt[a[j]]]+1);
}
}
string ans;
int num=n;
while(num){
rep(i,m){
if(num-cnt[a[i]]>=0 && dp[num-cnt[a[i]]]==dp[num]-1){
ans.push_back((char)a[i]+'0');
num-=cnt[a[i]];
break;
}
}
}
cout<<ans<<endl;
}
| 0
| 54,159,867
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> s;
rep(i, n) {
ll sum = 0;
for (int j = i ; j >= 0; j--) {
sum += a[j];
s.push_back(sum);
}
}
for (int i = 62; i >= 0; i--) {
vector<ll> ok;
rep(j, s.size()) {
if (s[j] & 1LL<<i)
ok.push_back(s[j]);
}
if (ok.size() >= k)
s = ok;
}
ll ans = s[0];
for (int i = 1; i < s.size(); i++)
ans &= s[i];
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
ll D;
cin >> D;
ll A;
cin >> A;
vector<P> vec(N);
for(ll i=0;i<N;i++){
ll x;
cin >> x;
ll h;
cin >> h;
vec[i]=P(x,h);
;}
sort(vec.begin(), vec.end());
vector<ll> until(N,INF);
until[0]=0;
for(ll i=0;i<N;i++){
if(i>0){
ll b=until[i-1];
if(vec[i].first>vec[0].first+2*D)
b-=until[lower_bound(vec.begin(), vec.end(), P(vec[i].first-2*D,-INF))-1-vec.begin()];
vec[i].second-=b*A;
until[i]=until[i-1];
}
if(vec[i].second>0){
until[i]+=vec[i].second/A;
vec[i].second-=(vec[i].second/A)*A;
if(vec[i].second>0){vec[i].second-=A;until[i]++;}
}
;}
cout<<until[N-1]<<endl;
return 0;
}
| 0
| 47,539,531
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, tmp;
long long ans=0;
scanf("%d",&n);
vector<int>a(n+1);
vector<int>b(n);
for(int i=0; i<n+1; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
cin >> b[i];
}
for(int i=0; i<n; i++){
if(b[i]<=a[i]){
ans += b[i];
}else{
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i+1]);
a[i+1] -= min(b[i],a[i+1]);
}
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N);
rep(i, N){
cin >> A[i];
}
vector<int> R(N+1);
R[0] = 0;
rep(i, N){
int r = A[i] + R[i];
r %= M;
R[i+1] = r;
}
map<ll, ll> m;
rep(i, N+1){
m[R[i]]++;
}
ll ans = 0;
for (auto p : m){
ll value = p.second;
value = value * (value-1) / 2;
ans += value;
}
cout << ans << endl;
return 0;
}
| 0
| 64,976,190
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
#define _GLIBCXX_DEBUG
#define rep(i, a) for(int i = 0; i < a; i++)
#define ALL(v) v.begin(), v.end()
int main(){
int n; cin>>n;
cout<<n/3<<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, A, B, C;
cin>>x>>y>>A>>B>>C;
vector<ll> a(A), b(B), c(C);
for(int i = 0; i<A; i++) cin>>a[i];
for(int i = 0; i<B; i++) cin>>b[i];
for(int i = 0; i<C; i++) cin>>c[i];
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
for(int i = 0; i<x; i++) c.push_back(a[i]);
for(int i = 0; i<y; i++) c.push_back(b[i]);
sort(c.rbegin(), c.rend());
ll ans = 0;
for(int i = 0; i<x+y; i++) ans += c[i];
cout<<ans<<"\n";
return 0;
}
| 0
| 47,325,641
|
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define bit(n) (1LL<<(n))
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b, const ll mod=MOD) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b, const ll mod=MOD) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b, const ll mod=MOD) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b, const ll mod=MOD) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, X, Y; cin >> n >> m >> X >> Y;
vi x(n); for(auto& e : x) cin >> e, chmax(X, e);
vi y(m); for(auto& e : y) cin >> e, chmin(Y, e);
string res = (X < Y ? "No War":"War");
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int main(){
int n, k; cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i];
ll res=LINF;
REP(bit, 1<<n){
ll maxi=0, sum=0, cnt=0;
REP(j, n){
if(bit & 1<<j){
ll x = max(maxi-a[j]+1, 0LL);
sum += x; cnt += 1;
if(0<x) maxi += 1;
}
maxi = max(a[j], maxi);
}
if(k<=cnt)
res = min(res, sum);
}
cout << res << endl;
}
| 0
| 3,968,772
|
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
const ll N = 2e5+50, inf = 1e3+5, mod = 1e9+7, NN = 1e5+10;
ll a[N] , b[N];
int main()
{
Tsetso
int n ;
cin >> n;
for ( int i = 0 ; i <= n ; i++)
cin >> a[i] ;
for ( int i = 0 ; i < n ; i++)
cin >> b[i] ;
ll ans = 0 ;
for ( int i = 0 ; i < n ; i++)
{
ans += min(a[i],b[i]);
b[i] -= min(a[i],b[i]);
ans += min(a[i+1],b[i]);
a[i+1] -= min(a[i+1],b[i]);
}
cout << ans ;
}
|
#include<iostream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
int w,h;
string matrix[20];
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
bool valid(int x,int y)
{
return (x>=0)&&(x<w)&&(y>=0)&&(y<h)&&(matrix[y][x]!='#');
}
int main()
{
while(true)
{
queue<pair<int,int> > q;
pair<int,int> man;
int amount=1;
cin>>w>>h;
if(w==0&&h==0)
break;
for(int i=0;i<h;i++)
{
cin>>matrix[i];
}
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
if(matrix[i][j]=='@')
{
man.first=j;
man.second=i;
}
}
}
q.push(man);
while(!q.empty())
{
pair<int,int> current;
current=q.front();
q.pop();
for(int i=0;i<4;i++)
{
if(valid(current.first+dx[i],current.second+dy[i]))
{
q.push(make_pair(current.first+dx[i],current.second+dy[i]));
matrix[current.second+dy[i]][current.first+dx[i]]='#';
amount++;
}
}
matrix[current.second][current.first]='#';
}
cout<<amount<<endl;
}
}
| 0
| 95,605,595
|
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e2 + 3, mxK = 1e5 + 3, MOD = 1e9 + 7;
int n, k, candies[mxN];
int dp[mxN][mxK], prefix[mxK];
int calc(int i)
{
if (i < 0)
return 0;
return prefix[i];
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> candies[i];
dp[0][0] = 1;
for (int i = 0; i <= mxK; i++)
{
prefix[i] = 1;
}
for (int i = 1; i <= n; i++)
{
for (int c = 0; c <= k; c++)
{
int ret = 0;
ret = ((calc(c) - calc(max(c - candies[i], 0) - 1)) % MOD + MOD) % MOD;
dp[i][c] = ret;
}
prefix[0] = dp[i][0];
for (int a = 1; a <= k; a++)
{
prefix[a] = prefix[a - 1] + dp[i][a];
prefix[a] %= MOD;
}
}
cout << dp[n][k];
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 3; ++i) cin >> v[i];
sort( v.begin(), v.end() );
for (int i = 0; i < 3; ++i) {
if (i) cout << " ";
cout << v[i];
}
cout << endl;
}
| 0
| 27,505,711
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin>>s>>t;
vector<char> s_c(s.size());
vector<char> t_c(t.size());
for(int i=0;i<s.size();i++){
s_c.at(i)=s.at(i);
}
for(int i=0;i<t.size();i++){
t_c.at(i)=t.at(i);
}
sort(s_c.begin(),s_c.end());
sort(t_c.begin(),t_c.end(),std::greater<char>());
if(s.size()<t.size()){
for(int i=s.size();i<t.size();i++){
s_c.push_back('0');
}
}
if(t.size()<s.size()){
for(int i=t.size();i<s.size();i++){
t_c.push_back('0');
}
}
string s2,t2;
for(int i=0;i<s_c.size();i++){
s2.push_back(s_c.at(i));
t2.push_back(t_c.at(i));
}
#if 0
for(int i=0;i<s_c.size();i++){
cout<<s2.at(i);
}
cout<<endl;
for(int i=0;i<t_c.size();i++){
cout<<t2.at(i);
}
cout<<endl;
#endif
if(s2<t2)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define vc vector;
const int INF = 100000000;
using namespace std;
void p(int x) {
cout << x << endl;
}
void pp(string s) {
cout << s << endl;
}
int main() {
while (1) {
int count = 0,arrcnt=0;
bool alljudge = true;
int n, a, b, c, x,xx;
cin >> n >> a >> b >> c >> x;
if (n == 0 && a == 0 && b == 0 && c == 0 && x == 0)break;
vector<pair<int,bool>> v(n);
rep(i, 0, n) {
cin >> v[i].first;
v[i].second = false;
}
rep(i, 0, 10001) {
if (x == v[arrcnt].first && v[arrcnt].second == false) {
v[arrcnt].second = true;
arrcnt++;
}
if (arrcnt == n) {
cout << count << endl;
alljudge = false;
break;
}
x = (a*x + b) % c;
count++;
}
if(alljudge) cout << -1 << endl;
}
return 0;
}
| 0
| 49,244,789
|
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;} cout << endl;
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
readc(n, a, b);
readarr(p, n);
int x = 0, y = 0, z = 0;
FOR (i, 1, n)
if (p[i] <= a) x++;
else if (p[i] <= b) y++;
else z++;
cout << min({x, y, z});
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
vector<LL> Div(LL n) {
vector<LL> ret;
for(LL i = 1; i * i <= n; ++i) {
if(n % i == 0) {
ret.pb(i);
if(i * i != n) ret.pb(n / i);
}
}
sort(all(ret));
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int L, R;
cin >> L >> R;
if(R - L >= 2019) {
cout << 0 << endl;
} else {
LL res = INF;
for(LL i = L; i <= R; ++i) {
for(LL j = L; j <= R; ++j) {
if(i == j) continue;
res = min(res, i * j % 2019);
}
}
cout << res << endl;
}
return 0;
}
| 0
| 28,560,369
|
#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;
long long koyaku_max(long long a,long long b){
long long r;
r = a % b;
while(r!=0){
a = b;
b = r;
r = a % b;
}
return b;
}
long long kobai_min(long long a,long long b){
long long tmp;
tmp = a / koyaku_max(a,b);
return tmp * b;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> A;
cin >> B;
cout << kobai_min(A,B) << endl;
}
|
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T...>::r(i));}static void w(ostream&o,tuple<H,T...>&t,string d){TupleReaderWriter<I-1,H,T...>::w(o,t,d);o<<d<<get<I>(t);}};
template<class H,class...T>struct TupleReaderWriter<0,H,T...>{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple<H>(v);}static void w(ostream&o,tuple<H,T...>&t,string d){o<<get<0>(t);}};
template<class...T>istream&operator>>(istream&i,tuple<T...>&t){t=TupleReaderWriter<sizeof...(T),T...>::r(i);return i;}
template<class...T>ostream&operator<<(ostream&o,tuple<T...>&t){string delim=" ";TupleReaderWriter<sizeof...(T)-1,T...>::w(o,t,delim);return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(auto&x:v)i>>x;return i;}
template<class T>ostream&operator<<(ostream&o,vector<T>&v){string delim="";for(auto&x:v)o<<delim<<x,delim=" ";return o;}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int x;fixprec(int d):x(d){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.x);}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }
i64 divceil(i64 a, i64 b) {
return a / b + (a > 0 && a % b ? 1 : 0);
}
int main() {
int K;
cin >> K;
vector<i64> A(K);
for(i64 &x : A) cin >> x;
reverse(WHOLE(A));
i64 a = 2, b = 2;
for(i64 x : A) {
a = divceil(a, x) * x;
b = (b / x + 1) * x - 1;
if(a > b) {
cout << -1 << endl;
return 0;
}
}
cout << a << " " << b << endl;
return 0;
}
| 0
| 55,729,724
|
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
string s;
vector<int> used(26, 0);
int cnt = 0;
cin >> s;
for(char c: s) {
used[c-'a'] = 1;
cnt += 1;
}
if (accumulate(used.begin(), used.end(), 0) == 26) {
set<char> lg;
string s2 = s;
string ans = "";
while(s2.size() > 0) {
auto it = lg.upper_bound(s2.back());
if (it != lg.end()) {
string s3 = s2;
s3.back() = *it;
if (ans == "")
ans = s3;
else
ans = min(ans, s3);
}
lg.insert(s2.back());
s2.pop_back();
}
if (ans == "")
cout << -1 << endl;
else
cout << ans << endl;
return 0;
} else {
cout << s;
for(int i = 0; i < 26; i++)
if (used[i] == 0) {
cout << char('a'+i) << endl;
break;
}
}
return 0;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<iostream>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main(){
ll n,k;
cin >> n>>k;
vector<ll> a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll ans=0,cnt=0,fir=0;
ll tmp=(k*(k-1)/2)%1000000007;
for(ll i=0;i<n;i++){
cnt=0;fir=0;
for(ll j=0;j<n;j++){
if(a[j]<a[i]){
cnt++;
if(i<j)fir++;
}
}
ans = (ans+cnt*tmp)%1000000007;
ans = (ans+fir*k)%1000000007;
}
cout << ans << endl;
}
| 0
| 36,824,213
|
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt(pow((x2-x1), 2)+pow((y2-y1), 2));
cout << fixed << setprecision(12) << d << endl;
return 0;
}
|
# include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0)
# define debug(x) cerr<< #x << " : " << x << endl
# define ddebug(x, y) cerr<< #x << " : " << x << ", " << #y << " : " << y << endl
# define sz(s) (int)s.size()
# define sq(x) (x) * (x)
# define PB(x) push_back(x)
# define smax(x, y) (x) = max((x), (y))
# define smin(x, y) (x) = min((x), (y))
# define all(x) x.begin(), x.end()
# define SP fixed << setprecision(10)
const int MAXN = 300 + 10;
int n;
string s[MAXN];
bool f(int a)
{
for (int i = 0; i < n; i ++)
for (int j = i; j < n; j ++)
if (s[(i + a) % n][j] != s[(j + a) % n][i])
return false;
return true;
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; i ++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < n; i ++)
ans += f(i);
cout << ans * n << endl;
return 0;
}
| 0
| 43,012,493
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
int main() {
ios_base::sync_with_stdio(false);
ll n,u;
cin >> n >> u;
vector<int> t(n);
rep(i,n) cin >> t[i];
ll ol=0;
rep(i,n-1) {
ol+=(t[i+1]-t[i]<u)?(u-(t[i+1]-t[i])):0;
}
ll ans=n*u-ol;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all(v) v.begin(), v.end()
const string YES = "Yes";
const string NO = "No";
void solve(long long D, long long T, long long S) {
if(T * S >= D)
cout << YES << endl;
else
cout << NO << endl;
}
struct IoSetup {
IoSetup() {
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
int main() {
long long D;
scanf("%lld", &D);
long long T;
scanf("%lld", &T);
long long S;
scanf("%lld", &S);
solve(D, T, S);
return 0;
}
| 0
| 67,521,705
|
#include <iostream>
#include <cmath>
#include <cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c",&ch);
if(isalpha(ch)){
if(islower(ch)){char c=(char)toupper(ch);cout<<c;}
else printf("%c",tolower(ch));
}else printf("%c",ch);
if(ch == '\n')break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
int n,m; cin>>n>>m;
vi vec(n);
rep(i,0,n)cin>>vec[i];
vector<bool> ans(n);
rep(i,0,m){
int a,b; cin>>a>>b;
--a; --b;
if(vec[a]==vec[b]){
ans[a]=1;
ans[b]=1;
}
else if(vec[a]<vec[b]){
ans[a]=1;
}
else ans[b]=1;
}
ll cnt=0;
rep(i,0,n)if(!ans[i])cnt++;
cout<<cnt<<endl;
}
| 0
| 1,604,353
|
#include<iostream>
using namespace std;
void counts(int h,int w);
int check[31][31]={0};
char s[31][31];
int dh[4]={-1,0,1,0};
int dw[4]={0,1,0,-1};
int ww,hh;
int counta=0;
main(){
int sw,sh,countx;
while(1){
cin>>ww>>hh;
if(ww==0&&hh==0) break;
for(int i=1;i<=hh;i++){
for(int j=1;j<=ww;j++){
cin>>s[i][j];
if(s[i][j]=='@'){
sh=i;
sw=j;
}
}
}
counts(sh,sw);
cout<<counta<<endl;
for(int i=0;i<=30;i++){
for(int j=0;j<=30;j++){
check[i][j]=0;
}
}
counta=0;
}
}
void counts(int h,int w){
check[h][w]=1;
counta++;
for(int i=0;i<8;i++){
int nh=h+dh[i];
int nw=w+dw[i];
if(nh>=1&&nh<=hh&&nw>=1&&nw<=ww&&s[nh][nw]=='.'&&check[nh][nw]==0){
counts(nh,nw);
}
}
return;
}
|
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
const constexpr int MAX = 100;
constexpr ll INF = 1LL<<32;
int n;
vv(ll, d, MAX, MAX, INF);
inline void floyd() {
rep(k, 0, n) {
rep(i, 0, n) {
if(d[i][k] == INF) continue;
rep(j, 0, n) {
if(d[k][j] == INF) continue;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
int main() {
int e; cin >> n >> e;
rep(i, 0, n) d[i][i] = 0L;
int u, v, c;
rep(i, 0, e) {
cin >> u >> v >> c;
d[u][v] = c;
}
floyd();
bool negative = false;
rep(i, 0, n) if(d[i][i] < 0) { negative = true; break; }
if(negative) P("NEGATIVE CYCLE");
else {
rep(i, 0, n) {
rep(j, 0, n) {
if(j) p(" ");
if(d[i][j] == INF) p("INF");
else p(d[i][j]);
}
cout << "\n";
}
}
return 0;
}
| 0
| 46,724,111
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
vector<ll> vec(n);
rep(i,n){
cin>>vec[i];
}
ll ans=0, zan=0;
rep(i,n-1){
if(vec[i]>=vec[i+1]) zan++;
else{
if(zan>ans) ans= zan;
zan = 0;
}
if(i==n-2){
if(zan>ans) ans= zan;
}
}
cout<<ans;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
double W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(6) << W * H / 2.0;
cout << " " << (x == W / 2.0 && y == H / 2.0 ? 1 : 0) << endl;
}
| 0
| 79,303,418
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
int N,K;
cin >>N>>K;
vector<ll>v(N);
deque<ll> d;
deque<ll> d2;
rep(i,N){
cin>>v[i];
d.pb(v[i]);
}
ll ans = 0;
d2 = d;
rep(i,min(N,K)+1){
rep(j,min(N,K)-i+1){
vector<ll>have;
d=d2;
ll now=0;
rep(k,i){
now += d.front();
have.pb(d.front());
d.pop_front();
}
rep(k,j){
now += d.back();
have.pb(d.back());
d.pop_back();
}
sort(all(have));
int size = have.size();
rep(k,min(K-i-j,size)){
if(have[k]<0){
now+=-have[k];
}else{
break;
}
}
chmax(ans,now);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int b[101],a[101],n;
for(int i=0;i<101;i++){
a[i] = 0;
b[i] = a[i];
}
while(cin >> n && n){
a[n] = a[n] + 1;
b[n] = a[n];
}
sort(b,b+101);
for(int i=1;i<101;i++){
if(a[i] == b[100]) cout << i << endl;
}
return 0;
}
| 0
| 67,901,095
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
ll ans = 0, cv = 0;
rrep(i, n - 1) {
if (h[i] >= h[i + 1]) {
cv++;
}
else {
ans = max(ans, cv);
cv = 0;
}
}
ans = max(ans, cv);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) {
if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main(){
int n;
cin>>n;
vector<ll> c(n-1);
vector<ll> s(n-1);
vector<ll> f(n-1);
rep(i,n-1){
cin>>c[i]>>s[i]>>f[i];
}
rep(i,n){
ll ans=0;
for(int j=i;j<n-1;j++){
if(ans<=s[j]) ans=s[j];
else ans=((ans+f[j]-1)/f[j])*f[j];
ans+=c[j];
}
cout << ans << endl;
}
}
| 0
| 24,429,264
|
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1007;
char s1[MAXN];
char s2[MAXN];
int dp[MAXN][MAXN];
int main(){
scanf("%s",s1+1);
scanf("%s",s2+1);
for(int i=1;s1[i];i++) dp[0][i]=i;
for(int i=1;s2[i];i++) dp[i][0]=i;
int i=1,j=1;
for(;s2[i];i++){
for(j=1;s1[j];j++){
int temp=(s1[j]==s2[i]?dp[i-1][j-1]:dp[i-1][j-1]+1);
dp[i][j]=min(min(temp,dp[i][j-1]+1),dp[i-1][j]+1);
}
}
printf("%d\n",dp[i-1][j-1]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
ll K;
cin >> K;
ll siz=S.size();
ll X=0;
ll counter=0;
for(ll i=0;i<siz-1;i++){
if(S.at(i)==S.at(i+1)){counter++;
}
else{
X+=(counter+1)/2;
counter=0;
}
;}
X+=(counter+1)/2;
if(counter==siz-1){
cout<<(siz*K)/2;
}
else if(S.at(0)!=S.at(siz-1)){
cout<<X*K<<endl;
}
else if(S.at(0)==S.at(siz-1)){
ll counterf=0;
for(int i=0;i<siz;i++){if(S.at(i)==S.at(i+1)){counterf++;
}
else{break;}
;}
ll Y=X*K-((counter+1)/2)*(K-1)-((counterf+1)/2)*(K-1)+(counter+counterf+2)/2*(K-1);
cout<<Y<<endl;
}
return 0;
}
| 0
| 73,334,495
|
#include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
const ll inf = 1000000001, INF = (ll)1e18 + 1;
ii pair_up(int a, int b) {
return {min(a, b), max(a, b)};
}
void solve() {
int n, k;
cin >> n >> k;
int tk = (n - 1) * (n - 2) / 2;
if(k > tk) {
cout << -1 << endl;
return;
}
vvi adj(n, vi(n, 0));
for(int i = 0; i < n - 1; i++) {
adj[i][n - 1] = adj[n - 1][i] = 1;
}
for(int i = 0; i < n - 1 && tk > k; i++)
for(int j = 0; j < n - 1 && tk > k; j++) {
if(i == j) continue;
if(adj[i][j]) continue;
adj[i][j] = adj[j][i] = 1;
tk--;
}
set<ii> ans;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) {
if(i == j) continue;
if(adj[i][j] == 1) ans.insert(pair_up(i, j));
}
cout << ans.size() << endl;
for(ii i : ans) cout << i.ff + 1 << " " << i.ss + 1 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SUM(x) accumulate(rng(x),0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define uni(x) x.erase(unique(rng(x)),x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
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 () {
string s;
cin >> s;
int ans = INF;
rep(i,2) {
int cnt = 0;
rep(j,s.size()) {
if ((j%2 == 0) ^ (s[j] == (char)(i+'0'))) cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
}
| 0
| 61,533,354
|
#include<stdio.h>
#include<algorithm>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <iostream>
#include <string>
#include <time.h>
#include <functional>
using namespace std;
int dp[1001][1001] = { 0 };
int n, m;
string st1, st2;
int main(void) {
cin >> st1;
cin >> st2;
n = st1.size();
m = st2.size();
dp[0][0] = 0;
for (int i = 0; i <= n; ++i) dp[i][0] = i;
for (int j = 0; j <= m; ++j) dp[0][j] = j;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (st1[i - 1] == st2[j - 1]) dp[i][j] = dp[i - 1][j - 1];
else {
int min = dp[i][j - 1] + 1;
if (min > dp[i - 1][j] + 1) { min = dp[i - 1][j] + 1; }
if (min > dp[i - 1][j - 1] + 1) { min = dp[i - 1][j - 1] + 1; }
dp[i][j] = min;
}
}
}
printf("%d\n", dp[n][m]);
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define MAX 5100000
#define MOD 1000000007
ll fac[MAX], finv[MAX], inv[MAX];
void combModInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll comb(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
ll X, Y;
cin >> X >> Y;
combModInit();
if(Y > 2 * X || 2 * Y < X || (X + Y) % 3 != 0){
cout << 0 << endl;
return 0;
}
ll moves = (X + Y) / 3;
ll up = X - moves;
ll ans = comb(moves, up);
cout << ans << endl;
return 0;
}
| 0
| 94,879,445
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
ll const INF = 1LL << 60;
int main() {
ll A, B;
cin >> A >> B;
if (A <= 8 && B <= 8)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<lli, lli> pi;
int main()
{
int n, m;
cin >> n >> m;
priority_queue<lli>pq;
vector<pi> v;
for(int i=0; i<n; i++){
lli a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
int j=0;
lli ans = 0;
for(int i=1; i<=m; i++){
while(j<n && v[j].first <= i){
pq.push(v[j].second);
j++;
}
if(!pq.empty()){
ans += pq.top();
pq.pop();
}
}
cout << ans << "\n";
return 0;
}
| 0
| 84,757,948
|
#include<stdio.h>
int main()
{
int a,n,i,j,s,r;
scanf("%d%d", &n, &a);
if(n<=a)
printf("Yes\n");
else
{
if(n%500<=a)
printf("Yes\n");
else
printf("No\n");
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
vector<LLi> pri={1, 2, 3};
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
bool VV(vector<int> vv1, vector<int> vv2) {
if(vv1.size()!=vv2.size()) return false;
rep(i, vv1.size()) if(vv1[i]!=vv2[i]) return false;
return true;
}
bool VVL(vector<LLi> vv1, vector<LLi> vv2) {
if(vv1.size()!=vv2.size()) return false;
rep(i, vv1.size()) if(vv1[i]!=vv2[i]) return false;
return true;
}
LLi SML(vector<LLi> smv) {
LLi tmp=0;
rep(i, smv.size()) tmp+=smv[i];
return tmp;
}
void mplist(LLi x){
int flag;
for(int i=5;i<=x;i+=2){
flag=0;
for(int j=1;j<(int)pri.size();j++){
if(i%pri[j]==0){
flag=1;
break;
}
if(x<pri[j]*pri[j]) break;
}
if(flag==0) pri.emplace_back(i);
}
}
map<LLi, int> rpfac(LLi x){
int sqx=ceil(sqrt(x));
auto bin = lower_bound(pri.begin(), pri.end(), sqx);
int lmt=bin-pri.begin()+1;
map<LLi, int> tmp;
if((int)pri.size()<lmt) cout<< "rpfac: pri size is small" <<endl;
for(int i=1;i<lmt;i++){
while(x%pri[i]==0){
x/=pri[i];
tmp[pri[i]]++;
}
if(x==1) break;
}
return tmp;
}
vector<LLi> getfac(map<LLi, int> mp){
vector<LLi> tmp={1}, ad;
LLi mul;
for (auto p : mp) {
mul=1;
ad.clear();
LLi key = p.first;
int value = p.second;
rep(j, value){
mul*=key;
rep(k, tmp.size()) ad.push_back(tmp[k]*mul);
}
rep(j, ad.size()) tmp.push_back(ad[j]);
}
sort(all(tmp));
return tmp;
}
LLi defac(map<LLi, int> mp){
LLi tmp=1;
for (auto p : mp) {
LLi key = p.first;
int value = p.second;
tmp*=pow(key, value);
}
return tmp;
}
bool isp(LLi x){
auto ub = upper_bound(all(pri), x);
auto lb = lower_bound(all(pri), x);
if(lb==pri.end()){
for(int i=1;i<(int)pri.size();i++){
if(x%pri[i]==0) return false;
if(x<pri[i]*pri[i]) return true;
}
for(LLi i=pri[pri.size()-1]+2;i*i<=x;i+=2){
if(x%i==0) return false;
}
return true;
}
return ub!=lb;
}
int main(){
LLi n, m, ml, ans=0;
vector<int> d(75, 0);
vector<LLi> v;
map<LLi, int> mp, tmp;
cin>> n;
mplist(110);
for(int i=2;i<=n;i++){
tmp=rpfac(i);
ml=defac(tmp);
if(i!=ml) tmp[i/ml]++;
for (auto tp : tmp) {
auto tkey = tp.first;
auto tvalue = tp.second;
mp[tkey]+=tvalue;
}
}
for (auto p : mp) {
auto key = p.first;
auto value = p.second;
if(74<=value) d[74]++;
if(24<=value) d[24]++;
if(14<=value) d[14]++;
if(4<=value) d[4]++;
if(2<=value) d[2]++;
}
ans+=d[74];
ans+=d[24]*(max(0, d[2]-1));
ans+=d[14]*(max(0, d[4]-1));
ans+=d[4]*(max(0, d[4]-1))*(max(0, d[2]-2))/2;
cout<< ans <<endl;
return 0;
}
| 0
| 78,704,485
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#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 rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
#define dame { puts("-1"); return 0;}
#define YES { cout << "YES" << endl; return 0; }
#define NO { cout << "NO" << endl; return 0; }
#define Yes { cout << "Yes" << endl; return 0; }
#define No { cout << "No" << endl; return 0; }
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int x,a;
cin >> x >> a;
if(x<a)cout << 0 <<endl;
else cout << 10 << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main()
{
int N;
cin >> N;
string S[N];
ll ABCount=0;
ll ACount=0;
ll BCount=0;
rep(i,N){
cin >> S[i];
}
bool flag = false;
rep(i,N){
rep(j,S[i].length()-1){
if(S[i][j] == 'A' && S[i][j+1] == 'B') ABCount++;
}
if(S[i][0] == 'B') BCount++;
if(S[i][S[i].length()-1] == 'A') ACount++;
if((S[i][0] == 'B' || S[i][S[i].length()-1] == 'A') && !(S[i][0] == 'B' && S[i][S[i].length()-1] == 'A')) flag=true;
}
ll ans=0;
ans += ABCount;
ans += min(ACount,BCount);
if(!flag&&min(ACount,BCount)) ans-=1;
fin(ans);
}
| 0
| 29,516,037
|
#include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
string order;
while(true){
cin >> order;
if(order == "insert"){
int key;
cin >> key;
pq.push(key);
}
else if(order == "extract"){
cout<<pq.top()<<endl;
pq.pop();
}
else if(order == "end"){
break;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,N) for(int (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
const double PI = 3.1415926535897932384626433832795;
const int mod = 1000000007;
int main() {
ll n, d, a;
cin >> n >> d >> a;
vector<P> monster(n);
rep(i, n) {
ll x, h;
cin >> x >> h;
monster[i] = P(x, h);
}
sort(monster.begin(), monster.end());
queue<P> bomb;
ll ans = 0;
ll bombnum = 0;
rep(i, n) {
ll x = monster[i].first;
ll h = monster[i].second;
while (!bomb.empty()) {
ll bombx = bomb.front().first;
if (bombx < x) {
bombnum -= bomb.front().second;
bomb.pop();
} else {
break;
}
}
ll remain = h - (bombnum * a);
if (remain > 0) {
ll num = (remain + a - 1) / a;
ll expire = x + 2 * d;
bomb.push(P(expire, num));
ans += num;
bombnum += num;
}
}
cout << ans << endl;
}
| 0
| 52,791,540
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << N / 3 << endl;
}
|
#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 CIN(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 COUT(...) 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;
struct Monster {
ll X, H;
bool operator<(const Monster& m) const {
return X < m.X;
}
};
Monster monster[200000];
ll Add(ll a, ll b) { return a + b; }
int main() {
CIN(ll, N, D, A);
REP(i, N) cin >> monster[i].X >> monster[i].H;
sort(monster, monster + N);
ll ans = 0;
queue<pair<ll, ll>> que;
ll damage_sum = 0;
REP(i, N) {
DBG(i, monster[i].X, monster[i].H, damage_sum);
while (!que.empty() && que.front().first < monster[i].X) {
DBG(que.front().first, que.front().second);
damage_sum -= que.front().second;
que.pop();
}
ll remaining = monster[i].H - damage_sum;
if (remaining > 0) {
ll cnt = (remaining + A - 1) / A;
ans += cnt;
damage_sum += cnt * A;
que.push({monster[i].X + 2 * D, cnt * A});
DBG(que.front().first, que.front().second);
}
}
COUT(ans);
}
| 0
| 52,845,151
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << 6/A/B << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char a=(char)s[i];
int d=(int) a-'0';
sum+=d;
}
if(sum%9==0)cout<<"Yes\n";
else cout<<"No\n";
}
int main()
{
string s;
cin>>s;
int cnt=0;
if(s[1]=='R')cnt++;
if(cnt)
{
if(s[0]=='R')cnt++;
if(s[2]=='R')cnt++;
cout<<cnt<<endl;
}
else if(s[0]=='R'||s[2]=='R')cout<<1<<endl;
else cout<<0<<endl;
}
| 0
| 23,141,055
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.