code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
string s; cin >> s;
rep(i,3){
if(s[i] == '7'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int ans=INT_MAX;
string s;
cin>>s;
for(int i=0; i<=s.length()-3; i++)
{
int val=0;
for(int j=0; j<3; j++)
{
val*=10;
val+=(s[j+i]-'0');
}
ans=min(ans,abs(753-val));
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin>>N>>M>>X>>Y;
int k=X,l=Y;
for(int i=0;i<N;i++){
int j=0;
cin>>j;
k=max(k,j);
}
for(int i=0;i<M;i++){
int j=0;
cin>>j;
l=min(l,j);
}
if(k<l)
cout<<"No War"<<endl;
else
cout<<"War"<<endl;
} | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back
#define po pop_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii ;
typedef vector<ll> vi ;
typedef vector<ii> vii ;
const ll MAX = 10000000;
const ll inf = 5e18-1;
int main() {
fastio;
ll h,w,a,b;
cin >> h >> w >> a >> b;
f(i,0,h){
f(j,0,w){
ll x = ((i < b)^(j < a));
cout << x;
}
cout << '\n';
}
return 0;
} | 0 |
#include <cstdio>
using ll = long long;
inline ll gcd(ll x, ll y)
{
while (y)
{
auto r = x % y;
x = y;
y = r;
}
return x;
}
inline bool chk(int n)
{
for (int i = 2; i * i <= n; i++)
{
if (!(n % i))
return false;
}
return true;
}
inline ll lcm(ll x, ll y) { return x && y ? x / gcd(x, y) * y : x + y; }
ll pri[1005], arr[505][505];
int main()
{
// freopen("AGC027-D.in", "r", stdin);
int n, cur = 0, len = 0;
scanf("%d", &n);
bool even = n & 1 ^ 1;
n += even;
for (int i = 2; len <= n * 2; i++)
{
if (chk(i))
pri[len++] = i;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
arr[i][j] = 1;
}
for (int i = 0; i < n; i += 2, cur++)
{
int x = i, y = 0;
while (x < n && y < n)
arr[x++][y++] *= pri[cur];
}
for (int i = 2; i < n; i += 2, cur++)
{
int x = 0, y = i;
while (x < n && y < n)
arr[x++][y++] *= pri[cur];
}
cur = len - 1;
for (int i = 0; i < n; i += 2, cur--)
{
int x = i, y = 0;
while (x >= 0 && y < n)
arr[x--][y++] *= pri[cur];
}
for (int i = 2; i < n; i += 2, cur--)
{
int x = n - 1, y = i;
while (x >= 0 && y < n)
arr[x--][y++] *= pri[cur];
}
for (int i = 0; i < n; i++)
{
for (int j = i & 1 ^ 1; j < n; j += 2)
arr[i][j] = lcm(lcm(i ? arr[i - 1][j] : 0, j ? arr[i][j - 1] : 0),
lcm(arr[i + 1][j], arr[i][j + 1])) + 1;
}
n -= even;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%lld%c", arr[i][j], " \n"[j + 1 == n]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using pdd = pair<double, double>;
int main() {
int N; cin >> N;
vector<pdd> points(N);
for (int i = 0; i < N; i++) {
double x, y; cin >> x >> y;
points[i] = make_pair(x, y);
}
vector<vector<double>> dist(N, vector<double>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dist[i][j] = sqrt(pow(points[i].first - points[j].first, 2) + pow(points[i].second - points[j].second, 2));
}
}
vector<int> perm(N);
for (int i = 0; i < N; i++) perm[i] = i;
double ans = 0;
double n_fact = 1.0;
for (int i = 1; i <= N; i++) n_fact *= i;
do {
double pathlen = 0;
for (int i = 0; i < N - 1; i++) pathlen += dist[perm[i]][perm[i+1]];
ans += pathlen / n_fact;
} while (next_permutation(perm.begin(), perm.end()));
cout << fixed << setprecision(10) << ans << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long> v;
for (int i = 0; i < n; ++i) {
long x;
cin >> x;
v.push_back(x);
}
cout << *min_element(v.begin(), v.end()) << " ";
cout << *max_element(v.begin(), v.end()) << " ";
cout << accumulate(v.begin(), v.end(), 0L) << "\n";
} | #include <iostream>
using namespace std;
int main(void){
long long n,a,min=1000000,max=-1000000,s=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a>max)max=a;
if(a<min)min=a;
s=s+a;
}
cout<<min<<" "<<max<<" "<<s<<endl;
}
| 1 |
/*
飲んだ魔剤で家が建つ。
created at: 2020-04-19 14:53:28
2020-04-19 16:16:46 余計な部分を削った版
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define INF 1000000000
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main()
{
int n;
cin >> n;
vector<pair<int, int>> red(n), blue(n);
for (int i = 0; i < n; i++)
cin >> red[i].first >> red[i].second;
for (int i = 0; i < n; i++)
cin >> blue[i].first >> blue[i].second;
sort(all(red), compare_by_b);
reverse(all(red));
sort(all(blue));
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
pair<int, int> r = red[j];
pair<int, int> b = blue[i];
if (r.first < b.first && r.second < b.second) {
// cout << r.first << "," << r.second << " " << b.first << "," << b.second << endl;
ans++;
red[j].second = INF;
break;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define INF 10000000
#define rep(i,a,b) for(ll (i)=a;(i)<(ll)(b);(i)++)
using ipair = pair<ll,ll>;
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A&lang=jp
vector<vector<ll>> capacity;
vector<vector<ll>> flow;
vector<ll> pred;
//増加させることができる経路を探す
//可能経路は，predに保存される ex. pred[v] = u ... u->vの経路
bool findPath(ll s, ll t){
ll N = capacity.size();
pred.assign(N,-1);
//幅優先探索
queue<ll> que; que.push(s);
while(!que.empty()){
ll u = que.front(); que.pop();
//Flowネットワークを調べる
for(ll v=0;v<N;v++){
//「経路がある」「先の点が未探索」「増加可能」
if(capacity[u][v]>0 && pred[v]==-1 && capacity[u][v]>flow[u][v]){
pred[v] = u;
if (v== t) return true;
que.push(v);
}
}
//残余ネットワークを調べる
for(ll v=0;v<N;v++){
if(capacity[v][u]>0 && pred[v]==-1 && flow[v][u]>0){
pred[v] = u;
que.push(v);
}
}
}
return false;
}
//ネットワークを更新する．
void update(ll s, ll t){
ll tmp,u,v,delta = INF;//増加分
//最小の増加量をtargetから遡って探す
v = t;
while(v!=s){
u = pred[v];
if(capacity[u][v]>0) tmp = capacity[u][v] -flow[u][v];
else if (capacity[v][u]>0) tmp = flow[v][u];
delta = min(delta,tmp);
v = u;
}
//求まった増加量を実際のネットワークに反映させる
v = t;
while(v!=s){
u = pred[v];
if(capacity[u][v]>0) flow[u][v] += delta;
else if (capacity[v][u]>0) flow[v][u] -= delta;
v = u;
}
}
ll edmonds_karp(ll s, ll t){
//増加経路を探索し，見つかったら更新する
while(1){
if(findPath(s,t)==false) break;
else update(s,t);
}
ll ans = 0;
for(ll v=0;v<capacity.size();v++) ans += flow[s][v];
return ans;
}
int main(){
ll N;
cin >> N;
ll nodeNum = N+N+2;
capacity.assign((nodeNum),vector<ll>((nodeNum),0));
flow.assign((nodeNum),vector<ll>((nodeNum),0));
vector<ipair> red(N),blue(N);
rep(i,0,N) cin >> red[i].first >> red[i].second;
rep(i,0,N) cin >> blue[i].first >> blue[i].second;
sort(red.begin(),red.end());
sort(blue.begin(),blue.end());
//条件を満たすノードを追加
rep(i,0,N){//blue
rep(j,0,N){//red
if(blue[i].first<=red[j].first) break;
else if(blue[i].second>red[j].second) capacity[i][N+j]=1;
}
}
//start[2N] -> blue -> red -> end[2N+1]
rep(i,0,N){
capacity[nodeNum-2][i] = 1;
capacity[N+i][nodeNum-1] = 1;
}
cout << edmonds_karp(nodeNum-2,nodeNum-1) << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = 0x3F3F3F3F;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const double EPS = 1e-10;
const ll mod = 1e9 + 7;
inline int cmp(double x, double y = 0)
{
if(fabs(x - y) < EPS)
return 0;
return x > y ? 1 : -1;
}
ll exp(ll a, ll b)
{
ll ans = 1;
while(b)
{
if(b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
const int maxn = 85;
ll fat[maxn], inv[maxn];
ll C(int n, int k)
{
if(n < k)
return 0;
if(n < 0 || k < 0)
return 0;
return (((fat[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
void initFactorials()
{
fat[0] = 1;
inv[0] = 1;
for(int i = 1; i < maxn; i++)
{
fat[i] = (i * fat[i-1]) % mod;
inv[i] = exp(fat[i], mod - 2);
}
}
int dp[maxn][maxn][2 * maxn * maxn];
ll a[maxn][maxn];
ll b[maxn][maxn];
int n,m;
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for(int i = 0 ; i < n; i++)
for(int j = 0; j < m; j++)
cin >> a[i][j];
for(int i = 0 ; i < n; i++)
for(int j = 0; j < m; j++)
cin >> b[i][j];
dp[0][0][abs(a[0][0] - b[0][0])] = true;
for(int i = 0; i < n; i++)
{
for(int j = 0 ; j < m; j++)
{
for(int k = 0; k < (n + m) * maxn; k++)
{
if(i > 0)
{
dp[i][j][k] = dp[i - 1][j][k + abs(a[i][j] - b[i][j])] |
dp[i - 1][j][abs(k - abs(a[i][j] - b[i][j]))];
}
if(j > 0)
{
dp[i][j][k] = dp[i][j][k] |
dp[i][j - 1][k + abs(a[i][j] - b[i][j])] |
dp[i][j - 1][abs(k - abs(a[i][j] - b[i][j]))];
}
}
}
}
for(int i = 0; i < (n + m) * maxn; i++)
{
if(dp[n - 1][m - 1][i] == 1)
{
cout << i << endl;
return 0;
}
}
return 0;
} | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, m, result = 0;
cin >> n >> m;
long long x[n], y[m];
for (long long i = 0; i < n; i++) {
cin >> x[i];
}
for (long long i = 0; i < m; i++) {
cin >> y[i];
}
long long left = 0, right = 0;
for (long long i = 1, prefix = y[0]; i < m; i++) {
left = (left + MOD - prefix + i * y[i]) % MOD;
prefix = (prefix + y[i]) % MOD;
}
for (long long i = 1, prefix = x[0]; i < n; i++) {
right = (right + MOD - prefix + i * x[i]) % MOD;
prefix = (prefix + x[i]) % MOD;
}
cout << (left * right) % MOD;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define x first
#define y second
#define mp make_pair
#define pb push_back
template <typename TYPE> inline void chkmax(TYPE &x,TYPE y){x<y?x=y:0;}
template <typename TYPE> inline void chkmin(TYPE &x,TYPE y){y<x?x=y:0;}
template <typename TYPE> void readint(TYPE &x)
{
x=0;int f=1;char c;
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=x*10+c-'0';
x*=f;
}
const int MAXN=605;
int n,m,dx[MAXN*4],dy[MAXN*4];
void work(int d)
{
m=0;
for(int i=-n;i<=n;++i)
for(int j=-n;j<=n;++j)
if(i*i+j*j==d)dx[++m]=i,dy[m]=j;
}
int c1[MAXN][MAXN],c2[MAXN][MAXN];
void dfs(int x,int y,int c[MAXN][MAXN])
{
int tx,ty;
for(int i=1;i<=m;++i)
{
tx=x+dx[i],ty=y+dy[i];
if(tx<0 || ty<0 || tx>=n || ty>=n || c[tx][ty])continue;
c[tx][ty]=3-c[x][y];
dfs(tx,ty,c);
}
}
int main()
{
#ifndef ONLINE_JUDGE
// freopen("code.in","r",stdin);
// freopen("code.out","w",stdout);
#endif
int d;
readint(n);n*=2;
readint(d);work(d);
for(int x=0;x<n;++x)
for(int y=0;y<n;++y)
{
if(c1[x][y])continue;
c1[x][y]=1;
dfs(x,y,c1);
}
readint(d);work(d);
for(int x=0;x<n;++x)
for(int y=0;y<n;++y)
{
if(c2[x][y])continue;
c2[x][y]=1;
dfs(x,y,c2);
}
for(int i=1;i<=2;++i)
for(int j=1;j<=2;++j)
{
int ans=0;
for(int x=0;x<n;++x)
for(int y=0;y<n;++y)
if(c1[x][y]==i && c2[x][y]==j)++ans;
if(ans*4>=n*n)
{
ans=n*n/4;
for(int x=0;x<n;++x)
for(int y=0;y<n;++y)
if(c1[x][y]==i && c2[x][y]==j)
{
printf("%d %d\n",x,y);
--ans;
if(!ans)return 0;
}
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
vector< pair< double, string > > ans;
for(int i = 0; i < n; i++) {
string str;
int p, a, b, c, d, e, f, s, m;
cin >> str >> p >> a >> b >> c >> d >> e >> f >> s >> m;
int t = a + b + c + (d + e) * m;
int cnt = f * m;
ans.push_back(make_pair(-(cnt * s - p) / (double)t, str));
}
sort(ans.begin(), ans.end());
for(int i = 0; i < n; i++) {
cout << ans[i].second << endl;
} cout << "#" << endl;
}
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(int i=0,_i=(n);i<_i;++i)
#define _rep3(i,a,b) for(int i=(a),_i=(b),_ii=(b)>(a)?1:-1;abs(_i-i)>0;i+=_ii)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define all(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
signed main() {
ll N, M, V, P;
ins(N, M, V, P);
vector<ll> A(N);
rep(i, N)
cin >> A[i];
all(sort, A); all(reverse, A);
int ok = -1, ng = N;
auto f = [&](int mid) {
if (mid < P) return true;
if (A[P-1] > A[mid]+M) return false;
ll tmp = 1LL * ((N-mid)+P-1) * M;
rep(i, P-1, mid)
tmp += min(1LL*M, max(0LL, A[mid]+M-A[i]));
return tmp >= M*V;
};
while (abs(ok - ng) > 1) {
int mid = ok + (ng-ok) / 2;
(f(mid) ? ok : ng) = mid;
}
cout << ok+1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
// 二分探索
// 求める点以上の場合にtrueを返すよう実装する。
template <class V>
V binary_search(V _l, V _r, function<bool(V)> f) {
V l = _l, r = _r;
while(r>l) {
ll mid = (l+r)/2;
if (f(mid)) {
r = mid;
} else {
l = mid;
}
if (l+1==r) {
if (f(l)) {
r = l;
} else {
l = r;
}
}
}
return l;
}
/* verified by atcoder agc 041 b
https://atcoder.jp/contests/agc041/tasks/agc041_b */
vector<ll> a;
ll n,m,v,p;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n>>m>>v>>p;
a.assign(n,0);
rep(i,n) cin>>a[i];
sort(begin(a), end(a));
function<bool(ll)> chk = [&](ll idx) {
if (a[idx]+m<a[n-p]) {
return false;
}
ll cnt = 0;
rep(i,n) {
if (i>n-p||i<=idx) {
cnt += m;
}
else {
cnt += max(0LL, a[idx]+m-a[i]);
}
}
return cnt >= m*v;
};
ll l = binary_search(0LL, n-1, chk);
cout << n-l << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int N,P;
int D[55];
bool check(int ind){
for(int i=0;i<N;i++){
if( i == ind ) continue;
if( D[i] ) return false;
}
return true;
}
int main(){
while( cin >> N >> P && (N||P) ) {
memset(D,0,sizeof(D));
int ind = 0;
while( 1 ){
if( P ){
P--;
D[ind]++;
if( P == 0 ){
if( check(ind) ) break;
}
} else {
P += D[ind];
D[ind]=0;
}
ind++;
ind%=N;
}
cout << ind << endl;
}
} | #include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};
int W, H;
int curl[22][22];
int ans;
P s;
bool inCurl(int x, int y)
{
return (x >= 0 && y >= 0 && x < W && y < H);
}
void dfs(int x, int y, int n)
{
if (n >= ans)
return;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if (!inCurl(nx, ny))
continue;
if (curl[ny][nx] == 1)
continue;
while (true) {
if (curl[ny][nx] == 3) {
ans = n;
return;
}
nx += dx[i];
ny += dy[i];
if (!inCurl(nx, ny))
break;
if (curl[ny][nx] == 1) {
curl[ny][nx] = 0;
dfs(nx - dx[i], ny - dy[i], n + 1);
curl[ny][nx] = 1;
break;
}
}
}
}
int main()
{
while (cin >> W >> H, W && H) {
// Input
for (int y = 0; y < H; y++)
for (int x = 0; x < W; x++) {
cin >> curl[y][x];
if (curl[y][x] == 2) {
s.first = x;
s.second = y;
curl[y][x] = 0;
}
}
ans = 11;
dfs(s.first, s.second, 1);
if (ans > 10)
cout << -1 << endl;
else
cout << ans << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str, instruction, temp;
int a,b,q;
cin >> str;
cin >> q;
for (int i = 0; i < q; i++){
cin >> instruction >> a >> b;
if (instruction == "replace"){
cin >> temp;
str.replace (a, (b-a)+1, temp);
}
else if (instruction == "reverse"){
for (int i = a, j = b; i < ((a + b) / 2)+1; i++, j--){
char temp = str[j];
str[j] = str[i];
str[i] = temp;
}
}
else if (instruction == "print"){
for (int i = a; i < b + 1; i++){
cout << str[i];
}
cout << "\n";
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back
using namespace std;
int main() {
int n, tmp;
string s, res, station = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
while (cin >> n, n) {
int key[n];
for (int i = 0; i < n; i++) {
cin >> tmp;
key[i] = tmp;
}
cin >> s;
res = "";
for (int i = 0; i < s.length(); i++) {
res += station[(station.find(s[i])-key[i%n]+52)%52];
}
cout << res << el;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t M,a=0,b=0;
cin>>M;
for(int64_t i=0;i<M;i++){
int64_t x,y;
cin>>x>>y;
a+=x*y;
b+=y;
}
cout<<(a-1)/9+b-1<<endl;
} | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
#define int long long
int n,tot,sum;
signed main(){
read(n);
for(int i=1,x,y;i<=n;i++){
read(x,y);
tot+=y;sum+=x*y;
}
write(tot-1+(sum-1)/9);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a)%mod;
}
a=((a%mod)*(a%mod))%mod;
b>>=1;
}
return ans;
}
void sieve(int n){
bool prime[n+1];
memset(prime,true,sizeof(prime));
for(int p=2;p*p<=n;p++){
if(prime[p]){
for(int i=p*p;i<=n;i+=p)
prime[i]=false;
}
}
for(int p=2;p<=n;p++){
if(prime[p])
cout<<p<<" ";
}
}
int ans(int index,int time,int t,vector<pair<int,int>>& v,vector<vector<int>>& value){
if(index>=v.size())
return 0;
if(time>=t)
return 0;
if(value[index][time]!=-1)
return value[index][time];
int returnVal=0;
returnVal = v[index].second + ans(index+1,time+v[index].first,t,v,value);
returnVal = max(returnVal,ans(index+1,time,t,v,value));
value[index][time]=returnVal;
return returnVal;
}
int main() {
IOS;
int n,t;
cin>>n>>t;
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
int p,q;
cin>>p>>q;
v.push_back({p,q});
}
sort(v.begin(),v.end());
std::vector<vector<int>> va(n+1,vector<int> (t+1,-1));
cout<<ans(0,0,t,v,va);
return 0;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
struct UnionFind {
vector<ll> par, sizes;
ll cnt;
UnionFind(ll N) : par(N), sizes(N, 1), cnt(N) {
for (ll i = 0; i < N; i++) par[i] = i;
}
ll find(ll x) { return par[x] == x ? x : par[x] = find(par[x]); }
bool same(ll x, ll y) { return find(x) == find(y); }
ll size(ll x) { return sizes[find(x)]; }
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
cnt--;
}
ll count() const { return cnt; }
};
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n, t;
cin >> n >> t;
vll as(n), bs(n);
rep(i, n) cin >> as[i] >> bs[i];
vvll dp1(n + 1, vll(t, 0));
vvll dp2(n + 2, vll(t, 0));
rep(i, n) {
rep(j, t - 1) {
dp1.at(i + 1).at(j + 1) = dp1.at(i + 1).at(j);
chmax(dp1.at(i + 1).at(j + 1), dp1.at(i).at(j + 1));
if (j + 1 - as[i] >= 0)
chmax(dp1.at(i + 1).at(j + 1), bs[i] + dp1.at(i).at(j + 1 - as[i]));
}
}
rep(i, n) {
rep(j, t - 1) {
dp2.at(i + 1).at(j + 1) = dp2.at(i + 1).at(j);
chmax(dp2.at(i + 1).at(j + 1), dp2.at(i).at(j + 1));
if (j + 1 - as[n - 1 - i] >= 0)
chmax(dp2.at(i + 1).at(j + 1),
bs[n - 1 - i] + dp2.at(i).at(j + 1 - as[n - 1 - i]));
}
}
ll juee = 0;
rep(i, n) {
rep(j, t){
ll tmp = dp1[i][j] + bs[i] + dp2[n - 1 - i][t - 1 - j];
chmax(juee, tmp);
}
}
cout << juee << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int a=h2-h1;
int b=m2-m1;
int c=(a*60+b)-k;
cout<<c<<endl;
exit(0);
}
| #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
//constexpr int MOD=1000000007;
constexpr int MOD=998244353;
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=2e5+5;
int main(void){
lint n,m,d;
cin >> n >> m >> d;
cout << (d?2:1)*(n-d)*(m-1)/pow(n,2) << endl;
} | 0 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=2e5+100;
const int M=4e5+100;
int head1[N],ver1[M],Next1[M];
int tot1,tot2;
int add1(int x,int y)
{
ver1[++tot1]=y;
Next1[tot1]=head1[x];
head1[x]=tot1;
}
int head2[N],ver2[M],Next2[M];
int add2(int x,int y)
{
ver2[++tot2]=y;
Next2[tot2]=head2[x];
head2[x]=tot2;
}
int cnt=0;
int c1[N],c2[N];
void dfs1(int x)
{
c1[x]=cnt;
for(int i=head1[x];i;i=Next1[i])
{
int y=ver1[i];
if(c1[y])continue;
dfs1(y);
}
}
void dfs2(int x)
{
c2[x]=cnt;
for(int i=head2[x];i;i=Next2[i])
{
int y=ver2[i];
if(c2[y])continue;
dfs2(y);
}
}
map<pair<int,int>,int>MM;
int main()
{
int n,k,l;
while(cin>>n>>k>>l)
{
MM.clear();
memset(head1,0,sizeof(head1));
memset(ver1,0,sizeof(ver1));
memset(Next1,0,sizeof(Next1));
memset(head2,0,sizeof(head2));
memset(ver2,0,sizeof(ver2));
memset(Next2,0,sizeof(Next2));
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
tot1=0;
tot2=0;
for(int i=1;i<=k;i++)
{
int x,y;
cin>>x>>y;
add1(x,y);
add1(y,x);
}
for(int i=1;i<=l;i++)
{
int x,y;
cin>>x>>y;
add2(x,y);
add2(y,x);
}
for(int i=1;i<=n;i++)
{
if(c1[i]==0)
{
cnt++;
dfs1(i);
}
}
cnt=0;
for(int i=1;i<=n;i++)
{
if(c2[i]==0)
{
cnt++;
dfs2(i);
}
}
for(int i=1;i<=n;i++)
MM[make_pair(c1[i],c2[i])]++;
for(int i=1;i<=n;i++)
{
cout<<MM[make_pair(c1[i],c2[i])]<<" ";
if(i==n)cout<<endl;
}
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
#define ROF(i,a,b) for(ll i=a;i>=b;i--)
#define per(i,a) ROF(i,a,0)
#define pb push_back
#define mp make_pair
const ll MOD=1000000007;
const ll MOD2=998244353;
const ld PI=acos(-1);
const ll INF=1e18;
st abc="abcdefghijklmnopqrstuvwxyz";
st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
int main() {
ll N,M,Q;
cin >> N >> M >> Q;
vvl cnt(N+1,vl(N+1,0));
rep(i,M){
ll L,R;
cin >> L >> R;
cnt[L][R]++;
}
FOR(i,0,N+1){
FOR(j,1,N+1){
cnt[i][j]+=cnt[i][j-1];
}
}
FOR(i,1,N+1){
FOR(j,0,N+1){
cnt[i][j]+=cnt[i-1][j];
}
}
rep(i,Q){
ll p,q;
cin >> p >> q;
p--;
cout << cnt[p][p]+cnt[q][q]-cnt[p][q]-cnt[q][p] << endl;
}
} | 0 |
#include <cstdio>
#include <vector>
using namespace std;
vector<int> a[1000];
bool v[1000];
int s, prevv[1000], n, m, x, y;
void dfs(int cur){
v[cur] = true;
for (auto e : a[cur]){
if (e == s){
prevv[e] = cur;
}
if (!v[e]){
prevv[e] = cur;
dfs(e);
}
}
}
vector<int> optimize(vector<int> p){
bool b[n];
fill(b, b + n, false);
for (int i = 0; i < p.size(); i++) b[p[i]] = true;
for (int i = 0; i < p.size(); i++){
int temp = i - 1;
if (i == 0) temp = p.size() - 1;
for (auto e : a[p[i]]){
if (b[e] && e != p[temp]){
vector<int> np;
np.emplace_back(p[i]);
int cur = i;
while (p[cur] != e){
cur++;
if (cur == p.size()) cur = 0;
np.emplace_back(p[cur]);
}
return optimize(np);
}
}
}
return p;
}
int main(){
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
scanf("%d %d", &x, &y);
a[x - 1].emplace_back(y - 1);
}
for (s = 0; s < n; s++){
fill(v, v + n, false);
fill(prevv, prevv + n, -1);
dfs(s);
if (prevv[s] != -1){
vector<int> p;
p.emplace_back(s);
int cur = prevv[s];
while (cur != s){
p.emplace_back(cur);
cur = prevv[cur];
}
vector<int> bruh = optimize(p);
printf("%d\n", bruh.size());
for (int i = 0; i < bruh.size(); i++) printf("%d\n", bruh[i] + 1);
return 0;
}
}
printf("-1\n");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#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 FOR(i,a,b) for(int i=(a);i<(b);i++)
#define PB push_back
#define EB emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define no cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
ll pos=-1;
const ll MAX_N=1001;
vector<bool> visited,finished;
vvll edge(MAX_N);
vll hist;
void dfs(ll now){
visited[now]=true;
hist.push_back(now);
for(auto e:edge[now]){
if(finished[e])
continue;
if(visited[e]&&!finished[e]){
pos=e;
return;
}
dfs(e);
if(pos!=-1)
return;
}
hist.pop_back();
finished[now]=true;
return;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin>>n>>m;
REP(i,m){
ll a,b;
cin>>a>>b;
a--;
b--;
edge[a].push_back(b);
}
//find cycle
visited.assign(n,false);
finished.assign(n,false);
pos=-1;
REP(i,n){
dfs(i);
if(pos!=-1)
break;
}
if(pos==-1){
cout<<-1<<endl;
return 0;
}
//restoration cycle
vll cycle;
while(true){
ll t=hist.back();
hist.pop_back();
cycle.push_back(t);
if(pos==t)
break;
}
reverse(ALL(cycle));
//minimize
while(true){
ll nc=cycle.size();
vll table(n,-1);
REP(i,nc)table[cycle[i]]=i;
ll from=-1,to=-1;
REP(i,nc){
for(auto e:edge[cycle[i]]){
if(table[e]!=(i+1)%nc && table[e]!=-1){
from=i;
to=table[e];
}
}
}
if(from==-1)
break;
vll ncycle;
ll cur=to;
while(true){
ncycle.push_back(cycle[cur]);
cur=(cur+1)%nc;
if(cur==from)
break;
}
ncycle.push_back(cycle[from]);
cycle=ncycle;
}
cout<<cycle.size()<<endl;
REP(i,cycle.size())cout<<cycle[i]+1<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<int> arr(n+1);
for(int i = 1; i <= n; i++) cin>>arr[i];
vector<ll> pf(n+1);
vector<ll> dp(n+1,LLONG_MIN);
for(int i = 1; i <= n; i++) if(i&1) pf[i]+=arr[i]+pf[i-2 < 0 ? 0 : i-2]; // pref of odd sum
dp[0] = 0;
dp[1] = 0;
for(int i = 2; i <= n; i++){
if(i&1) dp[i] = max(dp[i-1],arr[i]+dp[i-2]); // for odd
else dp[i] = max(pf[i-1],dp[i-2]+arr[i]); //for even
}
cout<<dp[n];
}
| #include <bits/stdc++.h>
//#include "atcoder/all"
typedef long long int ll;
using namespace std;
// using namespace atcoder;
#define MAXN 200001
#define INF -200000000000000
ll a[MAXN];
ll dp[MAXN][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < MAXN; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = INF;
}
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1][0] = a[1];
dp[1][1] = a[2];
dp[1][2] = a[3];
for (int i = 2; i <= n / 2; i++) {
dp[i][0] = dp[i - 1][0] + a[i * 2 - 1];
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0]) + a[i * 2];
if (n % 2) dp[i][2] = max(dp[i - 1][2], max(dp[i - 1][1], dp[i - 1][0])) + a[i * 2 + 1];
}
if (n % 2) cout << max(max(dp[n / 2][2], dp[n / 2][1]), dp[n / 2][0]) << endl;
else cout << max(dp[n / 2][1], dp[n / 2][0]) << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int>vec(5);
cin >> vec[0] >> vec[1] >> vec[2] >> vec[3] >> vec[4];
int k;
cin >> k;
bool x = true;
for(int i=0; i<4; i++){
for(int j=i+1; j<5; j++){
if(vec[j]-vec[i] > k){
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
}
| #include <bits/stdc++.h>
#define fast_io ios :: sync_with_stdio(false);
using namespace std;
int main() {
cout << fixed << setprecision(3);
fast_io;
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a<=k)cout<<"Yay!";
else cout<<":(";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
#define chmin(x,y) x = min(x,y)
int main(){
int n,k;
cin >> n >> k;
ve<int> x(n),y(n);
rep(i,n) cin >> x[i];
rep(i,n) y[i] = -x[n-1-i];
int ans = 2e9;
rep(i,n-k+1){
int memo = abs(x[i]) + (x[i+k-1]-x[i]);
ans = min(ans,memo);
memo = abs(y[i]) + y[i+k-1]-y[i];
ans = min(ans,memo);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, K;
vector<ll> v;
int main() {
cin >> N >> K;
v.resize(N);
rep(i, N) cin >> v[i];
bool zero_exist = false;
rep(i, N) {
if (v[i] == 0) {
zero_exist = true;
}
}
ll ans = INF;
if (!zero_exist) {
v.push_back(0);
K++;
}
sort(v.begin(), v.end());
ll zero_idx = lower_bound(v.begin(), v.end(), 0) - v.begin();
// cout << zero_idx << endl;
for (int i = 0; i <= N + 1 - K; i++) {
ll r = i + K - 1;
ll l = i;
if (l <= zero_idx && zero_idx <= r) {
ll tmp = INF;
// 一直線
if (v[r] < 0) {
tmp = min(tmp, abs(v[l]));
}
// 一直線
if (v[l] > 0) {
tmp = min(tmp, abs(v[r]));
}
// 右行ってから左
ll dist = abs(v[r]) * 2 + abs(v[l]);
tmp = min(tmp, dist);
// 左行ってから右
ll dist2 = abs(v[l]) * 2 + abs(v[r]);
tmp = min(tmp, dist2);
// cout << i << " " << tmp << " " << dist << " " << dist2 << " " << abs(v[l]) << " " << abs(v[r]) << endl;
ans = min(ans, tmp);
}
}
if (ans == INF) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll ans=0;
for(int i=0;i<=62;i++){
ll p=(1LL<<i);p%=mod;
ll hano=cnt[i][0]*cnt[i][1];
hano%=mod;
ans+=(p*hano);
ans%=mod;
}
cout<<ans;
return 0;
} | /*input
10 100000
50000 50001 50002 50003 50004 50005 50006 50007 50008 50009
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<'('<<P.F<<','<<P.S<<')';
return out;
}
//}}}
const ll maxn=100005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;
ll mypow(ll a,ll b){
ll res=1LL;
while(b){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
ll inv[maxn];
ll dp[maxn];
int p[maxn];
int main(){
IOS;
int n,x;
cin>>n>>x;
for(int i=1;i<=n;i++) inv[i]=mypow(i,MOD-2);
REP(i,n) cin>>p[i];
sort(p,p+n);
dp[x]=1;
for(int i=1;i<=n;i++) dp[x]=dp[x]*i%MOD;
for(int i=n-1;i>=0;i--){
if(i==0){
REP(j,x+1) if(j>=p[i]){
dp[j%p[i]]=(dp[j%p[i]]+dp[j])%MOD;
dp[j]=0;
}
}
else{
REP(j,x+1) dp[j]=dp[j]*i%MOD*inv[i+1]%MOD;
REP(j,x+1) dp[j%p[i]]=(dp[j%p[i]]+dp[j]*inv[i])%MOD;
}
// for(int i=0;i<=x;i++) cout<<dp[i]<<" \n"[i==x];
}
ll ans=0;
REP(i,x+1){
ans+=dp[i]*i%MOD;
if(ans>=MOD) ans-=MOD;
}
cout<<ans<<'\n';
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=100000+10;
int n;
int a[maxn];
int partition(int a[],int p,int r)
{
int x=a[r];
int i=p-1;
for(int j=p;j<r;j++)
{
if(a[j]<=x)
{
i++;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
int main()
{
// freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
int res=partition(a,0,n-1);
for(int i=0;i<n;i++)
{
if(i) printf(" ");
if(i==res) printf("[");
printf("%d",a[i]);
if(i==res) printf("]");
}
printf("\n");
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 100010
using namespace std;
typedef long long ll;
ll read()
{
ll x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,m;
ll K;
int a[maxn],d[maxn],vis[maxn],id[maxn];
int p[maxn],top;
ll ans[maxn];
int main()
{
n=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=n;i++) d[i]=a[i]-a[i-1];
for(int i=1;i<=n;i++) id[i]=i;
m=read();K=read();
for(int i=1;i<=m;i++)
{
int x=read();
swap(id[x],id[x+1]);
}
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
top=0;
for(int j=i;!vis[j];j=id[j]) vis[j]=1,p[++top]=j;
for(int j=1;j<=top;j++) ans[p[j]]=d[p[(K+j-1)%top+1]];
}
}
for(int i=1;i<=n;i++) ans[i]+=ans[i-1];
for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
puts("");
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <deque>
#include <queue>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define FOR(i, a, b) for(int i=a, loop=b; i<=loop; ++i)
#define REV(i, a, b) for(int i=a, loop=b; i>=loop; --i)
#define mize(a, b) a = min(a, b)
#define maxi(a, b) a = max(a, b)
#define shl(k) ((k) << 1)
using namespace std;
const int N = 2000 + 5, mod = 998244353;
int n, k;
int64_t C[N][N], G[N][N], F[N], P[N], d[N], tmp, res[N][2];
int main()
{
ios::sync_with_stdio(); cin.tie(0);
cin >> k >> n;
int r = max(k, n);
FOR(i, 0, r) C[i][0] = 1;
FOR(i, 1, r) FOR(j, 1, i) C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod;
G[0][1] = 1;
FOR(i, 1, n) FOR(j, 1, k) G[i][j] = (G[i][j-1] + G[i-1][j]) % mod;
G[0][0] = 1; G[0][1] = 0;
FOR(i, 0, n) FOR(j, 1, k) G[i][j] = (G[i][j] + G[i][j-1]) % mod;
for(int m=1; m+m<=k; ++m) FOR(i, 2, n) F[m] = (F[m] + C[i-1][m+m-1] * G[n-i][k-m-m] % mod) % mod;
for(int m=1; m+m+1<=k; ++m) FOR(i, 2, n) {
tmp = G[n-i][k-m-m-1];
if (n-i-1 >= 0) tmp = tmp + G[n-i-1][k-m-m-1];
P[m] = (P[m] + C[i-1][m+m-1] * tmp % mod) % mod;
}
int64_t ans; int m;
FOR(i, 0, k) res[i][0] = res[i][1] = -1;
FOR(t, 2, k+k) {
m = 0; FOR(i, 1, k) if (1<=t-i && t-i<=k) m += 1;
if (res[m/=2][t&1] != -1) {
ans = res[m][t&1];
goto REP;
}
if (t&1) {
ans = G[n][k];
REV(i, m, 1) {
d[i] = F[i];
FOR(j, i+1, m) d[i] = (d[i] - d[j] * C[m-i][j-i] % mod + mod) % mod;
}
} else {
ans = (G[n][k-1] + G[n-1][k-1]) % mod;
REV(i, m, 1) {
d[i] = P[i];
FOR(j, i+1, m) d[i] = (d[i] - d[j] * C[m-i][j-i] % mod + mod) % mod;
}
}
FOR(i, 1, m) ans = (ans - d[i] * C[m][i] % mod + mod) % mod;
res[m][t&1] = ans;
REP: cout << ans << '\n';
}
}
| #include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 100050
#define M 605
int n,d1,d2,head[N],cnt,col[M][M],col2[M][M],vis[M][M],ct,s1[N][2];
queue<int> tp;
void bfs(int x,int y)
{
vis[x][y]=1;
tp.push(x*1000+y);
while(!tp.empty())
{
int s=tp.front()/1000,t=tp.front()%1000;tp.pop();
for(int i=0;i<=ct;i++)
for(int j=s-s1[i][0];j<=s+s1[i][0];j+=s1[i][0]*2)
{
for(int k=t-s1[i][1];k<=t+s1[i][1];k+=s1[i][1]*2)
{
if(j>=1&&j<=n&&k>=1&&k<=n&&!vis[j][k])vis[j][k]=1,col[j][k]=col[s][t]^1,tp.push(j*1000+k);
if(!s1[i][1])break;
}
if(!s1[i][0])break;
}
}
}
int main()
{
scanf("%d%d%d",&n,&d1,&d2);n*=2;
ct=0;for(int i=0;i<=n;i++)if(d1>=i*i){int tp=sqrt(d1-i*i);if(i*i+tp*tp==d1)s1[++ct][0]=i,s1[ct][1]=tp;}
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(!vis[i][j])bfs(i,j);
int tp=0;for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)tp+=col[i][j]?-1:1;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)col2[i][j]=col[i][j]^(tp>=0),vis[i][j]=0,col[i][j]=0;
ct=0;for(int i=0;i<=n;i++)if(d2>=i*i){int tp=sqrt(d2-i*i);if(i*i+tp*tp==d2)s1[++ct][0]=i,s1[ct][1]=tp;}
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(!vis[i][j])bfs(i,j);
tp=0;for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)tp+=col[i][j]?-1:1;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)col[i][j]=col[i][j]^(tp>=0);
int ct=0;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(ct<n*n/4&&col[i][j]==1&&col2[i][j]==1)printf("%d %d\n",i-1,j-1),ct++;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
cin>>n;
map<ll int,int> mp;
ll int a;
int l,ct=0;
for(l=0;l<n;l++)
{
cin>>a;
mp[a]++;
}
if(mp.size()<3)
{
cout<<0;
return 0;
}
for(auto i=mp.begin();next(next(i))!=mp.end();i++)
{
for(auto j=next(i);next(j)!=mp.end();j++)
{
for(auto k=next(j);k!=mp.end();k++)
{
if(check(i->first,j->first,k->first))
ct+=(i->second*j->second*k->second);
}
}
}
cout<<ct;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
char bd[12][12];
void del(int y, int x) {
if (0 <= y && y < 12 && 0 <= x && x < 12 && bd[y][x] == '1') {
bd[y][x] = '0';
del(y-1, x);
del(y+1, x);
del(y, x-1);
del(y, x+1);
}
}
int main() {
while (cin >> bd[0][0]) {
for (int i=0; i<12; ++i) {
for (int j=0; j<12; ++j) {
if (i == 0 && j == 0) continue;
cin >> bd[i][j];
}
}
int cnt = 0;
for (int i=0; i<12; ++i) {
for (int j=0; j<12; ++j) {
if (bd[i][j] == '1') {
del(i, j);
cnt ++;
}
}
}
cout << cnt << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int N,K;
cin >> N >> K;
int l[N];
for(int i = 0; i < N ;i++){
cin >> l[i];
}
sort(l ,l+N ,greater<int>());
int answer = 0;
for(int i = 0; i < K ; i++){
answer += l[i];
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define multicase
const int MOD = 1e9 + 7;
const int INF = 2e9;
const int N = 1e3 + 5;
int n, k, ans;
void solve() {
int T = 1;
#ifdef multicase
cin >> T;
#endif
for(int tc = 1; tc <= T; tc++) {
cin >> n >> k;
ans = 1;
while(n--) ans = min(ans * 2, ans + k);
cout << ans << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
} | 0 |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
// --------------------------------------------------------------------------------
void solve()
{
int a, b;
cin >> a >> b;
for (int i = 0;; i++)
{
if (b == 1)
{
cout << 0 << endl;
break;
}
if (b <= a * (i + 1) - i)
{
cout << i + 1 << endl;
break;
}
}
}
// --------------------------------------------------------------------------------
int main()
{
// srand((unsigned)time(NULL));
// int bt = clock();
solve();
// double et = 1.0 * (clock() - bt) / CLOCKS_PER_SEC;
// printf("Execution Time: %.4lf sec\n", et);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
//find_by_order(k):returns iterator to kth element starting from 0
//order_of_key(k):returns count of elements strictly smaller than k
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<class T> void re(T& x) { cin >> x; }
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "/home/o_o/MyCodes/pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
void solve(){
int a , b ;
re(a,b);
int cnt = 1 ;
cout << (a + b - 3) / (a-1) ;
}
signed main() {
unsyncIO();
int tt =1 ;
// cin >> tt;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
int n;
cin >> n;
vector<int> a(n+2);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int sum = 0;
for(int i = 0; i <= n; i++){
sum += abs(a[i] - a[i+1]);
}
for(int i = 1; i <= n; i++){
int ans = sum;
ans -= abs(a[i]-a[i-1]);
ans -= abs(a[i+1]-a[i]);
ans += abs(a[i+1]-a[i-1]);
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
template <typename T> bool chmin(T &x, const T &y) {if (x < y) {x = y; return true;} return false;}
template <typename T> bool chmax(T &x, const T &y) {if (x > y) {x = y; return true;} return false;}
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> B(N, 0), C(N, 0);
B[0] = abs(A[0]);
for (int i = 1; i < N; ++i) B[i] = B[i - 1] + abs(A[i] - A[i - 1]);
reverse(ALL(A));
C[0] = abs(A[0]);
for (int i = 1; i < N; ++i) C[i] = C[i - 1] + abs(A[i] - A[i - 1]);
reverse(ALL(A));
reverse(ALL(C));
rep(i, N) {
if (i == 0) cout << C[i + 1] + abs(A[i + 1]) << "\n";
else if (i == N - 1) cout << B[i - 1] + abs(A[i - 1]) << "\n";
else cout << B[i - 1] + abs(A[i + 1] - A[i - 1]) + C[i + 1] << "\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define ar array
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL);
int32_t main() {
fast_io;
// int t; cin >> t;
// while (t--) {
// }
string K; cin >> K;
int D; cin >> D;
int len = (int) K.size();
vector<vector<int>> dp(D, vector<int> (2));
for (int digit = 0; digit < K[0] - '0'; digit++) {
dp[digit % D][true]++;
}
dp[(K[0] - '0') % D][false]++;
for (int pos = 1; pos < len; pos++) {
vector<vector<int>> new_dp(D, vector<int> (2));
for (int sum = 0; sum < D; sum++) {
for (bool choose_any_digit : {false, true}) {
for (int digit = 0; digit < 10; digit++) {
if (digit > K[pos] - '0' && !choose_any_digit) {
break;
}
new_dp[(sum + digit) % D][choose_any_digit || digit < K[pos] - '0'] += dp[sum][choose_any_digit];
new_dp[(sum + digit) % D][choose_any_digit || digit < K[pos] - '0'] %= MOD;
}
}
}
dp = new_dp;
}
int res = (dp[0][true] + dp[0][false]);
res--;
if (res < 0) {
cout << res + MOD << endl;
}
else {
cout << res << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define flash ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
ll dp[2][2][100];
ll mod=1e9+7;ll d;
ll mo(ll x)
{
if(x>=0)
return(x%d);
else
return(x%d+d)%d;
}
int main()
{
flash
string s;
cin>>s;ll n=s.size();ll a[n];
for(ll i=0;i<n;i++)
{
a[i]=s[i]-'0';
}
cin>>d;
dp[1][0][0] = 1;dp[1][1][0] = 1;
for(ll i = n-1; i >=0 ; i--) {
for(ll state = 0; state < 2 ; state++) {
for(ll sum = 0; sum < d; sum++) {
if(state) {
for(ll x = 0; x <= a[i] ; x++) {
dp[0][1][sum] += (x== a[i]) ? dp[1][1][mo(sum-x)]%mod:dp[1][0][mo(sum-x)]%mod;
}
}
else {
for(ll x = 0; x < 10 ; x++) {
dp[0][0][sum] += dp[1][0][mo(sum-x)]%mod;
}
}
}
}
if(i!=0)
{
for(ll sum=0;sum<d;sum++)
{
dp[1][1][sum]=dp[0][1][sum];
dp[1][0][sum]=dp[0][0][sum];
dp[0][1][sum]=0;
dp[0][0][sum]=0;
}
}
}
dp[0][1][0]--;
if(dp[0][1][0]==-1)
dp[0][1][0]=mod-1;
dp[0][1][0]=dp[0][1][0]%mod;
cout<<dp[0][1][0]<<endl;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll MOD = 1000000007;
ll INF =1<<30;
int main(){
int n,m;
cin >> n;
vector<string>s(n),t(m);
rep(i,n)cin >>s[i];
cin>>m;
rep(i,m)cin >>t[i];
map<string,int>mp;
rep(i,n){
mp[s[i]]++;
}
rep(i,m) if(mp[t[i]]>0)mp[t[i]]--;
int ans = 0;
for(auto x:mp){
if(x.second>ans) ans=x.second;
}
cout << ans <<endl;
} | #include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#define RG register
using namespace std;
const int N=1e6+10;
int n,ans;
char st[N],ed[N];
queue<int> pn;
inline int mi(int a,int b){return a<b ? a : b;}
inline int mx(int a,int b){return a>b ? a : b;}
int main()
{
// freopen("Shik and Copying String.in","r",stdin);
scanf("%d%s%s",&n,st+1,ed+1);
if(!strcmp(st+1,ed+1)) return printf("0\n"), 0;
for(int i=n,j=n;i;i--)
{
if(ed[i]==ed[i-1]) continue;
j=mi(i,j);
while(ed[i]!=st[j] && j) j--;
if(!j) return printf("-1\n"), 0;
while(!pn.empty())
if((int)pn.front()-(int)pn.size()>=i) pn.pop();
else break;
pn.push(j);
if(i!=j) ans=mx(ans,(int)pn.size());
}
printf("%d\n",ans+1);
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
ll INF = 1000000000;
int main(int argc, char const *argv[]) {
ll n;std::cin >> n;
vvl dat = VV(n, 2, 0, ll);
re(i, n) {
scanf("%lld %lld", &dat[i][0], &dat[i][1]);
dat[i][0] = INF - dat[i][0];
}
sort(all(dat), [](vll a, vll b){return a[0]-a[1]>b[0]-b[1];});
vvl dp = VV(n+1, n+1, -INF*INF, ll);
dp[0][0] = INF;
for(int i=1;i<=n;i++){
dp[i][0] = INF;
for(int j=1;j<=i;j++){
if(dp[i-1][j-1]<dat[i-1][0]) dp[i][j] = dp[i-1][j];
else dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]-dat[i-1][1]);
}
}
ll ans = 0;
for(int i=0;i<=n;i++) if(dp[n][i]!=-INF*INF) ans = i;
std::cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 1000000000000000LL
#define N 5010
int n;
PII a[N];
ll f[N], g[N]; // min height
bool cmp(PII x, PII y) {
return x.fi + x.se < y.fi + y.se || x.fi + x.se == y.fi + y.se && x.se < y.se;
}
int main() {
cin >> n;
for (int i = 0; i < n; i ++)
cin >> a[i].fi >> a[i].se;
sort(a, a+n, cmp);
for (int i = 0; i <= n; i ++) f[i] = INF;
f[0] = 0;
for (int i = 0; i < n; i ++) {
memcpy(g, f, sizeof g);
for (int j = 0; j <= n; j ++) f[j] = INF;
for (int j = 0; j <= n; j ++) if (g[j] < INF) {
if (g[j] <= a[i].fi) f[j+1] = min(f[j+1], g[j] + a[i].se);
f[j] = min(f[j], g[j]);
}
}
int S = 0;
for (int i = 0; i <= n; i ++)
if (f[i] < INF) S = max(S, i);
cout << S << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int lld;
const lld MAX=300020;
const lld MOD=1000000007;
char s[MAX];
lld n,dp[MAX][4][10],alt[MAX],fin;
int main(){
scanf(" %s",s);
n=strlen(s);
dp[0][3][3]=1;
alt[n]=1;
for(lld x=n-1;x>=0;x--) {
alt[x]=alt[x+1];
if(s[x]=='?') alt[x]*=2,alt[x]%=MOD;
}
for(lld x=0;x<n;x++){
for(lld a=-2;a<=0;a++){
for(lld b=-3;b<=3;b++){
lld p=(s[x]=='0'||s[x]=='?'),q=(s[x]=='1'||s[x]=='?');
//if(a==-3&&b==-3) prlldf("%d %d\n",p,q);
if(p){
if(b+1-a>=3) dp[x+1][min(a,b-1) +3][b-1 +3]+=dp[x][a +3][b +3],dp[x+1][min(a,b-1) +3][b-1 +3]%=MOD;
else dp[x+1][a +3][b+1 +3]+=dp[x][a +3][b +3],dp[x+1][a +3][b+1 +3]%=MOD;
}
if(q){
if(min(a,b-1)<=-3) fin+=(alt[x+1]*dp[x][a +3][b +3])%MOD,fin%=MOD;
else dp[x+1][min(a,b-1) +3][b-1 +3]+=dp[x][a +3][b +3],dp[x+1][min(a,b-1) +3][b-1 +3]%=MOD;
}
}
}
}
for(lld a=-2;a<=0;a++){
for(lld b=-3;b<=0;b++){
fin+=dp[n][a +3][b +3],fin%=MOD;
}
}
printf("%lld\n",fin);
}
| #include <bits/stdc++.h>
using namespace std;
long long MOD = pow(10, 9) + 7;
// O(sqrt(N))の素因数分解
int main(){
int Q;
cin >> Q;
vector<int> bucket(Q+1, 1);
if (Q == 1)
{
cout << 1 << endl;
return 0;
}
for (int i = 2; i <= Q; i++)
{
int target = i;
for (int j = 2; j <= i; j++)
{
if (target % j != 0)
{
continue;
}
while (target % j == 0)
{
bucket[j]++;
target /= j;
}
}
}
long long ans = 1;
for (int j = 0; j <= Q; j++)
{
ans *= bucket[j];
ans = ans % MOD;
}
cout << ans << endl;
return 0;
}
| 0 |
//#define USE_CPP11
// #define USE_PRINTF
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <complex>
#include <memory>
#include <sstream>
#ifdef USE_CPP11
#include <unordered_map>
#include <unordered_set>
#include <functional>
#endif
#define PRINT(obj) cout << obj << endl
#define REP(i, n) for(int (i) = 0; (i) < (n); i++)
#define SPACE " "
typedef long long ll;
const int INF = 1e9 + 10;
using namespace std;
namespace Scanner {
#ifdef USE_PRINTF
int nextInt() { int d; scanf("%d" , &d); return d; }
float nextFloat() { float f; scanf("%f" , &f); return f; }
double nextDouble() { double f; scanf("%lf", &f); return f; }
string nextString() { string s; scanf("%s" , &s); return s; }
ll nextll() { ll l; scanf("%ll", &l); return l; }
#else
int nextInt() { int d; cin >> d; return d; }
float nextFloat() { float f; cin >> f; return f; }
double nextDouble() { double f; cin >> f; return f; }
string nextString() { string s; cin >> s; return s; }
ll nextll() { ll l; cin >> l; return l; }
#endif
string getLine() {
string input;
getline(cin, input);
return input;
}
};
namespace myLibrary {
vector<string> split(const string& str, char delim) {
vector<string> ret;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
ret.push_back(string(str, current, found - current));
current = found + 1;
}
ret.push_back(string(str, current, str.size() - current));
return ret;
}
#ifdef USE_CPP11
///
/// higher-order functional
/// This is something like map in haskell, python, etc.
/// Sample usage:
/// vector<int> a = {1, 2, 3, 4, 5};
/// vector<int> b = myLibrary::_Map<int, int>(a, [](int n){
/// return n * n;
/// });
/// Result:
/// b = 1, 4, 9, 16, 25
///
template<typename T_IN, typename T_OUT, class Functor>
vector<T_OUT> _Map(vector<T_IN> src, Functor func) {
vector<T_OUT> ret;
for (int i = 0; i < src.size(); i++) {
ret.push_back(func(src[i]));
}
return ret;
}
#endif
};
/// BEGIN //////////////////////////////////////////////////////////
int main() {
while (true) {
int m = Scanner::nextInt();
int nmin = Scanner::nextInt();
int nmax = Scanner::nextInt();
if (m + nmin + nmax == 0) {
break;
}
vector<int> Ps(m);
REP(i, m) {
int p = Scanner::nextInt();
Ps[i] = p;
}
int ans, ans_diff = -1;
for (int i = nmin - 1; i <= nmax - 1; i++) {
int diff = Ps[i] - Ps[i + 1];
if (diff >= ans_diff) {
ans_diff = diff;
ans = i;
}
}
PRINT(ans + 1);
}
return 0;
}
/// END ////////////////////////////////////////////////////////// | #include <iostream>
using namespace std;
int main() {
int m,min,max,ten[200],gap=10001,sa;
cin>>m>>min>>max;
while(1){
if(m==0 && min==0 && max==0){
break;
}
for(int i=1;i<=m;i++){
cin>>ten[i];
}
for(int i=min;i<=max;i++){
if(gap>=ten[i+1]-ten[i]){
gap=ten[i+1]-ten[i];
sa=i;
}
}
cout<<sa<<endl;
gap=10001;
sa=0;
cin>>m>>min>>max;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5, MOD = 998244353;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int mx = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (i == 0 && x != 0) {
cout << "0\n";
return 0;
}
a[x]++;
mx = max(mx, x);
}
if (a[0] != 1) {
cout << "0\n";
return 0;
}
ll ans = 1;
for (int i = 1; i <= mx; i++) {
for (int j = 0; j < a[i]; j++)
ans = ans * a[i - 1] % MOD;
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
map<int, bool> check;
int n; cin >> n;
while (n--) {
int a; cin >> a;
if (check[a]) {
cout << "NO" << endl;
return 0;
}
check[a] = true;
}
cout << "YES" << endl;
}
| 0 |
// IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 998244353;
////////////////////////////////////////////////////////////////////
const int N = 3e2 + 5;
int A[N], DP[N][N][N];
void Add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
mt19937 Rnd(time(0));
string S; cin >> S;
int m = 1, o = 0;
for (char c : S) if (c == '0') m++; else A[m - 1]++, o++;
reverse(A, A + m);
DP[0][0][0] = 1;
for (int i = 0; i < m; i++) for (int j = 0; j <= o; j++) for (int k = 0; k <= o; k++) {
if (!DP[i][j][k]) continue;
for (int l = 0; l <= A[i] + k; l++) Add(DP[i + 1][j + max(A[i] - l, 0)][k + A[i] - l], DP[i][j][k]);
}
int k; cin >> k;
k = min(k, o);
int ans = 0;
for (int i = 0; i <= k; i++) Add(ans, DP[m][i][0]);
cout << ans << endl;
return 0;
}
| #ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif
#include <bits/stdc++.h>
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
typedef long long Long;
typedef double Double;
template <class U, class V>
istream& operator>>(istream& is, pair<U, V>& p) {
is >> p.first >> p.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& x : v) {
is >> x;
}
return is;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& v) {
for (auto& x : v) {
os << x << " ";
}
return os;
}
const int N = 303;
const int MOD = 998244353;
int memo[N][N][N];
vector<int> v;
int count(int ind, int ones, int k) {
if (k < 0) return 0;
if (ones < 0) return 0;
if (ind == 0) return 1;
int& res = memo[ind][ones][k];
if (res != -1) return res;
res = 0;
for (int i = 0; i <= v[ind] + ones; ++i) {
res =
(res + count(ind - 1, v[ind] + ones - i, k - max(0, v[ind] - i))) % MOD;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef Local
freopen("test.in", "r", stdin);
#else
#define endl '\n'
#endif
string s;
int k;
cin >> s >> k;
memset(memo, -1, sizeof memo);
v.emplace_back(0);
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') {
++v.back();
} else {
v.emplace_back(0);
}
}
cout << count(sz(v) - 1, 0, min(N - 1, k)) << endl;
return 0;
} | 1 |
#include <cstdio>
#include <queue>
using namespace std;
int main(void)
{
priority_queue <int> w, k;
int tmp;
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
w.push(tmp);
}
for (int i = 0; i < 10; i++){
scanf("%d", &tmp);
k.push(tmp);
}
int sumw = 0, sumk = 0;
for (int i = 0; i < 3; i++){
sumw += w.top();
w.pop();
sumk += k.top();
k.pop();
}
printf("%d %d\n", sumw, sumk);
return (0);
} | #include <iostream>
int main(){
int w[10], k[10];
for (int i = 0; i < 10; i++) {
std::cin >> w[i];
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 9; j++) {
if (w[j] < w[j + 1]) {
int c = w[j];
w[j] = w[j + 1];
w[j + 1] = c;
}
}
}
for (int i = 0; i < 10; i++) {
std::cin >> k[i];
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 9; j++) {
if (k[j] < k[j + 1]) {
int c = k[j];
k[j] = k[j + 1];
k[j + 1] = c;
}
}
}
std::cout << w[0] + w[1] + w[2] << " " << k[0] + k[1] + k[2] << std::endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define ld long double
#define ff first
#define ss second
const ll mod = 1e9 +7 ;
ll multiply(ll a, ll b ){ return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a%mod) - (b % mod)+ mod) % mod ; }
////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////
void solve(){
ll n , m , v , p ;
cin >> n >> m >> v >> p ;
vector < ll > a(n) ;
for( int i = 0 ; i < n ; i++) cin >> a[i] ;
sort(a.begin(),a.end());
vector < ll > pre(n) ;
pre[0] = a[0] ;
for( int i = 1 ; i < n ; i++) pre[i] = pre[i-1] + a[i] ;
// for( int i = 0 ; i < n ; i++) cout << a[i] << " " ;
// cerr << "\n" ;
int ans = 0 ;
for( int i = n-1 ; i >= 0 ; i--){
ll r = n-p ;
if(i>=r){
ans++;
continue ;
}
if(a[i]+m>=a[r]){
int vote = v-p-i ;
if(vote>0){
ll sum = pre[r]-pre[i] ;
// cout << i << " " << vote << " " << sum << " " << (a[i]+m)*(r-i)-sum<< "\n";
if(m*vote<=(a[i]+m)*(r-i)-sum){
ans++;
}
}
else{
ans++;
}
}
else{
break ;
}
}
cout << ans ;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1 ;
//cin >> t ;
while(t--){
solve( );
}
}
| /*program by mangoyang*/
#pragma GCC optimize("Ofast", "inline")
#include<bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
int ch = 0, f = 0; x = 0;
for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
if(f) x = -x;
}
const int N = 1000005;
int a[N], n, m, p, v;
inline int check(int mid){
int num = 0; ll tot = 0;
vector<int> vec;
for(int i = 1; i <= n; i++)
if(a[i] <= mid){
tot += min(mid - a[i], m);
if(m > mid - a[i])
vec.push_back(m - mid + a[i]);
}
else num++, tot += m;
if(num >= p) return 0;
ll now = 1ll * v * m - tot;
if(now <= 0) return 1;
sort(vec.begin(), vec.end(), greater<int>());
for(int i = 0; i < (int) vec.size(); i++){
now -= vec[i], num++;
if(now <= 0) break;
}
if(num >= p) return 0;
return 1;
}
int main(){
read(n), read(m), read(v), read(p);
for(int i = 1; i <= n; i++) read(a[i]);
int l = 0, r = 2e9, res = 2e9;
while(l <= r){
int mid = (1ll * l + r) >> 1ll;
if(check(mid)) res = mid, r = mid - 1;
else l = mid + 1;
}
int ans = 0;
for(int i = 1; i <= n; i++)
if(a[i] + m >= res) ans++;
cout << ans << endl;
return 0;
} | 1 |
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
#define N 6005
#define INF 0x3f3f3f3f
#define LL long long
int n,MOD,f[4][N*2];
int rd()
{
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return f*x;
}
int main()
{
n=rd(),MOD=rd();
f[0][N]=1;
for(int i=1;i<=3*n;i++)
{
int l=N-(i-1),r=N+(i-1);
for(int j=l;j<=r;j++)
{
for(int k=3;k>=1;k--)
f[k][j]=f[k-1][j];
f[0][j]=0;
}
for(int j=l;j<=r;j++)
{
f[0][j+1]=(f[0][j+1]+f[1][j])%MOD;
int del=i-1;
f[0][j-1]=(f[0][j-1]+1ll*f[2][j]*del%MOD)%MOD;
del=1ll*(i-1)*(i-2)%MOD;
f[0][j]=(f[0][j]+1ll*f[3][j]*del%MOD)%MOD;
}
}
int ans=0;
for(int i=N;i<=N+3*n;i++)
ans=(ans+f[0][i])%MOD;
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAX_FACT = 1e5 * 2 + 1;
ll fact[MAX_FACT], invFact[MAX_FACT], inv[MAX_FACT];
void init() {
fact[0] = fact[1] = 1;
invFact[0] = invFact[1] = 1;
inv[1] = 1;
for (auto i = 2; i < MAX_FACT; ++i)
{
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
invFact[i] = invFact[i - 1] * inv[i] % MOD;
}
}
ll calcCombination(ll n, ll k) {
if (n < k) {
return 0;
}
if (n < 0 || k < 0) {
return 0;
}
return fact[n] * (invFact[k] * invFact[n - k] % MOD) % MOD;
}
int main()
{
ll N, M, K;
cin >> N >> M >> K;
init();
ll result = 0;
for (int i = 1; i < N; i++) {
result = (result + i * (N - i) * M % MOD * M % MOD) % MOD;
}
for (int i = 1; i < M; i++) {
result = (result + i * (M - i) * N % MOD * N % MOD) % MOD;
}
result = result * calcCombination(N * M - 2, K - 2) % MOD;
cout << result << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a.at(i + 1);
vector<int> b(n + 1, 0);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum += b.at(j);
}
if (a.at(i) == 1) {
if (sum % 2 == 1) {
b.at(i) = 0;
} else {
b.at(i) = 1;
}
} else {
if (sum % 2 == 1) {
b.at(i) = 1;
} else {
b.at(i) = 0;
}
}
}
vector<int> res;
for (int i = 1; i <= n; i++) {
if (b.at(i) == 1) {
res.push_back(i);
}
}
cout << res.size() << endl;
rep(i, res.size()) {
if (i != 0) {
cout << " ";
}
cout << res.at(i);
}
cout << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mod 1000000007
void solve()
{
ll n;
cin>>n;
vector<ll> x(n);
for(ll i=0;i<n;i++)
cin>>x[i];
sort(x.begin(),x.end());
ll a=0,b=0,c=0;
for(ll i=n-1;i>=0;i--)
{
if(x[i]==x[i-1])
{
// cout<<x[i];
a=x[i];
c=i-1;
break;
}
}
// cout<<c<<a;
for(ll i=c-1;i>=0;i--)
{
if(x[i]==x[i-1])
{
b=x[i];
break;
}
}
cout<<a*b;
return;
}
int main()
{
fast;
ll q;
q=1;
// cin>>q;
while(q--)
{
solve();
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define sfi1(v) scanf("%d",&v)
#define sfi2(v1, v2) scanf("%d %d",&v1,&v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d",&v1,&v2,&v3)
#define sfll1(v) scanf("%I64d",&v);
#define sfll2(v1, v2) scanf("%I64d %I64d",&v1,&v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
#define endl '\n'
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
const int LG = 18;
int up[N][LG];
int arr[N];
int n, l, q;
void run_case() {
cin >> n;
loop(i, n)cin >> arr[i];
cin >> l >> q;
rloop(i, n - 1) {
int par = i == n - 1 ? n - 1 : (upper_bound(arr + i, arr + n, arr[i] + l) - arr - 1);
up[i][0] = par;
for (int k = 1; k < LG; ++k)
up[i][k] = up[up[i][k - 1]][k - 1];
}
while (q--) {
int a, b;
cin >> a >> b;
a--, b--;
if (a > b)swap(a, b);
int ans = 1;
for (int i = LG - 1; i >= 0; i--) {
if (up[a][i] < b) {
a = up[a][i];
ans += 1 << i;
}
}
cout << ans << endl;
}
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("in.in", "r", stdin);
// freopen("out.in", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
while (T--)run_case();
return 0;
}
| #include <bits/stdc++.h>
const int N=100005,M=20;
using namespace std;
int n,L,q,ar[N],nx[M][N];
int calc(int i){
int l=i,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
if(ar[m]-ar[i]<=L){
ans=m;
l=m+1;
}else{
r=m-1;
}
}
return ans;
}
int kth(int cur,int k){
for(int i=M-1;i>=0;i--){
if(k>=(1<<i)){
k-=(1<<i);
cur=nx[i][cur];
}
}
return cur;
}
int main()
{ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>ar[i];
cin>>L>>q;
for(int i=1;i<=n;i++)nx[0][i]=calc(i);
for(int i=1;i<M;i++){
for(int j=1;j<=n;j++){
nx[i][j]=nx[i-1][nx[i-1][j]];
}
}
while(q--){
int a,b;cin>>a>>b;
if(a>=b)swap(a,b);
int l=1,r=n,ans=-1;
while(l<=r){
int m=(l+r)/2;
//cout<<a<<' '<<m<<' '<<kth(a,m)<<'\n';
if(kth(a,m)>=b){
ans=m;
r=m-1;
}else{
l=m+1;
}
}
cout<<ans<<'\n';
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s,t;
cin>>s>>t;
cout<<t<<s;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){//繰り返し2乗法
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2);
return memo*memo%mod;
}else{
return rep_pow(a, b-1)*a%mod;
}
}
ll nCr(ll n, ll r){//mod逆元使ったnCr
ll ret=1;
rep(i,r){
ret *= n-i;//分子
ret %= mod;
ret *=rep_pow(r-i, mod-2);//mod逆元によりr!で割ると同値
ret %= mod;
}
return ret;
}
ll gcd(ll a, ll b){ if(b==0) return a; return gcd(b, a%b);}
int counter(int x){
if(x==0) return 0;
return counter(x>>1)+(x&1);
}
int main(){
fast_io
int n,k;
cin>>n>>k;
int ans=n-k+1;
cout<<ans<<endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int nin;
while(1){
scanf("%d",&nin);
if(!nin)break;
long long int human[4002]={0};
long long int no[4002],tanka,kazu,outflag=0;
for(int i=0;i<nin;i++){
scanf("%d %d %d",&no[i],&tanka,&kazu);
human[no[i]]+=tanka*kazu;
}
for(int i=0;i<nin;i++){
if(human[no[i]]>=1000000 && human[no[i]]!=-1){
printf("%d\n",no[i]);
human[no[i]]=-1;
outflag=1;
}
}
if(outflag==0)printf("NA\n");
}
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m,ans=0;
cin >> n >> m;
while(n!=0||m!=0){
ans = 0;
n++;
vector<int>a(m,0),b(m,0),hito(n,0),one(n,0);
rep(i,m){
cin>>a[i]>>b[i];
if(a[i]==1){
hito[b[i]]++;
one[b[i]]++;
}
if(b[i]==1){
hito[a[i]]++;
one[a[i]]++;
}
}
rep(i,n){
if(i==0||i==1)continue;
rep(j,m){
if(one[i]!=0){
if(i==a[j])hito[b[j]]++;
if(i==b[j])hito[a[j]]++;
}
}
}
rep(i,n){
if(i==0||i==1)continue;
if(hito[i]!=0){
ans++;
}
}
cout<<ans<<endl;
cin >> n >> m;
}
return (0);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string A;
cin >> A;
char B, C;
if(A.size() == 2) {
cout << A << endl;
}
else {
B = A.at(0);
C = A.at(2);
A.at(0) = C;
A.at(2) = B;
cout << A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
ll sum(int n);
void go(){
string s;cin>>s;
if(sz(s)==3) reverse(all(s));
cout << s;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(ll i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
int n;
string m = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int findidx(char c) {
rep(i, m.size())if(c == m[i]) return i;
}
void solve(void) {
int k[110];
string s;
rep(i, n) cin >> k[i];
cin >> s;
string ans;
rep(i, s.size()) {
int idx = findidx(s[i]);
idx = ((idx + 52) - k[i % n]) % 52;
ans += m[idx];
}
cout << ans << endl;
}
int main(void) {
// cout << m.size() << endl;
while(1) {
cin >> n;
if(n == 0) break;
solve();
}
return 0;
} | // King's Inspection
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
int n;
int now=0;
int k[102];
int ansNum;
char station[102];
char ans[102];
string alpha = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
//vector<char> ans;
while(1) {
// Input
cin>>n;
if(n == 0) {
break;
}
for(int i=0; i<n; i++) {
cin>>k[i];
}
cin.ignore();
ansNum = 0;
// Output
now = 0;
for(int i=0; i<102; i++) {
scanf("%c", &station[i]);
if(station[i] == '\n') {
break;
}
ansNum++;
int tmp;
tmp = alpha.find(station[i]);
ans[i] = alpha[(tmp-k[now]+52)%52];
now++;
if(now == n) {
now = 0;
}
}
for(int i=0; i<ansNum; i++) {
cout<<ans[i];
}
cout<<endl;
}
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define INF 100000000000000000LL
using namespace std;
signed main() {
int n, m, cun, ans = 0;
string s[10000], t[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> t[i];
}
for (int i = 0; i < n; i++) {
cun = 0;
for (int j = 0; j < n; j++) {
if (s[i] == s[j]) {
cun++;
}
}
for (int j = 0; j <m; j++) {
if (s[i] == t[j]) {
cun--;
}
}
ans = max(ans, cun);
}
cout << ans << "\n";
return (0);
} | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int N,M;
cin >> N;
map<string,int> blue;
string s;
for(int i=0;i<N;++i){
cin >> s;
if(blue.count(s)) blue.at(s)++;
else blue[s]=1;
}
cin >> M;
map<string,int> red;
for(int i=0;i<M;++i){
cin >> s;
if(red.count(s)) red.at(s)++;
else red[s]=1;
}
int ans=-200;
for(auto p: blue){
auto word=p.first;
auto value=p.second;
if(red.count(word)){
ans=max(ans,value-red.at(word));
}
else ans=max(ans,value);
}
if(ans<0) cout << 0 << endl;
else cout << ans << endl;
return 0;
}
| 1 |
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;
int main(){
string s;
cin>>s;
vector<ll> Mnext(26,0);
vector<vector<ll>> back(s.size()+1,Mnext);
for(int i=0;i<s.size();i++){
back[i+1]=Mnext;
Mnext[s[i]-'a']=i+1;
}
for(int i=0;i<26;i++){Mnext[i]=s.size();}
vector<vector<ll>> next(s.size()+1,Mnext);
for(ll i=s.size()-1;i>=0;i--){
next[i]=Mnext;
Mnext[s[i]-'a']=i;
}
ll k;
cin>>k;
ll ans=0;
vector<vector<vector<ll>>> dp(s.size()+1,vector<vector<ll>>(s.size()+1,vector<ll>(k+1,0)));
for(int i=1;i<=s.size();i++){
for(int t=1;t<=s.size();t++){
for(int h=0;h<=k;h++){
dp[i][t][h]=max(dp[i-1][t][h],dp[i][t-1][h]);
if(s[i-1]==s[s.size()-t]){
dp[i][t][h]=max(dp[i][t][h],dp[i-1][t-1][h]+1);
for(int w=0;w<26;w++){
dp[i][t][h]=max(dp[i][t][h],dp[back[i][w]][s.size()-next[s.size()-t][w]][h]+1);
}
}
if(h!=0){
dp[i][t][h]=max(dp[i][t][h],dp[i-1][t-1][h-1]+1);
}
}
}
}
for(int i=0;i<=s.size();i++){
for(int t=0;t<=s.size();t++){
for(int h=0;h<=k;h++){
if(i+t<=s.size()){ans=max(ans,dp[i][t][h]*2);}
if(i+t==s.size()+1){ans=max(ans,dp[i][t][h]*2-1);}
}
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 998244353
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[310][310][310];
string s;
int calc( int lef, int rig, int k){
if( dp[lef][rig][k] != 0){
return dp[lef][rig][k];
}
if( lef == rig ){
return 1;
}
if( lef > rig ){
return 0;
}
else{
if( s[lef] == s[rig] ){
dp[lef][rig][k] = calc( lef+1, rig -1, k ) + 2;
return dp[lef][rig][k];
}
else{
int c1 = -1;
if( k > 0 ) c1 = calc( lef+1, rig-1, k-1) + 2;
int c2 = calc( lef+1, rig, k);
int c3 = calc( lef, rig-1, k);
dp[lef][rig][k] = max( c1, max(c2,c3) );
return dp[lef][rig][k];
}
}
}
signed main(){
int k;
cin >> s;
cin >> k;
int n = s.size();
int ans = calc( 0, n-1, k );
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl
using namespace std;
typedef pair<int,int>P;
template<class V> class segtree {
private:
int n;
vector<V> node, lazy;
vector<bool> lazyFlag;
public:
segtree(vector<V> v) {
int sz = (int)v.size();
n = 1;
while(n < sz){
n *= 2;
}
node.resize(2*n-1);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1,false);
rep(i,sz){
node[i+n-1] = v[i];
}
for(int i=n-2; i>=0; i--){
node[i] = min(node[i*2+1],node[i*2+2]);
}
}
void eval(int k, int l, int r) {
if(lazyFlag[k]) {
node[k] = lazy[k];
if(r - l > 1) {
lazy[k*2+1] = lazy[k*2+2] = lazy[k];
lazyFlag[k*2+1] = lazyFlag[k*2+2] = true;
}
lazyFlag[k] = false;
}
}
void range(int a, int b, V x, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a){
return;
}
if(a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
eval(k, l, r);
}
else {
range(a, b, x, 2*k+1, l, (l+r)/2);
range(a, b, x, 2*k+2, (l+r)/2, r);
node[k] = min(node[2*k+1],node[2*k+2]);
}
}
V query(int a, int b, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a){
return INT_MAX;
}
if(a <= l && r <= b){
return node[k];
}
V vl = query(a, b, 2*k+1, l, (l+r)/2);
V vr = query(a, b, 2*k+2, (l+r)/2, r);
return min(vl,vr);
}
};
int main()
{
int n,q;
cin >> n >> q;
segtree<int> sg(vector<int>(n,INT_MAX));
rep(i,q){
int k;
cin >> k;
if(k){
int x;
cin >> x;
cout << sg.query(x,x+1) << "\n";
}else{
int x,y,z;
cin >> x >> y >> z;
sg.range(x,y+1,z);
}
}
} | #include<cstdio>
#include<algorithm>
using int64=long long;
using uchar=unsigned char;
constexpr int maxn(200000);
constexpr int64 inf(1e17);
template<class _Tp>
inline bool bchkMin(_Tp&x,const _Tp&y)
{return(x>y)&&(x=y,1);}
namespace IOManager{
constexpr int FILESZ(131072);
char buf[FILESZ];
const char*ibuf=buf,*tbuf=buf;
struct IOManager{
inline char gc()
{return(ibuf==tbuf)&&(tbuf=(ibuf=buf)+fread(buf,1,FILESZ,stdin),ibuf==tbuf)?EOF:*ibuf++;}
template<class _Tp>
inline operator _Tp(){
_Tp s=0u;char c=gc();
for(;c<48;c=gc());
for(;c>47;c=gc())
s=(_Tp)(s*10u+c-48u);
return s;
}
};
}IOManager::IOManager io;
int sz[maxn+1];
int64 szl[maxn+1],szr[maxn+1];
struct Edge{
int s,t;int64 w;
inline void init(const int&is,const int&it,const int64&iw)
{s=is;t=it;w=iw;}
inline bool operator<(const Edge&rhs)
const{return w<rhs.w;}
}e[maxn*30],*cur=e;
void calc(const int&l,const int&r){
if(l==r)
return;
const int m=(l+r)>>1;
int lmp,rmp;
int64 lmv=inf,rmv=inf;
for(int i=l;i<=m;++i)
if(bchkMin(lmv,szl[i]))
lmp=i;
for(int i=m+1;i<=r;++i)
if(bchkMin(rmv,szr[i]))
rmp=i;
for(int i=l;i<=m;++i)
(++cur)->init(i,rmp,szl[i]+rmv);
for(int i=m+1;i<=r;++i)
(++cur)->init(lmp,i,lmv+szr[i]);
calc(l,m);calc(m+1,r);
}
int ufs[maxn+1];
inline int anc(const int&v)
{return v==ufs[v]?v:ufs[v]=anc(ufs[v]);}
int main(){
const int n=io,D=io;
int64 t=0;
for(int i=1;i<=n;++i,t+=D)
ufs[i]=i,
sz[i]=io,
szl[i]=sz[i]-t,
szr[i]=sz[i]+t;
calc(1,n);
std::sort(e+1,cur+1);
int64 ans=0;
for(Edge*i=e+1;i<=cur;++i)
if(anc(i->s)!=anc(i->t))
ans+=i->w,ufs[ufs[i->s]]=ufs[i->t];
printf("%lld",ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
//const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((int)((a) + (b) - 1)/(int)(b))
signed main(){
int k;
cin >> k;
vector<string> board(8,string(8,'.'));
vector<intpair> queen(k);
rep(i,k){
cin >> queen[i].first >> queen[i].second;
}
int a[8];
rep(i,8) a[i] = i;
do{
bool ok = true;
for(auto p : queen){
ok = false;
rep(i,8){
if(p.first == i && p.second == a[i]) ok = true;
}
if(!ok) break;
}
rep(i,8)rep(j,8){
if(i==j) continue;
if(i+a[i] == j+a[j]) ok = false;
if(i-a[i] == j-a[j]) ok = false;
}
if(ok){
rep(i,8){
board[i][a[i]] = 'Q';
}
break;
}
}while(next_permutation(a, a+8));
for(string s : board){
cout << s << endl;
}
}
| #include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>
using namespace std;
#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 9e18
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<Pi> > vvPi;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi> > pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) {
return cost < e.cost;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T>
using vec = vector<T>;
template<class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template<class T>
struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template<class T>
using augGraph = vector<augEdge<T>>;
class Lowlink {
public:
vi ord, low;
vb vis;
vi articulation;
vPi bridge;
Lowlink(const Graph &G) {
ord = vi(G.size());
low = vi(G.size());
vis = vb(G.size(), false);
int k = 0;
for (int i = 0; i < G.size(); i++) {
if (!vis[i]) dfs(G, i, -1, k);
}
}
void dfs(const Graph &G, int v, int p, int &k)
{
vis[v] = true;
ord[v] = k++;
low[v] = ord[v];
bool isArticulation = false;
int ct = 0;
for (int i = 0; i < G[v].size(); i++) {
if (!vis[G[v][i].to]) {
ct++;
dfs(G, G[v][i].to, v, k);
low[v] = min(low[v], low[G[v][i].to]);
if (p != -1 && ord[v] <= low[G[v][i].to]) isArticulation = true;
if (ord[v] < low[G[v][i].to]) bridge.push_back(make_pair(min(v, G[v][i].to), max(v, G[v][i].to)));
}
else if (G[v][i].to != p) {
low[v] = min(low[v], ord[G[v][i].to]);
}
}
if (p == -1 && ct > 1) isArticulation = true;
if (isArticulation) articulation.push_back(v);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Graph G(N);
rep(i, M) {
int a, b;
cin >> a >> b;
//a--; b--;
G[a].push_back(Edge{ a,b,1 });
G[b].push_back(Edge{ b,a,1 });
}
Lowlink lowlink(G);
sort(all(lowlink.articulation));
for (auto a : lowlink.articulation)cout << a << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
std::vector<long long> trips;
int ans=0;
cin>>n;
trips.resize(n);
for(auto &x:trips)
cin>>x;
n = trips.size();
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
if(trips[i]!=trips[j] && trips[i]!=trips[k] && trips[j]!=trips[k])
if(trips[i]+trips[j]>trips[k] && trips[i]+trips[k]>trips[j] && trips[j]+trips[k]>trips[i])
ans++;
}
}
}
cout << ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char a=(char)s[i];
int d=(int) a-'0';
sum+=d;
}
if(sum%9==0)cout<<"Yes\n";
else cout<<"No\n";
}
int main()
{
ll n;
cin>>n;
ll cnt=0;
ll a[n];
fi0{
cin>>a[i];
}
sort(a,a+n);
///fi0 cout<<a[i]<<' ';
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
if(a[i]!=a[j]&&a[j]!=a[k]){
vector<ll>xxx;
xxx.push_back(a[i]);
xxx.push_back(a[j]);
xxx.push_back(a[k]);
sort(xxx.begin(),xxx.end());
if(xxx[0]+xxx[1]>xxx[2])cnt++;
}
}
}
}
cout<<cnt<<endl;
}
| 1 |
#include <iostream>
#include <map>
#include <set>
#define HW 160
using namespace std;
/*struct rect
{
int h;
int w;
int tai;
};*/
int main(int argc, char const *argv[])
{
int h,w;
map<int,set<pair<int,int> > > mp;
for(int i1=1;i1<HW;i1++){
for(int i2=i1+1;i2<HW;i2++){
mp[i1*i1+i2*i2].insert(make_pair(i1,i2));
}
}
while(1){
cin>>h>>w;
if(h+w==0) break;
map<int,set<pair<int,int> > >::iterator it=mp.lower_bound(h*h+w*w);
if(it!=mp.end()) {
//cout<<(*it).first<<"a";
set<pair<int,int> >::iterator is=(*it).second.upper_bound(make_pair(h,w));
if(is!=(*it).second.end()) {
cout<<(*is).first<<" "<<(*is).second<<endl;
//cout<<(*is).second<<"b";
/*if((is++)==(*it).second.end()){
//cout<<"c";
it++;
is=(*it).second.begin();
cout<<(*is).first<<" "<<(*is).second<<endl;
}
else */
}
else {
it++;
is=(*it).second.begin();
cout<<(*is).first<<" "<<(*is).second<<endl;
}
}
}
return 0;
} | #include <cstdio>
using namespace std;
#define min(a,b) (((a) > (b))?(b):(a))
#define INF 1000001
int dp[100][100];
int V;
int warshall_floyd(int k) {
int i;
for (i=0;i<V;i++) {
int j;
for (j=0;j<V;j++) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
int main() {
while (1) {
int i;
int n, k;
scanf("%d %d", &n, &k);
if (n == 0 && k == 0) return 0;
V = n;
for (i=0;i<n;i++) {
int j;
for (j=0;j<n;j++) {
if (i == j) {
dp[i][j] = 0;
} else {
dp[i][j] = INF;
}
}
}
for (i=0;i<k;i++) {
int c, d;
int query;
scanf("%d", &query);
if (query) {
int e;
scanf("%d%d%d", &c, &d, &e);
c--;
d--;
if (dp[c][d] > e) dp[c][d] = e;
if (dp[d][c] > e) dp[d][c] = e;
warshall_floyd(c);
warshall_floyd(d);
} else {
int c, d;
scanf("%d%d", &c, &d);
c--;
d--;
if (dp[c][d] == INF) printf("%d\n", -1);
else printf("%d\n", dp[c][d]);
}
}
}
} | 0 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int,int>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mpp make_pair
#define Okay 0
#define pi 3.14159
static ll int inf = 1e9;
const int cont = 10e5+10;
using namespace std;
bool ar[10];
int n,m;
bool wrong(int n){
while(n>0){
if(ar[n%10])return true;
n/=10;
}
return false;
}
void solve(){
int m,n;
cin>>n>>m;
for(int i=0; i<m;i++){
int a;
cin>>a;
ar[a] = 1;
}
while(wrong(n)){
n++;
}
cout<<n<<endl;
}
int main(){
solve();
return Okay;
}
| #include <bits/stdc++.h>
//#define DEBUG
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n, k;
cin >> n >> k;
set<int> d;
for(int i = 0 ; i < 10; i++){
d.insert(i);
}
for(int i = 0 ; i < k; i++){
int x;
cin >> x;
d.erase(x);
}
int p[5];
for(int i = 0 ; i < 5 ; i++){
p[i] = 0;
}
int j;
for(j = 4 ; j >= 0; j--){
p[j] = n % 10;
n = n / 10;
if( n == 0 ) break;
}
int i;
for(i = j ; i < 5 ; i++){
if( d.find(p[i]) == d.end()){
break;
}else{
continue;
}
}
int smallest_digit = *d.lower_bound(0);
auto it = d.lower_bound(p[i]);
if ( it == d.end()){
int update_index = i - 1;
while ( d.lower_bound(p[update_index] + 1) == d.end()){
update_index--;
}
p[update_index] = *d.lower_bound(p[update_index] + 1);
int ans = 0;
for(int k = 0 ; k < 5 ; k++){
if( k <= update_index){
ans = ans * 10 + p[k];
}else{
ans = ans * 10 + smallest_digit;
}
}
cout << ans << endl;
return;
}
p[i] = *it;
int ans = 0;
for( int k = 0 ; k < 5 ; k++){
if( k <= i ){
ans = ans * 10 + p[k];
}else{
ans = ans * 10 + smallest_digit;
}
}
cout << ans << endl;
}
int main()
{
//making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
#ifdef DEBUG
int TEST_CASES = 2;
while(TEST_CASES--){
#endif // DEBBUG
solve();
#ifdef DEBUG
}
#endif // DEBUG
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
template<typename T> bool chmin(T &a,const T b){if(a>b){a=b; return true;}return false;}
template<typename T> bool chmax(T &a,const T b){if(a<b){a=b; return true;}return false;}
int main(){
int N, M; cin >> N >> M;
vi L(M), R(M);
for(int i=0; i<M; i++){
cin >> L[i] >> R[i];
}
int l=L[0], r=R[0];
bool flag=0;
for(int i=1; i<M; i++){
if(max(l, L[i]) <= min(r, R[i])){
l=max(l, L[i]);
r=min(r, R[i]);
}
else flag=true;
}
if(flag) cout << 0 << endl;
else cout << r-l+1 << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N, M;
cin>>N>>M;
int arr[N+1];
for(int i=0;i<=N;++i) arr[i] = 0;
int L, R;
for(int i=0;i<M;++i) {
cin>>L>>R;
L--;
arr[L]++;
arr[R]--;
}
for(int i=1;i<=N;++i) arr[i] += arr[i-1];
int ans = 0;
for(int i=0;i<=N;++i) {
if(arr[i]==M) ans++;
}
cout<<ans<<endl;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
int main(){
int t; cin>>t;
REP(kai,t){
int out=0;
int point=0;
bool rui[3]={false,false,false};
while(true){
string s; cin>>s;
if(s=="OUT"){
out++;
if(out==3)goto nextf;
}else if(s=="HOMERUN"){
point++;
REP(j,3)if(rui[j])point++;
REP(j,3)rui[j]=false;
}else{
if(rui[2])point++;
rui[2]=rui[1];
rui[1]=rui[0];
rui[0]=true;
}
}
nextf:;
cout<<point<<endl;
}
return 0;
} | #include <stdio.h>
const int MAX_V = 1000000; // 100????????§??´???°??¨?????????
int prime[MAX_V+1];
int main() {
int k,i,max,min,n; // 1????´???°???0????´???°??§???????
for(i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2??\?????´???°??¨??????
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]) {
for(k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0; // ?´???°?2?????\?????????°??´???°??§???????
}
}
}
while(scanf("%d",&n)){
if(n == 0)break;
max = 0; min = 0;
for(i = 2;i <= n;i++){
if(prime[i] && prime[i-2]){
max = i;
min = max -2;
//printf("%d %d\n",i-2,i);
}
}
printf("%d %d\n",min,max);
}
return 0;
} | 0 |
#include <iostream>
#define INF (int)1e09
int main(void) {
int m;
int n_min;
int n_max;
int gap;
int pass_num;
int pass;
int fail;
while (1) {
std::cin >> m >> n_min >> n_max;
pass = INF;
fail = INF;
gap = 0;
if (m == 0) {
break;
}
for (int i = 0; i < n_min; i++) {
std::cin >> pass;
}
for (int i = n_min; i <= n_max; i++) {
std::cin >> fail;
if (pass - fail >= gap) {
gap = pass -fail;
pass_num = i;
}
pass = fail;
}
for (int i = n_max + 1; i < m; i++) {
std::cin >> pass;
}
std::cout << pass_num << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
while (cin >> n >> a >> b, n || a || b) {
vector<ll> s(n); cin >> s;
P ans(-linf, -linf);
rep(i, n-1) {
if (a <= i+1 && i+1 <= b) {
chmax(ans, P(s[i] - s[i+1], i+1));
}
}
cout << ans.second << endl;
}
} | 1 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
int main() {
Cin(int, n, h, w);
cout << (n - h + 1) * (n - w + 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c>min(a,b)&&c<max(a,b))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 0 |
// This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <stdio.h>
#include <string.h>
int main()
{
int n;
int runner;
int score;
int out;
char nyuuryoku[114514];
scanf("%d",&n);
for(int i=0;i<n;i++){
runner=0;
score=0;
out=0;
while(out<3){
scanf("%s",nyuuryoku);
if(strcmp(nyuuryoku,"HIT")==0){
runner=runner+1;
}
else if(strcmp(nyuuryoku,"HOMERUN")==0){
score=score+runner+1;
runner=0;
}
else if(strcmp(nyuuryoku,"OUT")==0){
if(out==2&&runner>3){
score=score+runner-3;
}
out=out+1;
}
}
printf("%d\n",score);
}
}
// GCC reference:
// https://gcc.gnu.org/
// C++ language references:
// https://msdn.microsoft.com/library/3bstk3k5.aspx
// http://www.cplusplus.com/
// https://isocpp.org/
// http://www.open-std.org/jtc1/sc22/wg21/
// Boost libraries references:
// http://www.boost.org/doc/ | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
string event;
int base=0;
int inning=0;
cin>>n;
vector<int> point(n);
int outnum=0;
while(inning<n){
cin>>event;
if(event=="HIT"){
base<<=1;
base|=1;
if(base&8){
point[inning]++;
base^=8;
}
}else if(event=="HOMERUN"){
point[inning]+=1;
for(int i=0;i<3;i++)
point[inning]+=(base>>i)&1;
base=0;
}else if(event=="OUT"){
outnum++;
if(outnum>2){
outnum=0;
inning++;
base=0;
}
}
}
for(int p:point)
cout<<p<<endl;
} | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int e;
while(cin >> e,e){
int minn = e;
int res;
for(int y=0;y<=e/2;y++){
if(y*y > e) break;
for(int z=0;z<=e/3;z++){
if(z*z*z+y*y > e) break;
int x = e - y*y - z*z*z;
res = x + y + z;
if(res < minn){
minn = res;
}
}
}
cout << minn << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(){ T x; cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main()
{
while (int e = in()){
int m = 1e8;
for (int z = 0; z <= 100; ++z){
for (int y = 0; y <= 1000; ++y){
int x = e - (sq(z) * z + sq(y));
if (x < 0) continue;
m = min(m, z + y + x);
}
}
printf("%d\n", m);
}
return (0);
} | 1 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <utility>
#define INF 1000000000
using namespace std;
typedef long long int lli;
typedef pair<int, int> P;
struct edge{
int to, cost;
};
int V, E;
vector<edge> e[10000];
int mincost[10000];
bool used[10000];
int main(void){
cin >> V >> E;
for(int i = 0;i < V;i++){
mincost[i] = INF;
used[i] = false;
}
for(int i = 0;i < E;i++){
int a, b, c;
cin >> a >> b >> c;
edge d;
d.to = b;
d.cost = c;
e[a].push_back(d);
d.to = a;
e[b].push_back(d);
}
mincost[0] = 0;
long long int res = 0;
while(true){
int v = -1;
for(int u = 0;u < V;u++){
if(!used[u] && (v == -1 || mincost[u] < mincost[v])) v = u;
}
if(v == -1) break;
used[v] = true;
res += mincost[v];
for(int u = 0;u < e[v].size();u++){
mincost[e[v][u].to] = min(mincost[e[v][u].to], e[v][u].cost);
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool rangeCheck(ll y, ll x, ll h, ll w) {
if (y < 0 || x < 0 || y >= h || x >= w) {
return false;
} else {
return true;
}
}
void outputDone(ll h, ll w, vector<vector<ll>> a) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
printf("%3d", a[i][j]);
}
cout << endl;
}
return;
}
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(h);
for (ll i = 0; i < h; i++) {
cin >> s[i];
}
ll ans = 0;
vector<vector<ll>> done(h, vector<ll>(w, -1));
stack<pair<ll, ll>> st;
ll dirY[] = {1, 0, -1, 0};
ll dirX[] = {0, 1, 0, -1};
ll cnt = 0;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
if (s[i][j] == '.' || done[i][j] != -1) {
continue;
}
ll blackCnt = 0, whiteCnt = 0;
bool flag;
pair<ll, ll> xy;
xy.first = i;
xy.second = j;
st.push(xy);
while (!st.empty()) {
xy = st.top();
st.pop();
//printf("y=%d x=%d\n",xy.first,xy.second);
if (done[xy.first][xy.second] != -1) {
continue;
}
if (s[xy.first][xy.second] == '#') {
flag = false;
} else {
flag = true;
}
flag ? whiteCnt++ : blackCnt++;
done[xy.first][xy.second] = cnt;
for (ll k = 0; k < 4; k++) {
ll ny = xy.first + dirY[k];
ll nx = xy.second + dirX[k];
bool flag2;
if (!rangeCheck(ny, nx, h, w)) {
continue;
}
if (done[ny][nx] != -1) {
continue;
}
if (s[ny][nx] == '#') {
flag2 = false;
} else {
flag2 = true;
}
if (flag == flag2) {
continue;
}
pair<ll, ll> temp;
temp.first = ny;
temp.second = nx;
st.push(temp);
}
}
cnt++;
ans += blackCnt * whiteCnt;
}
}
// outputDone(h,w,done);
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll n;
cin >> n;
string ans = "";
while(n != 0){
char b = 'a' + n%26 - 1;
if(b == '`') b = 'z';
ans += b;
n = (n-1)/26;
}
reverse(ans.begin(), ans.end());
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = 1e8;
const ll INF = 1e16;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main(){
ll K;
cin >> K;
ll x = (K+49)/50, y = 50*x-K;
//すべてをx+49にした状態からy回進めた状態
cout << 50 << endl;
rep(i, y) cout << x+49-50+y-1 << ' ';
rep(i, 50-y) cout << x+49+y << ' ';
cout << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define No cout<<"No"<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a,a+n);
#define sr() sort(a,a+n,greater<ll>());
#define v() sort(v.begin(),v.end());
#define vr() sort(v.begin(),v.end(),greater<ll>());
#define mod 1000000007
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);}
ll power(ll x,ll y,ll p){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
int main() {
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
/*
Ofcourse it's Hard.
It's supposed to be Hard.
If it's easy everyone would do it.
HARD IS WHAT MAKES IT GREAT
YESTERDAY U SAID TOMORROW
SLOWLY BECOMING THE PERSON I
SHOULD HAVE BEEN A LONG TIME AGO
SAME TASK CAN'T BE FOUND DIFFICULT TWICE
BTBHWSITW
SPRH TU KAB P
CP IS ALL ABOUT THINKING
YOU HAVE MUCH MORE POTENTIAL THAN U THINK
AJIT SHIDDAT 10
UR DAILY ROUTINE
*/
fast();
//ll t;cin>>t;while(t--)
{
ll n,t,s=0;
cin>>n>>t;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=1;i<n;i++)
{
s+=min(t,a[i]-a[i-1]);
}
cout<<s+t<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int main() {
long long int n, k; cin >> n >> k;
long long ans = k;
long long t; cin >> t;
for (int i = 1; i < n; i++) {
long long x; cin >> x;
ans += min(k, (x - t));
t = x;
}
cout << ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
long long b;
for(long long i = 1; i * i <= n; i++) {
if(n % i == 0)
b = n / i;
}
int ans = 0;
while(b > 0) {
b /= 10;
ans++;
//cout << num << endl;
}
//cout << m << endl;
//cout << a << " " << b << endl;
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
cout << (N + 110) / 111 * 111 << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long int LLI;
void formula(int arr[], int step, string st_ans, int ans, vector <string> & all)
{
string tmp1 = st_ans, tmp2 = st_ans;
if( step < 4 )
{
tmp1 += "+";
tmp1 += (char)(arr[step]+'0');
formula(arr, step+1, tmp1, ans+arr[step], all);
tmp2 += "-";
tmp2 += (char)(arr[step]+'0');
formula(arr, step+1, tmp2, ans-arr[step], all);
}else{
if( ans == 7 )
all.push_back(st_ans+"=7");
}
}
int main()
{
vector <string> ans;
char take;
int arr[4];
for(int i = 0; i < 4; i++)
{
cin >> take;
arr[i] = take - '0';
}
string start = "";
start += (char)(arr[0]+'0');
formula(arr,1,start,arr[0], ans);
cout << ans[0];
} | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
// #define endl '\n'
using ll = long long;
using db = long double;
using ii = pair<int, int>;
const int N = 1e5+5, LG = 17, MOD = 1e9+7;
const int SQ = 320;
const long double EPS = 1e-7;
int a[N];
int F[N<<1], iF[N<<1];
int n;
int fast(int b, int e){
int res = 1;
for(;e;b=1ll*b*b%MOD,e>>=1)
if(e&1)res = 1ll * res * b % MOD;
return res;
}
void init(){
F[0] = iF[0] = 1;
f(i,1,N<<1){
F[i] = 1ll * i * F[i-1] % MOD;
iF[i] = fast(F[i], MOD - 2);
}
}
int get(int x1, int y1, int x2, int y2){
int cntX = x2 - x1;
int cntY = y2 - y1;
return 1ll *F[cntX+cntY] * iF[cntX] % MOD * iF[cntY] % MOD;
}
int32_t main(){
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif // ONLINE_JUDGE
init();
int H,W,A,B;
cin>>H>>W>>A>>B;
int ans = 0;
f(i,1,H-A+1){
int x = get(1,1,i,B+1);
if(i>1)x-=get(1,1,i-1,B+1);
if(x<0)x+=MOD;
ans += 1ll * x *get(i,B+1,H,W) % MOD;
if(ans>=MOD)ans-=MOD;
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include<string>
#include<iostream>
using namespace std;
int main()
{
int n; cin>>n;
string s;
int runner=0,out=0,score=0;
while(cin>>s){
if(s=="HIT"){
runner<<=1;
if(runner&8)runner&=~8,score++;
runner|=1;
}
else if(s=="HOMERUN"){
for(int i=0;i<3;i++){
runner<<=1;
if(runner&8)runner&=~8,score++;
}
score++;
}
else{
out++;
if(out==3) cout<<score<<endl,runner=out=score=0;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int point = 0, hits = 0, out = 0;
int n; cin >> n;
int i = 0;
while (i < n) {
string s; cin >> s;
if (s == "HIT") {
hits++;
if (hits == 4) {
point++;
hits--;
}
}
if (s == "OUT") {
out++;
if (out == 3) {
hits = 0;
out = 0;
cout << point << endl;
point = 0;
i++;
}
}
if (s == "HOMERUN") {
point += hits + 1;
hits = 0;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1000000000 + 7;
ll dp[200][10];
void init() {
rep(i, 0, 200) rep(j, 0, 10) dp[i][j] = 0;
}
int main(){
init();
// input
ll h, w, k;
cin >> h >> w >> k;
// dp
dp[0][0] = 1;
rep(i, 0, h) {
rep(j, 0, w) {
for(int bit = 0; bit < (1<<(w-1)); bit++) {
bool f = true;
rep(k, 0, w-2) {
if((bit & (1<<k)) && (bit & (1<<(k+1)))) f = false;
}
if(!f) continue;
if(j >= 1 && (bit & (1 << (j-1) ) ) ) {
dp[i+1][j-1] += dp[i][j];
dp[i+1][j-1] %= mod;
}else if(j <= w-2 && (bit & (1<<j) ) ) {
dp[i+1][j+1] += dp[i][j];
dp[i+1][j+1] %= mod;
}else{
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= mod;
}
}
}
}
cout << dp[h][k-1] << endl;
return 0;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, K;
cin >> n >> m >> K;
if (m == 1) {
if (K == 1) {
cout << 1 << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
const long long MOD = 1000000007;
int M = 1 << (m - 1);
vector<long long> dp(m, 0);
dp[0] = 1;
auto ndp = dp;
vector<vector<long long>> cnts(m, vector<long long>(3, 0));
int total = 0;
for (int i = 0; i < M; ++i) {
if (i & (i >> 1)) {
continue;
}
++total;
for (int j = 0; j < m - 1; ++j) {
if (i & (1 << j)) {
cnts[j + 1][0] += 1;
cnts[j][2] += 1;
}
}
}
for (int i = 0; i < m; ++i) {
cnts[i][1] = total - cnts[i][0] - cnts[i][2];
}
for (int _ = 0; _ < n; ++_) {
fill(ndp.begin(), ndp.end(), 0);
for (int i = 0; i < m; ++i) {
for (int j = -1, k = 0; k <= 2; ++k, ++j) {
int ni = i + j;
if (ni >= 0 && ni < m) {
(ndp[ni] += (dp[i] * cnts[i][k]) % MOD) %= MOD;
}
}
}
swap(ndp, dp);
}
cout << dp[K - 1] << '\n';
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //10^19 < 9223372036854775807
typedef unsigned long long ull; //10^20 < 18446744073709551615
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define MOD 1000000007
int main(void)
{
ll N;
cin >> N;
ll ans = 0;
for ( ll i = 1; i <= N; i++ ) {
if ( (i % 3 != 0) && (i % 5 != 0) ) {
ans += i;
}
}
cout << ans << endl;
return 0;
}
| # include <iostream>
# include <deque>
using namespace std;
string X;
deque<char> dchar;
int main()
{
cin>>X;
for (int i=0; i<X.size(); i++)
{
dchar.push_back(X[i]);
if (dchar.size()>=2 && dchar[dchar.size()-2]=='S' && dchar[dchar.size()-1]=='T')
{
dchar.pop_back();
dchar.pop_back();
}
}
cout<<dchar.size()<<endl;
} | 0 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int dp[1100][1100]={};
int main()
{
string a=" ",b=" ",x;
cin>>x;a+=x;
cin>>x;b+=x;
for(int i=0;i<1100;i++)dp[i][0]=dp[0][i]=i;
for(int i=1;i<a.size();i++)
{
for(int l=1;l<b.size();l++)
{
int cost (a[i]==b[l]?0:1);
dp[i][l]=min(dp[i-1][l]+1,min(dp[i][l-1]+1,dp[i-1][l-1]+cost));
}
//cout<<endl;
}
cout<<dp[a.size()-1][b.size()-1]<<endl;
} | /*
Contest 092
A - Traveling Budget
Rakesh Kumar --> 21/09/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a = 0, b = 0, c = 0, d = 0;
std::cin >> a >> b >> c >> d;
std::cout << std::min(a, b) + std::min(c, d) << std::endl;
return 0;
}
| 0 |
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int n, *nums,tmp,counter = 0;
cin >> n;
nums = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++)
{
cin >> nums[i];
}
for (int i = 0; i < n - 1; i++)
{
for (int j = n - 1; j >= 1 ; j--)
{
if (nums[j] < nums[j-1]) {
tmp = nums[j];
nums[j] = nums[j-1];
nums[j-1] = tmp;
counter++;
}
}
}
for (int i = 0; i < n; i++)
{
cout << nums[i];
if (i == n - 1) cout << endl;
else cout << " ";
}
cout << counter << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,num[3];
cin>>n;
for(int i=0;i<n;i++) cin>>num[i];
if(n==2) num[2]=num[1];
ll d=__gcd(num[0],num[1]);
d=__gcd(d,num[2]);
for(int i=1;i<=d;i++)if(d%i==0) cout <<i<<endl;
return 0;
} | 0 |
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
vector<int> G[20000];
vector<int> rG[20000];
int id[20000];
int rid[20000];
int cid[20000];
void enume(int s, int &n) {
if(id[s]) return;
id[s] = -1;
for(int t : G[s])
enume(t, n);
id[s] = ++n;
rid[n] = s;
}
void dfs(int s, int n) {
if(cid[s]) return;
cid[s] = n;
for(int t : rG[s])
dfs(t, n);
}
int main(void) {
int m,n;
scanf("%d%d",&m,&n);
for(int i=0; i<n; i++) {
int s,t;
scanf("%d%d",&s,&t);
G[s].push_back(t);
rG[t].push_back(s);
}
int k=0;
for(int i=0; i<m; i++)
enume(i, k);
for(int i=m; i; i--)
dfs(rid[i], i);
int q;
scanf("%d",&q);
for(int i=0; i<q; i++) {
int u,v;
scanf("%d%d",&u,&v);
printf("%d\n",cid[u] == cid[v]);
}
return 0;
} | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
class ConnectNodeInfo{
vector<vector<pair<ll,ll>>> graph;
public:
ConnectNodeInfo(int node_num){
graph.resize(node_num);
}
void AddNonDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
graph[v].emplace_back(u,w);
}
void AddDirectionalConnection(ll u,ll v,ll w){
graph[u].emplace_back(v,w);
}
vector<pair<ll,ll>>& operator[](ll index){
return graph[index];
}
size_t size(){return graph.size();}
};
class UnionFind{
vector<ll> rank;
vector<ll> diff_weight;
vector<ll> num;
public:
vector<ll> par;
UnionFind(ll N):par(N),num(N),rank(N),diff_weight(N){
for(ll i=0;i<N;i++){
par[i]=i;
num[i]=1;
rank[i]=0;
diff_weight[i]=0;
}
}
ll root(ll x){
if(par[x]==x){
return x;
}
ll r = root(par[x]);
diff_weight[x]+=diff_weight[par[x]];
return par[x]=r;
}
void unite(ll x,ll y){
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
if(rank[rx]<rank[ry]) swap(rx,ry);
if(rank[rx]==rank[ry]) ++rank[rx];
par[ry] = rx;
num[rx] += num[ry];
}
void relate(ll x,ll y,ll w){
w+=weight(x),w-=weight(y);
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
if(rank[rx]<rank[ry]){
swap(rx,ry);
w = -w;
}
if(rank[rx]==rank[ry]) ++rank[rx];
par[ry] = rx;
diff_weight[ry] = w;
num[rx] += num[ry];
}
bool same(ll x,ll y){
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll getsize(ll x){
return num[root(x)];
}
ll weight(ll x){
root(x);
return diff_weight[x];
}
ll diff(ll x,ll y){
return weight(y)-weight(x);
}
};
void FirstDFS(int child,int& post_count,vector<int>& post,ConnectNodeInfo& connect,vector<int>& memo){
memo[child] = 1;
for(auto& x:connect[child]){
if(!memo[x.first]){
FirstDFS(x.first,post_count,post,connect,memo);
}
}
post[child] = post_count++;
}
void SecondDFS(int start,int child,ConnectNodeInfo& connect,UnionFind& uf,vector<int>& memo){
uf.unite(start,child);
memo[child] = 1;
for(auto& x:connect[child]){
if(!memo[x.first]){
SecondDFS(start,x.first,connect,uf,memo);
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in(),M=in();
ConnectNodeInfo connect(N),inverse_connect(N);
REP(i,M){
int u=in(),v=in();
connect.AddDirectionalConnection(u,v,1);
inverse_connect.AddDirectionalConnection(v,u,1);
}
int post_count=0;
vector<int> post(N,-1);
vector<int> memo(N,0);
REP(i,N){
if(!memo[i]) FirstDFS(i,post_count,post,connect,memo);
}
vector<pair<int,int>> new_order(N);
REP(i,N){
new_order[i].first=i;
new_order[i].second=post[i];
}
sort(ALL(new_order),PAIRCOMP(second,>));
UnionFind uf(N);
fill(ALL(memo),0);
REP(i,N){
if(!memo[new_order[i].first]) SecondDFS(new_order[i].first,new_order[i].first,inverse_connect,uf,memo);
}
int Q=in();
LOOP(Q){
int u=in(),v=in();
out(uf.same(u,v)?1:0);
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
const long double eps = 1e-2;
const long double pi = acos(-1.0);
using namespace std;
const int N = 1e5 + 1;
const int LOG = 20;
int n, l;
int x[N];
int up[LOG][N];
void solve(){
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i];
cin >> l;
for (int i = 1; i <= n; i++){
if (i == n){
up[0][i] = i;
continue;
}
int p = upper_bound(x + 1, x + n + 1, x[i] + l) - x;
p--;
up[0][i] = p;
}
for (int k = 1; k < LOG; k++){
for (int i = 1; i <= n; i++)
up[k][i] = up[k - 1][up[k - 1][i]];
}
int q;
cin >> q;
while (q--){
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
int ans = 0;
for (int i = LOG - 1; i >= 0; i--)
if (up[i][a] < b){
ans += (1 << i);
a = up[i][a];
}
cout << ans + 1 << endl;
}
}
int main() {
ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
cout.setf(ios::fixed), cout.precision(3);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int step;
step = 1;
for (int i = 1; i <= step; i++){
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<ll>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int main(){
int n; cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)cin >> a[i];
ll l; cin >> l;
int ln = log2(n);
Graph next (ln+ 1, vector<ll>(n));
for(int i = 0; i < n; ++i){
int idx= upper_bound(a.begin(),a.end(), a[i]+l)-a.begin();
next[0][i] = idx-1;
//cout << next[0][i] << endl;
}
for(int k = 0; k < ln; ++k){
for(int i = 0; i < n; ++i){
next[k+1][i] = next[k][next[k][i]];
}
}
int Q;cin >> Q;
for(int _ = 0; _ < Q; ++_){
int a,b;cin >> a >> b;
--a;--b;
if(a>b)swap(a,b);
int lb = -1, ub = n;
while(ub-lb>1){
int mb = (ub+lb)/2;
int now = a;
for(int i = ln; i >= 0; --i){
if((mb>>i)&1){
now = next[i][now];
}
}
if(now>=b)ub = mb;
else lb = mb;
}
cout << ub << endl;
}
}
| 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long ll;
int main() {
ll N; cin >> N;
ll* A = new ll[N];
ll m = 0;
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = sum ^ A[i];
m = m | A[i];
}
ll filter = m - sum;
set<ll, greater<ll>> st;
for (int i = 0; i < N; i++) {
ll a = A[i] & filter;
for (auto itr = st.begin(); itr != st.end(); itr++) {
a = min(a, a ^ *itr);
}
if (a != 0) {
st.insert(a);
}
}
ll s = filter;
for (auto itr = st.begin(); itr != st.end(); itr++) {
s = min(s, (s ^ *itr) & filter);
}
cout << sum + (filter - s) * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = int(1e5) + 2;
const int inf = (int)1e15;
int n, a[N], sumxor, basis[N];
void Ins(int x) {
for(int i = 59; i >= 0; --i) {
if(!(x >> i & 1)) continue;
if(basis[i] == 0) {
basis[i] = x; return;
}
x ^= basis[i];
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define Task "test"
if(fopen(Task".inp", "r")) {
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
sumxor ^= a[i];
}
for(int i = 1; i <= n; ++i) {
for(int j = 0; j < 60; ++j)
if(sumxor & a[i] & (1ll << j)) a[i] ^= (1ll << j);
Ins(a[i]);
}
int ans = 0;
for(int i = 59; i >= 0; --i) {
if(!basis[i]) continue;
if(ans >> i & 1) continue;
ans ^= basis[i];
}
cout << ans * 2 + sumxor;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
void timecalculater(){
#ifndef ONLINE_JUDGE
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
cerr<<"Time Taken : "<<diff.count()<<"\n";
#endif
}
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void __print(double x) {cout << x;}
void __print(long double x) {cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long int> vll;
typedef vector<pii> vii;
ll p=1e9+7;
const int N=2e5+5;
ll power(ll a,ll x){
if(x<0)return 1;
ll r=1;
while(x!=0){
if(x%2==1){
r=r*a;r%=p;
}
a=a*a;a%=p;
x=x/2;
}
return r;
}
ll mul(ll a,ll b){
ll t=(a*b);
if(t>=p)t%=p;
return t;
}
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin.exceptions(cin.failbit);
int T=1;
// cin>>T;
while(T--){
int h,w;cin>>h>>w;
int a[h][w],b[h][w];
rep(i,h)rep(j,w)cin>>a[i][j];
rep(i,h)rep(j,w)cin>>b[i][j];
int x=12800;
bool dp[h][w][2*x];
memset(dp,0,sizeof(dp));
int y=a[0][0]-b[0][0];if(y<0)y=-y;
dp[0][0][y+x]=1;
dp[0][0][y]=1;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
for(int k=0;k<x*2;k++){
int y=a[i][j]-b[i][j];if(y<0)y=-y;
if(i-1>=0){
if(k-y>=0&&dp[i-1][j][k-y]==1)
dp[i][j][k]=1;
if(k+y<2*x&&dp[i-1][j][k+y]==1)
dp[i][j][k]=1;
}
if(j-1>=0){
if(k-y>=0&&dp[i][j-1][k-y]==1)
dp[i][j][k]=1;
if(k+y<2*x&&dp[i][j-1][k+y]==1)
dp[i][j][k]=1;
}
}
}
}
int ans=2*x;
rep(i,2*x){
if(dp[h-1][w-1][i]==1){
ans=min(ans,abs(i-x));
// dbg(i);
}
}
cout<<ans<<endl;
}
timecalculater();
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
using namespace std;
int w,h;
int sx,sy;
int res;
int table[30][30];
int dx[]={0,1,0,-1};
int dy[]={-1,0,1,0};
void dfs(int x,int y,int cnt){
if(cnt>=res) return ;
for(int dir=0;dir<4;dir++){
int nx=x+dx[dir],ny=y+dy[dir];
if(nx<0 || w<=nx || ny<0 || h<=ny) continue;
else if(table[ny][nx]==1) continue;
else if(table[ny][nx]==3){res=cnt; return;}
while(true){
nx+=dx[dir]; ny+=dy[dir];
if(nx<0 || w<=nx || ny<0 || h<=ny) break;
else if(table[ny][nx]==1){
table[ny][nx]=0;
dfs(nx-dx[dir],ny-dy[dir],cnt+1);
table[ny][nx]=1;
break;
}else if(table[ny][nx]==3){
res=cnt;
return ;
}
}
}
}
int main()
{
while(cin>>w>>h,w){
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>table[i][j];
if(table[i][j]==2){sx=j;sy=i;}
}
}
res=11;
dfs(sx,sy,1);
if(res>10) res=-1;
cout<<res<<endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int A;
A= S.size();
A--;
for(int i=0; i<A ; i++)
{
if(S.at(i)=='A' && (S.at(i+1)=='C'))
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"A"下一个是不是"C"
{
cout<<"Yes"<<endl;
break; //跳出循环
}
pos++; //下一次从pos+1找起
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
vector<ll>a(6);
for(int i=0;i<6;i++){
cin>>a.at(i);
}
ll min=a.at(0);
for(int i=1;i<6;i++){
if(a.at(i)<a.at(i-1)&&min>a.at(i)){
min=a.at(i);
}
}
ll ans=(a.at(0)-min)/min+5;
if((a.at(0)-min)%min!=0)ans++;
cout <<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
ll N;
cin >> N;
vector<ll> V(5);
ll min_v = 1e16;
for(int i=0; i<5; i++) {
cin >> V[i];
min_v = min(min_v, V[i]);
}
ll X = N/min_v;
if(N % min_v == 0) {
X--;
}
cout << 5 + (ll)(X) << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
string S; cin >> S;
int N = S.length();
for (int i = 1; i < N; i++){
if (S[i-1] == S[i]){
cout << i << " " << i+1 << endl;
return 0;
}
}
for (int i = 2; i < N; i++){
if (S[i-2] == S[i]){
cout << i-1 << " " << i+1 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
return 0;
}
| /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B) { cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i,a,b) for(int i=a; i<(int)b; i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9+7;
const int maxN = 1e6+2;
int main()
{
string s;
cin >> s;
int l = -2, r = -2;
for(int i = 0; i + 1 < (int) s.size(); i ++) {
if(s[i] == s[i + 1]) {
l = i, r = i + 1;
break;
}
}
for(int i = 0; i + 2 < (int) s.size(); i ++) {
set<char> unique;
for(int j = i; j < i + 3; j ++) {
unique.insert(s[j]);
}
if((int) unique.size() <= 2) {
l = i, r = i + 2;
break;
}
}
printf("%d %d\n", l + 1, r + 1);
} | 1 |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n, k; cin >> n >> k;
vi l(n); REP(i, n) cin >> l[i];
sort(ALL(l), greater<>());
int ans = accumulate(l.begin(), l.begin() + k, 0);
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
int k;
string s;
cin >> k >> s;
if(s.length() <= k){
cout << s << endl;
}else if(s.length() > k){
rep(i,k){
cout << s[i] ;
}
cout << "..." << endl;
}
} | 0 |
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
bool rangeCheck(int row,int col){
if(row >= 0 && row <= 11 && col >=0 && col<= 11)return true;
else{
return false;
}
}
void erase(char buf[12][13],int row,int col){
buf[row][col] = '0';
if(rangeCheck(row,col-1)&&buf[row][col-1] == '1')erase(buf,row,col-1);
if(rangeCheck(row+1,col)&&buf[row+1][col] == '1')erase(buf,row+1,col);
if(rangeCheck(row,col+1)&&buf[row][col+1] == '1')erase(buf,row,col+1);
}
int main(){
char buf[12][13];
int count;
while(scanf("%s",buf[0])!=EOF){
for(int i=1; i <= 11; i++){
scanf("%s",buf[i]);
}
getchar();
count = 0;
for(int i=0; i < 12; i++){
for(int k=0; k < 12; k++){
if(buf[i][k] == '1'){
count++;
erase(buf,i,k);
}
}
}
printf("%d\n",count);
}
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string N;
cin >> N;
int n = N.length();
long long dp[n + 1][2];
dp[n][0] = 0;
dp[n][1] = 0;
for (int i = n - 1; i >= 0; i--) {
dp[i][0] = INT_MAX;
dp[i][1] = INT_MAX;
int dig = N[i] - '0';
for (int j = 0; j < 10 - dig; j++) {
dp[i][0] = min(dp[i][0], dp[i + 1][0] + j + j + dig);
}
for (int j = 0; j + 1 < 10 - dig; j++) {
dp[i][0] = min(dp[i][0], dp[i + 1][1] + j + j + dig + 1);
}
for (int j = 10 - dig; j < 10; j++) {
dp[i][1] = min(dp[i][1], dp[i + 1][0] + j + (j + dig) % 10);
}
if (i < n - 1)
for (int j = 9 - dig; j < 10; j++) {
dp[i][1] = min(dp[i][1], dp[i + 1][1] + j + (j + dig + 1) % 10);
}
}
long long ans = min(dp[0][0], dp[0][1] + 1);
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9+7 ;
const ll INF = 1e18 ;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(2));
for (int i = 0; i < N; ++i) {
cin >> A[i][0] >> A[i][1];
}
auto comp = [&](vector<int>& a, vector<int>& b) {
return a[0] + a[1] < b[0] + b[1];
};
sort(A.begin(), A.end(), comp);
vector<vector<ll>> dp (N+1 , vector<ll> (N+1, INF));
for(int i = 0 ; i <= N; ++i){
dp[i][0] = 0 ;
}
for(int i = 1 ; i <= N; ++i){
for(int j = 1 ; j <= i ; ++j ){
dp[i][j] = dp[i-1][j];
if (A[i-1][0] >= dp[i-1][j-1]){
dp[i][j] = min(dp[i][j] , dp[i-1][j-1] + A[i-1][1]);
}
}
}
for(int j = N ; j >= 0; --j){
if (dp[N][j] != INF){
cout << j << "\n";
break;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define prique(T) std::priority_queue<T,vector<T>,greater<T>>
using namespace std;
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); }
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)return false;
}
return x != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int get_rand(int MIN, int MAX) {
std::random_device rnd;
std::mt19937 mt32(rnd());
std::uniform_int_distribution<int>engine(MIN, MAX);
return engine(mt32);
}
/*--------Library Zone!--------*/
int n, q;
string s;
int summ[1000005];
signed main() {
cin >> n >> s >> q;
rep(i, n) {
if (s[i] == 'M')summ[i]++;
summ[i + 1] = summ[i];
}
while (q--) {
int k; cin >> k;
int ans = 0;
int d = 0, dm = 0;
rep(i, n) {
if (s[i] == 'D')d++;
else if (s[i] == 'M')dm += d;
else if (s[i] == 'C')ans += dm;
if (i >= k - 1 && s[i - k + 1] == 'D') {
d--;
dm -= summ[i] - (i >= k ? summ[i - k] : 0);
}
}
cout << ans << endl;
}
}
| 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//const ll INF = 1LL << 60;
//const int INF = 1001001001;
int main(void){
int n,k;
cin >> n >> k;
int p[n];
REP(i,n) cin >> p[i];
int sumf=0,suml=0,maxs=0;
REP(i,n){
sumf+=p[i];
if(i>=k){
suml+=p[i-k];
}
chmax(maxs,sumf-suml);
}
double ans=(double)k/2 + (double)maxs/2;
printf("%.7f\n",ans);
return 0;
} | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define boolsize 1000001
#define pi pair<ll,ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template<typename T>
void showvector(vector <T> v)
{
for(T x:v)
cout<<x<<" ";
cout<<endl;
}
template<typename T>
void showvector1(vector <T> v)
{
ll n=v.size();
fo1(i,n-1)
cout<<v[i]<<endl;
}
template<typename T>
void showset(set <T> s)
{
for(T x: s)
cout<<x<<" ";
cout<<endl;
}
template<class T>
void showvectorpair(vector<T> v)
{
for(auto it=v.begin();it!=v.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T,typename P>
void showmap(map <T,P> m)
{
for(auto it=m.begin();it!=m.end();it++)
cout<<it->first<<" "<<it->second<<endl;
cout<<endl;
}
template<typename T>
bool comp(T a,T b)
{
return (a>b);
}
template<class T>
bool comppair(T a,T b)
{
if(a.first==b.first)
return(a.second>b.second);
return (a.first>b.first);
}
bool sameparity(ll a,ll b)
{
return (a%2==b%2);
}
bool difparity(ll a,ll b)
{
return !(a%2==b%2);
}
bool isprime(ll x)
{ if(x<=1)
return false;
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0)
return false;
}
return true;
}
bool iseven(ll x)
{
return !(x%2);
}
bool isodd(ll x)
{
return (x%2);
}
/// check for test case before submitting
void vfun()
{
ll n,k;
cin>>n;
vector <ll> v(n);
fo(i,n)
cin>>v[i];
}
ll power(ll a,ll n)
{
ll res=1;
while(n!=0)
{
if(n%2)
res*=a;
n/=2;a*=a;
}
return res;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("inputh.txt", "r", stdin);
freopen("outputh.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0); ///cant use scanf, printf
cin.tie(0);cout.tie(0); /// no longer auto flush cout before each cin, remove for interactive
//cout << fixed << setprecision(11); /// no scientific output
ll test=1;
//cin>>test;
while(test--)
{
ll n,k;
cin>>n>>k;
vi v(n);
fo(i,n)
cin>>v[i];
ll sum=0,msum=0,l=0,r=k-1;
fo(i,k)
{
msum+=v[i];
}
sum=msum;
for(ll i=0;i+k<n;i++)
{
sum-=v[i];
sum+=v[i+k];
if(sum>msum)
{
l=i+1;
r=i+k;
msum=sum;
}
}
double ans=0;
for(ll i=l;i<=r;i++)
{
ans+=(v[i]+1)/2.0;
}
cout<<fixed<<setprecision(12)<<ans;
// if(vfun())
// cout<<"YES\n";
// else
// cout<<"NO\n";
}
}
///before sub
/// check for value of zero and single input in array
///loop vars,1LL in mult, equal, one, bounds, int v ll, endl, finish taking inputs
/// check whether test cases are given or not
| 1 |
#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 = 1e6 + 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}; // {down , right , up , left}
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 n, total;
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
scanf("%d %d", &n, &total);
for (int x = 0; x <= 2000; ++x)
{
for (int y = 0; y <= 2000; ++y)
{
int rem = total - ((x * 10000) + (y * 5000));
if (rem >= 0 && rem % 1000 == 0)
{
int z = rem / 1000;
if (x + y + z == n)
return printf("%d %d %d\n", x, y, z), 0;
}
}
}
puts("-1 -1 -1");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int num, amount;
cin >> num >> amount;
amount = amount / 1000;
for(int i = 0; i <= 2000; i++) {
int a = i * 10;
for(int j = 0; j <= 2000; j++) {
int b = j * 5;
if(a + b > amount)
break;
int c = amount - a - b;
if(i + j + c == num) {
cout << i << " " << j << " " << c;
return 0;
}
}
}
cout << -1 << " " << -1 << " " << -1;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
for(int i=0; i<s.size(); i+=n) cout << s[i];
cout << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
void all_enum(string R, string B, string &S, map<string,int> &m){
int i=(int)R.size()+B.size();
if(i==(int)S.size()){
string key_=R+","+B;
//cout << key_ << endl;
if(m.count(key_)){
m[key_]++;
}else{
m[key_]=1;
}
return;
}
all_enum(R+S[i],B,S,m);
all_enum(R,B+S[i],S,m);
}
ll count_pattern(string R, string B, string &T, map<string,int> &m){
int i=(int)R.size()+B.size();
if(i==(int)T.size()){
string key_=R+","+B;
//cout << key_ << endl;
if(m.count(key_)){
return m[key_];
}else{
return 0;
}
}
ll cnt=0;
cnt+=count_pattern(R+T[i],B,T,m);
cnt+=count_pattern(R,B+T[i],T,m);
return cnt;
}
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T=S.substr(N,N);
reverse(T.begin(),T.end());
S=S.substr(0,N);
map<string,int> m;
all_enum("","",S,m);
//cout << "_______" << endl;
cout << count_pattern("","",T,m) << endl;
} | 0 |
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
struct BIT{
int bit[200001];
int size;
BIT(int n){
size = n;
for(int i=0;i<=n;i++) bit[i] = 0;
}
void add(int i,int x){
i++;
while(i<=size){
bit[i] += x;
i += i & -i;
}
}
int sum(int i){
int ret = 0;
i++;
while(i>0){
ret += bit[i];
i -= i & -i;
}
return ret;
}
};
int main(){
int n,a[200000],b[200000],p[200000];
long long ans = 0;
map<int,int> mp;
scanf("%d",&n);
BIT bit(n);
for(int i=0;i<n;i++){
scanf("%d",a+i);
b[i] = a[i];
}
sort(b,b+n);
for(int i=0;i<n;i++) mp[b[i]] = i;
for(int i=0;i<n;i++) p[mp[a[i]]] = i;
for(int i=n-1;i>=0;i--){
ans += bit.sum(p[i]);
bit.add(p[i],1);
}
printf("%lld\n",ans);
} | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
long long int c = 0;
void merge(int a[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int l[n1+1], r[n2+1];
REP(i, n1) l[i] = a[left + i];
REP(i, n2) r[i] = a[mid + i];
l[n1] = INF;
r[n2] = INF;
int i = 0;
int j = 0;
for(int k = left; k < right ; k++){
if(l[i] <= r[j]){
a[k] = l[i];
i++;
} else {
c += n1-i;
a[k] = r[j];
j++;
}
}
return;
}
void merge_sort(int a[], int left, int right){
if (left+1 < right){
int mid = (left + right) / 2;
merge_sort(a, left, mid);
merge_sort(a, mid, right);
merge(a, left, mid, right);
}
return;
}
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) cin >> a[i];
merge_sort(a, 0, n);
cout << c << 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>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
// 約数までしか作れない
int n, k;
cin >> n >> k;
set<int> nums;
int gcd;
rep(i, n)
{
int a;
cin >> a;
nums.insert(a);
if (i == 0)
{
gcd = a;
continue;
}
if (a == k)
{
cout << "POSSIBLE" << endl;
return 0;
}
gcd = __gcd(n, a);
}
if (gcd == 1 || k % gcd == 0)
{
if (*rbegin(nums) >= k)
{
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
// Use For Debug
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int n, m, p, sum;
while(std::cin >> n >> m){
std::vector<int> price_list = {};
if(n == 0 && m == 0){
break;
} else{
sum = 0;
for(int i = 0;i < n;++i){
std::cin >> p;
price_list.push_back(p);
sum += p;
}
std::sort(price_list.begin(), price_list.end(), std::greater<int>());
for(int i = 1;i <= n/m;++i){
sum -= price_list.at(i * m - 1);
}
std::cout << sum << std::endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
void ruiseki(vector<int> &sum){
for(int i=1;i<sum.size();i++){
sum[i] = mod(sum[i] + sum[i-1]);
}
}
int main(){
string S;
cin>>S;
int K;
cin>>K;
K = min(K,400);
while(S.size()!=0&&S.back()=='0'){
S.pop_back();
}
if(S.size()==1){
cout<<1<<endl;
return 0;
}
vector<int> num;
for(int i=0;i<S.size();i++){
if(S[i]=='0'){
int c = 0;
for(int j=i+1;j<S.size();j++){
if(S[j]=='0')break;
c++;
}
num.push_back(c);
}
}
if(S[0]=='0')num.insert(num.begin(),0);
else{
int c = 0;
for(int i=0;i<S.size();i++){
if(S[i]=='0'){
c++;
if(i+1==S.size()){
cout<<1<<endl;
return 0;
}
}
else{
break;
}
}
num.insert(num.begin(),c);
}
reverse(num.begin(),num.end());
vector<vector<vector<int>>> dp(num.size()+1,vector<vector<int>>(K+1,vector<int>(S.size()+1,0)));
dp[0][0][0] = 1;
vector<vector<vector<int>>> sum = dp;
ruiseki(sum[0][0]);
for(int i=1;i<=num.size();i++){
for(int j=0;j<=K;j++){
for(int k=0;k<=S.size();k++){
dp[i][j][k] = mod(sum[i-1][j].back() - sum[i-1][j][k]);
for(int t=0;t<=num[i-1];t++){
if(j-t<0||k-t<0)break;
dp[i][j][k] = mod(dp[i][j][k] + dp[i-1][j-t][k-t]);
}
sum[i][j][k] = dp[i][j][k];
}
ruiseki(sum[i][j]);
}
}
int ans = 0;
for(int i=0;i<=K;i++){
ans = mod(ans + dp.back()[i][0]);
}
cout<<ans<<endl;
return 0;
} | #include <cstdio>
using namespace std;
namespace roadagain
{
struct union_find_node
{
unsigned parent;
unsigned lank;
union_find_node() = default;
union_find_node(unsigned num)
{
this->parent = num;
this->lank = 1;
}
};
class union_find_tree
{
public:
union_find_tree(unsigned size) : size(size), group(size)
{
this->forest = new union_find_node[size];
for (unsigned i = 0; i < size; i++){
this->forest[i] = union_find_node(i);
}
}
~union_find_tree()
{
delete[] this->forest;
}
unsigned get_size()
{
return (this->size);
}
unsigned get_group()
{
return (this->group);
}
void unite(unsigned a, unsigned b)
{
if (this->forest[a].lank <= this->forest[b].lank){
this->forest[b].parent = this->forest[a].parent;
this->forest[a].lank++;
}
else {
this->forest[a].parent = this->forest[b].parent;
this->forest[b].lank++;
}
this->group--;
}
unsigned find(unsigned num)
{
if (this->forest[num].parent == num){
return (num);
}
return (this->forest[num].parent = find(this->forest[num].parent));
}
bool same(unsigned a, unsigned b)
{
return (this->find(a) == this->find(b));
}
private:
const unsigned size;
unsigned group;
union_find_node* forest;
};
}
using namespace roadagain;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
union_find_tree* uf;
char map[16][16];
void island(int y, int x)
{
if (map[y][x] == '0') return;
map[y][x] = '0';
for (int i = 0; i < 4; i++){
int tx = x + dx[i];
int ty = y + dy[i];
if (0 <= tx && tx < 12 && 0 <= ty && ty < 12){
uf->unite(y * 12 + x, ty * 12 + tx);
island(ty, tx);
}
}
}
int main()
{
while (~scanf("%s", map[0])){
for (int i = 1; i < 12; i++){
scanf("%s", map[i]);
}
uf = new union_find_tree(12 * 12);
int cnt = 0;
for (int i = 0; i < 12; i++){
for (int j = 0; j < 12; j++){
if (map[i][j] == '1'){
cnt++;
island(i, j);
}
}
}
printf("%d\n", cnt);
delete uf;
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<cmath>
#include<bitset>
#include<cassert>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main()
{
fast_io;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b, c;
cin >> a >> b >> c;
a = a ^ b;
b = a ^ b;
a = a ^ b;
a = a ^ c;
c = a ^ c;
a = a ^ c;
cout << a << " " << b << " " << c << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
#define int ll
// #define ll int
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
// const ll mod = 998244353;
const ll MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] ={1,0,-1,0,1,-1,1,-1};
ll 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; }
void solve() {
ll x,y,z;
cin>>x>>y>>z;
cout<<z<<" "<<x<<" "<<y<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 1 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[128] = { 0 };
short grid[64][64] = { {0} };
int H,W;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d", &H, &W);
for(int i = 0; i < H; i++){
memset(buf, 0, sizeof(buf));
fgets(buf, sizeof(buf), stdin);
for(int j = 0; j < W; j++)
if(buf[j] == '#') grid[i+1][j+1] = 1;
}
int flag = 0;
for(int i = 1; i < H+1; i++){
for(int j = 1; j < W+1; j++){
if(grid[i][j] == 0) continue;
else{
if(grid[i-1][j] != 1 && grid[i][j-1] != 1
&& grid[i+1][j] != 1 && grid[i][j+1] != 1){
flag = 1;
break;
}
}
}
if(flag) break;
}
if(flag == 0) printf("Yes\n");
else printf("No\n");
return 0;
}
| #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")\n"; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define rd(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << '\n';
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define wt(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int dr[] = {1, -1, 0, 0};
int dc[] = {0, 0, 1, -1};
int main() {
rd(int, h, w);
V<string> s(h);
rep(r, h) cin >> s[r];
VV<bool> b(h + 2, V<bool>(w + 2));
rep(r, h) rep(c, w) b[r + 1][c + 1] = s[r][c] == '#';
rep(r, h) rep(c, w) if (b[r + 1][c + 1]) {
bool ok = false;
rep(i, 4) if (b[r + 1 + dr[i]][c + 1 + dc[i]]) ok = true;
if (!ok) {
wt("No");
return 0;
}
}
wt("Yes");
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define IG cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define ll long long int
#define N 1378
#define maxn 1000003
#define FP ff.open("output.txt")
#define FR ff.open("input.txt")
#define valid(a,b) if(a>=1 && a<row-1 && b>=1 && b<col-1)
fstream ff;
ll a, q, b, c, d, k, h, e, f, t, m, n, i, j, x, y, count, tcase = 0, l, r;
string s1, s2, s;
int main() {
cin>>n;
ll sum = 0;
unsigned ll v[n];
for(int i = 0;i<n;i++){
cin>>v[i];
sum+=v[i];
}
unsigned ll ans = 0,sum2=0;
for(int i = 0;i<n;i++){
sum2+=v[i];
unsigned ll x = ((sum-sum2)%mod * v[i] %mod)%mod;
ans = (ans + x)%mod;
}
cout<<(ans)<<endl;
return 0;
}
| #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double lld;
typedef long long int lli;
using namespace std;
const int N = 1000001;
const int MOD = 1e9+7;
const bool DEBUG = 1;
#define sd(x) scanf("%d ", &x)
#define sd2(x, y) scanf("%d%d", &x, &y)
#define sd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define endl "\n"
#define fi first
#define se second
#define eb emplace_back
#define fbo find_by_order
#define ook order_of_key
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define LET(x, a) __typeof(a) x(a)
#define foreach(it, v) for (LET(it, v.begin()); it != v.end(); it++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define __ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(c) c.begin(), c.end()
#define inf 1000000000000000001
#define epsilon 1e-6
#define int ll
#define RUN_T \
int _t; \
cin >> _t; \
while (_t--)
#define tr(...) \
if (DEBUG) { \
cout << __FUNCTION__ << ' ' << __LINE__ << " = "; \
trace(#__VA_ARGS__, __VA_ARGS__); \
}
template <typename S, typename T>
ostream &operator<<(ostream &out, pair<S, T> const &p) {
out << '(' << p.fi << ", " << p.se << ')';
return out;
}
template <typename T>
ostream &operator<<(ostream &out, set<T> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << (*i) << ' ';
return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, map<T, V> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << "\n" << (i->first) << ":" << (i->second);
return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, unordered_map<T, V> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << "\n" << (i->first) << ":" << (i->second);
return out;
}
template <typename T>
ostream &operator<<(ostream &out, multiset<T> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << (*i) << ' ';
return out;
}
template <typename T>
ostream &operator<<(ostream &out, unordered_set<T> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << (*i) << ' ';
return out;
}
template <typename T>
ostream &operator<<(ostream &out, unordered_multiset<T> const &v) {
for (auto i = v.begin(); i != v.end(); i++)
out << (*i) << ' ';
return out;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> const &v) {
ll l = v.size();
for (ll i = 0; i < l - 1; i++)
out << v[i] << ' ';
if (l > 0)
out << v[l - 1];
return out;
}
template <typename T> void trace(const char *name, T &&arg1) {
cout << name << ":" << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char *names, T &&arg1, Args &&... args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << ":" << arg1 << "|" ;
trace(comma + 1, args...);
}
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n;
int v[N], dp[N][4];
bool vis[N][4];
int recur(int idx , int len){
if(idx > n){
if( len <= 1) return 0;
else return -1e18;
}
int &ans = dp[idx][len];
if(vis[idx][len])
return ans;
vis[idx][len] = 1;
if(!len)
ans = v[idx] + recur(idx + 2, len);
else
ans = max(v[idx] + recur(idx + 2, len), recur(idx + 1, len - 1));
return ans;
}
int32_t main(){
cin >> n;
for(int i = 1 ; i <= n; i++){
cin >> v[i];
}
int ans = 0;
if(n % 2)
ans = max(recur(1, 2), recur(2, 1));
else
ans = max(recur(1, 1), recur(2, 0));
cout << ans;
} | 0 |
/***
Muhammad Imdad-Ul-Haque Rakib(Attari)
CSE'19
Chittagong,Bangladesh
***/
#include<bits/stdc++.h>
/**Definitions**/
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over return 0
#define scan(i,n,a) for(i=0;i<n;i++) cin>>a[i]
#define MP make_pair
#define spc " "
using namespace std;
/** Predefined Functions **/
int gcd(int x,int y){
if(x==0) return y;
else return gcd(y%x,x);
}
bool sortbysec(const pair<int,int>&a, const pair<int,int>&b){ return (a.second<b.second); }
bool sortbysecinrev(const pair<int,int>&a, const pair<int,int>&b){ return (a.second>b.second); }
bool sortbysize(string &s1,string &s2){ return s1.size() < s2.size(); }
bool sortinrev(const pair<int,int> &a, const pair<int,int> &b){ return (a.first > b.first); }
/** Main Function **/
int main(){
boost_;
ll n;
cin>>n;
ll a[n],i,a1=0,a2=0,a3=0;
vector<ll>v,q;
map<ll,ll>mp;
scan(i,n,a);
sort(a,a+n,greater<int>());
for(i=0;i<n;++i){
mp[a[i]]++;
if(mp[a[i]]==1) q.pb(a[i]);
}
for(i=0;i<q.size();++i){
if(mp[q[i]]>=2) v.pb(q[i]);
if(v.size()==2) break;
}
if(v.size()==0) cout<<0<<endl;
else{
if(v.size()==1){if(mp[v[0]]>=4) cout<<v[0]*v[0]<<endl; else cout<<0<<endl;}
else{
if(mp[v[0]]>=4) cout<<v[0]*v[0]<<endl;
else cout<<v[0]*v[1]<<endl;
}
}
over;
}
| #include "assert.h"
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long LL;
typedef pair<int, int> PII;
mt19937 mrand(random_device{}());
inline int in() {
char ch = getchar();
int f = 1, x = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
return f * x;
}
const int inf = (1 << 30);
const int mod = 998244353;
const int N = 100010;
LL cnt[50][30];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
// freopen("out.out", "w", stdout);
#endif
int n = in();
int tmp = 1e9, A = 0, B = 0;
while (tmp % 2 == 0)
++A, tmp /= 2;
while (tmp % 5 == 0)
++B, tmp /= 5;
cerr << A << " " << B << endl;
LL ans = 0;
rep(_, 1, n) {
double x;
cin >> x;
LL tmp = llround(x * 1e9) ;
int a = 0, b = 0;
while (tmp % 2 == 0)
++a, tmp /= 2;
while (tmp % 5 == 0)
++b, tmp /= 5;
rep(i, 0, 49) rep(j, 0, 29) {
if (i + a >= A * 2 && j + b >= B * 2)
ans += cnt[i][j];
}
cnt[a][b]++;
cerr << ans << endl;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <set>
using ll = long long;
using namespace std;
// xorの掃き出し法をするためのクラス
// matに基底たちが入る
// Tはbitsetは無理(minしないといけないから)
template <typename T>
class BitLinearSpace {
vector<T> bases; // この中身をsortしちゃうと壊れる
public:
BitLinearSpace() = default;
BitLinearSpace(vector<T> &matrix) {
for (auto &mi:matrix) {
add_val(mi, false);
}
}
// valが張れるように基底を追加する
// 追加した場合true, しなかった場合false
// O(N) (ソートするとNlogN)
// 追加後にソートするかを選ぶ
bool add_val(T val) {
if ((val = elementary_opperation(val))) {
bases.push_back(val);
return true;
} else {
return false;
}
}
// 今のベクトル空間にvalが含まれるか(=basesの要素のxorでvalが作れるかをチェック)
// O(n)
bool includes(T val) {
return elementary_opperation(val) == 0;
}
// 行列にvalを追加するていで行基本変形をvalに施す
// 実際には追加しない
// O(n)
T elementary_opperation(T val) {
for (auto &b:bases) {
val = min(val, val ^ b);
}
return val;
}
T &operator[](int i) { return bases[(size_t)i]; }
const T &operator[](int i) const { return bases[(size_t)i]; }
auto begin() { return bases.begin(); }
auto end() { return bases.end(); }
auto begin() const { return bases.begin(); }
auto end() const { return bases.end(); }
int size() { return (int)bases.size(); }
};
int main() {
int n;
cin >> n;
BitLinearSpace<ll> bls;
ll sum = 0;
for (int i=0; i<n; i++) {
ll ai; cin >> ai;
sum ^= ai;
bls.add_val(ai);
}
vector<ll> bases(bls.begin(), bls.end());
ll blue = 0, red = sum;
for (int i=59; i>=0; i--) {
if ((blue & (1ll << i)) == (red & (1ll << i))) {
ll used = -1;
for (auto &bi:bases) {
if (bi & (1ll << i)) {
if (used < 0) {
if ((blue & (1ll << i)) == 0)
blue ^= bi;
used = bi;
}
bi ^= used;
}
}
}
red = blue ^ sum;
}
cout << blue + red << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll cnt[66][2];
int main(){
int n;cin>>n;
for(int i=0;i<n;i++){
ll a;cin>>a;
int bit=0;
while(a){
if(a&1){
cnt[bit][1]++;
}else cnt[bit][0]++;
a/=2;
bit++;
}
for(int j=bit;j<=64;j++)cnt[j][0]++;
}
ll ans=0;
for(int i=0;i<=62;i++){
ll p=(1LL<<i);p%=mod;
ll hano=cnt[i][0]*cnt[i][1];
hano%=mod;
ans+=(p*hano);
ans%=mod;
}
cout<<ans;
return 0;
} | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
ll mod=1e9+7;
long long modpow(long long a, long long n, long long mod=(1LL<<62)){
long long res = 1;
while (n > 0){
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
ll n;
ll ans=0LL;
cin >>n;
ll a;
int c=0;
map<int,int>dis;
rep(i,n){
c=0;
cin>>a;
while(a!=0){
dis[c]+=(a%2LL);
a/=2LL;
c++;
}
}
repi(itr,dis){
// clog<<(itr->F)<<" "<<(itr->S)<<endl;
ans+=modpow(2,itr->F,mod)*(itr->S)%mod*(n-itr->S)%mod;
ans%=mod;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (ll)c.size()
#define fr first
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define mem0(a) memset(a,0,sizeof(a))
#define rep(i,a,n) for(ll i=a ; i<n ; i++)
#define ld long double
const ll INF = __LONG_LONG_MAX__;
#define rall(a) (a).rbegin(),(a).rend()
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
ll power(ll b,ll e,ll m)
{
if(b==0) return 0;
if(e==0) return 1;
if(e&1) return b*power(b*b%m,e/2,m)%m;
return power(b*b%m,e/2,m);
}
ll power( ll b, ll e)
{
if(b==0) return 0;
if(e==0) return 1;
if(e&1) return b*power(b*b,e/2);
return power(b*b,e/2);
}
bool isPowerOfTwo(ll x)
{
// x will check if x == 0 and !(x & (x - 1)) will check if x is a power of 2 or not
return (x && !(x & (x - 1)));
}
ll ans(ll a[],ll n)
{
ll sum=0;
for(ll i=0;i<64;i++)
{
ll zero=0,one=0;
for(ll j=0;j<n;j++)
{
if(a[j]&1) zero++;
else one++;
a[j]/=2;
}
ll x=(zero%MOD*one%MOD*power(2,i,MOD))%MOD;
sum=(sum%MOD+x%MOD)%MOD;
}
return sum;
}
void solve()
{
ll n;
cin>>n;
ll a[n];
rep(i,0,n) cin>>a[i];
cout<<ans(a,n);
}
int main()
{
fastio
ll tt=1;
// cin>>tt;
while(tt--)
{
solve();
cout<<"\n";
}
} | 1 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
/// find_by_order()
/// order_of_key()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7; /// think
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, ans = 0;
cin >> n;
int mn = INF;
for (int i = 0, x; i < n; i++) {
cin >> x;
if (x <= mn) {
++ans;
}
umin(mn, x);
}
cout << ans << '\n';
}
| #include<bits/stdc++.h>
using namespace std;
int nearPow2(int n){
if (n <= 0) return 0;
if ((n & (n - 1)) == 0) return (uint)n;
uint ret = 1;
while (n > 0) { ret <<= 1; n >>= 1; }
return ret;
}
int main(){
int n,ans=0;
cin >> n;
map<int,int> mp;
for(int i=0;i<n;i++){
int a;
cin >> a;
mp[a]++;
}
auto itr=mp.end();
itr--;
for(;itr!=mp.begin();itr--){
int pw=nearPow2((*itr).first);
if(pw == (*itr).first){
ans += (*itr).second/2;
}
else{
int q = min((*itr).second,mp[pw-(*itr).first]);
ans += q;
mp[pw-(*itr).first] -= q;
}
}
int pw=nearPow2((*itr).first);
if(pw == (*itr).first){
ans += (*itr).second/2;
}
cout << ans << endl;
} | 0 |
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define minimize(a,b) (a>(b)?a=(b),1:0)
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define ceil(a,b) (((a)+(b)-1)/(b))
#define yn(i) print((i)?"Yes":"No")
#define chmin(a,b) (a>(b)?a=(b),1:0)
#define abs(n) max((n),-(n))
#define dist(a,b) max((a)-(b),(b)-(a))
#define chmax(a,b) (a<(b)?a=(b),1:0)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define MOD 1000000000
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
// Container コンテナ型, map以外
template< template<class ...> class Ctn,class T>
std::ostream& operator<<(std::ostream& os,const Ctn<T>& v){
auto itr=v.begin();
while(itr!=v.end()){
if(itr!=v.begin())cout << " ";
cout << *(itr++);
}
return os;
}
string key="keyence";
void add(char m,string s,set<string> st){
int n=s.size();
rep(i,n){
if(s[i]!=m) continue;
string t;
repa(j,i,n){
t.push_back(s[j]);
st.insert(t);
}
}
}
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int main(){
li n; cin >>n;
li a=n/500,b=(n%500)/5;
print(1000*a+5*b);
}
| //https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cout<<sum<<"\n";
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
// ascii 97~122
int main(){
string s;
getline(cin,s);
vector<bool> vec(26);
for(int i=0; i<26; i++){
vec.at(i) = false;
}
char c;
int n = s.size();
for(int i=0; i<n; i++){
c = s.at(i);
vec.at((int)(char)c - 'a') = true;
}
for(int i=0; i<26; i++){
if(vec.at(i)==false){
cout << (char)(i +'a') << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
} | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;
static const double EPS = 1e-8;
static const int tx[] = {0,1,0,-1};
static const int ty[] = {-1,0,1,0};
int main(){
int n;
while(~scanf("%d",&n)){
map<int,int> freq;
for(int i=0;i<n;i++){
int num;
scanf("%d",&num);
for(int div=1;div*div<=num;div++){
if(num % div == 0){
freq[div]++;
if(div != (num/div)) freq[num/div]++;
}
}
}
for(map<int,int>::iterator it = freq.begin();
it != freq.end();
it++){
if(it->second >= n){
printf("%d\n",it->first);
}
}
}
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int sgn(int x){return (x>0)-(x<0);}
int abs(int x){return x>0?x:-x;}
int a,b;
int main()
{
scanf("%d%d",&a,&b);
if(!a){if(b>=0)cout<<b<<endl;else cout<<1-b<<endl;return 0;}
if(!b){if(a>0)cout<<a+1<<endl;else cout<<-a<<endl;return 0;}
int ans=abs(abs(a)-abs(b));
if(sgn(a)!=sgn(b))cout<<ans+1<<endl;
else
{
if(a>b)cout<<ans+2<<endl;
else cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b, cnt = 0, plug = 1;
cin >> a >> b;
while(plug < b) {
plug--;
plug += a;
cnt++;
}
cout << cnt << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = v.size() - 1; i >= 0; --i) {
if (i < v.size() - 1) cout << " ";
cout << v[i];
}
cout << endl;
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;//998244353;
template<class _T> static void get(_T& a) {
std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
std::cin >> a >> b >> c;
}
template<class _T> static void getint(_T& a) {
if (sizeof(_T) > sizeof(int)) {
scanf("%lld", &a);
}
else {
scanf("%d", &a);
}
}
static void exec();
int main()
{
exec();
fflush(stdout);
return 0;
}
static void exec()
{
int N;
get(N);
int now = 0, start = 0;
int end = N;
std::string ans;
printf("%d\n", now);
fflush(stdout);
get(ans);
std::string even = ans;
std::string odd = "Female";
if (even == odd) odd = "Male";
while (ans != "Vacant") {
now = (start + end) / 2;
printf("%d\n", now);
fflush(stdout);
get(ans);
if (((now % 2) && (ans == odd)) || ((now % 2 == 0) && (ans == even))) {
start = now;
}
else {
end = now;
}
}
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
using namespace std;
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define pp pair<ll, pair<ll, ll>>
////////////////////////////////////////////////////////
int main() {
string s; cin >> s;
bool f = true;
while(f){
bool f = true;
rep(i, 0, sz(s)-5){
if(s[i]=='S'&&s[i+1]=='S'&&s[i+2]=='S'&&
s[i+3]=='T'&&s[i+4]=='T'&&s[i+5]=='T'){
s.erase(i, 6);
f = false;
i -= 5;
}
}
rep(i, 0, sz(s)-1){
if(s[i] == 'S' && s[i+1] == 'T'){
s.erase(i, 2);
f = false;
i--;
}
}
if(f) break;
}
co(sz(s));
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 1000000007;
constexpr i64 INF = 1LL << 60;
int main() {
string s; cin >> s;
int n = s.size();
int ans = 0;
int st = 0;
rep(i, 0, n) {
if (s[i] == 'S') ++st;
else {
if (st == 0) ++ans;
else --st;
}
}
cout << ans + st << endl;
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main(void){
int x[5];
while(scanf("%d,%d,%d,%d,%d"
,&x[0],&x[1],&x[2],&x[3],&x[4])!=EOF){
sort(x,x+5);
int cnt[15];
fill(cnt,cnt+15,0);
for(int i=0;i<5;i++){
cnt[x[i]]++;
if(x[i]==1)cnt[14]++;
}
int fg=0;
for(int i=0;i<15;i++)
if(cnt[i]==4){
cout << "four card" << endl;
fg=1;
break;;
}
if(fg)continue;
int fg2=0,fg3=0;
for(int i=0;i<14;i++){
if(cnt[i]==2)fg2++;
if(cnt[i]==3)fg3=1;
}
if(fg2 && fg3){
cout << "full house" << endl;
continue;
}
for(int i=0;i+4<15;i++){
if(cnt[i] & cnt[i+1] & cnt[i+2] & cnt[i+3] &cnt[i+4]){
cout << "straight" << endl;
fg=1;
break;;
}
}
if(fg)continue;
if(fg3){
cout << "three card" << endl;
continue;
}
if(fg2==2){
cout << "two pair" << endl;
continue;
}
if(fg2==1){
cout <<"one pair" << endl;
continue;
}
cout << "null" << endl;
}
return 0;
} | #include <cstdio>
#include <functional>
#include <algorithm>
using namespace std;
/** Application main entry point. */
int main (
int argc,
char * argv[ ]
)
{
int d[ 5 ];
int i;
while ( scanf ( " %d,%d,%d,%d,%d"
, d, d + 1, d + 2, d + 3, d + 4 ) == 5 )
{
int c[ 13 ] = { 0 };
sort ( d, d + 5 );
for ( i = 0; i < 5; ++i )
{
++c[ d[ i ] - 1 ];
}
sort ( c, c + 13, greater< int > ( ) );
if ( c[ 0 ] == 4 )
{
puts ( "four card" );
}
else if ( c[ 0 ] == 3 && c[ 1 ] == 2 )
{
puts ( "full house" );
}
else if ( ( d[ 0 ] == d[ 1 ] - 1
&& d[ 0 ] == d[ 2 ] - 2
&& d[ 0 ] == d[ 3 ] - 3
&& d[ 0 ] == d[ 4 ] - 4 )
|| ( d[ 0 ] == 1
&& d[ 1 ] == 10
&& d[ 2 ] == 11
&& d[ 3 ] == 12
&& d[ 4 ] == 13 ) )
{
puts ( "straight" );
}
else if ( c[ 0 ] == 3 )
{
puts ( "three card" );
}
else if ( c[ 0 ] == 2 && c[ 1 ] == 2 )
{
puts ( "two pair" );
}
else if ( c[ 0 ] == 2 )
{
puts ( "one pair" );
}
else
{
puts ( "null" );
}
}
return ( 0 );
} | 1 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define MP std::make_pair
#define rep(i, l, r) for (int i = (l); i <= (r); ++ i)
#define per(i, r, l) for (int i = (r); i >= (l); -- i)
#define PE(x, a) for (int x = head[a]; x;x = edge[x].next)
#define pb push_back
#define CL(a, b) memset(a, b, sizeof a)
#define PII std::pair<int, int>
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const ll HA = 1e9 + 7;
ll f[45][(1 << 17) + 7];
int n, x, y, z;
int main() {
scanf("%d %d %d %d", &n, &x, &y, &z);
int st = (1 << (z - 1)) | (1 << (z + y - 1)) | (1 << (z + y + x - 1));
int lim = (1 << (x + y + z)) - 1;
f[0][0] = 1;
rep(i, 1, n) {
rep(s, 0, lim) {
if ((s & st) != st && f[i - 1][s])
rep(c, 1, 10) {
f[i][lim & ((s << c) | (1 << c - 1))] = (f[i][lim & ((s << c) | (1 << c - 1))] + f[i - 1][s]) % HA;
}
}
}
ll ans = 0;
rep(i, 0, lim) if ((i & st) != st) ans = (ans + f[n][i]) % HA;
ll tmp = 1;
rep(i, 1, n) tmp = tmp * 10 % HA;
ans = (tmp - ans + HA) % HA;
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
// nCr mod p(n<p)をキビキビ計算する
// 構築:O(n), クエリ:O(1)
struct combination_mod {
using lint = long long int;
int sz;
lint mod;
vector<lint> fac;
vector<lint> finv;
combination_mod(int _sz, lint _mod) : sz(_sz), mod(_mod) {
fac.assign(sz + 1, 1);
finv.assign(sz + 1, 1);
vector<lint> inv(sz + 1, 1);
for (int i = 2; i <= sz; 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;
}
}
lint query(int n, int r) {
return fac[n] * (finv[r] * finv[n - r] % mod) % mod;
}
};
lint n, m, k;
int main() {
cin >> n >> m >> k;
lint mod = 1e9 + 7;
combination_mod comb(m * n, mod);
lint c = comb.query(m * n - 2, k - 2);
lint ans = 0;
for (lint i = 0; i < n; i++) {
for (lint j = 0; j < m; j++) {
lint M = (j * (j + 1) + (m - j) * (m - j - 1)) / 2;
M %= mod;
lint cand = 0;
cand += M * n % mod;
cand += i * (i + 1) / 2 % mod * m % mod;
cand += (n - i) * (n - i - 1) / 2 % mod * m % mod;
cand %= mod;
cand *= c;
cand %= mod;
ans = (ans + cand) % mod;
}
}
ans = (((lint)1e+9 + 8) / 2 * ans) % mod;
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll n,m;cin >> n >> m;
vector<deque<ll>> g(n);
rep(i,n){
rep(j,m){
ll a;cin >> a;
g[i].pb(a);
}
}
ll ans=inf;
set<ll> st;
rep(i,m){
rep(j,n){
while(st.count(g[j].front())){
g[j].pop_front();
}
}
map<ll,ll> mp;
rep(j,n){
mp[g[j].front()]++;
}
ll del=-1,pp=-1;
for(auto p:mp){
if(chmax(pp,p.se))del=p.fi;
}
chmin(ans,pp);st.ins(del);
}
cout << ans <<endl;
} | #define C
typedef long long readtype;
/* Header {{{ */
#ifdef C
#include <stdio.h>
#include <math.h>
#include <string.h>
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
template<typename type> type abs(type a) { return a < 0 ? -a : a; }
template<typename type> type min(type a, type b) { return a < b ? a : b; }
template<typename type> type beMin(type &a, type b) { return a = (a < b ? a : b); }
template<typename type> type max(type a, type b) { return a > b ? a : b; }
template<typename type> type beMax(type &a, type b) { return a = (a > b ? a : b); }
template<typename type> void swap(type &a, type &b) { type c; c = a; a = b; b = c; }
#endif
#ifdef Cpp
#include <bits/stdc++.h>
using namespace std;
#endif
typedef long long var;
readtype read() {
readtype a = 0, c = getchar(), s = 0;
while (!isdigit(c)) s |= c == '-', c = getchar();
while (isdigit(c)) a = a * 10 + c - 48, c = getchar();
return s ? -a : a;
}
/* }}} */
const int N = 311;
int n, m;
int a[N][N], have[N], pos[N];
bool ban[N];
bool check(int t);
int main() {
/*
#ifndef ONLINE_JUDGE
freopen("source.in", "r", stdin);
freopen("source.out", "w", stdout);
#endif
*/
n = read(), m = read();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) a[i][j] = read();
}
int l = 1, r = n;
while (l < r) {
int mid = (l + r) >> 1;
if (!check(mid)) l = mid + 1;
else r = mid;
}
printf("%d\n", l);
return 0;
}
bool check(int t) {
memset(ban, false, sizeof(ban));
memset(have, 0, sizeof(have));
memset(pos, 0, sizeof(pos));
for (int i = 1; i <= n; ++i) have[a[i][++pos[i]]]++;
while (true) {
bool ok = true;
for (int i = 1; i <= m; ++i) {
if (have[i] <= t) continue;
ok = false;
ban[i] = true;
}
if (ok) break;
for (int i = 1; i <= n; ++i) {
while (pos[i] <= m && ban[a[i][pos[i]]]) {
have[a[i][pos[i]]]--;
have[a[i][++pos[i]]]++;
}
if (pos[i] > m) return false;
}
}
return true;
}
| 1 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long LL ;
int n ;
LL ar[200005] ;
pair<LL,LL> BS(const int lower, const int upper){
LL extra ;
if(lower == 0) extra = 0 ;
else extra = ar[lower - 1] ;
int l = lower, u = upper, mid, indx = -1 ;
LL min_diff = LLONG_MAX ;
while(l <= u){
mid = (l + u) / 2 ;
LL left = ar[mid] - extra ;
LL right = ar[upper] - ar[mid] ;
if(abs(left - right) < min_diff){
min_diff = abs(left - right) ;
indx = mid ;
}
if(left == right)
break ;
else if(left > right)
u = mid - 1 ;
else
l = mid + 1 ;
}
return {ar[indx] - extra, ar[upper] - ar[indx]} ;
}
int main(){
cin >> n >> ar[0] ;
for(int i = 1 ; i < n ; i++){
cin >> ar[i] ;
ar[i] += ar[i-1] ;
}
LL ans = LLONG_MAX ;
for(int i = 1 ; i + 2 < n ; i++){
pair<LL,LL> p1 = BS(0, i) ;
pair<LL,LL> p2 = BS(i + 1, n - 1) ;
ans = min(ans, ( max(p1.first, max(p1.second, max(p2.first, p2.second)))
- min(p1.first, min(p1.second, min(p2.first, p2.second))) )) ;
}
cout << ans << endl ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> calc_cut_left(vector<long long> pref, int n) {
vector<int> ans(n);
int cur = 0;
ans[1] = 0;
for (int i = 2; i + 2 < n; i++) {
long long s1 = abs(pref[cur + 1] - (pref[i] - pref[cur + 1]));
long long s2 = abs(pref[cur] - (pref[i] - pref[cur]));
while (abs(pref[cur + 1] - (pref[i] - pref[cur + 1])) < abs(pref[cur] - (pref[i] - pref[cur])))
cur++;
ans[i] = cur;
}
return ans;
}
vector<int> calc_cut_right(vector<long long> pref, int n) {
vector<int> ans(n);
int cur = n - 2;
ans[n - 3] = cur;
for (int i = n - 4; i >= 1; i--) {
long long s1 = abs((pref[n - 1] - pref[cur - 1]) - (pref[cur - 1] - pref[i]));
long long s2 = abs((pref[n - 1] - pref[cur]) - (pref[cur] - pref[i]));
while (abs((pref[n - 1] - pref[cur - 1]) - (pref[cur - 1] - pref[i])) < abs((pref[n - 1] - pref[cur]) - (pref[cur] - pref[i])))
cur--;
ans[i] = cur;
}
return ans;
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<long long> pref(n, a[0]);
for (int i = 1; i < n; i++)
pref[i] = pref[i - 1] + a[i];
vector<int> pos_left = calc_cut_left(pref, n);
vector<int> pos_right = calc_cut_right(pref, n);
long long ans = -1;
for (int i = 1; i + 2 < n; i++) {
int l = pos_left[i];
int r = pos_right[i];
long long s1 = pref[l];
long long s2 = pref[i] - pref[l];
long long s3 = pref[r] - pref[i];
long long s4 = pref[n - 1] - pref[r];
long long cur = max({s1, s2, s3, s4}) - min({s1, s2, s3, s4});
if (ans == -1 || cur < ans)
ans = cur;
}
printf("%lld\n", ans);
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
int n,m;
vector<int> fri[501];
int ff[501];
main(){
while(1){
scanf("%d",&n);
scanf("%d",&m);
if(n==0 && m==0) break;
memset(ff,0,sizeof(ff));
for(int i=0;i<=501;i++)
fri[i].clear();
for(int i=0;i<m;i++){
int a,b;
scanf("%d %d",&a,&b);
fri[a].push_back(b);
fri[b].push_back(a);
}
int M=fri[1].size();
for(int i=0;i<M;i++){
int N=fri[fri[1][i]].size();
for(int j=0;j<N;j++){
ff[fri[fri[1][i]][j]]=1;
}
ff[fri[1][i]]=1;
}
int res=0;
for(int i=2;i<=n;i++){
if(ff[i]==1)res++;
// printf("%d ",ff[i]);
}
printf("%d\n",res);
}
} | #include<bits/stdc++.h>
using namespace std;
long long stu[510],memo[510][510],m,n,sum,a,b;
int main(){
while(1){
cin >> n >> m;
if(n==0)break;
for(int i=0;i<m;i++){
cin >> a >> b;
if(a==1&&stu[b]==0){
stu[b]=1;
sum++;
}else memo[a][b]=5;
}
for(int i=2;i<n+1;i++){
for(int j=2;j<n+1;j++){
if(memo[i][j]==5){
if(stu[i]==1&&stu[j]==0){
stu[j]=2;
sum++;
}
}
}
}
for(int i=2;i<n+1;i++){
for(int j=2;j<n+1;j++){
if(memo[i][j]==5){
if(stu[i]==0&&stu[j]==1){
stu[i]=2;
sum++;
}
}
}
}
cout << sum << endl;
for(int i=0;i<n+1;i++){
for(int j=0;j<n+1;j++){
memo[i][j]=0;
}
}
for(int i=0;i<n+1;i++){
stu[i]=0;
}
sum=0;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while ( cin >> N ) {
if ( N == 0 ) {
break;
}
typedef pair<double, string> P;
vector<P> ans;
while ( N-- ) {
string l;
int p;
cin >> l >> p;
int t = 0;
int d = 0;
for ( int i = 0; i < 5; i++ ) {
int a;
cin >> a;
if ( i <= 2 ) t += a;
else d += a;
}
int f, s, m;
int sum = 0;
cin >> f >> s >> m;
t += d*m;
sum = f*s*m;
ans.push_back(P(-((double)(sum-p)/(double)t), l));
}
sort(ans.begin(), ans.end());
for ( int i = 0; i < ans.size(); i++ ) {
cout << ans[i].second << endl;
}
cout << '#' << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<double,string> P;
const int INF=1e9;
bool comp(P a,P b){
if(a.first!=b.first)return a.first>b.first;
int l=min(a.second.size(),b.second.size());
REP(i,l){
if(a.second[i]!=b.second[i])return a.second[i]<b.second[i];
}
return a.second.size()<b.second.size();
}
int main(){
int n,p,a,b,c,d,e,f,s,m;
while(cin>>n&&n){
vector<P> V;
string l;
REP(i,n){
cin>>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;
if(m==1){
V.PB(P((double)(s*f-p)/(a+b+c+d+e),l));
}else{
V.PB(P((double)(s*f*m-p)/(a+b+c+(d+e)*m),l));
}
}
sort(ALL(V),comp);
REP(i,V.size()){
cout<<V[i].second<<endl;
}
cout<<'#'<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s1[100],s2[100];
string t;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >> ty;
int i=0,j=0;
while(j<(ty-sy))
{cout << 'U'; j++;}
while(i<(tx-sx))
{ cout << 'R'; i++;}
i=0;j=0;
while(j<(ty-sy))
{ cout << 'D'; j++;}
while(i<(tx-sx))
{cout << 'L'; i++;}
i=0;j=0;
cout << 'L';
while(j<(ty-sy)+1)
{ cout << 'U'; j++;}
while(i<(tx-sx)+1)
{cout << 'R'; i++;}
cout << 'D';
cout << 'R';
i=0;j=0;
while(j<(ty-sy)+1)
{ cout << 'D'; j++;}
while(i<(tx-sx)+1)
{cout << 'L';i++;}
cout << 'U';
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll sx,sy,tx,ty; cin >> sx >> sy >> tx >> ty;
ll dx = tx - sx; ll dy = ty - sy;
cout << string(dx,'R') << string(dy,'U') << string(dx,'L') <<
string(dy,'D') << 'D' << string(dx+1,'R') <<
string(dy+1,'U') << 'L' << 'U' << string(dx+1,'L') <<
string(dy+1,'D') << 'R' << endl;
}
| 1 |
// Etavioxy
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define il inline
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[u];i;i=bow[i].nxt)
#define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define pt(x) putchar(x)
using namespace std;
il int ci(){
register char ch; int f=1;
while(!isdigit(ch=getchar())) f=ch=='-'?-1:1;
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(x*10)+(ch^'0');
return f*x;
}
const int mod = 1e9+7;
enum{N=2023};
il ll qpow(ll a,ll b){
ll ans= 1;
for(; b; b>>=1,a=a*a%mod) if( b&1 ){
ans= ans*a%mod;
} return ans;
}
il ll inv(ll x){ return qpow(x,mod-2); }
ll fac[N*N],Invf[N*N];
il void init_fac(int n){
fac[0] = 1;
rep(i,1,n) fac[i]=fac[i-1]*i%mod;
Invf[n] = inv(fac[n]);
rev_rep(i,n,1) Invf[i-1]=Invf[i]*i%mod;
}
il ll comp(ll n,ll m){
if( n<m ) return 0;
return fac[n]*Invf[m]%mod*Invf[n-m]%mod;
}
ll f[N][N];
int main(){
int n = ci(), k = ci();
if( k==1 ){
puts("1");
return 0;
}
init_fac(n*k);
f[0][0] = 1;
rep(i,1,n){
f[i][0] = f[i-1][0];
rep(j,1,i){
f[i][j] = (f[i-1][j]+f[i][j-1]*(n-j+1)%mod*comp((n-i)+(n-j+1)*(k-1)-1,k-2))%mod;
}
}
printf("%lld\n",(f[n][n]+mod)%mod);
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
//0繰り上がりなし, 1繰り上がりあり
//long long dp[1000][2];
long long dp[1000100][2];
const long long INF = 1LL << 61;
int main(){
string money = "0";
string s;
cin >> s;
money += s;
long long n = money.size();
long long ans = 0;
//init
for(int i=0; i< 1000100; ++i){
for(int j=0; j<2; ++j){
dp[i][j] = INF;
}
}
//後ろから数える
int first = money[n-1] - '0';
dp[n-1][0] = first;
dp[n-1][1] = 10 - first;
for(long long i=n-2; i >= 0; --i){
int num = money[i] - '0';
//繰り上がりなし
dp[i][0] = min(dp[i][0], dp[i+1][0] + num);
dp[i][0] = min(dp[i][0], dp[i+1][1] + (num+1) );
//繰り上がりあり
dp[i][1] = min(dp[i][1], dp[i+1][0] + (10 - num) );
dp[i][1] = min( dp[i][1], dp[i+1][1] + (10 - (num+1) ) );
}
cout << min(dp[0][0], dp[0][1]) << endl;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.