code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <cstdio>
int K, X;
int main() {
scanf(" %d%d", &K, &X);
puts((K * 500 >= X) ? "Yes" : "No");
return 0;
}
|
#include <stdio.h>
int H,W,i,j;
int main(){
for(;;){
scanf(" %d %d",&H,&W);
if(H==0&&W==0){
return 0;
}
for(i=0;i<H;i++){
for(j=0;j<W;j++){
printf("#");
}
printf("\n");
}
printf("\n");
}
}
| 0
| 36,940,122
|
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323;
long long int N,X,M,K,res=0,A[200200];
long long int H,W,PB[55]={1},P[55]={1};
bool usedH[102]={},usedW[102]={};
string str[102];
int main()
{
cout << fixed << setprecision(18);
cin>>N>>X;
for(long long int i = 1; i <= 50; i++){
P[i]=2*+P[i-1]+1;
PB[i]=2*PB[i-1]+3;
}
long long int now=N-1;
while(1){
X--;
if(X<=0){break;}
if(PB[now]<=X){res+=P[now];X-=PB[now];}
else{now--;continue;}
if(X<=0){break;}
X--;
res++;
if(X<=0){break;}
if(PB[now]<=X){res+=P[now];X-=PB[now];break;}
else{now--;continue;}
}
cout<<res<<endl;
}
|
#include<stdio.h>
#include<math.h>
using namespace std;
struct Pos {
double x,y;
};
void kock(int n, Pos p1, Pos p2) {
if(n==0){
return;
}
Pos s,t,u;
double th = 60*M_PI/180;
s.x=(2.0*p1.x+1.0*p2.x)/3.0;
s.y=(2.0*p1.y+1.0*p2.y)/3.0;
t.x=(1.0*p1.x+2.0*p2.x)/3.0;
t.y=(1.0*p1.y+2.0*p2.y)/3.0;
u.x=(t.x-s.x)*cos(th)-(t.y-s.y)*sin(th)+s.x;
u.y=(t.x-s.x)*sin(th)+(t.y-s.y)*cos(th)+s.y;
kock(n-1, p1, s);
printf("%.8f %.8f\n", s.x,s.y);
kock(n-1, s, u);
printf("%.8f %.8f\n", u.x,u.y);
kock(n-1, u, t);
printf("%.8f %.8f\n", t.x,t.y);
kock(n-1, t, p2);
}
int main(){
int n;
Pos p1,p2;
p1.x=0;
p1.y=0;
p2.x=100;
p2.y=0;
scanf("%d", &n);
printf("%.8f %.8f\n", p1.x, p1.y);
kock(n, p1, p2);
printf("%.8f %.8f\n", p2.x, p2.y);
}
| 0
| 33,586,174
|
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int mod = 1e9+7;
const int MAX = 5100000;
const int V = 100005;
ll dy[8] = {1,0,-1,0,1,-1,1,-1};
ll dx[8] = {0,1,0,-1,1,-1,-1,1};
const double pi = acos(-1);
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << endl;}
#define INT_MAX 1e9+7
vector<ll> fac(MAX), finv(MAX), inv(MAX);
int main(){
ll n,K; cin >> n >> K;
vl h(n);
K = n-K;
if(K==0){
puts("0");
return 0;
}
rep(i,n) cin >> h[i];
vvl dp(n,vl(K,linf));
rep(i,n) dp[i][0] = h[i];
rep(i,n){
rep(j,K-1){
rep(k,i){
chmin(dp[i][j+1], dp[k][j] + max(0LL, h[i]-h[k]));
}
}
}
ll ans = linf;
rep(i,n) chmin(ans, dp[i][K-1]);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#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; }
int n, k;
bool b[111][111];
void solve(){
cin >> n >> k;
k -= (n-1)*(n-2)/2;
if(k > 0){
cout << -1 << endl;
return;
}
vector<int> v[111];
vector<P> ans;
for(int i = 2; i <= n; i++){
ans.push_back({1,i});
v[1].push_back(i);
v[i].push_back(1);
b[1][i] = b[i][1] = 1;
}
if(k != 0){
for(int i = 2; i < n; i++){
for(int j = i+1; j <= n; j++){
if(b[i][j]) continue;
b[i][j] = 1;
k++;
ans.push_back({i,j});
if(k == 0) break;
}
if(k==0) break;
}
}
cout << ans.size() << endl;
for(auto i:ans){
cout << i.first << " " << i.second << endl;
}
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
while(t--){
solve();
}
return 0;
}
| 0
| 72,130,445
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
int main() {
int s, w; cin >> s >> w;
if(w >= s) cout << "unsafe" << endl;
else cout << "safe" << endl;
}
|
#include <iostream>
#define REP(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int n, m;
char table[256];
char c, d;
int main(void) {
while(1) {
cin >> n;
if(n == 0) break;
REP(i, 0, 256) table[i] = (char) i;
REP(i, 0, n) {
cin >> c >> d;
table[c] = d;
}
cin >> m;
REP(i, 0, m) {
cin >> c;
cout << table[c];
}
cout << endl;
}
return 0;
}
| 0
| 42,465,973
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n;
cin >> n;
vector<string> s(n);
vector<ll> t(n);
rep(i, 0, n) cin >> s[i] >> t[i];
string x;
cin >> x;
ll ans = 0;
bool f = false;
rep(i, 0, n) {
if(f) ans += t[i];
if(s[i] == x) f = true;
}
cout << ans << endl;
return 0;
}
| 0
| 54,335,013
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<vector<int>> ab(M, vector<int>(2));
vector<vector<int>> ba(M, vector<int>(2));
for (int i=0; i<M; i++)
{
int x, y;
cin >> x >> y;
ab[i][0] = x;
ab[i][1] = y;
ba[i][0] = y;
ba[i][1] = x;
}
vector<int> order(N-1);
for (int i=2; i<=N; i++) order[i-2]=i;
int ans=0;
do
{
vector<int> tmp_order(order);
tmp_order.insert(tmp_order.begin(), 1);
vector<vector<int>> path(N-1, vector<int>(2));
bool ok=true;
for (int i=0; i<N-1; i++)
{
path[i][0] = tmp_order[i];
path[i][1] = tmp_order[i+1];
if (find(ab.begin(), ab.end(), path[i]) == ab.end() && find(ba.begin(), ba.end(), path[i]) == ba.end())
{
ok=false;
break;
}
}
if (ok) ans++;
} while (next_permutation(order.begin(), order.end()));
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 998244353;
int main(){
int n;
cin >> n;
int t;
cin >> t;
if(t != 0) {
puts("0");
return 0;
}
--n;
vector<int> d(n);
rep(i, n) {
cin >> d[i];
if(d[i] == 0) {
puts("0");
return 0;
}
}
ll ans = 1;
sort(d.begin(), d.end());
vector<int> cnt(100000);
for(int i = 0; i < n; ++i) {
cnt[d[i]]++;
}
cnt[0] = 1;
for(int i = 1; i <= d[n - 1]; ++i) {
rep(j, cnt[i]) {
ans *= cnt[i - 1];
ans %= mod;
}
}
cout << ans << endl;
}
| 0
| 79,974,621
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long A,B;cin>>A>>B;
long C,D;cin>>C>>D;
long ans=0;
ans += B/C;
ans += B/D;
ans -= (A-1)/C;
ans -= (A-1)/D;
long S=gcd(C,D);
ans -= ((B/C)*S)/D;
ans += (((A-1)/C)*S)/D;
cout<<B-A+1-ans<<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 main(void) {
string S;
cin >> S;
if (S[0] != 'A') {
cout << "WA" << endl;
return 0;
}
if (!( ('a' <= S[1] && S[1] <= 'z') && ('a' <= S.back() && S.back() <= 'z') )) {
cout << "WA" << endl;
return 0;
}
int count_C = 0;
for (int i = 2; i < (int) S.size() - 1; i++) {
if (S[i] == 'C') {
count_C++;
} else if ('A' <= S[i] && S[i] <= 'Z') {
cout << "WA" << endl;
return 0;
}
}
if (count_C == 1) {
cout << "AC" << endl;
return 0;
} else {
cout << "WA" << endl;
return 0;
}
}
| 0
| 9,465,312
|
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,h,w;
std::cin>>n>>h>>w;
vector <int> a;
vector <int> b;
int i,count=0;
int input;
for(i=0;i<n;i++)
{
std::cin>>input;
a.push_back(input);
std::cin>>input;
b.push_back(input);
if(a[i]>=h&&b[i]>=w)
count+=1;
}
std::cout<<count;
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define OP ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
typedef long long ll;
typedef std::vector<int> vi;
typedef std::pair<int, int> pii;
const int inf = int(1e9);
const int mod = inf + 7;
const double PI = acos(-1.0);
using namespace std;
const int N = 1e5 + 155;
template<typename T>
inline void read(T&x){
x=0;int f=1;char ch = getchar();
while(ch<'0' ||ch>'9'){ if(ch=='-')f=-1;ch=getchar(); }
while(ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
x*=f;
}
ll bp(ll a, ll n){
ll r = 1;
while(n){
if(n & 1) r = (r * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return r;
}
void solve(){
string s;
cin >> s;
unordered_map<char, vector<int>> m;
rep(i, sz(s)) {
m[s[i]].pb(i + 1);
}
for(auto it: m) {
vector<int> v = it.second;
for(int i = 0; i < v.size() - 1; i++) {
if (v[i + 1] - v[i] <= 2) {
cout << v[i] << ' ' << v[i + 1];
return;
}
}
}
cout << "-1 -1";
}
int main(){
OP
int t = 1;
for(int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| 0
| 27,022,113
|
#include<iostream>
typedef struct{
char c;
int i;
}card;
void BubbleSort(card*, int);
void SelectionSort(card*, int);
int main(){
int i, N, flag;
std::cin >> N;
card B[N],S[N];
for(i=0; i<N; i++){
std::cin >> B[i].c >> B[i].i;
S[i] = B[i];
}
BubbleSort(B, N);
SelectionSort(S, N);
bool boo=true;
for(i=0,flag=1; i<N&&boo==true; i++)
if(B[i].c != S[i].c) boo = false;
std::cout << (boo ? "Stable\n" : "Not stable\n");
return 0;
}
void BubbleSort(card *B, int N){
card tmp;
for(int i=0; i<N-1; i++) for(int j=N-1; j>i; j--) if(B[j].i < B[j-1].i) tmp = B[j], B[j] = B[j-1], B[j-1] = tmp;
for(int i=0; i<N; i++) std::cout << B[i].c << B[i].i << (i < N-1 ? " " : "\n");
std::cout << "Stable\n";
}
void SelectionSort(card *S, int N){
card tmp;
for(int i=0,min; i<N-1; i++){
min = i;
for(int j=i; j<N; j++) if(S[j].i < S[min].i) min = j;
tmp = S[i], S[i] = S[min], S[min] = tmp;
}
for(int i=0; i<N; i++) std::cout << S[i].c << S[i].i << (i < N-1 ? " " : "\n");
}
|
#include<iostream>
#include<cstdio>
int main(){
int a,b,c,d,e;
std::scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
int flag = 0,temp;
do{
flag = 0;
if(a<b){
temp = a;
a = b;
b = temp;
flag = 1;
}
if(b<c){
temp = b;
b = c;
c = temp;
flag = 1;
}
if(c<d){
temp = c;
c = d;
d = temp;
flag = 1;
}
if(d<e){
temp = d;
d = e;
e = temp;
flag = 1;
}
}while(flag);
std::printf("%d %d %d %d %d\n",a,b,c,d,e);
}
| 0
| 9,777,816
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
const ll MOD = 998244353;
int main() {
int n;
cin >> n;
vector<ll> as(n);
rep(i, n) cin >> as[i];
sort(all(as));
ll tot = 0;
int lc = 0;
rep(i, n-1) {
tot += as[i];
if (2*tot < as[i+1]) lc = i+1;
}
int ret = n - lc;
cout << ret << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
#define P pair<int, int>
#define Pl pair<ll, ll>
#define dvec vector<vector<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;}
ll INF = 1e+18;
int iINF = 1e9;
int main()
{
string S; cin >> S;
reverse(S.begin(), S.end());
int sz = S.size(); --sz;
int index = 0;
while(index < sz){
if(S[index] == 'm'){
if(S.substr(index, 5) == "maerd") index += 5;
else { cout << "NO" << endl; return 0;};
} else if(S[index] == 'r'){
if(S[index + 2] == 'm'){
if(S.substr(index, 7) == "remaerd") index += 7;
else {cout << "NO" << endl;return 0;}
} else if(S[index + 2] == 's'){
if(S.substr(index, 6) == "resare") index += 6;
else {cout << "NO" << endl;return 0;}
} else {cout << "NO" << endl;return 0;}
} else if(S[index] == 'e'){
if(S.substr(index, 5) == "esare") index += 5;
else {cout << "NO" << endl;return 0;}
} else { cout << "NO" << endl;return 0;}
}
cout << "YES" << endl;
}
| 0
| 4,100,481
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
int main(){
ll n;
cin >> n;
cout << 8 - (n-400)/200 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);}
int sgn(const double&a,const double&b){return sgn(a-b);}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b;
double c;
cin>>a>>c;
b=round(c*100);
puta(a*b/100);
}
| 0
| 85,646,443
|
#include <iostream>
#include <string>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n;
string f[100];
int main() {
int i;
while (cin >> n) {
if (!n) break;
rep(i, n) cin >> f[i];
int ans = 0;
for (i = 0; i + 1 < n; i += 2) {
if (f[i][0] != f[i + 1][0]) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
int i=0;
vector<pair<int,int>>vp;
while(i<v.size()){
int prev=v[i];
int count=0;
while((i<n)&&(prev==v[i]))
{
i++;
count++;
}
vp.push_back({count,prev});
}
sort(vp.begin(),vp.end());
int count=0;
for(auto it=vp.rbegin();it!=vp.rend();it++)
{
if(k>0)
count+=it->first;
else
break;
k--;
}
cout<<n-count;
}
| 0
| 70,697,109
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
int mod(int A, int M) {return (A % M + M) % M;}
const int INF = 1LL << 60;
template <class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template <class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
int divCeil(int A, int B) {return (A + (B - 1)) / B;}
int myctoi(char C) {return C - 48;}
char myitoc(int N) {return '0' + N;}
template <class A> class unionfind
{
public:
vector<int> parent;
vector<int> rank;
vector<A> diffw;
unionfind(int N, A U = 0)
{
parent = vector<int>(N, -1);
rank = vector<int>(N, 0);
diffw = vector<A>(N, U);
}
int root(int X)
{
if (parent.at(X) < 0) return X;
int R = root(parent.at(X));
diffw.at(X) += diffw.at(parent.at(X));
return parent.at(X) = R;
}
int size(int X)
{
return -parent.at(root(X));
}
A weight(int X)
{
root(X);
return diffw.at(X);
}
A diff(int X, int Y)
{
return weight(Y) - weight(X);
}
bool same(int X, int Y)
{
return (root(X) == root(Y));
}
bool unite(int X, int Y, A W)
{
W += weight(X);
W -= weight(Y);
X = root(X);
Y = root(Y);
if (X == Y) return false;
if (rank.at(X) < rank.at(Y))
{
swap(X, Y);
W = -W;
}
if (rank.at(X) == rank.at(Y)) rank.at(X)++;
parent.at(X) += parent.at(Y);
parent.at(Y) = X;
diffw.at(Y) = W;
return true;
}
};
signed main()
{
int N, M;
cin >> N >> M;
unionfind<int> uf(N);
for (int i = 0; i < M; i++)
{
int L, R, D;
cin >> L >> R >> D;
L--; R--;
if (uf.same(L, R))
{
if (abs(uf.diff(L, R)) != D)
{
cout << "No" << endl;
return 0;
}
}
else
uf.unite(L, R, D);
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> a(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> a.at(i).at(j);
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (a.at(i).at(j) == '#') {
break;
}
else if (j == W - 1) {
for (int k = 0; k < W; k++) {
a.at(i).at(k) = '%';
}
}
}
}
for (int i = 0; i < W; i++) {
for (int j = 0; j < H; j++) {
if (a.at(j).at(i) == '#') {
break;
}
else if (j == H - 1) {
for (int k = 0; k < H; k++) {
a.at(k).at(i) = '%';
}
}
}
}
for (int i = 0; i < H; i++) {
int A = 0;
for (int j = 0; j < W; j++) {
if (a.at(i).at(j) != '%') {
cout << a.at(i).at(j);
A = 1;
}
}
if (A == 1) {
cout << endl;
}
}
}
| 0
| 60,289,246
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
#include <math.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ll long long
using namespace std;
int n,k;
int kansu(int x){
int count=0;
while(x<k){
x*=2;
count++;
}
return count;
}
int main(){
cin>>n>>k;
int i=1;
vector<int>a(n,0);
while(i<k&&i<=n){
a[i-1]=kansu(i);
i++;
}
double ans=0;
rep(i,n)ans+=(double)(1/pow(2,a[i]));
cout<<fixed<<setprecision(10)<<ans/n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
long long x = min(a, k);
a -= x;
k -= x;
x = min(b, k);
b -= x;
cout << a << " " << b;
return 0;
}
| 0
| 77,802,118
|
#include <algorithm>
#include <utility>
#include <cstdio>
#include <map>
using ll = long long;
int fa[100005], sz[100005];
ll arr[100005], val[100005];
std::pair<ll, int> app[100005];
std::map<ll, int> idx;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%lld", arr + i);
idx[arr[i]] = i;
app[i] = {arr[i], i};
sz[i] = 1;
}
std::sort(app, app + n);
for (int i = n - 1; i; i--)
{
int u = app[i].second;
ll dt = n - sz[u] * 2;
if (dt <= 0 || !idx.count(arr[u] - dt))
{
puts("-1");
return 0;
}
fa[u] = idx[arr[u] - dt];
sz[fa[u]] += sz[u];
val[fa[u]] += val[u] + sz[u];
}
if (val[app[0].second] != arr[app[0].second])
{
puts("-1");
return 0;
}
for (int i = n - 1; i; i--)
{
int u = app[i].second;
printf("%d %d\n", fa[u] + 1, u + 1);
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> ship(n);
for(int i = 0; i < m; i++){
int a, b;
std::cin >> a >> b;
a--; b--;
ship[a].push_back(b);
ship[b].push_back(a);
}
int now = 0;
for(int i = 0; i < ship[now].size(); i++){
int next = ship[now][i];
for(int j = 0; j < ship[next].size(); j++){
int target = ship[next][j];
if(target == n - 1){
std::cout << "POSSIBLE" << std::endl;
return 0;
}
}
}
std::cout << "IMPOSSIBLE" << std::endl;
return 0;
}
| 0
| 100,446,705
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string table[]={"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
char str[1280];
int a;
cin>>a;
for(int i=0;i<a;i++){
cin>>str;
int r=0;
char now='0';
for(int i=0;str[i];i++){
if(now!=str[i]){
if(now!='0'){
cout<<table[now-'0'][(r-1)%table[now-'0'].size()];
}
r=1;
now=str[i];
}else r++;
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#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 ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
int main() {
int N;
cin >> N;
ll A[N];
REP(i, N){
cin >> A[i];
}
sort(A, A+N);
ll res = gcd(A[0], A[1]);
FOR(i, 2, N-1){
res = gcd(res, A[i]);
if(res == 1){
break;
}
}
cout << res << endl;
}
| 0
| 35,098,941
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N;
cin >> N;
string s, t;
cin >> s >> t;
if (s == t) {
cout << N << endl;
return 0;
}
ll cnt = 0;
rep(i, 0, N) {
if (s.substr(N-1-i, i+1) == t.substr(0, i+1)) {
chmax(cnt, i+1);
}
}
cout << 2*N - cnt << endl;
}
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define mp make_pair
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-5;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vector<vector<int>> G;
vector<int> c,vis,s;
int main(){
int n;cin>>n;
G.resize(n);
c.resize(n);
vis.resize(n);
s.resize(n);
for(int i=0;i<n-1;i++){
int u,v;cin>>u>>v;--u;--v;
G[u].push_back(v);
G[v].push_back(u);
c[u]++;c[v]++;
}
stack<int> st;
for(int i=0;i<n;i++){
if(c[i]==1){
st.push(i);
}
}
while(!st.empty()){
int v=st.top();st.pop();
if(vis[v])continue;
vis[v]=1;
int to=-1;
for(auto e:G[v]){
if(!vis[e]){
to=e;
}
}
if(to==-1)continue;
s[v]=1;
c[to]--;
s[to]=1;
vis[to]=1;
for(auto e:G[to]){
if(!vis[e]){
c[e]--;
if(c[e]==1){
st.push(e);
}
}
}
}
bool res=false;
for(int i=0;i<n;i++){
if(s[i]==0)res=true;
}
if(res){
cout<<"First"<<endl;
}else{
cout<<"Second"<<endl;
}
}
| 0
| 4,091,203
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin >> n >> m;
vector<pair<long long,long long>> v;
for(int i=0;i<n;i++){
long long a,b;
cin >> a >> b; v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
long long purchaseNum = m;
long long sum = 0;
for(int i=0;i<n;i++){
if(purchaseNum>=v[i].second)
sum += v[i].first*v[i].second;
else sum += v[i].first*purchaseNum; purchaseNum -= v[i].second; if(purchaseNum<=0)
break; }
cout << sum << endl;
return 0; }
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200002
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 1000000000
#define MOD 1000000007
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
int a[33] = {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 n;
cin >> n;
cout << a[n-1] << endl;
return 0;
}
| 0
| 95,163,815
|
#include<iostream>
int a,b,c;
int n=0;
int main(){
std::cin>>a>>b>>c;
for(int i=a;i<=b;++i){
if(c%i==0)n+=1;
}
std::cout<<n<<std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
char s[50][50];
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin >> s[i][j];
}
}
bool flg = true;
int cnt =0;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(s[i][j] == '.') continue;
cnt = 0;
for(int k=0; k<4; k++){
int ni = i + dx[k];
int nj = j + dy[k];
if (ni < 0 || h <= ni) continue;
if (nj < 0 || w <= nj) continue;
if(s[ni][nj] == '#') cnt++;
}
if(cnt == 0){
flg = false; break;
}
}
}
if(flg) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 56,600,177
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define eb emplace_back
#define pi pair<int,int>
#define vp vector<pair<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod=1e9+7;
const string sp=" ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(12);
}
signed main(){
init();
run();
return 0;
}
void run(){
int n,m;
cin>>n>>m;
vi a(m);
rep(i,m)cin>>a[i];
int ans=n-accumulate(all(a),0ll);
if(ans<0)ans=-1;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
long long dp[100010];
long long h[100010];
template<class T> 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;
}
}
int main() {
int n; cin >> n;
int m; cin >> m;
for (int i = 0; i < 100010; i++) {
dp[i] = -1;
}
int a[100010];
for (int i = 0; i < m; i++) {
cin >> a[i];
dp[a[i]] = -10;
}
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (dp[i] == -10) continue;
if (i == 1) dp[1] = 1;
if (dp[i-1]==-10 && dp[i-2]==-10) {
cout << 0 << endl;
return 0;
}
else if (dp[i-1] == -10) {
dp[i] = dp[i-2];
}
else if (dp[i-2] == -10) {
dp[i] = dp[i-1];
}
else dp[i] = (dp[i-1]+dp[i-2])%1000000007;
}
cout << dp[n] << endl;
}
| 0
| 20,064,325
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main() {
int K;
cin >> K;
if (K < 10) {
cout << K << endl;
return 0;
}
vector<vector<int64>> v(10);
for (int i = 1; i < 10; i++) {
v[0].push_back(i);
}
debug(v);
for (int i = 1; i < 10; i++) {
for (int j = 0; j < v[i - 1].size(); j++) {
int last_keta = v[i - 1][j] % 10;
if (last_keta == 0) {
v[i].push_back(v[i - 1][j] * 10 + 0);
v[i].push_back(v[i - 1][j] * 10 + 1);
} else if (last_keta == 9) {
v[i].push_back(v[i - 1][j] * 10 + 8);
v[i].push_back(v[i - 1][j] * 10 + 9);
} else {
v[i].push_back(v[i - 1][j] * 10 + last_keta - 1);
v[i].push_back(v[i - 1][j] * 10 + last_keta);
v[i].push_back(v[i - 1][j] * 10 + last_keta + 1);
}
}
}
int64 sum = 0;
int keta = 0;
int banme = 0;
for (int i = 0; i < 10; i++) {
sum += v[i].size();
if (sum >= K) {
keta = i;
banme = v[i].size() - (sum - K) - 1;
break;
}
}
sort(v[keta].begin(), v[keta].end());
cout << v[keta][banme] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class card{
public:
int N;
vector<int> value;
vector<char> cha;
vector<string> init_array;
vector<string> array;
vector<string> Barray;
vector<string> Sarray;
void set(void){
cin >> N;
value.resize(N);
cha.resize(N);
init_array.resize(N);
array.resize(N);
Barray.resize(N);
Sarray.resize(N);
for(int i=0; i<N; i++){
cin >> init_array[i];
Barray[i] = init_array[i];
Sarray[i] = init_array[i];
}
}
void init(void){
for(int i=0; i<N; i++){
array[i] = init_array[i];
value[i] = array[i][1]-'0';
cha[i] = array[i][0];
}
}
void BubbleSort(void){
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(value[j]<value[j-1]){
swap(value[j],value[j-1]);
swap(Barray[j],Barray[j-1]);
}
}
}
for(int i=0; i<N; i++)
cout << Barray[i] << (i<N-1?" ":"");
cout << endl;
cout << "Stable" << endl;
}
void SelectionSort(void){
for(int i=0; i<N; i++){
bool flag = false;
int minj = i;
for(int j=i; j<N; j++){
if(value[j]<value[minj]){
minj = j;
flag=true;
}
}
if(flag==true){
swap(value[i],value[minj]);
swap(Sarray[i],Sarray[minj]);
}
}
for(int i=0; i<N; i++)
cout << Sarray[i] << (i<N-1?" ":"");
cout << endl;
}
void isStable(void){
for(int i=0;i<N;i++){
if(Barray[i]!=Sarray[i]){
cout << "Not stable" << endl;
return;
}
}
cout << "Stable" << endl;
return;
}
};
int main(){
card c1;
c1.set();
c1.init();
c1.BubbleSort();
c1.init();
c1.SelectionSort();
c1.isStable();
return 0;
}
| 0
| 87,664,040
|
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 1000000;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
int main() {
ll M, K;
cin >> M >> K;
ll a[MAX];
ll N = pow(2, M);
if (M == 0) {
if (K == 0) { cout << "0 0"; }
else { cout << "-1"; }
}
else if (M == 1) {
if (K == 0) { cout << "0 0 1 1"; }
else { cout << "-1"; }
}
else if (K >= N) { cout << -1; }
else {
rep(i, N) {
if (i != K) { cout << i<<" "; }
}
cout << K <<" ";
rep(i, N) {
if (N - 1 - i != K) { cout << N - 1 - i << " "; }
}
cout << K;
}
system("PAUSE");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll N;
ll D[100010];
ll sz[100010];
vector<int> ord;
vector<int> g[100010];
vector<P> res;
map<ll,int> idx;
ll dfs(int v){
ll sum=0;
for(int nv : g[v]){
sum+=dfs(nv)+sz[nv];
}
return sum;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>N;
rep(i,N){
cin>>D[i];
ord.push_back(i);
sz[i]=1;
idx[D[i]]=i;
}
sort(all(ord),[=](const int& a,const int& b){ return D[a] > D[b];});
rep(j,ord.size()-1){
int i=ord[j];
ll nsz=D[i]+2*sz[i]-N;
if(idx.find(nsz)==idx.end()){
cout<<-1<<endl;
return 0;
}
int nxt=idx[nsz];
sz[nxt]+=sz[i]; res.push_back(P(nxt,i)); g[nxt].push_back(i);
}
if(sz[ord.back()]!=N){
cout<<-1<<endl;
return 0;
}
if(dfs(ord.back())!=D[ord.back()]){
cout<<-1<<endl;
return 0;
}
rep(i,res.size())cout<<res[i].fi+1<<" "<<res[i].se+1<<endl;
return 0;
}
| 0
| 80,548,336
|
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll K, A, B, ans;
cin >> K >> A >> B;
if (A + 2 >= B || K < A) {
ans = K + 1;
} else {
K -= A - 1;
ans = A + (B - A) * (K / 2) + K % 2;
}
cout << ans << endl;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 200005;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin >> n >> m;
vector<bool> ac(n,0);
vector<ll> p(n,0);
ll a;
string s;
rep(i,m){
cin >> a >> s;
if (s == "AC") ac[a-1] = 1;
else{
if (!ac[a-1]) p[a-1]++;
}
}
ll b = 0,c = 0;
rep(i,n){
if (ac[i]){
b++;
c += p[i];
}
}
cout << b << " " << c << endl;
}
| 0
| 47,686,371
|
#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;
string S;
cin>>S;
if(S.at(0)=='W' || S.at(2*N-1)=='W'){
cout<<0<<endl;return 0;
}
vector<int> fro(2*N),bac(0);
rep(i,2*N){
if(i%2==0){
if(S.at(i)=='B'){fro.at(i)=1;}
else{bac.pb(i);}
}
else{
if(S.at(i)=='W'){fro.at(i)=1;}
else{bac.pb(i);}
}
}
if(bac.size()!=N){
cout<<0<<endl;return 0;
}
ll count=0;
ll ans=1;
for(int i=2*N-1;i>=0;i--){
if(fro.at(i)){
ans*=bac.end()-lower_bound(bac.begin(),bac.end(),i)-count;
ans%=MOD;
count++;
}
}
rep(i,N){
ans*=i+1;
ans%=MOD;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)
#define endl '\n'
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
constexpr i32 mod = 1e9 + 7;
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;
constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;
template <typename T = i64> T input() { T x; cin >> x; return x; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solver() {
int N = input(), M = input();
int X = input(), Y = input();
vector< int > x(N), y(M);
cin >> x >> y;
x.push_back(X);
y.push_back(Y);
whole(sort, x);
whole(sort, y);
cout << (x.back() < y.front() ? "No War" : "War") << endl;
}
signed main(int argc, char *argv[]) {
solver();
}
| 0
| 37,610,771
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define bitcnt(x) __builtin_popcount(x)
#define fst first
#define snd second
#define Pqaz(T) priority_queue<T,vector<T>,greater<T>>
#define Pqza(T) priority_queue<T>
#define ENJYU std::ios::sync_with_stdio(false);std::cin.tie(0);
typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
const int MAX = 128;
vector <int> adj[MAX];
int d[MAX];
void solve(void){
ENJYU;
int N;
cin >> N;
rep(N, i) {
int u, k;
cin >> u >> k;
u--;
rep(k, i) {
int v;
cin >> v;
v--;
adj[u].pb(v);
}
}
memset(d, -1, sizeof(d));
queue <int> q;
q.push(0);
d[0] = 0;
while (!q.empty()) {
int n = q.front();
q.pop();
for (int nv : adj[n]) {
if (d[nv] >= 0) {
continue;
}
d[nv] = d[n] + 1;
q.push(nv);
}
}
rep(N, i) cout << i+1 << ' ' << d[i] << endl;
}
int main(void){
solve();
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
typedef long long ll;
const ll inf = 4e18;
const ll mod = 1e9+7;
#define print(X) cout << X << endl
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (ll (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (ll (i) = (m); (i) < (n); ++(i))
#define repd(i, m, n) for (ll (i) = (m); (i) > (n); --(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
template <class T>
string join(const vector<T>& v, const char* delim = 0) {
string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim) s += delim;
s += v[i];
}
}
return s;
}
int main(void)
{
ll A,B;
ll N=100;
cin >> A >> B;
vec<vec<char>> s(N, vec<char>(N, '#'));
rep (y,N/2) {
rep (x,N) {
s[y][x] = '.';
}
}
repp (y,N/2,N) {
rep (x,N) {
s[y][x] = '#';
}
}
A -= 1;
B -= 1;
ll x, y;
x = 0;
y = 0;
while (B--) {
s[y][x] = '#';
x+=2;
if (x>=N) {
x=0;
y+=2;
}
}
x = 0;
y = N-1;
while (A--) {
s[y][x] = '.';
x+=2;
if (x>=N) {
x=0;
y-=2;
}
}
print(N<<" "<<N);
rep(y,N) {
print(join(s[y]));
}
}
| 0
| 82,069,869
|
#include<iostream>
using namespace std;
#define ll long long
int main(){
ll n, u, k, v;
cin >> n;
ll A[n][n];
for (ll i=0; i<n; i++){
for(ll j=0; j<n; j++){
A[i][j] = 0;
}
}
for(ll i=0; i<n; i++){
cin >> u;
cin >> k;
for(ll j=0; j<k; j++){
cin >> v;
A[u-1][v-1] = 1;
}
}
for (ll i=0; i<n; i++){
for(ll j=0; j<n; j++){
cout << A[i][j];
if(j<n-1){
cout << ' ';
}
}
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1000000007;
int main(){
int n;
cin>>n;
double sum=0;
rep(i,n){
double x;
string u;
cin>>x>>u;
if(u=="JPY") sum+=x;
else sum+=x*380000;
}
cout<<fixed<<setprecision(10)<<sum<<endl;
return 0;
}
| 0
| 58,116,840
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int S;
cin >> S;
int A = S;
int count = 0;
for(int i = 1; i <= A; i++){
if(i < 10){
count++;
}
else if(i >= 100 && i < 1000){
count++;
}
else if(i >= 10000 && i < 100000){
count++;
}
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef pair<int,int> II;
typedef vector< II > VII;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef long long int LL;
typedef vector<LL> VL;
#define si(n) cin>>n
#define dout(n) cout<<n<<"\n"
#define DRT() int t; si(t); while(t--)
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
void IO(){
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
srand(chrono::steady_clock::now().time_since_epoch().count());
off;
}
LL gcd(LL a, LL b){
return b == 0 ? a : gcd(b, a % b);
}
int main(){
IO();
LL a,b,c,d;
cin>>a>>b>>c>>d;
a--;
if(d > c)
swap(c,d);
LL g = gcd(c,d);
LL l = (c*d)/g;
LL ans = b/c - a/c + b/d - a/d - b/(l) + a/(l);
ans = (b-a) - ans;
cout<<ans;
return 0;
}
| 0
| 33,350,231
|
#include<stdio.h>
int d,s;
int main(){
while(scanf("%d",&d)!=EOF){
s=0;
for(int i=d;i<600;i+=d){
s+=i*i*d;
}
printf("%d\n",s);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string s;
cin >> s;
ll ans = 0;
ll hd = 0, bk = s.size()-1;
while(bk - hd > 0){
if(s[hd] == s[bk]){
hd++;
bk--;
}else{
if(s[hd] != 'x' && s[bk] != 'x'){
cout << -1 << endl;
return 0;
}
if(s[hd] == 'x'){
ans++;
hd++;
}
if(s[bk] == 'x'){
ans++;
bk--;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 2,501,208
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
void COMinit() {
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 Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
for(ll i=0;i<v.size();i++) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
for(ll i=0;i<s.size()-1;i++){
if(s[i]==s[i+1]){
x++;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll 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 modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n,m;
cin>>n>>m;
vector<vector<ll>> v(n,vector<ll>(3));
rep(i,n) rep(j,3) cin>>v[i][j];
ll ans=0;
rep(i,1LL<<3){
vector<ll> w;
rep(j,n){
ll tmp=0;
rep(k,3){
if(i&1<<k){
tmp+=v[j][k];
}else{
tmp-=v[j][k];
}
}
w.push_back(tmp);
}
sort(ALL(w),greater<ll>());
ll tmp=0;
rep(i,m){
tmp+=w[i];
}
chmax(ans,tmp);
}
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;
vector<int> sim(vector<int> vec,int n){
vector<int> new_vec(n,0);
rep(i,n){
int l = max(0,i-vec[i]);
int r = min(n-1,i+vec[i]);
new_vec[l]++;
if(r+1<n) new_vec[r+1]--;
}
REP(i,n-1) new_vec[i]+=new_vec[i-1];
return new_vec;
}
int main(){
int n,k;
cin>>n>>k;
vector<int> vec(n);
rep(i,n) cin>>vec[i];
int lim = min(k,50);
rep(i,lim){
vec = sim(vec,n);
}
rep(i,n){
cout<<vec[i]<<" ";
}
cout<<endl;
return 0;
}
| 0
| 66,841,410
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n; cin >> n;
vl num(n); vl numd(n);
rep(i,n){
cin >> num[i];
numd[i] = num[i];
}
sort(all(num));
rep(i,n){
if(numd[i] == num[n-1]) cout << num[n-2] << endl;
else cout << num[n-1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
while(y){
if(y%2){res=res*tmp%MOD;}
y>>=1;
tmp=tmp*tmp%MOD;
}
return res;
}
ll nature(ll a){
if(a>=0){return(a);}
else{return(-1*a);}
}
ll prime(ll a){
if(a==2){return 1;}
else if(a%2==0 || a==1){return 0;}
for(ll i=3;i*i<=a;i+=2){if(a%i==0){return 0;}}
return 1;
}
int main(){
string S;
cin>>S;
if(S=="zyxwvutsrqponmlkjihgfedcba"){cout<<-1<<endl;}
else if(S.size()==26){
ll maxcharacter=S.at(25);
ll rock;
for(ll i=0;i<25;i++){
if(S.at(24-i)<maxcharacter){
for(ll j=0;j<24-i;j++){cout<<S.at(j);}
rock=24-i;
unordered_map<ll,ll> mp;
for(ll i=0;i<rock;i++){
mp[S.at(i)]++;
}
char start=S.at(rock)+1;
while(mp[start]>0){start++;}
cout<<start<<endl;
return 0;
}
else{maxcharacter=S.at(24-i);}
}
}
else{
unordered_map<ll,ll> mp;
for(ll i=0;i<(ll)S.size();i++){
mp[S.at(i)]++;
}
cout<<S;
if(mp['a']==0){cout<<"a"<<endl;return 0;}
if(mp['b']==0){cout<<"b"<<endl;return 0;}
if(mp['c']==0){cout<<"c"<<endl;return 0;}
if(mp['d']==0){cout<<"d"<<endl;return 0;}
if(mp['e']==0){cout<<"e"<<endl;return 0;}
if(mp['f']==0){cout<<"f"<<endl;return 0;}
if(mp['g']==0){cout<<"g"<<endl;return 0;}
if(mp['h']==0){cout<<"h"<<endl;return 0;}
if(mp['i']==0){cout<<"i"<<endl;return 0;}
if(mp['j']==0){cout<<"j"<<endl;return 0;}
if(mp['k']==0){cout<<"k"<<endl;return 0;}
if(mp['l']==0){cout<<"l"<<endl;return 0;}
if(mp['m']==0){cout<<"m"<<endl;return 0;}
if(mp['n']==0){cout<<"n"<<endl;return 0;}
if(mp['o']==0){cout<<"o"<<endl;return 0;}
if(mp['p']==0){cout<<"p"<<endl;return 0;}
if(mp['q']==0){cout<<"q"<<endl;return 0;}
if(mp['r']==0){cout<<"r"<<endl;return 0;}
if(mp['s']==0){cout<<"s"<<endl;return 0;}
if(mp['t']==0){cout<<"u"<<endl;return 0;}
if(mp['u']==0){cout<<"u"<<endl;return 0;}
if(mp['v']==0){cout<<"v"<<endl;return 0;}
if(mp['w']==0){cout<<"w"<<endl;return 0;}
if(mp['x']==0){cout<<"x"<<endl;return 0;}
if(mp['y']==0){cout<<"y"<<endl;return 0;}
if(mp['z']==0){cout<<"z"<<endl;return 0;}
}
}
| 0
| 82,227,768
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#define _GLIBCXX_DEBUG
#define DIVISOR 1000000007
using namespace std;
typedef pair<int,int> pii;
typedef pair<int64_t, int64_t> pII;
template<typename T>
void cins(vector<T>& arr) { for(T& e: arr) cin >> e; }
#ifdef DEBUG
#define debug(fmt, ...) \
printf("[debug: %s] " fmt, __func__, __VA_ARGS__)
#define ps(arr) \
debug("size %ld: ", arr.size()); \
for(auto e: arr) cout << e << " "; \
cout << endl;
#else
#define debug(fmt, ...)
#define ps(arr)
#endif
int main(void) {
int num; int sum;
cin >> num >> sum;
vector<int> ans(3, -1);
for(int i = 0; i <= num; i++) {
for(int j = 0; j <= num-i; j++) {
int k = num - i - j;
if(k < 0) continue;
int money = i * 10000 + j * 5000 + k * 1000;
if(money == sum) {
ans[0] = i; ans[1] = j; ans[2] = k;
goto finish;
}
}
}
finish:
for(auto e: ans) cout << e << " ";
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N,M; cin>>N>>M;
vii A(N,vi(N,INF));
rep(i,0,M){
int X,Y,Z; cin>>X>>Y>>Z;
A[X-1][Y-1]=Z;
A[Y-1][X-1]=Z;
}
vector<vector<bool>> F(N,vector<bool>(N));
rep(i,0,N){
vi memo(N);
memo[i]=-1;
priority_queue<pii,vector<pii>,greater<pii>> Q;
Q.push(mp(0,i));
vi B(N,MOD);
B[i]=0;
while(Q.size()>0){
int X=Q.top().second,Y=Q.top().first;
Q.pop();
rep(j,0,N){
if(B[j]>Y+A[X][j]){
B[j]=Y+A[X][j];
Q.push(mp(Y+A[X][j],j));
memo[j]=X;
}
}
}
rep(i,0,N){
int P=i;
while(memo[P]!=-1){
F[P][memo[P]]=1;
P=memo[P];
}
}
}
int ans=0;
rep(i,0,N){
rep(j,0,N){
if(F[i][j])
ans++;
}
}
cout<<M-ans/2<<endl;
}
| 0
| 47,653,977
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll, ll>;
ll n;
int main() {
vector<ll> v(4);
rep (i, 4) {
cin >> v[i];
}
cin >> n;
n *= 4;
vector<ll> want(4, 0);
vector<P> vperL(4);
rep (i, 4) {
vperL[i] = make_pair(v[i] * 12 / pow(2, i), i);
}
ll ans = 0;
sort(vperL.begin(), vperL.end());
rep (i, 4) {
ans += (n/(ll)pow(2, vperL[i].second)) * v[vperL[i].second];
n %= (ll)pow(2, vperL[i].second);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> num(100000,0);
for(int i = 0; i < N; i++){
num.at(vec.at(i))++;
}
int ma = 0;
for(int i = 2; i < 100000; i++){
ma = max(num.at(i-2) + num.at(i-1) + num.at(i), ma);
}
cout << ma << endl;
}
| 0
| 72,691,227
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, int> LP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
vector<bool> b(n, false);
b[0] = true;
rep(i,n){
cin >> a[i];
--a[i];
}
int cur = 0, cnt = 0;
while(true){
if(cur == 1){
cout << cnt << endl;
return 0;
}
cur = a[cur];
if(b[cur]){
cout << -1 << endl;
return 0;
}
b[cur] = true;
++cnt;
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define multiCase int T;cin>>T;for(int t=1;t<=T;t++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repp(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define perr(i,a,b) for(int i=(a);i>(b);i--)
#define pb push_back
#define eb emplace_back
#define mst(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const double eps=1e-12;
const double PI=acos(-1.0);
const double angcst=PI/180.0;
const ll mod=998244353;
ll max_3(ll a,ll b,ll c){if(a>b&&a>c)return a;if(b>c)return b;return c;}
ll min_3(ll a,ll b,ll c){if(a<b&&a<c)return a;if(b<c)return b;return c;}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll qmul(ll a,ll b){ll r=0;while(b){if(b&1)r=(r+a)%mod;b>>=1;a=(a+a)%mod;}return r;}
ll qpow(ll a,ll n){ll r=1;while(n){if(n&1)r=(r*a)%mod;n>>=1;a=(a*a)%mod;}return r;}
ll qpow(ll a,ll n,ll p){ll r=1;while(n){if(n&1)r=(r*a)%p;n>>=1;a=(a*a)%p;}return r;}
void solve()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(max(a*c,a*d),max(b*c,b*d))<<'\n';
}
int main()
{
closeSync;
{
solve();
}
return 0;
}
| 0
| 23,745,942
|
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
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(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int 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>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> 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;
}
int main(){
ll N,A,B;
cin >> N >> A >> B;
if(abs(A-B)%2==0){
cout << "Alice" << endl;
}
else{
cout << "Borys" << endl;
}
}
|
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod = 1e9+7;
using P = pair<int, int>;
using ll = long long;
vector<int> to[100005];
int cost[100005];
signed main(){
int n;
cin >>n;
vector<int> h(n,0);
int ma = 0;
int ans = 0;
rep(i,n) {
cin >> h[i];
if(h[i]>=ma) {
ans++;
ma = h[i];
}
}
cout << ans << endl;
return 0;
}
| 0
| 39,802,873
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t A, B, C, D, c, d, cd;
cin >> A >> B >> C >> D;
c = (B / C) - (A - 1) / C;
d = (B / D) - (A - 1) / D;
cd = (B / lcm(C, D)) - (A - 1) / lcm(C, D);
cout << (B - (A - 1)) - c - d + cd << endl;
}
|
#include<iostream>
using namespace std;
bool flag;
int w,h,x,y,r;
char ans[2][10]={
"No",
"Yes"
};
int solve(){
if(x<=0||y<=0)return flag=0;
if(r>h-r||r>w-r)return flag=0;
if(x>=r&&x<=w-r){
if(y>=r&&y<=h-r)return flag=1;
}
return flag=0;
}
int main()
{
flag=0;
cin>>w>>h>>x>>y>>r;
solve();
cout<<ans[flag]<<endl;
}
| 0
| 52,388,152
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);};
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int N; cin>>N;
vector<vector<char> > vvec (N,vector<char>(N,0));
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
cin>>vvec[i][j];
}
}
int ANS = 0;
for (int w = 0; w < N; w++)
{
int check = 1;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
if(vvec[i][(j+w)%N] != vvec[j][(i+w)%N])check = 0;
}
}
if(check == 1) ANS++;
}
cout<<ANS*N<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
ll A, B, C;
cin >> A >> B >> C;
bool find = false;
if (C % GCD(A, B) == 0)
{
find = true;
}
if (find) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
}
| 0
| 1,678,579
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
string s;cin>>s;
if(s.substr(0,4)=="YAKI")cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long int ull;
const ll MOD=998244353;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e9;
ll N,M,V,P;
ll A[100000];
bool C(int x){
if(x<P) return true;
if(A[x]+M<A[P-1]) return false;
ll sum=0;
sum+=M*P;
sum+=M*(N-1-x);
for(int i=P-1;i<x;i++){
sum+=min(M,A[x]+M-A[i]);
}
return sum>=M*V;
}
int main(){
string a;cin>>a;
ll n=(int)a.size();
vector<ll> cnt(26,0);
for(int i=0;i<n;i++){
cnt[a[i]-'a']++;
}
ll ans=n*(n-1)/2+1;
for(int i=0;i<26;i++){
ans-=cnt[i]*(cnt[i]-1)/2;
}
cout<<ans<<endl;
return 0;
}
| 0
| 41,868,682
|
#include <iostream>
#include <string>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#define N 100000
using namespace std;
typedef struct{
int parent;
vector<int> decent;
int dd;
} Node;
Node node[N];
int d[N];
int dep(int);
void swap(int *,int *);
int main(){
int n,id,k,a;
cin>>n;
for(int i=0;i<n;i++){
node[i].parent=-1;
d[i]=-1;
}
for(int i=0;i<n;i++){
cin>>id>>k;
node[id].dd=k;
for(int j=0;j<k;j++){
cin>>a;
node[a].parent=id;
node[id].decent.push_back(a);
}
}
for(int i=0;i<n;i++){
if(node[i].parent==-1){
d[i]=0;
dep(i);
break;
}
}
for(int i=0;i<n;i++){
printf("node %d: parent = %d, depth = %d, ",i,node[i].parent,d[i]);
if(node[i].parent==-1){
printf("root, [");
for(int j=0;j<node[i].decent.size();j++){
printf("%d",node[i].decent.at(j));
if(j!=node[i].decent.size()-1) printf(", ");
}
printf("]\n");
}else if(node[i].decent.empty()){
printf("leaf, []\n");
}else{
printf("internal node, [");
for(int j=0;j<node[i].decent.size();j++){
printf("%d",node[i].decent.at(j));
if(j!=node[i].decent.size()-1) printf(", ");
}
printf("]\n");
}
}
return 0;
}
int dep(int id){
int in=id;
for(int i=0;i<node[id].decent.size();i++){
in=node[id].decent.at(i);
d[in]=d[id]+1;
dep(in);
}
return 0;
}
void swap(int *a,int *b){
int w=*a;
*a=*b;
*b=w;
}
|
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
int ans=753;
rep(i,n-2){
string m;
m = s.substr(i,3);
ans = min(ans,abs(753-stoi(m)));
}
cout << ans;
return 0;
}
| 0
| 20,285,864
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <complex>
#include <random>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<P> VP;
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RREP(i,n) RFOR(i,0,n)
#define LFOR(i,a,b) for(ll i=(a);i<(b);++i)
#define RLFOR(i,b,a) for(ll i=(b)-1;i>=(a);--i)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define MP make_pair
#define PB push_back
#define EACH(i,c) REP(i,(int)(c).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define dump(x) cerr << "[L " << __LINE__ << "] " << #x << " = " << (x) << "\n";
#define dump2(x,y) cerr << "[L " << __LINE__ << "] " << #x << " = " << (x)\
<< " , " << #y << " = " << (y) << "\n";
const int INF = 1e9;
const double EPS = 1e-10;
const int _N = 2e5;
int n,m;
int sub[1<<26];
int dp[_N];
int state[_N];
int cnt[26];
int main() {
string s;
cin >> s;
n = s.size();
REP(i,n){
cnt[s[i]%26]++;
REP(j,26)
if(cnt[j]%2)
state[i]|=1<<j;
}
REP(i, 1<<26){
sub[i]=INF;
}
dp[0]=1;
sub[state[0]] = dp[0];
sub[0] = 0;
FOR(i, 1, n){
dp[i] = INF;
dp[i] = min(dp[i], sub[state[i]]+1);
REP(j,26){
dp[i] = min(dp[i], sub[state[i]^(1<<j)]+1);
}
sub[state[i]] = min(sub[state[i]], dp[i]);
}
cout << dp[n-1] << endl;
}
|
#include<iostream>
#include<stdio.h>
#include<ios>
#include<cmath>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<assert.h>
#include<bitset>
#include<tuple>
#include<climits>
#include<deque>
#include<utility>
#include<unordered_map>
#include<unordered_set>
#include<iterator>
#include<sstream>
#include<iomanip>
#include<ext/pb_ds/assoc_container.hpp>
#include<chrono>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define int int64_t
#define double long double
#define nitro ios_base::sync_with_stdio(false);cin.tie(0);
#define vi vector<int64_t>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define PI 3.1415926535897932384626433832795
#define read(a) for(auto& x : a) cin>> x
#define endl '\n'
#define gap ' '
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define MOD 1000000007
int32_t main()
{
nitro
int n;cin>>n;
int a[n];read(a);
int i=0,j=n-1,si=0,sj=0;
while(i<=j)
{
if(si<=sj) si+=a[i++];
else if(sj<si) sj+=a[j--];
}
cout<<abs(si-sj);
return 0;
}
| 0
| 6,909,421
|
#include <iostream>
#define MOD 1000000007
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N];
for (long long i = 0; i < N; i++) cin >> A[i];
long long pow_2[61];
for (long long i = 0; i < 61; i++){
if (i == 0) pow_2[i] = 1;
else {
pow_2[i] = pow_2[i - 1] * 2;
}
}
long long count[61];
long long count2[61];
for (long long i = 0; i < 61; i++) count[i] = count2[i] = 0;
for (long long i = 0; i < N; i++){
for (long long j = 0; j < 61; j++){
if (pow_2[60 - j] > A[i]) count[60 - j]++;
else {
count2[60 - j]++;
A[i] -= pow_2[60 - j];
}
}
}
long long res = 0;
for (long long i = 0; i < 61; i++){
long long a = pow_2[i];
a %= MOD;
a *= (count[i] * count2[i]) % MOD;
a %= MOD;
res += a;
res %= MOD;
}
cout << res << endl;
}
|
#include <iostream>
using namespace std;
int main(){
int n,count=0,min;
cin>> n;
int num[n];
for(int i = 0;i <n;i++)
cin>>num[i];
for(int i= 0;i<n;i++){
min = i;
for(int j = i;j<n;j++){
if(num[j]<num[min])
min = j;
}
if(i != min)
count++;
swap(num[i],num[min]);
}
for(int i=0;i<n-1;i++)
cout<<num[i]<<" ";
cout<<num[n-1]<<endl<<count<<endl;
}
| 0
| 544,259
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string s;
cin >> s;
string ans = "";
deque<char> q;
rep(i, s.size())
{
if (s[i] == 'B' && q.size() > 0)
q.pop_back();
if (s[i] == 'B')
continue;
else
q.emplace_back(s[i]);
}
for (auto i : q)
cout << i;
cout << endl;
}
int main(void)
{
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
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 += "}"; return res; }
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__ << "]:", debug_out(__VA_ARGS__)
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int N, K;
cin >> N >> K;
vector<PII> ans;
if (K > ((N - 1) * (N - 2)) / 2) {
cout << "-1\n";
return 0;
}
for (int i = 2; i <= N; i++) {
ans.pb({1, i});
}
int cur = ((N - 1) * (N - 2)) / 2;
for (int i = 2; i <= N - 1; i++) {
for (int j = i + 1; j <= N; j++) {
if (cur <= K) {
break;
}
ans.pb({i, j});
cur--;
}
}
cout << SZ(ans) << "\n";
REP(i, SZ(ans)) {
cout << ans[i].first << " " << ans[i].second << "\n";
}
}
| 0
| 93,833,154
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::istringstream iss(s);
std::string a;
std::string b;
std::string c;
iss >> a >> b >> c;
if (a[a.size() - 1] == b[0] &&
b[b.size() - 1] == c[0])
std::cout << "YES" << std::endl;
else
std::cout << "NO" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;return 1;}return 0;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a = b;return 1;}return 0;}
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
#define int long long
#define double long double
template<typename T>
struct edge {
int to, from;T cost;
edge(int to, T cost) : from(-1), to(to), cost(cost) {}
edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
};
template<typename T>
using edges = vector<edge<T>>;
template<typename T>
using graph = vector<edges<T>>;
template<typename T>
using matrix = vector<vector<T>>;
template<typename T>
bool compByCost(const edge<T>& left, const edge<T>& right){
return left.cost < right.cost;
}
template<typename T>
vector<T> dijkstra(int s, graph<T> &g){
vector<T> dist(g.size()+10, INF);dist[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;que.push(P(0,s));
while(!que.empty()){
P p = que.top();que.pop();
int v = p.second;
if(dist[v] < p.first)continue;
rep(i, g[v].size()){
edge<T> e = g[v][i];
if(dist[e.to] > dist[v] + e.cost){
dist[e.to] = dist[v] + e.cost;
que.push(P(dist[e.to], e.to));
}
}
}
return dist;
}
#define dijkstra dijkstra<int>
int n,l,a[110000];
signed main(){
cin>>n>>l;rep(i,n)cin>>a[i];
rep(i,n-1){
if(a[i]+a[i+1] < l)continue;
cout << "Possible" << endl;
repd(j,1,i+1){
cout << j << endl;
}
rep(j, n-i-1){
cout << n-j-1 << endl;
}
return 0;
}
cout << "Impossible" << endl;
}
| 0
| 4,171,310
|
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define multiCase int T;cin>>T;for(int t=1;t<=T;t++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repp(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define perr(i,a,b) for(int i=(a);i>(b);i--)
#define pb push_back
#define eb emplace_back
#define mst(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const double eps=1e-12;
const double PI=acos(-1.0);
const double angcst=PI/180.0;
const ll mod=1e9+7;
ll max_3(ll a,ll b,ll c){if(a>b&&a>c)return a;if(b>c)return b;return c;}
ll min_3(ll a,ll b,ll c){if(a<b&&a<c)return a;if(b<c)return b;return c;}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll qmul(ll a,ll b){ll r=0;while(b){if(b&1)r=(r+a)%mod;b>>=1;a=(a+a)%mod;}return r;}
ll qpow(ll a,ll n){ll r=1;while(n){if(n&1)r=(r*a)%mod;n>>=1;a=(a*a)%mod;}return r;}
ll qpow(ll a,ll n,ll p){ll r=1;while(n){if(n&1)r=(r*a)%p;n>>=1;a=(a*a)%p;}return r;}
ll dp[2010];
void solve()
{
ll n;
cin>>n;
if(n<3)
{
cout<<0<<'\n';
return;
}
per(i,n-3,0)
{
dp[i]=1;
}
int p=n-3;
while(p>0)
{
per(i,p-3,0)
{
dp[i]=(dp[i]+dp[p])%mod;
}
p--;
}
cout<<dp[0]<<'\n';
}
int main()
{
closeSync;
{
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[4][3][10];
int b,f,r,v,x;
cin >> x;
for(int bb=0;bb<4;bb++){
for(int ff=0;ff<3;ff++){
for(int rr=0;rr<10;rr++){
a[bb][ff][rr]=0;
}
}
}
for(int i=0;i<x;i++){
cin >> b>> f>> r>> v;
a[b-1][f-1][r-1]+=v;
}
for(int bb=0;bb<4;bb++){
for(int ff=0;ff<3;ff++){
for(int rr=0;rr<10;rr++){
cout << " "<< a[bb][ff][rr];
}
cout << '\n';
}
if(bb!=3)cout << "####################" << endl;
}
}
| 0
| 45,879,467
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string N;
cin>>N;
bool ans=true;
for(int i=0;i<3;i++){
if(N.at(i)=='7'){
cout<<"Yes"<<endl;
ans=false;
break;
}
}
if(ans){
cout<<"No"<<endl;
}
}
|
#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, t;
cin>>s>>t;
if(s.length()!=t.length()-1){
cout<<"No\n";
return 0;
}
if(t.substr(0, s.length()) == s){
cout<<"Yes\n";
}
else cout<<"No\n";
}
| 0
| 23,497,887
|
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
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; }
void coY() {cout <<"Yes"<<endl;}
void coN(){cout <<"No"<<endl;}
int main()
{
ll n;
cin >> n;
ll ans = 0;
for(ll i = 2; i * i < n; i++){
ll count = 0;
while(n % i == 0){
n /= i;
count++;
}
ll hiku = 1;
while(1){
count -= hiku;
hiku ++;
if(count >= 0) ans++;
else break;
}
}
if(n != 1) ans++;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue <T, vector<T>, greater<T>>;
template<typename T, typename K> using ump = unordered_map<T, K>;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll e5 = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for(ll i = ll(n - 1); i >= 0; i--)
#define each(i, mp) for(auto& i:mp)
#define eb emplace_back
#define F first
#define S second
#define all(obj) (obj).begin(), (obj).end()
template<class T>
ostream &operator<<(ostream &out, const vector <T> &list) {
ll n = list.size();
rep(i, n) out << list[i] << ' ';
return out;
}
template<class T>
istream &operator>>(istream &in, vector <T> &list) {
ll n = list.size();
rep(i, n) in >> list[i];
return in;
}
template<class T>
ostream &operator<<(ostream &out, const vector <vector<T>> &list) {
ll n = list.size();
rep(i, n) out << list[i] << '\n';
return out;
}
void solve() {
ll n, r;
cin >> n >> r;
if (n >= 10) cout << r << '\n';
else {
cout << r + 100 * (10 - n) << '\n';
}
}
int main() {
#ifdef MY_DEBUG
while (true) {
#endif
solve();
#ifdef MY_DEBUG
}
#endif
return 0;
}
| 0
| 25,228,550
|
#include <stdio.h>
#include <string.h>
#include <math.h>
int mini(int a, int b){
if (a>=b) return b;
else return a;
}
int main ()
{
int c=0, c2=0;
char s[100005];
scanf ("%s", s);
for (int i=1;i<strlen(s);i=i+1) {
if (s[0]=='0') {
if (i%2==1 && s[i]=='0') c++;
else if (i%2==0 && s[i]=='1') c++;
}
else {
if (i%2==1 && s[i]=='1') c++;
else if (i%2==0 && s[i]=='0') c++;
}
}
for (int i=strlen(s)-1;i>=0;i=i-1) {
if (strlen(s)%2==1) {
if (s[strlen(s)-1]=='0') {
if (i%2==1 && s[i]=='0') c2++;
else if (i%2==0 && s[i]=='1') c2++;
}
else {
if (i%2==1 && s[i]=='1') c2++;
else if (i%2==0 && s[i]=='0') c2++;
}
}
else {
if (s[strlen(s)-1]=='0') {
if (i%2==1 && s[i]=='1') c2++;
else if (i%2==0 && s[i]=='0') c2++;
}
else {
if (i%2==1 && s[i]=='0') c2++;
else if (i%2==0 && s[i]=='1') c2++;
}
}
}
printf ("%d", mini(c, c2));
return 0;
}
|
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;++i){
cin >> x[i] >> y[i];
}
long long ans=LLONG_MAX;
for(int xi=0;xi<n;++xi){
for(int xj=0;xj<n;++xj){
if(x[xi]>=x[xj])
continue;
for(int yi=0;yi<n;++yi){
for(int yj=0;yj<n;++yj){
if(y[yi]>=y[yj])
continue;
int count=0;
for(int i=0;i<n;++i){
if(x[xi]<=x[i] && x[i]<=x[xj] && y[yi]<=y[i] && y[i]<=y[yj])
++count;
}
if(count>=k)
ans = min(ans, (long long)(x[xj]-x[xi])*(y[yj]-y[yi]));
}
}
}
}
cout << ans;
return 0;
}
| 0
| 48,634,493
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
ll com(ll n,ll r){
ll ret=1;
for (int i = 0; i < r; ++i) {
ret*=n-i;
}
ll d=1;
for (int i = 0; i < r; ++i) {
d*=i+1;
}
return ret/d;
}
ll g(string n,ll i,ll k,ll ans){
ll d=n.size()-i;
ll f=n[i]-'0';
if(k<=0){
return ans;
}
if(f==0){
if(i+1<n.size()) {
return g(n, i + 1, k, ans);
}
else {
return ans-1;
}
}
ll tmp=com(d-1,k);
for (int j = 0; j < k; ++j) {
tmp*=9;
}
ans+=tmp;
tmp=com(d-1,k-1);
for (int j = 0; j < k - 1; ++j) {
tmp*=9;
}
ans+=tmp*(f-1);
if(i+1<n.size()) {
return g(n, i + 1, k - 1, ans);
}
else {
return ans;
}
}
int main(){
string n;cin >>n;
ll k;cin >>k;
if(n.size()<k){
cout <<0<<endl;
}
else {
cout << g(n, 0, k, 0) + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<long long>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sll set<long long>
#define si set<int>
#define sti stack<int>
#define stkl stack<ll>
#define qi queue<int>
#define pb push_back
#define ff first
#define ss second
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll mod=1e9+7;
using namespace std;
int c=0;
void solve(){
int n,l;
cin>>n>>l;
vector<string> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
sort(a.begin(), a.end());
for(auto i:a)
cout<<i;
cout<<endl;
}
int main(){
IOS;
int q=1;
while(q--){
c++;
solve();
}
}
| 0
| 34,431,030
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, p;
string s;
cin >> n >> p >> s;
long long ans = 0;
if(p == 2 || p == 5 ){
for(int i=0; i<n; ++i){
if((s[i]-'0')%p == 0){
ans += i+1;
}
}
cout << ans << endl;
return 0;
}
map<int, int> mp;
++mp[0];
int rui = 0;
int keta = 1;
for(int i=n-1; i>=0; --i){
rui += (s[i]-'0') * keta;
rui %= p;
keta *= 10;
keta %= p;
ans += mp[rui];
++mp[rui];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
string s;
cin>>s;
rep(i,4){
cout<<s[i];
}
cout<<" ";
rep(i,8){
cout<<s[4+i];
}
cout<<endl;
}
| 0
| 16,616,002
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
const int INF = 1001001001;
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>>g(n);
rep(i,m) {
int a,b;
cin >> a >> b;
a--;b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int>prev(n,-1);
vector<int>dist(n,INF);
dist[0] = 0;
queue<int>q;
q.push(0);
while(!q.empty()) {
int v = q.front();q.pop();
for(auto nv : g[v]) {
if(dist[nv] == INF) {
dist[nv] = dist[v] + 1;
q.push(nv);
prev[nv] = v;
}
}
}
for(int i = 1;i<n;i++) {
if(prev[i] == -1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
for(int i = 1;i<n;i++) {
cout << prev[i] + 1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
string s;
ll x,y;
cin >> s >> x >> y;
map<ll,ll> LX, LY;
LX[0] = 1;
LY[0] = 1;
vector<ll> v,h;
ll N = s.size();
ll cnt = 0;
bool st = 0;
bool init = 1;
rep(i,N){
map<ll,ll> tm;
if(s[i] == 'T'){
if(st==0){
for(auto&e:LX){
tm[e.fi+cnt] = 1;
if(init)continue;
tm[e.fi-cnt] = 1;
}
LX = tm;
h.push_back(cnt);
init = 0;
}else{
for(auto&e:LY){
tm[e.fi+cnt] = 1;
tm[e.fi-cnt] = 1;
}
LY = tm;
v.push_back(cnt);
}
st = !st;
cnt = 0;
}else{
cnt++;
}
}
if(cnt > 0){
map<ll,ll> tm;
if(st==0){
for(auto&e:LX){
tm[e.fi+cnt] = 1;
if(init)continue;
tm[e.fi-cnt] = 1;
}
LX = tm;
h.push_back(cnt);
}else{
for(auto&e:LY){
tm[e.fi+cnt] = 1;
tm[e.fi-cnt] = 1;
}
LY = tm;
v.push_back(cnt);
}
}
if(LX[x]&&LY[y]){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 0
| 24,769,087
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main() {
cout << fixed << setprecision(10);
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a==b){
cout << "Draw" << endl;
}else if(a>b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
vector<long long> leaf(n + 1);
for (int i = 0; i <= n; i++) {
cin >> leaf[i];
}
vector<long long> max_node(n + 1), min_node(n + 1);
if (leaf[0] > 1) {
cout << -1 << endl;
return 0;
}
max_node[0] = 1 - leaf[0];
min_node[0] = 1 - leaf[0];
cerr << 0 << " " << max_node[0] << " " << min_node[0] << endl;
for (int i = 1; i <= n; i++) {
long long mx = min((long long) 1e18, max_node[i - 1] * 2);
long long mi = min((long long) 1e18, min_node[i - 1]);
if (leaf[i] > mx) {
cout << -1 << endl;
return 0;
}
max_node[i] = mx - leaf[i];
min_node[i] = max(0LL, mi - leaf[i]);
}
vector<long long> non_leaf(n + 1);
non_leaf[n] = 0;
for (int i = n - 1; i >= 0; i--) {
long long need = non_leaf[i + 1] + leaf[i + 1];
if ((need + 1) / 2 > max_node[i] || min_node[i] > need) {
cout << -1 << endl;
return 0;
}
non_leaf[i] = min(max_node[i], need);
}
long long ans = 0;
for (int i = 0; i <= n; i++) {
ans += non_leaf[i] + leaf[i];
}
cout << ans << endl;
return 0;
}
| 0
| 86,809,595
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int l;
int t;
int kyaku = 0;
cin >> N;
for (int i = 0; i < N; i++){
cin >> l >> t;
kyaku += t - l + 1;
}
cout << kyaku << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> A(N), ans(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) ans.at(A.at(i) - 1) = i + 1;
for (int i = 0; i < N; i++) {
if (i == N - 1) cout << ans.at(i) << endl;
else cout << ans.at(i) << " ";
}
}
| 0
| 15,036,225
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int m;ll n,s;
void solve(){
cin >> m;
rep(i,m){
ll c,d;
cin >> d >> c;
n+=c;
s+=d*c;
}
cout << n-1+(s-1)/9 << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}
|
#include<iostream>
#include<string>
using namespace std;
int N_MAX = 300;
int main()
{
int n,i,j,b,ii,jj,res=0;
bool f;
string s[N_MAX];
cin >> n;
for(i=0;i<n;i++)
cin >> s[i];
for(b=0;b<n;b++){
f=false;
for(i=0;i<n;i++){
ii=i-b;
if(ii<0) ii+=n;
for(j=0;j<n;j++){
jj=j+b;
if(jj>=n) jj-=n;
if(jj<=i) continue;
if(s[i][j]!=s[jj][ii]){
f=true;
break;
}
}
if(f) break;
}
if(!f) res++;
}
res*=n;
cout << res << endl;
return 0;
}
| 0
| 40,979,228
|
#include <iostream>
using namespace std;
int main() {
int k[110][110];
int n,l,a,b;
cin>>n;
for(int j=0;j<n;j++){
cin>>l>>a;
for(int i=0;i<a;i++){
cin>>b;
k[j][b-1]=1;
}
}
int q[105];
for(int j=0;j<n;j++){
q[j]=-1;
if(k[0][j]==1){
q[j]=1;
}
}
q[0]=0;
int u=1;
int m=1;
while(m<=n){
for(int d=0;d<n;d++){
if(q[d]==m){
for(int h=0;h<n;h++){
if(k[d][h]==1 &&q[h]==-1){
q[h]=m+1;
}
}
}
}
m=m+1;
}
for(int y=0;y<n;y++){
cout<<y+1<<" "<<q[y]<<endl;
}
return 0;
}
|
#include<iostream>
#include<fstream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<list>
#include<utility>
#include<climits>
#define INF INT_MAX/2
#define EPS 1.0e-7
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<int,PII> PIII;
int N;
vector<PII> compress(vector<PIII> &v, vector<PIII> &s, vector<PIII> &e){
vector<PIII> cv(v.size());
for(unsigned int i=0;i<v.size();++i)cv[i] = v[i];
sort(cv.begin(),cv.end());
int n = unique(cv.begin(),cv.end()) - cv.begin();
vector<PII> ret(v.size()/2);
for(unsigned int i=0;i<v.size()/2;++i){
int si = lower_bound(cv.begin(),cv.begin()+n,s[i]) - cv.begin();
int ei = lower_bound(cv.begin(),cv.begin()+n,e[i]) - cv.begin();
ret[i] = make_pair(si,ei);
}
return ret;
}
int main(){
cin.sync_with_stdio(false);
while(cin >> N,N){
vector<PIII> v(2*N);
vector<PIII> s(N);
vector<PIII> e(N);
for(int i=0;i<N;++i){
int h,m,sec;
string st,et;
cin >> st >> et;
sscanf(st.c_str(),"%d:%d:%d",&h,&m,&sec);
v[2*i] = make_pair(h,make_pair(m,sec));
s[i] = v[2*i];
sscanf(et.c_str(),"%d:%d:%d",&h,&m,&sec);
v[2*i+1] = make_pair(h,make_pair(m,sec));
e[i] = v[2*i+1];
}
vector<PII> p = compress(v,s,e);
vector<int> cnt(2*N);
for(int i=0;i<N;++i){
cnt[p[i].first]++;
cnt[p[i].second]--;
}
for(int i=1;i<2*N;++i)
cnt[i] += cnt[i-1];
int ans=0;
for(int i=0;i<2*N;++i)
ans = max(ans,cnt[i]);
cout << ans << endl;
}
return 0;
}
| 0
| 85,402,468
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> n;
map<string, int> mp;
string s;
rep(i, n)
{
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll tmp;
ll res = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++)
{
ll f = itr->second;
tmp = f * (f - 1) / 2;
res += tmp;
}
cout << res << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int a, b, c, d[10000];
vector<pair<int, int> >P;
int main() {
while (true) {
cin >> a >> b >> c; P.clear();
if (a == 0)break;
for (int i = 1; i <= a; i++)cin >> d[i];
for (int i = b; i <= c; i++) {
P.push_back(make_pair(d[i] - d[i + 1], i));
}
sort(P.begin(), P.end());
cout << P[P.size() - 1].second << endl;
}
return 0;
}
| 0
| 5,156,376
|
#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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
string s, t;
cin >> s >> t;
rep(i,s.size()) {
s = s[s.size() - 1] + s.substr(0, s.size() - 1);
if (s == t) {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> money;
money.push_back(1);
int p = 6;
for(int i=0; p<=n; i++){
money.push_back(p);
p *= 6;
}
p = 9;
for(int i=0; p<=n; i++){
money.push_back(p);
p *= 9;
}
sort(money.begin(), money.end());
int INF = (1LL<<40);
vector<int> dp(n+1, INF);
dp[0] = 0;
for(int i=0; i<money.size(); i++){
for(int j=0; j+money[i]<=n; j++){
dp[j+money[i]] = min(dp[j] + 1, dp[j+money[i]]);
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 68,338,039
|
#include<stdio.h>
int main(void)
{
int x,c;
c=1;
while (scanf("%d",&x),x!=0){
if(x==0) break;
printf("Case %d: %d\n",c,x);
c++;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=100000+10;
int n;
typedef struct
{
int parent;
vector<int> child;
}Node;
Node node[maxn];
int deep[maxn];
void update_deep(int i)
{
if(node[i].child.empty()) return;
for(vector<int>::iterator iter=node[i].child.begin();iter!=node[i].child.end();iter++)
{
int d=*iter;
deep[d]=deep[i]+1;
update_deep(*iter);
}
}
int main()
{
memset(deep,0,sizeof(deep));
int id,du;
scanf("%d",&n);
for(int i=0;i<n;i++) node[i].parent=-1;
for(int i=0;i<n;i++)
{
scanf("%d%d",&id,&du);
for(int j=0;j<du;j++)
{
int d;
scanf("%d",&d);
node[d].parent=id;
node[id].child.push_back(d);
}
update_deep(id);
}
for(int i=0;i<n;i++)
{
printf("node %d: parent = %d, depth = %d, ",i,node[i].parent,deep[i]);
int len=node[i].child.size();
if(node[i].parent==-1) printf("root");
else if(len==0) printf("leaf");
else printf("internal node");
printf(", ");
printf("[");
for(vector<int>::iterator iter=node[i].child.begin();iter!=node[i].child.end();iter++)
{
if(iter!=node[i].child.begin())
{
printf(", ");
}
printf("%d",*iter);
}
printf("]\n");
}
return 0;
}
| 0
| 7,681,847
|
#include <iostream>
using namespace std;
int main()
{
int a,b,c,N=101;
cin >> a >> b >> c;
int color[N] = {};
color[a]++;
color[b]++;
color[c]++;
int sum=0;
for(int i=1; i<N; i++){
if(color[i] > 0){
sum++;
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<int> v(n);
rep(i,n) cin >> v[i];
map<int,int> odd;
map<int,int> even;
int odd1=0;
int o1 = 0;
int odd2=0;
int o2 = 0;
int even1=0;
int e1 = 0;
int even2=0;
int e2 = 0;
rep(i,n){
if(i%2==0){
odd[v[i]]++;
}
else{
even[v[i]]++;
}
}
for(auto a:odd){
if(a.second>odd1){
odd2 = odd1;
o2 = o1;
odd1 = a.second;
o1 = a.first;
}
else if(a.second>odd2)
odd2 = a.second;
}
for(auto a:even){
if(a.second>even1){
even2 = even1;
e2 = e1;
even1 = a.second;
e1 = a.first;
}
else if(a.second>even2)
even2 = a.second;
}
if(e1!=o1){
cout << n-odd1-even1 << endl;
}
else{
cout << min(n-even1-odd2,n-even2-odd1) << endl;
}
return 0;
}
| 0
| 4,850,772
|
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << "a ";
if (a > b)
cout << "> ";
else if (a < b)
cout << "< ";
else
cout << "== ";
cout << "b\n";
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
char maze[1001][1001];
int dis[1001][1001];
int main(void){
int H, W, N;
int sx, sy;
cin >> H >> W >> N;
rep(i, H) {
rep(j, W) {
cin >> maze[i][j];
if(maze[i][j]=='S') sy = i, sx = j;
}
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int ans = 0;
const int INF = 99999999;
rep(HP, N+1) {
queue<P> que;
rep(i, H) rep(j, W) dis[i][j] = INF;
que.push(P(sx, sy));
dis[sy][sx] = 0;
while(que.size()) {
P p = que.front(); que.pop();
if(maze[p.second][p.first] == HP+'0') {
sx = p.first;
sy = p.second;
ans += dis[sy][sx];
break;
}
rep(i, 4) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if(nx >= 0 && nx < W && ny >= 0 && ny < H
&& maze[ny][nx] != 'X' && dis[ny][nx]==INF) {
que.push(P(nx, ny));
dis[ny][nx] = dis[p.second][p.first] + 1;
}
}
}
}
cout << ans << endl;
}
| 0
| 33,011,214
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
int prev = 0;
rep(i, N) {
prev = max(prev, A[i]);
ans += prev - A[i];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(h, vector<char> (w));
rep(i, h) {
rep(j, w) {
cin >> c.at(i).at(j);
}
}
rep(i, h) {
rep(k, 2) {
rep(j, w) {
cout << c.at(i).at(j);
}
cout << endl;
}
}
}
| 0
| 19,068,668
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(n);i++)
#define ll long long
#define llint long long int
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) if(ans)cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define rt (a); return (a);
#define Pint pair<int,int>
#define keta(a) fixed << setprecision(a)
constexpr auto INF = 1000000000;
constexpr auto mod = 1000000007;
llint gcd(llint a, llint b) {
if (b > a)swap(a, b);
if (a % b == 0)return b;
return gcd(b, a % b);
}
llint Tow(int n) {
if (n == 0)return 1;
llint x = Tow(n / 2);
x %= mod;
x *= x;
x %= mod;
if (n % 2 == 1)x *= 10;
x %= mod;
return x;
}
int main(){
int n;
cin >> n;
hei(int) a(n);
int ans = 0;
rep(i, 0, n)cin >> a[i];
rep(i, 0, n - 1) {
if (a[i] == a[i + 1]) {
ans++;
a[i+1] = 0;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
ll n,x,m,again,idx=1,vis[100001],a[100001],ans=0;
int main(){
cin>>n>>x>>m;
if(n<=1e5){
ll a2=x,idx2=1;
ans+=a2;
while(idx2<n){
idx2++;
a2=(a2*a2)%m;
ans+=a2;
}
cout<<ans<<endl;
return 0;
}
a[1]=x;
vis[a[1]]=idx;
ans+=x;
n--;
while(1){
idx++;
a[idx]=(a[idx-1]*a[idx-1])%m;
if(vis[a[idx]]>0){again=idx;break;}
n--;
vis[a[idx]]=idx;
ans+=a[idx];
}
ll period=again-vis[a[idx]];
ll periodsum=0;
for(int i=idx-period;i<idx;i++){
periodsum+=a[i];
}
ans+=(n/period)*periodsum;
n=n-(n/period)*period;
for(int i=idx-period;i<idx-period+n;i++){
ans+=a[i];
}
cout<<ans<<endl;
}
| 0
| 96,086,047
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
vector<int> d(K, K);
deque<pair<int,int>> q;
q.emplace_back(1, 1);
while(!q.empty()) {
auto n=q.front().first;
auto s=q.front().second;
q.pop_front();
if(d[n] <= s) continue;
d[n] = s;
q.emplace_front((n*10)%K, s);
q.emplace_back((n+1)%K, s+1);
}
cout << d[0] << endl;
}
|
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N=2e5+10;
const int mod=1e9+7;
ll f(ll x)
{
if(x%4==0)
{
return x;
}
if(x%4==1)
{
return 1;
}
if(x%4==2)
{
return x+1;
}
if(x%4==3)
{
return 0;
}
}
int main()
{
ll a,b;
cin>>a>>b;
ll ans=f(a-1)^f(b);
cout<<ans<<endl;
return 0;
}
| 0
| 23,797,336
|
#include <bits/stdc++.h>
using namespace std;
void CountingSort(vector<int> &A,vector<int> &B,int n,int k){
vector<int> C(k+1);
for(int i=0;i<k+1;i++){
C[i]=0;
}
for(int i=1;i<n+1;i++){
C[A[i]]++;
}
for(int i=1;i<k+1;i++){
C[i]=C[i-1]+C[i];
}
for(int i=n;i>0;i--){
B[C[A[i]]]=A[i];
C[A[i]]--;
}
}
int main(){
int n;
cin>>n;
vector<int> A(n+1),B(n+1);
for(int i=0;i<n;i++){
cin>>A[i+1];
}
CountingSort(A,B,n,10000);
for(int i=1;i<n+1;i++){
if(i-1) cout<<' ';
cout<<B[i];
}
cout<<endl;
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#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))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n, k;
cin >> n >> k;
vll csum(n + 1, 0);
rep(i, n) {
ll a;
cin >> a;
csum[i + 1] = csum[i] + a;
}
vll bs;
repLRE(i, 0, n - 1) {
repLRE(j, i + 1, n) { bs.push_back(csum[j] - csum[i]); }
}
ll const blmax = 50;
rrepLRE(i, blmax, 0) {
vll nxt;
rep(j, (ll)bs.size()) {
if (bs[j] >> i & 1) nxt.push_back(bs[j]);
}
if (k <= (ll)nxt.size()) bs = nxt;
}
ll ans = (1LL << blmax) - 1;
rep(i, (ll)bs.size()) ans &= bs[i];
cout << ans << endl;
return 0;
}
| 0
| 86,271,295
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
bool guumojiretu(string A) {
int flag = 0;
rep(i,A.size()/2) {
if (A[i] != A[i + A.size()/2]) {
flag++;
}
}
if (flag == 0) {
return true;
}
else {
return false;
}
}
int main() {
string S;
cin >> S;
while(true) {
S.pop_back();
S.pop_back();
if (guumojiretu(S)) {
cout << S.size() << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using Graph = vector<vector<int>>;
using ll = long long;
int main() {
int n,m;
cin>>n>>m;
vector<int> a(n);
int sum=0;
rep(i,n){
cin>>a.at(i);
sum+=a.at(i);
}
int count=0;
rep(i,n){
if(a.at(i)*4*m>=sum){
count++;
}
}
if(count>=m){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 0
| 21,432,333
|
#include<bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define RFOR(i,a,b) for(long i=(a);i>=(b);--i)
#define REP(i,a) FOR(i,0,a)
#define RREP(i,a) RFOR(i,a,0)
#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_END;++i)
#define REACH(i,a) for(auto (i)=(a).rbegin(),_END=(a).rend();i!=_END;++i)
#define ALL(a) (a).begin(), a.end()
#define RALL(a) (a).rbegin(), a.rend()
#define EXIST(a,x) ((a).find(x)!=(a).end())
#define SORT(a) sort(ALL(a))
#define OPT std::cin.tie(0);std::ios::sync_with_stdio(false);
bool debug = true;
#define MSG(s) if(debug){std::cout << s << std::endl;}
#define DEBUG(x) if(debug){std::cout << "debug(" << #x << "): " << x << std::endl;}
typedef long long LL;
typedef std::vector<int> VI;
typedef std::vector<long> VL;
typedef std::vector<long long> VLL;
typedef std::pair<int,int> PII;
typedef long long Weight;
const Weight WEIGHT_INF = std::numeric_limits<Weight>::max()/4;
struct Edge {
int src, dst;
Weight weight;
};
bool operator<(const Edge& a, const Edge& b) {
return (a.weight < b.weight);
};
bool operator>(const Edge& a, const Edge& b) {
return (a.weight > b.weight);
};
typedef std::vector<Edge> Edges;
typedef std::vector<Edges> Graph;
std::vector< std::vector<Weight> > g;
std::vector< std::vector<int> > trace;
void warshallFloyd() {
int n = g.size();
trace.resize(n, std::vector<int>(n, -1));
REP(k, n) REP(i, n) REP(j, n) {
if(g[i][k] == WEIGHT_INF || g[k][j] == WEIGHT_INF){
continue;
}
if(g[i][j] > g[i][k] + g[k][j]){
g[i][j] = g[i][k] + g[k][j];
trace[i][j] = k;
}
}
}
int main(void){
int V, E;
std::cin >> V >> E;
g.resize(V, std::vector<Weight>(V, WEIGHT_INF));
REP(i, V) g[i][i] = 0;
int s, d;
Weight w;
REP(i, E) {
std::cin >> s >> d >> w;
g[s][d] = w;
}
warshallFloyd();
bool f = false;
REP(i, V){
if(g[i][i] < 0){
f = true;
}
}
if(f){
std::cout << "NEGATIVE CYCLE" << std::endl;
} else {
REP(i, V) {
REP(j, V) {
if(j > 0) std::cout << " ";
if(g[i][j] == WEIGHT_INF){
std::cout << "INF";
} else {
std::cout << g[i][j];
}
}
std::cout << std::endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n);
vector<int> x(n);
vector<int> y(n);
for(int i=0;i<n;i++){
cin >> t[i] >> x[i] >> y[i];
}
bool flg=true;
if(x[0]+y[0]>t[0]){flg=false;}
if(x[0]+y[0]<=t[0]){
if((x[0]+y[0]-t[0])%2==1){flg=false;}
}
for(int i=1;i<n;i++){
int a=abs(x[i]-x[i-1]);
int b=abs(y[i]-y[i-1]);
int c=abs(t[i]-t[i-1]);
if(a+b>c){
flg=false;
break;
}
if(a+b<c){
if((c-a-b)%2==1){
flg=false;
break;
}
}
}
if(flg){cout << "Yes" << endl;}
else{cout << "No" << endl;}
}
| 0
| 52,994,463
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++){
cin >> s[i];
}
int ans=0, acount=0, bcount=0, abcount=0;
for (int i = 0; i < N; i++){
if (s[i][0]=='B'){
bcount++;
}
if (s[i][s[i].size()-1]=='A'){
acount++;
}
if (s[i][0]=='B' && s[i][s[i].size()-1]=='A'){
abcount++;
}
while(s[i].find("AB") != string::npos){
int p = s[i].find("AB");
s[i] = s[i].substr(p+2);
ans++;
}
}
if (acount < bcount) {
ans += acount;
}else{
if (abcount != 0 && abcount==bcount && abcount==acount){
ans += bcount - 1;
}else{
ans += bcount;
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define mem(x) memset(x, 0, sizeof(x))
#define ritr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define pai pair < int, int>
#define pal pair < ll, ll>
#define vi vector <int>
#define vl vector < ll >
#define vpai vector < pii >
const int mod = 1e9+7;
const int INF = INT_MAX;
const int sze = 3005;
void solve() {
int n,k;
cin>>n>>k;
ll arr[n];
rep(i,n) cin>>arr[i];
int dp[n+1][k+6];
rep(i,n+1) dp[i][0]=1;
rep(i,k+1) dp[0][i]=0;
dp[0][0]=1;
for(int i=1;i<=n;i++){
vl pre(k+1);
pre[0]=dp[i-1][0];
repn(j,1,k) pre[j]=(pre[j-1]+dp[i-1][j])%mod;
for(int j=1;j<=k;j++){
if(arr[i-1]>=j){
dp[i][j]=pre[j]%mod;
}else dp[i][j]=(pre[j]-pre[j-arr[i-1]-1]+mod)%mod;
}
}
cout<<dp[n][k]<<endl;
}
int main() {
IOS;
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 0
| 99,388,161
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw" << endl;
else if (A == 1)
cout << "Alice" << endl;
else if (B == 1)
cout << "Bob" << endl;
else if (A > B)
cout << "Alice" << endl;
else if (A < B)
cout << "Bob" << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
ll mod = 1000000007;
ll ans = 1<<29;
int main() {
ll n,k;
cin>> n >> k;
vector<pair<ll,ll>> P (n);
rep(i,n){
cin >> P[i].first>>P[i].second;
}
sort(P.begin(),P.end());
ll sum = 0;
ll index;
rep(i,n){
sum +=P[i].second;
if(sum>=k) {
index = i;
break;
}
}
cout << P[index].first << endl;
}
| 0
| 98,615,052
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(bool x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vector<int> v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli n,k,s;
cin>>n>>k>>s;
vi ans(n,1);
rep(i,n){
if(i<k){
ans[i]=s;
}
else{
if(s!=1000000000){
ans[i]=s+1;
}
}
}
rep(i,n){
if(i!=n-1)
cout<<ans[i]<<" ";
else cout<<ans[i]<<endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class Dice {
public:
int label1;
int label2;
int label3;
int label4;
int label5;
int label6;
Dice() {
label1 = 0;
label2 = 0;
label3 = 0;
label4 = 0;
label5 = 0;
label6 = 0;
}
void setValue(int n, int l) {
switch (l) {
case 1: label1 = n; break;
case 2: label2 = n; break;
case 3: label3 = n; break;
case 4: label4 = n; break;
case 5: label5 = n; break;
case 6: label6 = n; break;
default: break;
}
}
void roll(char c) {
int a = label1;
int b = label2;
switch (c) {
case 'N':
label1 = label2;
label2 = label6;
label6 = label5;
label5 = a;
break;
case 'S':
label1 = label5;
label5 = label6;
label6 = label2;
label2 = a;
break;
case 'W':
label1 = label3;
label3 = label6;
label6 = label4;
label4 = a;
break;
case 'E':
label1 = label4;
label4 = label6;
label6 = label3;
label3 = a;
break;
case 'R':
label2 = label3;
label3 = label5;
label5 = label4;
label4 = b;
break;
default:
break;
}
}
};
int main()
{
Dice DiceA;
for (int i = 0; i < 6; i++) {
int n = 0;
cin >> n;
DiceA.setValue(n, i + 1);
}
int Q;
cin >> Q;
if (Q<1||Q>24) return 1;
for (int i = 0; i < Q; i++) {
int q1{ 0 }, q2{ 0 };
cin >> q1 >> q2;
if (DiceA.label3 == q1) DiceA.roll('W');
if (DiceA.label4 == q1) DiceA.roll('E');
while (DiceA.label1!=q1) {
DiceA.roll('N');
}
while (DiceA.label2 != q2) {
DiceA.roll('R');
}
cout << DiceA.label3 << endl;
}
}
| 0
| 81,859,437
|
#include<stdio.h>
int main(void){
int x;
char a[] = "ABC",b[] = "ARC";
scanf("%d",&x);
if(x >= 1200)
printf("%s",b);
else
printf("%s",a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (int) (1e9+7)
#define INF (int) 1e9
#define LLINF (ll) 1e18
int main(){
string s;
cin >> s;
int tmp=0, ans = 0;
rep(i, s.size()){
if(s[i]=='R'){
tmp++;
}else{
tmp=0;
}
chmax(ans, tmp);
}
cout << ans << endl;
return 0;
}
| 0
| 34,693,152
|
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main() {
ll n;
ll a[200010];
ll sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
sum += a[i];
}
ll origin = sum;
ll result = 1e10;
for (int i = 0; i < n-1; i++) {
sum-=a[i];
result = min(result, abs(sum-(origin-sum)));
}
std::cout << result << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
typedef pair<int,int> pi;
#define FAST ios_base::sync_with_stdio(0);
const int maxn = 100010;
int n,k;
deque <int> dq;
void fail() {
cout << "-1";
exit(0);
}
int32_t main() {
cin >> n >> k;
if (k > (1<<n)-1) fail();
if (n == 1) {
if (k == 0) cout << "0 0 1 1";
else fail();
return 0;
}
dq.push_back(k);
for (int i =0;i<=(1<<n)-1;i++) {
if (i == k) continue;
dq.push_front(i);
dq.push_back(i);
}
dq.push_back(k);
for (auto i: dq) {
cout << i << " ";
}
}
| 0
| 51,169,757
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int>> vec(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
{
int u, k, tmp; cin >> u >> k;
for (int j = 0; j < k; j++)
{
cin >> tmp;
vec.at(i).at(tmp-1)=1;
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << vec.at(i).at(j) ;
if(j!=n-1) cout << " ";
}
cout << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB(x, v) x.push_back(v);
#define M_P(a, b) make_pair(a, b)
#define pll pair<ll, ll>
#define ll long long
#define mll map<ll, ll>
#define vl vector<ll>
#define fa(x, v) for(auto x: v)
#define fr(i, a, b) for(ll i= a;i <=b; i++)
#define TEST int test; cin >> test; while(test--)
#define FTEST int TesT; cin >> TesT; for(int test = 1; test<=TesT; test++)
#define B_ begin()
#define E_ end()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define NL_ "\n"
#define F first
#define S second
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define MOD 1000000007
#define ull unsigned long long
ll cnt[2000+10];
bool ch[2000+10];
ll n;
ll make(ll n)
{
if(n<3) return 0;
ll sum = 0;
if(ch[n]) return cnt[n];
for(ll i = 3; i+3<=n; i++)
sum+= make(n-i), sum%=MOD;
ch[n] = 1;
cnt[n] += sum;
cnt[n]%=MOD;
return cnt[n];
}
int main()
{
memset(ch, 0, sizeof(ch));
scanf("%lld", &n);
cnt[1] = cnt[2] = 0;
fr(i, 3 , n) cnt[i] = 1;
make(n);
printf("%lld", cnt[n]);
return 0;
}
| 0
| 25,679,149
|
#include<iostream>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
t.pop_back();
if (s == t)cout << "Yes";
else cout << "No";
return 0;
}
|
# 1 "a.cpp"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "a.cpp"
# 1 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 1
# 11 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp"
# 1 "/home/tysm/dev/cpplib/bin/../stdlib/bits/stdc++.h" 1
#include<bits/stdc++.h>
# 12 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 2
# 1 "/home/tysm/dev/cpplib/bin/../stdlib/ext/pb_ds/assoc_container.hpp" 1
#include<ext/pb_ds/assoc_container.hpp>
# 13 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 2
# 1 "/home/tysm/dev/cpplib/bin/../stdlib/ext/pb_ds/tree_policy.hpp" 1
#include<ext/pb_ds/tree_policy.hpp>
# 14 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp" 2
# 23 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp"
using namespace std;
using namespace __gnu_pbds;
using ii = pair<int64_t, int64_t>;
using tt = tuple<int64_t, int64_t, int64_t>;
using vi = vector<int64_t>;
using vd = vector<double>;
using vb = vector<bool>;
using vii = vector<ii>;
using vtt = vector<tt>;
using vvi = vector<vi>;
using vvd = vector<vd>;
using vvb = vector<vb>;
using vvii = vector<vii>;
using vvtt = vector<vtt>;
# 60 "/home/tysm/dev/cpplib/bin/../include/cpplib/stdinc.hpp"
template<typename T>
ostream &operator<<(ostream &lhs, const vector<T> &rhs)
{
if(is_floating_point<T>::value)
lhs << fixed << setprecision(10);
for(size_t i = 0; i < rhs.size(); ++i) {
if(i)
lhs << ' ';
lhs << rhs[i];
}
return lhs;
}
template<typename T, size_t N>
ostream &operator<<(ostream &lhs, const array<T, N> &rhs)
{
if(is_floating_point<T>::value)
lhs << fixed << setprecision(10);
for(size_t i = 0; i < rhs.size(); ++i) {
if(i)
lhs << ' ';
lhs << rhs[i];
}
return lhs;
}
# 2 "a.cpp" 2
int32_t main(){
(ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL));
int64_t d, t, s;
cin >> d >> t >> s;
cout << (s*t >= d? "Yes" : "No") << "\n";
return 0;
}
| 0
| 77,881,735
|
#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 all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (1LL << 61);
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
int r = min(n, k);
int ans = 0;
rep(a, r + 1)rep(b, r + 1) {
if (a + b > r) continue;
int tmp = 0;
priority_queue<int, vector<int>, greater<int>> pq;
rep(i, a) {
tmp += v[i];
if (v[i] < 0) pq.push(v[i]);
}
rrep(i, b + 1) {
tmp += v[n - i];
if (v[n - i] < 0) pq.push(v[n - i]);
}
rep(i, k - (a + b)) {
if (pq.empty()) break;
tmp -= pq.top();
pq.pop();
}
maxs(ans, tmp);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll Mod = 1000000007;
ll H,W;
ll Cal(ll x,ll y) {
ll res = (x * W) + y;
return res;
}
int main() {
int N;
cin >> H >> W;
cin >> N;
ll a[N],b[N];
ll ans[10];
for (int i = 0; i < 10; i++) ans[i] = 0;
ans[0] = (H-2) * (W-2);
unordered_map<ll,bool> mat;
unordered_map<ll,ll> res;
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
a[i]--; b[i]--;
mat[Cal(a[i],b[i])] = true;
}
for (int i = 0; i < N; i++) {
for (int x = -2; x <= 0; x++) {
for (int y = -2; y <= 0; y++) {
bool inside = true;
int cnt = 0;
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
ll xx = a[i] + x + j;
ll yy = b[i] + y + k;
if (0 <= xx && xx < H && 0 <= yy && yy < W) {
} else {
inside = false;
}
if (mat[Cal(xx,yy)]) {
cnt++;
}
}
}
if (inside) {
if (res[Cal(a[i]+x,b[i]+y)] == 0) {
res[Cal(a[i]+x,b[i]+y)] = cnt;
ans[cnt]++;
ans[0]--;
}
}
}
}
}
for (int i = 0; i < 10; i++) {
cout << ans[i] << endl;
}
return 0;
}
| 0
| 57,998,251
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RNG(i,from,to) for(int i=(from); i<(int)(to); i++)
#define gcd(i,j) __gcd((i), (j))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vecll;
template<typename S, typename T> string to_string(pair<S, T> p) { return "("+to_string(p.first)+","+to_string(p.second)+")"; }
template<typename T> string to_string(T p[2]) { return "["+to_string(p[0])+","+to_string(p[1])+"]"; }
template<typename T> void println(T e){ cout << to_string(e) << endl; }
template<typename T> void println(const vector<T>& v){ cout << "[";for(const auto& e : v){ cout << to_string(e) << ","; }cout << "]";cout << endl; }
template<typename T> void println(const vector<vector<T>>& vv){ for(const auto& v : vv){ println(v); } }
template<typename Iter> void println(Iter first, Iter last){ for(auto it=first; it != last; it++){ cout << *it << " "; }; cout << endl; }
template<typename T> T mod_pow(T x, T n, const T &p) { T ret = 1; while(n > 0) { if(n & 1) (ret *= x) %= p; (x *= x) %= p; n >>= 1; } return ret; }
template<typename T> T mod_inv(T x, const T &p) { return mod_pow(x, p-2, p); }
const ll DVSR = 1e9+7;
int H = 0, W = 0;
void dfs(int i, int j, vector<string> &mp, vector<vector<int>> &ok) {
auto cont = false;
ok[i][j] += (i+1 < H && mp[i+1][j] == '#' ||
i-1 >= 0 && mp[i-1][j] == '#' ||
j+1 < W && mp[i][j+1] == '#' ||
j-1 >= 0 && mp[i][j-1] == '#');
}
int main(int argc, char const *argv[])
{
cin >> H >> W;
vector<string> mp(H);
vector<vector<int>> ok;
ok.assign(H, vector<int>(W));
REP(i, H) cin >> mp[i];
REP(i, H) REP(j, W) ok[0][0] = 0;
REP(i, H) REP(j, W) {
if (!ok[i][j] && mp[i][j] == '#') {
dfs(i, j, mp, ok);
}
}
REP(i, H) REP(j, W) {
if (!ok[i][j] && mp[i][j] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << 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;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s.at(i);
vector<vector<int>> cnt(h,vector<int>(w,0));
rep(i,h){
vector<int> done(w);
rep(j,w){
if(s.at(i).at(j) == '#')continue;
if(done.at(j)) continue;
int l = 0;
while(j+l < w){
if(s.at(i).at(j+l) == '#')break;
l++;
}
rep(k,l){
cnt.at(i).at(j+k) += l;
done.at(j+k) = 1;
}
}
}
rep(j,w){
vector<int> done(h);
rep(i,h){
if(s.at(i).at(j) == '#')continue;
if(done.at(i)) continue;
int l = 0;
while(i+l < h){
if(s.at(i+l).at(j) == '#')break;
l++;
}
rep(k,l){
cnt.at(i+k).at(j) += l;
done.at(i+k) = 1;
}
}
}
int ans = 0;
rep(i,h)rep(j,w) ans = max(ans,cnt.at(i).at(j) -1);
cout << ans << endl;
return 0;
}
| 0
| 10,104,973
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
int n;
string s;
cin>>n>>s;
int ans = 0;
for(int i=0;i<n;i++){
int j = i;
while(j+1<n && s[j+1] == s[i])j++;
ans++;
i = j;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cntl = 0, cntr = 0, addr, addl;
for (int i=0; i<N; i++) {
if (S[i] == '(')
cntl++;
else if (S[i] == ')' && cntl == 0)
cntr++;
else
cntl--;
}
addr = cntr;
cntr = 0;
cntl = 0;
for (int i=N-1; i>=0; i--) {
if (S[i] == ')')
cntr++;
else if (S[i] == '(' && cntr == 0)
cntl++;
else
cntr--;
}
addl = cntl;
while (addr != 0) {
cout << '(';
addr--;
}
cout << S;
while (addl != 0) {
cout << ')';
addl--;
}
cout << endl;
return 0;
}
| 0
| 51,212,197
|
# include <iostream>
# include <cstdio>
# include <cmath>
# include <algorithm>
using namespace std;
struct Node{
long long d;
long long c;
}N[400010];
int cnt = 0;
bool cmp(struct Node a,struct Node b)
{
if (a.d==b.d) return a.c<b.c;
return a.d>b.d;
}
int main(void)
{
long long X,Y,A,B,C;
scanf("%lld%lld%lld%lld%lld",&X,&Y,&A,&B,&C);
for (int i=1;i<=A;i++)
{
N[++cnt].c = 1;
scanf("%lld",&N[cnt].d);
}
for (int i=1;i<=B;i++)
{
N[++cnt].c = 2;
scanf("%lld",&N[cnt].d);
}
for (int i=1;i<=C;i++)
{
N[++cnt].c = 3;
scanf("%lld",&N[cnt].d);
}
sort(N+1,N+cnt+1,cmp);
long long ans = 0;
long long Z=0;
for (int i=1;i<=cnt;i++)
{
if (N[i].c==1)
{
if (X){
X--;
ans+=N[i].d;
}
}
if (N[i].c==2)
{
if (Y)
{
Y--;
ans+=N[i].d;
}
}
if (N[i].c==3)
{
if (X>0||Y>0){
Z++;
ans+=N[i].d;
}
}
if (Z==X+Y) break;
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return(0);
#define IPT(v, n) REP(i, 0, n){ cin >> v[i]; }
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "no" << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<double> vd;
typedef vector<vector<double>> vvd;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
const static ll MOD = 1e9 + 7;
const static ll INF = 1LL << 30;
ll a, b, c, d, k, l, m, n, h, w, q, x, y;
string s, t;
ll ans = 0;
ll sum = 0;
ll cnt = 0;
ll cur = 0;
ll tmp = 0;
ll mini = INF;
ll maxi = 0;
double ave = 0.0;
ll mod_pow(ll base, ll power) {
if (power == 0) return 1;
if (power == 1) return base % MOD;
if (power % 2 == 0) return ((mod_pow(base % MOD, (power / 2)) % MOD) * (mod_pow(base, (power / 2)) % MOD)) % MOD;
return (base % MOD * (mod_pow(base % MOD, power - 1) % MOD)) % MOD;
}
ll mod_fact(ll number) {
ll ret = 1;
ll count = 1;
while (count <= number) {
ret *= (count % MOD);
ret %= MOD;
count++;
}
return ret % MOD;
}
int main() {
cin >> n;
vl a(n + 10), b(n + 10);
IPT(a, n + 1)
IPT(b, n)
ans = 0;
NREP() {
ll attack = min(a[i], b[i]);
a[i] -= attack;
b[i] -= attack;
ans += attack;
attack = min(a[i+1], b[i]);
a[i+1] -= attack;
b[i] -= attack;
ans += attack;
}
MSG(ans)
}
| 0
| 22,290,574
|
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
llint n, m;
cin >> n >> m;
llint ans;
ans = n*m-2*(n+m) + 4;
if(n==1||m==1) ans = max(n, m) -2;
if(n==1&&m==1) ans = 1;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
int main(){
int n; cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int s1 = 0, s2 = 0;
int dif_min = 1000000;
rep(i, n) s2 += w[i];
rep(i, n){
s1 += w[i];
s2 -= w[i];
dif_min = min(abs(s2 - s1), dif_min);
}
cout << dif_min << endl;
}
| 0
| 57,761,898
|
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) for(ll i=begin;i<=end;i++)
#define rlp(i,begin,end) for(ll i=end;i>=begin;i--)
#define prec(n) fixed<<setprecision(n)
#define initial(a,i) memset(a,i,sizeof(a))
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define BPC(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
ll gcd(ll a,ll b) {if (a==0) return b;return gcd(b%a,a);}
ll power(ll x,ll n)
{
ll result = 1;
while (n)
{
if (n & 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
void solution(ll compte)
{
ll r;
cin>>r;
cout<<power(r,2);
}
int main()
{
ll compte = 1;
solution(compte);
compte++;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define 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 SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegin(),(s).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ((int)(x).size())
#define MEMSET(v, h) memset((v), h, sizeof(v))
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin>>s;
string op[3];
int sum;
REP(i,2)
{
REP(j,2)
{
REP(k,2)
{
sum=0;
if(i==0)
{
op[0]="+";
sum=(int)(s[0]-'0')+(int)(s[1]-'0');
}
else
{
op[0]="-";
sum=(int)(s[0]-'0')-(int)(s[1]-'0');
}
if(j==0)
{
op[1]="+";
sum+=(int)(s[2]-'0');
}
else
{
op[1]="-";
sum-=(int)(s[2]-'0');
}
if(k==0)
{
op[2]="+";
sum+=(int)(s[3]-'0');
}
else
{
op[2]="-";
sum-=(int)(s[3]-'0');
}
if(sum==7)
{
cout<<s[0] + op[0] + s[1] + op[1] + s[2] + op[2] + s[3]<<"=7"<<endl;
i=j=k=2;
}
}
}
}
return 0;
}
| 0
| 87,951,839
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
unsigned int factorial(unsigned int n){
if (n==0) return 1;
else return n*factorial(n-1);
}
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
vector<int> p(n),q(n),v(n);
for (int i=0;i<n;i++) cin>>p[i];
for (int i=0;i<n;i++) cin>>q[i];
for (int i=0;i<n;i++) v[i]=i+1;
int cnt=1;
int a=0,b=0;
do{
if(v==p) a=cnt;
if(v==q) b=cnt;
cnt++;
}while(next_permutation(v.begin(),v.end()));
cout<<abs(a-b)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=55;
int n,m,a[maxn],b[maxn],ans=0;
int main()
{
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
int k=min(n,m);
for(int l=0;l<=k;l++)
{
for(int r=0;r<=k-l;r++)
{
for(int i=0;i<l;i++) b[i]=a[i];
for(int j=0;j<r;j++) b[l+j]=a[n-j-1];
sort(b,b+l+r);
int k=0,temp=0;
while(k+l+r<m&&b[k]<0)
k++;
while(k<l+r)
{
temp+=b[k];
k++;
}
ans=max(ans,temp);
}
}
printf("%d\n",ans);
return 0;
}
| 0
| 77,503,612
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int x,n;
cin >> x >> n;
int p[110];
rep(i, 110) p[i] = i;
rep(i,n){
int k;
cin >> k;
p[k] = 0;
}
int cnt = 20000;
int ans;
for (int i = 101; i >= 0;i--){
cnt = min(cnt, abs(x - p[i]));
if(cnt==abs(x-p[i]))
ans = i;
}
cnt = min(cnt, abs(x + 1));
if(cnt==abs(x+1))
ans = -1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<ll, ll>
#define nyan "(=^･ω･^=)"
#define read_input freopen("in.txt","r", stdin)
#define print_output freopen("out.txt","w", stdout)
typedef long long ll;
typedef long double ld;
using namespace std;
const ll maxn = 4e3+10;
ll pre[4][maxn], a[maxn];
ll other(ll a, ll b) {
if(a > b) swap(a, b);
if(a == 1 && b == 2) return 3;
if(a == 1 && b == 3) return 2;
if(a == 2 && b == 3) return 1;
}
int main()
{
ll n; string s;
cin >> n >> s;
for(ll i = 1; i <= n; i++) {
if(s[i-1] == 'R') pre[1][i]++, a[i] = 1;
if(s[i-1] == 'G') pre[2][i]++, a[i] = 2;
if(s[i-1] == 'B') pre[3][i]++, a[i] = 3;
}
for(ll i = 1; i <= n; i++) {
for(ll j = 1; j <= 3; j++)
pre[j][i] += pre[j][i-1];
}
ll ans = 0;
for(ll i = 1; i <= n; i++) {
for(ll j = i+1; j <= n; j++) {
if(a[i] == a[j]) continue;
ll c = other(a[i], a[j]);
ans += pre[c][i-1];
if(2*i-j >= 1 && 2*i-j <= n) ans -= a[2*i-j] == c;
}
}
cout << ans << endl;
return 0;
}
| 0
| 30,221,111
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < k; ++i) ans += a[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {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;}}
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;}
int main() {
int n, m;
cin >> n >> m;
vi broken(n+1);
rep(i,m) {
int a;
cin >> a;
broken[a] = 1;
}
vi dp(n+2);
dp[n] = 1;
for (int i = n-1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i+1] + dp[i+2]) % MOD;
}
cout << dp[0] << endl;
}
| 0
| 64,659,440
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
vector<int>bitSearch(int bit,int n){
vector<int>S;
rep(i,n)if(bit&(1<<i))S.push_back(i);
return S;
}
int main(){
int n;cin>>n;
cout<<n/3;
}
|
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fr(i,n) for(int i=0;i<n;i++)
#define frr(i,n) for(int i=1;i<=n;i++)
#define ms(x,i) memset(x,i,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define gnl cout << endl
#define olar cout << "olar" << endl
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef pair<ll,ll> pll;
const int INF = 0x3f3f3f3f;
int main(){
fastio;
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
vector<int> A;
vector<int> B;
vector<int> C;
for(int i = 0; i<a; i++){
int x;
cin >> x;
A.push_back(x);
}
for(int i = 0; i<b; i++){
int x;
cin >> x;
B.push_back(x);
}
sort(all(A), greater<int>());
sort(all(B), greater<int>());
for(int i = 0; i<x; i++){
C.push_back(A[i]);
}
for(int i = 0; i<y; i++){
C.push_back(B[i]);
}
for(int i = 0; i<c; i++){
int x;
cin >> x;
C.push_back(x);
}
ll ans = 0;
sort(all(C), greater<int>());
for(int i = 0; i<x+y; i++){
ans += C[i];
}
cout << ans << endl;
}
| 0
| 85,526,412
|
#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, k;
cin >> n >> k;
int ans = 1;
rep(i, n) {
if (ans*2 <= ans+k) ans *= 2;
else ans += k;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> V(N,vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++)
cin >> V.at(i).at(j);
}
int count = 0;
for (int k = 0; k < N - 1; k++) {
for (int l = k + 1; l < N; l++) {
int a = 0;
for (int m = 0; m < D; m++)
a += (V.at(k).at(m) - V.at(l).at(m))*(V.at(k).at(m) - V.at(l).at(m));
for (int n = 1; n < sqrt(a) + 1; n++) {
if (n*n == a)
count++;
}
}
}
cout << count << endl;
}
| 0
| 11,652,548
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define reps(i,f,n) for(int i=f;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define m1 cout<<"move1"<<endl
#define m2 cout<<"move2"<<endl
#define m3 cout<<"move3"<<endl
#define m4 cout<<"move4"<<endl
int main(){
ld N,P,M;
vector<ll> v(100,0);
int ans = 0;
ld sum = 0;
ld temp;
while(cin>>N>>M>>P,N+M+P){
ans = 0;
sum = 0;
rep(i,N){
cin>>v[i];
sum += v[i];
}
if( v[M -1] != 0){
temp = (ld)(((ld)sum * 100) * ( 100.0 - (ld)P) * 0.01) / (ld)v[M-1];
ans=(int)(temp);
}
else{
ans = 0;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
int MAX=1e8;
int n;
int a[100005],dp[100005];
int f(int idx)
{
if(idx==n-1)
return 0;
int &ret=dp[idx];
if(ret!=-1)
return ret;
ret=f(idx+1)+abs(a[idx]-a[idx+1]);
if(idx+2<n)
ret=min(ret,f(idx+2)+abs(a[idx]-a[idx+2]));
return ret;
}
in main()
{
int tc=1;
while(tc--)
{
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a[i];
}
memset(dp,-1,sizeof dp);
cout<<f(0)<<endl;
}
return 0;
}
| 0
| 32,432,241
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(20);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) (upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X))
#define debug(x) cerr<<#x<<':'<<x<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto xXx:v)cerr<<xXx<<' ';cerr<<endl;
#define Yes(X) if(X){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YES(X) if(X){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define ctoi(C) (C-'0')
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int,int>;
using pl = pair<long long,long long>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
const long long dx[] = {1,0,-1,0};
const long long dy[] = {0,1,0,-1};
const long long dx8[] = {1,1,0,-1,-1,-1,0,1};
const long long dy8[] = {0,1,1,1,0,-1,-1,-1};
const long long dx9[] = {1,1,0,-1,-1,-1,0,1,0};
const long long dy9[] = {0,1,1,1,0,-1,-1,-1,0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
long long max(long long x,int y){return max(x,(long long)y);}
long long max(int x,long long y){return max((long long)x,y);}
long long min(long long x,int y){return min(x,(long long)y);}
long long min(int x,long long y){return min((long long)x,y);}
bool check(vl d,vl A){
vl copy = d,yay(d.size(),0);
ll N = d.size();
ll MAX = *max_element(ALL(d));
FOR(i,0,N)d[i] -= MAX;
ll counter = 0;
FOR(i,0,N){
if(d[i]%N)return 0;
counter += d[i]/N;
}
FOR(i,0,N){
yay[i] -= counter;
yay[i] += d[i];
}
ll sum = 0;
FOR(i,0,N)sum += A[i];
if(sum%((N)*(N+1)/2))return 0;
return (sum/((N)*(N+1)/2)+counter)%N == 0 && sum/((N)*(N+1)/2)+counter >= 0 && copy == yay;
}
signed main(){
ll N;
cin >> N;
vl A(N);
FOR(i,0,N)cin >> A[i];
vl d(N);
d[0] = A[0] - A[N-1];
FOR(i,1,N)d[i] = A[i] - A[i-1];
YES(check(d,A));
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, n;
cin >> x >> n;
vector<int> a(105);
rep(i, n) {
int p;
cin >> p;
a[p] = 1;
}
int l = x, r = x;
int ans = x;
while (1) {
if (a[l] == 0) {
ans = l;
break;
}
else if (a[r] == 0) {
ans = r;
break;
}
if (l >= 1) l--;
if (r <= 100) r++;
}
cout << ans << endl;
}
| 0
| 100,352,353
|
#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;
int main(){
ll X,Y;
cin>>X>>Y;
int count=0;
while(X<=Y){
count++;
X*=2;
}
cout<<count<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;
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; }
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string s; cin >> s;
if((int)s.length() == 2 && s[0] == s[1])
{
cout << 1 << " " << 2 << endl;
return 0;
}
for(int i = 0; i + 2 < (int)s.length(); i++)
{
string t = s.substr(i, 3);
if(t[0] == t[1] || t[0] == t[2] || t[1] == t[2])
{
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
}
| 0
| 94,794,165
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;i++)
#define per(i,a,b) for(int i=(b),i##_st=(a);i>=i##_st;i--)
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define debug(x) cerr<<#x" = "<<x<<endl
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define Es(x,i) for(Edge *i=G[x];i;i=i->nxt)
typedef pair<int,int> pii;
typedef long long ll;
const int inf=~0u>>1,MOD=1e9+7;
inline int rd() {
int x,c,f=1;while(!isdigit(c=getchar()))f=c!='-';x=c-'0';
while(isdigit(c=getchar()))x=x*10+c-'0';return f?x:-x;
}
inline char rc(){char c;while((c=getchar())!='Y'&&c!='N');return c;}
bool que(ll x){
printf("? %lld\n",x);
fflush(stdout);
return rc()=='Y';
}
int main(){
ll l,r;
if(que(10000000000)){
for(r=2;;r*=10)if(que(r))
return cout<<"! "<< r/2<<endl,0;
}
for(r=10;;r*=10)if(!que(r))break;
l=r/10,r--;
while(l<r){
ll mid=l+r>>1;
if(que(mid*10))r=mid;
else l=mid+1;
}
cout<<"! "<<l<<endl;
}
|
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
#define rep(i, N) for(int i = 0; i < N; i++)
#define rep2(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
#define MOD 1000000007
template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};
vector<pair<int,int>> solve(ll N){
vector<pair<int,int>> v;
ll sqrt = pow(N, 0.5);
for(int i = 2; i <= sqrt; i++){
int cnt = 0;
while(true){
if(N % i == 0){
cnt++;
N /= i;
}
else break;
}
if(cnt != 0) v.push_back({i, cnt});
}
if(N != 1) v.push_back({N, 1});
return v;
}
ll cal(vector<pair<int,int>> &v){
int ans = 0;
for(auto s:v){
ll n = s.second;
ll i = 1;
while(n >= i){
ans++;
n -= i;
i++;
}
}
return ans;
}
int main(){
ll N;
cin >> N;
auto v = solve(N);
int ans = cal(v);
cout << ans << endl;
}
| 0
| 91,286,771
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int> > VVI;
typedef vector< vector<ll> > VVL;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
int main(){
int N,M;
cin>>N>>M;
VL A(M),B(M),C(M);
rep(i,M) cin>>A[i]>>B[i]>>C[i];
VVL D(N,VL(N));
rep(i,N) rep(j,N) if(i!=j) D[i][j]=1001001001001001001;
rep(i,M){
D[A[i]-1][B[i]-1]=C[i];
D[B[i]-1][A[i]-1]=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=M;
rep(k,M){
int F=0;
rep(i,N) rep(j,N) if(D[i][j]==D[i][A[k]-1]+D[B[k]-1][j]+C[k]) F=1;
if(F) ans--;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<int, vector<int>, greater<int> > gpq;
typedef priority_queue<int> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
int N;
cin>>N;
for(int i=111;i<=999;i+=111){
if(N<=i){
cout<<i<<endl;
return 0;
}
}
}
| 0
| 74,207,938
|
#include <cstdint>
using namespace std;
#define MEMO_SIZE 45
int64_t memo[MEMO_SIZE];
void fib_init()
{
for (uint32_t i = 0; i < MEMO_SIZE; i++) {
memo[i] = -1;
}
}
uint32_t fib(uint32_t i)
{
if (i == 0) {
return memo[0] = 1;
} else if (i == 1) {
return memo[1] = 1;
} else {
if (memo[i] != -1)
return memo[i];
else {
return memo[i] = fib(i - 1) + fib(i - 2);
}
}
}
#include <iostream>
int32_t main()
{
fib_init();
uint32_t i;
cin >> i;
cout << fib(i) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i < int(n); i++)
using ll = long long;
using namespace std;
const ll MOD = 1e9+7;
ll modpow(ll a, ll n, ll p) {
ll res = 1;
while (n) {
if (n & 1) res = res * a % p;
a = a * a % p;
n >>= 1;
}
return res;
}
int main(){
string s; cin >> s;
ll n = s.length();
ll ans = 0, count = 0;
rep(i,n){
if(s[i] == '1'){
ans += modpow(2,count,MOD) * modpow(3,n-1-i,MOD) % MOD;
count++;
}
}
ans += modpow(2,count,MOD);
cout << ans % MOD << endl;
}
| 0
| 1,616,417
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;scanf("%d%d",&n,&m);
int l=1,r=m+1;
while(l<r)printf("%d %d\n",l++,r--);
l=m+2,r=2*m+1;
while(l<r)printf("%d %d\n",l++,r--);
return 0;
}
|
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n; cin >> n;
int dp[n+1]; rep(i,n+1) dp[i] = 1<<30; dp[0] = 0;
rep(i,n){
for(int j=1; i+j <= n; j*=6){
dp[i+j] = min(dp[i+j], dp[i]+1);
}
for(int j=1; i+j <= n; j*=9){
dp[i+j] = min(dp[i+j], dp[i]+1);
}
}
cout << dp[n] << endl;
}
| 0
| 53,057,279
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int i = s.size() - 1;
string t;
while(i >= 0) {
t.push_back(s[i]);
if (t == "maerd" || t == "remaerd" || t == "esare" || t == "resare")
t.clear();
--i;
}
if (t.empty())
cout << "YES";
else
cout << "NO";
}
int main() {
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<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;}
bool seen[100000];
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v]) continue;
dfs(G, next_v);
}
}
ll dp[55][2];
int main(){
int N,P;
cin >> N >> P;
vector<int> A(N);
rep(i,N) cin >> A.at(i);
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
if (A.at(i - 1) % 2 == 0) {
dp[i][0] = dp[i - 1][0] * 2;
dp[i][1] = dp[i - 1][1] * 2;
}
else {
dp[i][0] = dp[i - 1][0] + dp[i - 1][1];
dp[i][1] = dp[i - 1][0] + dp[i - 1][1];
}
}
cout << dp[N][P] << endl;
return 0;
}
| 0
| 637,974
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i,a,b) for (int i=(a); i < (b); ++i)
#define FORR(i,a,b) for (int i=(a); i > (b); --i)
#define FOR_ALL(i,c) for (__typeof((c).begin()) i=(c).begin(); \
i != (c).end(); ++i)
#define FOR_ALLR(i,c) for (__typeof((c).rbegin()) i=(c).rbegin(); \
i != (c).rend(); ++i)
#define SZ(array) (sizeof(array)/sizeof(array[0]))
#define lc(x) (x<<1)
#define rc(x) (x<<1 | 1)
#define lowbit(x) (x & (-x))
typedef long long LL;
typedef map<int,int> MII;
typedef pair<int,int> PII;
typedef set<int> SI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<int> VI;
typedef vector<string> VS;
template <class C>
inline bool in_(const typename C::key_type& k, const C& A)
{ return A.find(k) != A.end(); }
inline bool in_(const string& s, const string& S)
{ return S.find(s) != string::npos; }
const int maxn = 1e5+5;
int A[maxn],B[maxn];
int main()
{
int N,K;
while (cin >> N >> K) {
LL ans = 0;
FOR(i,0,N) {
cin >> A[i] >> B[i];
if ((A[i]&K) == A[i])
ans += B[i];
}
FORR(i,30,0) {
const int x = 1<<i;
LL res = 0;
if (K & x) {
const int mask = (K^x) | (x-1);
FOR(i,0,N) if ((mask&A[i]) == A[i])
res += B[i];
}
ans = max(ans,res);
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s; int n, ans = 0, a = 0, b = 0, ab = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
int l = s.length();
if (s[0] == 'B' && s[l-1] == 'A')
ab++;
else if (s[0] == 'B')
b++;
else if (s[l-1] == 'A')
a++;
for (int j = 0; j < l-1; j++) {
if (s[j] == 'A' && s[j+1] == 'B')
ans++;
}
}
if (a > 0) {
cout << ans + ab + min(a, b) << endl;
return 0;
}
else if (ab > 0){
cout << ans + ab-1 + ((b > 0)?1:0) << endl;
return 0;
}
else {
cout << ans << endl;
return 0;
}
}
| 0
| 91,011,092
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#define FOR(i, a) for(int i=0;i<(int)a;++i)
typedef long long ll;
using namespace std;
void solver() {
int N;
while (cin >> N) {
int ans = 0;
FOR(a, 10)FOR(b, 10)FOR(c, 10) {
int d = N - (a + b + c);
if (d >= 0 && d < 10) {
ans++;
}
}
cout << ans << endl;
}
}
int main() {
solver();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
set<int> s;
for(int i = 0;i < n;i++){
int x; cin >> x;s.insert(x);
}
if(s.size() == n){
cout << "YES";
}else{
cout << "NO";
}
}
| 0
| 11,627,727
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
double sum = 0;
rep(i, n) {
double a;
cin >> a;
sum += 1 / a;
}
printf("%12f", 1 / sum);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
if(n==1)
{
cout<<1;
return 0;
}
ll bans=1;
ll ans=3;
for(int i=2;i<n;i++)
{
ans=ans+bans;
bans=ans-bans;
}
cout<<ans<<"\n";
return 0;
}
| 0
| 88,553,325
|
#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(){
string S;
cin >> S;
S += ".";
vector<pair<char, int> > v;
int cnt = 1;
for (int i = 0; i < S.size() - 1; i++) {
if (S[i] == S[i+1]) cnt++;
else {
v.push_back(make_pair(S[i], cnt));
cnt = 1;
}
}
cout << v.size() - 1 << '\n';
}
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(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 fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
int inv[MAX_N],fac[MAX_N],finv[MAX_N];
void make()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i=2;i<MAX_N;i++){
inv[i] = MOD - (ll)inv[MOD%i] * (MOD/i) % MOD;
fac[i] = (ll)fac[i-1] * i % MOD;
finv[i] = (ll)finv[i-1] * inv[i] % MOD;
}
}
int comb(int a,int b)
{
if(a<b || b<0){
return 0;
}
return (ll)fac[a] * ((ll)finv[b] * finv[a-b] % MOD) % MOD;
}
int add(int x,int y)
{
return (x+y)%MOD;
}
int sub(int x,int y)
{
return (x+MOD-y)%MOD;
}
int mul(int x,int y)
{
return (ll)x*y%MOD;
}
int mod_pow(int a, int n, int mod){
int ret = 1;
while(n){
if(n & 1) ret = (long long)ret * a % mod;
a = (long long)a * a % mod;
n >>= 1;
}
return ret;
}
template<int mod>
class NTT {
public:
int get_mod() const { return mod; }
void _ntt(vector<int>& a, int sign){
const int n = (int)a.size();
const int g = 3;
int h = mod_pow(g, (mod - 1) / n, mod);
if(sign == -1) h = mod_pow(h, mod-2, mod);
int s,x,m,j,k;
int i = 0;
for(j = 1; j < n - 1; ++j){
for(k = n >> 1; k >(i ^= k); k >>= 1);
if (j < i) swap(a[i], a[j]);
}
for (m = 1; m < n; m *= 2){
const int m2 = 2 * m;
const int base = mod_pow(h, n / m2, mod);
int w = 1;
for(x = 0; x < m; x++){
for(s = x; s < n; s += m2){
unsigned int u = a[s];
unsigned int d = (long long)a[s + m] * w % mod;
a[s] = (u + d) % mod;
a[s + m] = (u + mod - d) % mod;
}
w = (long long)w * base % mod;
}
}
}
void ntt(vector<int>& input){
_ntt(input, 1);
}
void intt(vector<int>& input){
_ntt(input, -1);
const int n_inv = mod_pow((int)(input.size()), mod-2, mod);
for(auto& x : input) x = (long long)x * n_inv % mod;
}
void _convolution(const vector<int>& a, const vector<int>& b, vector<int>& _a, vector<int>& _b){
int ntt_size = 1;
while (ntt_size < (int)(a.size()) + (int)(b.size())) ntt_size *= 2;
_a = a, _b = b;
_a.resize(ntt_size); _b.resize(ntt_size);
ntt(_a), ntt(_b);
for(int i = 0; i < ntt_size; i++){
_a[i] = (long long)_a[i] * _b[i] % mod;
}
intt(_a);
}
};
typedef NTT<167772161> NTT_1;
typedef NTT<469762049> NTT_2;
typedef NTT<1224736769> NTT_3;
void convolution(const vector<int>& a, const vector<int>& b, vector<int>& res){
NTT_1 ntt1; NTT_2 ntt2; NTT_3 ntt3;
vector<int> x,_x,y,_y,z,_z;
ntt1._convolution(a, b, x, _x), ntt2._convolution(a, b, y, _y), ntt3._convolution(a, b, z, _z);
const int m1 = ntt1.get_mod(), m2 = ntt2.get_mod(), m3 = ntt3.get_mod();
const int m1_inv_m2 = mod_pow(m1, m2-2, m2);
const int m12_inv_m3 = mod_pow((long long)m1 * m2 % m3, m3-2, m3);
const int m12_mod = (long long)m1 * m2 % MOD;
res.resize((int)(x.size()));
for(int i = 0; i < (int)(x.size()); i++){
int v1 = ((long long)y[i] + m2 - x[i]) * m1_inv_m2 % m2;
int v2 = ((long long)z[i] + m3 - (x[i] + (long long)m1 * v1) % m3) * m12_inv_m3 % m3;
res[i] = (x[i] + (long long)m1 * v1 + (long long)m12_mod * v2) % MOD;
}
}
int cnt[MAX_N];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n);
rep(i,n+1){
cin >> a[i];
cnt[a[i]]++;
}
int l = -1, r = -1;
rep(i,n+1){
if(cnt[a[i]] == 2){
if(l < 0){
l = i;
}else{
r = i;
}
}
}
make();
vi x(l+1),y(n-r+1),res;
rep(i,len(x)){
x[i] = comb(l,i);
}
rep(i,len(y)){
y[i] = comb(n-r,i);
}
convolution(x,y,res);
srep(k,1,n+2){
int ans = add(add(comb(n-1,k),mul(2,comb(n-1,k-1))),comb(n-1,k-2));
cout << sub(ans,(k-1<len(res))?(res[k-1]):(0)) << "\n";
}
return 0;
}
| 0
| 27,670,319
|
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n, n){
int cnt=0;
n=1000-n;
cnt+=n/500;
n%=500;
cnt+=n/100;
n%=100;
cnt+=n/50;
n%=50;
cnt+=n/10;
n%=10;
cnt+=n/5;
n%=5;
cout<<cnt+n<<endl;
}
return 0;
}
|
#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;
ll const INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
ll a, b;
vector<pair<ll, ll>> p(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
p.emplace_back(a, b);
}
sort(p.begin(), p.end());
ll ans = 0;
ll i = 0;
ll cnt = 0;
while (cnt < M) {
if (cnt + p[i].second < M) {
ans += p[i].first * p[i].second;
} else {
ans += p[i].first * (M - cnt);
}
cnt += p[i].second;
i++;
}
cout << ans << endl;
return 0;
}
| 0
| 4,421,687
|
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>c>>a;
while(c>=500){
c-=500;
}
if(c<=a){
cout<<"Yes";
}
else{
cout<<"No";
}
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[300001],b[300001],s[300001];
inline long long read()
{
long long sum=0,x=1;
char ch=getchar();
while (ch<'0'||ch>'9')
{
if (ch=='-')
x=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9')
{
sum=sum*10+ch-'0';
ch=getchar();
}
return sum*x;
}
inline void write(long long x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x>9)
write(x/10);
putchar(x%10+'0');
return;
}
int main()
{
n=pow(2,read());
for (register int i=0;i<n;++i)
a[i]=read();
for (register int i=0;i<n;++i)
for (register int j=i;j<=n;j=(j+1)|i)
{
s[j]=max(s[j],a[i]+b[j]);
b[j]=max(b[j],a[i]);
}
for (register int i=1;i<n;++i)
s[i]=max(s[i],s[i-1]);
for (register int i=1;i<n;++i)
{
write(s[i]);
putchar('\n');
}
return 0;
}
| 0
| 3,133,156
|
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#define mnlld -LLONG_MAX
#define mxd 2e8
#define mnd -2e8
#define pi 3.14159265359
using namespace std;
bool check(ll n, ll pos)
{
return n & (1LL << pos);
}
ll Set(ll n, ll pos)
{
return n = n | (1LL << pos);
}
string s;
bool solve()
{
for(auto it: s) for(auto jt: s) if(it != jt) return 1;
return 0;
}
int main()
{
ll i, j, k, l, m, n, o, r, q;
ll testcase;
ll input, flag, tag, ans;
while(cin >> s)
{
if(solve()) cout << "Yes\n";
else cout << "No\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
while (n > 0) {
int x = n % 10;
if (x == 7) {
cout << "Yes";
return 0;
}
n = n / 10;
}
cout << "No";
}
| 0
| 90,514,907
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n){
m--;
int s = 0, x;
REP(i,n){
int a;
cin >> a;
s += a;
if (i == m) x = a;
}
int ans = (x == 0 ? 0 : s * (100-p) / x);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
#define ROF(i,a,b) for(ll i=a;i>=b;i--)
#define per(i,a) ROF(i,a,0)
#define pb push_back
const ll MOD=1000000007;
const ll MOD2=998244353;
const ld PI=acos(-1);
const ll INF=1e18;
st abc="abcdefghijklmnopqrstuvwxyz";
st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
int main() {
ll X,Y,Z,K;
cin >> X >> Y >> Z >> K;
vl A(X),B(Y),C(Z);
rep(i,X){
cin >> A[i];
}
rep(i,Y){
cin >> B[i];
}
rep(i,Z){
cin >> C[i];
}
vl D(X*Y);
rep(i,X){
rep(j,Y){
D[i+X*j]=A[i]+B[j];
}
}
sort(D.begin(),D.end());
sort(C.begin(),C.end());
reverse(D.begin(),D.end());
reverse(C.begin(),C.end());
vl ND(min(K,X*Y));
rep(i,(ll)ND.size()){
ND[i]=D[i];
}
vl E((ll)ND.size()*Z);
rep(i,(ll)ND.size()){
rep(j,Z){
E[i+ND.size()*j]=ND[i]+C[j];
}
}
sort(E.begin(),E.end());
reverse(E.begin(),E.end());
rep(i,K){
cout << E[i] << endl;
}
}
| 0
| 4,180,135
|
#include <deque>
#include <cstdio>
using namespace std;
#define ll long long
int main(){
ll N;
scanf("%lld", &N);
ll a[N], ps = 0, ns = 0;
deque<ll> p, n;
for (ll i = 0; i < N; i++){
scanf("%lld", &a[i]);
if (a[i] > 0){
p.emplace_back(a[i]);
ps += a[i];
}else if (a[i] <= 0){
n.emplace_back(a[i]);
ns += a[i];
}
}
if (p.empty()){
ll ma = -2147483648, pos;
for (ll i = 0; i < n.size(); i++){
if (n[i] > ma){
ma = n[i];
pos = i;
}
}
p.emplace_back(ma);
n.erase(n.begin() + pos);
ps += ma;
ns -= ma;
}
if (n.empty()){
ll mi = 2147483647, pos;
for (ll i = 0; i < p.size(); i++){
if (p[i] < mi){
mi = p[i];
pos = i;
}
}
n.emplace_back(mi);
p.erase(p.begin() + pos);
ns += mi;
ps -= mi;
}
printf("%lld\n", ps - ns);
while (true){
if (p.size() == 1 && n.size() == 1){
printf("%lld %lld\n", p[0], n[0]);
return 0;
}
if (n.size() == 1){
printf("%lld %lld\n", n[0], p[0]);
n.emplace_back(n[0] - p[0]);
p.erase(p.begin());
n.erase(n.begin());
}else{
printf("%lld %lld\n", p[0], n[0]);
p.emplace_back(p[0] - n[0]);
p.erase(p.begin());
n.erase(n.begin());
}
}
}
|
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
void yesOrNo(bool flg) {
if (flg)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void solve(ll N, ll M, ll K) {
bool ans = false;
rep(i, N + 1) {
rep(j, M + 1) {
if (M * i + N * j - 2 * i * j == K) ans = true;
}
}
yesOrNo(ans);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll N;
scanf("%lld", &N);
ll M;
scanf("%lld", &M);
ll K;
scanf("%lld", &K);
solve(N, M, K);
return 0;
}
| 0
| 36,862,534
|
#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>;
const int INF = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
if (n==1) {
cout << ans << endl;
return 0;
}
rep(i, n-1) ans *= (k-1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) { \
cerr << ((hoge) ? "," : "") << x[hoge]; \
} \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
int ans;
for (ans = 1; ans <= 10000; ans++)
if (ans * 8 / 100 == A && ans * 10 / 100 == B) break;
if (ans > 10000) ans = -1;
cout << ans << endl;
return 0;
}
| 0
| 100,829,984
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.