code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
ll s;
cin>>s;
int mi=1000;
while(s>=100){
mi=min(mi,abs(753-int(s%1000)));
s/=10;
}
cout<<mi<<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main() {
string s;
cin>>s;
int minv=1000000005;
size_t l=s.length();
rep(i,l-2){
string ss=s.substr(i,3);
int num=stoi(ss);
minv=min(minv,abs(num-753));
}
cout<<minv<<"\n";
return 0;
} | 1 |
#include <stdio.h>
int main() {
char S[30];
scanf("%[^\n]", S);
S[3] = '8';
printf("%s", S);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char s[6];
cin >> s;
for(int i=0;i<5;i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout << "Yes";
return 0;
}
}
cout << "No";
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=17;
const int INF=0x3f3f3f3f;
ll n,m,conn[MAX][MAX],dist[MAX][MAX],dp[MAX][1<<MAX],visit[MAX][1<<MAX],calc[1<<MAX],trk[MAX],ans;
void calc_build(ll x,ll v,ll idx){
//printf("%lld %lld %lld\n",x,v,idx);
if(idx>=n) {
calc[x]=v;
return;
}
calc_build(x,v,idx+1);
trk[idx]=1;
for(ll i=0;i<idx;i++) if(trk[i]) v+=dist[i][idx];
calc_build(x+(1<<idx),v,idx+1);
trk[idx]=0;
}
ll dp_build(ll x,ll bit){
if(x==n-1) return dp[x][bit]=calc[bit];
if(visit[x][bit]==0){
visit[x][bit]=1;
dp[x][bit]=-INF;
for(ll i=0;i<n;i++) if(((1<<i)&bit)&&conn[i][x]){
ll cmp[MAX],cmp_cnt=0;
for(ll j=0;j<n-1;j++) if(((1<<j)&bit)&&i!=j&&x!=j) cmp[cmp_cnt++]=j;
for(ll j=0;j<(1<<(cmp_cnt));j++){
ll g1=1<<x,g2;
for(ll k=0;k<cmp_cnt;k++) if((1<<k)&j) g1+=(1<<cmp[k]);
g2=bit-g1;
dp[x][bit]=max(dp[x][bit],calc[g1]+dp_build(i,g2)+dist[x][i]);
}
}
}
return dp[x][bit];
}
int main()
{
scanf("%lld%lld",&n,&m);
for(ll i=0;i<m;i++){
ll t1,t2,t;
scanf("%lld%lld%lld",&t1,&t2,&t);
t1--,t2--;
conn[t1][t2]=1,dist[t1][t2]=t;
conn[t2][t1]=1,dist[t2][t1]=t;
ans+=t;
}
calc_build(0,0,0);
printf("%lld\n",ans-dp_build(0,(1<<n)-1));
}
| #include <bits/stdc++.h>
#define N 20
#define M (1 << 15 | 5)
#define ll long long
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
int mp[N][N], inc[M], cot[M][N], dp[M][N];
int main(int argc, char const *argv[]) {
int n = read(), m = read();
for (int i = 1; i <= m; i++) {
int x = read() - 1, y = read() - 1;
mp[x][y] = mp[y][x] = read();
}
int tot = 1 << n;
for (int i = 0; i < tot; i++)
for (int a = 0; a < n; a++) if (i >> a & 1)
for (int b = 0; b < a; b++) if (i >> b & 1)
if (mp[a][b]) inc[i] += mp[a][b];
for (int i = 0; i < tot; i++)
for (int a = 0; a < n; a++) if (~ i >> a & 1)
for (int b = 0; b < n; b++) if (i >> b & 1)
if (mp[a][b]) cot[i][a] += mp[a][b];
memset(dp, -1, sizeof dp);
dp[1][0] = 0;
for (int i = 0; i < tot; i++) {
for (int a = 0; a < n; a++) {
if ((i >> a & 1) && ~ dp[i][a]) {
for (int b = 0; b < n; b++) if (~ i >> b & 1)
if (mp[a][b]) dp[i | (1 << b)][b] = max(dp[i | (1 << b)][b], dp[i][a] + mp[a][b]);
int lst = tot - 1 - i;
for (int j = lst; j; j = (j - 1) & lst) {
int now = inc[j] + cot[j][a];
dp[i | j][a] = max(dp[i | j][a], dp[i][a] + now);
}
}
}
}
printf("%d\n", inc[tot - 1] - dp[tot - 1][n - 1]);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0){
if(str.at(i)=='E'){e.at(i)=1;w.at(i)=0;counte++;}
else{e.at(i)=0;w.at(i)=1;countw++;}
}
else{
if(str.at(i)=='E'){e.at(i)=e.at(i-1)+1;w.at(i)=w.at(i-1);counte++;}
else{e.at(i)=e.at(i-1);w.at(i)=w.at(i-1)+1;countw++;}
}
}
ll ans;
for(ll i=0;i<(ll)str.size();i++){
if(i==0){ans=counte-e.at(0);}
else if(i==(ll)str.size()-1){ans=min(ans,w.at(i));}
else{ans=min(ans,w.at(i-1)+counte-e.at(i));}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
int sum = 0;
int best = 1e8;
rep (i, n) {
int x = l + i;
sum += x;
if (abs(best) > abs(x)) {
best = x;
}
}
sum -= best;
println(sum)
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll N,M;
cin >> N >> M;
auto A = InputVec2d(N,M);
vector<bool> b(M);
for (int i = 0; i < M; ++i) {
b[i] = true;
}
ll m = N;
for (int i = 0; i < M; ++i) {
vector<ll> bucket(M);
for (int ni = 0; ni < N; ++ni) {
for (int mi = 0; mi < M; ++mi) {
if(b[A[ni][mi]-1]){
bucket[A[ni][mi]-1]++;
break;
}
}
}
ll del = -1;
for (int j = 0; j < M; ++j) {
if(b[j]){
if(del == -1){
del = j;
}
if(bucket[j] >= bucket[del]){
del = j;
}
}
}
m = min(m,bucket[del]);
b[del] = false;
}
cout << m << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
int n,m,A[301][301],B[301][301];
cin>>n>>m;
rep(i,n)rep(j,m) cin>>A[i][j],B[i][A[i][j]]=j+1;
int num[301],ans=n;
rep(i,m) num[i+1]=1;
rep(i,m){
int C[301]={0};
rep(j,n){
int a=m,b;
rep(k,m) if(num[k+1]){
if(a>=B[j][k+1]) a=B[j][k+1],b=k+1;
}
C[b]++;
}
int a=0,b;
rep(j,m) if(a<=C[j+1]) a=C[j+1],b=j+1;
ans=min(ans,a),num[b]--;
}
cout<<ans<<"\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n);
set<ll> st;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
st.emplace(a[i]);
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
int m = a.size();
vector<ll> c(m);
for (int i = 0; i < m; i++) {
c[i] = mp[a[i]];
}
vector<vector<int>> g(m);
for (int i = 0; i < m; i++) {
for (ll x = 2; x < 2e9; x <<= 1) {
int j = lower_bound(a.begin(), a.end(), x - a[i]) - a.begin();
if (j < i && a[i] + a[j] == x) {
g[i].emplace_back(j);
g[j].emplace_back(i);
}
}
}
debug(a);
debug(c);
debug(g);
ll ans = 0;
vector<bool> was(m);
function<void(int)> dfs = [&](int v) {
ll t = 0;
for (int to : g[v]) {
if (was[to]) {
continue;
}
was[to] = true;
dfs(to);
t += c[to];
}
if (t >= c[v]) {
ans += c[v];
c[v] = 0;
} else {
ans += t;
c[v] -= t;
}
};
for (int i = 0; i < m; i++) {
if (!was[i] && __builtin_popcount(a[i]) == 1) {
was[i] = true;
dfs(i);
ans += c[i] / 2;
}
}
for (int i = 0; i < m; i++) {
if (!was[i]) {
was[i] = true;
dfs(i);
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int max_n = 2e5 + 5;
int tab[max_n];
map<int, int> zliczanie;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, wynik = 0;
cin >> n;
for (int i = 0; i < n; i++){
cin >> tab[i];
zliczanie[tab[i]]++;
}
sort(tab, tab + n);
for (int i = n - 1; i >= 0; i--){
if (!zliczanie[tab[i]])
continue;
zliczanie[tab[i]]--;
if (zliczanie[(2 << __lg(tab[i])) - tab[i]]){
zliczanie[(2 << __lg(tab[i])) - tab[i]]--;
wynik++;
}
}
cout << wynik << "\n";
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
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 main(){
ll n,m,v,p;cin>>n>>m>>v>>p;
ll t=m*v;
vl a(n);
rep(i,n)cin>>a[i];
sort(all(a));
int r=n-1,l=0;
while(r-l>1){
int mid=(r+l)/2;
ll sum=(mid+1)*m,now=a[mid]+m;
if(now<a[n-p]){
l=mid;
continue;
}
for(int i=mid+1;i<=n-p;++i){
sum+=now-a[i];
}
if(sum+(p-1)*m<t){
l=mid;
}
else{
r=mid;
}
}
ll ans=r;
ll sum=(l+1)*m,now=a[l]+m;
if(now>=a[n-p]){
for(int i=l+1;i<=n-p;++i){
sum+=now-a[i];
}
if(sum+(p-1)*m>=t){
ans=l;
}
}
cout<<n-ans<<endl;
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#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;
signed main(void)
{
ll n;
cin >>n;
ll x;
cin >>x;
vll a(n);
ll r = 0;
rep(i, n) {
cin >>a[i];
}
Sort(a);
rep(i, n) {
x -= a[i];
if (x < 0) break;
r++;
}
if (x > 0) r--;
mes(r);
}
| 0 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int, int >
#define F first
#define S second
#define int long long int
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define endl '\n'
using namespace std;
const int N=2e5+100;
ll seg[N*4][2];
ll lazy=0;
void upd(ll nod,ll b,ll l,ll r,ll id,ll val){
if (r-l==1){
seg[nod][b]=min(seg[nod][b],val);
return;
}
ll mid=(r+l)/2;
if (mid>id) upd(nod*2,b,l,mid,id,val);
else upd(nod*2+1,b,mid,r,id,val);
seg[nod][b]=min(seg[nod*2][b],seg[nod*2+1][b]);
return ;
}
ll get(ll nod,ll b,ll l,ll r,ll L,ll R){
if (l>=R || L>=r) return (ll)1e15;
if (l>=L && r<=R) return seg[nod][b];
ll mid=(r+l)/2;
return min (get(nod*2,b,l,mid,L,R),get(nod*2+1,b,mid,r,L,R));
}
ll n,a[N],x,y,q;
int32_t main(){
cin >> n >> q >> x >> y;
for (int i=1;i<=q;i++){
cin >> a[i];
}
memset(seg,31,sizeof seg);
a[0]=x;
upd(1,0,1,N,y,-y);
upd(1,1,1,N,y,y);
for (int i=1;i<=q;i++){
ll z=min(get(1,0,1,N,1,a[i])+a[i],get(1,1,1,N,a[i],N)-a[i]);
ll t=abs(a[i]-a[i-1]);
// cout << z << " " << lazy << endl;
z+=lazy;
lazy+=t;
z-=lazy;
upd(1,0,1,N,a[i-1],z-a[i-1]);
upd(1,1,1,N,a[i-1],z+a[i-1]);
}
ll ans=(ll)1e15;
for (int i=1;i<=n;i++){
ll z=get(1,0,1,N,i,i+1);
z+=i;
ll t=get(1,1,1,N,i,i+1);
t-=i;
ans=min(ans,min(z,t));
}
cout << ans+lazy << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, K; scanf("%d %d", &n, &K);
vector<int> a(n);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
int ans = 0;
for(int left = 0; left <= K; left++){
for(int right = 0; right <= K; right++){
if(left + right > min(n, K)) continue;
vector<int> data;
int ans1 = 0;
for(int i = 0; i < left; i++) data.push_back(a[i]), ans1 += a[i];
for(int i = n - 1; i > n - 1 - right; i--) data.push_back(a[i]), ans1 += a[i];
sort(data.begin(), data.end());
for(int i = 0; i < min(K - left - right, left + right); i++) if(data[i] < 0) ans1 -= data[i];
ans = max(ans, ans1);
}
}
printf("%d\n", ans);
} | 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
namespace {
int cnt;
void InsertionSort(vector<int>& A, int g)
{
for (int i = g; i < A.size(); ++i)
{
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
}
void ShellSort(vector<int>& A)
{
int m;
cnt = 0;
vector<int> G;
G.push_back(1);
for (int i = 1; i <= A.size(); ++i)
{
int g = pow(4, i) + 3 * pow(2, i - 1) + 1;
if (g <= A.size()) G.push_back(g);
else { m = i; break; }
}
for (int i = m - 1; i >= 0; --i)
InsertionSort(A, G[i]);
cout << m << endl;
for (int i = m - 1; i >= 0; --i) {
cout << G[i];
i != 0 ? cout << " " : cout << endl;
}
cout << cnt << endl;
for (int i = 0; i < A.size(); ++i)
cout << A[i] << endl;
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; ++i)
cin >> A[i];
ShellSort(A);
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
if (i != 0) {
if (a[i] < a[i - 1]) {
sum += a[i - 1] - a[i];
a[i] += a[i - 1] - a[i];
}
}
}
cout << sum;
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
string Caesar(string a) {
for (int b = 0; b < a.length(); b++) {
if (a[b] == 'z')a[b] = 'a';
else if (a[b] >= 'a'&&a[b] < 'z')a[b] = a[b] + 1;
}
return a;
}
int main()
{
string a;
while (getline(cin, a)) {
for (int b = 0; b < 26; b++) {
a=Caesar(a);
for (int c = 0; c < a.length() - 4; c++) {
if (a[c] == 't'&&a[c + 1] == 'h') {
if (a[c + 2] == 'e') { cout << a << endl; goto l; }
else if (a[c + 2] == 'a'&&a[c + 3] == 't') { cout << a << endl; goto l; }
else if (a[c + 2] == 'i'&&a[c + 3] == 's') { cout << a << endl; goto l; }
}
}
if(a[a.length()-1]=='t'&&a[a.length() - 2] == 'h'&&a[a.length() - 3] == 'e') { cout << a << endl; break; }
l:;
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
while(getline(cin,s)){t=s;
for(int i=0;i<26;i++){
s=t;
for(int j=0;j<s.size();j++){
if(s[j]>='a'&&s[j]<='z')for(int k=0;k<i;k++){
s[j]++;
if(s[j]>'z')s[j]-=26;
}
}
if((s.find("the")!=s.npos||s.find("this")!=s.npos||s.find("that")!=s.npos))break;
}
cout<<s<<endl;}
} | 1 |
#include <bits/stdc++.h>
#define DEBUG
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll read(){
char c=getchar();bool flag=0;ll x=0;
while(c<'0'||c>'9'){if(c=='-')flag=1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return flag?-x:x;
}
#define N 2010
const ll p=1e9+7;
ll dp[N][N],fac[N*N],inv[N*N];
ll fpow(ll a,ll x){
ll ans=1;
while(x){
if(x&1) ans=ans*a%p;
a=a*a%p,x=x/2;
}
return ans;
}
ll Cnt(ll n,ll m){
return fac[m]*inv[n]%p*inv[m-n]%p;
}
int main(){
ll n=read(),k=read();
if(k==1){
printf("1");
return 0;
}
fac[0]=1;
for(ll i=1;i<=n*k;i++) fac[i]=fac[i-1]*i%p;
inv[n*k]=fpow(fac[n*k],p-2);
for(ll i=n*k-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%p;
for(ll i=1;i<=n;i++) dp[i][0]=1;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=i;j++){
dp[i][j]=dp[i-1][j]+dp[i][j-1]*(n-(j-1))%p*Cnt(k-2,n*k-i-(j-1)*(k-1)-1)%p;
dp[i][j]%=p;
}
}
printf("%lld",dp[n][n]);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
const ll MOD = 1e9+7;
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//freopen("in.txt", "r", stdin);
int n, m;
cin >> n >> m;
map<int, int> y;
map<int, int> x;
rep(i,0,n) {
int a;
cin >> a;
y[a] = i;
}
rep(i,0,m) {
int b;
cin >> b;
x[b] = i;
}
ll ret = 1;
ll A = 0;
ll B = 0;
per(i,1,n*m+1) {
bool flagy = (y.find(i) != y.end());
bool flagx = (x.find(i) != x.end());
if(flagy && flagx) {
A++; B++;
} else if(flagy) {
ret = ret * B % MOD;
A++;
} else if(flagx) {
ret = ret * A % MOD;
B++;
} else {
ll loc = A * B - (ll)(n*m - i);
ret = ret * loc % MOD;
}
}
cout << ret << '\n';
} | 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
// 多倍長
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const double PI = acos(-1);
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int a,b;
cin >> a >> b;
string s;
cin >> s;
if((int)s.size() != a + b + 1){
cout << "No" << endl;
return 0;
}else if(s[a] != '-'){
cout << "No" << endl;
return 0;
} else if(count(s.begin(), s.end(), '-') != 1) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for(int i = 0; i < N; i++) {
// cout << A.at(i) << endl;
}
for(int i = 0; i < N-1; i++) {
if(A.at(i) == A.at(i+1)) {
cout << "NO" << endl;
break;
}
else if(i == N-2) cout << "YES" << endl;
}
} | 0 |
#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);
static const int INF = 1e9+7;
//debug
#ifdef _DEBUG
#define debug(var) do{cout << #var << " :";view(var);}while(0)
#else
#define debug(...)
#endif
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
//左端がリーダの時，向きを変える必要がある人をcount
REP(i,n){
if(i == 0) continue;
if(s[i] == 'E') cnt++;
}
int ans = cnt;
//リーダを左から順にずれしていく
REP(i,n){
if(i == 0) continue;
if(s[i-1] == 'W') cnt++;
if(s[i] == 'E') cnt--;
ans = min(ans,cnt);
}
cout << ans << endl;
return 0;
} | //pragma
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define YOU using
#define DONT namespace
#define SAY std
YOU DONT SAY;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define REPP(i,a,b,d) for(int i=a;i<=b;i+=d)
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=a;i>=b;i-=d)
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<a; i++)
#define FORD(i,a) for(int i=(int)a-1; i>=0; i--)
#define pb push_back
#define F first
#define S second
const int OO = 1e9;
const ll INF = 1e18;
const int irand(int lo,int hi){
return ((double)rand()/(RAND_MAX + 1.0)) * (hi-lo+1) + lo;
}
const ll lrand(ll lo,ll hi){
return ((double)rand()/(RAND_MAX + 1.0)) * (hi-lo+1) + lo;
}
#define getc getchar
template<typename T>
T getnum(){
int sign = 1;
T ret = 0;
char c;
do{
c = getc();
}while(c == ' ' || c == '\n');
if(c == '-')sign = -1;
else ret = c-'0';
while(1){
c = getc();
if(c < '0' || c > '9')break;
ret = 10*ret + c-'0';
}
return sign * ret;
}
inline void ini(int& x){
x = getnum<int>();
}
inline void scani(int& x){
scanf("%d",&x);
}
//end of macro
const ll MOD = 1e9 + 7;
inline ll addmod(ll a, ll b){
if(a+b<MOD)return a+b;
return a+b-MOD;
}
inline ll mulmod(ll a, ll b){
return (a*b)%MOD;
}
inline ll expmod(ll a, ll e){
ll ret = 1;
while(e){
if(e&1)ret = mulmod(ret, a);
a = mulmod(a, a);
e >>= 1;
}
return ret;
}
inline ll divmod(ll a, ll b){
return mulmod(a, expmod(b, MOD-2));
}
const int N = 2e5 + 5;
int fac[N];
inline int C(int n, int r){
return divmod(fac[n], mulmod(fac[r], fac[n-r]));
}
int h,w,a,b;
inline int ways(int x1, int y1, int x2, int y2){
int x = x2-x1;
int y = y2-y1;
return C(x+y, x);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define endl '\n'
cout.setf(ios::fixed);
cout.setf(ios::showpoint);
cout.precision(10);
fac[0] = 1;
REP(i,1,N-1)fac[i] = mulmod(fac[i-1], i);
cin>>h>>w>>a>>b;
int ans = 0;
int i = h - a;
REP(j,b+1,w){
ans = addmod(ans, mulmod(ways(1, 1, i, j), ways(i+1, j, h, w)));
}
cout << ans << endl;
return 0;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
int main() {
int N;
std::cin >> N;
std::vector<int>sum(N), sort(N);
for (int i = 0; i < (N - 1)*N / 2; i += 1) {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
if (c > d) {
sum[a - 1] += 3;
}
else if (d > c) {
sum[b - 1] += 3;
}
else {
sum[a - 1] += 1;
sum[b - 1] += 1;
}
}
for (int i = 0; i < N; i += 1)
sort[i] = sum[i];
std::sort(sort.begin(), sort.end());
for (int i = 0; i < N; i += 1)
for (int j = N-1; j >= 0; j -= 1) {
if (sum[i] == sort[j]) {
std::cout << N-j << std::endl;
break;
}
}
return 0;
} | #include<stdio.h>
int main(void)
{
int n,m,i,j,q,a[5000],b[5000],c[5000],d[5000],s[500],z[500];
scanf("%d",&n);
m=n*(n-1)/2;
for(i=1;i<=m;i++){
scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
}
for(j=1;j<=n;j++){
s[j]=0;
z[j]=1;
}
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
if(j==a[i]){
if(c[i]>d[i]){
s[j]+=3;
}
else if(c[i]==d[i]){
s[j]+=1;
}
}
if(j==b[i]){
if(c[i]<d[i]){
s[j]+=3;
}
else if(c[i]==d[i]){
s[j]+=1;
}
}
}
}
for(j=1;j<=n;j++){
for(q=1;q<=n;q++){
if(s[j]<s[q]){
z[j]++;
}
}
printf("%d\n",z[j]);
}
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
int main() {
using ull = unsigned long long;
ull ans[50];
ull k;
cin >> k;
cout << 50 << endl;
ull j = k / 50;
int i = k % 50;
for (auto &x : ans) {
x = 49 + j;
}
for (int a = 0; a < i; ++a) {
ans[a] += 51;
}
for (auto &x : ans) {
x -= i;
cout << x << " ";
}
} | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
ll k;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k;
int n = 50;
vector <ll> a(n);
for(int i = 0 ; i < n ; i++){
a[i] = i;
}
ll f = k / n;
for(auto &i : a) i += f * n;
for(auto &i : a) i -= f * (n - 1);
for(int itt = 0 ; itt < k % n ; itt++){
int mn = 0;
for(int j = 0 ; j < n ; j++){
if(a[j] < a[mn]) mn = j;
}
for(int j = 0 ; j < n ; j++){
if(j == mn) a[j] += n;
else a[j]--;
}
}
cout << n << endl;
for(auto &i : a) cout << i << " ";
cout << endl;
}
| 1 |
#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() {
int A,B,C;
cin>>A>>B>>C;
if((A-C)*(B-C)<=0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int a,b,c;
cin>>a>>b>>c;
Yes((a-c)*(b-c)<0);
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v) out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010
/* Zalgorithm */
// A[i] := S と S[i:|S|-1] の最長共通接頭辞の長さ
void Zalgorithm(const char *S, int *A) {
int i = 1, j = 0, k, n = strlen(S);
A[0] = n;
while (i < n) {
while (i + j < n && S[j] == S[i + j]) j++;
A[i] = j;
if (j == 0) {
i++;
continue;
}
for (k = 1; i + k < n && k + A[k] < j; k++) A[i + k] = A[k];
i += k;
j -= k;
}
}
int N, A[SIZE], B[SIZE];
int z[30][SIZE*5];
char S[30][SIZE*5];
int main() {
scanf("%d", &N);
for (int i=0; i<N; i++) scanf("%d", A+i);
for (int i=0; i<N; i++) scanf("%d", B+i);
for (int i=0; i<N*5; i++) {
int tmp;
if (i < N)
tmp = B[i];
else if (i < N*3)
tmp = A[i%N];
else
tmp = A[i%N] ^ ((1 << 30) - 1);
for (int j=0; j<30; j++) {
S[j][i] = tmp % 2 + 1;
tmp /= 2;
}
}
for (int i=0; i<30; i++)
Zalgorithm(S[i], z[i]);
for (int i=0; i<N; i++) {
int b = A[i] ^ B[0];
bool ok = true;
for (int j=0; j<30; j++) {
if (b & (1 << j)) {
ok &= z[j][i+N*3] >= N;
} else {
ok &= z[j][i+N] >= N;
}
}
if (ok) {
printf("%d %d\n", i, b);
}
}
return 0;
}
| #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >>n;
cin.ignore();
while(n--){
string word;
getline(cin,word);
string::size_type index;
for(;;){
index = word.find("Hoshino");
if(index == string::npos){break;}
word[index+6] = 'a';
}
cout <<word<<endl;
}
return 0;
} | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int MAXN = 305;
int n,k,ans;
int f[2][MAXN][MAXN];
char s[MAXN];
int main()
{
scanf("%s",s + 1);
n = strlen(s + 1);
scanf("%d",&k);
for (int i = 0;i <= k;i++)
{
memcpy(f[i & 1],f[~i & 1],sizeof(f[i & 1]));
for (int j = 1;j <= n;j++)
for (int k = n;k >= j + 1;k--)
{
if (s[j] == s[k])
f[i & 1][j][k] = max(f[i & 1][j][k],f[i & 1][j - 1][k + 1] + 1);
else if (i)
f[i & 1][j][k] = max(f[i & 1][j][k],f[~i & 1][j - 1][k + 1] + 1);
f[i & 1][j][k] = max(f[i & 1][j][k],f[i & 1][j - 1][k]);
f[i & 1][j][k] = max(f[i & 1][j][k],f[i & 1][j][k + 1]);
}
}
for (int i = 0;i <= n;i++)
ans = max(ans,f[k & 1][i][i + 1] * 2);
for (int i = 1;i <= n;i++)
ans = max(ans,f[k & 1][i - 1][i + 1] * 2 + 1);
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#define FOR(i, a, b) for(ll i = (ll)a;i < (ll)b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(ll i = (ll)b-1LL;i >= (ll)a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define SIGN(a) (a==0?0:(a>0?1:-1))
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<ld,ld> pdd;
const ll INF=(1LL<<50);
#if __cplusplus<201700L
ll gcd(ll a, ll b) {
if(a < b) return gcd(b, a);
ll r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
#endif
template<class T>
bool chmax(T& a,const T& b){
if(a<b){
a=b;
return true;
}
return false;
}
template<class T>
bool chmin(T& a,const T& b){
if(a>b){
a=b;
return true;
}
return false;
}
template<class S,class T>
std::ostream& operator<<(std::ostream& os,pair<S,T> a){
os << "(" << a.first << "," << a.second << ")";
return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,vector<T> a){
os << "[ ";
REP(a.size()){
os<< a[i] << " ";
}
os<< " ]";
return os;
}
const long long MOD = 1000000007;
const long long max_cache=1000000;
long long cache_fact[max_cache],cache_inv_fact[max_cache];
long long combination_cached(long long n,long long r){
ll m=MOD;
if(r<0||r>n)return 0;
if(r==0||r==n)return 1;
if(n>m){
std::cerr<<"Combination Error: n is greater than m"<<std::endl;
exit(1);
}
static bool cached=false;
if(cached==false){
cached=true;
cache_inv_fact[1]=1;
for (long long i = 2; i < max_cache; i++) {
cache_inv_fact[i]=(m-m/i)*cache_inv_fact[m%i]%m;
}
for (long long i = 2; i < max_cache; i++){
cache_inv_fact[i]=cache_inv_fact[i]*cache_inv_fact[i-1]%m;
}
cache_fact[0]=1;
for (long long i = 1; i < max_cache; i++) {
cache_fact[i]=cache_fact[i-1]*i%m;
}
}
r=min(r,n-r);
return cache_fact[n]*cache_inv_fact[r]%m*cache_inv_fact[n-r]%m;
}
void solve(long long N, long long M, long long K){
ll ans=0;
For(i,N){
For(j,M){
ans=(ans+(i+j)*combination_cached(N*M-2,K-2)%MOD*(N-i)%MOD*(M-j)%MOD)%MOD;
if(i>0&&j>0){
ans=(ans+(i+j)*combination_cached(N*M-2,K-2)%MOD*(N-i)%MOD*(M-j)%MOD)%MOD;
}
}
}
cout<<ans<<endl;
}
int main(){
cout<<setprecision(1000);
long long N;
scanf("%lld",&N);
long long M;
scanf("%lld",&M);
long long K;
scanf("%lld",&K);
solve(N, M, K);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
//素因数分解
void primeFactorization(uint64_t a, list<uint64_t> &factors){ //素因数分解を出力するプログラム
long i,sq;
if(a%2==0){ //偶数の場合
factors.push_back(2);
primeFactorization(a/2,factors); //2で割った値で再帰
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){ //3以上√a以下の奇数の場合
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors); //割れた値で再帰
return;
}
}
//偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if(a!=1){ //aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
/*
//エラトステネスのふるい
int maxNum = 100000;
char isNotPrime[maxNum+1] = {};
isNotPrime[0]=isNotPrime[1]=1;
for(int i=2;i<maxNum;i++){
if(isNotPrime[i]==1) continue;
int num = i+i;
while(num<=maxNum){
isNotPrime[num]=1;
num += i;
}
}
*/
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
// 降順ソート vector<int> v;
// sort(v.begin(),v.end(),greater<int>());
signed main() {
ull n;
cin >> n;
ull a = 0;
for(ull i=sqrt(n);i>=1;i--){
if(n%i==0){
a = i;
break;
}
}
if(a==1){
a = n;
}
if(a<n/a){
a = n/a;
}
//cout << a << ":" << n/a << endl;
int count = 0;
while(a>0){
a /= 10;
count++;
}
cout << count << endl;
return 0;
}
| #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int f(ll a,ll b)
{
return (int)max(log10(a),log10(b));
}
int main()
{
ll N;
cin>>N;
int ans=10;
for(int i=1;i<sqrt(N)+1;i++)
{
if(N%i!=0) continue;
ll k=N/i;
int v=f(i,k);
ans=min(ans,v);
}
cout<<ans+1<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
bool isprime(int num)
{
for(int i = 2; i*i <=num; i++)
{
if(num%i==0)
{
return false;
}
}
return true;
}
int main()
{
int n;cin >> n;
vector<int> a(n);
int counter = 0;
int kouho = 6;
while(counter < n)
{
if(isprime(kouho))
{
a[counter] = kouho;
counter++;
}
kouho += 5;
}
rep(i,n)
{
cout << a[i] << " ";
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;} return false;}
typedef pair<int, int> P;
typedef pair<ll,ll> PLL;
double rad(double a) {return a * 180 / PI;}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
//dpTable
int dp[100050];
int main(){
ll N;
cin >> N;
int sqrtN = sqrt(N);
int A,B;
for (int i = sqrtN; i >= 1; i--) {
if (N % i == 0) {
A = i;
B = N / i;
break;
}
}
int cntA = 0,cntB = 0;
while (A != 0) {
A /= 10;
cntA++;
}
while (B != 0) {
B /= 10;
cntB++;
}
cout << max(cntA,cntB) << endl;
return 0;
}
| 0 |
#include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
string s;
int n;
cin>>n;
cin.ignore();
rep(i,n){
getline(cin,s);
int size=s.size();
rep(j,size-6){
string point=s.substr(j,7);
if(point=="Hoshino"){
point="Hoshina";
s.replace(j,7,point);
}
}
cout<<s<<endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,pos;
string s;
while(cin>>n&&n){
getline(cin,s);
while(n--){
getline(cin,s);
while((pos=s.find("Hoshino",0))!=string::npos)
s.replace(pos,7,"Hoshina");
cout<<s<<endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
typedef long long ll;
typedef pair<int, int> P;
const int di[4] = {1,0,-1,0};
const int dj[4] = {0,1,0,-1};
int main() {
int n; cin >> n;
map<string, int> mp;
rep(i,n) {
string s; cin >> s;
mp[s]++;
}
int m; cin >> m;
rep(i,m) {
string t; cin >> t;
mp[t]--;
}
int ans = -10000;
for (auto x : mp) {
chmax(ans, x.second);
}
if (ans >= 0) cout << ans << endl;
else cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int count = 0;
int score = 0;
cin >> N;
vector<string> s(N);
for(int i=0;i<N;i++){
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for(int i=0;i<M;i++){
cin >> t.at(i);
}
for(int i=0;i<N;i++){
count = 0;
for(int j=0;j<N;j++){
if(s.at(i) == s.at(j)) count++;
}
for(int j=0;j<M;j++){
if(s.at(i) == t.at(j)) count--;
}
score = max(score,count);
}
cout << score << endl;
} | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=305;
const int MOD=998244353;
int n,m;
int a[N];
long long f[N][N*N],g[N][N*N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),m+=a[i];
f[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=m;j++)
{
f[i][j]=f[i-1][j]*2%MOD;
if(j>=a[i]) f[i][j]=(f[i][j]+f[i-1][j-a[i]])%MOD;
}
long long ans=1;
for(int i=1;i<=n;i++)
ans=ans*3%MOD;
for(int j=(m+1)/2;j<=m;j++)
ans=(ans-f[n][j]*3%MOD+MOD)%MOD;
if(m%2==0)
{
g[0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=m;j++)
{
g[i][j]=g[i-1][j];
if(j>=a[i]) g[i][j]=(g[i][j]+g[i-1][j-a[i]])%MOD;
}
ans=(ans+g[n][m/2]*3%MOD)%MOD;
}
printf("%lld",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#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 fi first
#define se second
#define pb push_back
#define debug(x) cerr <<__LINE__<< ": " << #x << " = " << x << endl
#define debug_vec(v) cerr<<__LINE__<<": "<<#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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int n;
cin >> n;
vector<int> A(n);
for(auto &a : A) cin >> a;
ll ans = -LINF;
if (n % 2 == 0) {
ll sum = 0;
for (int i = 1; i < n; i+=2) sum += A[i];
chmax(ans, sum);
for (int i = 0; i < n; i+=2){
sum += A[i] - A[i + 1];
chmax(ans, sum);
}
cout << ans << endl;
return;
} else {
n /= 2;
ll dp[n + 1][3];
rep(i, n + 1) rep(j, 3) dp[i][j] = -LINF;
dp[0][0] = dp[0][1] = dp[0][2] = 0LL;
rep(i, n) {
chmax(dp[i + 1][0], dp[i][0] + A[2 * i]);
chmax(dp[i + 1][1], max(dp[i][0], dp[i][1]) + A[2 * i + 1]);
chmax(dp[i + 1][2], max({dp[i][0], dp[i][1], dp[i][2]}) + A[2 * i + 2]);
}
cout << *max_element(dp[n], dp[n] + 3) << endl;
return;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LLP;
bool check(int N, int M, vector<vector<int>> a, int x) {
vector<deque<int>> list(M);
vector<bool> playable(M, true);
vector<deque<int>> A(N);
rep(i,N) rep(j,M) A[i].push_back(a[i][j]);
rep(i,N) {
int k = A[i].front(); A[i].pop_front();
list[k].push_back(i);
}
while (true) {
int flag = -1;
int max_count = x;
rep(i,M) {
if (list[i].size() > max_count) {
flag = i;
max_count = list[i].size();
}
}
if (flag < 0) {
return true;
}
playable[flag] = false;
while (!list[flag].empty()) {
int i = list[flag].front(); list[flag].pop_front();
while (true) {
if (A[i].empty()) return false;
int k = A[i].front(); A[i].pop_front();
if (playable[k]) {
list[k].push_back(i);
break;
}
}
}
}
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N, vector<int>(M));
rep(i,N) rep(j,M) {
cin >> A[i][j];
A[i][j]--;
}
for (int i = 1; i <= N; i++) {
if (check(N, M, A, i)) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define INF (2e9)
const int maxv=10000+10;
const int maxe=100000+10;
int V,E;
int d[maxv];
struct Edge
{
int from,to,cost;
};
Edge es[maxe];
int p[maxv];
int rank[maxv];
bool cmp(const Edge& a,const Edge& b)
{
return a.cost<b.cost;
}
void init(int n)
{
for(int i=0; i<n; i++)
{
p[i]=i;
rank[i]=0;
}
}
int fnd(int x)
{
if(x==p[x]) return x;
return fnd(p[x]);
}
bool is_same(int x,int y)
{
return fnd(x)==fnd(y);
}
void unite(int x,int y)
{
x=fnd(x);
y=fnd(y);
if(x==y) return;
if(rank[x]>rank[y])
{
p[y]=x;
}
else
{
p[x]=y;
if(rank[x]==rank[y]) rank[y]++;
}
}
void kruskal()
{
sort(es,es+E,cmp);
init(V);
int res=0;
for(int i=0; i<E; i++)
{
Edge &e=es[i];
if(!is_same(e.from,e.to))
{
unite(e.from,e.to);
res+=e.cost;
}
}
printf("%d\n",res);
}
int main()
{
// freopen("in.txt","r",stdin);
scanf("%d%d",&V,&E);
int u,v,cost;
for(int i=0; i<E; i++)
{
scanf("%d%d%d",&u,&v,&cost);
es[i].from=u;
es[i].to=v;
es[i].cost=cost;
}
kruskal();
return 0;
} | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,n,ans=0;
cin>>N>>n;
if(n){
puts("-1");
return 0;
}
for(int i=1;i<N;i++){
int a;
cin>>a;
if(n>=a)ans+=a;
else if(n+1==a)ans++;
else{
puts("-1");
return 0;
}
n=a;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end() // 昇順ソート
#define rall(v)(v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second
const int MOD = 1000000007;
template < class T > bool chmax(T & a,const T & b) { if (a < b) { a = b; return true; } return false; }
template < class T > bool chmin(T & a,const T & b) { if (a > b) { a = b; return true; } return false; }
// 任意のlogは 対数の底の変換を使う log(N) / log(任意の底)
int main() {
LL N;cin >> N;
vector<LL> A(N);
rep(i,N)cin >> A[i];
vector<LL> num(N);
rep(i,N){
num[i] = i - A[i];
}
bool ok = true;
if(num[0] != 0)ok = false;
rep(i,N-1){
if(A[i+1] - A[i] > 1)ok = false;
}
if(ok){
LL ans = 0;
rep(i,N){
if(binary_search(all(num),i)){
LL k = upper_bound(all(num),i) - num.begin() - 1;
ans += (k-i);
}
}
cout << ans << endl;
}
else{
cout << -1 << endl;
}
} | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
vector<int> v(3);
v.at(0) = A;
v.at(1) = B;
v.at(2) = C;
sort(v.begin(), v.end());
int n = v.back();
while (K) {
n *= 2;
K--;
}
cout << v.at(0) + v.at(1) + n << endl;
} | #include<iostream>
#include<queue>
#include<utility>
using namespace std;
long int inf=100000*100000+100;
int main()
{
int v,e,r;
int s[500000];
int t[500000];
int d[500000];
long int dis[100000];
cin>>v>>e>>r;
for(int i=0;i<e;i++)
{
cin>>s[i]>>t[i]>>d[i];
}
for(int i=0;i<v;i++)
{
dis[i]=inf;
}
dis[r]=0;
for(int i=0;i<v-1;i++)
{
int end=1;
for(int j=0;j<e;j++)
{
if(dis[t[j]]>dis[s[j]]+d[j])
{
dis[t[j]]=dis[s[j]]+d[j];
end=0;
}
}
if(end==1)
break;
}
for(int i=0;i<v;i++)
{
if(dis[i]==inf)
cout<<"INF"<<endl;
else
cout<<dis[i]<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
for (int i = 1; i <= n; ++i) {
if (i % 3 == 0) {
fprintf(stdout, " %d", i);
}
else {
for (int x = i; x > 0; x /= 10) {
if (x % 10 == 3) {
fprintf(stdout, " %d", i);
break;
}
}
}
}
fprintf(stdout, "\n");
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n;i++) {
if (i % 3 == 0) {
cout << " " << i;
}
else {
for (int j = 0; j < 4;j++) {
int n;
int m;
n = pow(10, j + 1);
m = n / 10;
if (j == 0 && i % n == 3) {
cout << " " << i;
break;
}else if (j != 0 && (i % n) / m == 3) {
cout << " " << i;
break;
}
}
}
}
cout << endl;
//cin >> /*変数他*/;
//cout << /*文字列*/ << endl;
return 0;
}
| 1 |
//khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 1000000 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000010;
const ll LOG = 25;
int n, Ans;
char S[N], T[N];
int bias, que[N], head, tail;
int main() {
cin >> n;
for (int i = 1; i <= n;i++) cin >> S[i];
for (int i = 1; i <= n; i++) cin >> T[i];
int ok = 1;
for (int i = 1; i <= n; ++i) if (S[i] != T[i]) ok = 0;
if (ok) return cout << 0, 0;
head = 1, tail = 0;
for (int i = n, j = n; i >= 1; --i) {
if (j > i) j = i;
while (head <= tail && que[head] + bias > i) ++head;
Ans = std::max(Ans, tail - head + 2);
if (i == 1 || T[i - 1] != T[i]) {
while (j && S[j] != T[i]) --j;
if (!j) return cout << -1, 0;
--bias;
que[++tail] = j - bias;
--j;
}
}
cout << Ans;
return 0;
}
| #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
// #define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
int get(vector<pair<int, int>> have) {
if(len(have) == 0)
return 0;
if(len(have) == 1 && have[0].ft == have[0].sc)
return 0;
int ans = 1;
vector<pair<int, int>> t(len(have));
for (int i = len(have) - 1; i >= 0; i--) {
int l = 0, r = len(have) - i;
while(r - l > 1) {
int m = (l + r) / 2;
if(have[i + m].ft - m >= have[i].sc)
r = m;
else
l = m;
}
ans = max(ans, r);
}
return max(1, ans);
}
signed main() {
#ifdef PC
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s, t;
cin >> s >> t;
map<char, int> was;
vector<int> r(n + 1, -1);
vector<pair<int, int>> have;
for (char c = 'a'; c <= 'z'; c++)
was[c] = -1;
int uk = n;
for (int i = n - 1; i >= 0; i--) {
if(uk > i)
uk--;
while(uk >= 0 && s[uk] != t[i])
uk--;
if(uk == -1) {
cout << -1;
return 0;
}
r[uk] = max(r[uk], i);
}
// for (int i = 0; i < n; i++) {
// while(uk <= i && s[uk] != t[i])
// uk++;
// if(uk > i) {
// cout << -1;
// return -1;
// }
// r[uk] = i;
// }
// for (int i = 0; i < n; i++) {
// was[s[i]] = i;
// if(was[t[i]] == -1) {
// cout << -1;
// return 0;
// }
// r[was[t[i]]] = i;
// }
for (int i = 0; i < n; i++) {
if(r[i] == -1)
continue;
have.pb({i, r[i]});
}
int lr = -1, rr = -1;
vector<pair<int, int>> now;
int ans = 0;
for (int i = 0; i < len(have); i++) {
if(rr < have[i].ft) {
ans = max(ans, get(now));
now.clear();
now.pb(have[i]);
lr = have[i].ft, rr = have[i].sc;
continue;
}
now.pb(have[i]);
lr = have[i].ft, rr = have[i].sc;
}
ans = max(ans, get(now));
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
struct SegmentTree {
int sz;
vector<int> d, m, dm;
SegmentTree(string s) {
int n = (int)(s.size());
sz = 1;
while(sz < n) sz *= 2;
d.clear();
m.clear();
dm.clear();
d.resize(2*sz+1, 0);
m.resize(2*sz+1, 0);
dm.resize(2*sz+1, 0);
for(int i=0;i<n;++i) {
if(s[i] == 'D') {
d[i+sz-1] = 1;
} else if(s[i] == 'M') {
m[i+sz-1] = 1;
}
}
for(int i=sz-2;i>=0;--i) {
d[i] = d[2*i+1] + d[2*i+2];
m[i] = m[2*i+1] + m[2*i+2];
dm[i] = dm[2*i+1] + dm[2*i+2] + d[2*i+1] * m[2*i+2];
}
}
tuple<int, int, int> query(int a, int b, int l, int r, int k) {
if(b <= l || r <= a) return make_tuple(0, 0, 0);
if(a <= l && r <= b) return make_tuple(d[k], m[k], dm[k]);
tuple<int, int, int> v1 = query(a, b, l, (l+r)/2, 2*k+1);
tuple<int, int, int> v2 = query(a, b, (l+r)/2, r, 2*k+2);
int resd = get<0>(v1) + get<0>(v2);
int resm = get<1>(v1) + get<1>(v2);
int resdm = get<2>(v1) + get<2>(v2) + get<0>(v1) * get<1>(v2);
return make_tuple(resd, resm, resdm);
}
tuple<int, int, int> query(int a, int b) {
return query(a, b, 0, sz, 0);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n; cin >> n;
string s; cin >> s;
vector<int> su(n);
su[0] == s[0] == 'M';
for(int i=1;i<n;++i) {
su[i] = su[i-1] + (s[i] == 'M');
}
int q; cin >> q;
for(int i=0;i<q;++i) {
int k; cin >> k;
ll cntd = 0, cntm = 0, now = 0, ans = 0;
for(int j=0;j<k;++j) {
if(s[j] == 'D') {
cntd++;
} else if(s[j] == 'M') {
now += cntd;
} else if(s[j] == 'C') {
ans += now;
}
}
for(int j=k;j<n;++j) {
if(s[j-k] == 'D') {
cntd--;
now -= su[j-1] - su[j-k];
}
if(s[j] == 'D') {
cntd++;
} else if(s[j] == 'M') {
now += cntd;
} else if(s[j] == 'C') {
ans += now;
}
}
cout << ans << endl;
}
}
| #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#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()
using ll = long long;
using P = std::pair<ll, ll>;
using PP = std::pair<P, P>;
constexpr ll INF = 1ll<<60;
constexpr ll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<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 H, W;
std::vector<P> ps;
ll a[510][510];
bool used[510][510];
std::vector<PP> ans;
int main()
{
std::cin >> H >> W;
std::vector<P> ps;
rep( i, H ) rep( j, W )
std::cin >> a[i][j];
ll dir = 1;
ll ci = 0, cj = 0;
while( true ) {
ll ni, nj;
if( (dir==1 && cj == W-1) || (dir==-1 && !cj) ) {
dir *= -1;
ni = ci+1, nj = cj;
} else {
ni = ci, nj = cj+dir;
}
if( used[ni][nj] || ci >= H )
break;
if( (a[ci][cj]&1) && ni < H ) {
--a[ci][cj];
++a[ni][nj];
ans.emplace_back( P( ci+1, cj+1 ), P( ni+1, nj+1 ) );
}
ci = ni;
cj = nj;
}
std::cout << ans.size() << std::endl;
for( auto pp : ans )
printf( "%lld %lld %lld %lld\n", pp.first.first, pp.first.second, pp.second.first, pp.second.second );
return 0;
} | 0 |
#include<bits/stdc++.h>
using ll=long long;
#define rep(i,j,n) for(ll i=(j);i<(n);i++)
#define per(i,n,j) for(ll i=(n);i>=(j);i--)
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 INF=1LL<<60;
ll l,r;
int main(){
cin>>l>>r;
ll ans=INF;
rep(i,l,min(l+2019,r)){
rep(j,l+1,min(l+2020,r+1)){
ll num=(i*j)%2019;
chmin(ans,num);
}
}
/*if(l%2019==0 ||l%2019>=r%2019 || r-l>=2019) ans=0;
else{
ll num;
num=l%2019*(l+1)%2019;
if(num<2019) ans=num;
else ans=num%2019;
}*/
cout<<ans<<"\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main(){
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
ll res = INF;
for (ll i = l; i < r; ++i) {
for (ll j = l+1; j <= r; ++j) {
chmin(res, (i*j) % 2019);
}
}
cout << res << endl;
}
| 1 |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
int in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}
int in() {return in(gcu());}
bool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}
bool scan(char &c){c=gcu();gcu();return c!=EOF;}
//bool scan(string &s){int c;s="";
// for(;;){c=gcu();if(c=='\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}
#define pcu putchar_unlocked
#define vo inline void out
template <typename T>
vo(T n){static char buf[20];char *p=buf;
if(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;
while (p!=buf)pcu(*--p);}
vo(const char *s){while(*s)pcu(*s++);}
vo(char c){pcu(c);}
//vo(string &s){for (char c: s) pcu(c);}
template <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}
//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);out('\n');}
#undef vo
int main() {
for (int e, m; (e = m = in());) {
for (int z = cbrt(e) + 0.00001; z >= 0; z--) {
int te = e - z * z * z;
int y = (int)sqrt(te);
int tm = z + y + te - y * y;
if (y > m)
break;
m = min(m, tm);
}
out(m, '\n');
}
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 28)
template<typename T>
void remove(vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void){
int e;
while (cin >> e, e) {
int min = e;
for (int z=0; z*z*z<=e; z++) {
for (int y=0; y*y<=e-z*z*z; y++) {
int x = e - z*z*z - y*y;
if (x + y + z < min) { min = x + y + z; }
}
}
cout << min << endl;
}
return 0;
}
int StrToInt(string s){
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i){
stringstream ss;
ss << i;
return ss.str();
} | 1 |
#include<stdio.h>
#include<iostream>
#include <algorithm>
#include <functional>
#include <array>
using namespace std;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
//void margesort(int a[], int a_len, int left, int right);
//void margesortD(int a[], int b[], int a_len, int left, int right);
//int temp[100000];
//int tempb[100000];
//int b[100000];
//int c[100000];
int main() {
/*
int a, b;
cin >> a;
cin >> b;
if (a <= 5) {
cout << 0;
}
else if (a <= 12) {
cout << b / 2;
}else{
cout << b;
}
return 0;
*/
//B
/*long long int r, d, x;
cin >> r;
cin >> d;
cin >> x;
int i;
for (i = 0; i < 10; i++) {
x = r * x - d;
cout << x;
cout <<'\n';
}
return 0;*/
//C
/*int n, m;
int l, r;
cin >> n;
cin >> m;
int lmax, rmin;
lmax = 1;
rmin = n;
int i;
for (i = 0; i < m; i++) {
cin >> l;
cin >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
if (lmax <= rmin) {
cout << (rmin - lmax + 1);
}
else {
cout << 0;
}
return 0;*/
//D
/*int n, m;
cin >> n;
cin >> m;
int i;
int a[100000];
for (i = 0; i < n; i++) {
cin >> a[i];
}
margesort(a, n, 0, n - 1);
for (i = 0; i < m; i++) {
cin >> b[i];
cin >> c[i];
}
margesortD(c, b, m, 0, m - 1);
//sort(b.begin(), b.end());
long long int d;
d = 0;
int j, k, flag;
i = 0;
j = m - 1;
flag = 0;
while (flag == 0) {
for (k = i; k < i + b[j]; k++) {
if (a[k] < c[j]) {
a[k] = c[j];
}
else {
flag = 1;
}
if (k == n) {
flag = 1;
break;
}
}
i = i + b[j];
j--;
if (j == -1) { flag = -1; }
}
for (i = 0; i < n; i++) {
d = d + a[i];
}
cout << d;
return 0;
*/
//E
long long int n, m, k;
cin >> n;
cin >> m;
cin >> k;
long long int p;
p = 1000000007;
long long int c;
c = 0;
//2駒総コストを求める.
int i;
int j;
c = (((((((n * m) % p) * (n + m)) % p) * (n * m - 1)) % p) * modinv(6, p)) % p;
//それを(nm-2)C(k-2)倍する.
j = 1;
for (i = n*m-2; i > (n * m - 2)-(k-2); i--) {
c = (c * i) % p;
c = (c * modinv(j, p)) % p;
j++;
}
cout << c;
return 0;
}
/*void margesort(int a[], int a_len, int left, int right)
{
int i, j, mid, L, R;
if (right <= left)
return;
mid = (left + right) / 2;
margesort(a, mid, left, mid);
margesort(a, a_len - mid, mid+1, right);
for (i = left; i <= mid; i++)
temp[i] = a[i];
for (i = mid+1, j = right; i <= right; i++, j--)
temp[i] = a[j];
L = left;
R = right;
for (i = left; i <= right; i++)
{
if (temp[L] <= temp[R])
{
a[i] = temp[L];
L++;
}
else
{
a[i] = temp[R];
R--;
}
}
}
void margesortD(int a[], int b[], int a_len, int left, int right) {
int i, j, mid, L, R;
if (right <= left)
return;
mid = (left + right) / 2;
margesortD(a, b, mid, left, mid);
margesortD(a, b, a_len - mid, mid+1, right);
for (i = left; i <= mid; i++) {
temp[i] = a[i];
tempb[i] = b[i];
}
for (i = mid+1, j = right; i <= right; i++, j--) {
temp[i] = a[j];
tempb[i] = b[j];
}
L = left;
R = right;
for (i = left; i <= right; i++)
{
if (temp[L] <= temp[R])
{
a[i] = temp[L];
b[i] = tempb[L];
L++;
}
else
{
a[i] = temp[R];
b[i] = tempb[R];
R--;
}
}
}*/
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll x,y;
cin >> x >> y;
ll ans;
// 1回目に符号を反転させる場合
ll A = 1 + y - (-x);
// 最後に符号を反転させる場合
ll B = (-y) - x + 1;
// 最初と最後に符号を反転させる場合
ll C = 2 + (-y) - (-x);
// 反転させない場合
ll D = y - x;
if(A<0) A = INF;
if(B<0) B = INF;
if(C<0) C = INF;
if(D<0) D = INF;
ans = min(min(A,B),min(C,D));
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
int main() {
int N;
cin>>N;
string s,t;
cin>>s>>t;
reverse(s.begin(),s.end());
for(int i=N;i<=2*N;i++){
string S=s.substr(0,2*N-i);
reverse(S.begin(),S.end());
if(S==t.substr(0,2*N-i)){cout<<i<<endl;return 0;}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S,T;
cin >> N >> S >> T;
bool a=false;
for(int i=0;i<N;i++){
if(S.substr(i,N-i)==T.substr(0,N-i)){
a=true;
cout << N+i << endl;
break;
}
}
if(!a){
cout << 2*N << endl;
}
} | 1 |
#include <iostream>
using namespace std;
int main(){
int l[10], v[2], sl;
char c;
while(cin >> l[0]){
sl = l[0];
for(int i = 1; i < 10; i++){
cin >> c >> l[i];
sl += l[i];
}
cin >> c >> v[0] >> c >> v[1];
for(int i = 0; i < 10; i++){
l[i] *= v[0] + v[1];
}
sl *= v[0];
for(int i = 0; i < 10; i++){
sl -= l[i];
if(sl <= 0){
cout << i + 1 << endl;
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1e15;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
class Prim{
public:
struct Node{
vector<P> edges; // cost node
bool done;
ll cost;
};
ll V;
vector<Node> nodes;
Prim(ll v){
V = v;
nodes.resize(v);
}
void add_edge(ll v,ll node,ll cost){
nodes[v].edges.push_back(P(cost,node));
}
ll prim(){
priority_queue<P,vector<P>,greater<P>> mincost;
rep(i,V){
nodes[i].cost = INF;
nodes[i].done = false;
}
ll res = 0;
mincost.push(P(0,0));
while(!mincost.empty()){
P p = mincost.top();mincost.pop();
ll v = p.second;
if (nodes[v].done) continue;
nodes[v].done = true;
res += p.first;
for(P u:nodes[v].edges){
if (!nodes[u.second].done) mincost.push(P(u.first,u.second));
}
}
return res;
}
};
int main(){
ll v,e;
cin >> v >> e;
Prim g(v);
ll s,t,w;
rep(i,e){
cin >> s >> t >> w;
g.add_edge(s,t,w);
g.add_edge(t,s,w);
}
PRINT(g.prim());
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#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 all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define Size(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T, class S> inline bool chmax(T &a, S b) {
if(a < b) {a = b;return 1;} return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {
if(a > b) {a = b;return 1;} return 0;
}
template <class T>
void line(vector<T> &x){for (auto&& xi : x) cin >> xi;}
inline void IN(void){ return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){ cin >> first; IN(rest...); return;}
#define INT(...) int __VA_ARGS__; IN (__VA_ARGS__)
#define LINT(...) lint __VA_ARGS__; IN (__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
template <class T> void UNIQUE(vector<T> &x) {
sort(all(x)); x.erase(unique(all(x)), x.end());
}
template <class T> void print_vec(vector<T> a){
for (const auto& ai : a) cout << ai << " ";
cout << endl;
}
vector<string> Yes = {"No", "Yes"};
int main(){
INT(x, y, z);
swap(x, y); swap(x, z);
cout << x << " " << y << " " << z << endl;
}
| #include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/(__gcd(a,b))
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define all(a) (a).begin(), (a).end()
#define vi vector<long long>
#define v vector
#define p pair
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
int modF=1e9+7;
int INF=1e11;
void solve(){
int x,y,z;
cin>>x>>y>>z;
cout<<z<<" "<<x<<" "<<y<<ln;
}
signed main(){
boost_io;
solve();
return 0;
} | 1 |
#include <iostream>
#include <utility>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;} //&&c<='9'
_in() {return in(gcu());}
_sc(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}
_sc(char &c){c=gcu();gcu();return c!=EOF;}
//_sc(string &s){int c;s="";
// for(;;){c=gcu();if(c=='\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}
template <typename H,typename... T> _sc(H &h, T&&... t){return scan(h)&&scan(t...);}
#define _vo _il void out
#define _vl _il void outl
template <typename T>
_vo(T n){static char buf[20];char *p=buf;
if(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;
while (p!=buf)pcu(*--p);}
_vo(const char *s){while(*s)pcu(*s++);}
_vo(char c){pcu(c);}
//_vo(string &s){for (char c: s) pcu(c);}
template <typename H,typename... T> _vo(H&& h, T&&... t){out(h);out(move(t)...);}
//template <typename T> _vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);out('\n');}
_vl(){out('\n');}
template <typename... T> _vl(T&&... t){out(move(t)...);outl();}
template<int N>
struct sieve {
bool s[N];
constexpr sieve() : s() {
for (int i = 0; i < N; i++)
s[i] = true;
for (int i = 4; i < N; i += 2)
s[i] = false;
for (int i = 9; i < N; i += 6)
s[i] = false;
for (int i = 6, e = sqrt(N); i <= e; i += 6) {
for (int j : {i - 1, i + 1})
if (s[j])
for (int k = j * j; k < N; k += j)
s[k] = false;
}
}
};
int main() {
enum {N = 10001};
constexpr sieve<N> s;
vector<int> t = {5};
for (int i = 7; i < N; i += 6)
if (s.s[i - 2] && s.s[i])
t.push_back(i);
for (int n; (n = in());) {
auto r = upper_bound(t.begin(), t.end(), n) - 1;
outl(*r - 2, ' ', *r);
}
}
| #include<iostream>
using namespace std ;
int table[10010] = {} ;
void f(){
table[0] = 1 ;
table[1] = 1 ;
for( int i=2 ; i<=10000 ; i++ ){
if( !table[i] ){
for( int j=2 ; i*j<=10000 ; j++ ) table[i*j] = 1 ;
}
}
}
main(){
f() ;
int n ;
while( cin >> n , n ){
int p = 0 ;
for( int i=5 ; i<=n ; i++ ){
if( !table[i] && !table[i-2] ) p = i ;
}
cout << p-2 << " " << p << endl ;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define left 2*node+1
#define right left+1
#define mid (s+e>>1)
const ll N=5e5+5;
vector<ll> T[4*N];
void build(ll A[], ll node, ll s, ll e){
if(s==e){
T[node].push_back(A[s]);
return;
}
build(A, left, s, mid);
build(A, right, mid+1, e);
merge(T[left].begin(), T[left].end(), T[right].begin(), T[right].end(), back_inserter(T[node]));
}
ll query(ll node,ll s, ll e, ll x, ll y){
if(e<s || s>y || e<x)
return 0;
if(x<=s && e<=y){
ll a=upper_bound(T[node].begin(), T[node].end(), y)-T[node].begin();
return T[node].size()-a;
}
ll p1=query(left, s, mid, x, y);
ll p2=query(right, 1+mid,e, x, y);
return p1+p2;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, q;
cin>>n>>q;
ll A[n];
ll B[n];
for(ll i=0;i<n;i++)
cin>>A[i];
map<ll,ll> M;
for(ll i=n-1;i>=0;i--){
if(M.count(A[i]))
B[i]=M[A[i]];
else
B[i]=INT_MAX;
M[A[i]]=i;
}
build(B,0,0, n-1);
while(q--){
ll x, y;
cin>>x>>y;
ll ans=query(0,0,n-1,x-1,y-1);
cout<<ans<<"\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll bi[514514];
void add(ll n,ll i,ll x){
for(;i<=n;i+=i&-i)bi[i]+=x;
}
ll sum(ll i){
ll num=0;
for(;i>0;i-=i&-i)num+=bi[i];
return num;
}
ll c[514514],g[514514],ans[514514];
int main(){
ll n,q;
cin>>n>>q;
vector<vector<ll>>v(n+1),w(n+1);
for(int i=1;i<=n;i++)cin>>c[i];
for(int i=0;i<q;i++){
ll l,r;
cin>>l>>r;
v[r].push_back(l);
w[r].push_back(i);
}
for(int i=1;i<=n;i++){
if(g[c[i]])add(n,g[c[i]],-1);
add(n,i,1);
g[c[i]]=i;
ll cnt=0;
for(ll p:v[i]){
ans[w[i][cnt]]=sum(i)-sum(p-1);
cnt++;
}
}
for(int i=0;i<q;i++)cout<<ans[i]<<endl;
return 0;
}
| 1 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
using namespace std;
int f(int x) {
if (x <= 3) {
return (4 - x);
}
return 0;
}
int main() {
int x, y;
cin >> x >> y;
if (x == 1 && y == 1) {
cout << 1000000 << endl;
} else {
cout << 100000 * (f(x) + f(y)) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//cout << fixed << setprecision(15);
vector<int> forintinput(int n) {
vector<int> x;
for(int i = 0;i < n;i++){
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main(){
int a;
cin >> a;
if(a == 1) cout << "Hello World" << endl;
else{
int b,c;
cin >> b >> c;
cout << b+c << endl;
}
return 0;
} | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int sum,i,j,kari;
string data;
while(getline(cin, data)) {
data = data.insert(data.length(), "KKKKKK");
sum = j = 0;
for(j = 0; j < data.length(); j++) {
if(data[j] == 'M'){
sum += 1000;
}else if(data[j] == 'D'){
if(data[j + 1] == 'M'){
sum += 900;
j++;
}else{
sum += 500;
}
}else if(data[j] == 'C'){
if(data[j + 1] == 'D' || data[j + 1] == 'M'){
if(data[j + 1] == 'D'){
sum += 400;
j++;
}else{
sum += 900;
j++;
}
}else{
sum += 100;
}
}else if(data[j] == 'L'){
sum += 50;
}else if(data[j] == 'X'){
if(data[j+1] == 'L' || data[j+1] == 'C'){
if(data[j+1] == 'L'){
sum += 40;
j++;
}else{
sum += 90;
j++;
}
}else{
sum += 10;
}
}else if(data[j] == 'V'){
sum += 5;
}else if(data[j] == 'I'){
if(data[j + 1] == 'V' || data[j + 1] == 'X'){
if(data[j + 1] == 'V'){
sum += 4;
j++;
}else{
sum += 9;
j++;
}
}
else{
sum += 1;
}
}
}
cout << sum << endl;
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
#define rep(i, n) for (int i = 0; i < n; ++i)
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
typedef long long ll;
typedef pair<int, int> pint;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
int roman_to_n(const string& s)
{
static const int num[] = { 1, 5, 10, 50, 100, 500, 1000 };
static const char* roman = "IVXLCDM";
vector<int> digits(s.size());
for (int i = 0; i < s.size(); ++i)
digits[i] = num[strchr(roman, s[i]) - roman];
int res = accumulate(digits.begin(), digits.end(), 0);
for (int i = 0; i < digits.size() - 1; ++i)
if (digits[i] < digits[i + 1])
res -= 2 * digits[i];
return res;
}
string to_roman(int n)
{
static const char* roman[][10] = {
{ "", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX" },
{ "", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC" },
{ "", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM" },
{ "", "M", "MM", "MMM", "MMMM", "MMMMM" },
};
stringstream res;
for (int i = 3, j = 1000; i >= 0; --i, j /= 10)
res << roman[i][(n / j) % 10];
return res.str();
}
int main()
{
string s;
while (cin >> s)
cout << roman_to_n(s) << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N=1e6,MAX_A=1e5;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
int N;
int a[MAX_N];
ll sum[MAX_N+1];
int main(){
do{
scanf("%d",&N);
if (N){
REP(i,N){
scanf("%d",&a[i]);
}
ll ma=-MAX_A;
sum[0]=0;
REP(i,N){
sum[i+1]=sum[i]+a[i];
}
REP(i,N){
FOR(j,i,N){
ma=max(ma,sum[j+1]-sum[i]);
}
}
printf("%lld\n",ma);
}
}while(N);
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
while (1) {
long a[5001] = { 0 };
long n;
cin >> n;
if (n == 0)break;
a[0] = 0;
long maxv = -100000;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
a[i] = max(a[i], a[i] + a[i - 1]);
maxv = max(maxv, a[i]);
}
cout << maxv << endl;
}
} | 1 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <random>
#include <time.h>
#include <fstream>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define all(c) begin(c),end(c)
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
#define INF 1e9+7
#define LLINF 1e18+7
#define N 3000000
ll MOD=998244353;
ll inv[N],prd[N],invprd[N];
void calc_inv(){
inv[1]=1;
rep2(i,2,N-1){
inv[i]=((-(MOD/i)*inv[MOD%i])%MOD+MOD)%MOD;
}
return;
}
void calc_product(){
prd[0]=prd[1]=1;
invprd[0]=invprd[1]=1;
rep2(i,2,N-1){
prd[i]=i*prd[i-1]%MOD;
invprd[i]=inv[i]*invprd[i-1]%MOD;
}
return ;
}
ll cmb(ll a,ll b){
if(a<b)return 0;
if(a<0||b<0)return 0;
return prd[a]*invprd[b]%MOD*invprd[a-b]%MOD;
}
ll modpow(ll x,ll n){
if(n==0) return 1;
ll res=modpow(x*x%MOD,n/2);
if(n&1) res=res*x%MOD;
return res;
}
main(){
calc_inv();
calc_product();
ll n=lin(),m=lin();
ll ans=0;
ans=cmb(m*3ll+n-1ll,n-1ll);
rep2(x,1,m){
ans=(ans+MOD-n*cmb(m+n-x-2ll,n-2ll)%MOD)%MOD;
if(cmb(m+n-x-2ll,n-2ll)<0)cout<<0000;
if(n*cmb(m+n-x-2ll,n-2ll)<0)cout<<000;
//cout<<ans<<endl;
}
ll t=-1;
ll p=m,q=m;
rep2(x,m+1,(ll)min(m*3,n)){
if(x>n)break;
//ans=(ans+MOD-t*cmb(n,x)*cmb(p-q-1,q-1)%MOD)%MOD;
if(n==x){
if(m*3==n)
ans=(ans+MOD+t*cmb(p,q)%MOD)%MOD;
//cout<<ans<<endl;
}
if((m*3-x)%2)continue;
ans=(ans+MOD+t*cmb(n,x)%MOD*cmb((m*3-x)/2+n-1,n-1)%MOD)%MOD;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)
using namespace std;
static const ll INF = 1e15;
template<typename T>
static inline void chmin(T& ref, const T value) {
if (ref > value) ref = value;
}
template<typename T>
static inline void chmax(T& ref, const T value) {
if (ref < value) ref = value;
}
constexpr ll mod = 1000000007;
class modint {
static constexpr std::int_fast64_t Modulus = 1e9 + 7;
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x% Modulus) {}
constexpr u64& value() noexcept { return a; }
constexpr const u64& value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint& operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint& operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint& operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
};
int main() {
int n;
cin >> n;
vector<int> vs(n);
rep(i, n) {
cin >> vs[i];
}
vector<int> colors(3, 0);
modint all = 1;
rep(i, n) {
int same = 0;
rep(j, 3) {
if (colors[j] == vs[i]) same++;
}
all *= same;
rep(j, 3) {
if (colors[j] == vs[i]) {
colors[j]++;
break;
}
}
}
cout << all.a << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const int MAX = 1000000;
const int MOD = 1000000007;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
int n;
cin >> n;
vector<ll>a(n);
rep(i, 0, n)cin >> a[i];
int cnt=1000;
rep(i, 0, n){
int temp=0;
while(a[i]%2==0){
a[i]/=2;
temp++;
}
cnt = min(temp,cnt);
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,a,imin,j;
cin >> N >> A;
for (imin = 0; A % 2 == 0; imin++)
A /= 2;
for (int i = 0;i < N-1; i++) {
cin >> a;
for (j = 0;a % 2 == 0;j++)
a /= 2;
if (j < imin)
imin = j;
}
cout << imin << endl;
} | 1 |
#include<iostream>
using namespace std;
int n, a, b, c;
int main() {
while (true) {
cin >> n; if (n == 0) { break; }
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a + b + c >= 240) { goto A; }
if (a + b >= 180) { goto A; }
if (a == 100 || b == 100 || c == 100) { goto A; }
if (a + b + c >= 210) { goto B; }
if (a + b + c >= 150 && (a >= 80 || b >= 80)) { goto B; }
goto C;
A:; cout << 'A' << endl; goto D;
B:; cout << 'B' << endl; goto D;
C:; cout << 'C' << endl; goto D;
D:;
}
}
} | /*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
bool f=false;
REP(j,3){
cin>>p[j];
ave+=p[j];
if (p[j]==100){
f=true;
}
}
if (f){
out[i]='A';
}else if (p[0]+p[1]>=180){
out[i]='A';
}else if (ave>=80*3){
out[i]='A';
}else if (ave>=70*3){
out[i]='B';
}else if (ave>=50*3 && (p[0]>=80 || p[1]>=80)){
out[i]='B';
}else{
out[i]='C';
}
}
REP(i,n){
cout<<out[i]<<endl;
}
}
}while (n);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
int l = a + b;
int r = c + d;
if(l > r){
cout << "Left" << endl;
}else if(l == r){
cout << "Balanced" << endl;
}else{
cout << "Right" << endl;
}
return 0;
} | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) memset(a, (h), sizeof(a))
#define fi first
#define se second
#define por(a,b) (((a%MOD) * (b%MOD))%MOD)
#define forg(i, b, e, c) for (ll i = (ll)b; i < (ll)e; i+=c)
#define forr(i, b, e) for (ll i = b; i < e; i++)
using namespace std;
//using namespace __gnu_pbds;
typedef double lldb;
typedef pair<ll, ll> ii;
typedef pair<double, double> iidb;
typedef pair<ii, ll> iii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<ll> vll;
//typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll INF = 1e18+7;
const double PI = acos(-1);
const ll MOD= 1e9+7;
#define initseg ll new_nodo=(nodo*2),mid=(iz+der)/2;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define tam 210000
#define offset 200
#define ptr nodo*
map<ll,vector<iii> > chocarx,chocary,flechader,flechaiz,flechader2,flechaiz2;
vector<pair<ii,string> >lst,lst2;
ll ANSWER;
void update(ii par1, ii par2)
{
if (par1.fi==INF|| par2.fi==INF)return;
ll dist=abs(par1.fi-par2.fi)+abs(par1.se-par2.se);
ANSWER=min(ANSWER,dist*5);
}
void resolver1(map<ll,vector<iii> > & mapa)
{
//<<"mira \n";
for(auto ite:mapa)
{
sort(all(ite.se));
ii actant={INF,INF};
//<<ite.fi<<":\n";
for(iii par:ite.second)
{
//<<par.fi.fi<<","<<par.fi.se<<" "<<par.se<<" - ";
if (par.se==1)
{
actant=par.fi;
}
else
{
update(par.fi,actant);
}
}
//<<endl;
}
}
void resolver2(map<ll,vector<iii> > & mapa)
{
for(auto ite:mapa)
{
sort(all(ite.se));
ii actant={INF,INF};
for(iii par:ite.second)
{
if (par.se==1)
{
actant=par.fi;
}
else
{
update(par.fi,actant);
}
}
}
}
void solve(vector<pair<ii,string> >este)
{
ll x,y;
string tipo;
chocarx.clear(),chocary.clear(),flechaiz.clear(),flechader.clear();
flechaiz2.clear(),flechader2.clear();
for(auto par:este)
{
x=par.fi.fi;
y=par.fi.se;
tipo=par.se;
if (tipo=="U" || tipo=="D")
chocarx[x].pb({{y,x},tipo=="U"});
else
chocary[y].pb({{y,x},tipo=="R"});
if (tipo=="D"|| tipo=="U")
{
if (tipo=="U"){
flechader[x-y].pb({{y,x},tipo=="U"});
flechaiz[x+y].pb({{y,x},tipo=="U"});
}
else
{
flechader2[x-y].pb({{y,x},0});
flechaiz2[x+y].pb({{y,x},0});
}
}
else
{
if (tipo=="L")
{
flechader[x-y].pb({{y,x},tipo=="U"});
flechaiz2[x+y].pb({{y,x},1});
}
else
{
flechaiz[x+y].pb({{y,x},tipo=="U"});
flechader2[x-y].pb({{y,x},1});
}
}
}
resolver1(chocarx);
resolver1(chocary);
resolver1(flechaiz);
resolver1(flechader);
resolver1(flechaiz2);
resolver1(flechader2);
}
int main()
{
ANSWER=INF;
ll n;
cin>>n;
ll x,y;
string tipo;
map<string,string> inv;
inv["L"]="R";inv["R"]="L";inv["U"]="D";inv["D"]="U";
forr(i,0,n)
{
cin>>x>>y>>tipo;
lst.pb({{x,y},tipo});
lst2.pb({{x,y},inv[tipo]});
}
solve(lst);
//solve(lst2);
if (ANSWER==INF)
cout<<"SAFE\n";
else
cout<<ANSWER<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int a, b, c, n;
int parts[310];
int result[1010][4];
int main()
{
while(cin >> a >> b >> c && (a || b || c)){
cin >> n;
for(int i = 1; i <= a + b + c; i++)
parts[i] = 2;
for(int i = 0; i < n; i++)
for(int j = 0; j < 4; j++)
cin >> result[i][j];
for(int i = 0; i < n; i++)
if(result[i][3])
parts[result[i][0]] = parts[result[i][1]] = parts[result[i][2]] = 1;
for(int i = 0; i < n; i++)
if(!result[i][3]){
if(parts[result[i][0]] == 1 && parts[result[i][1]] == 1)
parts[result[i][2]] = 0;
if(parts[result[i][1]] == 1 && parts[result[i][2]] == 1)
parts[result[i][0]] = 0;
if(parts[result[i][2]] == 1 && parts[result[i][0]] == 1)
parts[result[i][1]] = 0;
}
for(int i = 1; i <= a + b + c; i++)
cout << parts[i] << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
struct Info {
int i,j,k;
Info(int _i,int _j,int _k) {i=_i,j=_j,k=_k;}
};
vector<Info> info[2];
int result[300];
int main() {
int a,b,c,N;
while(scanf("%d %d %d",&a,&b,&c),a|b|c) {
scanf("%d",&N);
info[0].clear();
info[1].clear();
memset(result,0,sizeof(result));
for(int i=0;i<N;i++) {
int I,J,K,R;
scanf("%d %d %d %d",&I,&J,&K,&R);
info[R].push_back(Info(I-1,J-1,K-1));
}
for(int i=0;i<info[1].size();i++) {
Info I=info[1][i];
result[I.i]=result[I.j]=result[I.k]=1;
}
for(int i=0;i<info[0].size();i++) {
Info I=info[0][i];
if(result[I.i]==1&&result[I.j]==1) result[I.k]=2;
if(result[I.i]==1&&result[I.k]==1) result[I.j]=2;
if(result[I.j]==1&&result[I.k]==1) result[I.i]=2;
}
for(int i=0;i<(a+b+c);i++) {
printf("%d\n",(result[i]==2)?0:(result[i]==0)?2:1);
}
}
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define INF 1000000000000000LL
using namespace std;
#define MAXN 300
// dp[i][j][k]:1スi枚,2スj枚,3スk枚
double dp[MAXN+1][MAXN+1][MAXN+1];
int n;
double rec(int i, int j, int k){
if(!i && !j && !k)return 0.0;
if(dp[i][j][k]>0.0)return dp[i][j][k];
double sum = i+j+k;
double ret = n/sum;
if(i>0)ret += (double)(i/sum) * rec(i-1, j, k);
if(j>0)ret += (double)(j/sum) * rec(i+1, j-1, k);
if(k>0)ret += (double)(k/sum) * rec(i, j+1, k-1);
return dp[i][j][k]=ret;
}
int main(){
cin>>n;
double dn=(double)n;
vector<int>a(n);
rep(i, n)cin>>a[i];
map<int, int>m;
for(auto t:a)m[t]++;
// cout<<fixed<<setprecision(12)<<rec(m[1], m[2], m[3])<<endl;
printf("%.12f", rec(m[1], m[2], m[3]));
return 0;
rep(i, n)rep(j, n)rep(k, n)cout<<dp[i][j][k]<<' '<<i<<' '<<j<<' '<<k<<endl;
return 0;
} | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e9;
ll N;
std::vector<ll> a;
vector<vector<vector<double>>> dp;
double f(ll c1, ll c2, ll c3) {
if (dp[c1][c2][c3] != -1.0) return dp[c1][c2][c3];
if (c1 == 0 && c2 == 0 && c3 == 0) return 0.0;
double ret = 0.0;
if (c1 > 0) ret += f(c1 - 1, c2, c3) * c1;
if (c2 > 0) ret += f(c1 + 1, c2 - 1, c3) * c2;
if (c3 > 0) ret += f(c1, c2 + 1, c3 - 1) * c3;
ret += N;
ret *= 1.0 / (c1 + c2 + c3);
return dp[c1][c2][c3] = ret;
}
void solve() {
dp.resize(310, vector<vector<double>>(310, vector<double>(310, -1.0)));
ll c1 = 0, c2 = 0, c3 = 0;
rep(i, N) {
if (a.at(i) == 1) c1++;
if (a.at(i) == 2) c2++;
if (a.at(i) == 3) c3++;
}
cout << f(c1, c2, c3) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
scanf("%lld", &N);
a.resize(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
solve();
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int> W;
vector<int> K;
for(int i = 0;i < 20;++i){
int a;
cin>>a;
if(i < 10){
W.push_back(a);
}
else{
K.push_back(a);
}
}
sort(W.begin(),W.end());
reverse(W.begin(),W.end());
sort(K.begin(),K.end());
reverse(K.begin(),K.end());
int a = 0;
int W_p = 0;
int K_p = 0;
for(int e : W){
W_p += e;
++a;
if(a == 3){
a = 0;
break;
}
}
for(int e : K){
K_p += e;
++a;
if(a == 3){
break;
}
}
cout<<W_p<<" "<<K_p<<endl;
return 0;
}
| #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int W[10], K[10];
for(int i = 0; i < 10; i++) scanf("%d", &W[i]);
for(int i = 0; i < 10; i++) scanf("%d", &K[i]);
sort(W, W + 10);
sort(K, K + 10);
printf("%d %d\n", W[9] + W[8] + W[7], K[9] + K[8] + K[7]);
return 0;
} | 1 |
#include<iostream>
using namespace std;
int a[102][102],color;
void dfs(int x,int y){
a[y][x] = 9;
if(a[y+1][x] == color){
dfs(x,y+1);
}
if(a[y][x+1] == color){
dfs(x+1,y);
}
if(a[y-1][x] == color){
dfs(x,y-1);
}
if(a[y][x-1] == color){
dfs(x-1,y);
}
}
int main(){
int xs,ys,xg,yg,n,c,d,x,y,w,h;
while(1){
cin >>w>>h;
if(w == 0 && h == 0)break;
for(int i = 0 ; i < 102 ; i++){
for(int j = 0 ; j < 102 ; j++){
a[i][j]=0;
}
}
cin >>xs>>ys;
cin >>xg>>yg;
cin >>n;
for(int i = 0 ; i < n ; i++){
cin >> c >> d >> x >> y;
if( d == 0 ){
for(int i = 0 ; i < 2 ; i++){
for(int j = 0 ; j < 4 ; j++){
a[i+y][j+x] = c;
}
}
}else{
for(int i = 0 ; i < 4 ; i++){
for(int j = 0 ; j < 2 ; j++){
a[i+y][j+x] = c;
}
}
}
}
/*
for(int i = 0 ; i < h+2 ; i ++){
for(int j = 0 ; j < w+2 ; j++){
cout << a[i][j];
}
cout <<endl;
}
cout <<endl;
*/
if(a[ys][xs] != 0){
color = a[ys][xs];
dfs(xs,ys);
}
/*
for(int i = 0 ; i < h+2 ; i ++){
for(int j = 0 ; j < w+2 ; j++){
cout << a[i][j];
}
cout <<endl;
}
*/
if(a[yg][xg] == 9){
cout <<"OK"<<endl;
}else{
cout <<"NG"<<endl;
}
}
return 0;
} | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n,p;
while(1){
cin>>n>>p;
if(n==0 && p==0)break;
int dt[n];
int cop=p;
int counta=0;
rep(i,n)dt[i]=0;
int ans;
while(1){
counta=counta%n;
if(cop!=0){
dt[counta]++;
cop--;
}else{
int judge=0;
rep(i,n){
if(i!=counta)if(dt[i]==0)judge++;
}
if(judge==n-1){
ans=counta;
break;
}else{
cop=dt[counta];
dt[counta]=0;
}
}
counta++;
}
cout<<ans<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
int nextInt() { int x; scanf("%d", &x); return x;}
ll MOD = (ll)(1e9 + 7);
const int MAX_N = 1010;
const int SZ = 312345;
ll inv[SZ];
ll fact[SZ];
ll fact_inv[SZ];
ll choose(int n, int r) {
if (n < 0 || r < 0 || n < r) return 0;
return fact[n] * fact_inv[n-r] % MOD * fact_inv[r] % MOD;
}
ll mod_pow(ll a, ll b, ll p) {
ll res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
ll f(int m, int k) {
ll res = fact[m*k];
(res *= mod_pow(fact_inv[m], k, MOD)) %= MOD;
(res *= fact_inv[k]) %= MOD;
return res;
}
ll A, B, C, D;
ll dp[MAX_N][MAX_N];
ll rec(int n, int m) {
if (n < 0) return 0;
if (m == 0 && n == 0) return 1;
if (m == 0 && n > 0) return 0;
if (dp[n][m] != -1) return dp[n][m];
ll res = rec(n, m-1);
if (A <= m && m <= B) {
for (int k = C; k <= D; k++) {
if (n - k*m < 0) break;
ll cur = rec(n - k*m, m-1);
(cur *= choose(n, k*m)) %= MOD;
(cur *= f(m, k)) %= MOD;
res += cur;
}
}
res %= MOD;
return dp[n][m] = res;
}
int main2() {
CLR(dp, -1);
int N = nextInt();
A = nextInt();
B = nextInt();
C = nextInt();
D = nextInt();
ll ans = rec(N, N);
cout << ans << endl;
return 0;
}
int main() {
{
inv[1] = 1;
for (int i = 2; i < SZ; i++) inv[i] = inv[(int) (MOD % i)] * (MOD - MOD / i) % MOD;
fact[0] = 1;
for (int i = 1; i < SZ; i++) fact[i] = fact[i-1] * i % MOD;
fact_inv[0] = 1;
for (int i = 1; i < SZ; i++) fact_inv[i] = fact_inv[i-1] * inv[i] % MOD;
}
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
ll mod_pow(ll a, ll n, ll m = mod) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 10000;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
modint dp[6001][2001];
void solve() {
int n; cin >> n >> mod;
init_f();
dp[3 * n][0] = 1;
for (int i = 3 * n; i > 0; i--) {
for (int j = 0; j <= n; j++) {
//one
dp[i - 1][j] += dp[i][j];
//two
if (i>=2&&j < n) {
dp[i - 2][j+1] += dp[i][j] * comb(i - 1, 1);
}
//three
if (i >= 3 && j < n) {
dp[i - 3][j + 1] += dp[i][j] * comb(i - 1, 2)*(modint)2;
}
}
}
modint ans = 0;
rep(i, n + 1)ans += dp[0][i];
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(7);
//init_f();
//init();
//int t; cin >> t; rep(i, t)solve();
solve();
stop
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
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 ALL(v) v.begin(), v.end()
typedef long long ll;
const ll mod=1000000007;
ll powmod(ll x,ll y){
ll res=1;
for(ll i=0;i<y;i++){
res=res*x%mod;
}
return res;
}
int main(){
int n;cin >> n;
ll a[n];
rep(i,n)cin >> a[i];
sort(a,a+n);
for(int i=0;i<n-1;i++){
if(a[i]==a[i+1]){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| #include <iostream>
//#include<stack>
#include<set>
#include<bits/stdc++.h>
using namespace std;
//int f[10005];
//int chazhao(int x)
//{
// if(x==f[x])
// return x;
// else
// return f[x]=chazhao(f[x]);
//}
int main()
{
set<int >ss;
int n,x;
cin>>n>>x;
ss.insert(x);
for(int i=1;i<n;i++)
{
cin>>x;
if(ss.count(x)==0)
ss.insert(x);
else
continue;
}
int k=ss.size();
if(k==n)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#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 sz(obj) ((int)(obj).size())
#define pf push_front
#define pb push_back
int main()
{
int n;
cin >> n;
int a[3] = {0};
REP(i, n) cin >> a[i];
if (n == 2){
FOR(i, 1, min(a[0], a[1]) + 1){
if (a[0] % i == 0 && a[1] % i == 0) cout << i << endl;
}
}
else {
FOR(i, 1, min(min(a[0], a[1]), a[2]) + 1){
if (a[0] % i == 0 && a[1] % i == 0 && a[2] % i == 0) cout << i << endl;
}
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
auto gcd = [](int mm, int nn) {
function<int(int, int)> f = [&f](int m, int n) {
if (n == 0) {
return m;
}
else {
return f(n, m % n);
}
};
return f(max(mm, nn), min(mm, nn));
};
auto gcd3 = [gcd](int n, int m, int o) { return gcd(n, gcd(m, o)); };
vector<int> r;
if (n == 2) {
int a, b;
cin >> a >> b;
const auto s = gcd(a, b);
for (int i = 1; i <= s; ++i) {
if (a % i == 0 && b % i == 0) {
r.push_back(i);
}
}
}
else {
int a, b, c;
cin >> a >> b >> c;
const auto s = gcd3(a, b, c);
for (int i = 1; i <= s; ++i) {
if (a % i == 0 && b % i == 0 && c % i == 0) {
r.push_back(i);
}
}
}
for (auto i : r) {
cout << i << endl;
}
}
| 1 |
// Problem : E - Colorful Blocks
// Contest : AtCoder - AtCoder Beginner Contest 167
// URL : https://atcoder.jp/contests/abc167/tasks/abc167_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define sz(a) (int)((a).size())
#define pb push_back
#define mp make_pair
#define db1(x) cout << #x << "=" << x << endl
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define dbp(x) \
cout << #x << "= {" << (x.first) << ", " << (x.second) << "}" << endl;
#define dbv(v) \
{ \
cout << #v << " : "; \
for (auto x : v) cout << x << ' '; \
cout << endl; \
}
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define die(x) return cout << x << '\n', 0;
const int MOD = 998244353;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int MAX = 2e5;
ll modulo(ll a, ll b, ll n) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y) % n; // multiplying with base
}
y = (y * y) % n; // squaring the base
b /= 2;
}
return x % n;
}
vi fact(MAX + 1), factinv(MAX + 1);
void pre() {
fact[0] = 1;
factinv[0] = 1;
for (int i = 1; i <= MAX; ++i) {
fact[i] = (fact[i - 1] * i) % MOD;
factinv[i] = (factinv[i - 1] * modulo(i, MOD - 2, MOD)) % MOD;
}
}
int mult(int a, int b) { return (a * b) % MOD; }
int nCr(int n, int r) {
return mult(fact[n], mult(factinv[r], factinv[n - r]));
}
int32_t main() {
fastio;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int testcases;
testcases = 1;
// cin>>testcases;
pre();
while (testcases--) {
int n, m, k;
cin >> n >> m >> k;
int ans = 0;
rep(i, 0, k) {
int temp = nCr(n - 1, i);
temp = mult(temp, m);
temp = mult(temp, modulo(m - 1, n - 1 - i, MOD));
ans = (ans + temp) % MOD;
}
cout << ans << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn=200005,K=998244353;
int n,m,p,ans,fac[maxn],inv[maxn];
int C(int A,int B) { return (LL)fac[A]*inv[B]%K*inv[A-B]%K; }
int Pow(int A,int B)
{
int res=1;
while (B)
{
if (B&1) res=(LL)res*A%K;
A=(LL)A*A%K;
B>>=1;
}
return res;
}
int main()
{
scanf("%d%d%d",&n,&p,&m);
fac[0]=1;
for (int i=1;i<=n;i++) fac[i]=(LL)fac[i-1]*i%K;
inv[n]=Pow(fac[n],K-2);
for (int i=n-1;i>=0;i--) inv[i]=(LL)inv[i+1]*(i+1)%K;
for (int i=m,now=(LL)p*Pow(p-1,n-m-1)%K;i>=0;i--)
{
//cerr<<">>>>>>"<<now<<endl;
ans=(ans+(LL)now*C(n-1,i))%K;
now=(LL)now*(p-1)%K;
}
printf("%d\n",ans);
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <numeric>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <deque>
#include <cmath>
#include <complex>
#include <cassert>
#include <cstring>
#include <functional>
#include <bitset>
#include <climits>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf (1LL << 60)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define cmn(x,y) x=min(x,y)
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template<typename T> class segtree {
private:
int n,sz;
vector<pair<T, int> > node;
public:
segtree(vector<T>& v){
sz = (int)v.size();
n = 1;
while(n < sz){
n *= 2;
}
node.resize(2*n);
rep(i,sz){
node[i+n] = make_pair(v[i], i);
}
for(int i=n-1; i>=1; i--){
node[i] = min(node[2*i], node[2*i+1]);
}
}
void update(int k, T a)
{
node[k+=n] = make_pair(a, k);
while(k>>=1){
node[k] = min(node[2*k], node[2*k+1]);
}
}
pair<T, int> query(int a,int b,int k=0,int l=0,int r=-1)
{
pair<T, int> res1 = make_pair(inf, -1);
pair<T, int> res2 = make_pair(inf, -1);
a += n, b += n;
while(a != b){
if(a % 2) cmn(res1, node[a++]);
if(b % 2) cmn(res2, node[--b]);
a >>= 1, b>>= 1;
}
return min(res1, res2);
}
void print()
{
rep(i,sz){
pair<T, int> p;
p = query(i,i+1);
cout << "st[" << i << "]: " << p.first << " " << p.second << endl;
}
}
};
int n;
ll d;
ll saiki(segtree<ll>& sg, int a,int b){
//cerr << a << " " << b << endl;
if(b==a+1)return 0;
auto p = sg.query(a,b);
ll s = p.first;
ll ans = 0;
int ind = p.second;
if(ind-1>=a){
ll xx = sg.query(ind-1,ind).first;
ans += s+d+xx;
sg.update(ind-1,min(xx,s+d));
ans += saiki(sg,a,ind);
}
if(ind+1<b){
ll xx = sg.query(ind+1,ind+2).first;
ans += s+d+xx;
sg.update(ind+1,min(xx,s+d));
ans += saiki(sg,ind+1,b);
}
return ans;
}
int main(){
cin >> n >> d;
vector<ll>v(n+1);
rep(i,n)cin >> v[i];
segtree<ll> sg(v);
ll ans = saiki(sg,0,n);
cout << ans << endl;
return 0;
}
| #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
int N;
struct Data {
int h, p;
bool operator<(const Data &o) const {
return min(h, o.h-p) > min(o.h, h-o.p);
}
} D[5011];
LL X[5011];
void MAIN() {
scanf("%d", &N);
REP (i, N) scanf("%d%d", &D[i].h, &D[i].p);
sort(D, D+N);
memset(X, 0x3f, sizeof X);
LL INF = X[0];
X[0] = 0;
REP (i, N) {
for (int j=i; j>=0; j--) {
if (X[j] <= D[i].h) {
amin(X[j+1], X[j] + D[i].p);
}
}
}
int ans = 0;
REP (i, N+1) if (X[i] < INF) ans = i;
printf("%d\n", ans);
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() { int N, K;
cin >> N >> K;
int s = 1;
for (int i = 0; i < N; i++){
if(s<K){
s = 2 * s;
}
else{
s = s + K;
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a,b;
cin>>a>>b;
if(a==b)
cout<<a+b;
else{
int mx=max(a,b);
int k=(mx-1)+mx;
cout<<k;
}
}
| 0 |
#include <bits/stdc++.h>
# define M_PI 3.14159265358979323846 /* pi */
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
int count = 0;
int result = 200;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
while (true) {
if (A.at(i) % 2 != 0 || A.at(i) == 0) {
break;
}
else if (A.at(i) % 2 == 0) {
A.at(i) = A.at(i) / 2;
count++;
}
}
result = min(result, count);
count = 0;
}
cout << result << endl;
} | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <climits>
#include <utility>
#define PRINT(STR) cout << STR << endl;
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define REG(i, a, b) for (int (i) = ((int)(a)); (i) < ((int)(b)); i++)
#define ALL(V) (V).begin(), (V).end()
typedef long long ll;
using namespace std;
int nextInt() { int n = -1; cin >> n; return n; }
double nextDouble() { double d = -1; cin >> d; return d; }
ll nextll() { ll n = -1; cin >> n; return n; }
string nextString() { string str; cin >> str; return str; }
int INF = 1LL << 25;
double EPS = 1e-9;
// BEGIN //////////////////////////////////////////////////////////////
int main() {
while (true) {
int N = nextInt();
if (N == 0) break;
int score_max = -INF, score = 0;
REP(i, N) {
int d = nextInt();
score += d;
score_max = max(score, score_max);
score = max(score, 0);
}
PRINT(score_max);
}
return 0;
}
// END ////////////////////////////////////////////////////////////// | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
vector<int>v;
int a,b,c,k;
cin >> a >> b >> c >> k;
v.push_back(a);
v.push_back(b);
v.push_back(c);
int sum = 0;
while(k--)
{
sort(v.begin(),v.end());
v[2]*=2;
}
sum = v[0] + v[1] + v[2];
cout << sum << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int a[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
int ans=0;
bool used[n];
memset(used,0,sizeof(used));
used[0]=1;
int cost[n];
for(int i=0;i<n;i++) cost[i]=a[0][i];
while(1){
int v=-1;
for(int i=0;i<n;i++){
if(used[i]||cost[i]<0) continue;
//cout<<i<<":"<<cost[i]<<endl;
if(v<0||cost[i]<cost[v]) v=i;
}
if(v<0) break;
used[v]=1;
ans+=cost[v];
//cout<<v<<endl;
for(int i=0;i<n;i++){
if(a[v][i]<0) continue;
if(cost[i]<0||a[v][i]<cost[i]) cost[i]=a[v][i];
}
}
cout<<ans<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const long long 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;}
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) (a).begin(),(a).end()
#define P pair<int, int>
#define ll long long
const int MOD = 1000000007;
//bitset<64>(x).count()
//fixed << setprecision(15) <<
int main(){
int n, l;
cin >> n >> l;
ll ans = (n*(n+2*l-1))/2;
if(l>=0)
ans -= l;
else
if(n+l-1<0)
ans -=n+l-1;
cout << ans << endl;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int applepie = 0;
for (int i = 1; i <= N; i++) {
applepie += L + i - 1;
}
int ans;
int diff = abs(L + 1 - 1);
for (int i = 2; i <= N; i++) {
diff = min(diff, abs(L + i - 1));
}
for (int i = 1; i <= N; i++) {
if (abs(L + i - 1) == diff) ans = applepie - (L + i - 1);
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C; cin >> A >> B >> C;
cout << (((A < C && C < B) || (A > C && C > B)) ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define int long long int
#define vi vector<int>
#define vvi vector < vi >
#define pii pair<int,int>
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,val) memset(a,val,sizeof(a))
#define eb emplace_back
#define f first
#define s second
#define tr(k,st,en) for(int k = st; k <= en ; k++)
using namespace std;
int32_t main()
{
std::ios::sync_with_stdio(false);
int a,b,c;
cin>>a>>b>>c;
cout<<c<<' '<<a<<' '<<b<<endl;
return 0;
}
| 0 |
#include<cstdio>
#include<algorithm>
#include<cstring>
int main(){
using namespace std;
int table[300][300][2],n,m,a,b,INF=10000000;
while(true){
scanf("%d%d",&n,&m);
if(n==0&&m==0) break;
for(int i=0;i<300;i++)
for(int j=0;j<300;j++)
for(int k=0;k<2;k++)
table[i][j][k]=INF;
for(int i=0;i<300;i++){
table[i][i][0]=0;
table[i][i][1]=0;
}
while(n--){
scanf("%d%d",&a,&b);
scanf("%d",&table[a-1][b-1][0]);
table[b-1][a-1][0]=table[a-1][b-1][0];
scanf("%d",&table[a-1][b-1][1]);
table[b-1][a-1][1]=table[a-1][b-1][1];
}
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
for(int k=0;k<m;k++){
table[j][k][0]=min(table[j][k][0],table[j][i][0]+table[i][k][0]);
table[j][k][1]=min(table[j][k][1],table[j][i][1]+table[i][k][1]);
}
}
}
scanf("%d",&m);
while(m--){
scanf("%d%d%d",&a,&b,&n);
printf("%d\n",table[a-1][b-1][n]);
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <climits>
using namespace std;
void floyd(vector<vector<long long> >& d)
{
for (int k = 0; k < d.size(); k++) {
for (int i = 0; i < d.size(); i++) {
if (LLONG_MAX == d[i][k]) continue;
for (int j = 0; j < d.size(); j++) {
if (LLONG_MAX == d[k][j]) continue;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
int main()
{
int v, e;
cin >> v >> e;
vector<vector<long long> > d(v, vector<long long>(v, LLONG_MAX));
int s, t;
for (int i = 0; i < v; i++) d[i][i] = 0;
for (int i = 0; i < e; i++) {
cin >> s >> t;
cin >> d[s][t];
}
floyd(d);
// check negative cycle
for (int i = 0; i < v; i++) {
if (d[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for (int i = 0; i < v; i++) {
for (auto itr = d.at(i).begin(); itr != d.at(i).end(); ++itr) {
if (itr != d.at(i).begin()) cout << " ";
if (LLONG_MAX == *itr) cout << "INF";
else cout << *itr;
}
cout << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int R;
cin>>R;
if(R<1200) cout<<"ABC"<<endl;
else if(1200<=R && R<2800) cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define bit(n) (1LL<<(n))
// #define DEBUG
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b, const ll mod=MOD) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b, const ll mod=MOD) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b, const ll mod=MOD) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b, const ll mod=MOD) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int R; cin >> R;
string res = "AGC";
if(R < 1200){
res = "ABC";
}
else if(R < 2800){
res = "ARC";
}
cout << res << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, x;
cin>>n>>x;
long long int ans=0;
long long int a;
cin>>a;
for(int i=0; i<n-1; i++){
long long int b;
long long int eat=0;
cin>>b;
eat=max(a+b-x, eat);
ans+=eat;
if(b<=eat) b=0;
else b=b-eat;
a=b;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
ll x;
cin >> N >> x;
vector<ll> a(N);
for(int i = 0; i < N; i++) cin >> a[i];
ll ans = 0;
for(int i = 1; i < N; i++) {
if(a[i] + a[i - 1] <= x) continue;
if(a[i - 1] <= x) {
ans += a[i] + a[i - 1] - x;
a[i] -= a[i] + a[i - 1] - x;
//cerr << "a " << a[i - 1] << " " << a[i] << endl;
} else {
ans += a[i];
a[i] = 0;
ans += a[i - 1] - x;
a[i - 1] = x;
//cerr << "b " << a[i - 1] << " " << a[i] << endl;
}
}
cout << ans << endl;
} | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n,0);
REP(i,n) cin >> a[i];
sort(a.begin(), a.end());
bool ok = true;
REP(i,n){
if(i != n-1){
if(a[i] == a[i+1]){
ok = false;
}
}
}
if(ok) cout << "YES" << endl;
else cout << "NO" << endl;
} | #define _CRT_NO_SECURE_WARNINGS
#pragma warning(disable:4996)
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <string>
#include <iomanip>
#include <set>
#include <random>
#include <queue>
#include <map>
#include <ctime>
#include <sstream>
#include <cstdlib>
using namespace std;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std; int INF = 1e6; typedef long long ll; typedef double d; typedef unsigned long long ull;
void solve() {
int a, b, c;
cin >> a >> b >> c;
int first = a, s = b, th = c;
vector<int>test(3);
test[0] = first;
test[1] = s;
test[2] = th;
sort(test.begin(), test.end());
c == test[1] ? cout << "Yes" << endl : cout << "No" << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
rep(i,n) cin >> c[i];
ssort(a); ssort(b); ssort(c);
vector<ll> upc(n), acu_upc(n);
rep (i, n) {
auto it = upper_bound(c.begin(), c.end(), b[i]);
int cnt = c.end() - it;
if (cnt < 0) cnt = 0;
upc[i] = cnt;
}
acu_upc[n - 1] = upc[n-1];
rrepSE (i, n - 2, -1) {
acu_upc[i] = acu_upc[i+1] + upc[i];
}
ll ans = 0;
rep(i,n) {
auto it = upper_bound(b.begin(), b.end(), a[i]);
int j = it - b.begin();
if (j<=n-1) {
ans += acu_upc[j];
}
}
cout << ans << "\n";
return 0;
}
| #include<iostream>
using namespace std;
const int maxn = 200001;
const int INF = 0x7fffffff;
int L[maxn], R[maxn];
long long merge(int A[], int n, int left, int mid, int right)
{
int i, j, k;
long long cnt = 0;
int n1 = mid - left;
int n2 = right - mid;
for(int i = 0; i < n1; i++) L[i] = A[left + i];
for(int i = 0; i < n2; i++) R[i] = A[mid + i];
L[n1] = R[n2] = INF;
i = j = 0;
for(int k = left; k < right; k++)
{
if(L[i] <= R[j])
A[k] = L[i++];
else
{
A[k] = R[j++];
cnt += n1 - i;
}
}
return cnt;
}
long long mergeSort(int A[], int n, int left, int right)
{
int mid;
long long v1, v2, v3;
if(left + 1 < right)
{
mid = (left + right) / 2;
v1 = mergeSort(A, n, left, mid);
v2 = mergeSort(A, n, mid, right);
v3 = merge(A, n, left, mid, right);
return v1 + v2 + v3;
}
else
return 0;
}
int main()
{
int A[maxn], n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> A[i];
long long ans = mergeSort(A, n, 0, n);
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int N = 0, M = 0;
int points[1001];
int scores[1002001];
bool check(int a, int c){
if(a >= (N + 2) * (N + 1) / 2 - 1){
return true;
}
return (scores[a] <= c && scores[a + 1] > c);
}
int search2(int a, int b, int c){
int pib = a + b - b / 2;
if(check(pib, c)){
return pib;
}else if(scores[pib] < c){
return search2(pib, b / 2, c);
}else{
return search2(a, b / 2, c);
}
}
int main(){
for(;;){
for(int i = 0; i < 1001; i++){
points[i] = 0;
}
for(int i = 0; i < 1002001; i++){
scores[i] = 0;
}
if(cin >> N){
if(N == 0){
break;
}
cin >> M;
for(int i = 1; i <= N; i++){
cin >> points[i];
}
for(int i = 0; i <= N; i++){
for(int j = i; j <= N; j++){
scores[(2 * N - i + 1) * i / 2 + j] = points[i] + points[j];
}
}
int mxsco = 0;
sort(scores, scores + ((N + 2) * (N + 1)) / 2);
for(int i = 0; i < (N + 2) * (N + 1) / 2; i++){
if(scores[i] > M){
break;
}
int nosco = scores[i] + scores[search2(0, (N + 2) * (N + 1) / 2, M - scores[i])];
if(nosco >= mxsco && nosco <= M){
mxsco = nosco;
}
}
cout << mxsco << endl;
}else{
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for(int i = 0; i < N; i++)
int main()
{
int N, M;
while(cin >> N >> M, N || M) {
int A[1005] = {0};
vector<int>sum;
int maxv = 0;
sum.push_back(0);
for(int i = 1; i <= N; i++) {
cin >> A[i];
Rep(j, i + 1) {
if(A[i] + A[j] <= M) sum.push_back(A[i] + A[j]);
}
}
sort(sum.begin(), sum.end());
Rep(i, sum.size()) {
maxv = max(maxv, sum[i] + *(upper_bound(sum.begin(), sum.end(), M - sum[i]) - 1));
}
cout << maxv << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define input freopen("1.txt","r",stdin);
#define output freopen("output.txt","w",stdout);
#define ll long long int
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define vi vector<int>
#define vii vector<vi>
#define vl vector<ll>
#define vll vector<vl>
#define pii pair<int, int>
#define pll pair<ll,ll>
#define mp make_pair
#define vpi vector<pii>
#define vpl vector<pll>
#define ss second
#define ff first
using namespace std;
const int p = 1e9 + 7;
const int maxn = 1e5 + 1;
void solve() {
int n; cin >> n;
int l[n];
// vi psides;
for(int i = 0; i < n; i++) cin >> l[i];
int ans = 0;
for(int i = 0; i < n; i++) {
for(int j = i+1; j < n; j++) {
for(int k = j+1; k < n; k++) {
if(l[i] != l[j] && l[i] != l[k] && l[j] != l[k]) {
vi sides = {l[i], l[j], l[k]};
sort(sides.begin(), sides.end());
if(sides[0] + sides[1] > sides[2]) ans++;
}
}
}
}
cout << ans;
}
int main() {
fast
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
char in[1000100];
int main(){
fgets(in, sizeof(in), stdin);
vector<pi> v;
int cnt = 0, ans = 0;
for(int i = 0; ; i++){
if(i && in[i] != in[i - 1]){
v.pb(mp(in[i - 1], cnt));
cnt = 1;
}
else cnt++;
if(!in[i]) break;
}
rep(i, v.size() - 2) if(v[i].first == 'J'
&& v[i + 1].first == 'O'
&& v[i + 2].first == 'I'){
if(v[i + 1].second <= v[i].second && v[i + 1].second <= v[i + 2].second)
ans = max(ans, v[i + 1].second);
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#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()
#define fi first
#define se second
#define debug(x) cerr <<__LINE__<< ": " <<#x<< " = " << x << endl
#define debug_vec(v) cerr<<__LINE__<<": "<<#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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int n;
cin >> n;
vector<int> A(n);
for (auto &a : A) cin >> a;
sort(all(A));
A.erase(unique(all(A)), A.end());
if (n == (int)A.size()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
string S;
cin >> S;
if(S.size() == 3){
reverse(S.begin(),S.end());
cout << S << endl;
} else {
cout << S << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long fac[1010], finv[1010], inv[1010];
long long MOD = 1000000007;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1005; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long group(int k, int n, int r){
long long num = COM(r, k*n) * fac[k*n] % MOD;
for(int i = 0; i < n; i++){
num *= finv[k]; num %= MOD;
}
num *= finv[n]; num %= MOD;
return num; // r人残っているときにk人のグループをn個作る方法
}
int main(){
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
COMinit();
long long dp[1010][1010] = {}; // i人のグループまで見てj人使いきってる
dp[A-1][0] = 1;
for(int i = A-1; i < B; i++){
for(int j = 0; j <= N; j++){
if(!dp[i][j]) continue;
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= MOD;
for(int k = C; k <= D; k++){
if(j + (i+1)*k > N) break;
dp[i+1][j + (i+1)*k] += dp[i][j] * group(i+1, k, N-j);
dp[i+1][j + (i+1)*k] %= MOD;
}
}
}
cout << dp[B][N] << endl;
} | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
#define rg register
const int maxn=1e5+10;
int mm,m,n,a[60];
long long f[60];
long long ans;
void dfs(int x,int n,long long sum){
if(x==n/2+1){
if(sum==m){
long long now=a[1]>=0?(9-a[1]):(9+a[1]);
for(rg int i=2;i<x;i++)now=now*(a[i]>=0?(10-a[i]):(10+a[i]));
ans+=n&1?now*10:now;
}
return ;
}
if(sum+10ll*(f[n-x]-f[x-1])<m||sum-10ll*(f[n-x]-f[x-1])>m)return ;
for(rg int i=-9;i<10;i++){
a[x]=i;
dfs(x+1,n,sum+1ll*a[x]*(f[n-x]-f[x-1]));
}
}
int main(){
read(m),mm=m;f[0]=1;
while(mm)n++,mm/=10;
for(rg int i=1;i<=18;i++)f[i]=f[i-1]*10;
for(rg int i=n;i<=18;i++)dfs(1,i,0);
printf("%lld\n",ans);
}
| 0 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
const double pi = acos(-1);
pair <double, double> rotate(int x, int y, int degree, double d) {
double theta = (2 * pi / 360) * degree;
double x_ = x * cos (theta) - y * sin(theta);
double y_ = x * sin (theta) + y * cos(theta);
x_ *= d;
y_ *= d;
return {x_, y_};
}
const double eps = 1e-3;
int near(double x) {
for(int i = (int)(x - 2); i < (int)(x + 2); i++) {
if(abs(i - x) < eps) {
return i;
}
}
return 0;
}
void solve() {
string s;
int a, b;
cin >> a >> b >> s;
bool ok = true;
ok &= s[a] == '-';
for(int i = 0; i < s.length(); i++) {
if(i == a)
continue;
else ok &= s[i] >= '0' && s[i] <= '9';
}
cout << (ok?"Yes":"No") << endl;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int testcase = 1;
// cin >> testcase;
for(int i = 0; i < testcase; i++) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define 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; }
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main(){
int a, b; cin >> a >> b;
string s; cin >> s;
int cnt1 = 0, cnt2=0;
int h_cnt=0;
rep(i, s.size()){
if(s[i]=='-'){
h_cnt++;
if(h_cnt==1)swap(cnt1, cnt2);
continue;
}
else{
cnt1++;
}
}
if(h_cnt==0||h_cnt>1){
out("No");
return 0;
}
if(a==cnt2&&b==cnt1){
out("Yes");
}
else out("No");
} | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=m-1;i>=n;--i)
#define ALL(v) v.begin(),v.end()
#define INF 1000000001
#define MOD 1000000007
using namespace std;
class Dice {
public:
int num[6] = { 0,0,0,0,0,0 };
void setnum(int*);
void roll(char);
void dice3(Dice, Dice);
};
void Dice::roll(char c) {
switch
(c) {
int tmp;
case'N':
tmp = num[0];
num[0] = num[1];
num[1] = num[5];
num[5] = num[4];
num[4] = tmp;
break;
case'S':
tmp = num[0];
num[0] = num[4];
num[4] = num[5];
num[5] = num[1];
num[1] = tmp;
break;
case'E':
tmp = num[0];
num[0] = num[3];
num[3] = num[5];
num[5] = num[2];
num[2] = tmp;
break;
case'W':
tmp = num[0];
num[0] = num[2];
num[2] = num[5];
num[5] = num[3];
num[3] = tmp;
break;
default:
cout << "invalid char" << endl;
}
}
void Dice::setnum(int* a) {
REP(i, 6) {
num[i] = a[i];
}
}
bool isSame(Dice d1, Dice d2) {
int flag = 1;
REP(i, 6) {
if (d1.num[i] != d2.num[i]) {
flag = 0;
}
}
if (flag) return true;
else return false;
}
bool dice4(Dice d1, Dice d2) {
int flag0 = 0;
int a = d1.num[0];
REP(i, 6) {
if (a == d2.num[i]) {
flag0 = 1;
}
}
if (flag0) {
REP(i, 3) {
REP(j, 4) {
if (isSame(d1, d2)) {
return true;
}
d1.roll('E');
d1.roll('N');
d1.roll('W');
}
d1.roll('E');
REP(j, 4) {
if (isSame(d1, d2)) {
return true;
}
d1.roll('E');
d1.roll('N');
d1.roll('W');
}
d1.roll('N');
}
}
return false;
}
int main() {
int n,flag=0;
cin >> n;
vector<Dice> dice;
REP(i, n) {
Dice d;
dice.push_back(d);
int tmp[6];
REP(j, 6){
int c;
cin >> c;
tmp[j]=c;
}
dice[i].setnum(tmp);
}
REP(i, n) {
FOR(j, i+1, n) {
if (dice4(dice[i], dice[j]))flag = 1;
}
}
if (flag)cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n,cnt=0,num=0;
int base[4]={0};
cin>>n;
string s;
while(1){
cin>>s;
if(s=="HIT"){
base[3]+=base[2];
base[2]=base[1];
base[1]=base[0];
base[0]=1;
}
if(s=="HOMERUN"){
for(int i=0;i<3;i++){
base[3]+=base[i];
base[i]=0;
}
base[3]++;
}
if(s=="OUT"){
cnt++;
}
if(cnt==3){
cout<<base[3]<<endl;
cnt=0;
num++;
base[0]=base[1]=base[2]=base[3]=0;
}
if(num==n)break;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
ll s[200010];
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i+1]=s[i]+a;
}
ll ans=1e18;
for(int i=2;i<n-1;i++){
ll *l,*r;
ll gap;
l=lower_bound(s+1,s+i+1,s[i]/2+1);
r=lower_bound(s+i+1,s+n+1,(s[n]+s[i])/2+1);
rep(j,2){
rep(k,2){
gap=max({*l,s[i]-*l,*r-s[i],s[n]-*r})-min({*l,s[i]-*l,*r-s[i],s[n]-*r});
ans=min(ans,gap);
l--;
}
l+=2;
r--;
}
}
cout << ans << endl;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
int ch[100000];
deque<int> pr;
llong P1[500];
llong P2[500];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
for (int i = 2; i < 100000; ++i) {
if (ch[i]) continue;
pr.push_back(i);
for (llong j = (llong)i * i; j < 100000; j += i) ch[j] = 1;
}
int n;
cin >> n;
if (n == 2) {
printf("4 7\n23 10\n");
return 0;
}
for (int i = 0; i <= ((n + n - 2) >> 1); ++i) {
P1[i] = pr.front();
pr.pop_front();
}
for (int i = 0; i <= ((n + n - 2) >> 1); ++i) {
P2[i] = pr.front();
pr.pop_front();
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if ((i + j) & 1) {
int x = (i + j), y = (i - j + (n - 1));
llong ret = 1;
if (x > 0) ret *= P1[x - 1 >> 1];
if (x + 1 <= n + n - 2) ret *= P1[x + 1 >> 1];
if (y > 0) ret *= P2[y - 1 >> 1];
if (y + 1 <= n + n - 2) ret *= P2[y + 1 >> 1];
printf("%lld", ret + 1);
//if (ret > 1e15) { printf("%lld\n", ret); }
}
else {
printf("%lld", P1[i + j >> 1] * P2[i - j + (n - 1) >> 1]);
}
if (j + 1 < n) printf(" ");
else printf("\n");
}
}
return 0;
}
| 0 |
#include<stdio.h>
int main(void)
{
int n,pm,pe,pj,s,i;
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++){
scanf("%d%d%d",&pm,&pe,&pj);
s=(pm+pe+pj)/3;
if(pm==100||pe==100||pj==100) printf("A\n");
else if((pm+pe)/2>=90) printf("A\n");
else if(s>=80) printf("A\n");
else if(s>=70) printf("B\n");
else if(s>=50&&(pm>=80||pe>=80)) printf("B\n");
else printf("C\n");
}
}
return 0;
} | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int color[200][200];
bool flg[200][200];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int w,h,n,c,d,x,y;
void dfs(int ny,int nx,int gy,int gx){
flg[ny][nx]=true;
rep(i,4){
int nex=nx+dx[i];
int ney=ny+dy[i];
if(nex>=w || nex<0 || ney>=h || ney<0)continue;
if(color[ney][nex]==color[ny][nx] && flg[ney][nex]==false)dfs(ney,nex,gy,gx);
}
return;
}
int main(){
pair<int,int> s,g;
while(1){
rep(i,200)rep(j,200)color[i][j]=flg[i][j]=0;
cin>>w>>h;
if(w==0 && h==0)break;
cin>>s.first>>s.second;
cin>>g.first>>g.second;
cin>>n;
rep(i,n){
cin>>c>>d>>x>>y;
if(d==0){
rep(j,2){
rep(k,4){
color[y-1+j][x-1+k]=c;
}
}
}else{
rep(j,4){
rep(k,2){
color[y-1+j][x-1+k]=c;
}
}
}
}
dfs(s.second-1,s.first-1,g.second-1,g.first-1);
if(flg[g.second-1][g.first-1])cout<<"OK"<<endl;
else cout<<"NG"<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
bool ok = 1;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1]) ok = 0;
}
if (ok) printf("YES\n");
else printf("NO\n");
}
| /*
h s, d't skp th si tll i's sved
* ABC141 E
* ABC145 D
* ABC147 F
*/
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int n,x;
cin>>n;
set<int> st;
string ans="YES";
while(n--)
{
cin>>x;
if(st.count(x))
{
ans="NO";
break;
}
st.insert(x);
}
cout<<ans;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int rr[8], cc[8];
int r[8], c[8];
int main(){
int k;
cin >> k;
int count=0;
for(int i=0;i<k;i++) cin >> r[i] >> c[i];
for(int co=0;co<pow(8,8-k);co++)
{
for(int i=0;i<8;i++)
{
rr[i]=-1;
cc[i]=-1;
}
//無理やり配置を用意して
for(int i=0;i<8;i++)
{
rr[i]=i;
if(i<k) cc[r[i]]=c[i];
}
int hoge=0;
for(int i=0;i<8;i++)
{
int a=pow(8,hoge);
if(cc[i]==-1)
{
cc[i]=co%(a*8)/a;
hoge++;
}
}
//襲撃をtrueで埋めて
bool masu[8][8]{false};
for(int i=0;i<8;i++)
{
for(int j=1;j<8;j++)
{
if(cc[i]-j>=0) masu[rr[i]][cc[i]-j]=true;
if(cc[i]+j<=7) masu[rr[i]][cc[i]+j]=true;
if(rr[i]-j>=0) masu[rr[i]-j][cc[i]]=true;
if(rr[i]+j<=7) masu[rr[i]+j][cc[i]]=true;
if(rr[i]-j>=0&&cc[i]-j>=0) masu[rr[i]-j][cc[i]-j]=true;
if(rr[i]+j<=7&&cc[i]-j>=0) masu[rr[i]+j][cc[i]-j]=true;
if(rr[i]-j>=0&&cc[i]+j<=7) masu[rr[i]-j][cc[i]+j]=true;
if(rr[i]+j<=7&&cc[i]+j<=7) masu[rr[i]+j][cc[i]+j]=true;
}
}
count=0;
for(int j=0;j<8;j++)
{
if(masu[rr[j]][cc[j]]==false) count++;
}
//cout << count << endl;
if(count==8)
{
count=0;
for(int j=0;j<k;j++)
{
if(c[j]==cc[r[j]]) count++;
}
if(count==k)
{
break;
//return 0;
}
}
}
for(int i=0;i<8;i++)
{
for(int j=0;j<8;j++)
{
if(cc[i]==j) cout << 'Q';
else cout <<'.';
}
cout << endl;
}
//cout << "hoge"<< endl;
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
}
else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int letter_to_int(char c) {
return tolower(c) - 'a';
}
int compare_array(vector<int> a1, vector<int>a2) {
int n1 = a1.size();
int n2 = a2.size();
if (n1 != n2) {
return n1 - n2;
}
for (int i=0; i<n1; i++) {
if (a1.at(i) != a2.at(i)) {
return a1.at(i) - a2.at(i);
}
}
return 0;
}
long gcd(long a, long b) {
if(a % b == 0) {
return b;
}
return gcd(b, a % b);
}
char int_to_char(int a) {
if (a == -1) {
return 'z';
}
else {
return 'a' + a;
}
}
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans*i;
}
for (int i = 1 ; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int divide_count(int a, int divider) {
int r = 0;
while(a % divider == 0) {
a /= divider;
r++;
}
return r;
}
bool is_prime(int a) {
int i = 2;
while(i * i <= a) {
if(a % i == 0) {
return false;
}
i++;
}
return true;
}
vector<vector<int>> all_comb(int n, int k) {
vector<vector<int>> combs(nCr(n, k), vector<int>(k));
for(int i=0; i<k; i++) {
combs[0][i] = i;
combs[1][i] = i;
}
for(long i=1; i<nCr(n, k); i++) {
int p = 1;
while(combs[i][k - p] == n - p) {
p++;
if(p > k) {
break;
}
}
combs[i][k - p]++;
int q = combs[i][k - p];
for(int j=1; j<p; j++) {
combs[i][k - p + j] = q + j;
}
if(i < nCr(n, k) - 1) {
for(int j=0; j<k; j++) {
combs[i + 1][j] = combs[i][j];
}
}
}
return combs;
}
template <typename TYPE> void co(TYPE a) {
cout << a << endl;
}
template <typename TYPE> void co_2(TYPE a, TYPE b) {
cout << a << ' ' << b << endl;
}
template <typename TYPE> void co_l(vector<TYPE> as) {
int n = as.size();
for(int i=0; i<n; i++) {
cout << as[i] << endl;
}
}
template <typename TYPE> void co_s(vector<TYPE> as) {
int n = as.size();
for(int i=0; i<n; i++) {
if(i > 0) {
cout << ' ';
}
cout << as[i];
}
cout << endl;
}
int main() {
std::cout << std::setprecision(9);
long mod = 1000000007;
long a, b;
cin >> a >> b;
int ans = 1;
long gcd = std::gcd(a, b);
for(long i=2; i*i<=gcd; i++) {
if(gcd % i == 0) {
ans++;
while(gcd % i == 0) {
gcd /= i;
}
}
}
if(gcd > 1) {
ans++;
}
co(ans);
} | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s, w, r;
int q, i, j, a, b;
cin >> s >> q;
for(i = 0; i < q; ++i){
cin >> w >> a >> b;
if( w == "replace" ){
cin >> r;
for( j = a; j <= b; ++j)
s[j] = r[j-a];
}else if( w == "print" ){
for( j = a; j <= b; ++j)
cout << s[j];
cout << "\n";
}else if( w == "reverse" ){
string c = s;
for( j = a; j <= b; ++j)
s[j] = c[b+a-j];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, cnt, d[N << 3], v[N << 3], sum, ans;
map <int, int> mp[N << 3];
vector < pair <int, int> > e[N << 3];
queue <int> q;
void init ()
{
scanf ( "%d%d" , &n, &m);
cnt = n;
for (int i = 1; i <= m; ++ i)
{
int p, q, c;
scanf ( "%d%d%d" ,&p, &q, &c);
if ( !mp[p].count (c) )
{
mp[p][c] = ++cnt;
e[p].push_back ( make_pair (cnt, 1) );
e[cnt].push_back ( make_pair (p, 1) );
}
if ( !mp[q].count (c) )
{
mp[q][c] = ++cnt;
e[q].push_back ( make_pair (cnt, 1) );
e[cnt].push_back ( make_pair (q, 1) );
}
e[ mp[p][c] ].push_back ( make_pair (mp[q][c], 0) );
e[ mp[q][c] ].push_back ( make_pair (mp[p][c], 0) );
}
}
void work ()
{
memset ( d, 0x3f, sizeof (d) );
d[1] = 0, v[1] = 1;
q.push (1);
for ( ; !q.empty (); )
{
int x = q.front ();
q.pop ();
for (int i = 0; i < e[x].size (); ++ i)
{
int y = e[x][i].first;
if (d[y] > d[x] + e[x][i].second)
{
d[y] = d[x] + e[x][i].second;
if (!v[y])
{
v[y] = 1;
q.push (y);
}
}
}
v[x] = 0;
}
if (d[n] == 0x3f3f3f3f) sum = -1;
else sum = d[n] / 2;
}
void prin ()
{
printf ( "%d" , sum);
}
int main ()
{
init ();
work ();
prin ();
return 0;
} | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MAX/2;
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll mod = 1e9 + 7;
//ll llmax = 10000000000000000000ll;
using namespace std;
using Graph = vector<vector<int>>;
int cnt_digit(ll N)
{
int digit = 0;
while (N > 0)
{
N /= 10;
digit++;
}
return digit;
}
// 最大公約数計算
ll gcd(ll a, ll b)
{
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
// 最小公倍数の計算
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
struct union_find
{
vector<int> par, r;
union_find(int n)
{
par.resize(n);
r.resize(n);
init(n);
}
void init(int n)
{
for (int i = 0; i < n; i++) par[i] = i;
for (int i = 0; i < n; i++) r[i] = 0;
}
int find(int x)
{
if (par[x] == x)return x;
else return find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (r[x] < r[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (r[x] == r[y])
{
r[x]++;
}
}
}
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
cout << max(max(a + b, a - b), a * b);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int current_rate, target_rate; //初期値
double next_rate;
cin >> current_rate >> target_rate;
next_rate = target_rate*2 - current_rate;
cout << next_rate << endl;
} | 0 |
#include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll MOD = 998244353;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n & 1)ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
int main(){
int n;
cin >> n;
VEC(int, a, n);
bool ok = true;
if(a[0] != 0)ok = false;
map<int, int> mp;
rep(i, n){
mp[a[i]]++;
}
int now = 0;
for(auto m : mp){
if(now != m.first)ok = false;
now++;
}
ll res = 1;
ll p;
if(mp[0] != 1)ok = false;
if(ok){
for(auto m : mp){
if(m.first > 0)res = res * mpow(p, m.second) % MOD;
p = m.second;
}
}
else res = 0;
cout << res;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
ll mod = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[300];
rep(i, N) cin >> A[i];
int goukei = 0;
rep(i, N) goukei += A[i];
int goukei2 = 0;
ll dp[45001][301] = {};
dp[0][0] = 1;
ll dp2[301] = {};
rep(i, N) {
for (int k = i; k >= 0; k--) if (dp2[k]) {
dp2[k + 1] += dp2[k];
dp2[k + 1] %= mod;
}
int x = max(0, goukei2 - goukei / 2);
for (int j = min(goukei2, (goukei + 1) / 2 - 1); j >= x; j--) {
for (int k = i; k >= 0; k--) {
if (dp[j][k]) {
if (j + A[i] >= (goukei + 1) / 2) dp2[k + 1] = (dp2[k + 1] + dp[j][k]) % mod;
else dp[j + A[i]][k + 1] = (dp[j + A[i]][k + 1] + dp[j][k]) % mod;
}
}
}
goukei2 += A[i];
}
ll zenbu = 1;
rep(i, N) {
zenbu *= 3;
zenbu %= mod;
}
ll bairitu[301];
bairitu[0] = 1;
rep(i, 300) {
bairitu[i + 1] = 2 * bairitu[i] % mod;
}
ll dame = 0;
rep1(k, N - 1) {
if (dp2[k]) {
int k2 = N - k;
ll kari = dp2[k] * bairitu[k2] % mod;
kari -= 2 * dp2[k];
dame += kari + mod;
dame %= mod;
}
}
dame *= 3;
dame %= mod;
ll kari = 1;
rep(i, N) {
kari *= 2;
kari %= mod;
}
dame += kari * 3;
dame %= mod;
co((zenbu - dame + mod + 3) % mod);
Would you please return 0;
} | 0 |
#include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | #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>
using namespace std;
using ll=long long;
using ld=long double;
//#define int long long
//#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
const int MOD = 1e9 + 7;
const int INF = 1e18 + 9;
constexpr long double pi = 3.141592653589793238462643383279;
int fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int keta(int n) {
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
int ketasum(int n) {
int sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
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 n;
int main(void) {
cin>>n;
cout << n / 3 << endl;
return 0;
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int n,m;
int C[200][200];
int T[200][200];
int d[200];
int dijk(int s,int g,int r){
bool used[200];
rep(i,200)used[i]=false;
rep(i,200)d[i]=999999999;
d[s]=0;
while(1){
int v=-1;
rep(u,m){
if( !used[u]&&(v==-1||d[u]<d[v]) )v=u;
}
if(v==-1)break;
used[v]=true;
rep(u,m){
if(r==0)
d[u] = min(d[u],d[v]+C[v][u]);
else
d[u] = min(d[u],d[v]+T[v][u]);
}
}
return d[g];
}
int main(){
while(cin>>n>>m){
if(n==0&&m==0)break;
rep(i,200)rep(j,200){
C[i][j]=999999999;
T[i][j]=999999999;
}
rep(i,n){
int a,b,c,t;
cin>>a>>b>>c>>t;
a--,b--;
C[a][b]=c;
C[b][a]=c;
T[a][b]=t;
T[b][a]=t;
}
int k;
cin>>k;
rep(i,k){
int s,g,r;
cin>>s>>g>>r;
s--,g--;
cout<<dijk(s,g,r)<<endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, q, k;
vector<vector<pair<lli, lli>>> g;
vector<lli> dist;
vector<lli> x, y;
void dfs(lli x, lli d){
dist[x] = d;
for(auto i : g[x]){
if(dist[i.second] >= 0) continue;
dfs(i.second, lli(dist[x]+i.first));
}
}
int main(void){
cin >> n;
g.resize(n);
dist.assign(n, -1);
rep(i, n-1){
lli a, b, c;
cin >> a >> b >> c;
a--;
b--;
g[a].push_back({c, b});
g[b].push_back({c, a});
}
cin >> q >> k;
k--;
x.resize(q);
y.resize(q);
rep(i, q){
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
}
dist[k] = 0;
dfs(k, 0);
rep(i, q){
cout << dist[x[i]]+dist[y[i]] << endl;
}
return 0;
}
| 0 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#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 dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
#define DAYS 100
int main(){
int date[DAYS];
while(true){
int n,q;
cin >> n >> q;
if(n==0 && q==0) break;
rep(i,DAYS) date[i]=0;
rep(i,n){
int m;
scanf("%d",&m);
rep(j,m){
int d;
scanf("%d", &d);
date[d-1]++;
}
}
int res=0, resN=q-1;
rep(i,DAYS){
if(date[i]>resN){
res=i+1;
resN=date[i];
}
}
cout << res << endl;
}
} | #include<iostream>
using namespace std;
int h,w,map[20][20];
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int f(int i,int j,int cnt)
{
if(cnt>10)return 11;
int ans=11;
for(int r=0;r<4;r++)
{
int x=i+dx[r],y=j+dy[r];
while(x>=0&&y>=0&&x<h&&y<w&&map[x][y]==0)x+=dx[r],y+=dy[r];
if(x<0||y<0||x>=h||y>=w)continue;
else if(map[x][y]==3)return cnt+1;
else
{
map[x][y]=0;
if(x-dx[r]!=i||y-dy[r]!=j)ans=min(ans,f(x-dx[r],y-dy[r],cnt+1));
map[x][y]=1;
}
}
return ans;
}
main()
{
while(cin>>w>>h,h)
{
for(int i=0;i<h;i++)for(int j=0;j<w;j++)cin>>map[i][j];
int sx,sy;
for(int i=0;i<h;i++)for(int j=0;j<w;j++)
{
if(map[i][j]==2)
{
sx=i;sy=j;map[i][j]=0;
}
}
int t=f(sx,sy,0);
cout<<(t>10?-1:t)<<endl;
}
}
| 0 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.setf(ios::fixed);
double x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
cout<<hypot(x2-x1, y2-y1)<<'\n';
return 0;
} | #include <stdio.h>
#include <math.h>
int main(){
double vx,vy,v,x1,x2,y1,y2;
scanf("%lf%lf%lf%lf", &x1,&y1,&x2,&y2);
vx=(x2-x1)*(x2-x1);
vy=(y2-y1)*(y2-y1);
v=vx+vy;
printf("%0.8f\n",sqrt(v));
return 0;
} | 1 |
#include <cstdio>
long long x[100001],p[100001],ans,n,s;
int main(){
scanf("%d%d",&n,&s);
for(int i=1;i<=n;i++)
scanf("%d%d",&x[i],&p[i]);
int i=1,j=n;
while(i<=j){
if(s<=x[i]){
printf("%lld",x[j]-s+ans);
return 0;
}else if(s>=x[j]){
printf("%lld",ans+s-x[i]);
return 0;
}
if(p[i]>=p[j]){
ans+=x[j]-x[i];
while(i<j && p[i]>=p[j])p[i]+=p[j--];
}else{
ans+=x[j]-x[i];
while(i<j && p[i]<p[j])p[j]+=p[i++];
}
}
} | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=1010000;
const int P=1000000007;
const db eps=1e-7;
#define pritnf printf
//char buf[1<<22],*p1=buf,*p2=buf,obuf[1<<22],*O=obuf;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T>
inline void sc (T &x)
{
x=0; static int p; p=1; static char c; c=getchar();
while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
x*=p;
}
template <typename T>
inline void print (T x)
{
if (x< 0) putchar('-'),x=-x;
if (x>=10) print(x/10);
putchar(x%10+'0');
}
template <typename T>
inline void pr (T x) { print(x),putchar('\n'); }
template <typename T1,typename T2>
void chkmax (T1 &A,T2 B) { A=A>=B?A:B; }
template <typename T1,typename T2>
void chkmin (T1 &A,T2 B) { A=A<=B?A:B; }
int n,s,w[N]; LL a[N];
LL solve (int l,int r,int t)
{
if (w[l]> s||w[r]< s) return max (abs (s-w[l]),abs (s-w[r]));
if (a[l]>=a[r]) return a[l]+=a[r],a[r]=0,solve (l,r-1,l)+(t==r?w[r]-w[l]:0);
return a[r]+=a[l],a[l]=0,solve (l+1,r,r)+(t==l?w[r]-w[l]:0);
}
int main ()
{
// freopen (".in","r",stdin);
// freopen (".out","w",stdout);
sc(n),sc(s);
for (int i=1; i<=n; i++)
sc(w[i]),sc(a[i]);
pr(solve (1,n,a[1]>=a[n]?n:1));
return 0;
}
| 1 |
#if 0
date +%Y.%m.%d
不妨设 n > 1 。
如果所有 a[i] 都是奇数，那么先手操作后会有一个偶数，约分后仍然有唯一偶数，
此时后手一定可以对唯一偶数操作，所有数成为奇数，约分后同样如此，
直到所有数都为 1 ，仍然没有偶数，那么当 a[i] 全是奇数时先手必败。
更一般的，假设 n 足够大奇数足够多，如果有偶数个偶数，
先手操作后有奇数个偶数，后手一定可以对偶数操作使得状态还原至奇数个偶数，
也就是说有奇数个偶数时先手必胜，反之先手必败。
特别的是，如果有偶数个偶数且奇数唯一，此时先手对唯一奇数操作后，所有数都是偶数，
此时一定可以约分，并且约分后的结果是难以推断的。
由于这种情况一定可以约分，那么所有数至少缩小一半，也就是最多进行 O(logn) 次，
每次碰到这种情况暴力约分即可，直到转为上述可以直接判断的情况。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
inline operator ll () { ll x; return scanf("%lld", &x), x; }
template<class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
const int maxn = 100005;
int a[maxn];
bool game(int n) {
if(n == 1) return a[1] > 1;
int even = 0;
for(int i = 1; i <= n; i ++)
if(!(a[i] & 1))
++ even;
if(even & 1) return 1;
if(even != n - 1) return 0;
for(int i = 1; i <= n; i ++)
if(a[i] & 1) {
if(a[i] == 1) return 0;
-- a[i];
}
int gcd = a[1];
for(int i = 2; i <= n; i ++)
gcd = std::__gcd(gcd, a[i]);
for(int i = 1; i <= n; i ++)
a[i] /= gcd;
return !game(n);
}
int main() {
int n = read;
for(int i = 1; i <= n; i ++)
read(a[i]);
if(n > 1) {
int gcd = a[1];
for(int i = 2; i <= n; i ++)
gcd = std::__gcd(gcd, a[i]);
for(int i = 1; i <= n; i ++)
a[i] /= gcd;
}
puts(game(n) ? "First" : "Second");
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 +c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
int N,A[MAXN];
int gcd(int a,int b) {
return b == 0 ? a : gcd(b,a % b);
}
int check() {
int c = 0,t;
for(int i = 1 ; i <= N ; ++i) {
if(A[i] & 1) {++c;t = A[i];}
}
if((N - c) & 1) return 1;
if(c >= 2 || t == 1) return 0;
return -1;
}
void Solve() {
read(N);
for(int i = 1 ; i <= N ; ++i) {
read(A[i]);
}
int cnt = 0;
while(1) {
int x = check();
if(x != -1) {
if((x ^ cnt) == 1) puts("First");
else puts("Second");
return;
}
cnt ^= 1;
int g = 0;
for(int i = 1 ; i <= N ; ++i) {
if(A[i] & 1) --A[i];
g = gcd(g,A[i]);
}
for(int i = 1 ; i <= N ; ++i) {
A[i] /= g;
}
}
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N,Q,K;
cin>>N;
vector<vector<pair<int,int>>> A(N);
for(int i=1;i<N;i++){
int a,b,c;
cin>>a>>b>>c;
A[a-1].push_back({b-1,c});
A[b-1].push_back({a-1,c});
}
cin>>Q>>K;
vector<int> B(N,-1);
queue<int> q;
B[K-1]=0;
q.push(K-1);
while(!q.empty()){
int I=q.front();
q.pop();
for(pair<int,int> p:A[I])
if(B[p.first]==-1){
B[p.first]=B[I]+p.second;
q.push(p.first);
}
}
while(Q--){
int x,y;
cin>>x>>y;
cout<<B[x-1]+B[y-1]<<endl;
}
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
#define MAX_V 100000
vector<int> G[MAX_V]; //???
vector<int> rG[MAX_V]; //??????
void add_edge(int from, int to){
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v, bool used[MAX_V], vector<int> &vs){
used[v] = true;
rep(i,G[v].size()){
if(!used[G[v][i]])dfs(G[v][i],used,vs);
}
vs.push_back(v);
}
void rdfs(int v,int k,vector<int> &sccs, vector<int> &cmp, bool used[MAX_V]){
used[v] = true;
sccs.push_back(v);
cmp[v] = k;
rep(i,rG[v].size()){
if(!used[rG[v][i]])rdfs(rG[v][i],k,sccs,cmp,used);
}
}
int scc(int V, vector< vector<int> > &each_scc, vector<int> &cmp){
vector<int> vs;
bool used[MAX_V];
rep(i,MAX_V)used[i] = false;
vs.clear();
rep(v,V){
if(!used[v]) dfs(v, used, vs);
}
rep(i,MAX_V) used[i] = false;
int k=0;
for(int i=vs.size()-1;i>=0;i--){
vector<int> sccs;
if(!used[vs[i]]){
rdfs(vs[i], k++, sccs, cmp, used);
each_scc.push_back(sccs);
}
}
return k;
}
/*
vector<vector<int>> each_scc; //????????????????????£?????????????????????
vector<int> cmp(MAX_V); //???????????????????±??????????????????£??????????????????( ??????each_scc????????????????????? )
int k = scc(v,each_scc,cmp); //?????£??????????????°???
*/
int main(){
int V,E;
cin>>V>>E;
rep(i,E){
int s,t;
cin>>s>>t;
add_edge(s,t);
}
vector<vector<int>> each_scc;
vector<int> cmp(MAX_V);
int k = scc(V,each_scc,cmp);
int q;
cin>>q;
rep(i,q){
int u,v;
cin>>u>>v;
if(cmp[u]==cmp[v])cout<<1<<endl;
else cout<<0<<endl;
}
} | 0 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
ll N, K;
ll solve(ll N);
int main()
{
cin >> N >> K;
cout << solve(N) << endl;
}
ll solve(ll N)
{
if (N == 1)
{
return 2;
}
return min(solve(N - 1) * 2, solve(N - 1) + K);
} | #include<iostream>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int ans = 1000;
for (int i = 0; i <= N; i++) {
int num = 1;
for (int k = 0; k < i; k++) {
num *= 2;
}
for (int k = 0; k < N - i; k++) {
num += K;
}
ans = min(ans, num);
}
cout << ans << endl;
}
| 1 |
// #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 1e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433832795;
const long double e = 2.71828182845904523536028747135266;
inline ll read()
{
ll kr = 1, xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
{
if (!(ls ^ 45))
kr = -1;
ls = getchar();
}
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs * kr;
}
// inline __int128 read128()
// {
// __int128 kr=1,xs=0;char ls;ls=getchar();
// while(!isdigit(ls)){
// if(!(ls^45)) kr=-1;ls=getchar();
// }
// while(isdigit(ls)){
// xs=(xs<<1)+(xs<<3)+(ls^48);ls=getchar();
// }
// return xs*kr;
// }
inline ull readull()
{
ull xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
ls = getchar();
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs;
}
inline void writeull(ull x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
writeull(x / 10);
putchar('0' + x % 10);
}
inline void write(ll x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
write(x / 10);
putchar('0' + x % 10);
}
// inline void write(__int128 x){
// if(x<0){x*=-1;putchar('-');}
// if(x>=10) write(x/10);
// putchar('0'+x%10);
// }
///////////////////////////////////////////////////////////////////////////////////////
int a[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// t = read();
while (t--)
{
int n=read(),x=read(),T=read();
n=n/x+(n%x?1:0);
n*=T;
printf("%d\n",n);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>(b);i--)
typedef long long ll;
using namespace std;
typedef double dd;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,x,t;
cin>>n>>x>>t;
if((n%x)!=0) cout<<t*((n/x)+1);
else {cout<<t*((n/x));return 0;}
return 0;
}
| 1 |
#include<iostream>
using namespace std;
int main() {
int N;
cin>>N;
long A[N];
for(int i=0;i<N;++i){
cin>>A[i];
}
bool check = true;
if(A[0]!=0)check = false;
for(int i=1;i<N;++i){
if(A[i]-A[i-1]>1)check = false;
}
long ans = A[N-1];
if(check){
for(int i=N-1;i>=1;--i){
if(A[i]-A[i-1]!=1)ans += A[i-1];
}
}
else ans = -1;
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c) for(int a=b; a<c; a++)
#define all(con) con.begin(),con.end()
#define w(x) int x; cin>>x; while(x--)
const ll infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
//const int mod=998244353;
const int mod=1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cout<<fixed<<setprecision(8);
ll n;
cin>>n;
vl a(n);
ll neg = 0;
ll mn = INT_MAX;
rep(i,0,n)
{
cin>>a[i];
mn = min(mn,abs(a[i]));
if(a[i] < 0)
neg++;
}
ll ans = 0;
rep(i,0,n)
ans += abs(a[i]);
if(neg&1^1)
{
cout<<ans<<endl;
}
else
{
ans -= 2*mn;
cout<<ans<<endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define go(u) for(int i = head[u], v = e[i].to; i; i=e[i].lst, v=e[i].to)
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define pb push_back
#define re(x) memset(x, 0, sizeof x)
inline int gi() {
int x = 0,f = 1;
char ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getchar();}
while(isdigit(ch)) { x = (x << 3) + (x << 1) + ch - 48; ch = getchar();}
return x * f;
}
template <typename T> inline bool Max(T &a, T b){return a < b ? a = b, 1 : 0;}
template <typename T> inline bool Min(T &a, T b){return a > b ? a = b, 1 : 0;}
const int N = 3e5 + 7;
int n, sz;
int a[4][N], inv[2], flip[2];
int tr[N];
int lowbit(int x) { return x & -x;}
void modify(int x, int y) { for(int i = x; i <= sz; i += lowbit(i)) tr[i] += y;}
int query(int x){
int res = 0;
for(int i = x; i; i -= lowbit(i)) res += tr[i];
return res;
}
int main() {
#ifdef fwat
#endif
n = gi(), sz = n * 3;
rep(i, 1, 3)
rep(j, 1, n) a[i][j] = gi();
rep(j, 1, n) {
int mi = min(a[1][j], min(a[2][j], a[3][j]));
if(a[1][j] == mi) {
if(!(a[2][j] == mi + 1 && a[3][j] == mi + 2)) return puts("No"), 0;
}else if(a[3][j] == mi) {
flip[j & 1] ^= 1;
if(!(a[2][j] == mi + 1 && a[1][j] == mi + 2)) return puts("No"), 0;
}else return puts("No"), 0;
if(j % 2 == 1 && mi % 6 != 1) return puts("No"), 0;
if(j % 2 == 0 && mi % 3 != 1) return puts("No"), 0;
}
for(int j = 1; j <= n; j += 2) {
inv[1] ^= query(sz) - query(a[2][j]) & 1;
modify(a[2][j], 1);
}
re(tr);
for(int j = 2; j <= n; j += 2) {
inv[0] ^= query(sz) - query(a[2][j]) & 1;
modify(a[2][j], 1);
}
puts(flip[0] == inv[1] && flip[1] == inv[0] ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,id[maxn],omove,orev,emove,erev,bit[maxn],rnk[maxn];
bool rev[maxn],vis[maxn];
inline void wrong(){
puts("No");
exit(0);
}
inline void add(int x,int val){
while(x<maxn){
bit[x]+=val;
x+=x&-x;
}
}
inline int sum(int x){
int res=0;
while(x){
res+=bit[x];
x-=x&-x;
}
return res;
}
int main(){
cin>>n;
for(int i=1,a;i<=n;++i){
cin>>a;
id[i]=(a+2)/3;
rnk[id[i]]=i;
if(vis[id[i]]||a==3*id[i]-1)
wrong();
vis[id[i]]=true;
if(a==3*id[i])
rev[i]=true;
}
for(int i=1,a;i<=n;++i){
cin>>a;
if(a!=3*id[i]-1)
wrong();
}
for(int i=1,a;i<=n;++i){
cin>>a;
if(rev[i]&&a!=3*id[i]-2||!rev[i]&&a!=3*id[i])
wrong();
}
for(int i=1;i<=n;++i)
if((i&1)!=(id[i]&1))
wrong();
for(int i=1;i<=n;i+=2)
add(i,1);
for(int i=1;i<=n;i+=2){
add(rnk[i],-1);
omove+=sum(rnk[i]);
orev+=rev[i];
}
memset(bit,0,sizeof(bit));
for(int i=2;i<=n;i+=2)
add(i,1);
for(int i=2;i<=n;i+=2){
add(rnk[i],-1);
emove+=sum(rnk[i]);
erev+=rev[i];
}
if((omove&1)!=(erev&1)||(emove&1)!=(orev&1))
wrong();
puts("Yes");
return 0;
} | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
// 多倍長
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
template<typename T>
vector<T> calc_divisor(T n) {
vector<T> res;
for (int i = 1; i*i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
T j = n / i;
if (j != i) res.push_back(j);
}
}
sort(res.begin(), res.end());
return res;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n,m;
cin >> n >> m;
vector<ll> div = calc_divisor(m);
sort(all(div));
for(int i = sz(div) - 1; i >= 0; --i){
if(n * div[i] <= m){
print(div[i]);
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
int main() {
ll N,M;
cin>>N>>M;
ll max_gcd=1;
for(ll i= 1;i*i<=M;i++){
if(M%i==0){
if(M/i>=N){
max_gcd=max(max_gcd,i);
}
if(i>=N){
max_gcd=max(max_gcd,M/i);
}
}
}
cout<<max_gcd<<endl;
return 0;
} | 1 |
#include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
//const ll MOD = INF + 7;
//Combination MOD
const int MOD = 1e9 + 7;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
vector<P> sum(n);
rep(i, n){
cin >> a[i] >> b[i];
sum[i] = P(a[i] + b[i], i);
}
sort(ALL(sum), greater<P>());
ll taka = 0, aok = 0;
rep(i, n){
//cout << sum[i].first << " " << sum[i].second << endl;
if(i % 2 == 0){
taka += a[sum[i].second];
}
else aok += b[sum[i].second];
}
cout << (ll)(taka - aok) << endl;
}
| #include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
using namespace std;
struct dish {
ll x, y;
dish(ll tx = 0, ll ty = 0) {
x = tx;
y = ty;
}
void read() {
cin >> x >> y;
}
bool operator<(const dish & d) const {
return (x + y > d.x + d.y);
}
};
#define MAXN (1 << 17)
dish a[MAXN];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
a[i].read();
}
sort(a, a + n);
ll ret = 0;
for (int i = 0; i < n; i++) {
if (i & 1) {
ret -= a[i].y;
} else {
ret += a[i].x;
}
}
cout << ret << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
using pv = pair<P,vector<int>>;
vector<int> graph[1005];
int main(){
int n,m;
cin >> n >> m;
vector<P> edge(m);
rep(i,m){
cin >> edge[i].first >> edge[i].second;
--edge[i].first;--edge[i].second;
graph[edge[i].first].push_back(edge[i].second);
}
int id = -1;
int mn = INF;
vector<int> ans;
rep(i,m){
vector<bool> seen(n,false);
queue<pv> q;
q.push(pv(P(edge[i].second,0),{}));
while(!q.empty()){
int now = q.front().first.first;
int c = q.front().first.second;
vector<int> way = q.front().second;
q.pop();
if(now==edge[i].first){
if(c < mn){
id = i;
mn = c;
way.push_back(now);
ans = way;
break;
}else{
break;
}
}
if(seen[now]) continue;
seen[now] = true;
way.push_back(now);
for(int j:graph[now]){
if(seen[j]) continue;
q.push(pv(P(j,c+1),way));
}
}
}
if(mn==INF){
cout << -1 << endl;
}else{
cout << (int)ans.size() << endl;
rep(i,ans.size()) cout << ans[i]+1 << endl;
}
return 0;
} | //#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
struct rep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr rep(const usize f, const usize l) noexcept
: f(std::min(f, l)), l(l) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
struct revrep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr revrep(const usize f, const usize l) noexcept
: f(l - 1), l(std::min(f, l) - 1) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
if (a < b)
a = b;
}
template <class F> class rec_lambda {
F f;
public:
rec_lambda(F &&f) : f(std::move(f)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
T ret;
std::cin >> ret;
return ret;
}
constexpr char eoln = '\n';
} // namespace n91
#include <cassert>
namespace n91 {
void main_() {
/*
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//*/
constexpr usize Inf = std::numeric_limits<usize>::max() / 2;
const usize n = scan<usize>();
const usize m = scan<usize>();
auto g = md_vec(n, n, Inf);
for (const usize i : rep(0, m)) {
const usize a = scan<usize>() - 1;
const usize b = scan<usize>() - 1;
g[a][b] = 1;
}
for (const usize i : rep(0, n)) {
for (const usize j : rep(0, n)) {
for (const usize k : rep(0, n)) {
chmin(g[j][k], g[j][i] + g[i][k]);
}
}
}
usize st = 0;
for (const usize i : rep(0, n)) {
if (g[i][i] < g[st][st]) {
st = i;
}
}
if (g[st][st] >= Inf) {
std::cout << "-1" << eoln;
return;
}
std::vector<usize> ans;
usize v = st;
do {
for (const usize i : rep(0, n)) {
if (g[v][i] == 1 && ans.size() + 1 + g[i][st] == g[st][st]) {
ans.push_back(i);
v = i;
break;
}
}
} while (ans.size() != g[st][st] - 1);
ans.push_back(st);
std::cout << ans.size() << eoln;
for (const auto e : ans) {
std::cout << e + 1 << eoln;
}
}
} // namespace n91
int main() {
n91::main_();
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main(){
ll x;cin>>x;
cout<<x/11*2+(x%11>6?2:x%11>0?1:0);;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long x, ans = 0;
cin >> x;
ans += 2 * (x / 11);
x %= 11;
if(x > 0) ans++;
if(x > 6) ans++;
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define rloop(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define xloop(i, a, b) for (int i = int(a); i <= int(b); i++)
#define ALL(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
//int dx[] = {1, 0, -1, 0};
//int dy[] = {0, 1, 0, -1}; //4 Direction
//int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
//int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; //8 direction
int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction
//int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal Direction
//-- "كلٌّ من يسعى لابد يصل .. كلٌّ من يسعى مضمون له الوصول" --//
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string s;
cin >> s;
int len = s.size();
if(len < 26){
int vis[26] = {};
for(int i = 0 ; i < len ; ++i)
vis[s[i]-'a']++;
for(int i = 0 ; i < 26 ; ++i)
if(!vis[i])
return cout << s << char(i+'a') << "\n" , 0;
}
else{
string temp = "";
for(int i = 25 ; i >= 0 ; --i)
temp += char(i + 'a');
if(s == temp)
cout << "-1\n";
else{
set < char > st;
for(int i = 25 ; i >= 0 ; --i){
st.insert(s[i]);
if(s[i-1] < s[i]){ // abc
char add = *st.upper_bound(s[i-1]);
cout << s.substr(0 , i-1) << add << "\n";
break;
}
}
}
}
return 0;
}
| 1 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 999999
using namespace std;
int main(){
int N;
while(cin>>N,N){
int ice[15]={0},X;
while(N--){
cin>>X;
ice[X]++;
}
for(int i=0;i<10;i++){
if(ice[i]==0)cout<<"-";
else{
while(ice[i]--){
cout<<"*";
}
}
puts("");
}
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<string>
#include<string.h>
using namespace std;
struct DICE
{
int f[8];
};
DICE dice;
int ch(char a)
{
int s[60];
for (int i = 1; i < 7; i++)
{
s[i] = dice.f[i];
}
int k = a;
switch (k)
{
case 78://N
dice.f[1] = s[2];
dice.f[2] = s[6];
dice.f[6] = s[5];
dice.f[5] = s[1];
break;
case 69:
dice.f[1] = s[4];
dice.f[4] = s[6];
dice.f[6] = s[3];
dice.f[3] = s[1];
break;
case 83://S
dice.f[2] = s[1];
dice.f[1] = s[5];
dice.f[5] = s[6];
dice.f[6] = s[2];
break;
case 87:
dice.f[4] = s[1];
dice.f[1] = s[3];
dice.f[3] = s[6];
dice.f[6] = s[4];
break;
}
return 0;
}
int main()
{
for (int i = 1; i < 7; i++)cin >> dice.f[i];
char d[10000];
cin >> d;
int z = strlen(d);
for (int i = 0; i <z; i++)
{
int a=ch(d[i]);
}
cout << dice.f[1]<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
long long gcd(long long x, long long y){
if(y == 0) return x;
else return gcd(y, x%y);
}
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<long long> EnumDivisors(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;
}
vector<pair<long long, long long>> PrimeFactorize(long long n){
vector<pair<long long, long long>> res;
long long a = 0;
long long b = 0;
for(long long i = 2; i * i <= n; i++){
a = 0;
if(n%i == 0){
if(IsPrime(i)){
while(n % i == 0){
n /= i;
a++;
}
res.push_back(make_pair(i, a));
}
}
}
if(n!= 1) res.push_back(make_pair(n, 1));
return res;
}
int main(){
long long a, b;
cin >> a >> b;
vector<pair<long long, long long>> a_fac = PrimeFactorize(a);
vector<pair<long long, long long>> b_fac = PrimeFactorize(b);
// for(int i = 0; i < a_fac.size(); i++) cout << a_fac[i].first << ", " << a_fac[i].second << endl;
// for(int i = 0; i < b_fac.size(); i++) cout << b_fac[i].first << ", " << b_fac[i].second << endl;
long long ans = 0;
for(int i = 0; i < a_fac.size(); i++){
for(int j = 0; j < b_fac.size(); j++){
if(a_fac[i].first == b_fac[j].first) {
// cout << "i = " << i << ", j = " << j << endl;
ans ++;
}
}
}
cout << ans + 1 << endl;
return 0;
} | //int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//bool型 初期値はTrue
//島渡りの問題：中間ノードに着目
//数が大きい時の比較はstring型で行う
//全て0になったか調べたい->0になるたびにcntする
//例外処理は最初にする
//x = p^m + q^n...の約数の個数:(n+1)*(m+1)....
//N!のどの素因数で何回割れるか
//⇔1~Nまでの数がそれぞれどの素因数で何回割り切れるかの和
//パズルの問題->一般化して全探索
//stack<ll> s;
//s.push(要素);s.top();s.pop();
//queue<ll> q;
//q.push(要素);q.front();q.pop();
//同じ作業繰り返す系の問題：収束先を見つける
//過半数：N/2.0で判定
//優先度付きキュー
//priority_queue<
//ll,
//vector<ll>
//> q;
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
#define PI 3.14159265358979323846264338327950L
using namespace std;
//割るやつ
const ll MOD = (pow(10, 9) + 7);
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
//a,bの最小公倍数
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
//階乗計算
ll f(ll n) {
if (n == 0 || n == 1) return 1;
else return (n * f(n - 1));
}
//Nのd桁目の数
ll dignum(ll N, ll d) {
ll x = pow(10, d);
N %= x;
ll y = pow(10, d - 1);
N /= y;
return N;
}
//Nをdで何回割れるか
ll divcnt(ll N, ll d) {
ll ans = 0;
while (1) {
if (N%d == 0) {
ans++;
N /= d;
}
else break;
}
return ans;
}
//素数判定
bool prime(ll num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) return false;
}
return true;
}
//フィボナッチ数列
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
if (n == 1) return 1;
else if (n == 2) return 1;
else if (memo[n] != 0) return memo[n];
else return memo[n] = fibo(n - 1) + f(n - 2);
}
ll RS(ll N, ll P, ll M) {
if (P == 0) return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2, M);
return t * t % M;
}
return N * RS(N, P - 1, M);
}
vector<int> IntegerToVector(int bit, int N) {
vector<int> S;
for (int i = 0; i < N; ++i) {
if (bit & (1 << i)) {
S.push_back(i);
}
}
return S;
}
int main() {
ll N, M;cin >> N >> M;
vector<ll> L(M), R(M);
rep(i,M) cin >> L[i] >> R[i];
sort(ALL(L));
sort(ALL(R));
if(R[0] - L[M-1] + 1 < 0) cout << 0 << endl;
else cout << R[0] - L[M-1] + 1 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PRINT(x,y) cout<<"Case #"<<(int)x<<": "<<(int)(y)<<endl;
ll exp(ll x, ll y) {
if(y==0) return 1;
if(y==1) return x;
if(y%2==0) return exp(x,y/2)*exp(x,y/2);
else return x*exp(x,y/2)*exp(x,y/2);
}
ll gcd(ll a , ll b) {
if(b==0) return a;
return gcd(b , a%b);
}
ll lcm(ll a , ll b) {
return (a*b)/gcd(a,b);
}
#define vec(n) vector<int> v((int)(n),0);
#define vecl(n) vector<ll> v((ll)(n),0);
#define sq(a) ((int)(a))*((int)(a));
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int l;
ll fact(ll x) {
if(x==1) return 1;
else return x*fact(x-1);
}
bool isPrime(int x) {
int ans = 0;
for(int i=2;i<=sqrt(x);++i) {
if(x%i==0) {
ans = 1; i=x;
}
}
if(ans==0) return true;
else return false;
}
ll isPerfect(ll x) {
double y = sqrt(x);
return (floor(y)==ceil(y));
}
int z = 0;
void ask(int x, int y) {
cout<<"? "<<x<<" "<<y<<endl;
}
void solve() {
int n; cin>>n;
vector<ll> v(n);
for(int i=0;i<n;++i) cin>>v[i];
ll suff[n+1] = {0};
reverse(v.begin() , v.end());
for(int i=n-1;i>=0;i--) {
suff[i] = max(suff[i+1] , v[i]);
}
ll sum = 0;
for(int i=0;i<n;++i) {
if(v[i]<suff[i+1]) sum+=abs(v[i]-suff[i+1]);
}
cout<<sum;
}
int main() {
io
solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;} return false;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
int main(){
ll n;
cin >> n;
vi a(n);
rep(i, n) {
cin >> a.at(i);
}
ll ans = 0;
rep(i, n-1) {
if(a.at(i) >= a.at(i+1)) {
ans += a.at(i) - a.at(i+1);
a.at(i+1) = a.at(i);
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <cstdio>
const int MAXN = 6005;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == '-' ) f = -1; s = getchar();}
while( s >= '0' && s <= '9' ){x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getchar();}
x *= f;
}
template<typename _T>
void write( _T x )
{
if( x < 0 ){ putchar( '-' ); x = ( ~ x ) + 1; }
if( 9 < x ){ write( x / 10 ); }
putchar( x % 10 + '0' );
}
int f[MAXN][MAXN << 1];
int N, M;
void add( int &x, const int v ) { x += v; if( x >= M ) x -= M; }
int main()
{
read( N ), read( M );
int t = N * 3;
f[0][t] = 1;
for( int i = 1 ; i <= t ; i ++ )
for( int j = - t ; j <= t ; j ++ )
{
if( j > -t ) add( f[i][j + t], f[i - 1][j + t - 1] ); //长度为1
if( j < t && i >= 2 ) add( f[i][j + t], 1ll * f[i - 2][j + t + 1] * ( i - 1 ) % M ); //长度为2
if( i >= 3 ) add( f[i][j + t], 1ll * f[i - 3][j + t] * ( i - 1 ) % M * ( i - 2 ) % M ); //长度为3
}
int ans = 0;
for( int i = 0 ; i <= t ; i ++ ) add( ans, f[t][i + t] );
write( ans ), putchar( '\n' );
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// true:a < b false:a > b
bool mycomp(pair <int, int> a, pair <int, int> b)
{
int c = a.first*a.first + a.second*a.second;
int d = b.first*b.first + b.second*b.second;
if (c == d){
return a.first < b.first;
}
return c < d;
}
int main(void)
{
int h, w;
// cout << mycomp(make_pair(1, 2), make_pair(1, 3)) << endl;
while (cin >> h >> w){
if (h == 0 && w == 0){
return 0;
}
pair <int, int> rect(h, w);
pair <int, int> ret(-1, -1);
int nowmax = 10e9;
for (int i = 1; i <= 150; i++){
for (int j = i+1; j <= 150; j++){
if (i == h && j == w) continue;
pair <int, int> tmp(i, j);
if (mycomp(rect, tmp)){ // tmpの方が大きい
if (ret.first == -1 || mycomp(tmp, ret)){
ret = tmp;
}
}
}
}
cout << ret.first << " " << ret.second << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
vector<pair<long long,long long>> bunkai;
int main(){
int a,b,c; cin >> a >> b >> c;
if(a == b && b == c && c == a || a != b && b != c && c != a)
cout << "No";
else
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
while (cin >> a) nums.insert(a);
cout << ((nums.size() == 2) ? "Yes" : "No") << endl;
}
int main() {
setIO();
while (tt--) {
solve();
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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 modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
const ll MOD = 1e9 + 7;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
rep(i, N) cin >> A[i];
rep(i, M) cin >> B[i];
sort(A.rbegin(), A.rend());
sort(B.rbegin(), B.rend());
queue<int> qA, qB;
rep(i, N) qA.push(A[i]);
rep(i, M) qB.push(B[i]);
int now = N * M;
ll ans = 1;
ll cnt_a = 0;
ll cnt_b = 0;
while(now > 0){
int fa = -1;
int fb = -1;
if(qA.size() > 0){
fa = qA.front();
}
if(qB.size() > 0){
fb = qB.front();
}
if(fb == now && fa == fb){
qA.pop();
qB.pop();
cnt_a++;
cnt_b++;
now--;
}else if(fb == now){
ans = (ans * cnt_a) % MOD;
qB.pop();
cnt_b++;
now--;
}else if(fa == now){
ans = (ans * cnt_b) % MOD;
qA.pop();
cnt_a++;
now--;
}else{
if(cnt_a * cnt_b - (N * M - now) <= 0){
ans = 0;
}else{
ans = (ans * (cnt_a * cnt_b - (N * M - now))) % MOD;
}
now--;
}
}
cout << ans << endl;
return 0;
}
| #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <complex>
#include <cstdint>
#include <tuple>
#define M_PI 3.14159265358979323846
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
map<int, int> mp;
vector<LL> A, B, arr;
bool ok[1000*1000+1];
int main() {
int N = readInt();
int M = readInt();
REP(i, N) {
int a = readInt();
A.push_back(a);
mp[a]++;
}
for(auto e: mp){
if(e.second>=2){
cout << 0 << endl;
return 0;
}
}
REP(i, M){
int b = readInt();
B.push_back(b);
mp[b]++;
}
for(int i=0; i<N; ++i){
for(int j=0; j<M; ++j){
arr.PB(min(A[i], B[j]));
}
}
//for(int i=0; i<N*M; ++i) cout << arr[i] << endl;
sort(arr.begin(), arr.end());
for(auto e: mp){
if(e.second>=3){
cout << 0 << endl;
return 0;
}else if(e.second==2){
ok[e.first] = true;
}
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
//for(int i=0; i<N*M; ++i) cout << arr[i] << endl;
LL ans=1;
for(int i=N*M; i>=2; --i){
if(ok[i]){
continue;
}
if((A.end() - lower_bound(A.begin(), A.end(), i)) * (B.end() - lower_bound(B.begin(), B.end(), i)) - (N*M-i) <= 0) {
cout << 0 << endl;
return 0;
}
if(find(A.begin(), A.end(), i)!=A.end()){
ans *= B.end() - lower_bound(B.begin(), B.end(), i);
}else if(find(B.begin(), B.end(), i)!=B.end()){
ans *= A.end() - lower_bound(A.begin(), A.end(), i);
}else{
ans *= (A.end() - lower_bound(A.begin(), A.end(), i)) * (B.end() - lower_bound(B.begin(), B.end(), i)) - (N*M-i);
}ans %= MOD;
}
cout << ans << endl;
return 0;
} | 1 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
#endif
#define ITER(c) __typeof__((c).begin())
#define FOREACH(it, c) for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c) __typeof__((c).rbegin())
#define RFOREACH(it, c) for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n) REPEAT(i, 0, n)
#define REPEAT(i, k, n) for (int i = (k); i < (n); ++i)
#define REVREP(i, n) for (int i = ((n)-1); i >= 0; --i)
#define FIND(c, n) std::find((c).begin(), (c).end(), (n));
#define BSEARCH(c, n) std::binary_search((c).begin(), (c).end(), (n))
#define LLPOW(p1,p2) ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A) (sizeof(A)/sizeof((A)[0]))
#define MIN(p1,p2) (((p1)<(p2))?(p1):(p2))
#define MAX(p1,p2) (((p1)>(p2))?(p1):(p2))
#define CIN_NO_SYNC do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p) fgets((p), sizeof(p), stdin)
#define CHOMP(p) do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n') *_q = 0; } while(0)
typedef long long ll;
typedef unsigned long long ull;
#ifdef _DEBUG
#define pf printf
#define pr(n) do { cout << #n " = " << (n) << endl; } while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#endif
namespace roman {
struct romantbl_t {
const char *rom;
int num;
} table[] = {
{ "M", 1000, },
{ "CM", 900, },
{ "D", 500, },
{ "CD", 400, },
{ "C", 100, },
{ "XC", 90, },
{ "L", 50, },
{ "XL", 40, },
{ "X", 10, },
{ "IX", 9, },
{ "V", 5, },
{ "IV", 4, },
{ "I", 1, },
};
map<int,string> num2rom;
map<string,int> rom2num;
void romaninit(){
for(int i = 0; i < sizeof(table)/sizeof(table[0]); i++){
rom2num.insert(make_pair(table[i].rom, table[i].num));
num2rom.insert(make_pair(table[i].num, table[i].rom));
}
}
int roman2num(string rom){
int len = rom.length();
int t = 0, p = 0;
for(int i = len - 1; i >= 0; i--){
string c = rom.substr(i,1);
int n = rom2num[c];
if(n < p){ t -= n; } else { t += n; }
p = n;
}
return t;
}
string num2roman(int num){
string t;
for(int i = 0; i < sizeof(table)/sizeof(table[0]); i++){
int n = table[i].num;
while(num >= n){
t += num2rom[n]; num -= n;
}
}
return t;
}
}
using namespace roman;
int main(){
string s;
romaninit();
while(getline(cin, s)){
cout << roman2num(s) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
// #define mod (998244353ll)
const long long INF = 1LL << 60;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll v(n);
rep(i, n) {
cin >> v[i];
}
map<ll, ll> odd, even;
rep(i, n) {
if (i % 2 == 0) {
odd[v[i]]++;
} else {
even[v[i]]++;
}
}
ll k = n / 2;
ll ans = 0;
priority_queue<P> oq, eq;
for (auto it : odd) {
oq.emplace(it.second, it.first);
}
oq.emplace(0, -1);
for (auto it : even) {
eq.emplace(it.second, it.first);
}
eq.emplace(0, -1);
if (oq.top().second != eq.top().second) {
ans = n - (oq.top().first + eq.top().first);
} else {
ll ot, et;
ot = oq.top().first;
et = eq.top().first;
oq.pop();
eq.pop();
ans = n - (ot + eq.top().first);
chmin(ans, n - (et + oq.top().first));
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N = 1010;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int _w;
int n, m;
char str[N][N];
int dis[N][N];
queue<pii> q;
bool inside( int x, int y ) {
return x >= 1 && x <= n && y >= 1 && y <= m;
}
int main() {
_w = scanf( "%d%d", &n, &m );
for( int i = 1; i <= n; ++i )
_w = scanf( "%s", str[i]+1 );
memset(dis, -1, sizeof dis);
for( int i = 1; i <= n; ++i )
for( int j = 1; j <= m; ++j )
if( str[i][j] == '#' )
dis[i][j] = 0, q.push( pii(i, j) );
int ans = 0;
while( !q.empty() ) {
pii now = q.front(); q.pop();
ans = max(ans, dis[now.first][now.second]);
for( int i = 0; i < 4; ++i ) {
int nx = now.first + dx[i];
int ny = now.second + dy[i];
if( inside(nx, ny) && dis[nx][ny] == -1 ) {
dis[nx][ny] = dis[now.first][now.second] + 1;
q.push( pii(nx, ny) );
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
#define cout(val) cout << (val) << endl
using namespace std;
typedef long long ll;
int main(){
int h, w;
char t;
cin >> h >> w;
vector<vector<bool>> c(h, vector<bool>(w, false));
queue<pair<int, int>> que1, que2;
rep(i, h) rep(j, w){
cin >> t;
if(t == '#'){
que2.push(make_pair(i, j));
c[i][j] = true;
}
}
pair<int, int> p;
vector<int> dy ={1,0,-1,0}, dx={0,1,0,-1};
int tx, ty, result = 0;
while(!que2.empty()){
++result;
que2.swap(que1);
while(!que1.empty()){
p = que1.front();
que1.pop();
rep(i, 4){
ty = p.first + dy[i];
tx = p.second + dx[i];
if(ty==-1||tx==-1||ty==h||tx==w||c[ty][tx]) continue;
que2.push(make_pair(ty, tx));
c[ty][tx] = true;
}
}
}
cout(result-1);
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.