code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
ll n;
cin >> s >> n;
for(int i = 0; i < min((ll)s.size(), n); i++) {
if(s[i] >= '2') {
cout << s[i] << endl;
return 0;
}
}
cout << '1' << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(void)
{
int n;
scanf(" %d", &n);
for(int i = 0; i < n; i++){
int y, m, d;
scanf(" %d %d %d", &y, &m, &d);
int count = 0;
for(int j = m + 1; j <= 10; j++){
if(y % 3 == 0){
count += 20;
} else{
if(j % 2 == 0){
count += 19;
} else if(j % 2 == 1){
count += 20;
}
}
}
int t = count;
if(y % 3 == 0){
count += (20 - d + 1);
}else{
if(m % 2 == 0){
count += (19 - d + 1);
}else if(m % 2 == 1){
count += (20 - d + 1);
}
}
for(int j = y + 1; j < 1000; j++){
if(j % 3 == 0){
count += (20 * 10);
} else if (j % 3 != 0){
count += (20 * 5 + 19 * 5);
}
}
printf("%d\n", count);
}
return 0;
}
| 0
| 1,051,580
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int w, h, n; cin >> w >> h >> n;
int xl=0, xu=w, yl=0, yu=h;
rep(i,n) {
int x, y, a; cin >> x >> y >> a;
if (a == 1) xl = max(xl,x);
if (a == 2) xu = min(xu,x);
if (a == 3) yl = max(yl,y);
if (a == 4) yu = min(yu,y);
}
w = xu - xl;
h = yu - yl;
int ans = 0;
if (w < 0 || h < 0) ans = 0;
else ans = w * h;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define itfr(it,x) for(it=x.begin();it!=x.end();it++)
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
int main()
{
flash;
ll T=1,t,n,sum=0,k,i,j;
while(T--)
{
n=5;
ll a[n],rnd[n],di[n];
FOR(i,0,n)
{
cin>>a[i];
if(a[i]%10==0)
rnd[i]=a[i];
else
rnd[i] = (10- a[i]%10) + a[i];
sum += rnd[i];
}
ll ans = sum;
FOR(i,0,n)
{
di[i] = sum + a[i]-rnd[i];
if(ans>di[i])
ans=di[i];
}
cout<<ans<<endl;
}
}
| 0
| 14,547,020
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
string s;
cin >> n >> s;
if(s.front() == 'W' || s.back() == 'W') {
cout << 0 << endl;
return 0;
}
int cntL = 1, cntR = 0;
int flagL = 1;
vector<ll> L(2*n), R(2*n);
vector<int> posR;
for(int i = 1; i < 2*n; i++) {
L[i] = cntL;
R[i] = cntR;
if(s[i-1] == s[i]) {
flagL ^= 1;
}
if(flagL) {
cntL++;
}
else {
cntR++;
posR.push_back(i);
}
}
if(cntL != cntR) {
cout << 0 << endl;
return 0;
}
ll ans = 1LL;
rep(i, posR.size()) {
ans *= (L[posR[i]] - R[posR[i]]);
ans %= mod;
}
while(n >= 1) {
ans *= n;
ans %= mod;
n--;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N, A, B;
cin >> N >> A >> B;
if (N < A + B - 1 || N > A * B) {
cout << -1 << endl;
return 0;
}
bool maked = false;
for (int i = 1; i <= B; i++) {
int remain = N - A * i;
if (remain < 0) continue;
int lengthA;
vector<int> lengths;
if (i < B) {
lengthA = remain / (B - i);
if (lengthA == 0) continue;
if (remain > (B - i) * A) continue;
for (int j = 0; j < B - i; j++) lengths.push_back(lengthA);
for (int j = 0; j < remain % (B - i); j++) lengths[j]++;
if (remain % (B - i) != 0) lengthA++;
}
if (i == B) {
lengthA = 0;
}
vector<LL> output;
LL offset = N - i * A;
for (int j = 0; j < A; j++) {
for (int k = 0; k < i; k++) {
output.push_back(offset + j * i + i - k);
}
}
for (int j = 0; j < B - i; j++) {
offset -= lengths[j];
for (int k = 0; k < lengths[j]; k++) {
int cand = offset + k + 1;
if (cand <= 0) continue;
output.push_back(cand);
}
}
for (int i = 0; i < output.size(); i++) {
cout << output[i];
if (i == output.size() - 1)
cout << endl;
else
cout << " ";
}
return 0;
}
if (!maked) {
cout << -1 << endl;
}
return 0;
}
| 0
| 12,666,106
|
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin() (x).end()
#define rall(x) (x).rbegin() (x).rend()
typedef long long ll;
int main(){
char a;
cin>>a;
if(isupper(a))cout<<"A"<<endl;
else cout<<"a"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9+ 7;
const int INF = 2e18;
signed main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
auto check = [&](int types) {
map<int, int> count;
for (int i = 1; i < N; i++) {
if (A[i - 1] < A[i]) continue;
int idx = A[i];
if (types == 1) return false;
while (true) {
count[idx]++;
if (count[idx] >= types) {
count.erase(idx);
idx--;
} else break;
}
auto itr = next(count.find(idx), 1);
while (itr != count.end()) itr = count.erase(itr);
}
bool ok = count[0] == 0;
return ok;
};
int left = 0, right = 1e9 + 100;
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (check(mid)) right = mid;
else left = mid;
}
cout << right << endl;
}
| 0
| 2,095,750
|
#include <iostream>
using namespace std;
int main(){
int a;
for(int i=1 ;;i++){
cin>>a;
if (a==0){
return 0;
}
cout << "Case "<< i <<":"<<" "<<a<< endl;
}
}
|
#include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
int n, m;
cin >> n >> m;
if(n == 0)
return 0;
vector<pair<int, int> > a(n);
for(int i=0; i<n; ++i)
cin >> a[i].second >> a[i].first;
sort(a.rbegin(), a.rend());
int ret = 0;
for(int i=0; i<n; ++i){
ret += max(0, a[i].second - m) * a[i].first;
m -= min(m, a[i].second);
}
cout << ret << endl;
}
}
| 0
| 85,378,160
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N, M; cin>>N>>M;
ll A;
pqueue<ll> que;
for(int i=0;i<N;++i) {
cin>>A;
que.push(A);
}
for(int i=0;i<M;++i) {
A = que.top();que.pop();
A /= 2;
que.push(A);
}
ll ans = 0;
for(int i=0;i<N;++i) {
A = que.top();que.pop();
ans += A;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1005;
int h,w,a,b,s[N][N];
int main(){
scanf("%d%d%d%d",&h,&w,&a,&b);
for(int i=1;i<=h;++i){
for(int j=1;j<=w;++j){
if(i <= b && j <= a)
s[i][j] = 1;
else if(i > b && j > a)
s[i][j] = 1;
else
s[i][j] = 0;
}
}
for(int i=1;i<=h;++i){
for(int j=1;j<=w;++j)
cout<<s[i][j];
cout<<endl;
}
}
| 0
| 7,965,312
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string o;
for(auto x:s){
o+='9'-(x-'0')+1;
}
cout << o;
}
|
#include <iostream>
using namespace std;
#include <string>
int main(){
int n; cin >> n;
string str; cin >> str;
long long r=0,g=0,b=0;
for(int i=0; i<n; i++) {
switch (str.at(i)){
case 'R':
r++;
break;
case 'G':
g++;
break;
default:
b++;
break;
}
}
long long ans = r*g*b;
for(int i=0; i<n-2; i++){
for(int j=i+1; j<n-1; j++){
int k = 2*j-i;
if(k>=n) continue;
if(str[i]!=str[j] && str[i]!=str[k] && str[j]!=str[k]) ans--;
}
}
cout << ans << endl;
}
| 0
| 42,073,750
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.end()
#define rev_all( x ) x.rbegin(), x.rend()
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const int inf = 1e12 + 5;
const long double PI = 3.141592653589793;
void solve(){
int a, b, c, k;
cin >> a >> b >> c >> k;
while(b <= a && k>0){
b*=2;
k--;
}
while(c <= b && k > 0){
c*=2;
k--;
}
cout << ((b > a && c > b) ? "Yes" : "No") << endl;
}
signed main(){
fast;
int t = 1;
for(int i = 1; i <= t; i++){
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
long GCM(long A,long B){
long W,r;
if(A<B){
W=B;
B=A;
A=W;
}
while(A%B!=0){
r=A%B;
A=B;
B=r;
}
return B;
}
long LCM(long A,long B){
return (A*B)/GCM(A,B);
}
long upDiv(long a,long b){
return (a+b-1)/b;
}
int main() {
long N,flag=1;
string S;
cin>>N>>S;
if(N%2!=0){
cout<<"No"<<endl;
}else{
for(long i=0;i<N/2;i++){
if(S.at(i)!=S.at(i+N/2)){
flag=0;
break;
}
}
if(flag==0){
cout<<"No"<<endl;
}else{
cout<<"Yes"<<endl;
}
}
}
| 0
| 2,908,760
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 200000
int N, D, A;
LL prefixSum[MAXN + 3], answer;
pair<int, int> monsters[MAXN + 3];
int main() {
scanf("%d%d%d", &N, &D, &A);
for (int i = 1; i <= N; i++) {
int X, H;
scanf("%d%d", &X, &H);
monsters[i] = {X, H};
}
sort(monsters + 1, monsters + N + 1);
memset(prefixSum, 0, sizeof(prefixSum));
answer = 0;
for (int i = 1; i <= N; i++) {
prefixSum[i] += prefixSum[i - 1];
LL H = (LL) monsters[i].second - prefixSum[i] * A;
if (H <= 0)
continue;
else {
int cntBomb = H/A + (H%A == 0 ? 0 : 1);
int lo = i, hi = N, mid;
while (hi >= lo) {
mid = (lo + hi)/2;
if (monsters[mid].first - monsters[i].first <= 2 * D)
lo = mid + 1;
else
hi = mid - 1;
}
prefixSum[i] += cntBomb;
prefixSum[lo] -= cntBomb;
answer += cntBomb;
}
}
printf("%lld\n", answer);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int add(int a, int b){
return (a+b)%MOD;
}
int mul(int a, int b){
return((ll)a*b)%MOD;
}
int main(){
ios_base::sync_with_stdio(false);
cout.precision(10);
cout<<fixed;
int n;
cin >> n;
string s;
cin >> s;
ll res = 1;
for(int i=2; i<=n; i++){
res = mul(res, i);
}
int tren = 0;
for(int i=0; i<2*n; i++){
if(s[i] == 'B'){
if(tren%2 == 0){
tren++;
}
else{
res = mul(res, tren);
tren--;
}
}
if(s[i] == 'W'){
if(tren%2 == 0){
res = mul(res, tren);
tren--;
}
else tren++;
}
}
if(tren){
cout << 0;
return 0;
}
cout << res;
return 0;
}
| 0
| 89,997,958
|
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll k;
ll n=50;
ll f(ll i) {
if (k%n==0) return k/n;
if (i>=k%n) return k/n;
return k/n+1;
}
int main() {
scanf("%lld",&k);
printf("%lld\n",n);
for (ll i=0;i<n;i++) {
printf("%lld ",(n+1)*f(i)-k+i);
}
printf("\n");
}
|
#include<iostream>
#include<cstdio>
#define INF 1<<30
#define MAX 100000
using namespace std;
class Queue{
private:
int inf[MAX];
int head,tail;
public:
Queue(){
syokika();
}
void syokika(){
head = 0;
tail = 0;
}
void push(int x){
inf[tail]=x;
if(MAX == tail+1)tail = 0;
else tail++;
}
void pop(){
if(MAX == head+1)head=0;
else head++;
}
int front(){
return inf[head];
}
bool empty(){
if(tail - head == 0)return true;
else return false;
}
int size(){
return tail - head;
}
};
int imap[200][200];
int k[200] = {0};
int ans[200] = {0};
bool used[200];
int main(){
int n,u[1000];
cin >> n;
for(int i=0;i<200;i++)for(int j=0;j<200;j++)imap[j][i] = INF;
for(int i=0;i<200;i++){
k[i]=ans[i]=u[i]=-1;
}
for(int i=0;i<n;i++){
cin >> u[i];
cin >> k[u[i]];
for(int j=0;j<k[u[i]];j++){
cin >> imap[u[i]][j];
}
}
int h;
for(int i=0;i<n;i++){
int Min = i;
for(int j=i;j<n;j++){
if(u[Min] > u[j])Min = j;
}
h = u[Min];
u[Min] = u[i];
u[i] = h;
}
Queue que = Queue();
que.push(u[0]);
ans[u[0]]=0;
used[u[0]]=true;
while(!que.empty()){
int p = que.front(); que.pop();
for(int i=0;i<k[p];i++){
if(!used[imap[p][i]]){
que.push(imap[p][i]);
used[imap[p][i]] = true;
ans[imap[p][i]] = ans[p] + 1;
}
}
}
for(int i=0;i<n;i++){
cout << u[i] << " " << ans[u[i]] << endl;
}
return 0;
}
| 0
| 2,487,777
|
#include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n) ;i++)
int m,nmin,nmax;
int p[1000];
signed main(void) {
while(true) {
cin >> m >> nmin >> nmax;
if (m == 0) break;
rep (i,m) cin >> p[i];
int n;
int mgap = 0;
int ans = nmin;
for (n = nmin; n <= nmax;n++) {
int gap = p[n-1] - p[n];
if (gap >= mgap) {
mgap = gap;
ans = n;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
#define max_t 24 * 60 * 60
int main(){
int n;
while( cin >> n, n ){
int list[max_t] = {};
while( n-- ){
int d_h, d_m, d_s;
int a_h, a_m, a_s;
scanf("%d:%d:%d", &d_h, &d_m, &d_s );
scanf("%d:%d:%d", &a_h, &a_m, &a_s );
int s, e;
s = d_h * 60 * 60 + d_m * 60 + d_s;
e = a_h * 60 * 60 + a_m * 60 + a_s;
for( int i = s; i < e; i++ ){
list[i]++;
}
}
int max = 0;
for( int i = 0; i < max_t; i++ ){
if( max < list[i] ) max = list[i];
}
cout << max << endl;
}
}
| 0
| 59,279,054
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c=1,x=0,v=0,i,p=0;
string s;
cin >> n >> s;
if(n%2!=0)
{
cout << "No" << endl;
return 0;
}
v=n/2;
if(s.substr(0,v)==s.substr(v))
{
cout << "Yes" <<endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
int main(){
int a,b,c,d;
int x,y;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a<b){
x=a;
}
else{
x=b;
}
if(c<d){
y=c;
}
else{
y=d;
}
int sum=x+y;
printf("%d",sum);
}
| 0
| 96,253,297
|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pii pair<int,int>
using namespace std;
inline void solve(){
int n,res=0,i=1;
cin>>n;
while (i<=n){
res=i;
i*=2;
}
cout << res << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
ll K; cin >> K;
ll N = S.size();
if (N == 1) {
cout << K / 2 << endl;
return 0;
}
bool same = true;
rep(i,N) if (S[0] != S[i]) {same = false; break;}
if (same) {
N = N * K;
cout << N/2 << endl;
return 0;
}
string S1, S2;
int a = 0, b = 0;
if (S.at(0) == S.at(N-1)) {
for (ll i = 0; i < N; i++) {
if (S.at(0) == S.at(i)) {S1.push_back(S.at(i));}
else break;
}
for (ll i = N-1; i >= 0; i--) {
if (S[N-1] == S[i]) {S2.push_back(S[i]);}
else break;
}
a = S1.size();
b = S2.size();
}
ll cnt = 0, cnt2 = 0;;
rep(i,N-1) {
if (S[i] == S[i+1]) {
int j = i + 1;
while (j < N && S[i] == S[j]) j++;
int num = j - i;
for (int k = i+1; k < j; k+=2) S[k]++, cnt++;
if (j < N && num % 2 == 0 && S[j-1] == S[j]) S[j-1]++;
}
}
cnt2 = a / 2 + b / 2 - (a + b) / 2;
cout << cnt * K - cnt2 * (K-1) << endl;
}
| 0
| 60,913,319
|
#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 <math.h>
#include <cmath>
#include <ctime>
#include <stdlib.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i,n) for(int i=0; i<(int) (n); i++)
typedef pair<int, int> P;
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 1000000021;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int b_s(vector<int>& vec, int xx) {
return lower_bound(all(vec), xx) - vec.begin();
}
template<typename T>void vecout(vector<T>& vec) { for (T t : vec) cout << t << " "; cout << endl; }
template<typename TT>void vecin(vector<TT>& vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
bool chmax(int& xx, int yy) {
if (xx < yy) {
xx = yy;
return true;
}
return false;
}
bool chmin(int& xx, int yy) {
if (xx > yy) {
xx = yy;
return true;
}
return false;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) {
return xx * yy / gcd(xx, yy);
}
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n, y,a,b,c;
cin >> n >> y;
for (int i = 0; i <= y / 10000; i++) {
for (int j = 0; j <= (y - i * 10000) / 5000; j++) {
int a = (y - i * 10000 - j * 5000) / 1000;
if (a + i + j == n) {
cout << i << " " << j << " " << a << endl;
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
}
|
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
struct UnionFind
{
vector<int> data;
UnionFind() {}
UnionFind(int size) : data(size, -1) {}
void unite_set(int x, int y){
x = root(x);
y = root(y);
bool is_unite = (x != y);
if (is_unite){
if (data[y] < data[x]){
swap(x, y);
}
data[x] += data[y];
data[y] = x;
}
}
bool is_same(int x, int y){
return root(x) == root(y);
}
int root(int x){
return (data[x] < 0) ? x : data[x] = root(data[x]);
}
int size(int x){
return -data[root(x)];
}
};
int main()
{
int n, q;
int c, a, b;
cin >> n >> q;
struct UnionFind d(n);
vector<int> data;
data.resize(n);
for (int i=0; i<n; ++i){
data[i] = i;
}
for (int i=0; i<q; ++i){
cin >> c >> a >> b;
if(c == 1){
cout << d.is_same(a, b) << endl;
}
else {
d.unite_set(a, b);
}
}
}
| 0
| 90,217,316
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int data[101]={},n,num=0;
while(cin >> n) data[n]++;
for(int i=1;i<=100;i++)if(data[i]>num)num=data[i];
for(int i=1;i<=100;i++)if(data[i]==num)cout<<i<<endl;
return 0;
}
|
#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;
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, z, w;
cin >> n >> z >> w;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = abs(a[n-1] - w);
if(n >= 2) ans = max(abs(a[n-1] - w), abs(a[n-1] - a[n-2]));
cout << ans << endl;
return 0;
}
| 0
| 63,955,947
|
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1<<30;
const ll MOD = ll(1e9+7);
int main(){
int n, m;cin>>n>>m;
rep(i, m){
int a;cin>>a;
n -= a;
}
if(n<0)cout<<-1<<endl;
else cout<<n<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
cin>>N>>M;
vector<bool> isAC(N, false);
vector<int> check(N,0);
int wans=0, cans=0;
int p;
string s;
for(int i=0; i<M; i++){
cin>>p>>s;
if(isAC.at(p-1)) continue;
else{
if(s=="AC"){
isAC.at(p-1) = true;
cans++;
wans+=check.at(p-1);
}
else{
check.at(p-1)++;
}
}
}
cout<<cans<<" "<<wans<<"\n";
}
| 0
| 11,325,838
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,a,i,k,l;
cin>>n;
map<int,int> m;
for(i=0;i<n;i++){
cin>>a;
if(m.count(a)) m.at(a)++;
else m[a]=1;
}
l=m.size();
vector<int> b(l),s(l);
i=0;
for(auto mm:m){
b.at(i)=mm.second;
i++;
}
sort(b.begin(),b.end());
s.at(0)=b.at(0);
for(i=1;i<l;i++) s.at(i)=s.at(i-1)+b.at(i);
for(k=1;k<=n;k++){
if(k>l) cout<<0<<endl;
else if(k==l) cout<<b.at(0)<<endl;
else{
int ll=0;
int rr=n/k+1;
while(rr-ll>1){
int mm=(ll+rr)/2;
int d=distance(b.begin(),lower_bound(b.begin(),b.end(),mm));
if(d==0 || s.at(d-1)+mm*(l-d)>=k*mm) ll=mm;
else rr=mm;
}
cout<<ll<<endl;
}
}
}
|
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef map<string,string> mss;
typedef map<int, vector<int> > mvii;
typedef map<int, int> mii;
typedef queue <int> qi;
typedef map <int, vector<string> > mvis;
typedef map <string, vector<int> > mvsi;
typedef vector <string> vs;
typedef pair <int, int> pii;
typedef vector<pair<int,int> > vpii;
#define MP make_pair
#define SORT(a) sort (a.begin(), a.end())
#define REVERSE(a) reverse (a.begin(), a.end())
#define ALL(a) a.begin(), a.end()
#define PI acos(-1)
#define ms(x,y) memset (x, y, sizeof (x))
#define INF 2000000000
#define pb push_back
#define MAX 100002
#define debug cout<<"A"<<"\n"
#define prnt(a) cout<<a<<"\n"
#define mod 1000000007LL
#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 itrALL(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define lc ((node)<<1)
#define rc ((node)<<1|1)
#define VecPrnt(v) FOR(J,0,v.size()) cout<<v[J]<<" "; cout<<endl
#define endl "\n"
#define PrintPair(x) cout<<x.first<<" "<<x.second<<endl
#define ClearQ(x); while(!x.empty()) x.pop()
#define EPS 1e-9
#define ArrPrint(a,st,en) for(int J=st; J<=en; J++) cout<<a[J]<<" "; cout<<endl;
template <class T> inline T bigmod(T p,T e,T M)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p) % M;
p = (p * p) % M;
} return (T)ret;
}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T, class X> inline bool getbit(T a, X i) { T t=1; return ((a&(t<<i))>0);}
template <class T, class X> inline T setbit(T a, X i) { T t=1;return (a|(t<<i)); }
template <class T, class X> inline T resetbit(T a, X i) { T t=1;return (a&(~(t<<i)));}
inline ll getnum()
{
char c = getchar();
ll num,sign=1;
for(;c<'0'||c>'9';c=getchar())if(c=='-')sign=-1;
for(num=0;c>='0'&&c<='9';)
{
c-='0';
num = num*10+c;
c=getchar();
}
return num*sign;
}
inline ll power(ll a, ll b)
{
ll multiply=1;
FOR(i,0,b)
{
multiply*=a;
}
return multiply;
}
int n; vi graph[MAX];
int dfs(int u, int p)
{
int ret=0;
for(auto v: graph[u])
{
if(v==p) continue;
ret^=(dfs(v,u)+1);
}
return ret;
}
int main()
{
ios_base::sync_with_stdio(0);
int test, cases=1;
cin>>n;
int u, v;
FOR(i,0,n-1)
{
cin>>u>>v;
graph[u].pb(v);
graph[v].pb(u);
}
if(dfs(1,0)) prnt("Alice");
else prnt("Bob");
return 0;
}
| 0
| 96,914,957
|
#include <iostream>
using namespace std;
int main() {
int W, H, N;
int x[110];
int y[110];
int a[110];
cin >> W >> H >> N;
int A[W][H];
for(int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> a[i];
}
for(int j = 0; j < W; j++) {
for(int k = 0; k < H; k++) {
A[j][k] = 1;
}
}
for(int i = 0; i < N; i++) {
if(a[i] == 1) {
for(int j = 0; j < x[i]; j++) {
for(int k = 0; k < H; k++) {
A[j][k] = 0;
}
}
}
if(a[i] == 2) {
for(int j = x[i]; j < W; j++) {
for(int k = 0; k < H; k++) {
A[j][k] = 0;
}
}
}
if(a[i] == 3) {
for(int j = 0; j < W; j++) {
for(int k = 0; k < y[i]; k++) {
A[j][k] = 0;
}
}
}
if(a[i] == 4) {
for(int j = 0; j < W; j++) {
for(int k = y[i]; k < H; k++) {
A[j][k] = 0;
}
}
}
}
int count = 0;
for(int j = 0; j < W; j++) {
for(int k = 0; k < H; k++) {
if(A[j][k] == 1) {
count++;
}
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<int,int>
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
const ll MOD=1e9+7,MAX=5e5+5;
int n,k;
int add(int x, int y)
{
x += y;
while(x >= MOD)
x -= MOD;
while(x < 0)
x += MOD;
return x;
}
int mult(int x, int y)
{
return (1LL * x * y) % MOD;
}
int power(int base, int exp)
{
int ret = 1;
for (; exp; exp >>= 1, base = mult(base, base))
if (exp&1)
ret = mult(ret, base);
return ret;
}
void fast();
int main()
{
fast();
cin>>n>>k;
ll ans[k+1]={},res=0;
for(ll i=k;i>=1;i--){
ll x=power(k/i,n);
for(int j=i*2;j<=k;j+=i)
x=add(x,-ans[j]);
ans[i]=x;
res=add(res,mult(ans[i],i));
}
cout<<res;
}
void fast(){
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
| 0
| 87,451,856
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<pair<ll, ll>>> vvpll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, h, w;
cin >> n >> h >> w;
ll ans = 0;
rep(i, n) {
ll a, b;
cin >> a >> b;
if(a >= h && b >= w) {
ans++;
}
}
out(ans);
re0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all(v) v.begin(), v.end()
struct IoSetup {
IoSetup() {
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
vector< vector< int64_t > > get_combination(int N)
{
vector< vector< int64_t > > mat(N + 1, vector< int64_t >(N + 1));
for(int i = 0; i <= N; i++) {
for(int j = 0; j <= i; j++) {
if(j == 0 || j == i) mat[i][j] = 1;
else mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j];
}
}
return (mat);
}
using int64 = long long;
int64 mod_pow(int64 x, int64 n)
{
int64 ret = 1;
while(n > 0) {
if(n & 1) (ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
int main(){
i64 n, p;
cin >> n >> p;
vector<i64> a(n);
rep(i, n) cin >> a[i];
i64 d = 0, b = 0;
rep(i, n){
if(a[i] % 2 == 1) d++;
else b++;
}
auto comb = get_combination(n);
i64 ans;
if(p == 1){
ans = 0;
for(int i = 1; i <= d; i += 2) ans += comb[d][i];
ans *= mod_pow(2, b);
}else{
ans = 0;
for(int i = 0; i <= d; i += 2) ans += comb[d][i];
ans *= mod_pow(2, b);
}
cout << ans << endl;
}
| 0
| 27,701,512
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const ll INF=2e15;
const double PI=acos(-1);
vector<pair<ll,int>> vectorCnt(vector<ll> a) {
sort(a.begin(),a.end());
int n=a.size();
vector<pair<ll,int>> b;
int cnt=1;
rep(i,n-1) {
if (a[i+1]!=a[i]) {
b.push_back(make_pair(a[i],cnt));
cnt=1;
} else {
++cnt;
}
}
b.push_back(make_pair(a[n-1],cnt));
return b;
}
int main() {
ios_base::sync_with_stdio(false);
ll n,m;
cin >> n >> m;
vector<ll> a(n+1);
ll ans=0;
rep(i,n) cin >> a[i+1];
rep(i,n) {
a[i+1]+=a[i];
a[i+1]=a[i+1]%m;
}
vector<pair<ll,int>> b=vectorCnt(a);
rep(i,b.size()) {
ll cnt=b[i].second;
ans+=cnt*(cnt-1)/2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge{
public:
int from,to,value;
Edge(LL a,LL b,LL c){
from = a;
to = b;
value = c;
}
Edge(LL a,LL b){
from = a;
to = b;
}
};
int main(){
int N,A,B,C,X;
while(cin >> N >> A >> B >> C >> X){
if(N == 0 && A == 0 && B == 0 && C == 0 && X == 0)return 0;
vector<int> vec;
for(int a = 0;a < N;a++){
int b;cin >> b;
vec.push_back(b);
}
int ans = 0;
int i = 0;
while(1){
if(vec.at(i) == X){
i++;
}
X = (A*X+B)%C;
if(ans >= 10001){
cout<<-1<<endl;
break;
}
if(i == N){
cout<<ans<<endl;
break;
}
ans++;
}
}
}
| 0
| 16,409,795
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MAX = 100;
const long long INF = 1e10;
long long M[MAX][MAX];
int main(){
int V, E;
cin >> V >> E;
rep(i,V){
rep(j,V){
if(i == j){
M[i][j] = 0;
}else{
M[i][j] = INF;
}
}
}
int s, t;
long long d;
rep(i,E){
cin >> s >> t >> d;
M[s][t] = d;
}
for(int k = 0; k < V; k++){
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++){
if(M[i][k] != INF && M[k][j] != INF){
M[i][j] = min(M[i][j], M[i][k] + M[k][j]);
}
}
}
}
for(int i = 0; i < V; i++){
if(M[i][i] < 0){
printf("NEGATIVE CYCLE\n");
return 0;
}
}
for(int i = 0; i < V; i++){
for(int j = 0; j < V; j++){
if(M[i][j] == INF){
printf("INF");
}else{
printf("%d", M[i][j]);
}
if(j < V - 1){
printf (" ");
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF=100000000;
const int MAX=1000;
typedef pair<int, int> P;
int N, M;
int sx, sy;
int gx[10], gy[10];
char maze[MAX][MAX];
int d[MAX][MAX];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int bfs(int g)
{
queue<P> que;
for(int i=0; i<N; i++)
for(int j=0; j<M; j++)
d[i][j]=INF;
que.push(P(sx, sy));
d[sx][sy]=0;
while(que.size())
{
P p = que.front();
que.pop();
if(p.first==gx[g]&&p.second==gy[g])
break;
for(int i=0; i<4; i++)
{
int nx=p.first+dx[i];
int ny=p.second+dy[i];
if(nx>=0&&nx<N&&ny>=0&&ny<M&&maze[nx][ny]!='X'&&d[nx][ny]==INF)
{
que.push(P(nx,ny));
d[nx][ny] = d[p.first][p.second]+1;
}
}
}
return d[gx[g]][gy[g]];
}
int main()
{
int gn;
scanf("%d%d%d", &N, &M, &gn);
getchar();
for(int i=0; i<N; i++)
{
for(int j=0; j<M; j++)
scanf("%c", &maze[i][j]);
getchar();
}
for(int i=0; i<N; i++)
for(int j=0; j<M; j++)
{
if(maze[i][j]=='S')
{
sx=i;
sy=j;
}
if(maze[i][j]=='1')
{
gx[1]=i;
gy[1]=j;
}
if(maze[i][j]=='2')
{
gx[2]=i;
gy[2]=j;
}
if(maze[i][j]=='3')
{
gx[3]=i;
gy[3]=j;
}
if(maze[i][j]=='4')
{
gx[4]=i;
gy[4]=j;
}
if(maze[i][j]=='5')
{
gx[5]=i;
gy[5]=j;
}
if(maze[i][j]=='6')
{
gx[6]=i;
gy[6]=j;
}
if(maze[i][j]=='7')
{
gx[7]=i;
gy[7]=j;
}
if(maze[i][j]=='8')
{
gx[8]=i;
gy[8]=j;
}
if(maze[i][j]=='9')
{
gx[9]=i;
gy[9]=j;
}
}
int asw = bfs(1);
for(int i=1; i<gn; i++)
{
sx=gx[i]; sy=gy[i];
asw += bfs(i+1);
}
printf("%d\n", asw);
return 0;
}
| 0
| 61,212,424
|
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main(){
while(true){
int n, m, p;
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){ break; }
vector<int> x(n);
for(int i = 0; i < n; ++i){ cin >> x[i]; }
int sum = accumulate(x.begin(), x.end(), 0);
int answer = 0;
if(x[m - 1] > 0){ answer = (sum * (100 - p)) / x[m - 1]; }
cout << answer << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmax(x,y) x = max(x,y)
int dist(int D, vector<int> a, vector<int> b){
int res = 0;
rep(i,D){
res += (a[i] - b[i]) * (a[i] - b[i]);
}
return res;
}
bool issqrt(int a){
return int(pow(int(sqrt(a)),2)) == a;
}
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> X(N);
rep(i,N){
rep(j,D){
int tmp;
cin >> tmp;
X[i].push_back(tmp);
}
}
int ans=0;
for(int i = 0; i < N; i++){
for(int j = i+1; j<N; j++){
if(issqrt(dist(D, X[i], X[j]))){
ans++;
}
}
}
cout << ans << endl;
}
| 0
| 35,362,049
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
int n, a[MAXN];
void run(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
int mx = 0;
ll ans = 0;
for(int i = 1; i <= n; i++)
ans += max(0, mx - a[i]), mx = max(mx, a[i]);
DEBUG(ans);
}
int main(){
#ifdef Irene
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
run(); return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
int n;
cin >> n;
int ans = 0;
int head = 0, last = 0, both = 0;
rep(i, n)
{
string s;
cin >> s;
rep(i, s.size() - 1)
{
if (s[i] == 'A' && s[i + 1] == 'B')
ans++;
}
if (s[0] == 'B' && s[s.size() - 1] == 'A')
{
both++;
continue;
}
if (s[0] == 'B')
head++;
if (s[s.size() - 1] == 'A')
last++;
}
int mini = min(head, last);
int maxi = max(head, last);
ans += max(0, both - 1);
if (both > 0 && mini > 0)
{
ans++;
mini--;
}
if (both > 0 && maxi > 0)
{
ans++;
maxi--;
}
ans += max(0, mini);
cout << ans << endl;
return 0;
}
| 0
| 5,434,135
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 998244353;
LLONG lengths[51], patties[51];
LLONG GetPattyNum(LLONG N, LLONG X)
{
if (X == 1) return N == 0 ? 1 : 0;
else if (X <= lengths[N - 1] + 1) return GetPattyNum(N - 1, X - 1);
else if (X == lengths[N - 1] + 2) return patties[N - 1] + 1;
else return GetPattyNum(N - 1, X - lengths[N - 1] - 2) + patties[N - 1] + 1;
}
int main()
{
LLONG N, X; cin >> N >> X;
lengths[0] = 1; patties[0] = 1;
for (int l = 1; l <= 50; ++l)
{
lengths[l] = lengths[l - 1] * 2 + 3;
patties[l] = patties[l - 1] * 2 + 1;
}
cout << GetPattyNum(N, X) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
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 int INF=1e18;
const int MOD=1e9+7;
const int MAX=200001;
signed main(){
int N;cin>>N;
string S;cin>>S;
int lsum=0,rsum=0;
REP(i,N){
if(S[i]==')'){
if(rsum==0)lsum++;
else rsum--;
}
else{
rsum++;
}
}
string ans="";
REP(i,lsum)ans+='(';
ans+=S;
REP(i,rsum)ans+=')';
cout<<ans<<endl;
}
| 0
| 59,039,349
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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 long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int n,p;
ll ans=0;
cin >>n>>p;
string s;
cin>>s;
map<ll,ll>dis;
if(p==2){
for(int i=0;i<s.size();i++){
if((s[i]-'0')%2==0){
ans+=i+1;
}
}
cout<<ans<<endl;
return 0;
}
if (p == 5)
{
for (int i = 0; i < s.size(); i++)
{
if ((s[i] - '0') % 5 == 0)
{
ans += i + 1;
}
}
cout << ans << endl;
return 0;
}
ll base=1LL;
ll cnt=0LL;
dis[0]=1;
for(int i=s.size()-1;i>=0;i--){
cnt+=(base*(s[i]-'0'))%p;
cnt%=p;
dis[cnt]+=0;
dis[cnt]++;
base*=10LL;
base%=p;
}
repi(itr,dis){
ans+=(itr->S)*(-1+itr->S)/2;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define LLI long long int
using namespace std;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T,U>;
template <typename T> T gcd(T a, T b){a = abs(a); b = abs(b); if(a<b) swap(a,b); while(b>0){a %= b; swap(a,b);} return a;}
template <typename T> T lcm(T a, T b){return (1LL * a * b) / gcd(a,b);}
template <typename T, typename U> P<T,U> operator+(const P<T,U> &a, const P<T,U> &b){return {a.first + b.first, a.second + b.second};}
template <typename T, typename U> P<T,U> operator-(const P<T,U> &a, const P<T,U> &b){return {a.first - b.first, a.second - b.second};}
template <typename T> bool isSquare(T n){T rt = sqrt(n); return rt*rt == n;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
if(!isSquare(1+8*n)){
cout << "No" << endl;
return 0;
}
int k = ((int)sqrt(1+8*n)+1)/2;
cout << "Yes" << endl;
cout << k << endl;
vector<vector<int>> s(k);
int t = 1;
FOR(i,0,k){
FOR(j,t,t+k-1-i){
s[i].push_back(j);
}
FOR(j,0,k-1-i){
s[i+j+1].push_back(t+j);
}
t += k-1-i;
}
REP(i,k){
cout << k-1 << " ";
REP(j,s[i].size()){
if(j!=0) cout << " ";
cout << s[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 44,015,292
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const long long INF = 1000000000000;
const long long N = 10000;
long long n,m;
struct edge{
long long from,to,cost;
}w[N];
long long d[N];
void path(long long s){
for(long long i=0;i<n;i++) d[i]=INF;
d[s] = 0;
while(true){
bool u = false;
for(long long i=0;i<m;i++){
edge e = w[i];
if(d[e.from]!=INF&&d[e.to]>d[e.from]+e.cost){
d[e.to] = d[e.from]+e.cost;
u = true;
}
}
if(!u) break;
}
}
bool f(){
memset(d,0,sizeof(d));
for(long long i=0;i<n;i++){
for(long long j=0;j<m;j++){
edge e = w[j];
if(d[e.to]>d[e.from]+e.cost){
d[e.to]=d[e.from]+e.cost;
if(i==n-1) return true;
}
}
}
return false;
}
int main(){
while((scanf("%lld%lld",&n,&m))!=EOF){
for(long long i=0;i<m;i++){
scanf("%lld%lld%lld",&w[i].from,&w[i].to,&w[i].cost);
}
if(f()) {
printf("NEGATIVE CYCLE\n");
continue;
}
for(long long i=0;i<n;i++){
path(i);
for(long long j=0;j<n;j++){
if(d[j]==INF&&j!=n-1) printf("INF ");
else if(d[j]==INF&&j==n-1) printf("INF");
else if(d[j]!=INF&&j==n-1)printf("%lld",d[j]);
else if(d[j]!=INF&&j!=n-1)printf("%lld ",d[j]);
}
printf("\n");
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
while(cin>>a,a){
map<string,string>s;
for(int b=0;b<a;b++){
string c,k;
cin>>c>>k;
s.insert(pair<string,string>(c,k));
}
int d;
cin>>d;
string r="";
for(int e=0;e<d;e++){
string t;
cin>>t;
if(s[t].empty()==true)s[t]=t;;
r+=s[t];
}
cout<<r<<endl;
}
}
| 0
| 75,490,575
|
#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++)
#define all(v) v.begin(), v.end()
#define println(x) cout << x << endl
#define fi first
#define se second
#define Yes println("Yes")
#define No println("No")
#define YES println("YES")
#define NO println("NO")
const int di[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[8] = {0, 1, 0, -1, -1, 1, 1, -1};
using pii = pair<int, int>;
int h, w;
bool on_grid(int i, int j)
{
if (i < 0 || i >= h) return false;
if (j < 0 || j >= w) return false;
return true;
}
bool is_road(int i, int j, vector<vector<char>>& grid)
{
if (on_grid(i, j) == false) return false;
if (grid[i][j] == '#') return false;
return true;
}
int main()
{
cin >> h >> w;
vector<vector<char>> grid(h, vector<char>(w));
vector<vector<int>> t(h, vector<int>(w, -1));
queue<pii> q;
rep(i, h)rep(j, w)
{
char ch; cin >> ch;
if (ch == '#')
{
q.push(pii(i, j));
t[i][j] = 0;
}
grid[i][j] = ch;
}
while (!q.empty())
{
pii p = q.front(); q.pop();
rep(k, 4)
{
if (is_road(p.fi+di[k], p.se+dj[k], grid) && t[p.fi+di[k]][p.se+dj[k]] == -1)
{
q.push(pii(p.fi+di[k], p.se+dj[k]));
t[p.fi+di[k]][p.se+dj[k]] = t[p.fi][p.se] + 1;
}
}
}
int max_manip = 0;
rep(i, h)rep(j, w)
{
max_manip = max(max_manip, t[i][j]);
}
println(max_manip);
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<vector<int>> data(N, vector<int>(26,0));
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 0; j < S.size(); j++) {
int M = S.at(j) - '0';
data.at(i).at(M-49)++;
}
}
vector<int>A(26);
for (int i = 0; i < 26; i++) {
int MIN = 50;
for (int j = 0; j < N; j++) {
if (MIN > data.at(j).at(i)){
MIN = data.at(j).at(i);
}
if (j == N-1){
A.at(i) = MIN;
}
}
for (int k = 0; k < A.at(i); k++) {
printf("%c", i + 'a');
}
}
cout << endl;
}
| 0
| 84,354,392
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
1<=a,b,c,d<=10;
cin>>a>>b>>c>>d;
if (a+b>c+d) {
cout << "Left" << endl;
}
else if (a+b==c+d) {
cout << "Balanced" << endl;
}
else {
cout << "Right" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
ll k;
cin >> s >> k;
int n = s.size();
ll ans = 0;
if (all_of(s.begin(), s.end(), [s](char x) { return x == s[0]; }))
ans = n * k / 2;
else {
ll cnt = 0;
rep(i, n - 1) {
if (s[i] == s[i + 1] && s[i] == s[i + 2])
cnt++, i += 1;
else if (s[i] == s[i + 1])
cnt++;
}
ans = cnt * k;
if (s[0] == s[n - 1]) {
int a = 0, b = 0;
rep(i, n) {
if (s[0] == s[i])
a++;
else
break;
}
for (int i = n - 1; i >= 0; i--) {
if (s[n - 1] == s[i])
b++;
else
break;
}
ans -= (a / 2 + b / 2 - (a + b) / 2) * (k - 1);
}
}
cout << ans << endl;
return 0;
}
| 0
| 77,258,383
|
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const double pi = acos(-1);
void koch(double x1, double y1, double x2, double y2, int n){
double tx1 = (2*x1 + x2) / 3.0;
double ty1 = (2*y1 + y2) / 3.0;
double tx2 = (x1 + 2*x2) / 3.0;
double ty2 = (y1 + 2*y2) / 3.0;
if(n > 0){
koch(x1, y1, tx1, ty1, n-1);
cout << setprecision(10) << fixed;
cout << tx1 << " " << ty1 << endl;
double ux = tx1 + (tx2-tx1) * cos(pi/3.0) - (ty2-ty1) * sin(pi/3.0);
double uy = ty1 + (tx2-tx1) * sin(pi/3.0) + (ty2-ty1) * cos(pi/3.0);
koch(tx1, ty1, ux, uy, n-1);
cout << ux << " " << uy << endl;
koch(ux, uy, tx2, ty2, n-1);
cout << tx2 << " " << ty2 << endl;
koch(tx2, ty2, x2, y2, n-1);
}
}
int main(){
int n;
cin >> n;
cout << setprecision(10) << fixed;
cout << 0.0 << " " << 0.0 << endl;
koch(0.0, 0.0, 100.0, 0.0, n);
cout << 100.0 << " " << 0.0 << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
string t_str;
string h_str;
string taro[1009];
string hanako[1009];
int t_score=0;
int h_score=0;
int i;
cin >> n;
for(i=0;i<n;i++){
cin >> t_str >> h_str;
transform(t_str.begin(),t_str.end(),t_str.begin(),::tolower);
transform(h_str.begin(),h_str.end(),h_str.begin(),::tolower);
taro[i]=t_str;
hanako[i]=h_str;
}
for(i=0;i<n;i++){
if(taro[i]>hanako[i])
t_score+=3;
else if(taro[i]<hanako[i])
h_score+=3;
else{
t_score+=1;
h_score+=1;
}
}
cout << t_score << " " << h_score << endl;
}
| 0
| 97,235,384
|
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long long int , int>
#define ll long long
long long int A[100004];
long long int B[100004];
ll int N;
long long sum=0;
int main(){
scanf("%lld",&N);
rep(i,N){
scanf("%lld",&A[i]);
if(i>0)B[i-1]=A[i]-A[i-1];
sum+=A[i];
}
B[N-1]=A[0]-A[N-1];
long long int X;
if((2*sum)%(N*(N+1))==0){
X=(long long int)(2*sum/(N*(N+1)));
}else{
printf("NO\n");return 0;
}
long long int ysum=0;
rep(i,N){
ll int y=(ll int)((B[i]+(N-1)*X)/N);
if((B[i]+(N-1)*X)%N==0&&y<=X){
ysum+=y;
}else{
printf("NO\n");return 0;
}
}
if(ysum==X*(N-1)){
printf("YES\n");return 0;
}
printf("NO\n");return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
bool isAC(const string &S) {
if (S[0] != 'A') return false;
int cnum = 0;
bool exist = false;
for (int i = 1; i < S.size(); ++i) {
if (i >= 2 && i + 1 < S.size() && S[i] == 'C') ++cnum;
if (S[i] >= 'A' && S[i] <= 'Z' && S[i] != 'C') exist = true;
}
if (cnum != 1) return false;
if (exist) return false;
return true;
}
int main() {
string S;
cin >> S;
if (isAC(S)) cout << "AC" << endl;
else cout << "WA" << endl;
}
| 0
| 2,024,740
|
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main(){
bool F=true;bool R=true;
while(1){char str[250]={},ch;
for(int i=0;i<245;i++)
{scanf("%c",&ch);if(ch=='.'&&R==false&&i==1){F=false;break;}
if(ch=='.'){break;}
str[i]=ch;}
if(F==false){break;}
int ks=0,kl=0,ms=0,ml=0;
bool f=true;int p[200]={};int y=0;bool G=true;
if(str[1]=='.'&&str[0]=='\n')F=false;
for(int i=0;i<200;i++)
{
if(str[i]=='('){ms++;y++;p[y]=1;}
else if(str[i]=='['){ks++;y++;p[y]=5;}
else if(str[i]==')'){ml++;if(p[y]==5||p[y]==0){f=false;}if(ms<ml){f=false;}y--;}
else if(str[i]==']'){kl++;if(p[y]==1||p[y]==0){f=false;}if(ks<kl){f=false;}y--;}
}
if(F==true){
if(f!=false&&ms==ml&&ks==kl)cout<<"yes"<<endl;
else{cout<<"no"<<endl;
}
}
R=false;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
typedef long long ll;
using namespace std;
int main() {
int a,b,c,d,w1,w2;
cin>>a>>b>>c>>d;
w1=min(a,b);
w2=min(c,d);
cout<<w1+w2<<endl;
return 0;
}
| 0
| 34,669,945
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <string>
using namespace std;
int main(){
double x1, y1, x2, y2, out;
cin >> x1 >> y1 >> x2 >> y2;
out = sqrt(pow(x2-x1, 2.0)+pow(y2-y1, 2.0));
cout << fixed << setprecision(10) << out << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAX 200000
typedef long long ll;
int main()
{
ll x,sum[MAX],tot,MIN;
int n;
scanf("%d",&n);
sum[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%lld",&x);
sum[i]=sum[i-1]+x;
}
tot=sum[n];
MIN=abs(tot-2*sum[1]);
for(int i=2;i<=n-1;i++)
{
MIN=min(MIN,abs(tot-2*sum[i]));
}
printf("%lld",MIN);
return 0;
}
| 0
| 87,299,905
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
char a, b; cin >> a >> b;
if(a == b) cout << "H" << '\n';
else cout << "D" << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int vis[200005];
int main()
{
int n,m,i,j,a[200005];
memset(vis,0,sizeof(vis));
cin>>n;
int cnt=1;
while(1)
{
if(vis[n]==1)
{
cout<<cnt<<endl;
break;
}
else vis[n]=1;
if(n%2==0)
{
n=n/2;
}
else n=3*n+1;
cnt++;
}
return 0;
}
| 0
| 48,209,459
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=0;
for(int i=0;i<n && k--;i++) {
ans+=a[i];
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n,m,p;
scanf("%d%d%d",&n,&m,&p);
if(n+m+p==0)return 0;
int sum = 0;
int win = 0;
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
sum += x;
if(i==m-1)win = x;
}
sum *= 100;
p = 100 - p;
if(win == 0){
puts("0");
}else{
int ans = sum * p / (100 * win);
printf("%d\n",ans);
}
}
}
| 0
| 72,894,430
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
int r, s, p;
string T;
map<int, bool> win;
ll ans;
ans = 0;
cin >> n >> k;
cin >> r >> s >> p;
cin >> T;
for (int i = 1; i <= T.size(); i++){
char te;
te = T[i-1];
if (k < i && te == T[i-1-k]) {
if (win[i-k] == false) {
if (te == 'r') ans += p;
if (te == 's') ans += r;
if (te == 'p') ans += s;
win[i] = true;
} else {
win[i] = false;
}
} else {
if (te == 'r') ans += p;
if (te == 's') ans += r;
if (te == 'p') ans += s;
win[i] = true;
}
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define GS(name) \
string(name); \
cin >> (name);
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
string to_string(string s) {
return s;
}
template <class T>
string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug() {
cerr << endl;
}
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI(N);
GS(s);
for (string prm : {"SS", "SW", "WS", "WW"}) {
string ans = prm;
for (int i = 1; i < N - 1; ++i) {
if (s[i] == 'o' ^ ans[i] == 'W') {
ans += ans[i - 1];
} else {
ans += ans[i - 1] == 'S' ? 'W' : 'S';
}
}
if ((ans[0] == 'W') ^ (s[0] == 'o') ^ (ans[1] != ans[N - 1])) {
if ((ans[N - 1] == 'W') ^ (s[N - 1] == 'o') ^ (ans[0] != ans[N - 2])) {
print(ans);
return 0;
}
}
}
print(-1);
return 0;
}
| 0
| 45,690,124
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=9187201950435737471;
const int N=100005;
const int INF=1e9+7;
const long double PI=acos(-1);
void solve(int T){
ll n;
cin>>n;
cout<<(n*(n+1))/2<<"\n";
}
int main() {
fastio
int T=1;
for(int i=1;i<=T;i++){
solve(i);
}
return 0;
}
|
#include<bits/stdc++.h>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdlib.h>
#include<string>
#define mp make_pair
#define ss second
#define ff first
#define pb push_back
#define io ios_base::sync_with_stdio;cin.tie(0);cout.tie(0)
#define READ freopen("input.txt","r", stdin)
#define mem(a,b) memset(a, b, sizeof(a))
#define snd(a) scanf("%d",&a)
#define snl(a) scanf("%lld",&a)
#define snul(a) scanf("%ull",&a)
#define rep(i,k,n) for(int i=k;i<n;i++)
#define rev(j,n,k) for(int j=n;j>=k;j--)
#define TC int tc;cin>>tc;while(tc--)
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a / __gcd(a, b) ) * b)
#define PI 2*acos(0.0)
#define MAX 1000000000
#define inf 1e18
#define MOD 1000000007
#define case(i) "Case "<<i++<<": "
#define nscase(i) "Case "<<i++<<":"
#define base(n,b) floor(log(n)/log(b))+1
#define onecnt(x) __builtin_popcount(x)
#define to_binary(n) bitset<8>(n).to_string()
#define endl '\n'
#define esc cout<<"\n"
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef std::map<long long,int> mli;
typedef std::map<long long,long long> mll;
typedef std::map<int,int> mii;
using namespace __gnu_pbds;
typedef tree<
ll,
null_type,
less<ll>,
rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
template <typename T>
std::string toString( T Number )
{
std::ostringstream ss;
ss << Number;
return ss.str();
}
const ll ten5=100000;
const ll ten6 =1000000;
const ll ten7 =10000000;
const ll ten8 =100000000;
const ll ten9 =1000000000;
const ll mod=1000000007;
int main()
{
io;
char b,c;
cin>>b;
if(b=='A')c='T';
else if(b=='T')c='A';
else if(b=='C')c='G';
else if(b=='G')c='C';
cout<<c<<endl;
return 0;
}
| 0
| 27,044,733
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char A[100];
cin>>A;
int n=strlen(A)/2;
int i;
for(i=0;i<n;i++){
if(A[i]!=A[n+1+i]){printf("No");return 0;}
}
int s=n/2;
for(i=0;i<s;i++){
if(A[i]!=A[n-1-i]){printf("No");return 0;}
}
printf("Yes\n");
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string a, b;
cin >> a >> b;
int ans = 1e9;
int n = a.size();
int m = b.size();
for (int i = 0; i < n - m + 1; i++)
{
int cnt = 0;
int j = 0;
int x = i;
for (int k = 1; k <= m; k++)
{
cnt += (a[x] != b[j]);
x++;
j++;
}
ans = min(ans, cnt);
}
cout << ans;
return 0;
}
| 0
| 17,528,649
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define endl "\n"
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fr(a,b,c) for(int a=b; a<c; a++)
#define frr(a,b,c) for(int a=b;a>=c;a--)
#define pb push_back
#define pii pair<int,int>
#define R(a) ll a; cin >> a;
#define RS(a) string a; cin >> a;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
#define RA(a, n) ll a[(n) + 1] = {}; fr(i, 1, (n)+1) {cin >> a[i];}
#define RM(a, n, m) int a[n + 1][m + 1] = {}; fr(i, 1, n+1) {fr(j, 1, m+1) cin >> a[i][j];}
#define reset(X) memset(X, 0, sizeof(X))
using vi=vector<int>;
const int inf = 1e18;
const int mod=1e9+7;
unsigned int power(int x, unsigned int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
bool isPrime(int n)
{ if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
int modInverse(int n, int p)
{
return power(n, p-2, p);
}
const int maxn=2e3+1;
int f[maxn];
int nCr(int n,int r)
{
int ans=f[n];
ans=(ans*modInverse(f[r],mod))%mod;
ans=(ans*modInverse(f[n-r],mod))%mod;
return ans;
}
signed main()
{
fastio;
R(a);R(b);R(c);R(d);
int mx=a*c;
mx=max(mx,a*d);
mx=max(mx,b*c);
mx=max(mx,b*d);
cout<<mx<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
#define ld long double
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,k; cin>>n>>k;
cout<<(n%k!=0)<<endl;
return 0;
}
| 0
| 27,666,811
|
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int n, m;
cin >> n >> m;
VVL xyz(n, VL(3));
rep(i,n) cin >> xyz[i][0] >> xyz[i][1] >> xyz[i][2];
ll ans = 0;
rep(i, 1<<3){
VI sgn(3, 1);
rep(j, 3) if (i>>j & 1) sgn[j] *= -1;
VL sums(n);
rep(j,n){
rep(k,3) sums[j] += xyz[j][k] * sgn[k];
}
sort(rall(sums));
ll sum = 0;
rep(j,m) sum += sums[j];
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
}
| 0
| 1,345,550
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, T;
cin >> N >> T;
vector<ll> time(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> time[i];
}
for (int i = 0; i < N-1; i++) {
if (time[i+1] - time[i] < T) {
ans += time[i+1]- time[i];
} else {
ans += T;
}
}
ans += T;
cout << ans << endl;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
short ss[90061];
short ee[90061];
int ans[10000];
int c = 0;
int ch2int(char c){
return (int)c - (int)'0';
}
int st2int(string s){
return (ch2int(s[0]) * 10 + ch2int(s[1])) * 3600 + (ch2int(s[3]) * 10 + ch2int(s[4])) * 60 + ch2int(s[6]) * 10 + ch2int(s[7]);
}
int main()
{
while(true){
int n;
cin >> n;
if(n == 0) break;
c++;
int maxi = 0;
vector<string> s(n, ""), e(n, "");
for (int j = 0; j <= 90060; j++)
{
ss[j] = 0;
ee[j] = 0;
}
for (int i = 0; i < n; i++)
{
cin >> s[i] >> e[i];
ss[st2int(s[i])] = ss[st2int(s[i])] + 1;
ee[st2int(e[i])] = ee[st2int(e[i])] + 1;
}
int count = 0;
for (int j = 0; j <= 90060; j++)
{
count = count + ss[j];
count = count - ee[j];
if (maxi < count)
{
maxi = count;
}
}
ans[c - 1] = maxi;
}
for(int k = 0; k < c; k++) cout << ans[k] << endl;
return 0;
}
| 0
| 51,453,643
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1LL << 30;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int cnt= 0;
REP(i,s.size()) if(s[i]=='o') cnt++;
cout << ((cnt+(15-s.size())>=8)?"YES":"NO") << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int i;
int ch = 0;
string t = "YAKI";
if(s.size() < 4)
{
ch = 1;
}
if(ch == 0)
{
for(i = 0; i < 4; i++)
{
if(s.at(i) != t.at(i))
{
ch = 1;
break;
}
}
}
if(ch == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
| 0
| 54,050,308
|
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll k;
ll n=50;
ll f(ll i) {
if (k%n==0) return k/n;
if (i>=k%n) return k/n;
return k/n+1;
}
int main() {
scanf("%lld",&k);
printf("%lld\n",n);
for (ll i=0;i<n;i++) {
printf("%lld ",(n+1)*f(i)-k+i);
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
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; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
int main() {
init();
ld ans = 0;
ll cnt = 0;
ll N, M, D;
cin >> N >> M >> D;
if(D==0)ans = (M - 1) / (ld)N;
else ans = (N - D) *2* (M - 1) / (ld)N / (ld)N;
cout << ans << endl;
}
| 0
| 91,774,514
|
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) cout << s << endl; return 0;
#define printFix(n,i) cout << fixed << setprecision(i) << n << endl; return 0;
#define yes cout << "Yes" << endl; return 0;
#define no cout << "No" << endl; return 0;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n)+1; ++i)
#define bitrep(i,n) for (int i = 0; i < (1<<(n));i++)
#define isOne(bit,i) (bit & (1 << i))
using ll = long long;
using pii = pair<int, int>;
using si = set<int>;
const ll modSeed = pow(10,9) + 7;
const int INF = 100'000'000;
template <typename T>
vector<T> getValues(ll num){
vector<T> values(num);
for(ll i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
template <typename T>
vector<T> getSumVec(vector<T> vec){
vector<T> values(vec.size()+1,0);
for(ll i=0;i<values.size()-1;i++){
values.at(i+1) = values.at(i) + vec.at(i);
}
return values;
}
string S;
ll N,cnt,ans;
int main(){
cin >>N;
auto inputs = getValues<ll>(N);
ll height = 0;
rep(i,N){
if(i==0){
height = inputs.at(i);
}
if(inputs.at(i)<height){
ll step = height - inputs.at(i);
ans +=step;
}else{
height = inputs.at(i);
}
}
printl(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int cal(string x, string y)
{
int n1 = x.size(), n2 = y.size();
vector<vector<int> > dp(n1 + 5, vector<int>(n2 + 5, 0));
for (int i = 0; i < n1; ++i) {
for (int j = 0; j < n2; ++j) {
if (x[i] == y[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
}
else {
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
}
}
return dp[n1][n2];
}
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
for (int i = 0; i < n; ++i) {
string x, y;
cin >> x >> y;
int len = cal(x, y);
fprintf(stdout, "%d\n", len);
}
return 0;
}
| 0
| 85,164,107
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans = b-a+1;
ll e = c/gcd(c,d)*d;
ans -= b/c-(a-1)/c+b/d-(a-1)/d-(b/e-(a-1)/e);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back()
#define ALL(a) (a).begin(),(a).end()
#define int long long
using namespace std;
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;}
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k; cin >> n >> k;
vector<P> v;
rep(i,n){
int t,d; cin >> t >> d;
t--;
v.pb({d,t});
}
sort(ALL(v),greater<P>());
vector<bool> used(n,0);
priority_queue<int,vector<int>,greater<int>> pq;
vector<ll> ans(n+1,0);
ll res=0,hoge=0;
rep(i,k){
res+=v[i].fi;
if(!used[v[i].se]){
used[v[i].se]=1;
hoge++;
}else{
pq.push(v[i].fi);
}
}
ans[hoge]=res;
for(int i=k;i<n;i++){
if(pq.empty()) break;
if(!used[v[i].se]){
used[v[i].se]=1;
hoge++;
ans[hoge]=ans[hoge-1]+v[i].fi-pq.top();
pq.pop();
}
}
ll fuga=0;
rep(i,n+1){
if(ans[i]!=0) ans[i]+=i*i;
chmax(fuga,ans[i]);
}
cout << fuga << endl;
}
| 0
| 88,701,549
|
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int n,a,f;
int t[N],maxn=-N;
void hs(int x){
for(int i=2;i<=sqrt(x);){
if(x%i==0){
t[i]++;
while(x%i==0) x/=i;
}
else i++;
}
if(x>1) t[x]++;
}
int main(){
scanf("%d%d",&n,&a);
f=a;
for(int i=2;i<=n;i++){
scanf("%d",&a);
if(maxn<a) maxn=a;
f=__gcd(f,a);
hs(a);
}
if(f==1){
for(int i=2;i<=maxn;i++){
if(t[i]>1){
printf("setwise coprime\n");
return 0;
}
}
printf("pairwise coprime\n");
return 0;
}
else{
printf("not coprime\n");
return 0;
}
return 0;
}
|
#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;
}
const ll INF = LONG_LONG_MAX / 2;
int N;
vector<ll> as;
vector<ll> bs;
int main(void) {
cin >> N;
ll sum = 0;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
as[i] -= (i + 1);
sum += as[i];
}
bs = as;
sort(bs.begin(), bs.end());
if (N % 2 == 0) {
vector<ll> cand_b = {bs[N / 2], bs[N / 2 - 1]};
ll ans = INF;
for (auto b : cand_b) {
ll acc = 0;
for (int i = 0; i < N; i++) {
acc += abs(bs[i] - b);
}
chmin(ans, acc);
}
cout << ans << endl;
} else {
ll b = bs[N / 2];
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += abs(bs[i] - b);
}
cout << ans << endl;
}
return 0;
}
| 0
| 26,969,970
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const long double EPS = 1e-10;
const long long INF = 1e18;
const int MOD = (int)1e9 + 7;
const long double PI = acos(-1.0L);
int main() {
ll W, H, x, y;
cin >> W >> H >> x >> y;
cout << fixed << setprecision(20) << (double)W * H / 2.0;
if (W == x * 2 && H == y * 2) {
cout << " " << 1 << endl;
} else {
cout << " " << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n), r(n);
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n; i++) cin >> q[i];
iota (r.begin(), r.end(), 1);
bool pf = true, qf = true;
int a, b;
for (int i = 1; pf || qf; i++) {
if (p == r) {
a = i;
pf = false;
}
if (q == r) {
b = i;
qf = false;
}
next_permutation (r.begin(), r.end());
}
cout << abs(a-b) << endl;
}
| 0
| 59,909,252
|
#include <bits/stdc++.h>
using namespace std;
vector <long long> primeNumbers;
bool isPrime(long long n){
if(n==0)return false;
if(n==1)return false;
if(n==2)return true;
double sq = sqrt(n);
for(long long i = 2; i <= sq; i++){
if(n%i==0){
return false;
}
}
return true;
}
void getPrimeNumbers(long long n){
if(isPrime(n)){
primeNumbers.push_back(n);
return;
}
double sq = sqrt(n);
if(n==1){
return;
}
for(long long i = 2; i<=sq; i++ ){
if(n%i==0){
if(isPrime(i))primeNumbers.push_back(i);
getPrimeNumbers(n/i);
break;
}
}
}
bool isSemiCommonMulti(long long value, vector <long> &v){
int cnt = 0;
for(int i = 0; i < v.size(); i++){
if(value%(v[i]/2)==0){
cout << "test" << endl;
long long div = value/(v[i]/2);
if(div%2==1){
cout << "semi common multi" << endl;
cnt++;
}
}
}
if(cnt==v.size()){
return true;
}else{
return false;
}
}
bool checkSemiMulti(long long num, vector <long> &v){
bool isAvailable = true;
for(long j = 0; j < v.size(); j++){
if(num%(v[j]/2)==0){
long div = num/(v[j]/2);
if(div%2==1){
continue;
}else{
isAvailable=false;
}
}else{
isAvailable=false;
}
}
return isAvailable;
}
int main(){
long n,m;
cin >> n >> m;
vector <long> p(n);
vector <long> harfP(n);
for(int i = 0; i < n; i++){
cin >> p[i];
}
sort(p.begin(),p.end());
p.erase(unique(p.begin(),p.end()),p.end());
vector <long long> candidate;
long long tmp = p.back()/2;
long long value = 1;
long long cnt = 0;
value=tmp*(2*cnt+1);
long long smallestOne = -1;
while(value<=m){
if(checkSemiMulti(value,p)){
smallestOne = value;
break;
}else{
cnt++;
value=tmp*(2*cnt+1);
}
}
if(smallestOne<0){
cout << 0 << endl;
}else{
if((m/smallestOne)%2==0){
cout << m/smallestOne/2 << endl;
}else{
cout << m/smallestOne/2+1 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B; cin >> A >> B;
vector<vector<char>> m(100, vector<char>(100));
for (int i = 0; i < 50; i++)
{
for (int j = 0; j < 100; j++)
{
if(j%2==0 && i%2==0 && B>1){
m[i][j] = '#';
B--;
} else {
m[i][j] = '.';
}
}
}
for (int i = 50; i < 100; i++)
{
for (int j = 0; j < 100; j++)
{
if(j%2==0 && i%2==1 && A>1){
m[i][j] = '.';
A--;
} else {
m[i][j] = '#';
}
}
}
cout << 100 << " " << 100 << endl;
for(auto i : m){
for(char c : i){
cout << c;
}
cout << endl;
}
}
| 0
| 78,919,857
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a;
ll sum = 0;
a.push_back(0);
rep(i,n){
int c;
cin >> c;
a.push_back(c);
}
a.push_back(0);
n += 2;
rep(i,n-1){
sum += abs(a[i+1] - a[i]);
}
for(int i = 1;i < n-1;i++){
cout << sum - abs(a[i+1] - a[i]) -abs(a[i] - a[i-1]) + abs(a[i+1] - a[i-1]) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
int N; cin >> N;
vector<ll> A(N); REP(i, N) cin >> A[i];
ll ans = 0; ll tmp = 0;
REP(i, N) {
tmp += A[i];
if(A[i] == 0 || i == N - 1) {
ans += tmp / 2;
tmp = 0;
}
}
cout << ans << endl;
}
| 0
| 31,334,579
|
#include <iostream>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
char ca = a.at(0) - 0x20;
char cb = b.at(0) - 0x20;
char cc = c.at(0) - 0x20;
cout << ca << cb << cc << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int , int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; ll k; cin >> s >> k;
ll cnt = 0;
int l = 0, r = 0;
int j = 0;
if(s[0] == s[s.size()-1]) {
++l;
while(s[j] == s[++j]) ++l;
j = s.size()-1;
if(l == s.size()) {
cout << s.size() * k / 2 << endl;
return 0;
}
++r;
while(s[j] == s[--j]) ++r;
}
for(int i = l; i < s.size()-r; ++i) {
bool b = s[i] == s[i-1];
cnt += b;
if(b) s[i] = '#';
}
cout << l/2 + cnt * k + (l + r) / 2 * (k - 1) + r/2 << endl;
}
| 0
| 26,295,077
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> h(n);
for (int i = 0; i < n; i++)
{
std::cin >> h[i];
}
std::vector<int> obs(n);
for (int i = 0; i < m; i++)
{
int a, b;
std::cin >> a >> b;
if (h[a - 1] < h[b - 1])
{
if (obs[b - 1] == 0)
{
obs[a - 1] = 1;
obs[b - 1] = 2;
}
else
{
obs[a - 1] = 1;
}
}
else if (h[b - 1] < h[a - 1])
{
if (obs[a - 1] == 0)
{
obs[a - 1] = 2;
obs[b - 1] = 1;
}
else
{
obs[b - 1] = 1;
}
}
else
{
obs[a - 1] = 1;
obs[b - 1] = 1;
}
}
int count = 0;
for (int i = 0; i < n; i++)
{
if (obs[i] == 0 || obs[i] == 2)
{
count++;
}
}
std::cout << count << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000010
vector<int> edge[MAXN];
int n,sg[MAXN],u,v;
void dfs(int u,int fa)
{
sg[u]=0;
for(auto v : edge[u])
{
if(v==fa)continue;
dfs(v,u);
sg[u]^=sg[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<n;++i)
{
scanf("%d%d",&u,&v);
edge[u].push_back(v);
edge[v].push_back(u);
}
dfs(1,0);
puts(sg[1]?"Alice":"Bob");
}
| 0
| 4,468,259
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int a, b;
cin >> a >> b ;
cout << a/b <<" " << a%b << " ";
printf("%9f", a*1.0/b*1.0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i)
{
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> dist(N, -1);
vector<int> prev(N, -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty())
{
int v = que.front();
que.pop();
for (int nv : G[v])
{
if (dist[nv] == -1)
{
dist[nv] = dist[v] + 1;
prev[nv] = v;
que.push(nv);
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; ++i)
cout << prev[i] + 1 << endl;
return 0;
}
| 0
| 45,819,447
|
#include <iostream>
int main(){
int n;
std::cin>>n;
std::cout<<(n-2)*180;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int ctoi(char c) {return c-'0';}
ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
int n;
cin >> n;
vector<ll>a(n);
ll maxx = -10;
for(int i=0;i<n;i++){
cin >> a.at(i);
maxx = max(a.at(i),maxx);
if(i!=0&&a.at(i)==0){
cout<<0<<endl;
return 0;
}
}
if(a.at(0)!=0){
cout<<0<<endl;
return 0;
}
map<ll,ll>ma;
for(int i=0;i<n;i++){
if(ma.count(a.at(i))){
ma.at(a.at(i))++;
}
else{
ma[a.at(i)]=1;
}
}
ll ans = 1;
ll waru =998244353;
for(int i=1;i<=maxx;i++ ){
if(ma.count(i)){
ll che = modpow(ma.at(i-1),ma.at(i),waru);
if(che==0)continue;
ans*=che;
ans = ans%waru;
}
else{
cout<<0<<endl;
return 0;
}
}
cout<<ans<<endl;
}
| 0
| 100,451,092
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
ll X;
cin >> X;
cout << ((2000-X-1)/200)+1;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#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 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pair<P,ll>;
using PQ = priority_queue<P,vector<P>,greater<P>>;
const ll MOD = 1e9+7;
signed main(){
ll n;
cin >> n;
ll a[n],b[n],sum_a = 0,sum_b = 0,cnt1 = 0,cnt2 = 0;
rep(i,0,n){
cin >> a[i];
sum_a += a[i];
}
rep(i,0,n){
cin >> b[i];
sum_b += b[i];
if(a[i] < b[i]){
cnt2 += ceil((double)(b[i] - a[i])/2.0);
}
else if(a[i] > b[i]){
cnt1 += a[i] - b[i];
}
}
if(cnt1 <= sum_b - sum_a && cnt2 <= sum_b - sum_a){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
| 0
| 58,314,761
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return(0)
#define rep(i, n) for(int (i) = (0); (i) < (n); (++i))
#define FOR(i, start, end) for(int (i) = (start); (i) < (end); (++i))
#define foreach(e, elem) for(auto& (e) : (elem))
#define FAST ios::sync_with_stdio(false); cin.tie(nullptr)
#define size(s) (s).size()
#define all(vec) (vec).begin(), (vec).end()
#define pb(e) push_back(e);
using ll = long long;
using ull = unsigned long long;
int main(){
int n, k;
string s;
cin >> n >> s >> k;
char c = s[k - 1];
rep(i, n){
if(s[i] != c){
s[i] = '*';
}
}
println(s);
}
| 0
| 43,359,053
|
#include <iostream>
#include <iomanip>
using namespace std;
int main(void){
int n,t[102],v[102],m=0;
double w[50000],z=0;
cin>>n;
t[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i];
t[i]+=t[i-1];
}
for(int i=1;i<=n;i++){
cin>>v[i];
}
m=t[n]*2;
int a=1;
w[0]=0;
for(int i=1;i<=m;i++){
while((i+1)/2>t[a]){
a++;
}
w[i]=min((double)w[i-1]+0.5, (double)v[a]);
}
a=n;
w[m]=0;
for(int i=m-1;i>=0;i--){
while(i/2<t[a-1]){
a--;
}
w[i]=min((double)w[i+1]+0.5, min(w[i],(double)v[a]));
}
for(int i=1;i<=m;i++){
z+=(w[i]+w[i-1])/4;
}
cout<<setprecision(20)<<z<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define SORT(v) sort(ALL(v))
typedef pair<int, int> P;
int n, m, p;
int main()
{
while (cin >> n >> m >> p, n)
{
int cnt = 0;
m--;
int bet;
int atari;
REP(i, n)
{
cin >> bet;
cnt += bet;
if (i == m) atari = bet;
}
int pool = cnt * (100-p);
if (atari == 0) cout << 0 << endl;
else cout << pool / atari << endl;
}
return 0;
}
| 0
| 88,551,304
|
#include<stdio.h>
int main(){
int a1,b1,c1,d1,a2,b2,c2,d2,sum1,sum2;
scanf("%d %d %d %d",&a1,&b1,&c1,&d1);
scanf("%d %d %d %d",&a2,&b2,&c2,&d2);
sum1=a1+b1+c1+d1;
sum2=a2+b2+c2+d2;
printf("%d\n",sum1<sum2?sum2:sum1);
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T>
void print(const vector<T> &x) {
int n = x.size();
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i,n) {
rep(j,x[i].size()) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<typename T>
void print(const vector<T> &x, int n) {
rep(i,n) {
cout << x[i];
if (i!=n-1) cout<<" ";
else cout << endl;
}
}
template<typename T>
void print(const vector<vector<T>> &x, int n, int m) {
rep(i,n) {
rep(j,m) {
cout << x[i][j] << " ";
}
cout << endl;
}
}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void input_init() {
cin.tie(0); ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
ll n,m,x; cin>>n>>m>>x;
vector<ll> c(n);
vector<vector<ll>> a(n, vector<ll>(m));
rep(i,n) {
cin>>c[i];
rep(j,m) cin>>a[i][j];
}
ll ans = LINF;
for (int bit = 0; bit < (1<<n); ++bit) {
ll tmp = 0;
vector<ll> b(m);
rep(i,n) {
if (!(bit & (1<<i))) continue;
rep(j,m) b[j] += a[i][j];
tmp += c[i];
}
bool ok = true;
rep(j,m) if (b[j] < x) ok = false;
if (ok) chmin(ans, tmp);
}
ans = (ans==LINF) ? -1 : ans;
cout << ans << '\n';
return 0;
}
| 0
| 18,606,789
|
#include <map>
#include <iostream>
struct range_valued_array {
using key_type = int;
using value_type = long long;
using iterator_type = std::map<key_type, value_type>::iterator;
std::map<key_type, value_type> mp;
key_type len;
range_valued_array(): len(0) {}
void resize_with(key_type new_len, const value_type& val) {
if(new_len == 0) mp.clear();
else if(len < new_len) mp[new_len] = val;
else if(len > new_len) {
auto iter = inner_split(new_len);
mp.erase(iter, mp.end());
}
len = new_len;
}
iterator_type inner_split(key_type pos) {
if(pos == 0) return mp.begin();
auto iter = mp.lower_bound(pos);
if(iter->first == pos) return ++iter;
mp[pos] = iter->second;
return iter;
}
iterator_type range_set_value(key_type l, key_type r, const value_type& val) {
if(l == r) return mp.end();
auto liter = inner_split(l);
auto riter = inner_split(r);
mp.erase(liter, riter);
return mp.insert({r, val}).first;
}
iterator_type begin() {
return mp.begin();
}
iterator_type end() {
return mp.end();
}
void debug_print() {
std::cout << "[";
for(auto p: mp) {
std::cout << p.first << ": " << p.second << ", ";
}
std::cout << "]" << std::endl;
}
};
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 i = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) \
{ \
std::cout << PREFIX << #x << " = " << x << std::endl; \
}
std::ostream& output_indent(std::ostream& os, int ind) {
for(int i = 0; i < ind; i++) os << " ";
return os;
}
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p);
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
return (os << "(" << p.first << ", " << p.second << ")");
}
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
os << "[";
for(int i = 0;i < v.size();i++) os << v[i] << ", ";
return (os << "]");
}
template<class T, class V> std::ostream& operator<<(std::ostream& os, const std::map<T, V>& v) {
os << "{";
for(auto p: v) os << p << ", ";
return (os << "}");
}
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) { return std::vector<T>(n, std::forward<T>(val)); }
template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}
template<class Cond> struct chain {
Cond cond; chain(Cond cond) : cond(cond) {}
template<class T> bool operator()(T& a, const T& b) const { if(cond(a, b)) { a = b; return true; } return false; }
};
template<class Cond> chain<Cond> make_chain(Cond cond) { return chain<Cond>(cond); }
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
rep(i,0,N) cin >> A[i];
auto func = [&](i64 K) {
range_valued_array arr;
arr.resize_with(A[0], 0);
rep(i,1,N) {
i64 b = A[i - 1];
i64 a = A[i];
if(b < a) {
arr.resize_with(a, 0);
}
else {
arr.resize_with(a, 0);
auto iter = arr.end();
int e = a;
while(1) {
if(iter == arr.begin()) return false;
--iter;
if(iter->second + 1 == K) {
}
else {
e = iter->first;
arr.range_set_value(iter->first - 1, iter->first, iter->second + 1);
break;
}
}
arr.range_set_value(e, a, 0);
}
}
return true;
};
i64 ok = N;
i64 ng = 0;
while(abs(ng - ok) > 1) {
i64 m = (ok + ng) >> 1;
if(func(m)) {
ok = m;
}
else {
ng = m;
}
}
cout << ok << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;i++)
#define get(a) fl(i,0,a.size()) cin>>a[i];
#define pra(a) fl(i,0,a.size()) cout<<a[i]<<" "; cout<<endl;
#define pr(a,n) fl(i,0,n) cout<<a[i]<<" "; cout<<endl;
const ll INF = 2e18;
const int inf = 2e9;
const int mod1 = 1e9 + 7;
vector<vector<int>> g;
vector<int> vis;
int curr;
void dfs(int u, int &cnt){
cnt++;
vis[u] = true;
for(int v : g[u]){
if(!vis[v]){
dfs(v, cnt);
}
}
}
int main(){
Shazam;
int n,m; cin>>n>>m;
g = vector<vector<int>>(n+1);
vis = vector<int> (n+1);
for(int i = 0 ; i < m; i++){
int a,b; cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
int ans = 0;
for(int i = 1; i <=n; i++){
if(!vis[i]){
curr = 0;
dfs(i,curr);
ans = max(ans, curr);
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 83,210,828
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<double,double> P;
typedef long long ll;
int main(){
while(1){
int n, m; cin >> n >> m;
if(n == 0 && m == 0) return 0;
vector<P> a(n);
rep(i,n){
cin >> a[i].second >> a[i].first;
}
sort(all(a));
reverse(all(a));
ll ans = 0.0;
ll id = 0;
while(m > 0 && id < n){
if(a[id].second<= m){
m -= a[id].second;
a[id].second = 0;
id++;
continue;
}
else{
a[id].second -= m;
m = 0;
break;
}
}
rep(i,n){
ans += a[i].first * a[i].second;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1e6;
int unip[max_n],unir[max_n];
void init(int n){
for(int i=0 ; i<n ; i++){
unip[i] = i;
unir[i] = 0;
}
}
int find(int x){
if(unip[x] == x){
return x;
}else{
return unip[x] = find(unip[x]);
}
}
void unite(int x, int y){
x = find(x); y = find(y);
if(unip[x] == unip[y]){
return;
}
if(unir[x] < unir[y]){
unip[x] = y;
}else{
unip[y] = x;
if(unir[x] == unir[y]){
unir[x]++;
}
}
}
bool same(int x, int y){
return find(x) == find(y);
}
int main(){
int n,m;
cin >> n >> m;
int p[n];
init(n);
for(int i=0 ; i<n ; i++){
cin >> p[i];
--p[i];
}
int x[m], y[m];
for(int i=0 ; i<m ; i++){
cin >> x[i] >> y[i];
--x[i]; --y[i];
unite(x[i], y[i]);
}
int count = 0;
for(int i=0 ; i<n ; i++){
if(same(p[i],i)){
count++;
}
}
cout << count << endl;
return 0;
}
| 0
| 96,267,570
|
#include <iostream>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
const int MAX_N = 1010;
const int INF = INT_MAX;
int dp[MAX_N][MAX_N];
int main(void) {
string s1, s2; cin >> s1 >> s2;
fill_n((int *)dp, MAX_N*MAX_N, INF);
for (int i = 0; i <= s1.size(); i++) {
dp[0][i] = i;
}
for (int i = 0; i <= s2.size(); i++) {
dp[i][0] = i;
}
for (int i = 1; i <= s2.size(); i++) {
for (int j = 1; j <= s1.size(); j++) {
if (s2[i-1] == s1[j-1]) {
dp[i][j] = dp[i-1][j-1];
} else {
dp[i][j] = min(min(dp[i-1][j-1], dp[i-1][j]), dp[i][j-1]) + 1;
}
}
}
cout << dp[s2.size()][s1.size()] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=0;i<(n);++i)
#define rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep4(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define vec vector<ll>
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;}
string v="Vacant";
void solve(){
ll n;cin>>n;
cout<<0<<endl;
string s;cin>>s;
if(s==v)return;
ll base=0;
for(ll i=17;i>=0;i--){
if(base+(1<<i)>=n)continue;
cout<<base+(1<<i)<<endl;
string t;cin>>t;
if(t==v)return;
if(t==s)base+=1<<i;
}
}
int main(){
solve();
}
| 0
| 3,861,981
|
#include <stdio.h>
int main(){
int index = 1;
int val = 0;
while (1){
scanf("%d", &val);
if (val == 0){
break;
}
printf("Case %d: %d\n", index, val);
index++;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template<class T> struct edge { int from, to; T cost;};
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}return false;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
ll check2(ll x, int t, ll n2){
if (t == 0){
ll buf = (x + 1) / 2;
return buf % 2;
}else if (t == 1){
ll buf = x % 4;
int res = buf == 2 ? 1 : 0;
return res;
}else if (t == 2){
ll buf = x % 8;
int res = 0;
if (buf == 4 || buf == 6) res = 1;
return res;
}else{
ll buf = x % (n2 * 2);
if (buf < n2) return 0;
int tmp = buf % 2;
if (tmp == 0) return 1;
else return 0;
}
}
ll check(ll x, ll y, int t, ll n2){
if (y < n2) return 0;
int buf = check2(y, t, n2) - check2(x-1, t, n2) + 100;
buf %= 2;
ll res = buf == 1 ? n2 : 0;
return res;
}
int main() {
ll A,B; cin >>A >>B;
if (A == B){ cout <<A <<endl; return 0; }
if (A+1 == B){ cout <<(A^B) <<endl; return 0; }
A = A == 0 ? 1 : A;
ll res = 0;
ll n2 = 1;
rep(i, 41){
if (i > 0) n2 *= 2;
ll tmp = check(A, B, i, n2);
res += tmp;
}
cout <<res <<endl;
}
| 0
| 62,682,214
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#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 Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
lli ans=INF;
vi a(5);
rep(i,5){
cin>>a[i];
}
vi n={ 0, 1, 2, 3, 4 };
while(true){
lli tmp=0;
rep(i,5){
if(i==4){
tmp+=a[n[i]];
}
else{
(a[n[i]]%10==0?tmp+=a[n[i]]:tmp+=(a[n[i]]/10+1)*10);
}
}
ans=min(tmp, ans);
if(!next_permutation(all(n))){
break;
}
}
out(ans);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int sumDight(int x) {
int sum = 0;
while (x > 0) {
sum += (x % 10);
x /= 10;
}
return sum;
}
int divideReverse(int x) {
int reverse = 0;
int r;
while (x > 0) {
r = x % 10;
reverse = reverse * 10 + r;
x /= 10;
}
return reverse;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n, y;
cin >> n >> y;
bool b = false;
int ma, a, c;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n;j++){
if (n >=j+i && n + 4 * j + 9 * i == y / 1000){
b = true;
ma = i;
a = j;
c = n - j - i;
}
}
if (b) break;
}
if(b)cout <<ma << " " << a << " " << c << endl;
else
cout << -1 << " " << -1 << " " << -1 << endl;
}
| 0
| 91,967,424
|
#include <iostream>
#include <string>
int main(void){
int A, B, ans=0;
std::cin >> A >> B;
for (int i=A; i<=B; ++i){
std::string S = std::to_string(i);
if (S.at(0) == S.at(4) && S.at(1) == S.at(3)) ++ans;
}
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
using namespace std;
ll gcd(ll x,ll y){
if (y == 0) return x;
return gcd(y, x%y);
}
int main(void){
ll n,k;cin>>n>>k;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll g=a[0];
rep(i,n) g=gcd(g,a[i]);
sort(a.rbegin(),a.rend());
rep(i,n){
if(a[i]<k)break;
if((a[i]-k)%g==0){
cout<<"POSSIBLE"<<endl;
return 0;
}
}
cout<<"IMPOSSIBLE"<<endl;
}
| 0
| 74,649,803
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
string s[5];
cin >> s[0] >> s[1] >> s[2];
if (s[0].back() == s[1][0] && s[1].back() == s[2][0])cout << "YES";
else cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table. at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n,r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) {
return comb(n + r - 1, n - 1);
}
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
string s;
cin >> s;
for(int i=0;i<s.size();i+=2){
cout << s[i];
}
}
| 0
| 84,062,153
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int l[100000], r[100000];
int sum = 0;
cin >> N;
for(int i=0; i<N; i++){
cin >> l[i] >> r[i];
if(l[i] != r[i]){
r[i]++;
sum += r[i] - l[i];
}
else if(l[i] == r[i]){
sum++;
}
}
cout << sum << endl;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
typedef pair<int, int> P;
int N;
string S;
string ans;
bool check() {
for (int i = 0; i < N; i++) {
if (S[i] == 'o') {
if (ans[i + 1] == 'S') {
if (ans[i] == 'S') {
ans += 'S';
}
else {
ans += 'W';
}
}
else {
if (ans[i] == 'S') {
ans += 'W';
}
else {
ans += 'S';
}
}
}
else {
if (ans[i + 1] == 'S') {
if (ans[i] == 'S') {
ans += 'W';
}
else {
ans += 'S';
}
}
else {
if (ans[i] == 'S') {
ans += 'S';
}
else {
ans += 'W';
}
}
}
}
if (ans[0] == ans[N] && ans[1] == ans[N + 1]) return true;
else return false;
}
int main()
{
cin >> N >> S;
string tmp;
ans.push_back('S');
ans.push_back('S');
if (check()) {
for (int i = 1; i <= N; i++) {
cout << ans[i];
}
cout << endl;
return 0;
}
ans = tmp;
ans.push_back('W');
ans.push_back('S');
if (check()) {
for (int i = 1; i <= N; i++) {
cout << ans[i];
}
cout << endl;
return 0;
}
ans = tmp;
ans.push_back('S');
ans.push_back('W');
if (check()) {
for (int i = 1; i <= N; i++) {
cout << ans[i];
}
cout << endl;
return 0;
}
ans = tmp;
ans.push_back('W');
ans.push_back('W');
if (check()) {
for (int i = 1; i <= N; i++) {
cout << ans[i];
}
cout << endl;
return 0;
}
cout << -1 << endl;
}
| 0
| 95,940,830
|
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N>>M;
priority_queue<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
S.push(A);
}
for(ll i=0;i<M;i++) {
ll K=S.top()/2;
S.pop();
S.push(K);
}
ll ans=0;
while(!S.empty()) {
ans+=S.top();
S.pop();
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD=(LL)1e9+7;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define INF 1LL << 50
vector<vector<LL>>res;
LL calc(){
vector<LL>vec;
REP(i,50)vec.PB(50);
while(vec.back()>=50){
REP(i,49)vec[i]++;
vec[49]-=50;
SORT(vec);
res.PB(vec);
}
}
int main(){
LL K;
cin>>K;
LL d =K/50LL;
int d2=K%50;
calc();
cout<<50<<endl;
REP(i,50){
if(d2!=0)cout<<d+res[49-d2][i]<<" ";
else cout<<49LL+d<<" ";
}
cout<<endl;
return 0;
}
| 0
| 100,519,245
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int func(int a) {
return (a % 10) + (a / 10);
}
pil rec(int d, ll c) {
if (d == 0)
return {0, c - 1};
int tmp = (10 + d - 1) / d;
if (c < tmp)
return {d * c, c - 1};
pil res = rec(func(d * tmp), c / tmp);
res.second += (c / tmp) * tmp;
c %= tmp;
if (c) {
res.first += d * c;
res.second += c;
}
if (res.first >= 10) {
res.first = func(res.first);
res.second++;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int M;
cin >> M;
ll cnt = 0;
int num = 0;
for (int i = 0; i < M; ++i) {
int d;
ll c;
cin >> d >> c;
pil tmp = rec(d, c);
cnt += tmp.second;
if (i > 0)
cnt++;
num += tmp.first;
if (num >= 10) {
num = func(num);
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define MOD_1_000_000_007 (1000000007)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define yesno(cond) YESNO((cond), "Yes", "No")
#define YESNO(cond, a, b) cout << ((cond) ? (a) : (b)) << "\n"
namespace solver {
using namespace std;
typedef long long ll;
int N, dp[20][100010];
void init() {
cin >> N;
}
void solve() {
vector<int> coins = {1};
int a = 6;
while(a <= 100000) {
coins.push_back(a);
a *= 6;
}
a = 9;
while(a <= 100000) {
coins.push_back(a);
a *= 9;
}
sort(coins.begin(), coins.end());
coins.erase(unique(coins.begin(), coins.end()), coins.end());
repc(j, N) dp[0][j] = IINF;
dp[0][0] = 0;
rep(i, coins.size()) repc(j, N) {
dp[i+1][j] = dp[i][j];
if(coins[i] <= j) dp[i+1][j] = min(dp[i+1][j], dp[i+1][j-coins[i]]+1);
}
cout << dp[coins.size()][N] << "\n";
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solver::init();
solver::solve();
return 0;
}
| 0
| 72,992,959
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<int> d(K);
vector<vector<int>> A(K);
rep(i, K) {
cin >> d.at(i);
rep(j, d.at(i)) {
int tmp;
cin >> tmp;
A.at(i).push_back(tmp);
}
}
set<int> S;
rep(i, K) {
rep(j, d.at(i)) {
S.insert(A.at(i).at(j));
}
}
int ans = N - S.size();
cout << ans << endl;
return 0;
}
|
#ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
#include <iostream>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var,n) for(int var=0;var<n;++var)
#define repi(n) rep(i,n)
#define repj(n) rep(j,n)
#define repi1(n) for(int i=1;i<n;++i)
#define repj1(n) for(int j=1;j<n;++j)
#define _min(a,b) (a)<(b)?(a):(b)
#define _max(a,b) (a)>(b)?(a):(b)
#define zeroi(data,n) memset(data,0,sizeof(int)*n);
#define zeroll(data,n) memset(data,0,sizeof(long long)*n);
#define one(data,n) {for(int _ONEI=0;_ONEI<n;++_ONEI) data[_ONEI]=1;}
char readc() { char var; fscanf(_fin, "%c", &var); return var; }
int readi() { int var; fscanf(_fin, "%d", &var); return var; }
ll readll() { ll var; fscanf(_fin, "%lld", &var); return var; }
void repread(int* data, int n) { repi(n) data[i] = readi(); }
void repread(ll* data, int n) { repi(n) data[i] = readll(); }
int reads(char* str, int maxsize)
{
for (;;) { if (fgets(str, maxsize, _fin) == NULL) break; if (str[0] != '\n' && str[0] != '\r') break; }
int slen = strlen(str); if (slen == 0) return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r') str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout,"%c",var)
#define writecsp(var) fprintf(_fout,"%c ",var)
#define writecln(var) fprintf(_fout,"%c\n",var)
#define writei(var) fprintf(_fout,"%d",var)
#define writeisp(var) fprintf(_fout,"%d ",var)
#define writellsp(var) fprintf(_fout,"%lld ",var)
#define writeiln(var) fprintf(_fout,"%d\n",var)
#define writellln(var) fprintf(_fout,"%lld\n",var)
#define writeulln(var) fprintf(_fout,"%llu\n",var)
#define writefln(var) fprintf(_fout,"%f\n",var)
#define writes(str) fprintf(_fout,"%s",str)
#define writesp() fprintf(_fout," ")
#define writeln() fprintf(_fout,"\n")
#define iseven(x) ((x&1)==0 ? 1:0)
#define RUN_LOCAL(testfilename) {_fin = fopen(testfilename, "r"); if(_fin==NULL) _fin=stdin;}
#define swap(type,a, b) {type t=a;a=b;b=t;}
#define swapxor(a,b) {a^=b;b^=a;a^=b;}
#define sort(data,n) std::sort(data,data+n)
#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b)
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
void reversei(int* data, int n) { int k = n >> 1; repi(k) { int tmp = data[i]; data[i] = data[n - i - 1]; data[n - i - 1] = tmp; } }
int bsearch(int val, int* data, int n) { if (data[0] > val) return -1; if (data[n - 1] < val) return n; int l = 0; int r = n - 1; for (; l < r;) { int mid = (l + r + 1) >> 1; if (data[mid] <= val) l = mid; else r = mid - 1; }if (data[r] != val) ++r; return r; }
#define _Vec(type, name) \
struct name { type* data; int size; int n; };\
void init(name* t, int size) { t->data = (type*)malloc(sizeof(type) * size); t->size = size; t->n = 0; }\
void resize(name* t) { int ns = t->size * 1.2f; t->data = (type*)realloc(t->data, sizeof(type) * ns); t->size = ns; }\
void add(name* t, type val) { if (t->n >= t->size) resize(t); int k = t->n; t->data[k] = val; t->n = k + 1; }\
void free(name* t) { free(t->data);}
_Vec(int, Veci)
_Vec(long long, Vecll)
_Vec(char*, Vecs)
#define _ispal(type, name) int name(type* a, type* b, int n){repi(n){if (a[i] != b[n - i - 1]){return 0;}}return 1;}
_ispal(int, ispali)
_ispal(char, ispalc)
#define _Pair(type, name) struct name{type x, y;}; \
int cmp_##name(const void* _a, const void* _b){name* a = (name*)_a;name* b = (name*)_b;if (a->x == b->x){if (a->y < b->y) return -1;else return 1;}if (a->x < b->x) return -1;else return 1;}\
void sort_##name(name* d, int n){qsort(d, n, sizeof(name), cmp_##name);}
_Pair(int, Pairi)
int cmp_Str(const void* _a, const void* _b) { char* a = *((char**)_a); char* b = *((char**)_b); return strcmp(a, b); }
void sort_Str(char** str, int n) { qsort(str, n, sizeof(char*), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (;n;) {
if (n & 1) ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
int main()
{
RUN_LOCAL("dataabc155A.txt");
int h = readi();
int n = readi();
static int damage[1000];
static int mana[1000];
static int dp[10001];
repi(h) dp[i] = -1;
repi(n)
{
damage[i] = readi();
mana[i] = readi();
}
int best = 1 << 30;
dp[0] = 0;
repi(h)
{
if (dp[i] == -1) continue;
repj(n)
{
int k = i + damage[j];
if (k >= h)
{
int killingblowmana = dp[i] + mana[j];
if (killingblowmana < best)
{
best = killingblowmana;
}
}
else
{
int manacost = dp[i] + mana[j];
if (dp[k] == -1) dp[k] = manacost;
else dp[k] = _min(manacost, dp[k]);
}
}
}
writeiln(best);
return 0;
}
| 0
| 53,619,382
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N,A,B; cin>>N>>A>>B;
int ct=0;
for(int i=1; i<=N; i++){
int num = i, sum=0;
while(num>0){
sum += num%10;
num /= 10;
}
if(A<=sum && sum<=B){
ct += i;
}
}
cout << ct << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
int main(){
int n;
cin >> n;
vector<int> a(1e5);
for(int i=0; i<n; ++i){
int x;
cin >> x;
a[x]++;
}
int ans = 0;
ans = max(ans, a[0]+a[1]);
ans = max(ans, a[1e5]+a[1e5-1]+a[1e5+1]);
for(int i=1; i<1e5; ++i){
ans = max(ans, a[i]+a[i-1]+a[i+1]);
}
cout << ans;
}
| 0
| 40,061,603
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++){
double score = i;
double coin = 1.0/n;
while (score < k){
score *= 2;
coin /= 2;
};
ans += coin;
};
cout << fixed << setprecision(15) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define F0R(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define sz (int)size
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define f first
#define s second
const int MX = 200;
int N, a[MX];
void setIO(string name) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int main() {
cin >> N;
F0R(i, 2 * N) cin >> a[i];
sort(a, a + 2 * N);
int ans = 0;
for (int i = 0; i < 2 * N; i += 2) {
ans += a[i];
}
cout << ans << "\n";
}
| 0
| 42,543,384
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a[4];rep(i,4)cin>>a[i];
cout<<a[2]+(a[1]-a[3])<<" "<<a[3]+(a[2]-a[0])<<" "<<a[0]+(a[1]-a[3])<<" "<<a[1]+(a[2]-a[0])<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
inline void print() {
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest) {
cout << first << ' ';
print(rest...);
}
void solve() {
int N; cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<int> plus, minus;
minus.push_back(A[0]);
plus.push_back(A[N-1]);
for (int i = 1; i < N-1; i++) {
if (A[i] < 0) minus.push_back(A[i]);
else plus.push_back(A[i]);
}
int sum = accumulate(plus.begin(), plus.end(), 0) - accumulate(minus.begin(), minus.end(), 0);
cout << sum << endl;
int x = minus[0];
for (int i = 1; i < plus.size(); i++) {
print(x, plus[i]);
x = x - plus[i];
}
print(plus[0], x);
x = plus[0] - x;
for (int i = 1; i < minus.size(); i++) {
print(x, minus[i]);
x = x - minus[i];
}
}
int main() {
solve();
return 0;
}
| 0
| 18,514,278
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
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; }
constexpr double EPS = 1e-10;
constexpr int MOD = 1'000'000'007;
template<class T> inline T sqr(T x) {return x*x;}
void solve() {
LL n,k;
cin >> n >> k;
VLL a(n);
REP(i,0,n) cin >> a[i];
REP(i,0,n) a[i] = (a[i] - 1) % k;
VLL ru(n+1);
REP(i,0,n) ru[i+1] = (ru[i] + a[i]) % k;
LL ans = 0;
map<LL,int> m;
REP(i,0,n+1) {
if (i >= k) m[ru[i-k]]--;
ans += m[ru[i]];
m[ru[i]]++;
}
cout << ans << endl;
}
signed main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n; cin>>n;
string s; cin>>s;
ll l=0;
rep(i,n){
if(s[i]=='(') l++;
else{
l=max(l-1,0LL);
}
}
rep(i,l) s.push_back(')');
n=s.size();
ll r=0;
rrep(i,n){
if(s[i]==')') r++;
else{
r=max(r-1,0LL);
}
}
if(r){
string tmp=string(r,'(');
s=tmp+s;
}
cout<<s<<endl;
}
| 0
| 3,696,051
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long s64;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxN = 100000;
const int MaxM = 200000;
int n, m;
struct halfEdge
{
int v;
halfEdge *next;
};
halfEdge adj_pool[MaxM * 2], *adj_tail = adj_pool;
halfEdge *adj[MaxN + 1];
inline void addEdge(const int &u, const int &v)
{
adj_tail->v = v, adj_tail->next = adj[u];
adj[u] = adj_tail++;
}
int num[3];
int col[MaxN + 1];
bool valid;
int total;
void dfs(const int &u, const int &now)
{
col[u] = now, ++total;
for (halfEdge *e = adj[u]; e; e = e->next)
{
if (!col[e->v])
dfs(e->v, now ^ 1);
else if (col[e->v] != now ^ 1)
valid = false;
}
}
int main()
{
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
int u = getint(), v = getint();
addEdge(u, v);
addEdge(v, u);
}
for (int u = 1; u <= n; ++u)
if (!col[u])
{
valid = true, total = 0;
dfs(u, 2);
num[0] += total == 1;
num[1] += !valid;
num[2] += valid && total > 1;
}
s64 a = num[0], b = num[1], c = num[2];
s64 p = n * a * 2ll - a * a;
s64 q = b * b + 2ll * b * c + 2ll * c * c;
cout << p + q << endl;
return 0;
}
|
#include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
static const int INF = 100000000000;
int n, Adj[N][N];
int d[N];
void bfs(int s) {
queue<int> q;
q.push(s);
for (int i=0; i< n;i++)d[i] = INF;
d[s] = 0;
int u;
while (!q.empty()) {
u = q.front(); q.pop();
for(int v=0;v<n;v++){
if (Adj[u][v] == 0) continue;
if (d[v] != INF) continue;
d[v] = d[u] + 1;
q.push(v);
}
}
for (int i = 0; i < n; i++) {
cout << i + 1 << " " << ((d[i] == INF) ? (-1) : d[i]) << endl;
}
}
int main() {
int u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
Adj[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >> v;
v--;
Adj[u][v] = 1;
}
}
bfs(0);
return 0;
}
| 0
| 7,270,921
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
signed main(){
FASTER;
int n,k;
cin>>n>>k;
vi v(n);
for(int &i:v){
cin>>i;
i=(i-1+k)%k;
}
for(int i=1;i<n;i++)v[i]=(v[i]+v[i-1])%k;
int ans=0;
map<int,int> mp;
mp[0]=1;
for(int i=0;i<min(k-1,n);i++){
ans+=mp[v[i]];
mp[v[i]]++;
}
if(k<n){
mp[0]--;
ans+=mp[v[k-1]];
mp[v[k-1]]++;
for(int i=k;i<n;i++){
mp[v[i-k]]--;
ans+=mp[v[i]];
mp[v[i]]++;
}
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int l = -1, r = -1;
for (int i = 0; i+2 <= n; i++) {
if (s[i] == s[i+1]) {
l = i+1, r = i+2;
break;
} else if (i+3 <= n && (s[i+1] == s[i+2] || s[i+2] == s[i])) {
l = i+1, r = i+3;
break;
}
}
cout << l << " " << r << endl;
}
| 0
| 72,284,334
|
#include <bits/stdc++.h>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
#define debug2(s, t, u) cout << s << " " << t << " " << u << endl
#define printvec(v) \
for (auto &&i : v) \
cout << i << " "; \
cout << endl
#define rep(n, i) for (int i = 0; i < n; i++)
using namespace std;
using i64 = long long;
int main()
{
int n, k;
cin >> n >> k;
vector<int> p(n);
for (auto &&pi : p)
{
cin >> pi;
}
sort(p.begin(), p.end());
int price = 0;
for (int i = 0; i < k; i++)
{
price += p[i];
}
cout << price << endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
cin >> s;
int a=s[0]-'0',b=s[1]-'0',c=s[2]-'0',d=s[3]-'0';
int ans=0;
for(int i=0;i<(1<<3);i++){
int sum=a;
if((1<<2)&i)sum+=b;
else sum-=b;
if((1<<1)&i)sum+=c;
else sum-=c;
if((1<<0)&i)sum+=d;
else sum-=d;
if(sum==7){
ans=i;
break;
}
}
string exp="";
exp+=a+'0';
if((1<<2)&ans)exp+="+";
else exp+="-";
exp+=b+'0';
if((1<<1)&ans)exp+="+";
else exp+="-";
exp+=c+'0';
if((1<<0)&ans)exp+="+";
else exp+="-";
exp+=d+'0';
exp+="=7";
cout << exp << endl;
return 0;
}
| 0
| 34,757,189
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int main() {
int N;
cin >> N;
string S, T;
cin >> S >> T;
int ans = 2 * N;
rep(i, N) {
if (S.substr(i) == T.substr(0, N-i)) {
ans = N + i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , k , h[N] , f[N];
int main()
{
cin >> n >> k;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
f[i] = INT_MAX;
}
f[1] = 0;
for(int i = 2 ; i <= n; ++i)
{
for(int j = 1 ; j <= k; ++j)
{
if(i - j == 0)break;
f[i] = min(f[i] , f[i-j] + abs(h[i-j] - h[i]));
}
}
cout << f[n];
return 0;
}
| 0
| 89,515,896
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
auto ans = min(A, B) + min(C, D);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N, K; cin >> N >> K;
if((N*(N-1)/2) - (N-1) < K){
cout << -1 << endl;
return 0;
}
int M = N*(N-1)/2 - K;
vector<P> edge;
rep(i, N-1){
edge.push_back({1, i+2});
}
int cnt = N-1;
for(int i = 2;i <= N; i++){
for(int j = i+1;j <= N; j++){
if(cnt >= M) break;
edge.push_back({i, j});
cnt++;
}
if(cnt >= M) break;
}
cout << M << endl;
rep(i, M){
cout << edge[i].first << " " << edge[i].second << endl;
}
return 0;
}
| 0
| 15,519,625
|
#include <algorithm>
#include <bitset>
#include <boost/rational.hpp>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
int main() {
int N;
cin >> N;
string buf;
cout << 0 << endl;
cin >> buf;
if (buf[0] == 'V') {
return 0;
}
char ls = buf[0], us = buf[0];
int lb = 0, ub = N;
rep(i, 19) {
const int mid = (lb + ub) / 2;
cout << mid << endl;
string buf;
cin >> buf;
if (buf[0] == 'V') {
break;
}
const int len = mid - lb + 1;
if ((len % 2 == 0) == (buf[0] == ls)) {
ub = mid;
us = buf[0];
} else {
lb = mid;
ls = buf[0];
}
}
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using Graph = std::vector<std::vector<int>>;
using WGraph = std::vector<std::vector<std::pair<int, long long>>>;
using ll = long long;
using namespace std;
int main() {
int n = 0, m = 0;
cin >> n >> m;
vector<int> a(m);
for (int i=0; i<m; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
vector<int> match = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> dp(n+1, -1e8);
dp.at(0) = 0;
for (int i=1; i<n+1; i++) {
for (int j=0; j<m; j++) {
int use = match.at(a.at(j));
if (i - use < 0) {
continue;
}
else {
dp.at(i) = max(dp.at(i), dp.at(i-use)+1);
}
}
}
vector<int> ret;
while (n > 0) {
for (int i=0; i<m; i++) {
int use = match.at(a.at(i));
if (n - use < 0) continue;
if (dp.at(n) == dp.at(n-use)+1) {
ret.push_back(a.at(i));
n -= use;
break;
}
}
}
for (int x : ret) {
cout << x;
}
cout << endl;
return 0;
}
| 0
| 24,719,459
|
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
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{
cout << "Bob" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(100001);
rep(i, n) {
int a, b;
cin >> a >> b;
jobs[a].push_back(b);
}
int ans = 0;
priority_queue<int> pq;
for (int i = 1; i <= m; i++) {
rep(j, jobs[i].size()) pq.push(jobs[i][j]);
if (!pq.empty()) {
ans += pq.top();
pq.pop();
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| 0
| 60,391,090
|
#include <iostream>
using namespace std;
int main()
{
int n,r;
cin >> n >> r;
if (n >= 10){
cout << r;
}
else {
int x= r+(100*(10-n));
cout << x;
}
}
|
#include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
if (n < m)
{
cout << "UNRESTORABLE" << endl;
}
else
{
bool ok = false;
repi(i, n - m + 1, 0)
{
if (s[i] == t[0])
{
int cnt = 1;
repi(j, m, 1)
{
if (s[i + j] == t[j])
cnt++;
}
if (cnt == m)
ok = true;
}
}
if (!ok)
{
for (int i = n - m; i >= 0; i--)
{
if (s[i] == t[0] || s[i] == '?')
{
int cnt = 1;
repi(j, m, 1)
{
if (s[i + j] == t[j] || s[i + j] == '?')
cnt++;
}
if (cnt == m)
{
ok = true;
repi(j, m, 0)
{
s[i + j] = t[j];
}
}
}
if (ok)
break;
}
if (!ok)
{
cout << "UNRESTORABLE" << endl;
return 0;
}
}
repi(i, n, 0)
{
if (s[i] == '?')
s[i] = 'a';
}
cout << s << endl;
}
return 0;
}
| 0
| 76,847,506
|
#include <iostream>
using namespace std;
class Triangle{
private:
int a, b, c;
public:
void Set();
bool Jugde();
};
void Triangle::Set(){
cin >> a >> b >> c;
}
bool Triangle::Jugde(){
int buf;
if(a < b){
buf = a;
a = b;
b = buf;
}
if(a < c){
buf = a;
a = c;
c = buf;
}
if(a*a == b*b + c*c) return true;
else return false;
}
int main(){
int n;
bool jugde;
Triangle* dataset;
cin >> n;
dataset = new Triangle[n];
for(int i = 0; i < n; i++)
dataset[i].Set();
for(int i = 0; i < n; i++){
jugde = dataset[i].Jugde();
if(jugde == true)
cout << "YES" << "\n";
else
cout << "NO" << "\n";
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string S; cin >> S;
bool j1 = true, j2 = false, j3 = true, j4 = false;
int cp = 0;
for (int i = 0; i < S.length(); ++i) {
if (i == 0 && S[i] != 'A') j1 = false;
if (2 <= i && i <= S.length() - 2 && S[i] == 'C') {
if (j4 == false) j2 = true, j4 = true, cp = i;
else j2 = false;
}
if (i != 0 && i != cp && 'A' <= S[i] && S[i] <= 'Z') j3 = false;
}
if (j1 && j2 && j3) printf("%s\n", "AC");
else printf("%s\n", "WA");
}
| 0
| 16,312,134
|
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main(void)
{
int H, W;
while (1) {
scanf("%d %d", &H, &W);
if (H == 0 && W == 0)
break;
for (int i = 1; i <= H; i++) {
for (int j = 01; j <= W; j++) {
if ((i == 1 || i == H) || (j == 1 || j == W)) {
printf("#");
}
else
printf(".");
}
printf("\n");
}
printf("\n");
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using pqg = priority_queue<ll,vector<ll>, greater<ll> >;
using pql = priority_queue<ll,vector<ll> >;
using pqg_p = priority_queue<P,vector<P>, greater<P> >;
using pql_p = priority_queue<P,vector<P> >;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REPS(i,s,n) for(auto i=s, i##_len=(n); i<i##_len; ++i)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
struct Tree {
vector<int> next;
ll count=0;
ll ans=0;
bool reach = false;
};
int N,Q;
vector<Tree> tr;
void DFS(int n, ll preva) {
if (tr[n].reach == true) return;
tr[n].reach = true;
tr[n].ans = tr[n].count + preva;
for (auto i : tr[n].next) {
DFS(i,tr[n].ans);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> Q;
tr.resize(N+1);
REP(i,N-1) {
int a,b;
cin >> a >> b;
tr[a].next.PB(b);
tr[b].next.PB(a);
}
REP(i,Q) {
int a,b;
cin >> a >> b;
tr[a].count += b;
}
DFS(1,0);
REP(i,N) {
if (i == 0) cout << tr[1].ans ;
else cout << " " << tr[i+1].ans;
}
cout << endl;
}
| 0
| 76,895,619
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5+6;
const int mod = 1e9+7;
const int inf = 1e8;
int cnt[N];
void solve(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
cnt[x]++;
}
int ans = 0;
for(int i=0;i<N;i++){
ans+=max(0,cnt[i]-1);
}
if(ans%2)ans++;
cout<<n-ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--)solve();
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vector<T> getVector(ll num){
vector<T> values(num);
for(ll i=0;i<num;i++){
cin >> values.at(i);
}
return values;
}
string S;
ll N,ans;
int main(){
ans = 0;
cin >> N;
for(int c=0;c<=N;c++){
for(int d=0;d<=N-c;d++){
int p = 4*c+7*d;
if(p==N){
printl("Yes");
return 0;
}
}
}
printl("No");
}
| 0
| 34,097,457
|
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main()
{
cout << fixed << setprecision(10);
ll X,t;
cin >> X >> t;
if(X>=t)
{
cout << X-t << endl;
}
else
{
cout << 0 << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=1010000;
const int P=1000000007;
const db eps=1e-7;
#define pritnf printf
template <typename T>
inline void sc (T &x)
{
x=0; static int p; p=1; static char c; c=getchar();
while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
x*=p;
}
template <typename T>
inline void print (T x)
{
if (x< 0) putchar('-'),x=-x;
if (x>=10) print(x/10);
putchar(x%10+'0');
}
template <typename T>
inline void pr (T x) { print(x),putchar('\n'); }
template <typename T1,typename T2>
void chkmax (T1 &A,T2 B) { A=A>=B?A:B; }
template <typename T1,typename T2>
void chkmin (T1 &A,T2 B) { A=A<=B?A:B; }
int a[N];
int main ()
{
int n; sc(n);
for (int i=1; i<=n; i++)
{
int x; sc(x);
++a[x];
}
int ma=0;
for (int i=n-1; i>=1; i--)
if (a[i]) { ma=i; break; }
int mi=(ma+1)>>1;
for (int i=ma; i> mi; i--)
a[i]-=2;
a[mi]-=(ma&1)?2:1;
for (int i=1; i< n; i++)
if (a[i]< 0) return puts("Impossible"),0;
for (int i=1; i<=mi; i++)
if (a[i]) return puts("Impossible"),0;
puts("Possible");
return 0;
}
| 0
| 21,183,261
|
#include<bits/stdc++.h>
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over return 0
#define scan(i,n,a) for(i=0;i<n;i++) cin>>a[i]
#define MP make_pair
#define spc " "
using namespace std;
int gcd(int x,int y){
if(x==0) return y;
else return gcd(y%x,x);
}
bool sortbysec(const pair<int,int>&a, const pair<int,int>&b){ return (a.second<b.second); }
bool sortbysecinrev(const pair<int,int>&a, const pair<int,int>&b){ return (a.second>b.second); }
bool sortbysize(string &s1,string &s2){ return s1.size() < s2.size(); }
bool sortinrev(const pair<int,int> &a, const pair<int,int> &b){ return (a.first > b.first); }
int main(){
boost_;
ll n;
cin>>n;
ll a[n],i,a1=0,a2=0,a3=0;
vector<ll>v,q;
map<ll,ll>mp;
scan(i,n,a);
sort(a,a+n,greater<int>());
for(i=0;i<n;++i){
mp[a[i]]++;
if(mp[a[i]]==1) q.pb(a[i]);
}
for(i=0;i<q.size();++i){
if(mp[q[i]]>=2) v.pb(q[i]);
if(v.size()==2) break;
}
if(v.size()==0) cout<<0<<endl;
else{
if(v.size()==1){if(mp[v[0]]>=4) cout<<v[0]*v[0]<<endl; else cout<<0<<endl;}
else{
if(mp[v[0]]>=4) cout<<v[0]*v[0]<<endl;
else cout<<v[0]*v[1]<<endl;
}
}
over;
}
|
#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 n, p;
cin >> n >> p;
string s;
cin >> s;
if (10%p == 0) {
ll ans = 0;
rep(r,n) {
if ((s[r]-'0') % p == 0) {
ans += r+1;
}
}
cout << ans << "\n";
return 0;
}
vector<int> d(n+1);
int ten = 1;
for (int i = n-1; i >= 0; --i) {
int a = (s[i]-'0') * ten % p;
d[i] = (d[i+1]+a) % p;
ten *= 10; ten %= p;
}
vector<int> cnt(p);
ll ans = 0;
for (int i = n; i >= 0; --i) {
ans += cnt[d[i]];
cnt[d[i]]++;
}
cout << ans << "\n";
return 0;
}
| 0
| 88,781,579
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1000000007;
inline bool chmin(ll &a, ll b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
inline bool chmax(ll &a, ll b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
T seinomi(T a)
{
if (a > 0)
{
return a;
}
else
{
return 0;
}
}
template <typename T>
T ketasuu(T num)
{
return std::to_string(num).length();
}
ll llpow(ll a, ll n)
{
if (n == 0)
{
return 1;
}
else
{
ll rep = a;
for (ll i = 1; i < n; i++)
{
rep *= a;
}
return rep;
}
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value)
{
while (first != last)
{
*first++ = value;
++value;
}
}
template <typename T>
T amarinasi(T a, T b)
{
if (a % b == 0)
{
return a / b;
}
else if (a % b > 0)
{
return a / b + 1;
}
else
{
return a / b - 1;
}
}
const double pi = 3.14159265358979323846264;
int main()
{
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
{
cin >> a[i];
}
queue<ll> que;
ll sum = 0;
ll xor_sum = 0;
ll ans = 0;
for (ll i = 0; i < n; i++)
{
que.push(a[i]);
sum += a[i];
xor_sum = xor_sum ^ a[i];
while (!(sum == xor_sum))
{
sum -= que.front();
xor_sum = xor_sum ^ que.front();
que.pop();
ans += que.size() - 1;
}
ans++;
}
while (!que.empty())
{
sum -= que.front();
xor_sum = xor_sum ^ que.front();
que.pop();
ans += que.size();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
char a[100][100];
char b[100][100];
int main() {
int N,M;
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cin>>a[i][j];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M;j++){
cin>>b[i][j];
}
}
bool match=false;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(i+M-1>=N||j+M-1>=N){continue;}
bool ok=true;
for(int k=0;k<M;k++){
for(int t=0;t<M;t++){
if(a[i+k][j+t]!=b[k][t]){ok=false;}
}
}
if(ok){match=true;}
}
}
if(match){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;}
| 0
| 44,545,086
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec_0(0);
vector<int> vec_1(0);
vec_0.push_back(0);
vec_1.push_back(0);
if (S[0] == '0') vec_0[0]++;
if (S[0] == '1') vec_1[0]++;
for (int i = 0; i < S.size() - 1; i++){
if (S[i] == S[i + 1]){
if (S[i] == '0') vec_0[vec_0.size() - 1]++;
if (S[i] == '1') vec_1[vec_1.size() - 1]++;
}
else if (S[i] == '0'){
if (vec_1[0] == 0) vec_1[0]++;
else vec_1.push_back(1);
}
else if (S[i] == '1'){
if (vec_0[0] == 0) vec_0[0]++;
else vec_0.push_back(1);
}
}
int ans = 0;
int len_0 = vec_0.size();
int len_1 = vec_1.size();
if (len_0 < len_1){
if (K >= len_0){
ans = N;
}
else{
int ans_sub = 0;
rep(i,K){
ans_sub += vec_0[i];
}
rep(i,K + 1){
ans_sub += vec_1[i];
}
ans = max(ans,ans_sub);
rep(i,len_0 - K){
ans_sub -= vec_0[i];
ans_sub -= vec_1[i];
ans_sub += vec_0[i + K];
ans_sub += vec_1[i + K + 1];
ans = max(ans,ans_sub);
}
}
}
else if (len_0 > len_1){
if (K >= len_0){
ans = N;
}
else{
vec_1.push_back(0);
vec_1.insert(vec_1.begin(),0);
int ans_sub = 0;
rep(i,K){
ans_sub += vec_0[i];
}
rep(i,K + 1){
ans_sub += vec_1[i];
}
ans = max(ans,ans_sub);
rep(i,len_0 - K){
ans_sub -= vec_0[i];
ans_sub -= vec_1[i];
ans_sub += vec_0[i + K];
ans_sub += vec_1[i + K + 1];
ans = max(ans,ans_sub);
}
}
}
else if (S[0] == '0'){
if (K >= len_0){
ans = N;
}
else{
vec_1.insert(vec_1.begin(),0);
int ans_sub = 0;
rep(i,K){
ans_sub += vec_0[i];
}
rep(i,K + 1){
ans_sub += vec_1[i];
}
ans = max(ans,ans_sub);
rep(i,len_0 - K){
ans_sub -= vec_0[i];
ans_sub -= vec_1[i];
ans_sub += vec_0[i + K];
ans_sub += vec_1[i + K + 1];
ans = max(ans,ans_sub);
}
}
}
else{
if (K >= len_0){
ans = N;
}
else{
vec_1.push_back(0);
int ans_sub = 0;
rep(i,K){
ans_sub += vec_0[i];
}
rep(i,K + 1){
ans_sub += vec_1[i];
}
ans = max(ans,ans_sub);
rep(i,len_0 - K){
ans_sub -= vec_0[i];
ans_sub -= vec_1[i];
ans_sub += vec_0[i + K];
ans_sub += vec_1[i + K + 1];
ans = max(ans,ans_sub);
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
signed main() {
string s;
cin >> s;
int l = 0, r = (int)s.length()-1;
int ans = 0;
while(l < r){
if(s[l] != s[r]){
if(s[l] == 'x'){
r++;
}else if(s[r] == 'x'){
l--;
}else{
ans = -1; break;
}
ans++;
}
l++; r--;
}
cout << ans << endl;
}
| 0
| 55,021,740
|
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
int main(void){
int n,a,b;
while(cin>>n>>a>>b,n){
vi s(n);
int ans=-1,t=-1;
rep(i,n){
cin>>s[i];
if(a<=i && i<=b && t<=s[i-1]-s[i]){
t=s[i-1]-s[i];
ans=i;
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int N, A, B;
int main(){
scanf("%d%d%d",&N,&A,&B);
if(A>N || B>N) return !printf("-1\n");
vector<int> v(N); for(int i=0;i<N;i++) v[i] = i+1;
vector<int> ret;
for(int i=0;i<A;i++){
ret.push_back(v.back());
v.pop_back();
}
reverse(ret.begin(),ret.end());
int b = 1;
while(!v.empty()){
if(b>=B) return !printf("-1\n");
int n = v.size();
int x = b+1+n-B;
if(x<=0) return !printf("-1\n");
int cur = min(x, A);
vector<int> tmp;
for(int i=0;i<cur;i++){
tmp.push_back(v.back());
v.pop_back();
}
while(!tmp.empty()){
ret.push_back(tmp.back());
tmp.pop_back();
}
b++;
}
if(b!=B) return !printf("-1\n");
for(int x:ret) printf("%d ", x);
printf("\n");
}
| 0
| 10,441,212
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
int h[n];
rep(i,n) cin >> h[i];
int dp[n];
rep(i,n) dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[0]-h[1]);
for(int i=2; i<n; i++){
dp[i] = min(dp[i], min(dp[i-2]+abs(h[i-2]-h[i]), dp[i-1]+abs(h[i-1]-h[i])));
}
cout << dp[n-1] << endl;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
ll mypow(ll a, ll b) {
ll ans = 1;
ll two;
ll tmp;
while(b>0) {
two = 1;
tmp = a;
while(2*two<b) {
tmp *= tmp;
tmp %= mod1;
two *= 2;
}
b -= two;
ans *= tmp;
ans %= mod1;
}
return ans;
}
int main() {
int N;
cin>>N;
int D[N];
int maxnum = 0;
map<int, ll> amap;
for(int i=0;i<N;++i) {
cin>>D[i];
amap[D[i]]++;
maxnum = max(maxnum, D[i]);
}
if(D[0]!=0) {
cout<<0<<endl;
return 0;
}
int zeronum = 0;
for(int i=0;i<N;++i) {
if(D[i]==0) zeronum++;
}
if(zeronum!=1) {
cout<<0<<endl;
return 0;
}
ll ans = 1;
for(int i=2;i<=maxnum;++i) {
ans *= mypow(amap[i-1], amap[i]);
ans %= mod1;
}
cout<<ans<<endl;
}
| 0
| 70,776,772
|
#include <bits/stdc++.h>
using namespace std;
int f(string s) {
int ans = 0;
int counter = 0;
char cur = s[0];
for(int i = 0; i < s.size(); i++) {
if(s[i] == cur) {
counter++;
} else {
if(counter > 1) {
if(counter % 2 == 0) {
ans += counter / 2;
} else {
ans += (counter - 1) / 2;
}
}
counter = 1;
cur = s[i];
}
}
if(counter > 1) {
if(counter % 2 == 0) {
ans += counter / 2;
} else {
ans += (counter - 1) / 2;
}
}
return ans;
}
int main() {
string s;
int k;
cin >> s >> k;
if(s.size() == 1) {
if(k % 2 == 0) {
cout << k / 2 << "\n";
} else {
cout << (k - 1) / 2 << "\n";
}
return 0;
}
long long one = f(s);
vector<int> alphabets(26, 0);
for(int i = 0; i < s.size(); i++) {
alphabets[s[i]-'a']++;
}
int cnt = 0;
for(int i = 0; i < 26; i++) {
if(alphabets[i] == 0) {
cnt++;
}
}
if(cnt == 25) {
long long ans = k * s.size();
if(ans % 2 == 0) {
ans /= 2;
} else {
ans = (ans - 1) / 2;
}
cout << ans << "\n";
return 0;
}
if(s[0] != s[s.size()-1]) {
cout << one * k << "\n";
} else {
long long ans = one * k;
long long a = 0, b = 0;
char cur1 = s[0];
for(int i = 0; i < s.size(); i++) {
if(s[i] == cur1) {
a++;
} else {
break;
}
}
long long ha;
if(a % 2 == 0) {
ha = a / 2;
} else {
ha = (a - 1) / 2;
}
char cur2 = s[s.size()-1];
for(int i = s.size()-1; i >= 0; i--) {
if(s[i] == cur2) {
b++;
} else {
break;
}
}
long long hb;
if(b % 2 == 0) {
hb = b / 2;
} else {
hb = (b - 1) / 2;
}
ans -= ha * (k - 1);
ans -= hb * (k - 1);
long long hh;
if((a + b) % 2 == 0) {
hh = (a + b) / 2;
} else {
hh = (a + b - 1) / 2;
}
ans += hh * (k - 1);
cout << ans << "\n";
}
return 0;
}
|
#if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int Q;
int L[1000+10][1000+10];
int main() {
cin >> Q;
string X, Y;
for (int i = 0; i < Q; i++) {
for (int j = 0; j < 1000+10; j++) {
L[0][j] = 0; L[j][0] = 0;
}
cin >> X >> Y;
for (int x = 1; x <= X.length(); x++) {
for (int y = 1; y <= Y.length(); y++) {
if (X[x-1] == Y[y-1])
L[x][y] = L[x-1][y-1]+1;
else
L[x][y] = max(L[x-1][y], L[x][y-1]);
}
}
cout << L[X.length()][Y.length()] << endl;
}
}
| 0
| 86,271,454
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=(n);i++)
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
int n;
cin>>n;
int ans=n;
for(int i=0;i<=n;i++){
int now=0;
int t=i;
while(t>0){
now+=t%6;
t/=6;
}
t=n-i;
while(t>0){
now+=t%9;
t/=9;
}
ans=min(ans,now);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void solve() {
string S; cin >> S;
int ans = INF;
for (int i = 0; i < S.size() - 2; ++i) {
int tmp = stoi(S.substr(i, 3));
ans = min(ans, abs(753 - tmp));
}
cout << ans << endl;
return;
}
int main() {
solve();
return 0;
}
| 0
| 46,582,848
|
#include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >> t;
vector<int> sToT(26, -1);
vector<int> tToS(26, -1);
bool ok = true;
for (int i = 0; i < s.size(); i++) {
int sc = s.at(i) - 'a';
int tc = t.at(i) - 'a';
if ((sToT.at(sc) != -1 && sToT.at(sc) != tc)
|| (tToS.at(tc) != -1 && tToS.at(tc) != sc)) {
ok = false;
break;
}
sToT[sc] = tc;
tToS[tc] = sc;
}
cout << (ok ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll a,b;
cin>>a>>b;
if(b-a+1>=2019) cout<<0<<endl;
else{
ll ans=INF;
for(ll i=a;i<=b-1;i++){
for(ll j=i+1;j<=b;j++){
ll L=i%2019,R=j%2019;
ll a=(L*R)%2019;
ans=min(a,ans);
}
}
cout<<ans<<endl;
}
}
| 0
| 39,546,952
|
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
long long POW(long long x, long long n) {
if (n == 0) return 1;
if (n % 2 == 1) return (x * POW(x, n - 1));
long long t = POW(x, n / 2);
return (t * t);
}
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(N);
vector<long long> sum(N+1, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum[i+1] = sum[i] + A[i];
}
vector<long long> B;
for (int i = 0; i < N; i++) {
for (int j = i+1; j <= N; j++) {
B.emplace_back(sum[j] - sum[i]);
}
}
int M = B.size();
long long ans = 0;
vector<bool> ok(M, true);
for (int s = 63; s >= 0; s--) {
long long bit = (1LL<<s);
int cnt = 0;
for (int i = 0; i < M; i++) if (ok[i]) {
if (bit&B[i]) cnt++;
}
if (K <= cnt) {
for (int i = 0; i < M; i++) if (ok[i]) {
if (!(bit&B[i])) ok[i] = false;
}
ans += bit;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for ( int i = 0; i < (int)(n); i++ )
int main( void )
{
char a,b;
cin >> a >> b;
int ans = 1;
if ( a == 'D' )
ans *= -1;
if ( b == 'D' )
ans *= -1;
if ( ans > 0 )
cout << 'H' << endl;
else
cout << 'D' << endl;
}
| 0
| 17,392,598
|
#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;
static const long long mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vll ts(n), as(n);
rep(i, n) cin >> ts[i];
rep(i, n) cin >> as[i];
ll tmid = -1, tmax = 0;
rep(i, n) {
if (tmax < ts[i]) {
tmid = i;
tmax = ts[i];
}
}
ll amid = -1, amax = 0;
rep(i, n) {
if (amax < as[n - 1 - i]) {
amid = n - 1 - i;
amax = as[n - 1 - i];
}
}
if (tmid > amid || tmax != amax) {
cout << 0 << endl;
return 0;
}
ll maxv = tmax;
ll ans = 1;
tmax = 0;
rep(i, tmid) {
if (tmax == ts[i]) {
ans = ans * tmax % mod;
} else {
tmax = ts[i];
}
}
repLRE(i, tmid + 1, amid - 1) { ans = ans * maxv % mod; }
amax = 0;
rrepLRE(i, n - 1, amid + 1) {
if (amax == as[i]) {
ans = ans * amax % mod;
} else {
amax = as[i];
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }
#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9
int a[5];
int main()
{
rep(i, 5) cin >> a[i];
sort(a, a+5, greater<int>());
rep(i, 5) cout << a[i] << (i==4 ? "\n" : " ");
return 0;
}
| 0
| 88,782,746
|
#include <bits/stdc++.h>
#define INF 1e7
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef tuple<int,int,int> tii;
typedef tuple<long long int,long long int,long long int> tll;
typedef tuple<double,double,double> tdd;
int main()
{
ll a,b,c,d; cin >> a >> b >> c >> d;
ll ans = a*c;
ans = max(ans,a*d);
ans = max(ans,b*c);
ans = max(ans,b*d);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int INF = 1<<29;
int main(){
int n, m; cin >> n >> m;
vector<int> a(m), b(m), c(m);
vector<vector<int>> dist(n, vector<int>(n,INF));
rep(i,n) dist[i][i] = 0;
rep(i,m){
cin >> a[i] >> b[i] >> c[i];
--a[i], --b[i];
dist[a[i]][b[i]] = c[i];
dist[b[i]][a[i]] = c[i];
}
for(int k = 0; k < n; ++k){
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
int res = 0;
rep(i,m){
if(c[i] > dist[a[i]][b[i]])res++;
}
cout << res << endl;
}
| 0
| 57,191,014
|
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int h,w,d,t1,t2;
int main(){
cin>>h>>w>>d;
for(int i=1;i<=h;++i,putchar(10))
for(int j=1;j<=w;++j){
t1=((i-j+w)/d)&1;
t2=((i+j)/d)&1;
putchar((t1<<1|t2)["RYGB"]);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=b; return 1; } return 0;}
int main(){
int n,m;
cin >> n >> m;
vector<bool> broken(n,false);
int a;
REP(i,m){
cin >> a;
broken[a] = true;
}
ll modnum = 1000000007;
vector<ll> step(n+1);
step[0] = 1;
for(int i=1; i<=n; ++i){
if(broken[i]) continue;
ll count = 0;
if(i-1 >= 0 && !broken[i-1]){
count += step[i-1];
}
if(i-2 >= 0 && !broken[i-2]){
count += step[i-2];
}
count = count%modnum;
step[i] = count;
}
cout << step[n] << endl;
return 0;
}
| 0
| 10,154,348
|
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+5;
int h,s[maxn];
int parent(int i)
{
return i/2;
}
int left(int i)
{
return i*2;
}
int right(int i)
{
return i*2+1;
}
int main()
{
scanf("%d",&h);
for(int i=1;i<=h;i++){
scanf("%d",&s[i]);
}
for(int i=1;i<=h;i++){
cout<<"node "<<i<<": key = "<<s[i]<<", ";
if(parent(i)>=1){
cout<<"parent key = "<<s[parent(i)]<<", ";
}
if(left(i)<=h){
cout<<"left key = "<<s[left(i)]<<", ";
}
if(right(i)<=h){
cout<<"right key = "<<s[right(i)]<<", ";
}
cout<<endl;
}
return 0;
}
|
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define ll long long
#define inf 20021225
#define N 1225
using namespace std;
int read()
{
int s=0,t=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') t=-1; ch=getchar();}
while(ch>='0' && ch<='9') s=s*10+ch-'0',ch=getchar();
return s*t;
}
int d[N],m,x[N],y[N],n;
int main()
{
n=read();
for(int i=1;i<=n;i++)
{
x[i]=read(),y[i]=read();
if(((x[i]+y[i])&1)!=((x[1]+y[1])&1)) return puts("-1"),0;
}
if(!((x[1]+y[1])&1)) d[++m]=1;
for(int i=30;~i;i--) d[++m]=(1<<i);
printf("%d\n",m);
for(int i=1;i<=m;i++) printf("%d ",d[i]); puts("");
for(int i=1;i<=n;i++,puts(""))
{
for(int j=1;j<=m;j++)
{
if(abs(x[i])>abs(y[i]))
{
if(x[i]>0) x[i]-=d[j],putchar('R');
else x[i]+=d[j],putchar('L');
}
else
{
if(y[i]>0) y[i]-=d[j],putchar('U');
else y[i]+=d[j],putchar('D');
}
}
}
return 0;
}
| 0
| 4,459,554
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a,b,c,d;
d=N%10;
c=(N-d)%100/10;
b=(N-d-c*10)%1000/100;
a=(N-d-c*10-b*100)%10000/1000;
if(((a==b)&&(b==c))||((b==c)&&(c==d))){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<numeric>
using namespace std;
int main(){
int N,M;cin>>N>>M;
long x[N],y[N],z[N],ans=0L;
vector<long>v(N);
for(int i=0;i<N;i++)cin>>x[i]>>y[i]>>z[i];
for(int bit=0;bit<8;bit++){
bitset<3>b(bit);
for(int i=0;i<N;i++)v[i]=x[i]*(b[0]?-1:1)+y[i]*(b[1]?-1:1)+z[i]*(b[2]?-1:1);
sort(v.begin(),v.end(),greater<long>());
ans=max(ans,accumulate(v.begin(),v.begin()+M,0L));
}
cout<<ans<<endl;
return 0;
}
| 0
| 97,594,817
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int x;
cin >> x;
cout << ((x / 100)*5 >= (x % 100) ? 1 : 0) << '\n';
}
|
#include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
int N,A[100005],L[100005];
int main()
{
L[0]=0;
cin>>N;
int i,j;
for(i=1;i<=N;i++){
cin>>A[i];
}
int len=1;
L[0]=A[1];
for(i=1;i<=N;i++){
if(L[len-1]<A[i])L[len++]=A[i];
else *lower_bound(L,L+len,A[i])=A[i];
}
cout<<len<<endl;
return 0;
}
| 0
| 20,630,124
|
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 16769023;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[]={2,2,-2,-2,1,1,-1,-1},ddy[]={1,-1,1,-1,2,-2,2,-2};
ll a[100000];
int main(){
int n;
scanf("%d",&n);
ll tot=0,ans=0;
fup(i,0,n-1,1)
{
scanf("%lld",a+i);
tot^=a[i];
}
fup(i,0,n-1,1)a[i] &= ~tot;
sort(a,a+n);
int idx=59;
fdn(i, n - 1, 0, 1)
{
while(idx>=0 && (a[i] & (1LL << idx)) == 0)
{
idx--;
}
if (idx < 0)break;
if((ans&(1LL<<idx))==0)ans ^= a[i];
fdn(j, i - 1, 0, 1)
{
if ((a[j] & (1LL << idx)) == 0)break;
a[j] ^= a[i];
}
sort(a, a + i);
idx--;
}
printf("%lld",ans+(tot^ans));
}
|
#include <iostream>
int main(int argc, const char *argv[]) {
std::string str;
int m, h;
for ( ; std::cin >> str && str != "-"; ) {
std::cin >> m;
for (int i = 0; i < m; i++) {
std::cin >> h;
str = str.substr(h) + str.substr(0, h);
}
std::cout << str << std::endl;
}
return 0;
}
| 0
| 41,665,810
|
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<math.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
int main()
{
ll S[2005]={0,0,0,1,1};
int s;
cin>>s;
for(int i=4;i<=s;i++)
{
S[i]=(S[i-1]+S[i-3])%mod;
}
cout<<S[s]<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int H, W, A, B; cin >> H >> W >> A >> B;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(j < A){
if(i < B) cout << 1;
else cout << 0;
}else{
if(i < B) cout << 0;
else cout << 1;
}
}
cout << endl;
}
}
| 0
| 54,149,864
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.