code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
long A,B;
string op;
cin>>A>>op>>B;
if(op=="+"){
cout << A+B <<endl;
return 0;
}else{
cout << A-B<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {
ll A,B;
cin>>A>>B;
if(B-A<=10){
ll ans=A;
for(ll i=A+1;i<=B;i++){
ans=ans^i;
}
cout<<ans<<endl;
return 0;
}
ll ansa,ansb,ans;
ansa=A,ansb=B;
ll nowa=A+1,nowb=B-1;
while(nowa%4!=0){
ansa=ansa^nowa;
nowa++;
}
while(nowb%4!=3){
ansb=ansb^nowb;
nowb--;
}
ans=ansa^ansb;
cout<<ans<<endl;
} | 0 | 75,160,951 |
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < (int)s.length() && s[i] != '\0'; i++) {
sum += s[i] - '0';
}
if (sum % 9 == 0) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int dp[101];
void solve() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) {
int temp = 0;
int cur = i;
while (cur % 2 == 0) {
if (dp[i]) {
temp += dp[i];
cur = 1;
} else {
temp++;
cur /= 2;
}
}
dp[i] = temp;
if (dp[ans] < dp[i]) ans = i;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | 0 | 82,220,634 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, P;
string S;
cin >>N >> P >> S;
vector<int>NUM(S.size()+1);
NUM[0] = 0;
int num = 0;
int ten = 1;
for (int n = 0;n<S.size();++n) {
int m = S[S.size()-1-n] - '0';
ten *= 10;
ten %= P;
num = (ten * m + num)%P;
NUM[n+1] = num;
}
long long nans = 0;
if (2 == P ||5 == P) {
for (int n = 0; n < S.size(); ++n) {
int m = S[n] - '0';
if (0 == m%P) {
nans += (n + 1);
}
}
}
else {
vector<long long>MOD(P);
for (int n = 0; n < S.size() + 1; ++n) {
MOD[NUM[n]]++;
}
for (int n = 0; n < P; ++n) {
nans += (MOD[n] - 1) * MOD[n] / 2;
}
}
cout << nans<< endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#define int long long
using namespace std;
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N/i != i) res.push_back(N/i);
}
}
sort(res.begin(), res.end());
return res;
}
signed main() {
int N;
cin>>N;
int A=0;
for(int i=1;i<=N;i+=2){
const auto &res = enum_divisors(i);
if(res.size()==8){
A++;
}
}
cout<<A<<endl;
} | 0 | 93,176,053 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int n, M;
ll ans = 0, num = 0;
int main()
{
cin >> n >> M;
vector<pair<long long, long long>> a(n);
rep(i, 0, n)
{
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
for (auto v : a)
{
if (num >= M)
{
break;
}
else if (num + v.second <= M)
{
num += v.second;
ans += v.first * v.second;
}
else
{
ans += v.first * (M - num);
num = M;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
using P =pair<int,int>;
ll ketasu(ll a){
ll num=1;
while(a/10){
num++;
a/=10;
}
return num;
}
ll gcd(ll a,ll b){return b ? gcd(b,a%b) :a;}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll kosuu(ll a){
ll sum=0;
for(ll i=1;i*i<=a;i++){
if(a%i==0){
if(a!=1&&i*i!=a){
sum+=2;
}else{
sum++;
}
}
}
return sum;
}
ll sum(ll l,ll r){
return(l+r)*(r-l+1)/2;
}
int main(){
ll n;
cin>>n;
string s;
cin>>s;
vector<ll>v(n);
rep(i,n){
if(s[i]=='R')v[i]=0;
if(s[i]=='G')v[i]=1;
if(s[i]=='B')v[i]=2;
}
vector<ll>cnt(3);
rep(i,n){
cnt[v[i]]++;
}
ll ans=1;
rep(i,3){
ans*=cnt[i];
}
rep(j,n)rep(i,j){
ll k=j+j-i;
if(k<n){
if(v[k]==v[i])continue;
if(v[i]==v[j])continue;
if(v[k]==v[j])continue;
ans--;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 15,687,647 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <random>
#include <complex>
#define _1 first
#define _2 second
#define pb push_back
#define mp make_pair
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#define uni(x) (x).erase(unique(all(x)), (x).end())
#define reset(x, y) memset(x, y, sizeof(x))
#define BUG(x) cerr << #x << " = " << (x) << endl
#define BUGP(x) cout << #x << " = " << (x)._1 << ", " << (x)._2 << endl
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int dr[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dc[] = {0, -1, 0, 1, -1, 1, -1, 1};
const int N = 112345;
const int MOD = int(1e9) + 7;
LL fac[N];
int n;
string s;
int main() {
cin >> n;
fac[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % MOD;
cin >> s;
LL ans = 1;
LL cur = 0;
for (int i = 0; i < s.length(); i++) {
int tmp = 0;
if (s[i] == 'B') tmp = 1;
if ((tmp + cur) % 2 == 1) ++cur;
else {
ans = ans * cur % MOD;
--cur;
}
}
if (cur) {
cout << 0 << '\n';
return 0;
}
cout << ans * fac[n] % MOD << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INFLL (1ll<<60)
static const int MAX=200000;
int N;
ll a[MAX],sum;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin>>N;
cin>>a[0];
for(int i=1;i<N;i++){
cin>>a[i];
a[i]+=a[i-1];
}
ll min_d=INFLL;
for(int i=0;i<N-1;i++){
if(min_d>abs(a[i]-(a[N-1]-a[i]))) min_d=abs(a[i]-(a[N-1]-a[i]));
}
cout<<min_d<<"\n";
return 0;
} | 0 | 25,975,561 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
string S;
int ans = 10000;
cin >> S;
rep(i,S.size()-2){
string A = S.substr(i,3);
int n = stoi(A);
int a = abs(753-n);
ans = min(ans,a);
}
cout << ans;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
int H, W, M;
int numH[300010], numW[300010];
vector<int> vW[300010];
vector<int> vH[300010];
signed main()
{
cin >> H >> W >> M;
rep(i, M)
{
int h, w;
cin >> h >> w;
numH[h]++;
numW[w]++;
vW[w].push_back(h);
}
int maxW = -1;
for(int i = 1; i <= 300000; i++)
maxW = max(maxW, numW[i]);
int num = 0;
for(int i = 1; i <= 300000; i++)if(numW[i] == maxW)
{
num++;
for(auto e : vW[i])vH[e].push_back(i);
}
int ans = 0;
for(int i = 1; i <= 300000; i++)
{
int tmp;
if(vH[i].size() == num)tmp = numH[i] + maxW - 1;
else tmp = numH[i] + maxW;
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | 0 | 20,691,334 |
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
void go(){
int n,k;cin>>n>>k;
int x=1;
while(n--) {
if(x*2<x+k) {
x*=2;
}else {
x+=k;
}
}
cout<< x;
}
int main(){
fastio();
cin.tie(0);
cout.tie(0);
go();
return 0;
} | #include <iostream>
using namespace std;
int main()
{
string s;
int n, h;
while (1) {
cin >> s >> n;
if (s == "-") break;
while (n--) {
cin >> h;
string t;
t += s.substr(h, s.length() - h);
t += s.substr(0, h);
s = t;
}
cout << s << endl;
}
return 0;
} | 0 | 93,477,795 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
int r_max = (N+R-1)/R;
int g_max = (N+G-1)/G;
rep(i,r_max+1)rep(j,g_max+1){
int k = (N - i*R - j*G)/B;
if (k < 0 ) break;
if (i*R + j*G + k*B == N) ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int fx(int x)
{
return x * x;
}
int main()
{
int i, d, s;
while(cin >> d)
{
s = 0;
for(i = 1; d * i <= (600 - d); i++)
{
s = s + fx(d * i) * d;
}
cout << s << endl;
}
return 0;
} | 0 | 18,723,608 |
#include<bits/stdc++.h>
using namespace std;
int x,y,a,b,c;
int main(){
cin>>x>>y>>a>>b>>c;
priority_queue<int,vector<int>,greater<int> >pq_a;
priority_queue<int,vector<int>,greater<int> >pq_b;
priority_queue<int,vector<int>,less<int> >pq_c;
while(a--){
int a;
cin>>a;
pq_a.push(a);
}
while(b--){
int a;
cin>>a;
pq_b.push(a);
}
while(c--){
int a;
cin>>a;
pq_c.push(a);
}
while(pq_a.size()>x) pq_a.pop();
while(pq_b.size()>y) pq_b.pop();
while(pq_c.size()){
int curr = pq_c.top();
pq_c.pop();
if(curr<=pq_a.top() && curr<=pq_b.top()) break;
if(pq_a.top()>pq_b.top()){
pq_b.pop();
pq_b.push(curr);
}
else{
pq_a.pop();
pq_a.push(curr);
}
}
long long ret = 0;
while(pq_a.size()){
ret+=pq_a.top();
pq_a.pop();
}
while(pq_b.size()){
ret+=pq_b.top();
pq_b.pop();
}
cout<<ret;
} | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int a[4][4]={};
rep(i,3){
int u,v;cin>>u>>v;u--,v--;
a[u][v]=1;a[v][u]=1;
}
rep(i,4){
int c=0;
rep(j,4){
c+=a[i][j];
}
if(c>2){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
} | 0 | 15,755,746 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if(N%2 == 1){
cout << "No" << endl;
return 0;
}
int n = N/2;
if(S.substr(n) == S.substr(0,n)){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int maxn=112345;
int h,w,n,a[maxn],b[maxn];
long long num[10];
set<pii> st,vis;
inline void add(int x,int y) {
int cnt=0;
for (int i=x-1;i<=x+1;++i)
for (int j=y-1;j<=y+1;++j)
if (st.find(pii(i,j))!=st.end())
++cnt;
++num[cnt];
}
int main()
{
scanf("%d%d%d",&h,&w,&n);
for (int i=1;i<=n;++i) {
scanf("%d%d",&a[i],&b[i]);
st.insert(pii(a[i],b[i]));
}
for (int i=1;i<=n;++i) {
int x=a[i],y=b[i];
for (int j=x-1;j<=x+1;++j)
for (int k=y-1;k<=y+1;++k) {
if (j<=1||j>=h||k<=1||k>=w) continue;
if (vis.find(pii(j,k))!=vis.end()) continue;
vis.insert(pii(j,k));
add(j,k);
}
}
int sum=0;
for (int i=0;i<10;++i) sum+=num[i];
num[0]+=1ll*(h-2)*(w-2)-sum;
for (int i=0;i<10;++i)
cout<<num[i]<<endl;
return 0;
} | 0 | 33,878,409 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
rep(i,a.size()) cout << a[i] << " ";
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
int main(){
ll n,m; cin >> n >> m;
vvl G(n,vl(n,linf));
rep(i,m){
ll u,v,d; cin >> u >> v >> d;
G[u][v] = d;
}
rep(i,n) G[i][i] = 0;
rep(k,n) rep(i,n) rep(j,n){
if(G[i][k] != linf && G[k][j] != linf){
chmin(G[i][j], G[i][k] + G[k][j]);
}
}
rep(i,n){
if(G[i][i] != 0){
puts("NEGATIVE CYCLE");
return 0;
}
}
rep(i,n){
rep(j,n){
if(G[i][j] == linf) cout << "INF";
else cout << G[i][j];
cout << (j != n-1 ? " " : "\n");
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> X, Y;
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
X.push_back(x);
Y.push_back(y);
}
bool even = (X[0] + Y[0]) % 2 == 0 ? true : false;
for (ll i = 0; i < N; i++) {
bool e = (X[i] + Y[i]) % 2 == 0 ? true : false;
if (even ^ e) {
cout << -1 << "\n";
return 0;
}
if (even) X[i]--;
}
vector<ll> sections;
if (even) sections.push_back(1ll);
for (ll i = 31; i >= 0; i--) {
sections.push_back(1ll << i);
}
cout << sections.size() << "\n";
for (ll len: sections) cout << len << " "; cout << "\n";
const ll dx[] = {1ll, -1ll, 0, 0};
const ll dy[] = {0, 0, 1ll, -1ll};
const char dir[] = {'R', 'L', 'U', 'D'};
for (ll i = 0; i < N; i++) {
string ans = "";
if (even) ans += "R";
for (ll j = 31; j >= 0; j--) {
ll mind = 10000000000;
ll idx;
for (ll k = 0; k < 4; k++) {
ll cur = abs(X[i] - dx[k] * (1ll << j)) + abs(Y[i] - dy[k] * (1ll << j));
if (cur < mind) {
mind = cur;
idx = k;
}
}
X[i] = X[i] - dx[idx] * (1ll << j);
Y[i] = Y[i] - dy[idx] * (1ll << j);
ans += dir[idx];
}
cout << ans << "\n";
}
return 0;
} | 0 | 66,585,627 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<n;i++)
#define REP(i, n) for(int i=1;i<=n;i++)
typedef long long ll;
bool comp(const pair<ll, ll> v1, pair<ll, ll> v2) {
return v1.first - v1.second > v2.first - v2.second;
}
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> vp(n);
rep(i, n) cin >> vp[i].first;
rep(i, n) cin >> vp[i].second;
sort(vp.begin(), vp.end(), comp);
ll ans = 0;
ll count = 0;
rep(i, n) {
if (vp[i].first < vp[i].second) {
ans++;
count += vp[i].second - vp[i].first;
vp[i].first = vp[i].second;
}
}
rep(i, n) {
if (count <= 0) break;
if (vp[i].first > vp[i].second) {
count -= vp[i].first - vp[i].second;
ans++;
}
}
if (count > 0) ans = -1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int H, W;
cin>>H>>W;
vvi A(H, vi(W, 0));
vector<pint> B;
REP(i, 0, H){
string S;
cin >> S;
REP(j, 0, W){
if(S[j] == '#'){
A[i][j] = 1;
B.push_back({i, j});
}
}
}
queue<pint> que;
vvi Map(H, vi(W, -1));
for(pint a: B){
que.push(a);
Map[a.first][a.second] = 0;
}
vector<pint> D = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int ans = 0;
while(!que.empty()){
auto cur = que.front(); que.pop();
int count = Map[cur.first][cur.second];
ans = max(ans, count);
for(pint x: D){
int new_x = cur.first + x.first;
int new_y = cur.second + x.second;
if(new_x < 0 || new_y < 0 || new_x >= H || new_y >= W) continue;
if(Map[new_x][new_y] == -1){
que.push({new_x, new_y});
Map[new_x][new_y] = count + 1;
}
}
}
cout << ans << endl;
} | 0 | 68,088,292 |
#include<iostream>
#include<algorithm>
#include<stack>
#include<string>
using namespace std;
#define REP(i, b, e) for ( int i = b; i < (int)e; i++ )
#define rep(i, n) REP(i, 0, n)
bool check(string line){
stack<char> S;
char ch;
for ( int i = 0; i < line.size()-1; i++ ){
if ( line[i] == '(' ){
S.push('(');
} else if ( line[i] == '[' ){
S.push('[');
} else if ( line[i] == ')' ){
if ( S.size() == 0) return false;
ch = S.top(); S.pop();
if ( ch != '(' ) return false;
} else if ( line[i] == ']' ){
if ( S.size() == 0) return false;
ch = S.top(); S.pop();
if ( ch != '[' ) return false;
}
}
return S.size() == 0;
}
main(){
string line;
while(1){
getline(cin, line);
if ( line == "." ) break;
if ( check(line) ) cout << "yes" << endl;
else cout << "no" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define DEBUG_ARR(v,n) cout<<#v<<":";REP(i,n)cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin>>n;
vi a(n);
REP(i,n) cin>>a[i];
vl cs(n+1);
unordered_map<ll,ll> cnt;
ll ans = 0;
cnt[0] = 1;
ll zero = 0;
REP(i,n){
cs[i+1] = cs[i]+a[i];
cnt[cs[i+1]]++;
}
for(auto& e : cnt){
ans += (e.second * (e.second-1)) / 2LL;
}
cout << ans << endl;
return 0;
} | 0 | 46,017,454 |
#include <iostream>
int main() {
std::string s, t;
std::cin >> s >> t;
int m = 0;
for (int i = 0; i < 3; i++) {
if (s[i] == t[i]) {
m++;
}
}
std::cout << m << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) for(ll i=begin;i<=end;i++)
#define rlp(i,begin,end) for(ll i=end;i>=begin;i--)
#define prec(n) fixed<<setprecision(n)
#define initial(a,i) memset(a,i,sizeof(a))
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define F first
#define S second
#define all(a) (a).begin(),(a).end()
#define BPC(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
ll gcd(ll a,ll b) {if (a==0) return b;return gcd(b%a,a);}
ll power(ll x,ll n)
{
ll result = 1;
while (n)
{
if (n & 1)
result = result * x;
n = n / 2;
x = x * x;
}
return result;
}
void solution(ll compte)
{
ll A,B,C;
cin >> A >> B >> C;
ll ans = C-A+B;
cout << max(0,int(ans)) << endl;
}
int main()
{
ll compte = 1;
solution(compte);
compte++;
return 0;
} | 0 | 11,398,035 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N);
for (int i = 1; i <= N; i++) {
int a;
std::cin >> a;
A[a-1]++;
}
std::sort(A.begin(), A.end());
std::vector<int> Sum(N+1);
for (int i = 0; i < N; i++) {
Sum[i+1] = Sum[i]+A[i];
}
for (int K = 1; K <= N; K++) {
int l = 0, r = N/K+1;
while(l+1 < r) {
int c = (l+r)/2;
bool ok = [&](int c) {
int i = std::lower_bound(A.begin(), A.end(), c) - A.begin();
int sum = c*(N-i) + Sum[i];
return (sum >= c*K);
}(c);
if (ok) l = c; else r = c;
}
std::cout << l << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
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;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int w, h; cin >> w >> h;
vector<ll> P(w); rep(i, w) cin >> P[i];
vector<ll> Q(h); rep(i, h) cin >> Q[i];
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
rep(i, w) q.push({P[i], 0});
rep(i, h) q.push({Q[i], 1});
ll ans = 0;
int cntW = w+1, cntH = h+1;
while(!q.empty()) {
auto cur = q.top(); q.pop();
if(cur.second == 0) {
ans += cur.first * cntH;
cntW--;
} else {
ans += cur.first * cntW;
cntH--;
}
}
cout << ans << endk;
return 0;
} | 0 | 96,706,891 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#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 repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.end(), x.begin()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
bool yes = 0;
bool boo = 0;
int mx = -100000, mn = 100000;
int sum = 0;
int ans = 0;
int co = 0;
int main()
{
VAR(string, S);
while (S.length() != 0) {
S.pop_back();
int b = S.length() % 2;
int a = S.length() / 2;
if (b == 0) {
if (S.substr(0, a) == S.substr(a, a)) {
cout << S.length() << endl;
return 0;
}
}
}
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
ll const mod = 1e9+7;
int main() {
int N;
string S;
cin >> S;
N = S.size();
vector<vector<ll>> memo(N+1,vector<ll>(2,0));
memo[0][0] = 1;
rep2(i,1,N+1) {
auto t = S[i-1];
if (t=='0') {
memo[i][0] = memo[i-1][0]%mod;
memo[i][1] = memo[i-1][1]*3%mod;
}
else {
memo[i][0] = memo[i-1][0]*2%mod;
memo[i][1] = (memo[i-1][0] + memo[i-1][1]*3)%mod;
}
}
cout << (memo[N][0] + memo[N][1])%mod << endl;
} | 0 | 10,101,140 |
#include<bits/stdc++.h>
#define ntest 0
using namespace std;
int n;
long long res;
void solve() {
cin >> n;
for (int i = 1; i < n; ++i) res += (n-1)/i;
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if(ntest){
int t;
cin >> t;
while(t--) solve();
} else {
solve();
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
int vs[200000+10];
ll hs[200000+10];
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
scanf("%d", &vs[i]);
hs[vs[i]]++;
}
ll total = 0;
REP(i, n) {
total += hs[i+1] * (hs[i+1]-1) / 2;
}
REP(i, n) {
int v = vs[i];
ll h = hs[v];
total -= h * (h-1) / 2;
--h;
total += h * (h-1) / 2;
printf("%lld\n", total);
total -= h * (h-1) / 2;
++h;
total += h * (h-1) / 2;
}
return 0;
} | 0 | 82,713,770 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int main() {
int h, w, k;
int h1, w1;
int h2, w2;
int i, j;
int q1, q2;
int buf;
int cc;
int kc = 0;
int count = 0;
cin >> h >> w >> k;
char c;
vector<vector<int>> s(h);
vector<int> h_num(h);
vector<int> h_buf;
vector<int> w_num(w);
vector<int> w_buf;
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
cin >> c;
if (c == '.')buf = 0;
else {
buf = 1;
kc++;
h_num[i]++;
w_num[j]++;
}
s[i].push_back(buf);
}
}
h2 = (int)pow(2.0, h);
w2 = (int)pow(2.0, w);
for (i = 0; i < h2; i++){
for (j = 0; j < w2; j++) {
h1 = i;
w1 = j;
buf = kc;
cc = 0;
while (h1 > 0) {
if (h1 % 2 == 1) {
buf -= h_num[cc];
h_buf.push_back(cc);
}
h1 /= 2;
cc++;
}
cc = 0;
while (w1 > 0) {
if (w1 % 2 == 1) {
buf -= w_num[cc];
w_buf.push_back(cc);
}
w1 /= 2;
cc++;
}
for (q1 = 0; q1 < h_buf.size(); q1++) {
for (q2 = 0; q2 < w_buf.size(); q2++) {
if (s[h_buf[q1]][w_buf[q2]] == 1)buf++;
}
}
if (buf == k)count++;
h_buf.clear();
w_buf.clear();
}
}
cout << count << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string command,q,str,str1,p;
int n,a,b,c,d;
cin>>str>>n;
for(int i=0;i<n;i++){
cin>>command>>a>>b;
if(command=="print"){
q=str.substr(a,b-a+1);
cout<<q<<endl;
}
if(command=="reverse"){
str1=str.substr(a,b-a+1);
c=str1.size();
for(int i=0;i<c;i++){
str[i+a]=str1[c-i-1];
}
}
if(command=="replace"){
cin>>p;
str=str.replace(a,b-a+1,p);
}
}
return 0;
} | 0 | 40,405,803 |
#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;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b.at(i);
vector<int> a(n);
a.at(0) = b.at(0);
rep(i, n - 1) {
if (a.at(i) > b.at(i)) a.at(i) = b.at(i);
for (int j = a.at(i); j <= b.at(i); j++) {
a.at(i + 1) = j;
}
}
ll ans = 0;
rep(i, n) {
ans += a.at(i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
char A[n][n];
char B[m][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];
}
for (int i = 0; i < n - m + 1; ++i) {
for (int j = 0; j < n - m + 1; ++j) {
bool is_found = true;
for (int x = 0; x < m && is_found; ++x) {
for (int y = 0; y < m && is_found; ++y) {
if (A[i + x][j + y] != B[x][y]) {
is_found = false;
}
}
}
if (is_found) {
cout << "Yes" << "\n";
return 0;
}
}
}
cout << "No" << "\n";
} | 0 | 71,737,580 |
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
ll SUM(VI& V){
return accumulate(ALL(V), 0LL);
}
void print_vector(VI& V){
ll n = V.size();
rep(i, n){
if(i) cout << ' ';
cout << V[i];
}
cout << endl;
}
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;
}
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
string g(ll v){
stringstream ss;
ll a = v/1000;
if(a==1){
ss << 'm';
}else if(a>1){
ss<<a<<'m';
}
v %= 1000;
a = v/100;
if(a==1){
ss << 'c';
}else if(a>1){
ss<<a<<'c';
}
v %= 100;
a = v/10;
if(a==1){
ss << 'x';
}else if(a>1){
ss<<a<<'x';
}
v %= 10;
a = v/1;
if(a==1){
ss << 'i';
}else if(a>1){
ss<<a<<'i';
}
v %= 1;
return ss.str();
}
bool is_num(char c){
ll v = c-'0';
if(0<=v && v<10){
return true;
}else{
return false;
}
}
ll ctoi(char c){
return c-'0';
}
ll mcxi_to_value(char c){
if(c=='m') return 1000;
if(c=='c') return 100;
if(c=='x') return 10;
if(c=='i') return 1;
}
ll f(string s){
ll L = s.size();
ll ret=0;
ll c = 1;
rep(i, L){
if(is_num(s[i])){
c = ctoi(s[i]);
}else{
ret += c*mcxi_to_value(s[i]);
c = 1;
}
}
return ret;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll T;cin>>T;
while(T--){
string a,b;cin>>a>>b;
ll v = f(a);
ll w = f(b);
ll x = v+w;
string s = g(x);
p(s);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
double pi = acos(-1.0);
const double EPS=1e-9;
#define MOD ll(1e9L+7)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define t() ll tt;cin>>tt;while(tt--)
#define t2() ll tt2; cin>>tt2; for(ll tti=1;tti<=tt2;tti++)
#define printcj "Case #"<<tti<<": "
#define debug1(x) cerr << #x << " = " << x << '\n';
#define debug2(x, y) cout << #x << " = " << x << " " << #y << " = " << y << "\n";
#define debug3(x, y,z) cout << #x << " = " << x << " " << #y << " = " << y << " "<<#z<<" = "<<z<<"\n";
#define debugarray(arr,n,x) { cout << "[" ; for(ll i=0;i<n;i++) cout<<arr[i]<<" "; cout<<"] , "<<#x<<" = "<<x<<'\n';}
vector<vector<ll>>g;
pll solve(ll source,ll parent)
{
pll current = {1,1};
for(auto to:g[source]){
if(to!=parent){
pll temp = solve(to,source);
current.first = (current.first* (temp.first + temp.second))%MOD;
current.second = (current.second*temp.first)%MOD;
}
}
return current;
}
int main()
{
fastio;
ll n,i,u,v;
cin>>n;
g.resize(n+1);
for(i=0;i<n-1;i++){
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
pll temp = solve(1,1);
cout<<(temp.first+temp.second)%MOD<<'\n';
} | 0 | 70,205,268 |
#include <stdio.h>
int main(){
int i,x;
for(i=1;i<=1000000;i++){
scanf("%d",&x);
if(x==0){
break;
}
printf("Case %d: %d\n",i,x);
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#define ALL(x) x.begin(),x.end()
#define SZ(x) x.size()
#define MNTO(a,b) a = min(a,(__typeof__(a))(b))
#define MXTO(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define debug(x) cerr<<#x<<" is "<<x<<endl
using namespace std;
const int maxn = 1e5+5;
const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;
void GG(){cout<<"Impossible\n"; exit(0);}
main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
int n; cin>>n;
vector<int> v (n), a(n);
REP(i,n) {
cin>>a[i]; v[a[i]]++;
}
sort(ALL(a));
int mx = a[a.size()-1], mn = a[0];
if (mn!=(mx+1)/2) GG();
if (v[mn]!=(mx%2+1)) GG();
FOR(i,mn+1, mx){
if (v[i]<2) GG();
}
cout<<"Possible"<<endl;
} | 0 | 47,579,562 |
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
const int MOD = 1000000007;
using namespace std;
int main(){
int N,A;
cin >> N >> A;
if((N % 500) >A){
cout << "No" << endl;
}else{
cout << "Yes" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int N = 1e3 + 5;
int n, x[N], y[N], cnt[2];
vector<int> d;
string ans[N];
bool in (int lim, int x, int y) { return x + y <= lim && x + y >= -lim && x - y >= -lim && x - y <= lim; }
signed main () {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> x[i] >> y[i], cnt[ ( (x[i] + y[i]) % 2 + 2) % 2 ] ++, ans[i] = "";
if (cnt[0] && cnt[1]) return cout << -1, 0;
for (int i = 30; i >= 0; --i) d.pb(1 << i);
for (int _ = 1; _ <= n; ++_) {
if (cnt[0]) x[_] --;
for (int i : d) {
if (in(i - 1, x[_] - i, y[_]) ) {
ans[_] += 'R';
x[_] = x[_] - i;
}
else if (in(i - 1, x[_] + i, y[_]) ) {
ans[_] += 'L';
x[_] = x[_] + i;
}
else if (in(i - 1, x[_], y[_] - i) ) {
ans[_] += 'U';
y[_] = y[_] - i;
}
else if (in(i - 1, x[_], y[_] + i) ) {
ans[_] += 'D';
y[_] = y[_] + i;
}
}
reverse(ans[_].begin(), ans[_].end() );
if (cnt[0]) ans[_] += 'R';
}
reverse(d.begin(), d.end() );
if (cnt[0]) d.pb(1);
cout << d.size() << '\n';
for (int _ : d) cout << _ << ' '; cout << '\n';
for (int _ = 1; _ <= n; ++_) cout << ans[_] << '\n';
return 0;
} | 0 | 24,042,184 |
#include<stdio.h>
void proc(int n,int x){
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
for(int k=j+1;k<=n;k++){
if(i+j+k==x)++cnt;
else if(i+j+k>x)break;
}
}
}
printf("%d\n",cnt);
}
int main(){
while(true){
int a,b;
scanf("%d%d",&a,&b);
if(!a&&!b)break;
proc(a,b);
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<string> sv;
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> p, m;
p.push_back(a.at(n-1));
m.push_back(a.at(0));
for(int i = 1; i < n-1; i++){
int b = a.at(i);
if(b < 0) m.push_back(b);
else p.push_back(b);
}
rep(i, n-1){
if(p.size() != 1){
sv.push_back(to_string(m.back()) + " " + to_string(p.back()));
m.back() -= p.back();
p.pop_back();
}else{
sv.push_back(to_string(p.back()) + " " + to_string(m.back()));
p.back() -= m.back();
m.pop_back();
}
}
cout << p.back() << endl;
for(auto itr = sv.begin(); itr != sv.end(); itr++){
cout << *itr << endl;
}
return 0;
} | 0 | 25,442,148 |
#include <stdio.h>
#include <string.h>
char s[100001];
int words[30]={};
int main(){
scanf("%s",s);
int len=strlen(s);
if (s[0]==s[1]) {
printf("1 2");
return 0;
}
words[s[0]-'a']++,words[s[1]-'a']++;
for (int i=2; i<len; i++) {
if ((++words[s[i]-'a'])>1) {
printf("%d %d\n",i-1,i+1);
return 0;
}
words[s[i-2]-'a']--;
}
printf("-1 -1");
} | #include <bits/stdc++.h>
using namespace std;
int last(int &a, int &b, int &c, int &d, int &e){
for (int i=1; i<=9; i++){
if (a%10==i){
return a%10;
}
if (b%10==i){
return b%10;
}
if (c%10==i){
return c%10;
}
if (d%10==i){
return d%10;
}
if (e%10==i){
return e%10;
}
}
return 10;
}
int up(int x){
for (int i=0; i<=130; i++){
if (i*10>=x){
return(i*10);
}
}
}
int main(){
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
int total=up(a)+up(b)+up(c)+up(d)+up(e)-(10-last(a,b,c,d,e));
cout<<total<<endl;
} | 0 | 71,814,933 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main()
{
int64 nn, mm, tmp1, tmp2;
cin >> nn >> mm;
bool memo1[nn], memo2[nn];
for(int64 ii = 0;ii < nn;ii++)
{
memo1[ii] = false;
memo2[ii] = false;
}
for(int64 ii = 0;ii < mm;ii++)
{
cin >> tmp1 >> tmp2;
tmp1--;
tmp2--;
if(tmp1 == 0)
{
memo1[tmp2] = true;
}
if(tmp2 == nn - 1)
{
memo2[tmp1] = true;
}
}
for(int64 ii = 1;ii < nn - 1;ii++)
{
if(memo1[ii] && memo2[ii])
{
puts("POSSIBLE");
return 0;
}
}
puts("IMPOSSIBLE");
return 0;
} | #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 _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int a, b;
int main(){
cin >> a >> b;
if(a < b){
rep(i, b){
cout << a;
}
cout << endl;
}
else{
rep(i, a){
cout << b;
}
cout << endl;
}
} | 0 | 91,977,626 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(int i = m; i < n; ++i)
#define rrep(i,n) for(int i = n; i >= 0; --i)
#define RREP(i, m, n) for(int i = n; i >= m; --i)
#define llrep(i, n) for(ll i = 0; i < n; ++i)
#define llREP(i, m, n) for(ll i = m; i < n; ++i)
#define llrrep(i,n) for(ll i = n; i >= 0; --i)
#define llRREP(i, m, n) for(ll i = n; i >= m; --i)
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
using pil = std::pair<int, long long>;
using pli = std::pair<long long, int>;
using plpii = std::pair<long long, std::pair<int, int>>;
using pdd = std::pair<double, double>;
using pis = std::pair<int, std::string>;
const long long INF = 1000000000000000001;
const long long _MOD = 1000000007;
const long long MOD = 998244353;
const int ALPHABET = 27;
const double pi = 3.14159265358979;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int r, s, p;
cin >> r >> s >> p;
string t;
cin >> t;
int ans = 0;
rep(i, n) {
if (i >= k) {
if (t[i - k] == t[i]) {
t[i] = '%';
continue;
}
}
if (t[i] == 'r') ans += p;
else if (t[i] == 's') ans += r;
else ans += s;
}
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int mod=10000,MAX=203,INF=1<<30;
using namespace std;
int main(){
ll K;
cin >> K;
ll A[K];
rep(i, K){
cin >> A[K-i-1];
}
ll l = 2;
ll r = 2;
rep(i, K){
if (A[i] > r) {
cout << -1 << endl;
return 0;
} else {
ll tmp = l / A[i];
if (tmp > 0 && l % A[i] == 0) {
l = l;
} else if (tmp > 0 && A[i] * (tmp + 1) <= r) {
l = A[i]*(tmp+1);
} else if (tmp > 0 && A[i] * (tmp + 1) > r){
cout << -1 << endl;
return 0;
} else {
l = A[i];
}
tmp = r / A[i];
r = A[i] * tmp + A[i] - 1;
}
}
cout << l << " " << r << endl;
} | 0 | 7,315,283 |
#include<iostream>
#include<cstdio>
using namespace std;
int n,s,count;
int solve(int i,int sum,int used){
if(i==10){
if(s==sum&&used==n){
count++;
}
return count;
}
solve(i+1,sum+i,used+1);
solve(i+1,sum,used);
return count;
}
int main(){
while(cin>>n>>s,n||s){
count=0;
cout<<solve(0,0,0)<<endl;
}
return 0;
} | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")
ll SUM(VI& V){
return accumulate(ALL(V), 0LL);
}
ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}
void print_vector(VI& V){
ll n = V.size();
rep(i, n){
if(i) cout << ' ';
cout << V[i];
}
cout << endl;
}
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;
}
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
void solve(){
ll a;
cin>>a;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
VI C(26);
ll N;cin>>N;
string s;cin>>s;
rep(i,N){
ll v = s[i]-'a';
C[v]++;
}
ll ans = 1;
rep(i,26){
ans *= (C[i]+1);
ans %= mod;
}
p(ans-1);
return 0;
} | 0 | 38,799,361 |
#include <iostream>
#include <vector>
#include <queue>
using std::vector;
using std::queue;
void minimum_paths(int n_v, vector<int> graph[], int paths[]) {
queue<int> visits;
int found[n_v];
std::fill_n(found, n_v, 0);
found[0] = 1;
visits.push(0);
while(! visits.empty()) {
int id = visits.front();
visits.pop();
vector<int> adjs = graph[id];
for (int i = 0; i < adjs.size(); i++) {
int adj = adjs[i];
if (! found[adj]) {
found[adj] = 1;
paths[adj] = paths[id] + 1;
visits.push(adj);
}
}
}
for (int i = 1; i < n_v; i++) {
if (paths[i] == 0) {
paths[i] = -1;
}
}
}
int main() {
std::ios::sync_with_stdio(false);
int n_v;
std::cin >> n_v;
int id, adj, n_adjs;
vector<int> *graph = new vector<int>[n_v];
for (int i = 0; i < n_v; i++) {
std::cin >> id >> n_adjs;
for (int j = 0; j < n_adjs; j++) {
std::cin >> adj;
graph[id - 1].push_back(adj - 1);
}
}
int paths[n_v];
std::fill_n(paths, n_v, 0);
minimum_paths(n_v, graph, paths);
for (int i = 0; i < n_v; i++) {
std::cout << i + 1 << " " << paths[i] << "\n";
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec) \
std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec) \
std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d) \
vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec) \
do { \
sort(ALL((vec))); \
(vec).erase(std::unique(ALL((vec))), (vec).end()); \
} while (0)
ll POW(ll n, ll m) {
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
ll tmp = POW(n, m / 2);
return (tmp * tmp);
} else {
return (n * POW(n, m - 1));
}
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
vl A(N, 0), B(N, 0);
REP(i, N) cin >> A[i];
REP(i, N) cin >> B[i];
vl CA(N, 0), CB(N, 0);
vl DA(N, 0), DB(N, 0);
REP(i, N) {
if (i == 0)
CA[i] = A[i];
else if (A[i - 1] != A[i]) {
CA[i] = A[i];
} else
DA[i] = A[i];
}
RREP(i, N) {
if (i == N - 1)
CB[i] = B[i];
else if (B[i + 1] != B[i]) {
CB[i] = B[i];
} else
DB[i] = B[i];
}
bool ok = true;
REP(i, N) {
if (CA[i] != 0 && CB[i] != 0 && CA[i] != CB[i])
ok = false;
else if (CA[i] == 0 && DA[i] < CB[i])
ok = false;
else if (CB[i] == 0 && DB[i] < CA[i])
ok = false;
}
if (!ok)
cout << 0 << endl;
else {
ll ans = 1;
REP(i, N) {
if (CA[i] == 0 && CB[i] == 0)
ans *= min(DA[i], DB[i]);
ans %= MOD;
}
cout << ans << endl;
}
return 0;
} | 0 | 79,453,685 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
sort(ALL(a));
int ans = 0;
ans = *(a.end()-1)-*a.begin();
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
int main(){
string s;
cin>>s;
int n = s.size();
if(n<4){
cout<<"No"<<endl;
return 0;
}
string t = "";
REP(i,4){
t += s[i];
}
if(t == "YAKI"){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | 0 | 21,550,057 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
int ans = 0;
for(int i = 1; i < n; i++){
int j = n - i;
if(i >= j) break;
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
ll n; cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
vector<ll>cnt(1e6+10,0);
for(auto x:a){
if(cnt[x]!=0){
cnt[x]=2;
continue;
}
for(ll i=x;i<1e6+10;i+=x){
cnt[i]++;
}
}
ll ans=0;
for(auto x:a){
if(cnt[x]==1){
ans++;
}
}
cout<<ans<<endl;
} | 0 | 49,914,455 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long h, w;
cin >> h >> w;
long long result;
if (h == 1 || w == 1) {
result = 1;
} else if (h % 2 == 1 && w % 2 == 1) {
result = h * w / 2 + 1;
} else {
result = h * w / 2;
}
cout << result << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
using namespace std;
int main(void)
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
double y = sqrt(x);
printf("%.4f\n", y);
return 0;
} | 0 | 94,478,662 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int n;
cin >> n;
int p[n + 1];
rep (i, 1, n + 1) cin >> p[i - 1] >> p[i];
int dp[n + 1][n + 1];
rep (i, 0, n + 1) dp[i][i] = 0;
rep (i, 2, n + 1) {
rep (j, 1, n - i + 2) {
int k = i + j - 1;
dp[j][k] = inf;
rep (l, j, k) {
dp[j][k] = min (dp[j][k], dp[j][l] + dp[l + 1][k] +
p[j - 1] * p[l] * p[k]);
}
}
}
cout << dp[1][n] << "\n";
} | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector a(n,0LL);
for (int i=0; i<n; i++) cin >> a[i];
vector bits(2, vector(60,0LL));
for (int i=0; i<n; i++) {
for (int j=0; j<60; j++) {
bits[(a[i]>>j)&1][j]++;
bits[(a[i]>>j)&1][j] %= MOD;
}
}
long long ans = 0;
long long d = 1;
for (int i=0; i<60; i++) {
ans += (((bits[0][i] * bits[1][i]) % MOD) * d) % MOD;
d *= 2;
d %= MOD;
ans %= MOD;
}
cout << ans << endl;
} | 0 | 18,913,147 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
const int MOD = 1000000007;
int h,w;
char c[101][101];
int d[101][101] = {};
int dh[2] = {0,1};
int dw[2] = {1,0};
bool isin(int i,int j){
return (0 <= i && i < h && 0 <= j && j < w);
}
int bfs(){
rep(i,h)rep(j,w)d[i][j] = INF;
d[0][0] = 1;
if(c[0][0] == '.')d[0][0] = 0;
queue<pii> q;
q.push(MP(0,0));
while(q.size()){
pii p = q.front();
q.pop();
rep(i,2){
int nh = p.fi + dh[i];
int nw = p.se + dw[i];
int next_dist;
if(c[p.fi][p.se] == '.' && c[nh][nw] == '#')next_dist = d[p.fi][p.se]+1;
else next_dist = d[p.fi][p.se];
if(isin(nh,nw) && d[nh][nw] > next_dist){
q.push(MP(nh,nw));
d[nh][nw] = next_dist;
}
}
}
return d[h-1][w-1];
}
signed main(){
cin >> h >> w;
rep(i,h)rep(j,w)cin >> c[i][j];
cout << bfs() << endl;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
string t0, t1;
for(long long i = 0; i < s.size(); i++){
if(i % 2 == 0){
t0.push_back('0');
t1.push_back('1');
}
else{
t0.push_back('1');
t1.push_back('0');
}
}
long long count1 = 0, count0 = 0;
for(long long i = 0; i < s.size(); i++){
if(t0[i] != s[i]){
count0++;
}
if(t1[i] != s[i]){
count1++;
}
}
cout << min(count0, count1) << endl;
return 0;
} | 0 | 15,753,688 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for(int i=0; i<5; i++) cin >> a[i];
sort(a, a+5, greater<int>() );
for(int i=0; i<4; i++) printf("%d ",a[i]);
printf("%d\n",a[4]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return result;
}
int gcd(int a,int b)
{
if(b==0)
{
return a;
}
return gcd(b,a%b);
}
void sieve()
{
memset(isPrime,1,sizeof(isPrime));
isPrime[0] = isPrime[1] = 0;
for(int i=2;i*i<=1000000;i++)
{
if(isPrime[i])
{
for(int j=i*i;j<=1000000;j+=i)
{
isPrime[j] = 0;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
int t,n;
t = 1;
for(int i=0;i<t;i++)
{
int x,y;
cin>>x>>y;
bool c = 0;
for(int i=0;i<=100;i++)
{
for(int j=0;j<=100;j++)
{
if(i*2+j*4==y && i+j==x)
{
c = 1;
break;
}
}
if(c)
{
break;
}
}
if(c)
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
}
return 0;
} | 0 | 64,783,730 |
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,Q;
cin >> n >> Q;
atcoder::dsu d(n);
while(Q--){
int T;cin >> T;
int u,v;cin >> u >> v;
if(!T){
d.merge(u,v);
}else{
cout << d.same(u,v) << "\n";
}
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(i,n) for(int i=0; i<(n); i++)
#define REPinit(a,n) for(int i=a; i<n; i++)
#define REPinitj(a,n) for(int j=a; j<n; j++)
#define CLR(a) memset((a), 0 ,sizeof(a))
template <typename T>
void swapAlgorithm(T& a, T& b) {
T tmp = a;
a = b;
b = tmp;
}
LL euclideanAlgorithm(LL a, LL b) {
LL a_tmp = a;
LL b_tmp = b;
if (a_tmp > b_tmp) {
swapAlgorithm<LL>(a_tmp, b_tmp);
}
LL r = a_tmp % b_tmp;
while (r != 0) {
a_tmp = b_tmp;
b_tmp = r;
r = a_tmp % b_tmp;
}
return b_tmp;
}
LL getLCM(LL a, LL b) {
return (a * b)/(euclideanAlgorithm(a, b));
}
double eauclidDistance(pair<double, double>& x1, pair<double, double>& x2) {
return sqrt((x1.first - x2.first) * (x1.first - x2.first) + (x1.second - x2.second) * (x1.second - x2.second));
}
void swap(int& a, int& b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}
int main(int argc, char const *argv[])
{
int N;
cin >> N;
cout << (N/3) << endl;
return 0;
} | 0 | 1,179,623 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, A = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
if (A * 2 < A + K) A *= 2;
else {
for (; i < N; i++) A += K;
break;
}
}
cout << A << 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, M; cin >> N >> M;
vector<int> a(N), b(N); REP(i, N) cin >> a[i] >> b[i];
vector<int> res(N + 1, 0);
REP(i, N) {
res[a[i]]++; res[b[i]]--;
}
REP(i, N) {
res[i + 1] += res[i];
}
string ans = "YES";
REP(i, N + 1) {
if(res[i] % 2 == 1) ans = "NO";
}
cout << ans << endl;
} | 0 | 43,059,055 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<(n);++i)
#define repA(i,j,n) for(i=(j);i<=(n);++i)
#define repD(i,j,n) for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define endl "\n"
typedef long long int lli;
typedef long double mytype;
typedef pair<lli,lli> ii;
typedef vector<ii> vii;
typedef vector<lli> vi;
const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403()
{
#ifdef ARYANC403
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
cerr<<"Time Taken : "<<diff.count()<<"\n";
#endif
}
#ifdef ARYANC403
#include "/home/aryan/codes/PastCodes/header.h"
#else
#define dbg(args...)
#endif
const lli INF = 0xFFFFFFFFFFFFFFFL;
lli seed;
mt19937 rng(seed=chrono::steady_clock::now().time_since_epoch().count());
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}
class CMP
{public:
bool operator()(ii a , ii b)
{ return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y )); }};
void add( map<lli,lli> &m, lli x,lli cnt=1)
{
auto jt=m.find(x);
if(jt==m.end()) m.insert({x,cnt});
else jt->Y+=cnt;
}
void del( map<lli,lli> &m, lli x,lli cnt=1)
{
auto jt=m.find(x);
if(jt->Y<=cnt) m.erase(jt);
else jt->Y-=cnt;
}
bool cmp(const ii &a,const ii &b)
{
return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}
const lli mod = 1000000007L;
lli T,n,i,j,k,in,cnt,l,r,u,v,x,y;
lli m;
string s;
vi a;
const lli N=8005;
bool chk(lli c,vi a)
{
if(abs(c)>N)
return false;
bitset<2*N+5> bt;
bt[N]=1;
for(auto x:a)
bt=(bt<<x)|(bt>>x);
dbg(a,c)
return bt[c+N];
}
int main(void) {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
{
cin>>s;
cin>>x>>y;
n=sz(s);
fo(i,n)
{
if(s[i]=='T')
{
s=s.substr(i);
break;
}
x--;
}
if(i==n)
{
if(x==0&&y==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
vi a[2];
j=0;
cnt=0;
for(auto x:s)
{
if(x=='T')
{
a[j].pb(cnt);
j^=1;
cnt=0;
}
else
cnt++;
}
a[j].pb(cnt);
cout<<(chk(x,a[0])&&chk(y,a[1])?"Yes":"No")<<endl;
} aryanc403();
return 0;
} | #include<stdio.h>
#include<stdlib.h>
int main()
{
int a,b,c,d,m,n,x=0,y;
scanf("%d%d%d%d",&a,&b,&c,&d);
m=abs(a-b);
n=abs(b-c);
y=abs(a-c);
if((m<=d && n<=d == 1)||y <= d)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | 0 | 2,634,916 |
#include<bits/stdc++.h>
using namespace std;
long long int a[200005],sum[200005];
int main()
{
map<long long int ,long long int >mp;
int n,k;
long long int ans=0;
cin>>n>>k;
sum[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
for(int i=0;i<=n;i++)
{
if(i>=k) {
mp[(sum[i-k]-(i-k))%k]--;
}
if(mp.count((sum[i]-i)%k))
{
ans+=mp[(sum[i]-i)%k];
}
mp[(sum[i]-i)%k]++;
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
char tbl[100][100];
int main(){
long a,b;
cin >> a >> b;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
tbl[i][j] = '.';
tbl[50+i][j] = '#';
}
}
int count=1;
for(int i=0; i<50; i+=2){
if(count>=b) break;
for(int j=0; j<100; j+=2){
if( count>=b) break;
tbl[i][j]='#';
count++;
}
}
count=1;
for(int i=51; i<100; i+=2){
if(count>=a) break;
for(int j=0; j<100; j+=2){
if( count>=a) break;
tbl[i][j]='.';
count++;
}
}
cout << 100 << " " << 100 << endl;
for(int i=0; i<100; i++){
for(int j=0; j<100; j++){
cout << tbl[i][j];
}
cout << endl;
}
return 0;
} | 0 | 25,309,765 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define POF pop_front
#define POB pop_back
#define MA make_pair
#define ll long long
#define VE vector<int>
#define VP vector<pair<int,int> >
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
using namespace std;
const int INF=1e9+7;
const int mod=1e9+7;
int main(){
int N;
int A[1000];
while(1){
cin>>N;
if(N==0){
break;
}
FOR(i,0,N){
cin>>A[i];
}
sort(A,A+N);
int mi=INF;
FOR(i,1,N){
mi=min(mi,abs(A[i]-A[i-1]));
}
cout<<mi<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }
ll w, h;
struct pqdata {
ll cost; char x;
bool operator<(const pqdata &r) const { return cost < r.cost; }
};
int main() {
cin >> w >> h;
vector<pqdata> pqvec;
for(int i = 0; i < w; ++i) {
pqdata indata;
cin >> indata.cost;
indata.x = 'p';
pqvec.emplace_back(indata);
}
for(int i = 0; i < h; ++i) {
pqdata indata;
cin >> indata.cost;
indata.x = 'q';
pqvec.emplace_back(indata);
}
sort(pqvec.begin(), pqvec.end());
int pqlen = pqvec.size();
int pnow = h+1; int qnow = w+1;
ll ans = 0;
for(int i = 0; i < pqlen; ++i) {
if(pqvec.at(i).x == 'p') {
ans += pqvec.at(i).cost*pnow;
qnow--;
}else {
ans += pqvec.at(i).cost*qnow;
pnow--;
}
}
cout << ans << endl;
} | 0 | 53,735,724 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll LCD(ll a,ll b){
if(a<b) swap(a,b);
while(b){
ll t = a%b;
a = b;
b = t;
}
return a;
}
int main(){
int n;
cin>>n;
vector<ll>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
ll lcm = 1;
for(int i=0; i<n; i++){
ll lcd = LCD(arr[i],lcm);
lcm = lcm*(arr[i]/lcd);
}
cout<<lcm;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<vector<pair<int, int>>> edge(N + 1,
vector<pair<int, int>>());
int a, b, c;
for (int i = 0; i < N - 1; i++) {
scanf("%d %d %d", &a, &b, &c);
edge[a].insert(edge[a].end(), make_pair(b, c));
edge[b].insert(edge[b].end(), make_pair(a, c));
}
int Q, K;
scanf("%d %d", &Q, &K);
vector<pair<int, long long>> d_k(N + 1, make_pair(-1, -1));
stack<int> st;
st.push(K);
d_k[K].first = -1;
d_k[K].second = 0;
while (st.size() > 0) {
int n = st.top();
st.pop();
for (auto a : edge[n]) {
if (a.first != d_k[n].first) {
d_k[a.first].second = d_k[n].second + a.second;
d_k[a.first].first = n;
st.push(a.first);
}
}
}
for (int i = 0; i < Q; i++) {
int x, y;
scanf("%d %d", &x, &y);
cout << d_k[x].second + d_k[y].second << "\n";
}
return 0;
} | 0 | 52,828,347 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
signed main(){
int a,b,c,d,e;
while( scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e) != EOF ){
vector<int> data{a,b,c,d,e};
sort(data.begin(), data.end());
printf("%lld %lld %lld %lld %lld\n", data[4], data[3], data[2], data[1], data[0]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long H, long long W, std::vector<std::string> s) {
vector<pair<ll, ll>> dir{pair<ll, ll>(-1, 0), pair<ll, ll>(1, 0), pair<ll, ll>(0, -1), pair<ll, ll>(0, 1)};
rep(i, H) {
rep(j, W) {
if (s[i][j] == '#') {
bool ok = false;
rep(k, 4) {
ll tmpi = i + dir[k].first;
ll tmpj = j + dir[k].second;
if (!(tmpi < 0 || tmpi > H - 1 || tmpj < 0 || tmpj > W - 1)) {
if (s[tmpi][tmpj] == '#') {
ok = true;
}
}
}
if (!ok) {
cout << "No" << endl;
return;
}
}
}
}
cout << "Yes" << endl;
return;
}
int main() {
long long H;
scanf("%lld", &H);
long long W;
scanf("%lld", &W);
std::vector<std::string> s(H);
for (int i = 0; i < H; i++) {
std::cin >> s[i];
}
solve(H, W, std::move(s));
return 0;
} | 0 | 34,165,757 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
ll n;
scanf("%lld",&n);
ll mini=1000000000000000000;
for (ll i=1;i*i<=n;i++)
{
if (n%i==0)
{
ll val1=i;
ll val2=(n/i);
mini=min(mini,(val1+val2-2));
}
}
printf("%lld\n",mini);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define PI 3.1415926535897932385
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main()
{
lol n; cin >> n;
map<lol, lol> a;
bool TF = false;
REP(i, n)
{
lol an;
cin >> an;
a[an]++;
if(a[an] > 1) TF = true;
}
if(TF) cout << "NO" << endl;
else cout << "YES" << endl;
return 0;
} | 0 | 34,283,359 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,h,g,br=0;
cin >> h >> n;
for (int i=0;i<n;i++)
{
cin >> g;
br+=g;
}
if(br>=h)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N;
cin >> N;
vector<string> S(N," ");
ll S_alpha[N][26];
memset(S_alpha,0,sizeof(S_alpha));
for(int i = 0; i < N; i++){
cin >> S[i];
for(int j = 0; j < 26; j++){
for(int k = 0; k < S[i].size(); k++){
if(S[i][k] - 'a' == j){
S_alpha[i][j]++;
}
}
}
}
ll ans_alpha[26];
memset(ans_alpha,0,sizeof(ans_alpha));
for(int i = 0; i < 26; i++){
ll tmp = 100;
for(int j = 0; j < N; j++){
tmp = min(S_alpha[j][i], tmp);
}
ans_alpha[i] += tmp;
}
string ans = "";
for(int i = 0; i < 26; i++){
for(int j = 0; j < ans_alpha[i]; j++){
ans += char('a' + i);
}
}
cout << ans << endl;
} | 0 | 44,684,271 |
#include<stdio.h>
int main(){
char S1;
char S2;
char S3;
scanf("%c %c %c",&S1,&S2,&S3);
if(S1==S2,S1!=S3,S2!=S3){
puts("Yes");
}
else if(S1==S3,S1!=S2,S3!=S2){
puts("Yes");
}
else if(S2==S3,S1!=S2,S1!=S3){
puts("Yes");
}
else {
puts("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
ll a,b;
cin>>a>>b;
ll cnt[42];
rep(i,0,42){
cnt[i]=0;
}
if(a%4==2||a%4==3){
if(b%4==0||b%4==3)cnt[0]++;
}
else if(a%4==0||a%4==1){
if(b%4==1||b%4==2)cnt[0]++;
}
rep(i,1,42){
if((a/(ll(pow(2,i))))%2){
cnt[i]+=a% ll(pow(2,i));
cnt[i]%=2;
}
}
rep(i,1,42){
if((b/(ll(pow(2,i))))%2){
cnt[i]+=b% ll(pow(2,i)) +1;
cnt[i]%=2;
if(i==0)cout<<cnt[i]<<endl;
}
}
ll ans=0;
rep(i,0,42){
if(cnt[i])ans+=pow(2,i);
}
cout<<ans<<endl;
} | 0 | 56,481,796 |
#include <bits/stdc++.h>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std::vector<int>
#define pi std::pair<int, int>
#define mp std::make_pair
#define stdabs std::abs
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
#define vec std::vector
#define oreq |=
#define npm next_permutation
#define Yes std::cout << "Yes" << std::endl
#define No std::cout << "No" << std::endl
#define YES std::cout << "YES" << std::endl
#define NO std::cout << "NO" << std::endl
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline bool chmax(T& a, T b)
{
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T& a, T b)
{
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
ll extgcd(ll a, ll b, ll& x, ll& y);
ll nCr(ll n, ll r);
void stat();
template <typename T> T fact(T num);
unsigned long long modpow(int x__, int n__, long long mod__);
template <typename T> void debug(const T& t);
constexpr ll mod10_9p7 = 1000000000 + 7;
int n;
vi h;
int dp[100000 + 10];
int main()
{
stat();
cin >> n;
int a;
rep(i, n)
{
cin >> a;
h.push_back(a);
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 1; i != n; ++i) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (1 < i) { chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2])); }
}
cout << dp[n - 1] << endl;
return 0;
}
ll extgcd(ll a, ll b, ll& x, ll& y)
{
if (b == 0) {
x = 1, y = 0;
return a;
}
ll d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
std::vector<unsigned ll> genprimevec(const unsigned ll N)
{
std::vector<bool> is_prime(N + 1);
for (unsigned ll i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<unsigned ll> P;
for (unsigned ll i = 2; i <= N; i++) {
if (is_prime[i]) {
for (unsigned ll j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
void stat(){
#ifdef local
rep(i, 2){std::cout << "local enable" << std::endl;
}
#endif
#ifdef hacks
rep(i, 2) { std::cout << "boost enable" << std::endl; }
#endif
}
ll nCr(ll n, ll r)
{
ll num = 1;
for (ll i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
template <typename T> T fact(T num)
{
if (num == 1) { return 1; }
return num * fact(num - 1);
}
unsigned long long modpow(int x__, int n__, long long mod__)
{
long long ret__ = 1;
for (long long i__ = 0; i__ < n__; ++i__) {
ret__ = ret__ * x__ % mod__;
}
return ret__;
}
template <typename T> void debug(const T& t)
{
#ifdef local
dbg(t);
#endif
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int>V(n);
for(int i=0;i<n;i++)cin>>V[i];
sort(V.begin(),V.end());
int sum=0;
for(int i=1;i<n-1;i++)sum+=V[i];
sum/=(n-2);
cout<<sum<<endl;
}
} | 0 | 84,635,541 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x%y);
}
ll LCM(int a, int b){
return a*b/gcd(a,b);
}
int main(void)
{
int n;
cin>>n;
map<ll,int,greater<int>> a;
rep(i,0,n){
int in;
cin>>in;
a[in]++;
}
vector<ll> num;
ll ans=0;
for(auto i:a){
if(i.second>=4){
ans=max(ans,i.first*i.first);
}
if(i.second>=2){
num.push_back(i.first);
}
if(num.size()==2){
ans=max(ans,num[0]*num[1]);
}
}
cout<<ans<<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;
ll k;
cin >> s >> k;
ll count=0;
char ans=0;
for(int i=0;i<s.size();i++){
if(s[i]=='1'){
count++;
if(count==k){
ans='1';
break;
}
}else{
ans=s[i];
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 84,925,001 |
#include <bits/stdc++.h>
using namespace std;
void swap(string& card1, string& card2) {
string tmp = card1;
card1 = card2;
card2 = tmp;
}
int peek_number(string card) {
return atoi(&card[1]);
}
vector<string> bubble_sort(vector<string> cards) {
for (int i = 0; i < cards.size(); i++) {
for (int j = cards.size() - 1; j > i; j--) {
if (peek_number(cards[j]) < peek_number(cards[j - 1])) swap(cards[j], cards[j - 1]);
}
}
return cards;
}
vector<string> selection_sort(vector<string> cards) {
for (int i = 0; i < cards.size(); i++) {
int minj = i;
for (int j = i; j < cards.size(); j++) {
if (peek_number(cards[j]) < peek_number(cards[minj])) minj = j;
}
swap(cards[i], cards[minj]);
}
return cards;
}
bool is_stable(vector<string> stable, vector<string> target) {
for (int i = 0; i < stable.size(); i++) {
if (stable[i] != target[i]) return false;
}
return true;
}
void print_cards(vector<string> cards) {
bool first = true;
for (int i = 0; i < cards.size(); i++) {
if (!first) cout << " ";
cout << cards[i];
first = false;
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<string> unsorted(n);
for (int i = 0; i < n; i++) cin >> unsorted[i];
vector<string> bubble_sorted = bubble_sort(unsorted);
vector<string> selection_sorted = selection_sort(unsorted);
print_cards(bubble_sorted);
cout << "Stable" << endl;
print_cards(selection_sorted);
cout << (is_stable(bubble_sorted, selection_sorted) ? "Stable" : "Not stable") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int maxn=112345;
int h,w,n,a[maxn],b[maxn];
long long num[10];
map<pii,int> mp;
int main()
{
scanf("%d%d%d",&h,&w,&n);
for (int i=1;i<=n;++i)
scanf("%d%d",&a[i],&b[i]);
for (int i=1;i<=n;++i) {
int x=a[i],y=b[i];
for (int j=x-1;j<=x+1;++j)
for (int k=y-1;k<=y+1;++k) {
if (j<=1||j>=h||k<=1||k>=w) continue;
int id=mp[pii(j,k)]++;
--num[id],++num[id+1];
}
}
int sum=0;
for (int i=0;i<10;++i) sum+=num[i];
num[0]+=1ll*(h-2)*(w-2)-sum;
for (int i=0;i<10;++i) cout<<num[i]<<endl;
return 0;
} | 0 | 82,018,777 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
if(s[0]=='R')
{
if(s[1]=='R')
{
if(s[2]=='R')
{
cout << "3\n";
}
else cout << "2\n";
}
else cout << "1\n";
}
else if(s[1]=='R')
{
if(s[2]=='R')
cout << "2\n";
else cout << "1\n";
}
else if(s[2]=='R')
{
cout << "1\n";
}
else cout << "0\n";
} | #include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main()
{
unordered_map<char, bool> m;
string l = "qwertasdfgzxcvb";
string r = "yuiophjklnm";
for (auto&& i : l) {
m[i] = false;
}
for (auto&& i : r) {
m[i] = true;
}
while (true) {
string s;
cin >> s;
if (s == "#") {
return 0;
}
bool state = m[s[0]];
int count = 0;
for (int i = 1; i < s.size(); ++i) {
bool newState = m[s[i]];
if (state != newState) {
state = newState;
count += 1;
}
}
cout << count << endl;
}
} | 0 | 67,977,255 |
#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 rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespace std;
int main(void){
ll n,m;cin>>n>>m;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> b(n);
b[0]=a[0];
rep(i,n-1) b[i+1]=b[i]+a[i+1];
map<ll,ll> mp;
rep(i,n) mp[b[i]%m]++;
ll res=0;
for(auto&p:mp){
if(p.first==0)res+=p.second;
res+=(p.second)*(p.second-1)/2;
}
cout<<res<<endl;
} | #include <cstdio>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
const int max_n = 10, INF = 100000000;
struct edge{ int to, cost; };
typedef pair<int, int> P;
int n;
vector<edge> g[max_n];
int d[max_n];
bool exi[max_n];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
fill(d, d + max_n, INF);
d[s] = 0;
que.push(P(0, s));
while(!que.empty()){
P p = que.top(); que.pop();
int v = p.second;
if(d[v] < p.first) continue;
for(int i = 0; i < g[v].size(); i++){
edge e = g[v][i];
if(d[e.to] > p.first + e.cost){
d[e.to] = p.first + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main(){
int res, ans, pos;
while(true){
scanf("%d", &n);
if(n == 0) return 0;
fill(exi, exi + max_n, false);
for(int i = 0; i < max_n; i++){
g[i].clear();
}
for(int i = 0; i < n; i++){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
edge p1, p2;
p1.to = b; p1.cost = c;
p2.to = a; p2.cost = c;
g[a].push_back(p1);
g[b].push_back(p2);
exi[a] = true; exi[b] = true;
}
ans = INF;
pos = 0;
for(int i = 0; i < 10; i++){
if(!exi[i]) continue;
res = 0;
dijkstra(i);
for(int j = 0; j < 10; j++){
if(d[j] != INF){
res += d[j];
}
}
if(ans > res){
pos = i;
ans = res;
}
}
printf("%d %d\n", pos, ans);
}
} | 0 | 94,744,552 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
void chmax(Int& a, Int b) { if (a < b) { a = b; } }
int main() {
int N;
cin >> N;
vector<Int> a(N + 1);
for (int i = 1; i <= N; ++i) { cin >> a[i]; }
vector<Int> dp(N + 1, 0);
dp[0] = 1000;
for (int i = 1; i <= N; ++i) {
chmax(dp[i], dp[i - 1]);
for (int j = 1; j < i; ++j) {
Int val = dp[j] / a[j] * a[i] + dp[j] % a[j];
chmax(dp[i], val);
}
}
cout << dp[N] << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int top;
int a, b, c;
int N;
cin >> N;
for (int i = 0; i < N; i++){
cin >> a >> b >> c;
if (a > b)
top = a;
else top = b;
if (c > top)
top = c;
if (top == a){
if ((a * a) == ((b * b) + (c * c)))
cout << "YES" << endl;
else cout << "NO" << endl;
}
else if (top == b){
if ((b * b) == ((a * a) + (c * c)))
cout << "YES" << endl;
else cout << "NO" << endl;
}
else {
if ((c * c) == ((b * b) + (a * a)))
cout << "YES" << endl;
else cout << "NO" << endl;
}
}
return 0;
} | 0 | 96,330,985 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const int INF = INT_MAX;
int main(){
ll n,m; cin>>n>>m;
ll x=min(n,m/2);
ll ans=x;
m-=x*2;
ans+=m/4;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1.0)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll a = (n-1)*(n-2)/2;
if(a < k)cout << -1 << endl;
else{
cout << n-1+a-k << endl;
REP(i, n-1){
cout << 1 << " " << i+1 << endl;
}
ll cnt = 3, now = 2;
rep(i, a-k){
if(cnt > n){now++; cnt = now+1;}
cout << now << " " << cnt << endl;
cnt++;
}
}
} | 0 | 47,152,936 |
#include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-9;
const ld PI = 3.141592653589793;
const int maxn = 300001;
const ll MOD = 1e9 + 7;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
}
ll pw(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
}
return res;
}
template<typename Cont>
vector<vector<int>> accum2d(Cont a, int n, int m) {
vector<vector<int>> res(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
res[i][j] = a[i][j];
if (i > 0) {
res[i][j] += res[i - 1][j];
}
if (j > 0) {
res[i][j] += res[i][j - 1];
}
if (i > 0 && j > 0) {
res[i][j] -= res[i - 1][j - 1];
}
}
}
return res;
}
vector<vector<int>> resize2d(vector<vector<int>> a, int n, int m) {
a.resize(n);
for (auto &x:a) {
x.resize(m);
}
return a;
}
int up[1030][1030];
int down[1030][1030];
int lft[1030][1030];
int rght[1030][1030];
int ans[1030][1030];
int pref[1030][1030];
int arifm[1030][1030];
int dp1[1030][1030];
int dp2[1030][1030];
signed main() {
#ifdef zxc
struct rlimit rl;
const rlim_t kStackSize = 512L * 1024L * 1024L;
assert(!getrlimit(RLIMIT_STACK, &rl));
rl.rlim_cur = kStackSize;
assert(!setrlimit(RLIMIT_STACK, &rl));
freopen("../kolya_input.txt", "r", stdin);
#else
#endif
auto solve = [](int _) {
int n;
cin >> n;
ll k;
cin >> k;
vector<int> a(n);
for (int &el:a) {
cin >> el;
}
ll ans = 0;
for (int i = 0; i < n; ++i) {
int pref = 0;
int val = 0;
for (int j = 0; j < n; ++j) {
if (a[i] < a[j]) {
++val;
if (j < i) {
++pref;
}
}
}
ans += 1ll * k * (k - 1) / 2 % MOD * val % MOD + pref * k;
ans %= MOD;
}
cout<<ans;
};
fast_io();
cout.precision(9);
cout << fixed;
auto start = chrono::steady_clock::now();
for (int i = 1; i <= 1; ++i)solve(i);
auto end = chrono::steady_clock::now();
debug("time", chrono::duration_cast<chrono::milliseconds>(end - start).count() / 1000.0);
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
struct pnt{
int cost, y, x;
};
vector<vector<int>> mv={{1,0},{-1,0},{0,1},{0,-1}};
int dist[1002][1002];
int bfs(queue<pnt> &que, vector<vector<char>> &mat){
for(int i=0; i<1002; i++){
for(int j=0; j<1002; j++){
dist[i][j]=-1;
}
}
while((int)que.size()>0){
pnt p=que.front();
que.pop();
if(dist[p.y][p.x]>=0){
continue;
}
dist[p.y][p.x]=p.cost;
for(auto &m:mv){
if(mat[p.y+m[0]][p.x+m[1]]=='.'){
que.push({p.cost+1,p.y+m[0],p.x+m[1]});
}
}
}
int ans=0;
for(int i=0; i<1002; i++){
for(int j=0; j<1002; j++){
ans=max(ans,dist[i][j]);
}
}
return ans;
}
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> mat(H+2,vector<char>(W+2,'@'));
queue<pnt> que;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
cin >> mat[i][j];
if(mat[i][j]=='#'){
que.push({0,i,j});
}
}
}
cout << bfs(que, mat) << endl;
} | 0 | 64,248,504 |
#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 = (int)(n)-1; i>=0; --i)
#define For(i,a,b) for(auto i=(a);i<=(b);++i)
#define rFor(i,a,b) for(auto i=(b);i>=(a);--i)
#define call(var) cerr<<#var<<"="<<var<<"\n";
#define dup(x,y) (((x)+(y)-1)/(y))
#define all(x) (x).begin(),(x).end()
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
const double pi = acos(-1);
template<class t,class u> inline bool chmax(t&a,u b){if(a<b){a=b;return true;}return false;}
template<class t,class u> inline bool chmin(t&a,u b){if(b<a){a=b;return true;}return false;}
template<class T> istream& operator>>(istream& is, vector<T>& a){rep(i,a.size()) is >> a[i]; return is;}
template<class T> ostream& operator<<(ostream& os, vector<T>& a){rep(i,a.size()) os << a[i] << " "; return os;}
template<class T, class U> istream& operator>>(istream& is, pair<T,U>& p){is >> p.first >> p.second; return is;}
template<class T, class U> ostream& operator<<(ostream& os, const pair<T,U>& p){os << "("<< p.first << "," << p.second << ")"; return os;}
template<class T, class U> ostream& operator<<(ostream& os, const map<T,U>& mp){for(auto& t : mp) os << t.first << " " << t.second << "\n"; return os;}
int main(){
map<char,int> s;
rep(i,4){
char c;cin >> c;
s[c]++;
}
if(s.size() == 2 && s.begin()->second == 2 && next(s.begin())->second == 2) cout << "Yes\n";
else cout << "No\n";
} | #include<iostream>
#include<cstdio>
#include<map>
using namespace std;
char str[1000000];
typedef pair<char,char>P;
int main(){
int n,k;
P sezi[100];
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>sezi[i].first>>sezi[i].second;
}
cin>>k;
for(int i=0;i<k;i++){
cin>>str[i];
}
int flg = 0;
for(int i=0;i<k;i++){
for(int j=0;n>j;j++){
if(str[i]==sezi[j].first){
printf("%c",sezi[j].second);
flg++;
break;
}
}
if(flg==0){
cout<<str[i];
}
flg=0;
}
cout<<endl;
}
return 0;
} | 0 | 20,600,904 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m, ans;
ans = 0;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++){
cin >> h[i];
}
int a, b;
vector<int>g(n,1);
for (int i = 0; i < m; i++){
cin >> a >> b;
if (h[a - 1] <= h[b - 1]) {
g[a - 1] = 0;
}
if (h[a - 1] >= h[b - 1]) {
g[b - 1] = 0;
}
}
for (int i = 0; i < n; i++) {
ans += g[i];
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
#define inf ll(1e9)
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,m;
cin>>n>>m;
map<int,int>rel;
for(int i=0; i<m; i++){
int num;
cin>>num;
rel[num]=1;
}
vector<ll>dp(n+1);
dp[0]=1;
for(int i=1; i<=n; i++){
if(rel.count(i))
dp[i]=0;
else{
dp[i]=dp[i-1];
if(i>=2)
dp[i]=(dp[i]+dp[i-2])%mod;
}
}
cout<<dp[n];
return 0;
} | 0 | 20,994,936 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
struct UF{
const int node_num;
vector<int> parent;
vector<int> size;
UF(int N) : node_num(N), parent(N), size(N, 1) {
for(int i = 0; i < N; ++i) parent[i] = i;
}
int root(int x){
if(parent[x] == x) return x;
return parent[x] = root(parent[x]);
}
void unite(int x, int y){
int root_x = root(x);
int root_y = root(y);
if(root_x == root_y) return;
parent[root_y] = root_x;
size[root_x] += size[root_y];
}
bool same(int x, int y){
int root_x = root(x);
int root_y = root(y);
return root_x == root_y;
}
int same_size(int x){
int root_x = root(x);
return size[root_x];
}
};
int main(){
Stream io;
char c;
io.read(c);
switch(c){
case 'a':
case 'i':
case 'u':
case 'e':
case 'o':
cout << "vowel";
break;
default:
cout << "consonant";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int arr[MAX];
int main()
{
FastRead
map<int,int>mp;
vector<int>v;
int n;
cin>>n;
set<int>s;
while(n--){
int a;
cin>>a;
mp[a]++;
s.insert(a);
}
for(auto i:s){
while(mp[i]>1)
{
v.push_back(i);
mp[i]-=2;
}
}
sort(v.begin(),v.end());
if(v.size()<2)
cout<<"0"<<endl;
else{
ll x=v[v.size()-1];
ll y=v[v.size()-2];
cout<<x*y<<endl;
}
return 0;
} | 0 | 30,493,839 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <limits>
#include <iomanip>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<ll> dp(N+1);
for(int i=0;i<N;i++){
cin >> A[i];
dp[A[i]]++;
}
ll total=0;
for(int i=1;i<=N;i++){
if(dp[i]>1){
total+= (dp[i]*(dp[i]-1))/2;
}
}
for(int i=0;i<N;i++){
int num = A[i];
ll ans=total;
if(dp[num]>1){
ans = ans - (dp[num]*(dp[num]-1))/2;
if(dp[num]>2){
ans +=((dp[num]-1)*(dp[num]-2))/2;
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) {
int x;
cin >> x;
a[x-1]++;
}
sort(a.begin(), a.end());
vector<int> s(n+1);
rep(i,n) s[i+1] = s[i] + a[i];
for (int k = 1; k <= n; ++k) {
int l = 0, r = n/k+1;
while(r-l > 1) {
int c = (l+r)/2;
bool ok = [&](int c) {
int i = lower_bound(a.begin(), a.end(), c) - a.begin();
int sum = c * (n-i) + s[i];
return (sum >= c*k);
}(c);
if (ok) l = c; else r = c;
}
printf("%d\n", l);
}
return 0;
} | 0 | 84,461,474 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
ll w, h, x, y;
cin >> w >> h >> x >> y;
double ans = double(w * h) / 2;
int a = (x * 2 == w && y * 2 == h ? 1 : 0);
printf("%.20f %d\n", ans, a);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
int main()
{
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
vector<ll> cum(n + 1);
for (int i = 0; i < n; i++)
{
cum[i + 1] = cum[i] + a[i];
}
map<ll, ll> mp;
for (auto c : cum)
{
mp[c]++;
}
ll ans = 0;
for (auto m : mp)
{
if (m.second >= 2)
{
ans += m.second * (m.second - 1) / 2;
}
}
cout << ans << endl;
return 0;
} | 0 | 54,240,348 |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<vector<char> >ar(n,vector<char>(m));
vector<vector<long long int> >dp(n,vector<long long int>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>ar[i][j];
}
}
bool flag=true;
for(int i=0;i<n;i++)
{
dp[i][0]=1;
if(ar[i][0]=='#')
flag=false;
if(flag==false)
dp[i][0]=0;
}
flag=true;
for(int i=0;i<m;i++)
{
dp[0][i]=1;
if(ar[0][i]=='#')
flag=false;
if(flag==false)
dp[0][i]=0;
}
for(int i=1;i<n;i++)
{
for(int j=1;j<m;j++)
{
if(ar[i][j]=='#')
dp[i][j]=0;
else
{
dp[i][j]=(dp[i-1][j]%mod+dp[i][j-1]%mod)%mod;
}
}
}
cout<<dp[n-1][m-1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const int mx=100010;
const ll mod=1e9+7;
int main(){
int n;
cin >> n;
set<string> st;
char pre = '0';
rep(i,n){
string s;
cin >> s;
if(st.find(s)!=st.end()){
cout << "No" << endl; return 0;
}
st.insert(s);
if(i!=0 && pre!=s[0]){
cout << "No" << endl; return 0;
} else {
pre = s.back();
}
}
cout << "Yes" << endl;
return 0;
} | 0 | 45,422,340 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
rep(i, n) {
int a, b;
cin >> a >> b;
if (a >= h && b >= w) ans++;
}
cout << ans << endl;
} | #include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
constexpr ll LL_MAX = numeric_limits<ll>::max();
constexpr ull ULL_MAX = numeric_limits<ull>::max();
template<typename T>
vector<T> make_vec_nd(T init, ll size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a)-1; i >= (b); i--)
int main() {
string s;
cin >> s;
unordered_map<int, ll> min_at_vec;
auto get_min_at_vec = [&min_at_vec](int vec) -> ll {
if (min_at_vec.find(vec) == min_at_vec.end()) {
return numeric_limits<ll>::max();
} else {
return min_at_vec[vec];
}
};
min_at_vec[0] = 0;
int vec = 0;
rep(i,0,s.size()) {
ll ans_loc = numeric_limits<ll>::max();
vec ^= (1 << (s[i] - 'a'));
ans_loc = min(ans_loc, get_min_at_vec(vec));
rep(ch,0,26) {
int vec_loc = vec ^ (1 << ch);
ans_loc = min(ans_loc, get_min_at_vec(vec_loc));
}
ans_loc++;
min_at_vec[vec] = min(get_min_at_vec(vec), ans_loc);
if (i == s.size() - 1) {
cout << ans_loc << endl;
}
}
} | 0 | 10,861,032 |
#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 >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int dis = 0;
rep(i, n)
{
if (i < n - 1)
dis = max(dis, abs(a[i] - a[i + 1]));
else
dis = max(dis, abs(a[0] + k - a[i]));
}
cout << k - dis << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n; cin>>n;
vi a(n+1);
for (int i=1;i<=n;i++) cin>>a[i];
if (n&1){
for (int i=n;i>0;i-=2) cout << a[i] << " ";
for (int i=2;i<=n;i+=2) cout << a[i] << " ";
cout << endl;
}
else {
for (int i=n;i>0;i-=2) cout << a[i] << " ";
for (int i=1;i<=n;i+=2) cout << a[i] << " ";
cout << endl;
}
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
} | 0 | 34,817,878 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define sz(x) (int)x.size()
#define mem(a,b) memset(a, b, sizeof a)
#define vii vector<pair<int,int>>
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr <<#x<<" = "<<x<<"\n"
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for (int i = a; i<b; ++i)
#define len(s) s.length()
#define watch(x) cout << #x << " = " << x << endl
#define trace(x) cerr << #x << " = " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int power(int a,int b,int m=mod)
{int ans=1;while(b>0){if(b&1)ans=(ans*a)%m;a=(a*a)%m;b>>=1;}
return ans;}
void angshuGod()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
const int N = 1e5+1;
const double pi = acos(-1);
void solve(){
int n, m = inf;
cin>>n;
vi v(n);
int cnt = 0;
fo(i,n){
cin>>v[i];
if(v[i]<m){
cnt++;
m = min(m,v[i]);
}
}
cout<<cnt;
}
int32_t main()
{
angshuGod();
int t;
t = 1;
while(t--){
solve();
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N, M;
cin >> N >> M;
if(N%2){
REP(i, M){
cout << i+1 << " " << N-i << "\n";
}
}else{
REP(i, M){
if(i < M/2){
cout << i+1 << " " << N/2-i-1 << "\n";
}else{
cout << N/2+i-M/2 << " " << N-(i-M/2)-1 << "\n";
}
}
}
return 0;
} | 0 | 12,369,358 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
int n;
ll gt[maxN], igt[maxN];
int a[maxN], vis[maxN];
ll Pow(ll a, ll b) {
if (b == 0) return 1;
ll t = Pow(a, b / 2);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
void init() {
const int maxp = 1e5 + 1;
gt[0] = 1;
for (int i = 1; i <= maxp; ++i) {
gt[i] = (gt[i-1] * i) % mod;
}
igt[maxp] = Pow(gt[maxp], mod - 2);
for (int i = maxp - 1; i >= 0; --i) {
igt[i] = (igt[i+1] * (i+1)) % mod;
}
}
int mul(int x, int y) {
return (1ll * x * y) % mod;
}
int comb(int k, int n) {
if (k > n) return 0;
return mul(mul(gt[n], igt[k]), igt[n-k]);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
init();
cin >> n;
int vt1 = -1, vt2 = -1;
for (int i = 1; i <= n + 1; ++i) {
int x; cin >> x;
if (vis[x]){
vt1 = vis[x]; vt2 = i;
}
vis[x] = i;
}
for (int k = 1; k <= n + 1; ++k) {
cout << (0ll + comb(k, n + 1) - comb(k-1, n-vt2+vt1) + mod) % mod << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int H, W;
cin >> H >> W;
int left[H][W], right[H][W], up[H][W], down[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
left[i][j] = 0;
right[i][j] = 0;
up[i][j] = 0;
down[i][j] = 0;
}
}
vector<string> S(H);
for (int i=0; i<H; i++) cin >> S[i];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(S[i][j]=='.'){
if(j==0){
left[i][j] = 1;
}else{
left[i][j] = left[i][j-1] + 1;
}
}
}
}
for(int i=0; i<H; i++){
for(int j=W-1; j>=0; j--){
if(S[i][j]=='.'){
if(j==W-1){
right[i][j] = 1;
}else{
right[i][j] = right[i][j+1] + 1;
}
}
}
}
for(int i=0; i<W; i++){
for(int j=H-1; j>=0; j--){
if(S[j][i]=='.'){
if(j==H-1){
down[j][i] = 1;
}else{
down[j][i] = down[j+1][i] + 1;
}
}
}
}
for(int i=0; i<W; i++){
for(int j=0; j<H; j++){
if(S[j][i]=='.'){
if(j==0){
up[j][i] = 1;
}else{
up[j][i] = up[j-1][i] + 1;
}
}
}
}
int res = 0;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(S[i][j]=='#') continue;
res = max(res, left[i][j]+right[i][j]+up[i][j]+down[i][j]-3);
}
}
cout << res << endl;
return 0;
} | 0 | 17,212,983 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+7;
const ll inf = 1e18;
ll popcount(ll num){
num = num - ((num >> 1) & 0x55555555);
num = (num & 0x33333333) + ((num >> 2) & 0x33333333);
return ((num + (num >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
vector<pair<ll,ll>> factor_arr;
void myfactor(ll num){
ll count = 0;
while (!(num % 2)) {
num >>= 1; count++;
}
if (count) factor_arr.push_back({2,count});
for (auto i = 3; i <= sqrt(num); i += 2) {
count = 0;
while (num % i == 0) {
count++;
num /= i;
}
if (count) factor_arr.push_back({i,count});
}
if (num > 2) factor_arr.push_back({num,1});
}
void virus(){
ll a,b;
cin>>a>>b;
string one = "", two = "";
for(auto i=0; i<b; i++) one += (a + '0');
for(auto i=0; i<a; i++) two += (b + '0');
cout<<min(one,two);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t=1;
while(t--){
auto start = high_resolution_clock::now();
virus();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<seconds>(stop - start);
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int N = 0;
cin >> N;
string in[N];
string out[N];
for(int i = 0; i < N; ++i){
cin >> in[i];
out[i] = in[i];
}
for(int i = 0; i < N; ++i){
for(int j = N - 1; j > i; --j){
if(out[j].at(1) < out[j - 1].at(1)){
string str = out[j];
out[j] = out[j - 1];
out[j - 1] = str;
}
}
}
for(int i = 0; i < N; ++i){
if(i != N - 1) cout << out[i] << " ";
else cout << out[i] << endl;
}
cout << "Stable" << endl;
for(int i = 0; i < N; ++i){
int minj = i;
for(int j = i; j < N; ++j){
if(in[j].at(1) < in[minj].at(1)){
minj = j;
}
}
string s = in[i];
in[i] = in[minj];
in[minj] = s;
}
for(int i = 0; i < N; ++i){
if(i != N - 1) cout << in[i] << " ";
else cout << in[i] << endl;
}
for(int i = 0; i < N; ++i){
if(in[i] != out[i]){
cout << "Not stable" << endl;
return 0;
}
}
cout << "Stable" << endl;
return 0;
} | 0 | 79,695,800 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll a,p;
cin >> a >> p;
p+=a*3;
cout << p/2 << endl;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
signed main() {
int N; cin >> N;
vector<int>B(N);
vector<int>A(N);
int ans = 0;
rep(i, N) {
if (i != 0 && i != N - 1) {
cin >> B[i];
A[i] = min(B[i], B[i - 1]);
}
else if (i == 0) {
cin >> B[i];
A[0] = B[0];
}
else A[i] = B[i - 1];
ans += A[i];
}
cout << ans << endl;
} | 0 | 2,327,433 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
#define MINS(a,b) a = min(a,(decltype(a))(b))
#define MAXS(a,b) a = max(a,(decltype(a))(b))
int main() {
ll N;
cin >> N;
vector<pair<ll,ll>> P(N);
REP(i, 0, N) {
cin >> P[i].first >> P[i].second;
}
sort(P.begin(), P.end(), [](const pair<ll, ll>& a, const pair<ll, ll>& b) {return atan2l(a.second, a.first) < atan2l(b.second, b.first); });
ldb ans = 0;
REP(i, 0, N) {
REP(j, i, i + N) {
pair<ll, ll> p = { 0,0 };
REP(k, i, j + 1) {
p.first += P[k % N].first;
p.second += P[k % N].second;
}
MAXS(ans, sqrtl(p.first* p.first + p.second * p.second));
}
}
printf("%.11Lf\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N, C, K;
cin >> N >> C >> K;
vector<int> T(N);
for (int i = 0; i < N; i++)
{
cin >> T[i];
}
int busCnt = 0;
int passnger = 0;
sort(T.begin(), T.end(), less<int>());
int tbegin = T[0];
int tend = T[0] + K;
passnger++;
busCnt++;
for(int i = 1; i < N; i++){
if(T[i] <= tend && passnger < C) {
passnger++;
}
if(T[i] > tend || passnger >= C){
busCnt++;
passnger = 0;
tend = T[i] + K;
}
}
cout << busCnt << endl;
return 0;
} | 0 | 42,886,405 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a, b;
cin >> a >> b;
if(a.size() < b.size()){
cout << "LESS" << endl;
} else if(a.size() > b.size()){
cout << "GREATER" << endl;
} else {
int i;
for(i = 0; i < a.size(); i++){
if(a[i] - '0' > b[i] - '0'){
cout << "GREATER" << endl;
return 0;
} else if (a[i] - '0' < b[i] - '0'){
cout << "LESS" << endl;
return 0;
}
}
if(i == a.size()){
cout << "EQUAL" << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define check(v) rep(i,v.size()) cout << v[i] << " ";\
cout << endl
#define INF 1e8
typedef long long ll;
using namespace std;
int main() {
int n; cin >> n;
int a, b; cin >> a >> b;
int fi=0, se=0, th=0;
rep(i,n){
int num; cin >> num;
if(num<=a) fi++;
else if(num<=b) se++;
else th++;
}
cout << min({fi,se,th}) << endl;
return 0;
} | 0 | 7,190,738 |
#include<iostream>
#include<algorithm>
using namespace std;
long a,b;main(){cin>>a>>b;cout<<(abs(a-b)<2?"Brown":"Alice")<<endl;} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define em emplace_back
#define mp make_pair
#define sp " "
#define cs "Case "
#define fi first
#define sn second
#define mem(a,n) memset(a, n, sizeof(a));
#define all(x) x.begin(),x.end()
#define alr(x) x.rbegin(),x.rend()
#define sz(x) (int)x.size()
#define mx(v) *max_element(v.begin(),v.end())
#define mxi(v) distance(v.begin(),max_element(v.begin(),v.end()))
#define mxa(a) *max_element(a, a.size())
#define r(a) reverse(a.begin(),a.end())
#define fr(i,n) for(__typeof(n) i=0;i<(n);i++)
#define fn(i,n) for(__typeof(n) i=1;i<=(n);i++)
#define Ezio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define db(something) cerr<<#something<<" - "<<something<<"\n";
int main()
{
Ezio
ll t,m,n,x;
string s,a,b;
cin>>n>>s;
if(n%2){
cout<<"No"<<endl;
return 0;
}
a= s.substr(0,n/2);
b= s.substr(n/2,n/2);
cout<<(a==b?"Yes":"No")<<endl;
return 0;
} | 0 | 18,806,263 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
string s; cin >> s;
for(int i=0; i<s.size(); i++){
if(i==s.size()-2){
if(s.at(i)==s.at(i+1)){
cout << i+1 << " " << i+2 << endl;
return 0;
}
break;
}
else if(s.at(i)==s.at(i+1) || s.at(i)==s.at(i+2)){
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
string s; cin>>s; ll f1=0,f2=0;
for(ll i=0;i<s.size();i++)
{
if(s[i]=='<') f1=1;
if(s[i]=='>') f2=1;
}
if(f1==0 || f2==0)
{
ll n=s.size();
cout<<(n*(n+1))/2;
return 0;
}
ll ans=0,c=-1;
ll p1=0,p;
for(ll i=0;i<s.size();i++)
{
if(s[i]=='<') c++;
else if(c!=-1)
{
ans+=((c*(c+1))/2);
c=-1;
}
}
if(c!=-1)
{
c++;
ans+=((c*(c+1))/2);
}
c=0;
for(ll i=s.size()-1;i>=0;i--)
{
if(s[i]=='>')
{
p=i; break;
}
}
vector<ll>a,b;
for(ll i=p;i>=0;i--)
{
if(s[i]=='>') c++;
else if(c!=0)
{
a.pb(c);
c=0;
}
if(s[i]=='<') p1++;
else if(p1!=0)
{
b.pb(p1);
p1=0;
}
}
if(c!=0)
{
a.pb(c);
b.pb(0);
}
else b.pb(p1);
for(ll i=0;i<a.size();i++)
{
if(a[i]<b[i])
{
ll k=a[i]-1;
ans+=((k*(k+1))/2);
ans+=b[i];
}
else ans+=((a[i]*(a[i]+1))/2);
}
cout<<ans;
} | 0 | 56,610,411 |
#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;
template <unsigned T>
bool nextBitset(bitset<T> &bs, int digit)
{
bitset<T> x, y, z;
x = bs.to_ulong() & (~(bs.to_ulong()) + 1ULL);
y = bs.to_ulong() + x.to_ulong() + 0ULL;
z = bs & ~y;
if(bs[digit-1] && bs == z)
return false;
bs = ((z.to_ulong() / x.to_ulong()) >> 1) + 0ULL;
bs |= y;
return true;
}
int main()
{
for(;;){
int n, s;
cin >> n >> s;
if(n == 0)
return 0;
bitset<10> bs((1<<n)-1);
int ret = 0;
do{
int tmp = 0;
for(int i=0; i<10; ++i){
if(bs[i])
tmp += i;
}
if(tmp == s)
++ ret;
}while(nextBitset(bs, 10));
cout << ret << endl;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
int main() {
ll a, b; cin >> a >> b;
b++;
vector<ll> aa(40,0);
vector<ll> ab(40,0);
ll c = 1LL;
rep(i,40){
ll da = a / (c*2LL);
ll ma = a % (c*2LL);
aa[i] = c * da + max(0LL,ma-c);
ll db = b / (c*2LL);
ll mb = b % (c*2LL);
ab[i] = c * db + max(0LL,mb-c);
c *= 2LL;
}
ll p = 1LL;
ll ans = 0LL;
rep(i,40){
if ((ab[i] - aa[i]) % 2 == 1) ans += p;
p *= 2LL;
}
cout << ans << endl;
} | 0 | 8,167,387 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
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;
}
ll gcd(ll n, ll m)
{
ll tmp;
while (m != 0)
{
tmp = n % m;
n = m;
m = tmp;
}
return n;
}
ll lcm(ll n, ll m)
{
return abs(n) / gcd(n, m) * abs(m);
}
using namespace std;
void solve(){
int n;
cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
ll ans=0;
queue<ll>q;
rep(i,n){
if(a[i]%2){
ans+=a[i]/2;
a[i]=1;
}
else{
ans+=max(0LL,a[i]/2-1);
if(a[i]>=2)a[i]=2;
}
rep(j,a[i])q.emplace(i+1);
}
while(q.size()>1){
int x=q.front();
q.pop();
int y=q.front();
if(abs(y-x)<=1){
++ans;
q.pop();
}
}
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool find(int i, int j, int k, string s) {
int now = 0;
for (int idx = 0; idx < s.size(); idx++) {
if (now == 0 && s[idx] == '0' + i) {
now++;
continue;
}
if (now == 1 && s[idx] == '0' + j) {
now++;
continue;
}
if (now == 2 && s[idx] == '0' + k) {
now++;
break;
}
}
if (now == 3) {
return true;
} else {
return false;
}
}
int solve(int n, string s) {
int ans = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
if (find(i, j, k, s)) {
ans++;
}
}
}
}
return ans;
}
int main() {
int n;
string s;
cin >> n >> s;
cout << solve(n, s) << endl;
} | 0 | 16,021,231 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t; cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
cout << ( (s < t) ? "Yes" : "No") << "\n";
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll mod=1e9+7;
int main()
{
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll dx=c-a;
ll dy=d-b;
ll x=c;
ll y=d;
x+=-dy;
y+=dx;
cout << x << " " << y;
cout << " ";
x+=-dx;
y+=-dy;
cout << x << " " << y << endl;
return 0;
} | 0 | 20,032,862 |
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
int main(int argc, char const* argv[])
{
int n;
cin >> n;
int k;
for(int i = 1; i < 1000; i++){
if(2 * n == i * (i + 1)){
k = i;
break;
}else if(2 * n < i * (i + 1)){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << k + 1 << endl;
vector<vector<int> > vec;
vec.resize(k + 1);
int fin = 1;
for(int i = 0; i < k; i++){
for(int j = 0; j < k - i; j++){
vec[i].pb(fin + j);
}
for(int j = 0; j < k - i; j++){
vec[j + i + 1].pb(fin + j);
}
fin = fin + k - i;
}
for(int i = 0; i < k + 1; i++){
cout << k << " ";
for(int j = 0; j < k; j++){
cout << vec[i][j];
if(j != k - 1)cout << " ";
}
cout << endl;
}
return 0;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v<< ": " << v <<endl;
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
int main(){
ll n, m; cin >> n >> m;
vll a(m), b(m);
rep(i, 0, m){
cin >> a[i] >> b[i];
}
vll imos(n+1, 0);
rep(i, 0, m){
imos[a[i]]++;
imos[b[i]]--;
}
ll s = 0;
vll p(n);
rep(i, 1, n){
s += imos[i];
p[i] = s;
}
bool v = true;
rep(i, 1, n){
if(p[i]%2 == 1){
v = false;
}
}
if(v){
prtl("YES");
}else{
prtl("NO");
}
} | 0 | 14,394,255 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string n;
cin >> n;
if (n[0] == n[1] && n[1] == n[2]) cout << n << '\n';
else {
string tmp;
REP(i, 3)
tmp.push_back(n[0]);
if (tmp > n) cout << tmp << '\n';
else {
string ans;
REP(i, 3)
ans.push_back(n[0] + 1);
cout << ans << '\n';
}
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
int ncnt[100007];
int main() {
ll K,N,x=0;
ll sum=0;
priority_queue<ll> PQ;
pair<ll,ll> dt[100007];
cin >> N >> K;
rep(i,N){
cin >> dt[i].second >> dt[i].first;
}
sort(dt,dt+N);
reverse(dt,dt+N);
rep(i,K){
if(ncnt[dt[i].second]>0){
PQ.push(-dt[i].first);
}
else{
x++;
}
ncnt[dt[i].second]++;
sum+=dt[i].first;
}
ll ma=sum+x*x;
ll now=K;
while(now<N){
if(PQ.empty()){
break;
}
sum -= -PQ.top();
PQ.pop();
Rep(i,now,N){
if(ncnt[dt[i].second]==0){
ncnt[dt[i].second]++;
sum+=dt[i].first;
x++;
ma=max(ma,sum+x*x);
now=i+1;
break;
}
}
}
cout << ma << endl;
} | 0 | 38,028,903 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
ll INF=LLONG_MAX;
int const mxn=3e5+5;
ll a[mxn];
void add(ll &a, ll b){
a%=MOD; b%=MOD; a+=b; a%=MOD;
return;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
map<int,ii>mp;
for(int i=0; i<n; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
for(int j=59; j>=0; j--){
if(a[i]>>j&1)mp[j].se++;
else mp[j].fi++;
}
}
ll ans = 0; ll two = 1;
for(int j=0; j<60; j++){
add(ans,(((two*mp[j].fi)%MOD)*mp[j].se)%MOD);
two*=2;
two%=MOD;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
int a, b;
cin >> a >> b;
int h, w;
h = w = 100;
vector<string> ret(h, string(w, '.'));
for (int i = 0; i < 100; i += 2) {
for (int j = 0; j < 100 - 1; ++j) {
ret[i][j] = '#';
}
}
for (int i = 0; i < 100; ++i) {
ret[i][0] = '#';
}
int xx = 2;
int yy = 1;
while (a != 1) {
ret[yy][xx] = '#';
a--;
yy += 2;
if (yy >= 100) {
yy = 1;
xx += 2;
}
}
xx = 97;
yy = 0;
while (b != 1) {
ret[yy][xx] = '.';
b--;
yy += 2;
if (yy >= 100) {
yy = 0;
xx -= 2;
}
}
cout << 100 << " " << 100 << endl;
for (auto &s : ret) {
cout << s << endl;
}
return 0;
} | 0 | 46,521,164 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long x, y, ma = pow(10, 9);
y = (s + ma - 1) / ma, x = y * ma - s;
cout << 0 << " " << 0 << " " << ma << " " << 1 << " " << x << " " << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
using P = pair<int,int>;
int main()
{
int n;
cin >> n;
vector<P> a(n);
vector<P> b(n);
vector<bool> used(n);
rep(i,n)
{
int x, y;
cin >> x >> y;
a[i] = P(x,y);
used[i] = false;
}
rep(i,n)
{
int x, y;
cin >> x >> y;
b[i] = P(x,y);
}
sort(b.begin(), b.end());
int ans = 0;
rep(i,n)
{
int x = b[i].first;
int y = b[i].second;
int m = -1;
int index = -1;
rep(j,n)
{
if(used[j]) continue;
if(x > a[j].first && y > a[j].second)
{
if(m < a[j].second)
{
index = j;
m = a[j].second;
}
}
}
if(index != -1)
{
ans++;
used[index] = true;
}
}
cout << ans << endl;
} | 0 | 97,347,160 |
#include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, m, color[N];
vector<int> adj[N];
bool visit[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1, x, y; i <= m; ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int a = 0, b = 0, c = 0, number;
bool ok;
for (int i = 1; i <= n; ++i) {
if (!visit[i]) {
function<void (int, int)> dfs = [&] (int x, int z) {
++number;
visit[x] = true;
color[x] = z;
for (auto y : adj[x]) {
if (!visit[y]) {
dfs(y, !z);
} else if (color[y] != (!z)) {
ok = false;
}
}
};
number = 0;
ok = true;
dfs(i, 0);
if (number == 1) {
++a;
} else if (!ok) {
++b;
} else {
++c;
}
}
}
long long answer = 0;
answer += (long long) a * a;
answer += (long long) a * (n - a) << 1;
answer += (long long) b * b;
answer += (long long) b * c << 1;
answer += (long long) c * c << 1;
cout << answer << '\n';
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<pii, pii> ppiipii;
typedef pair<int, ppiipii> pippiipii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> ppiii;
typedef pair<int, ppiii> pippiii;
typedef pair<int, ll> pill;
typedef pair<int, double> pid;
typedef pair<string, string> pss;
typedef pair<ll, ll> pll;
typedef pair<ll, int> plli;
typedef long double ld;
char buf[10000];
vector<int> poss[2];
int goal[2];
bool dp[10000];
bool can(int idx) {
memset(dp, 0, sizeof(dp));
dp[0] = true;
int totalSum = 0;
for(int out: poss[idx]) {
totalSum += out;
for(int a = 8000; a >= out; a--) {
dp[a] |= dp[a-out];
}
}
goal[idx] = abs(goal[idx]);
if(goal[idx] > totalSum) return false;
if(totalSum%2 != goal[idx]%2) return false;
return dp[(totalSum - goal[idx]) / 2];
}
bool can() {
return can(0) && can(1);
}
int main() {
scanf("%s", buf);
int len = strlen(buf);
scanf("%d%d", &goal[0], &goal[1]);
int idx = 0;
int i = 0;
while(i < len && buf[i] == 'F') {
goal[0]--;
i++;
}
i++;
idx++;
while(i < len) {
if(buf[i] == 'T') {
idx++;
idx%=2;
i++;
continue;
}
int j = i+1;
while(j < len && buf[j] == 'F') j++;
poss[idx++].push_back(j-i);
idx%=2;
i=j+1;
}
printf(can() ? "Yes\n" : "No\n");
} | 0 | 22,352,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
int h,w; cin >> h >> w;
string s;
rep(i, h){
rep(j, w){
cin >> s;
if(s == "snuke"){
cout << (char)(j + 'A') << i+1 << endl;
return 0;
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
ll MOD = 1000000007;
ll INF = 1e18;
ld EPS = 1e-9;
ld PI = M_PI;
vll dx = {1, 0, -1, 0, 1, -1, -1, 1};
vll dy = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b;}
void yes(){ cout << "YES" << endl;}
void no(){ cout << "NO" << endl;}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
vll a(n);
REP(i,n) cin >> a[i];
sort(ALL(a));
if(a[0] == 0){
cout << 0 << endl;
return 0;
}
ll ans = 1;
for(ll i = 0; i < n; i++){
if(ans > INF / a[i]){
cout << -1 << endl;
return 0;
}
ans *= a[i];
if(ans > INF){
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
} | 0 | 11,368,420 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
vecl dividers(ll N) {
vecl res;
for(ll i = 1; i * i <= N; i++) {
if(N%i == 0) {
res.push_back(i);
if(i != N/i) res.push_back(N/i);
}
}
return res;
}
int main() {
ll N;
cin >> N;
vecl res = dividers(N);
ll ans = 0;
for(ll p : res) {
if(1 <= p && p <= N-1) {
ll m = N/p-1;
if(N/m == N%m) ans += m;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int N,Z,W;
vector<vector<int>> dp(2010, vector<int>(2,-1));
vector<int> A;
int dfs(int pos, int t){
if(dp[pos][t] != -1) return dp[pos][t];
int ret;
if(t==0) ret = 0;
else ret = INF;
FOR(i,pos+1,N+2){
int tmp;
if(i==N+1) tmp = abs(A[pos] - A[N+1]);
else tmp = dfs(i,1-t);
if(t==0) ret = max(ret,tmp);
else ret = min(ret,tmp);
}
dp[pos][t] = ret;
return ret;
}
int main() {
cin >> N >> Z >> W;
A.assign(N+2,0);
A[0] = Z;
A[1] = W;
FOR(i,2,N+2) cin >> A[i];
cout << dfs(1,0) << endl;
return 0;
} | 0 | 59,519,413 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=max(a*c,max(a*d,max(b*c,b*d)));
cout<<ans<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
const ll N = 1e5+5, M = 1e6+5, A = 1e7+5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve()
{
ll n, k; cin >> n >> k;
vector<ll> a(n); cin >> a; sort(all(a));
ll g = 0;
rep(i, n) g = __gcd(g, a[i]);
cout << (a[n-1] >= k && k%g == 0 ? "POSSIBLE" : "IMPOSSIBLE");
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
} | 0 | 29,766,908 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <complex>
#include <iomanip>
using namespace std;
#define rep(i,n) for (int i=0; i < int(n); i++)
typedef vector<int> VI;
typedef double D;
typedef complex<D> P;
#define X real()
#define Y imag()
void print(P p) {
cout << setprecision(8) << p.X << " " << setprecision(8) << p.Y << endl;
}
void koch(int n, P p1, P p2) {
if (n == 0) return;
P s = p1 + (p2-p1)*(1/3.0);
P t = p1 + (p2-p1)*(2/3.0);
P st = t - s;
P u = s + st * polar(1.0, M_PI / 3);
koch(n-1, p1, s);
print(s);
koch(n-1, s, u);
print(u);
koch(n-1, u, t);
print(t);
koch(n-1, t, p2);
}
int main() {
int n;
cin >> n;
P p1(0,0);
P p2(100,0);
print(p1);
koch(n, p1, p2);
print(p2);
return 0;
} | #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>;
int main(){
int n; cin >> n;
vector<int> A;
A.push_back(0);
rep(i,n){
int a; cin >> a;
A.push_back(a);
}
A.push_back(0);
int sum = 0;
rep(i,n+1) sum += abs(A[i+1] - A[i]);
for(int i = 1; i <= n; i++){
int ans = sum;
ans -= abs(A[i] - A[i-1]);
ans -= abs(A[i+1] - A[i]);
ans += abs(A[i+1] - A[i-1]);
cout << ans << endl;
}
} | 0 | 49,917,551 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
int ls[N + 1];
ls[0] = 0;
rep(i, N) cin >> ls[i+1];
int ans = 0;
for (int i = 1; i <= N; ++i)
{
for (int j = i+1; j <= N; ++j)
{
ans += ls[i] * ls[j];
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
int i,j,n,k,e[101][101],v[101],a,b,d[101],s;
queue<int> Q;
for(i=0;i<=100;i++)
{
for(j=0;j<=100;j++)
{
e[i][j]=0;
}
v[i]=0;
d[i]=-1;
}
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%d",&a,&k);
for(j=0;j<=k-1;j++)
{
scanf("%d",&b);
e[a][b]=1;
}
}
Q.push(1);
d[1]=0;
s=1;
v[1]=1;
while(Q.empty()!=1)
{
i=Q.front();
for(j=1;j<=n;j++)
{
if(e[i][j]==1 && v[j]==0)
{
d[j]=d[i]+1;
v[j]=1;
Q.push(j);
}
}
Q.pop();
}
for(i=1;i<=n;i++)
{
cout << i << " " << d[i] << endl;
}
return 0;
} | 0 | 80,207,759 |
#define _GLIBCXX_DEBUG
#define MIN_MAX 1200001
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(void){
int n, m, x;
cin >> n >> m >> x;
vi C(n);
vvi A(n, vi(m));
for(int i=0; i<n; i++){
cin >> C[i];
for(int &a : A[i]) cin >> a;
}
int min = MIN_MAX;
for(int bit=0; bit<1<<n; bit++){
int sumC = 0;
vi sumA(m);
for(int i=0; i<n; i++)if(bit & 1<<i){
sumC += C[i];
for(int j=0; j<m; j++) sumA[j] += A[i][j];
}
bool suc = true;
for(int &a : sumA)if(a<x){suc = false; break;}
if(suc && sumC < min) min = sumC;
}
if(min < MIN_MAX) cout << min << '\n';
else cout << -1 << '\n';
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uld = unsigned long long;
using P = pair<int,int>;
const ll mod = 1e9+7;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
int main(){
int n;
cin >> n;
int ans = 1, max_a = 0;
rep1(i,n){
int k = i;
int cnt = 0;
while(k % 2 == 0){
k /= 2;
cnt++;
}
if(max_a < cnt){
ans = i;
max_a = cnt;
}
}
cout << ans << endl;
} | 0 | 46,478,974 |
#include<stdio.h>
int main()
{
int n, k;
scanf("%d %d", &n, &k);
int i, res = 1;
for (i = 1; i <= n; i++)
{
if (res + k <= res * 2)
{
res += k;
}
else
{
res *= 2;
}
}
printf("%d\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#define VEC2(TYPE, A, B, NAME, INIT) vector<vector<TYPE>> NAME(A, vector<TYPE>(B, (INIT)))
int main()
{
int n;
cin >> n;
struct Node{
int idx = -1;
ull cost = 1;
ull costSum = 0;
};
map<ull, Node> mp;
REP(i, n)
{
ull a;
cin >> a;
mp[a].idx = i;
}
struct Edge{
int i;
int j;
};
VEC(Edge, 0, edgeAry, Edge());
for( auto it = mp.rbegin(); it != mp.rend(); ++it )
{
const ull d = it->first;
Node& node = it->second;
if( d == mp.begin()->first ) break;
ull sub = n - 2*node.cost;
auto& nextNode = mp[d-sub];
if( nextNode.idx == -1 )
{
cout << -1 << endl;
return 0;
}
nextNode.cost += node.cost;
nextNode.costSum += node.cost + node.costSum;
Edge edge;
edge.i = node.idx;
edge.j = nextNode.idx;
edgeAry.push_back( edge );
}
{
const ull d = mp.begin()->first;
Node& node = mp.begin()->second;
if( node.costSum != d )
{
cout << -1 << endl;
return 0;
}
}
for( auto& e : edgeAry )
{
cout << e.i + 1 << " " << e.j + 1 << endl;
}
return 0;
} | 0 | 36,835,573 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n -1;
for(long long i = 2; i <= sqrt(n); i++) {
if(n % i == 0) {
ans = i + n / i - 2;
}
}
cout << ans;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
const int MAX_ROW = 110;
const int MAX_COL = 100005;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int n;
void GaussJordan(BitMatrix &A, bool is_extended = false) {
vector<bool> used(A.H, 0);
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1) break;
int pivot = -1;
for (int row = 0; row < A.H; ++row) {
if (used[row]) continue;
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1) continue;
for (int row = 0; row < A.H; ++row) {
if (row != pivot && A[row][col]) A[row] ^= A[pivot];
}
used[pivot] = true;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<int> odd(61);
ll res = 0;
BitMatrix B(61, n + 1);
for (ll i = 60; i >= 0; --i) {
int cnt = 0;
rep(j, n) {
if (a[j] & (1LL << i)) cnt++;
}
if (cnt & 1) {
odd[i] = 1;
res += (1LL << i);
} else if (cnt == 0) {
odd[i] = 1;
} else {
rep(j, n) {
if (a[j] & (1LL << i)) B[60 - i][j] = 1;
}
B[60 - i][n] = 1;
}
}
GaussJordan(B, true);
for (int i = 60; i >= 0; --i) {
if (odd[i]) continue;
bool ok = false;
rep(j, n) if (B[60 - i][j]) ok = true;
if (!B[60 - i][n]) ok = true;
if (ok) { res += (2LL << i); }
}
cout << res << endl;
} | 0 | 15,041,098 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
ll S[100005];
ll T[100005];
int main()
{
ll N, K;
cin >> N >> K;
S[0] = T[0] = 0;
REP(i, N)
{
cin >> A[i];
S[i + 1] += S[i] + A[i];
T[i + 1] += T[i] + std::max(0LL, A[i]);
}
ll max = -INF;
REP(i, N)
{
if (i + K > N)
break;
ll m = T[i] + std::max(S[i + K] - S[i], 0LL) + T[N] - T[i + K];
max = std::max(max, m);
}
cout << max << endl;
return 0;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
bool isPrime(ll x){
ll i;
if(x < 2)return 0;
else if(x == 2) return 1;
if(x%2 == 0) return 0;
for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
return 1;
}
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
signed main(void)
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll k = lcm(c,d);
a--;
ll r = (b -b/d -b/c +b/k) - (a -a/d -a/c +a/k);
mes(r);
} | 0 | 94,281,389 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return (a % 1000000007);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll cnt = 0; ll n; cin >> n; vl an(n); vl bn(n);
rep(i,n){
cin >> an[i] >> bn[i];
}
rep(i,n){
if((an[n-1-i] + cnt) % bn[n-1-i] == 0){
continue;
}
else cnt += bn[n-1-i] - ((an[n-1-i] + cnt) % bn[n-1-i]);
}
cout << cnt << endl;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
int main() {
int N,A,B;
cin>>N>>A>>B;
int X=0;
int Y=0;
int Z=0;
vector<int>P(N);
for(int i=0;i<N;i++){
cin>>P[i];
}
for(int i=0;i<N;i++){
if(P[i]<=A){
X++;
}
else if(P[i]>A&&P[i]<=B){
Y++;
}
else{
Z++;
}
}
cout<<min(X,min(Y,Z))<<endl;
} | 0 | 60,848,498 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
int main(){
int n;
cin >> n;
vector<int> w;
for(int i=0;i<n;i++){
int m;
cin >> m;
w.push_back(m);
}
int sum=0;
for(int i=0;i<n;i++) sum+=w.at(i);
int ans=sum;
int tmp=0;
for(int i=0;i<n;i++){
tmp+=w.at(i);
ans=min(ans,abs((sum-tmp)-tmp));
}
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
string sn[n], sm[m];
for(int i = 0; i < n; ++i) cin >> sn[i];
for(int i = 0; i < m; ++i) cin >> sm[i];
for(int i = 0; i < n-m+1; i++){
for(int j = 0; j < n-m+1; j++){
int flag = 1;
int cnt = 0;
for(int k = 0; k < m && flag; k++){
if(sn[i+k].substr(j, m) != sm[k]) flag = 0;
else cnt++;
}
if(cnt == m) {
cout << "Yes" << endl;
return;
}
}
}
cout << "No" << endl;
}
int main(){
solve();
return 0;
} | 0 | 55,303,664 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
const double PI = 3.1415926535897932;
ll cnt[1010];
int main()
{
int n,k; cin >> n >> k;
vector<ll> v;
rep(i,n) cin >> cnt[i+1];
rep(i,n) cnt[i+1] += cnt[i];
for(int i = 0; i < n; i++){
for(int j = i+1; j < n+1; j++){
v.push_back(cnt[j]-cnt[i]);
}
}
ll ans = 0;
for(int i = 40; i >= 0; i--){
ll cur = ans + (1LL << i);
int ok = 0;
for(auto tmp : v) if((cur & tmp) == cur) ok++;
if(ok >= k) ans = cur;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
string s;
cin>>s;
int n=s.size();
int res=0;
for(int i=0,j=s.size()-1;i<j;){
if(s[i]==s[j]) i++,j--;
else if(s[i]=='x') res++,i++;
else if(s[j]=='x') res++,j--;
else{
cout<<-1<<endl;
return 0;
}
}
cout<<res<<endl;
} | 0 | 17,741,861 |
#include<iostream>
using namespace std;
int main(){
int n,m,p,x[100],total;
while(1){
cin>>n>>m>>p;
if(!(n||m||p))break;
total=0;
for(int i=0; i<n; i++) cin>>x[i],total+=x[i];
if(x[m-1]!=0) total = total*(100-p)/x[m-1] ;
else total = 0;
cout<< total <<endl;
}
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n);
for (;; ++n) {
string s = to_string(n);
bool ok = true;
for (char c : s)
if (c != s[0]) ok = false;
if (ok) {
out(n);
return 0;
}
}
} | 0 | 15,891,756 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long h,w;
cin >> h >> w;
long long s = h*w;
if(h==1||w==1){
cout << 1 << endl;
return 0;
}else if(s%2!=0){
cout << (s+1)/2 << endl;
}else{
cout << s/2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define yn(x, ok, ng) cout << ((x)?(ok):(ng)) << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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;}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int const INF = 1001001001;
void err() {
cout << -1 << endl;
exit(0);
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
deque<char> q;
rep(i,SZ(s)) {
q.push_front(s[i]);
}
int cnt = 0;
while(q.size() >= 2) {
char f = q.front();
char b = q.back();
if(f == b) {
q.pop_front();
q.pop_back();
}
else {
if(f == 'x') {
q.push_back('x');
cnt++;
}
else if(b == 'x') {
q.push_front('x');
cnt++;
}
else err();
}
}
cout << cnt << endl;
return 0;
} | 0 | 65,469,288 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a=111;
for(int i=0;i<9;i++){
if(n<=a){cout << a << endl;break;}
a+=111;
}
} | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ld long double
#define f first
#define mt make_tuple
#define s second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define time_bata cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define vec std::vector<int > v;
#define eps 1e-7
#define endl "\n"
#define mp make_pair
#define p_q priority queue
#define dbg(x) cout<<"#x"<<" = "<<x<<endl
#define dbg2(x,y) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define dbg3(x,y,z) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl
#define dbg4(x,y,z,q) cout<<"#x"<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl
#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR_(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
bool cmp(pair<ll,ll>a,pair<ll,ll>b){
return a.f<b.f;
}
bool check(int a){
int sum=0;
while(a>0){
sum+=(a%10);
a/=10;
}
if(sum==10) return true;
return false;
}
void solve()
{
int n;
cin>>n;
string s[2];
cin>>s[0]>>s[1];
int row=0,i;
for(i=0;i<n;i++)
{
if(s[row][i]>='3')
{
if(s[row^1][i]<'3')
{
break;
}
else
{
row=row^1;
}
}
}
if(row==1 && i==n)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
ll power(ll x,ll y)
{
if (y == 0)
return 1;
else if (y % 2 == 0)
return power(x, y / 2) * power(x, y / 2);
else
return x * power(x, y / 2) * power(x, y / 2);
}
int main()
{
fast;
int t=1,x;
while(t--)
{
int n,x;
cin>>n;
vector< pair<int ,int > > v;
for(int i=0;i<n;i++)
{
cin>>x;
v.push_back({x,i});
}
int pos=0,ans=0;
sort(v.begin(),v.end(),cmp);
for(auto it:v)
{
if(it.s%2!=pos%2)
{
ans++;
}
pos++;
}
cout<<ans/2<<endl;
}
time_bata;
return 0;
} | 0 | 31,883,325 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char C;
cin>>C;
cout<<(char)(((int)C)+1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define MAX 250
int heap[MAX+1];
int parent(int i) { return i/2;}
int left(int i) {return 2*i;}
int right(int i){return 2*i + 1;}
int main(){
int H;
scanf("%d", &H);
for(int i=1; i<=H; i++){
scanf("%d", &heap[i]);
}
for(int i=1; i<=H; i++){
printf("node %d: ", i);
printf("key = %d, ", heap[i]);
if(parent(i) > 0){
printf("parent key = %d, ", heap[parent(i)]);
}
if(left(i) <= H) printf("left key = %d, ", heap[left(i)]);
if(right(i) <= H) printf("right key = %d, " , heap[right(i)]);
printf("\n");
}
return 0;
} | 0 | 77,046,461 |
#include<bits/stdc++.h>
using namespace std;
int boo(int x, int y){
if(x%y) return x%y -1;
else return y - 1;
}
char foo(string str,int mk, int i){
char ch, mozi[16] = "00adgjmptw", mozi1[8] = " .,!?";
if(str[mk] - '0' == 1) ch = mozi1[(i - mk)%5];
else if(((str[mk] - '0') == 7) || ((str[mk] - '0') == 9)) ch = mozi[str[mk] - '0'] + boo(i - mk, 4);
else ch = mozi[str[mk] - '0'] + boo(i - mk, 3);
return ch;
}
int main(){
int N, mk, count, temp;
int i, j, k;
string str;
char ch[2000];
cin>>N;
for(i = 0; i < N; i++){
mk=0; count=0;
cin>>str;
for(j = 0; j < (int)str.size(); j++){
if(str[j] == '0'){
if(mk != j)ch[count++] = foo(str, mk, j);
mk = j + 1;
}
}
for(j = 0; j < count; j++) cout<<ch[j];
if(count)cout<<endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
string s;
cin >> s;
int left = 0, right;
int count = 0;
for(right = 1; right < n; right++){
if(s[right-1] == '0' && s[right] == '1')count++;
if(count == k) break;
}
for(; right < n ; right++){
if(right < n-1){
if(s[right] == '1' && s[right+1] == '0') break;
}
}
if(right == n) cout << n << endl;
else{
int max = right+1;
while(right < n-1){
left++;
for(; !(s[left-1] == '0' && s[left] == '1'); left++);
right++;
for(; !(s[right-1] == '0' && s[right] == '1') && right < n; right++);
if(right == n) right--;
for(; right < n-1; right++){
if(s[right] == '1' && s[right+1] == '0') break;
}
if(max < (right - left + 1)) max = right - left + 1;
}
cout << max << endl;
}
} | 0 | 77,695,116 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
int t_before = 0;
int x_before = 0;
int y_before = 0;
REP(i,N){
int t,x,y; cin >> t >> x >> y;
if((t-t_before)%2 == (100000+x+y-x_before-y_before)%2 && abs(x-x_before)+abs(y-y_before) <= t-t_before){
t_before = t;
x_before = x;
y_before = y;
}else{
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
int K;
int num = 1;
cin >> N;
cin >> K;
rep(i, N){
if (num * 2 >= num + K){
num += K;
}
else
{
num *= 2;
}
}
cout << num << endl;
} | 0 | 14,043,393 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
typedef complex<double> P;
double cross(P a, P b) {
return (a.real() * b.imag() - a.imag() * b.real());
}
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
P a(x1, y1), b(x2, y2), c(x3, y3), d(x4, y4);
if (fabs(cross(b - a, d - c)) < EPS) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << (x) << endl;
using ll = long long;
using P = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll N;
std::string S;
int main() {
std::cin >> N >> S;
bool fl = N % 2 == 0;
rep( i, N/2 )
fl &= S[i] == S[i+N/2];
std::cout << (fl ? "Yes" : "No") << endl;
return 0;
} | 0 | 2,580,598 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <random>
using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x)
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0)
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T iabs(const T& x) { return max(x, -x); }
i64 m, k;
int main() {
cin >> m >> k;
if (k >= (1 << m) || (k == 1 && m == 1)) {
cout << -1 << endl;
return 0;
}
if (m == 1 && k == 0) {
cout << "0 0 1 1\n";
return 0;
}
vector<int> a;
for (int i = 0; i < (1 << m); ++i) {
if (i == k) continue;
a.push_back(i);
}
auto b = a;
reverse(begin(b), end(b));
for (int x : a) cout << x << ' ';
cout << k << ' ';
for (int x : b) cout << x << ' ';
cout << k << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main () {
string S[2];
cin >> S[0] >> S[1];
int S_[2][200001];
int N = (int)S[1].size();
for (int i = 0; i < 2; i ++) {
string a = "";
for (int j = 0; j < N; j ++) {
int n = a.size();
int p = 0;
while (p < n && a[p] != S[i][j]) p ++;
S_[i][j] = p;
if (p == n) a += S[i][j];
}
}
for (int i = 0; i < N; i ++) {
if (S_[0][i] != S_[1][i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | 0 | 41,718,157 |
#pragma optimize("unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define Max(a,b,c) max(a,max(b,c))
#define Min(a,b,c) min(a,min(b,c))
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define pc(x) __builtin_popcount (x)
#define vl vector< ll >
#define sorts(v) sort(v.begin(),v.end())
#define sortg(v) sort(v.begin(),v.end(),greater<ll>())
#define ss second
#define ff first
#define ll long long
#define ld long double
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1e18)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod 1000000007
#define mem(x,y) memset(x,y,sizeof(x))
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
#define flush fflush(stdout)
#define gcd __gcd
#define primeDEN 727999983
#define nx_pe next_permutation(s.begin(),s.end())
#define cl cout<<"\n"
#define sp(x) setprecision(x)
const ll N=105,M=100005;
ll n,k;
ll a[N];
ll dp[N][M];
ll pre[N][M];
ll dp1[N][M];
void solve()
{
cin>>n>>k;
f(i,1,n+1)cin>>a[i];
rep(i,n+1)dp[i][0]=1;
rep(i,n+1)
{
pre[i][0]=dp[i][0];
}
f(j,1,k+1)
{
pre[0][j]=dp[0][j]%mod+pre[0][j-1]%mod;
pre[0][j]%=mod;
}
f(i,1,n+1)
{
f(j,1,k+1)
{
ll x=min(a[i],j);
ll sum=pre[i-1][j]%mod;
if(j-x-1>=0)
sum=sum%mod-pre[i-1][j-x-1]%mod+mod;
sum%=mod;
dp[i][j]=dp[i][j]%mod+sum%mod;
dp[i][j]%=mod;
}
f(j,1,k+1)
{
pre[i][j]=pre[i][j-1]%mod+dp[i][j]%mod;
pre[i][j]%=mod;
}
}
cout<<dp[n][k];
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin) ;
freopen("ouput.txt", "w", stdout) ;
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL) ; cout.tie(NULL) ;
std::ios::sync_with_stdio(false);
ll te=1;
while(te--){
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main()
{
int n, m;
cin >> n >> m;
vector<string> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= m; j++)
{
if (i == 0 || j == 0)
{
dp[i][j] = 0;
}
else if (i == 1 && j == 1)
{
dp[i][j] = 1;
}
else if (v[i - 1][j - 1] == '.')
{
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
if (dp[i][j] >= mod)
{
dp[i][j] -= mod;
}
}
else
{
dp[i][j] = 0;
}
}
}
cout << dp[n][m] << '\n';
} | 0 | 59,516,073 |
#include <stdio.h>
int main()
{
int W,H,ans;
char map[100][100];
scanf("%d %d",&W,&H);
while(W != 0 && H != 0){
for(int i = 0; i < H; i++){
scanf("%s",map[i]);
}
for(int i = 0; i < 1000; i++){
for(int j = 0; j < H - 1; j++){
for(int k = 0; k < W; k++){
if((map[j][k] == '.' && map[j + 1][k] == '@') || (map[j][k] == '@' && map[j + 1][k] == '.')){
map[j][k] = '@';
map[j + 1][k] = '@';
}
}
}
for(int j = 0; j < H; j++){
for(int k = 0; k < W - 1; k++){
if((map[j][k] == '.' && map[j][k + 1] == '@') || (map[j][k] == '@' && map[j][k + 1] == '.')){
map[j][k] = '@';
map[j][k + 1] = '@';
}
}
}
}
ans = 0;
for(int j = 0; j < H; j++){
for(int k = 0; k < W; k++){
if(map[j][k] == '@'){
ans++;
}
}
}
printf("%d\n",ans);
scanf("%d %d",&W,&H);
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 1000000007;
int main(){
int n;
cin >> n;
int p[n];
for(int i=0;i<n;i++) cin >> p[i];
int mi[n];
mi[0]=p[0];
for(int i=1;i<n;i++){
if(mi[i-1]>=p[i]){
mi[i]=p[i];
}else{
mi[i]=mi[i-1];
}
}
int counter=0;
for(int i=0;i<n;i++){
if(p[i]<=mi[i]) counter++;
}
cout << counter << endl;
} | 0 | 93,431,699 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char b;
cin >> b;
if(b=='A') cout << "T" << endl;
else if(b=='T') cout << "A" << endl;
else if(b=='C') cout << "G" << endl;
else if(b=='G') cout << "C" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
ll N;
ll ans = 0;
vector<ll>v;
cin >> N;
for (int k = 1; k < (double)sqrt(N); k++) {
if (N % k == 0) {
ll m = N/k - 1;
if (m > k) {
ans += m;
}
}
}
cout << ans << endl;
} | 0 | 53,462,030 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define UB upper_bound
#define LB lower_bound
#define PB push_back
#define mp make_pair
#define F first
#define S second
#define be(a) (a).begin(),(a).end()
#define deb(x) cout<< #x <<" "<<endl;
#define deb2(x, y) cout<< #x <<" "<< x <<endl<< #y <<" "<<y<<endl
#define fo(i, n) for(long long i=0; i<n; i++)
#define Fo(i, n, k) for(long long i=k; i<n; i++)
#define mod 1000000007
#define int long long
typedef long long ll;
void fileIO()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
typedef vector<pair<int, int>> vll;
typedef unordered_map<int, int> ump;
bool sortbysecdesc(const pair<int, int> &a,
const pair<int, int> &b)
{
return a.second>b.second;
}
void add_self(int &a, int b)
{
a += b;
if(a >= mod) a -= mod;
}
void sub_self(int &a, int b)
{
a -= b;
if(a < 0) a += mod;
}
int countWays(vector<int> a, int n, int k)
{
vector<vector<int>> dp(n+1, vector<int>(k+1, 0));
for(int i = 0; i<=n; i++) dp[i][0] = 1;
for(int i = 1; i<=n; i++)
{
vector<int> prefix(k+1);
prefix[0] = dp[i-1][0];
for(int in = 1; in<=k; in++)
prefix[in] = ((prefix[in-1]%mod) + (dp[i-1][in]%mod))%mod;
for(int j = 1; j<=k; j++)
{
int index = j - min(a[i-1], j);
if(index == 0) add_self(dp[i][j], prefix[j]);
else
{
dp[i][j] += (prefix[j] + mod - prefix[index-1])%mod;
}
}
}
return dp[n][k];
}
int32_t main()
{
IOS;
fileIO();
int T;
T = 1;
while(T--)
{
int n, k;
cin>>n>>k;
vector<int> a(n);
for(int i = 0; i<n; i++)cin>>a[i];
cout<<countWays(a, n, k)<<"\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i = 0;i < n;i++)
#define all(x) x.begin(),x.end()
#define dup(x,y) (x + y - 1)/y
#define sz(v) (int)v.size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> bool chmin(T& a,T b){if(a>b){a=b;return 1;}else return false;}
template<class T> bool chmax(T& a,T b){if(a<b){a=b;return 1;}else return false;}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int64_t m,k;cin >> m >> k;
if(k >= (1LL << m)){
cout << -1 << '\n';
return 0;
}
if(m == 0){
cout << "0 0" << '\n';
return 0;
}else if(m == 1){
if(k == 1){
cout << -1 << '\n';
}else{
cout << "0 0 1 1" << '\n';
}
}else{
REP(i,(1LL << m))if(i != k)cout << i << ' ';
cout << k << ' ';
REP(i,(1LL << m))if((1LL << m) - 1 - i != k)cout << (1LL << m) - 1 - i << ' ';
cout << k << '\n';
}
} | 0 | 64,735,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.