code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <climits>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main()
{
long double N, M, D;
cin >> N >> M >> D;
cout.precision(18);
cout << ((D) ? 2 : 1) * (M - 1) * (N - D) / (N * N) << endl;
} | //#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
using ll=long long;
using intpair=pair<int,int>;
using intpv=vector<intpair>;
using llpair=pair<ll,ll>;
using llpv=vector<llpair>;
using intvec=vector<int>;
using llvec=vector<ll>;
using intq=queue<int>;
using llq=queue<ll>;
using intmat=vector<intvec>;
using llmat=vector<llvec>;
using pairmat=vector<llpv>;
template<typename T>
using matrix=vector<vector<T>>;
template<typename T>
using pque=priority_queue<T>;
template<typename T>
using lpque=priority_queue<T,vector<T>,greater<T>>;
#define PI 3.141592653589793
#define INTINF 1<<30
#define LLINF 1LL<<60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define pushb push_back
#define fi first
#define se second
#define setpr fixed<<setprecision(15)
#define all(name) name.begin(),name.end()
#define rall(name) name.rbegin(),name.rend()
#define gsort(vbeg,vend) sort(vbeg,vend,greater<>())
#define init(v,size) v.resize(size); for(auto &a__: v) cin>>a__
#define matin(mat,H,W) for(int i__=0; i__<H; i__++)for(int j__=0; j__<W; j__++) cin>>mat[i__][j__]
#define out(n) cout<<n<<endl
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T> inline void outmat(T& a, int y, int x) {
for(int i=0; i<y; i++) {
for(int j=0; j<x; j++) cout<<a[i][j]<<" ";
cout<<endl;
}
}
ll GCD(ll a, ll b) { //最大公約数
if(a==0||b==0) return 0;
if(a<b) swap(a,b);
ll tmp = a%b;
while(tmp!=0) {
a = b;
b = tmp;
tmp = a%b;
}
return b;
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result=1;
while(ex>0) {
if(ex&1) result=result*a%p;
ex>>=1;
a=a*a%p;
}
return result;
}
ll Fact(ll x, ll p) { //階乗
ll f=1;
for(ll i=2; i<=x; i++) {
f*=i;
f%=p;
}
return f;
}
ll nPr(ll n, ll r) {
if(n<r) return 0;
ll result=1LL;
for(ll i=0; i<r; i++) result*=n-i;
return result;
}
ll nPrP(ll n, ll r, ll p) { // mod pにおけるnPr
if(n<r) return 0;
ll result=1LL;
for(int i=0; i<r; i++) {
result*=n-i;
result%=p;
}
return result;
}
ll nCr(ll n, ll r) {
if (n == r) { return 1; }
if (r > n) { return 0; }
if (r > n / 2) { r = n - r; }
if (n == 0) { return 0; }
if (r == 0) { return 1; }
if (r == 1) { return n; }
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (ll)result;
}
int DigitNum(ll n) { //桁数
int digit=0;
ll div=1LL;
while(n/div) {
digit++;
div*=10;
}
return digit;
}
bool Palind(string s) { //回文判定
return s == string(s.rbegin(), s.rend());
}
double n,m,d;
void input() {
cin>>n>>m>>d;
}
void solve() {
double D;
if(d) D=2.*(n-d)/n/n;
else D=1/n;
cout<<setpr<<(m-1)*D<<endl;
}
int main() {
while(1) {
input();
solve();
break;
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define forg(i,x) for(int i=first[x];i;i=nxt[i])
#define uu unsigned
#define fi first
#define se second
#define lam(z,k) [&](const z &a,const z &b){ return k; }
#define od(x) ((x)&1)
#define ev(x) (od(x)^1)
#define mi2(x) (1<<(x))
#define scanf a1234=scanf
int a1234;
char buf[1<<18],*bufs=buf,*buft=buf;
inline int gc(){
return bufs==buft&&(buft=(bufs=buf)+fread(buf,1,1<<18,stdin)),bufs==buft?-1:*bufs++;
}
inline void xxx(){for(;;);}
const int mxn=2003,mod=1e9+7;
int n,k;
int dp[mxn][mxn],fac[mxn*mxn],inv[mxn*mxn];
inline int por(long long a,int b){
long long res=1;
for(;b;b>>=1){
if(b&1)res=res*a%mod;
a=a*a%mod;
}
return res;
}
inline long long C(int a,int b){return 1ll*fac[a]*inv[a-b]%mod*inv[b]%mod;}
inline long long P(int a,int b){return 1ll*fac[a]*inv[a-b]%mod;}
inline long long cha(int a,int b){return C(a+b,a);}
template<class T>inline void tsum(T &a,int b){a+=b;if(a>=mod)a-=mod;}
int main(){
scanf("%d%d",&n,&k);if(k==1)return puts("1"),0;
fac[0]=inv[0]=1;for(int i=1;i<=n*k;++i)fac[i]=1ll*fac[i-1]*i%mod;
inv[n*k]=por(fac[n*k],mod-2);for(int i=n*k-1;i;--i)inv[i]=1ll*inv[i+1]*(i+1)%mod;
dp[1][1]=1;
for(int i=1;i<=n;++i)for(int j=i;j;--j){
//printf("%d %d %d\n",i,j,dp[i][j]);
tsum(dp[i][j-1],dp[i][j]);
if(!dp[i][j])continue;
dp[i][j]=dp[i][j]*cha((i-1)*k-j+1,k-2)%mod;
tsum(dp[i+1][j+1],dp[i][j]);
// for(int jj=1;jj<=j+1;++jj)tsum(dp[i+1][jj],dp[i][j]*cha(i*k-jj+1,k-2)%mod);//,printf("%d %d %d\n",i+1,jj,dp[i+1][jj]);
}
long long ans=0;
for(int i=1;i<=n;++i)tsum(ans,dp[n][i]);
printf("%lld\n",ans*fac[n]%mod);
return 0;
}
| #include <cstdio>
#include <algorithm>
#include <cctype>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 2e3+5, M = 4e6+5, P = 1e9+7;
int n, m, f[N][N], fac[M], ifac[M], inv[M], ans;
int C(int n, int m) { return 1ll*fac[n]*ifac[n-m]%P*ifac[m]%P; }
int main()
{
n = read(), m = read();
inv[1] = ifac[0] = fac[0] = 1;
for(int i = 2; i <= n*m; ++i) inv[i] = 1ll*(P-P/i)*inv[P%i]%P;
for(int i = 1; i <= n*m; ++i) fac[i] = 1ll*i*fac[i-1]%P, ifac[i] = 1ll*inv[i]*ifac[i-1]%P;
f[0][0] = 1;
for(int i = 1; i <= n; ++i)
for(int j = 0; j <= i; ++j)
{
f[i][j] = f[i-1][j];
if(j) f[i][j] = (f[i][j]+1ll*f[i][j-1]*(n-j+1)%P*C(n*m-i-(j-1)*(m-1)-1, m-2)%P)%P;
}
printf("%d\n", m == 1?1:f[n][n]);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// long long p = 1e9+7;
typedef long long ll;
typedef pair<ll,ll> pl;
typedef vector<int> VI;
typedef vector<pair<ll,ll>> VP;
typedef vector<ll> VL;
typedef vector<bool> VB;
// typedef pair<ll, ll> PL;
typedef unordered_map<ll, ll> UMP;
#define FOR(i,b) for(i=0;i<b;i++)
#define pb push_back
#define mp make_pair
// typedef unordered_set<ll>;
void printa(VI &x,ll n){
ll i;
FOR(i, n){
cout<<x[i]<<" ";
}
cout<<endl;
}
/////GLOABLS VARS
ll MOD = 1e9+7;
ll gmx = 1e6+7;
VL fact(gmx, 1);
//////FUNCTIONS
ll powp(ll val, ll deg)
{
// debug(val, deg);
if (!deg)
return 1;
if (deg & 1)
return (powp(val, deg - 1) * val) % MOD;
ll res = powp(val, deg >> 1);
// debug(res);
return (res * res) % MOD;
}
//It is not easy but it can be fun, if you think!!!
//
// ll mx = 2*1e5+7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
// #endif
ll n,i,j;
cin>>n;
// priority_queue<ll> l;
VL l(n+1);
FOR(i,n){
ll u;
cin>>u;
l[i+1] = u;
}
VL arr(n+1);
ll m = sqrt(n)+1;
VL ans;
for(i=n;i>=1;i--){
// debug(arr,l);
if(l[i]!=arr[i]){
// debug(i);
ans.pb(i);
unordered_set<ll> seen;
for(j = 1;j<m;j++){
if(i%j==0){
ll p =i/j;
// debug(p,j);
if(p==j){
if(seen.find(p)==seen.end()){
arr[p] =1-arr[p];
seen.insert(p);
}
// ans.pb(p);
}
else{
if(seen.find(p)==seen.end()){
arr[p] =1-arr[p];seen.insert(p);
}
if(seen.find(j)==seen.end()){
arr[j] =1-arr[j];seen.insert(j);
}
// ans.pb(p);
// ans.pb(j);
}
}
}
}
}
cout<<ans.size()<<'\n';
for(auto k:ans){
cout<<k<<'\n';
}
// }
} | #include <bits/stdc++.h>
int N;
using namespace std;
int main() {
cin >> N;
vector<queue<int>> q(N);
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N-1; ++j) {
int value;
cin >> value;
q.at(i).push(value-1);
}
}
// 優先度が高い順にpushしてある
// 1から順に試合をしていく。全部満たさないといけないので誰から試合を初めてもかまわない
chrono::system_clock::time_point start, end;
start = chrono::system_clock::now();
int num = 0;
int days = 0;
int finish = N * (N-1) / 2;
while(finish > num) {
end = chrono::system_clock::now();
double time = static_cast<double>(chrono::duration_cast<chrono::microseconds>(end-start).count() / 1000.0);
// cout << setprecision(14) << time << endl;
if(time > 1800.0) {
cout << finish << endl;
return 0;
}
days++;
vector<int> match(N, 0);
for(int i = 0; i < N; ++i) {
if(q.at(i).empty()) {
continue;
}else {
if(match.at(i) == 1) {
q.at(i).pop();
}else {
int rival = q.at(i).front();
if(match.at(rival) == 0) {
if(q.at(rival).front() == i) {
match.at(i) = match.at(rival) = 1;
q.at(i).pop();
num++;
}
}
}
}
}
int flag = 0;
for(int i = 0; i < N; ++i) {
if(match.at(i) == 1) {
flag = 1;
break;
}
}
int kazu = 0;
for(int i = 0; i < N; ++i) {
if(!q.at(i).empty()) kazu++;
}
if(kazu == 1) break;
if(flag == 0) {
break;
}
}
if(finish == num) {
cout << days << endl;
}else {
cout << "-1" << endl;
}
} | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<Int> v(n);
v[0] = 0;
for (Int i = 1; i < n; ++i) {
if (s[i - 1] == 'A' && s[i] == 'C') {
v[i] = v[i - 1] + 1;
} else {
v[i] = v[i - 1];
}
}
for (Int i = 0; i < q; ++i) {
Int l, r;
cin >> l >> r;
cout << v[r - 1] - v[l - 1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> P;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(),a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
#define ADD(a,b) a=(a+b)%mod
const ll MOD=998244353;
const ll mod=1000000007;
const ll INF=1e15;
vec dx={1,0,-1,0};
vec dy={0,1,0,-1};
ll N,M;
ll d[301][301];
bool used[301];
ll Start[301];
ll Solve(ll x){
if(!used[d[x][Start[x]]]) return d[x][Start[x]];
Start[x]++;
return Solve(x);
}
ll SOLVE(){
vec kari(M+1,0);
rep(i,N) kari[Solve(i)]++;
ll MAX=-INF, basho=-1;
rep(i,M) if(kari[i]>MAX){
MAX=kari[i];
basho=i;
}
//rep(i,M) cout<<kari[i]<<' ';
//cout<<endl;
//cout<<MAX<<' '<<basho+1<<endl;
used[basho]=true;
return MAX;
}
ll MAIN(){
if(M==1) return N;
ll ret=INF;
rep(i,M-1) {
//cout<<i<<':';
ll K=SOLVE();
ret=min(ret,K);
}
return ret;
}
int main(){
cin>>N>>M;
rep(i,N) rep(j,M) {cin>>d[i][j]; d[i][j]--;}
cout<<MAIN()<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int M = int(1e9 + 7);
signed main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
vector<int> pre(N + 1); {
for (int i = 0; i < N; ++i) {
pre[i + 1] = pre[i] ^ A[i];
}
if (pre[N]) {
static int dp[1 << 19][2][2][2];
dp[1][0][1][1] = 1;
for (int i = 1; i <= N; ++i) {
for (int c = 0; c < 2; ++c) {
if (pre[i] == 0) {
(dp[i + 1][c][1][1] += dp[i][c][0][0]) %= M;
(dp[i + 1][c][1][1] += dp[i][c][0][1]) %= M;
} else if (pre[i] == pre[N]) {
(dp[i + 1][c ^ 1][0][1] += dp[i][c][1][0]) %= M;
(dp[i + 1][c ^ 1][0][1] += dp[i][c][1][1]) %= M;
}
(dp[i + 1][c][0][0] += dp[i][c][0][0]) %= M;
(dp[i + 1][c][1][0] += dp[i][c][1][0]) %= M;
(dp[i + 1][c][0][0] += dp[i][c][0][1]) %= M;
(dp[i + 1][c][1][0] += dp[i][c][1][1]) %= M;
}
}
int ans = (dp[N + 1][0][0][1] + dp[N + 1][1][0][1]) % M;
cout << ans << endl;
return 0;
}
}
vector<int> pz(pre.size() + 1); {
for (int i = 0; i < pre.size(); ++i) {
pz[i + 1] = pz[i] + (pre[i] == 0);
}
}
map<int, vector<int>> dp; {
map<int, int> cnt;
map<int, int> last;
for (int i = 0; i < pre.size(); ++i) {
if (pre[i]) {
if (last.count(pre[i])) {
int l = last.count(pre[i]) ? last[pre[i]] : 0;
int cz = pz[i] - pz[l];
if (cz) dp[pre[i]].push_back(cz);
}
++cnt[pre[i]];
last[pre[i]] = i;
} else {
for (auto it = cnt.begin(); it != cnt.end(); ++it) {
dp[it->first].push_back(it->second);
}
cnt.clear();
}
}
}
int ans = 1; {
for (int i = 1; i + 1 < pre.size(); ++i) {
if (pre[i] == 0) ans = 2LL * ans % M;
}
for (auto it = dp.begin(); it != dp.end(); ++it) {
auto s = it->second;
vector<int> dpdp(2);
dpdp[0] = 1;
for (int i = 0; i < s.size(); ++i) {
(dpdp[~i & 1] += 1LL * s[i] * dpdp[i & 1] % M) %= M;
}
(ans += dpdp[1]) %= M;
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+5;
const int M=(1<<20)+5;
const int p=1e9+7;
int read()
{
int s=0;
char c=getchar(),lc='+';
while (c<'0'||'9'<c) lc=c,c=getchar();
while ('0'<=c&&c<='9') s=s*10+c-'0',c=getchar();
return lc=='-'?-s:s;
}
void write(int x)
{
if (x<0)
{
putchar('-');
x=-x;
}
if (x<10) putchar(x+'0');
else
{
write(x/10);
putchar(x%10+'0');
}
}
void print(int x,char c='\n')
{
write(x);
putchar(c);
}
void add(int &x,int y)
{
x+=y;
if (x>=p) x-=p;
}
int sum1[M],sum2[M],dp[N],s[N],x[N];
signed main()
{
x[0]=s[0]=0;
memset(sum1,0,sizeof(sum1));
memset(sum2,0,sizeof(sum2));
int n=read();
dp[0]=1;
sum1[0]=1;
for (int i=1;i<=n;i++)
{
x[i]=x[i-1]^read();
s[i]=s[i-1]+(x[i]==0);
dp[i]=((s[i-1]*sum1[x[i]]-sum2[x[i]]+1)%p+p)%p;
add(sum1[x[i]],dp[i]);
add(sum2[x[i]],dp[i]*s[i]%p);
}
if (x[n]) print(dp[n]);
else
{
int ans=dp[n];
for (int i=1;i<=n;i++) if (x[i]) add(ans,dp[i]);
print(ans);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long sum1 = 0;
long long numbers[200000];
int N;
cin >> N;
for(int i = 0; i < N; ++i){
cin >> numbers[i];
}
for(int i = 0; i < N-1; ++i){
if(numbers[i+1] < numbers[i]){
sum1+=numbers[i] - numbers[i+1];
numbers[i+1] = numbers[i+1] + (numbers[i] - numbers[i+1]);
}
}
cout << sum1;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#include <time.h>
#include <chrono>
#include <random>
//#include <math.h>
#include <cmath>
#include <fstream>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <stdlib.h>
#include <iomanip>
#include <cstdio>
#include <cassert>
#include <bitset>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
#define flu fflush(stdout)
#define gg return 0
#define mp make_pair
typedef long double ptype;
long long mod = /*27449*//*998244353*/ 1e9 + 7 /*1e9 + 9*/;
int inf = 1e9;
double eps = 1e-8;
long double pi = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ifstream in("input.txt");
ofstream out("output.txt");
void solve()
{
long long ans = 0;
int n;
cin >> n;
int mx = 0;
for (int i = 0; i < n; i++)
{
int t;
cin >> t;
if (t < mx)
{
ans += mx - t;
}
else
{
mx = t;
}
}
cout << ans;
}
int main()
{
cout << setprecision(20) << fixed;
cin.tie();
cout.tie();
clock_t t1 = clock();
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int t;
//cin >> t;
t = 1;
while (t--) {
solve();
//test();
}
//cout << (clock() - t1) * 1.0 / CLOCKS_PER_SEC;
gg;
} | 1 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
int main(){
cin.tie(0), ios::sync_with_stdio(false);
int k,t; cin >> k >> t;
int mx = 0;
vi a(t);
rep(i,t){
cin >> a[i];
chmax(mx,a[i]);
}
if((k+1)/2 < mx){
cout << (mx-(k+1)/2)*2-1;
}else{
cout << 0;
}
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k, t;
cin >> k >> t;
int a[t];
for (int i = 0; i < t; ++i) {
cin >> a[i];
}
sort(a, a + t);
cout << max(0, a[t - 1] - k + a[t - 1] - 1) << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
//Opy;
/*-------------------------------------------------
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
-------------------------------------------------*/
ll a, h = 0;
cin>> a;
h += (a - (a % 500)) * 2;
a %= 500;
h += a - (a % 5);
cout<< h<< endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REV(i,a,n) for(int i=a;i>=n;i--)
#define all(a) a.begin(),a.end()
const int NUM = 2e5 + 5;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int num_tests=1;
//cin >> num_tests;
while(num_tests-->0){
int n; cin >> n;
int ans = 0;
while(n >= 500)
{
int x = n/500;
ans += x*1000;
n -= (x)*500;
}
while(n >= 5)
{
int y = n/5;
ans += y*5;
n -= y*5;
}
cout << ans;
}
} | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
//AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC
int main(){
int a,b,c;cin>>a>>b>>c;
if(a>b)swap(a,b);
if(a<=c&&c<=b)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
| #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << ((a-c)*(b-c)<0?"Yes":"No") << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
double solve(vector<vector<vector<double>>>& dp, int a, int b, int c, double N){
if(dp[a][b][c] != 0){
return dp[a][b][c];
}
if(a==0 && b==0 && c==0) return 0;
double f = 0;
f += 1 / (1 - (N-a-b-c)/N );
if(a>0) f += solve(dp,a-1,b,c, N) * (a/N) /(1 - (N-a-b-c)/N );
if(b>0) f += solve(dp,a+1,b-1,c, N) * (b/N) /(1 - (N-a-b-c)/N );
if(c>0) f += solve(dp,a,b+1,c-1, N) * (c/N) /(1 - (N-a-b-c)/N );
return dp[a][b][c] = f;
}
int main(){
int N;
cin >> N;
vector<vector<vector<double>>> dp(N+1,vector<vector<double>>(N+1,vector<double>(N+1,0)));
int a=0, b=0, c=0;
for(int i=0; i<N; i++){
int t; cin >> t;
if(t==1) a++;
else if(t==2) b++;
else c++;
}
printf("%.9lf\n",solve(dp,a,b,c,(double)N));
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define uu unsigned
#define io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MOD 1000000007
#define pl pair<ll,ll>
#define mkp make_pair
#define ss second
#define ff first
#define mit(a,b) map<a,b>::iterator
#define sit(a) set<a>::iterator
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define printcas cout<<"Case "<<cas<<": "
#define _ continue;
#define endl '\n'
#define __ cout<<endl;continue;
#define dd (double)
const ll oo=(1ll<<60);
int gi(){
int x=0,w=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')w=0,ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return w?x:-x;
}
double dp[305][305][305]={0};
int main()
{
//io;
//string hudai(1000000,'a');
int T=1;
//T=gi();
for(int cas=1;cas<=T;cas++)
{
int n,x,cnt[4]={0},i,j,k;
n=gi();
for(i=0;i<n;i++)
{
x=gi();
cnt[x]++;
}
dp[0][0][0]=0.0;
for(i=0;i<=cnt[3];i++)
{
for(j=0;j<=cnt[2]+cnt[3];j++)
{
for(k=0;k<=cnt[1]+cnt[2]+cnt[3];k++)
{
if(i+j+k==0) _
dp[i][j][k]=(1.0/(i+j+k+0.0))*(n+0.0+((!i)?0.0:i*1.0*dp[i-1][j+1][k])+((!j)?0.0:j*1.0*dp[i][j-1][k+1])+((!k)?0.0:k*1.0*dp[i][j][k-1]));
//if(dp[i][j][k]-n==0.0) cout<<i<<' '<<j<<' '<<k<<endl;
}
}
}
printf("%.15lf",dp[cnt[3]][cnt[2]][cnt[1]]);
}
return 0;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define INF 10000001
int main()
{
int a, n;
int maxi, mini;
int i;
long long sum = 0ll;
mini = INF;
maxi = -10000001;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
maxi = max(a, maxi);
mini = min(a, mini);
sum += a;
}
printf("%d %d ", mini, maxi);
cout << sum << endl;
return (0);
} | #include <iostream>
using namespace std;
int main(){
int min,max,n,i;
int *data;
long sum;
cin>>n;
data= new int[n];
for (i=0;i<n;i++)cin>>data[i];
min=data[0];max=data[0];sum=data[0];
for (i=1;i<n;i++){
sum+=data[i];
if (min>data[i])min=data[i];
else if (max<data[i])max=data[i];
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
}
| 1 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <stack>
#include <ctype.h>
#include <numeric>
#include <sstream>
#include <unistd.h>
#include <unordered_map>
#include <unordered_set>
#include <limits>
#include <random>
#include <chrono>
#include <iomanip>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
#define endl '\n'
#define debug(name) DEBUG(#name, (name))
template<typename T>
void DEBUG(string label, T value) {
cerr << "[" << label << " = " << value << "]\n";
}
void solve(){
int n;
cin >> n;
vector<int> arr(n);
for(int i = 0; i < n; ++i){
cin >> arr[i];
}
sort(arr.begin(),arr.end());
arr.resize(unique(arr.begin(), arr.end()) - arr.begin());
cout << ((int)arr.size() == n ? "YES" : "NO") << endl;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1;
while(t--){
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
map<ll,ll>ch;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
ch[x]++;
if(ch[x]==2){
cout << "NO";
return 0;
}
}
cout << "YES";
// your code goes here
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for(lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
using vll = vector<lli>;
lli mod197 = 1000000007LL;
lli INF = 10000000000000;
// ax + by = gcd(a,b) 最大公約数
template< typename T >
T extgcd(T a, T b, T& x, T& y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}
else {
x = 1;
y = 0;
}
return d;
}
int main(void) {
int n, h, w;
cin >> n >> h >> w;
COUT((n - h + 1) * (n - w + 1));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n,h,w;
cin >> n >> h >> w;
int a = 0;
int b = 0;
for(int i = 1; i <= n; i++){
if(i+w-1 <= n) a++;
if(i+h-1 <= n) b++;
}
cout << a*b << endl;
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int w[10], k[10];
for(int i=0; i<2; i++){
for(int j=0; j<10; j++){
if(i == 0) cin >> w[j];
else cin >> k[j];
}
}
sort(w, w+10, greater<int>());
sort(k, k+10, greater<int>());
cout << w[0] + w[1] + w[2] << " " << k[0] + k[1] + k[2] << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
typedef long long ll;
using gra = vector<vector<ll>>;
using gram = vector<unordered_map<ll,ll>>;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> T dup(T a, T b) { return (a + b - 1) / b; }
template <class T> T modpow(T x, T p, T m) { T a=1; while(p){ if(p%2)a =a*x%m; x = x+x%m; p/=2; } return a; }
// template <class T> void prim(T a) { for(ll i=0;i<a.size();++i) { cout << a[i]; } cout << "\n"; }
//template< typename T >
//T mod_pow(T x, T n, const T &p) {
// T ret = 1;
// while(n > 0) {
// if(n & 1) (ret *= x) %= p;
// (x *= x) %= p;
// n >>= 1;
// }
// return ret;
//}
///////////////////
//
#define mod 1000000007LL
#define INF 10000000000000000LL
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define rrep1(i, n) for (int i = n; i > 0; --i)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
//#define modpow(x, p, m) { ll a=1; while(p){ if(p%2)a =a*x%m; x = x+x%m; p/=2; } return a; }
#define m0(h) memset(h, 0, sizeof(h))
#define m1(h) memset(h, 1, sizeof(h))
#define m(h, n) memset(h, (n), sizeof(h))
#define all(n) (n).begin(),(n).end()
#define bit(n) (1LL << (n))
#define pb push_back
#define mp make_pair
//#ifdef LOCAL
//
//#define dpri(...) fprintf(stderr, __VA_ARGS__)
//#define pria(g) rep(i,g.size()){ cout << i << "{"; rep(j,g[i].size()) cout << g[i][j] << " "; cout << "}" << "\n"; }
//#else
//#define dpri(...) 42
//#define pria(g) 42
//#endif
//
//
//
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// ---------------------
// コーディング開始
// ---------------------
string a;
cin >> a;
if(a.length()==2) cout << a << endl;
else cout << a[2] << a[1] << a[0] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll H, W;
cin >> H >> W;
mat A(H, vec(W, 0));
REP(i,0,H) {
REP(j,0,W) {
cin >> A[i][j];
A[i][j] %= 2;
}
}
mat Z;
REP(i,0,H) {
bool f = false;
REP(j,0,W-1) {
vec z = {i+1, j+1, i+1, j+2};
if(A[i][j] == 1) {
if(!f) {
A[i][j] = 0;
f = true;
}
else {
A[i][j] = 0;
f = false;
}
}
if(f) Z.pb(z);
}
if(f) A[i][W-1] = 1 - A[i][W-1];
}
bool f = false;
REP(i,0,H-1) {
vec z = {i+1, W, i+2, W};
if(A[i][W-1] == 1) {
if(!f) {
A[i][W-1] = 0;
f = true;
}
else {
A[i][W-1] = 0;
f = false;
}
}
if(f) Z.pb(z);
}
if(f) A[H-1][W-1] = 1 - A[H-1][W-1];
PR(SZ(Z));
REP(i,0,SZ(Z)) {
PS(Z[i][0]); PS(Z[i][1]); PS(Z[i][2]); PR(Z[i][3]);
}
return 0;
}
/*
*/ | #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<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w)), ans;
rep(i, h) rep(j, w) cin >> a[i][j];
rep(i, h - 1) rep(j, w) {
if (a[i][j] % 2 == 1) {
ans.push_back({i + 1, j + 1, i + 2, j + 1});
// cout << i + 1 << " " << j + 1 << " " << i + 2 << " " << j + 1 << endl;
a[i][j]--;
a[i + 1][j]++;
}
}
rep(i, w - 1) {
if (a[h - 1][i] % 2 == 1) {
ans.push_back({h, i + 1, h, i + 2});
// cout << h - 1 << " " << i + 1 << " " << h - 1 << " " << i + 2 << endl;
a[h - 1][i]--;
a[h - 1][i + 1]++;
}
}
cout << ans.size() << endl;
rep(i, ans.size()) rep(j, 4) printf("%d%c", ans[i][j], (j == 3 ? '\n' : ' '));
// rep(i, h) rep(j, w)
// fprintf(stderr, "%d%c", a[i][j], (j == w - 1 ? '\n' : ' '));
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
ll pl(ll a, ll b) {
a %= mod, b %= mod;
return (a+b) % mod;
}
ll mu(ll a, ll b) {
a %= mod, b %= mod;
return (a*b) % mod;
}
ll pow_mod(ll a, ll b) {
if (b == 0) return 1;
a %= mod;
ll k = pow_mod(a, b/2);
k = mu(k, k);
if (b & 1) k = mu(k, a);
return k;
}
ll di(ll a, ll b) {
a %= mod;
return mu(a, pow_mod(b, mod-2));
}
ll nCk(ll n, ll k) {
ll res = 1;
for (int a = n, b = k; b > 0; a--, b--) {
res = mu(res, a);
res = di(res, b);
}
return res;
}
int main () {
ll A[2], K;
cin >> A[0] >> A[1] >> K;
ll ans = 0;
for (int k = 0; k < 2; k++) {
ll p = A[0], q = A[1];
for (int i = 1; i <= q-1; i++) {
ans += mu(mu(mu(p, p), q-i), i);
}
swap(A[0], A[1]);
}
ans = di(ans, nCk(A[0]*A[1], 2));
ans = mu(ans, nCk(A[0]*A[1], K));
ans = mu(ans, nCk(K, 2));
cout << ans << endl;
} | #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");}
ll Pow(ll A, ll N){
if (N ==0) return 1;
else if (N % 2 == 0) return Pow(A*A%MOD, N/2);
else return Pow(A*A%MOD, N/2) * A % MOD;
}
int main(){
ll N, M, K; cin >> N >> M >> K;
ll cnt1 = 0, cnt2 = 0;
for (ll i = 0; i <= N - 1; i++){
cnt1 += i * (N - i); cnt1 %= MOD;
}
cnt1 *= M * M % MOD; cnt1 %= MOD;
for (ll i = 0; i <= M - 1; i++){
cnt2 += i * (M - i); cnt2 %= MOD;
}
cnt2 *= N * N % MOD; cnt2 %= MOD;
ll ans = (cnt1 + cnt2) % MOD;
ll nCr = 1;
for (ll i = 1; i <= K - 2; i++){
nCr *= N * M - 1 - i; nCr %= MOD;
nCr *= Pow(i, MOD-2); nCr %= MOD;
}
ans *= nCr; ans %= MOD;
cout << ans << endl;
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
//cout << "DEBUG:" << buf << endl;
if (buf.find("replace ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
char a3[1001] = {0};
sscanf(buf.c_str(), "%s %d %d %s", cmd, &a1, &a2, a3);
s.replace(a1, (a2+1)-a1, string(a3));
//cout << "DEBUG:replaced:" << s << endl;
}
else if (buf.find("reverse ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
sscanf(buf.c_str(), "%s %d %d", cmd, &a1, &a2);
string sub = s.substr(a1, (a2+1)-a1);
//cout << "DEBUG:sub( ):" << sub << endl;
reverse(sub.begin(), sub.end());
//cout << "DEBUG:sub(r):" << sub << endl;
size_t subsize = sub.size();
for (int i = a1, j = 0; i < a1 + subsize; i++, j++) {
s[i] = sub[j];
}
//cout << "DEBUG:reversed:" << s << endl;
}
else if (buf.find("print ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
sscanf(buf.c_str(), "%s %d %d", cmd, &a1, &a2);
cout << s.substr(a1, (a2+1)-a1) << endl;
}
q--;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;
int main(void) {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
REP(i, n) cin >> a[i], a[i]--;
ll ret = a[0]!=0;
vector<vector<ll>> g(n);
FOR(i, 1, n) {
g[i].push_back(a[i]);
g[a[i]].push_back(i);
}
function<ll(ll,ll,ll)> dfs = [&](ll v, ll p, ll d) {
ll ma = 1;
for(auto to: g[v]) if(p != to) {
ll val = dfs(to, v, d+1);
dump(v, to, val);
chmax(ma, val+1);
}
bool flag = false;
if(ma == k && d+ma-1 > k) {
ma = 0;
ret++;
flag = true;
}
dump(v, d, ma, flag);
return ma;
};
dfs(0, -1, 0);
cout << ret << endl;
return 0;
} | 0 |
#include <cstdio>
#include <iostream>
#include <string>
#define INF (1<<21)
using namespace std;
int main(){
int i,j,n,k,c,a,b,G[101][101],d[101],f[101],yen,p,min,s,g;
while(1){
cin >> n >> k;
if(n == 0 && k == 0) break;
for(i=0;i<=n;i++){
for(j=0;j<=n;j++){
G[i][j] = INF;
}
}
for(i=0;i<k;i++){
cin >> c;
if(c == 1){
cin >> a >> b >> yen;
if(G[a][b] > yen) G[a][b] = G[b][a] = yen;
}
else if(c == 0){
for(j=0;j<=n;j++){
d[j] = INF;
f[j] = 0;
}
cin >> s >> g;
d[s] = 0;
while(1){
min = INF;
for(j=0;j<=n;j++){
if(d[j]<min && f[j] == 0){
min = d[j];
p = j;
}
}
if(min == INF) break;
f[p] = 1;
for(j=0;j<=n;j++){
if(f[j] == 1) continue;
if(G[p][j] + d[p] < d[j]) d[j] = G[p][j] + d[p];
}
}
if(d[g] == INF) cout << "-1" << endl;
else cout << d[g] << endl;
}
}
}
return 0;
} | #include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int n,m,a[10000],b[10000],flg[10001],i,h;
while(1){
scanf("%d %d",&n,&m);
if(n==0&&m==0) break;
for(i=2;i<=n;i++) flg[i]=0;
for(i=0;i<m;i++){
scanf("%d %d",&a[i],&b[i]);
}
for(i=0;i<m;i++){
if(a[i]==1){
flg[b[i]]=1;
}
}
h=0;
for(i=0;i<m;i++){
if(flg[a[i]]==1){
if(flg[b[i]]==0){
flg[b[i]]=2;
}
}
if(flg[b[i]]==1){
if(flg[a[i]]==0){
flg[a[i]]=2;
}
}
}
for(i=2;i<=n;i++){
if(flg[i]>0){
h++;
}
}
printf("%d\n",h);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
for(int n; cin >> n && n; ){
int ans = INF;
for(int z = 0; z * z * z <= n; z++)
for(int y = 0; y * y + z * z * z <= n; y++){
int x = n - (y * y + z * z * z);
ans = min(ans, x + y + z);
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
int pleasure = 0;
int f = x / 500;
x -= f * 500;
pleasure += 1000 * f;
f = x / 5;
x -= f * 5;
pleasure += 5 * f;
cout << pleasure << endl;
} | 0 |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n;
cin >> n;
v_int a(n+1), b(n+1);
irep2(i,1,n) {
cin >> a[i];
}
for(int i = n; i >= 1; i--) {
int cnt = 0;
for(int j = i; j <= n; j += i) {
if(b[j]) { cnt++; }
}
if(cnt % 2 != a[i]) {
b[i] = 1;
}
}
int m = 0;
irep2(i,1,n) {
if(b[i]) { m++; }
}
cout << m << endl;
irep2(i,1,n) {
if(b[i]) { cout << i << " "; }
}
return 0;
} /*atcoder*/
| #include<cstdio>
const int N=1e5+5;
int n,i,a[N],ans;
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
for (n=read(),i=1;i<=n;i++) a[i]=read();
if (n==1){puts("Second");return 0;}
for (;;){
int k0=0,k1=0,x;
for (i=1;i<=n;i++)
if (a[i]&1) k1++,x=i; else k0++;
if (k0&1){ans^=1;break;}
if (k1>1||a[x]==1) break;
a[x]--;int k=a[1];ans^=1;
for (i=2;i<=n&&k>2;i++) k=gcd(k,a[i]);
for (i=1;i<=n;i++) a[i]/=k;
}
puts(ans?"First":"Second");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
cout << (((N-1)/X +1) * T ) << endl;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 2e5+5;
vector<ll>ans,veca,vecb;
vector<int>adj[N];
vector<double>aka;
vector<pair<int,double>>dp[N];
vector<bool>vis;
void init(int n){
ans.clear();veca.clear();aka.clear();vis.clear();
vecb.clear(),vecb.resize(n);veca.resize(n);vis.resize(n);
for (int i = 0; i <n; i++) {
vis[i]=0;
}
for (int i = 0; i<=n; i++) {
adj[i].clear();
}
for (int i = 0; i <=n; i++) {
dp[i].clear();
}
}
int power(int a,int n){
int res=1;
for (int i = 0; i < n; i++) {
res=(1LL*res*a)%mod;
}
return res%mod;
}
int add(int a){
if(a<0) a+=mod;
return a;
}
void solve(){
int n,x,t;
cin>>n>>x>>t;
int myans=n/x;
if(n%x) myans++;
cout<<myans*t;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T=1;
//cin>>T;
while(T--){
solve();
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
int main()
{
string S;
cin >> S;
bool check = false;
for (int i = 0; i < 3; i++) {
if (S[i] == '7') {
check = true;
break;
}
}
if (check) cout << "Yes" << endl;
else cout << "No" << endl;
}
| #include <stdio.h>
int main(){
long long N, sum;
scanf("%lld", &N);
sum = N*(N+1)/2;
long long Un3 = N/3;
long long Sn3 = 3*(Un3*(Un3+1)/2);
long long Un5 = N/5;
long long Sn5 = 5*(Un5*(Un5+1)/2);
long long Un15 = N/15;
long long Sn15 = 15*(Un15*(Un15+1)/2);
printf("%lld", sum-Sn3-Sn5+Sn15);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
class Dice
{
public:
int label[6], tmp;
void in()
{
rep(i, 6) scanf("%d", &label[i]);
}
void rollS()
{
tmp = label[0];
label[0] = label[4];
label[4] = label[5];
label[5] = label[1];
label[1] = tmp;
}
void rollN()
{
tmp = label[0];
label[0] = label[1];
label[1] = label[5];
label[5] = label[4];
label[4] = tmp;
}
void rollE()
{
tmp = label[0];
label[0] = label[3];
label[3] = label[5];
label[5] = label[2];
label[2] = tmp;
}
void rollW()
{
tmp = label[0];
label[0] = label[2];
label[2] = label[5];
label[5] = label[3];
label[3] = tmp;
}
void sideturn()
{
tmp = label[1];
label[1] = label[2];
label[2] = label[4];
label[4] = label[3];
label[3] = tmp;
}
};
bool check2(Dice d1, Dice d2)
{
bool c = true;
FOR(i, 1, 5)
{
c = c && d1.label[i] == d2.label[i];
}
return c;
}
bool check1(Dice d1, Dice d2)
{
bool b = false;
if (d1.label[0] == d2.label[0] && d1.label[5] == d2.label[5])
{
rep(i, 4)
{
b = b || check2(d1, d2);
d2.sideturn();
}
}
return b;
}
bool isSame(Dice d1, Dice d2)
{
bool a = false;
a = a || check1(d1, d2);
d2.rollN();
a = a || check1(d1, d2);
d2.rollE();
a = a || check1(d1, d2);
d2.rollE();
a = a || check1(d1, d2);
d2.rollE();
a = a || check1(d1, d2);
d2.rollN();
a = a || check1(d1, d2);
return a;
}
int main()
{
int n;
bool ans = false;
scanf("%d", &n);
Dice dice[n];
rep(i, n) dice[i].in();
rep(i, n)
{
FOR(j, i + 1, n)
{
ans = ans || isSame(dice[i], dice[j]);
}
}
if (ans)
printf("No\n");
else
printf("Yes\n");
}
| #include<iostream>
using namespace std;
struct Directions
{
int E[6] = { 2, 1, 5, 0, 4, 3 };
int W[6] = { 3, 1, 0, 5, 4, 2 };
int N[6] = { 4, 0, 2, 3, 5, 1 };
int S[6] = { 1, 5, 2, 3, 0, 4 };
int Rotate[6] = { 0, 2, 4, 1, 3, 5 };
};
class Dice
{
public:
int num[6];
void swap(int*);
Directions dir_array;
Dice();
void roll(char);
void show_num(int);
};
Dice::Dice()
{
for (int i = 0; i < 6; i++)
cin >> this->num[i];
}
void Dice::roll(char c)
{
switch (c)
{
case 'E':
this->swap(dir_array.E);
break;
case 'W':
this->swap(dir_array.W);
break;
case 'N':
this->swap(dir_array.N);
break;
case 'S':
this->swap(dir_array.S);
break;
case 'R':
this->swap(dir_array.Rotate);
break;
}
return;
}
void Dice::swap(int *dir)
{
int tmp[6];
for (int i = 0; i < 6; i++)
tmp[dir[i]] = num[i];
for (int i = 0; i < 6; i++)
num[i] = tmp[i];
return;
}
void Dice::show_num(int i)
{
cout << this->num[i] << endl;
return;
}
int check(Dice dice1, Dice dice2)
{
int tmpf, flag = 0;
for (int i = 0; i < 4; i++) {
tmpf = 1;
for (int j = 0; j < 6; j++)
if (dice1.num[j] != dice2.num[j])
{
tmpf = 0;
break;
}
if (tmpf)
flag = 1;
dice2.roll('R');
}
return flag;
}
int dice_comp(Dice dice1, Dice dice2)
{
int flag = 0;
for (int i = 0; i < 4; i++)
{
flag += check(dice1, dice2);
dice2.roll('E');
}
dice2.roll('N');
flag += check(dice1, dice2);
dice2.roll('N');
dice2.roll('N');
flag += check(dice1, dice2);
return flag;
}
int main()
{
int flag = 0, n;
cin >> n;
Dice dice1;
for (int i = 1; i < n; i++)
{
Dice dice2;
flag += dice_comp(dice1, dice2);
}
if (!flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<int> a(h*w);
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(i%2) cin >> a[i*w+w-1-j];
else cin >> a[i*w+j];
}
}
vector<string> ans;
for(int i = 0; i < h*w-1; i++) {
if(a[i]%2){
a[i]--;
a[i+1]++;
int r=i/w;
int c=i%w;
int nr=(i+1)/w;
int nc=(i+1)%w;
if(r%2) c=w-1-c;
if(nr%2) nc=w-1-nc;
string tmp=to_string(r+1)+" "+to_string(c+1)+" "+to_string(nr+1)+" "+to_string(nc+1);
ans.emplace_back(tmp);
}
}
cout << ans.size() << "\n";
for(int i = 0; i < ans.size(); i++) cout << ans[i] << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int H, W;
bool fid[510][510];
bool mem[510][510];
int cnt;
signed main()
{
cin >> H >> W;
rep(i, H)rep(j, W)
{
int a;
cin >> a;
fid[i][j] = a & 1;
mem[i][j] = a & 1;
}
rep(i, H)rep(j, W - 1)
{
if(mem[i][j])
{
cnt++;
mem[i][j + 1] ^= true;
}
}
rep(i, H - 1)
{
if(mem[i][W - 1])
{
cnt++;
mem[i + 1][W - 1] ^= true;
}
}
cout << cnt << endl;
rep(i, H)rep(j, W - 1)
{
if(fid[i][j])
{
cout << i + 1 << " " << j + 1 << " " << i + 1 << " " << j + 2 << endl;
fid[i][j + 1] ^= true;
}
}
rep(i, H - 1)
{
if(fid[i][W - 1])
{
cout << i + 1 << " " << W << " " << i + 2 << " " << W << endl;
fid[i + 1][W - 1] ^= true;
}
}
return 0;
} | 1 |
#include<iostream>
#include<cstdio>
#include<stack>
#include<algorithm>
using namespace std;
bool barrier[2000][2000];
long long hist_barrier[2000][2001];
char S[2000][2001];
int main(){
int H, W;
cin >> H >> W;
for(int i = 0; i < H; i++){
cin >> S[i];
}
for(int h = 0; h < H - 1; h++){
for(int w = 0; w < W - 1; w++){
int cnt_black = 0;
for(int i = 0; i < 4; i++){
cnt_black += (S[h + (i / 2)][w + (i % 2)] == '#') ? 1 : 0;
}
barrier[h][w] = (cnt_black % 2 == 1);
}
}
for(int h = 0; h < H; h++){
hist_barrier[h][0] = h + 1;
}
for(int w = 0; w < W; w++){
hist_barrier[0][w] = 1;
}
for(int h = 1; h < H; h++){
for(int w = 1; w < W; w++){
if(barrier[h-1][w-1]){
hist_barrier[h][w] = 1;
}else{
hist_barrier[h][w] = hist_barrier[h-1][w] + 1;
}
}
}
long long ans = 0;
for(int h = 0; h < H; h++){
stack<pair<long long, int> > st;
for(int w = 0; w < W + 1; w++){
if(st.empty()){
st.push(make_pair(h + 1, w));
}else if(st.top().first > hist_barrier[h][w]){
int last_pos;
while(!st.empty() && st.top().first >= hist_barrier[h][w]){
ans = max(ans, (w - st.top().second) * st.top().first);
last_pos = st.top().second;
st.pop();
}
st.push(make_pair(hist_barrier[h][w], last_pos));
}
if(st.top().first < h + 1){
st.push(make_pair(h + 1, w));
}
}
}
cout << ans << endl;
}
| #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
while(true){
int n,m,p[1001];
vector<int> a;
scanf("%d %d",&n,&m);
if(n==0&&m==0) return 0;
p[0] = 0;
for(int i=0;i<n;i++) scanf("%d",p+i+1);
n++;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
a.push_back(p[i]+p[j]);
}
}
sort(a.begin(),a.end());
a.erase(unique(a.begin(),a.end()),a.end());
int ans = 0;
for(int i=0;i<a.size();i++){
int x = m - a[i];
int j = upper_bound(a.begin(),a.end(),x) - a.begin();
if(j!=0) ans = max(ans,a[i]+a[j-1]);
}
printf("%d\n",ans);
}
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
struct topological_sort{
vector<vector<int>> G;
vector<int> indegree;
vector<int> degree;
int V;
topological_sort(int V) : V(V) {
G.resize(V);
indegree.resize(V);
degree.resize(V);
}
void add_edge(int a, int b) {
G[a].push_back(b);
indegree[b]++;
}
vector<int> sort() {
queue<int> q;
vector<int> sorted;
int deg = 1;
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
q.push(i);
degree[i] = deg;
}
}
while (!q.empty()) {
queue<int> q_tmp;
deg++;
while (!q.empty()) {
int v = q.front(); q.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u]--;
if (indegree[u] == 0) {
q_tmp.push(u);
degree[u] = deg;
}
}
sorted.push_back(v);
}
swap(q,q_tmp);
}
return sorted;
}
};
int main() {
int n; cin >> n;
topological_sort ts(n*(n-1)/2);
vvint to(n,vint(n));
int num = 0;
rep(i,n)rep(j,i) to[j][i] = to[i][j] = num++;
vvint data(n,vint(n-1));
rep(i,n)rep(j,n-1) {
int x; cin >> x;
x--;
data[i][j] = x;
}
rep(i,n)rep(j,n-2) {
ts.add_edge(to[i][data[i][j]],to[i][data[i][j+1]]);
}
vint res = ts.sort();
if (res.size() != n*(n-1)/2) {cout << -1 << endl; return 0;}
cout << ts.degree[res.back()] << endl;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define 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;
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vector<queue<ll>> que(n);
rep(i, n) {
rep(_, n - 1) {
ll a;
cin >> a;
a--;
que[i].push(a);
}
}
bool upd = true;
ll tsukaday = 0;
while (upd) {
upd = false;
vll done(n);
rep(i, n) {
if (done[i] || que[i].empty()) continue;
ll toi = que[i].front();
if (done[toi] == 0 && que[toi].front() == i) {
que[i].pop();
que[toi].pop();
done[i] = 1;
done[toi] = 1;
upd = true;
}
}
if(upd) tsukaday++;
}
bool ok = true;
rep(i, n) if (!que[i].empty()) {
ok = false;
break;
}
ll ans = ok ? tsukaday : -1;
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int query(int i){
cout << i <<endl;
string s;
cin >> s;
if(s[0] == 'V')exit(0);
return (s[0] == 'M');
}
int main() {
int n;
cin >> n;
int l=0,r = n-1;
int eve = query(l);
query(r);
while(true){
int mid = (l+r)/2;
int a = query(mid);
if(mid%2){
if(a == eve) r = mid;
else l = mid;
}else{
if(a == eve) l = mid;
else r = mid;
}
}
return 0;
} | #include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int main() {
int N;
cin >> N;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
ask(1, N - 1, s == "Male");
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
/*
*/
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll A, B; cin>>A >> B;
ll ans = A * B;
cout <<ans <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
int main()
{
///"In the name of Allah,most gracious and most merciful"///
ll i,j,x,y,z,count=0,sum=0,n;
cin>>n;
x=n+(n*n)+(n*n*n);
cout<<x<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main (void){
int a, b;
int i, j, k;
cin >> a >> b;
i = a + b;
j = a - b;
k = a * b;
if(i < j){
if(j < k){
cout << k << endl;
}else{
cout << j << endl;
}
}else if(j < i){
if(i < k){
cout << k << endl;
}else{
cout << i << endl;
}
}else if(k < i){
if(i < j){
cout << j << endl;
}else{
cout << i << endl;
}
}else{
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll a, b;
cin >> a >> b;
cout << max(a * b, max(a + b, a - b)) << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(12);
ll N,M;
cin >> N >> M;
ll gcm = 0;
if(N <= 10){
for(ll i = N;;i++){
if(M < i)break;
if(M % i == 0){
chmax(gcm,M/i);
break;
}
}
}else{
for(ll i = 1;;i++){
ll test = M - i*(N-1);
if(test <= 0)break;
if(test < i)break;
if(test % i == 0){
chmax(gcm,i);
}
}
}
cout << gcm << "\n";
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for(int i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(int i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(int j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";//https://stackoverrun.com/ja/q/12618775
}
cout << "\x1B[0m" << endl;
}
}
using P = pair<int ,int>;
using LP = pair<ll, int>;
int main(){
int N;
ll M;
cin >> N >> M;
vector<ll> divs;
for(ll i=1; i*i<=M; i++){
if(M%i == 0){
divs.push_back(i);
if(i*i != M)divs.push_back(M/i);
}
}
sort(divs.begin(), divs.end());
ll ans = 0;
for(int i=0; i<(int)divs.size(); i++){
if(M/divs[i] >= N) ans = max(ans, divs[i]);
}
// cout << " divs: "; print_vec(divs);
cout << ans << endl;
// vector<LP> prime_divisors;
// ll m = M;
// //エラトステネスの篩
// for(ll p=2; p*p<m; p++){
// if(m % p != 0) continue;
// int cnt = 0;
// while(m%p == 0){
// m /= p;
// cnt++;
// }
// prime_divisors.emplace_back(p, cnt);
// }
// if(m != 1) prime_divisors.emplace_back(m, 1);
// vector<ll> divs;// Mの因数となるモノを格納
// ll ans = 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;
int main (){
ll N, L[2]{};
cin >> N;
set <int> S;
while (cin >> N) {
if (!S.insert(N).second) {
S.erase(N);
if (N > L[0]){
L[1] = L[0], L[0] = N;
}
else if(N > L[1]){
L[1] = N;
}
}
}
cout << L[0] * L[1] << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return 1;}return 0;}
template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return 1;}return 0;}
int main(){
ll n;cin>>n;
map<ll,ll> a;
rep(i,n){
ll p;cin>>p;
if(a.find(p)==a.end()) a[p]=1;
else a[p]++;
}
ll ans=1;
priority_queue<ll> que;
que.push(0);
que.push(0);
for(auto itr=a.begin();itr!=a.end();itr++){
rep(i,itr->second/2) que.push(itr->first);
}
ans*=que.top();
que.pop();
ans*=que.top();
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll) x.size()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define MAX(x, y, z) max(x, max(y, z))
#define MIN(x, y, z) min(x, min(y, z))
#define ANS cout << ans << "\n"
#define RETURN(x) \
cout << x << "\n"; \
return 0
clock_t CLOCK;
#define START_TIMER CLOCK = clock()
#define SHOW_TIMER cerr << "time: " << (ld)(clock() - CLOCK) / 1000000 << "\n"
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
signed main() {
init();
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b[0] && b.back() == c[0]) {
COUT("YES");
} else {
COUT("NO");
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main(){
char str1[25];
char str2[25];
char str3[25];
scanf("%s %s %s", str1, str2, str3);
if (str1[strlen(str1)-1] == str2[0]){
if (str2[strlen(str2)-1] == str3[0]){
printf("YES\n");
}
else
{
printf("NO\n");
}
}
else
{
printf("NO\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define Task "abc"
#define For(i, a, b) for(int i = (a), _b = (b); i <= b; ++i)
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef long long ll;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
int n, m;
ll gt[maxn], igt[maxn];
ll f[31][31627 * 2];
ll Pow(ll a, ll b){
if (b == 0) return 1;
ll tmp = Pow(a, b / 2);
tmp = (tmp * tmp) % mod;
if (b % 2) return (tmp * a) % mod;
return tmp;
}
void init(){
const int maxp = 1e5;
gt[0] = 1;
for (int i = 1; i <= maxp; ++i)
gt[i] = (gt[i-1] * i) % mod;
igt[maxp] = Pow(gt[maxp], mod - 2);
for (int i = maxp - 1; i >= 0; --i)
igt[i] = (igt[i+1] * (i + 1)) % mod;
}
ll comb(int k, int n){
return ( (gt[n] * igt[n - k]) % mod * igt[k]) % mod;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
// freopen(Task".inp", "r", stdin); freopen(Task".out", "w", stdout);
cin >> n >> m;
if (m == 1){
cout << 1; return 0;
}
vector<int> div;
for (int i = 1; i * i <= m; ++i){
if (m % i == 0){
div.push_back(i);
if (i * i != m) div.push_back(m / i);
}
}
int len = div.size();
unordered_map<int, int> Pos;
for (int i = 0; i < len; ++i)
Pos[div[i]] = i;
for (int i = 1; i < len; ++i)
f[1][i] = 1;
for (int k = 1; k < 30; ++k){
for (int i = 1; i < len; ++i){
for (int j = 1; j < len; ++j){
if (div[j] % div[i] == 0 && div[j] / div[i] > 1)
f[k+1][j] = (f[k+1][j] + f[k][i]) % mod;
}
}
}
init();
ll ans = 0;
for (int x = 1; x <= min(30, n); ++x){
ans += f[x][Pos[m]] * comb(x, n);
ans %= mod;
}
cout << ans;
}
| #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long int ull;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e9;
vector<ll> fac(10000000),inv(10000000),finv(10000000);
void initCOM(){
fac[0]=fac[1]=1;
inv[1]=1;
finv[0]=finv[1]=1;
for(int i=2;i<10000000;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 COM(int n,int k){
if(n<0||k<0) return 0;
if(n-k<0) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
vector<ll> prime_factor(ll m){
vector<ll> res;
for(int i=2;i*i<=m;i++)if(m%i==0){
ll cnt=0;
while(m%i==0){
m/=i;
cnt++;
}
res.push_back(cnt);
}
if(m>1) res.push_back(1);
return res;
}
int main(){
initCOM();
ll n,m;cin>>n>>m;
auto p=prime_factor(m);
ll ans=1;
for(auto b:p){
ans=ans*COM(b+n-1,n-1)%MOD;
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);} // a>0 : sgn(a)>0
int sgn(const double&a,const double&b){return sgn(a-b);} // b<=c : sgn(b,c)<=0
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
ll n=s.size();
vvl dp(n+1,vl(2,LINF));
dp[0][0]=0;
dp[0][1]=1;
rep(i,n){
chmin(dp[i+1][0],min(dp[i][0]+(s[i]-'0'),dp[i][1]+10-(s[i]-'0')));
chmin(dp[i+1][1],min(dp[i][0]+(s[i]-'0')+1,dp[i][1]+10-(s[i]-'0')-1));
}
cout<<dp[n][0]<<endl;
}
| #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
int n = sqrt(N);
cout << n * n << endl;
} | 0 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main()
{
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int n, m;
cin >> n >> m;
int a[n];
int b[m];
for(int i = 0;i < n;i++)
cin >> a[i];
for(int i = 0;i < m;i++)
cin >> b[i];
long long x_sum = 0, y_sum = 0;
for(int i = 0;i < n - 1;i++){
x_sum += 1ll * (i + 1) * (n - i - 1) % MOD * (a[i + 1] - a[i]) % MOD;
if(x_sum >= MOD)
x_sum -= MOD;
}
for(int i = 0;i < m - 1;i++){
y_sum += 1ll * (i + 1) * (m - i - 1) % MOD * (b[i + 1] - b[i]) % MOD;
if(y_sum >= MOD)
y_sum -= MOD;
}
cout << x_sum * y_sum % MOD;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, x;
cin >> n >> x;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
ll ans = 0;
for(int i=0; i<n-1; ++i){
int ca = max(0, an[i] +an[i+1] -x);
ans += ca;
an[i+1] = max(0, an[i+1] -ca);
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
long long s,ans;
int n,a[200003];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
for(int i=2;i<=n;i++)
{
s=(s+a[i-1])%1000000007;
ans=(ans+s*a[i])%1000000007;
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
long long sum[200005];
int main()
{
long long mod=1000000007;
long long n;cin>>n;long long a[n];long long sum=0;
for(long long i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
sum=sum%mod;
}
long long pum=sum;long long rum=0;
for(long long i=0;i<n-1;i++)
{
//cout<<sum[n-1]<<" "<<sum[i]<<" "<<a[i]<<endl;
pum=pum-a[i];
if(pum<0)
pum+=mod;
rum+=(a[i]*pum);
rum=rum%mod;
}
cout<<rum;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
int main() {
long long N, M; std::cin >> N >> M;
std::map<long long, long long> C;
std::vector<long long> D(N + 1);
long long wa = 0;
long long ac = 0;
for (int i = 0; i < M; ++i) {
long long c; std::string s;
std::cin >> c >> s;
if (s == "WA" && D[c] != 1) {
D[c] = 5;
++C[c];
++wa;
}
if (s == "AC" && D[c] != 1) {
D[c] = 1;
++ac;
}
}
for (int i = 0; i < N + 1; ++i) {
if (D[i] == 5)
wa -= C[i];
}
std::cout << ac << " " << wa << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n, m;
cin >> n >> m;
vt<int> p(n + 1), ac(n + 1);
while (m--) {
int x;
string s;
cin >> x >> s;
if (s == "AC") ac[x] = 1;
else if (!ac[x]) p[x]++;
}
int pen = 0;
for (int i = 1; i <= n; i++) pen += p[i] * ac[i];
cout << accumulate(all(ac), 0) << ' ' << pen;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
// cout << "Case " << tc << ": ";
solve();
}
}
| 1 |
#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 repr(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 ld long double
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;
// const ll INF = 1LL << 30;
#define pp pair<ll, pair<ll, ll>>
#define fi first
#define se second
void print(Vl vec){
rep(i, 0, sz(vec)){
if(i) cout << " ";
cout << vec[i];
}
coel;
}
////////////////////////////////////////////////////////
int main() {
ll d, g; cin >> d >> g;
Vl p(d), c(d);
rep(i, 0, d) cin >> p[i] >> c[i];
ll ans = INF;
for(int tmp = 0; tmp < (1 << d); tmp++){
bitset<12> s(tmp);
vector<bool> f(d, false);
ll sum = 0;
ll cnt = 0;
rep(i, 0, 10){
if(s.test(i)){
f[i] = true;
sum += p[i]*(i+1)*100 + c[i];
cnt += p[i];
}
}
if(sum >= g){
chmin(ans, cnt);
continue;
}
for(int i = d-1; i >= 0; i--){
if(f[i]) continue;
bool h = false;
rep(j, 0, p[i]){
sum += (i+1)*100;
cnt ++;
if(sum >= g){
h = true;
chmin(ans, cnt);
break;
}
}
if(h) break;
}
}
co(ans);
return 0;
}
| #ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
#endif
#ifndef _TEMPLATE_IO
#define _TEMPLATE_IO
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void write(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void write(H head, T ...tail) { cout << head << " "; write(tail...); }
template<typename ...T> void writef(T ...tail) { write(tail...); cout << flush; }
template<typename ...T> void die(T ...tok) { write(tok...); exit(0); }
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
if (v.size()) {
rep(i, 0, sz(v) - 1)
out << v[i] << " ";
out << v.back();
}
return out;
}
#endif
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n; ll x;
read(n, x);
ll a[n];
rep(i, 0, n) read(a[i]);
ll ans = 0;
if (a[0] > x) {
ans += a[0] - x;
a[0] = x;
}
rep(i, 1, n) {
if (a[i] + a[i - 1] > x) {
ll d = a[i] + a[i - 1] - x;
a[i] -= d;
ans += d;
}
}
write(ans);
}
| 0 |
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
// ------ Class ------ //
class Graph2 {
public:
// ------ Variables ------ //
static const long long INF = 1000000000000000000;
int V, E; vector<vector<pair<int, long long> > > G;
// ------ Constructors ------ //
Graph2() : V(0), E(0), G(vector<vector<pair<int, long long> > >()) {}
Graph2(int v) : V(v), E(0), G(vector<vector<pair<int, long long> > >(v)) {}
Graph2(vector<vector<pair<int, long long> > > g) : V(g.size()), G(g) { for (int i = 0; i < g.size(); i++) E += g[i].size(); }
// ------ Basic Functions ------ //
int size() { return V; }
void add1(int v1, int v2, long long w) { G[v1].push_back(make_pair(v2, w)); E++; }
void add2(int v1, int v2, long long w) { add1(v1, v2, w); add1(v2, v1, w); }
// ------ Operators ------ //
bool operator==(const Graph2& g) const { return G == g.G; }
bool operator!=(const Graph2& g) const { return G != g.G; }
vector<pair<int, long long> > operator[](int x) { return G[x]; }
// ------ Algorithms ------ //
long long minspan() {
vector<long long> d(V, INF);
vector<bool> used(V, false);
priority_queue<pair<long long, int> > que;
for (int i = 0; i < V; i++) d[i] = INF;
d[0] = 0; que.push(make_pair(0, 0));
while (!que.empty()) {
pair<long long, int> pa = que.top(); que.pop();
int u = pa.second; used[u] = true;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i].first;
if (d[v] > G[u][i].second && !used[v]) {
d[v] = G[u][i].second; que.push(make_pair(-d[v], v));
}
}
}
long long sum = 0;
for (int i = 0; i < V; i++) sum += d[i];
return sum;
}
};
// ------ Main ------ //
int n, a;
int main() {
cin >> n; Graph2 g(n);
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
cin >> a;
if(a != -1) g.add1(i, j, a);
}
}
cout << g.minspan() << endl;
} | #include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 100
void searchIndex(int mat[][N], int n, int obj, int *row, int *col);
void changeGroup(int group[], int n, int g_old, int g_new);
int main(void)
{
int n;
cin >> n;
int group[N];
for (int i = 0; i < n; i++) group[i] = i;
int a[N][N];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int aij;
cin >> aij;
a[i][j] = aij;
}
}
int e[N * N];
int k = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
e[k++] = a[i][j];
}
}
sort(e, e + k);
int p = 0;
while (e[p] == -1) p++;
int cnt = 0;
for (int q = p; q < k; q++) {
int i, j;
searchIndex(a, n, e[q], &i, &j);
if (group[i] == group[j]) continue;
cnt += e[q];
if (group[i] > group[j]) changeGroup(group, n, group[i], group[j]);
else changeGroup(group, n, group[j], group[i]);
}
cout << cnt << endl;
return 0;
}
void searchIndex(int mat[][N], int n, int obj, int *row, int *col)
{
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (mat[i][j] == obj) {
mat[i][j] = -1;
*row = i;
*col = j;
return;
}
}
}
}
void changeGroup(int group[], int n, int g_old, int g_new)
{
for (int i = 0; i < n; i++) {
if (group[i] == g_old) group[i] = g_new;
}
} | 1 |
//#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main(){
long long int n;
cin >> n;
//全ての合計
long long int sum = 0;
for(int i = 1; i <= n; i++) sum += i;
//３で割れる
long long int group_3 = 0;
for(int i = 3; i <= n; i += 3) group_3 += i;
//５で割れる
long long int group_5 = 0;
for(int i = 5; i <= n; i += 5) group_5 += i;
//３と５で割れる
long long int group_3_5 = 0;
for(int i = 15; i <= n; i += 15) group_3_5 += i;
long long int ans = sum - group_3 - group_5 + group_3_5;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
cout<<(1+n)*n/2-(3+n-n%3)*(n-n%3)/3/2-(5+n-n%5)*(n-n%5)/5/2+(15+n-n%15)*(n-n%15)/15/2<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int m,mi,ma;
while(true){
cin >> m >> mi >> ma;
if(m==0) break;
std::vector<int> v;
for(int i=0;i<m;i++){
int p;cin >> p;
v.push_back(p);
}
sort(v.begin(),v.end(),greater<int>());
int gap=-1,n=mi;
for(int i=mi-1;i<ma;i++){
int temp=v[i]-v[i+1];
if(temp>=gap){
gap=temp;
n=i+1;
}
}
cout << n << endl;
}
} | //#pragma GCC optimize(2)
#include<cstdio>
#define L 1<<23
#define C (c=*A++)
#define ENS //__attribute__((optimize("-O2")))
#define NES //__attribute__((optimize("-O2"))) __inline__ __attribute__((always_inline))
#define N 1000001
int MAPLE,n,l[N],r[N],cnt,last,wt,ss[19];char fl[L],*A=fl,s[N],t[N];bool fg=true;
NES void read(int&x){char c;for(x=0;'0'>C||c>'9';);while('0'<=c&&c<='9')x=(x<<3)+(x<<1)+c-48,C;}NES void print(int x){if(!x)putchar(48);else{for(wt=0;x;ss[++wt]=x%10,x/=10);for(;wt;putchar(ss[wt--]+48));}}
ENS int main()
{int i,j;char c;
for(fl[fread(fl,1,L,stdin)]=EOF,read(n);'a'>C||c>'z';);for(i=1;i<=n;s[i]=c,C,i++);while('a'>C||c>'z');for(i=1;i<=n;t[i]=c,C,i++);
for(last=i=n,j=n+1;i;fg&=s[i]==t[i],i--)
if(t[i]!=t[i-1])
{if((--j)>i)j=i;
for(;j&&s[j]!=t[i];j--);if(!j)return puts("-1"),0;
l[++cnt]=j,r[cnt]=last,last=i-1;
}if(fg)return puts("0"),0;for(l[0]=n+1,i=1;i<=cnt;i++)for(;l[i-MAPLE]<r[i]+MAPLE;MAPLE++);print(MAPLE);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,K,cnt,sum,minsum,minsumtemp;
cin >> N >> K;
vector<int> x(N);
vector<int> diff(N-1);
for(int i=0;i<N;i++) {
cin >> x[i];
if(i) diff[i-1] = x[i]-x[i-1];
}
cnt = 0;
sum = 0;
minsum = INT_MAX;
for(int i=0;i<(K-1);i++) {
sum += diff[i];
}
if(abs(x[K-1]) < abs(x[0])) {
minsum = sum + abs(x[K-1]);
} else {
minsum = sum + abs(x[0]);
}
for(int i=(K-1);i<(N-1);i++) {
sum += diff[i];
sum -= diff[i-K+1];
if(abs(x[i+1]) < abs(x[i-K+2])) {
minsumtemp = sum + abs(x[i+1]);
} else {
minsumtemp = sum + abs(x[i-K+2]);
}
if(minsumtemp < minsum) {
minsum = minsumtemp;
}
}
cout << minsum << endl;
return 0;
}
| // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 998244353 //1000000007 // 100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
// constants
const ll N = 1e5+5, M = 1e6+5, A = 1e7+5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve()
{
ll n, m;
cin >> n >> m;
vector<ll> a(n); cin >> a;
ll ans = inf;
ll l = 0, r = m-1;
rep(i, n)
{
if(a[r] <= 0){
ans = min(ans, abs(a[l]));
}
else if(a[l] >= 0){
ans = min(ans, a[r]);
}
else{
ans = min({ans, abs(a[l])*2 + a[r], abs(a[l]) + a[r]*2 });
}//cout << ans << " ";
l++, r++;
if(r == n) break;
}
cout << ans;
}
int main(int argc, char const* argv[])
{
ll t = 1; //cin >> t;
while(t--) {
solve();
}
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin >> n && n) {
int ans = INF;
rep(i,101) {
if(i*i*i > n) break;
rep(j,1001) {
if(i*i*i + j*j > n) break;
ans = min(ans,i+j+(n - i*i*i - j*j));
}
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template<typename T>
T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T>
map<T, T> getPrimeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i] ++;
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
template<typename T>
bool IsPrimeNumber(T num)
{
if (num <= 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
#define rep(i,s,e) for(ll i=s;i<e;i++)
#define repeq(i,s,e) for(ll i=s;i<=e;i++)
int main() {
ll N;
std::cin >> N;
stack<bool> st;
while (N != 0) {
st.push(N % -2);
N -=st.top();
N /= -2;
}
if (st.empty()) {
std::cout << 0;
}
while (!st.empty()) {
std::cout << st.top();
st.pop();
}
std::cout<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstring>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string s, tmp, str, commands;
stringstream ss;
vector<string> dice;
getline(cin, s);
ss << s;
while(getline(ss, str, ' ')) {
dice.push_back(str);
}
cin >> commands;
for(int i = 0; i < commands.length(); i++) {
switch(commands[i]) {
case 'N':
tmp = dice[0];
dice[0] = dice[1];
dice[1] = dice[5];
dice[5] = dice[4];
dice[4] = tmp;
break;
case 'E':
tmp = dice[0];
dice[0] = dice[3];
dice[3] = dice[5];
dice[5] = dice[2];
dice[2] = tmp;
break;
case 'W':
tmp = dice[0];
dice[0] = dice[2];
dice[2] = dice[5];
dice[5] = dice[3];
dice[3] = tmp;
break;
case 'S':
tmp = dice[0];
dice[0] = dice[4];
dice[4] = dice[5];
dice[5] = dice[1];
dice[1] = tmp;
break;
default :
break;
}
}
cout << dice[0] << endl;
return 0;
}
| #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string ss;
cin >> ss;
int s[10];
for (int i = 0; i < ss.size(); ++i) {
s[i] = ss[i] - (char)'0';
}
int diff = 1000;
for (int i = 0; i < ss.size() - 2; ++i) {
int n = s[i] * 100 + s[i + 1] * 10 + s[i + 2];
diff = min(diff, abs(753 - n));
}
cout << diff << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mxN=16,M=1e9+7;
//did u check when n=1?
//is mxN correct?
int n;
int g[mxN][mxN];
int dp[(1<<16)],sum[(1<<16)];
void solve(int idx,int mask,int temp,vi& a,int k){
if(idx==sz(a)){
dp[mask]=max(dp[mask],k+sum[temp]);
return;
}
solve(idx+1,mask,temp,a,k);
solve(idx+1,mask^(1<<a[idx]),temp^(1<<a[idx]),a,k);
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>g[i][j];
}
}
for(int mask=0;mask<=(1<<n)-1;mask++){
for(int i=0;i<n;i++){
if(!(mask & (1<<i)))continue;
for(int j=i+1;j<n;j++){
if((mask & (1<<j))){
sum[mask]+=g[i][j];
}
}
}
}
for(int mask=0;mask<(1<<n);mask++){
vi aux;
for(int i=0;i<n;i++){
if(!(mask & (1<<i)))aux.pb(i);
solve(0,mask,0,aux,dp[mask]);
}
}
cout<<dp[(1<<n)-1];
} | /*
author: parv2809
*/
#include<bits/stdc++.h>
#define int long long int
#define mod 1000000007
#define inf 1e18
#define fo(i,y,n,inc) for(int i=y;i<n+y;i+=inc)
#define cin(t) int t;cin>>t
#define w(t) while(t--)
#define nl cout<<endl;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ft(i) (i&(-1*i))
#define arrIn(arr,size) for(int i=0;i<size;i++){cin>>arr[i];}
#define arrOut(arr,size,seperater) for(int i=0;i<size;i++){cout<<arr[i]<<seperater;}
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int powmd(int a, int b) {
if (b == 1) return a;
if (b == 0) return 1;
int half = powmd(a, b / 2);
int ans = half * half;
ans %= mod;
if (b & 1) {
ans *= a;
}
ans %= mod;
return ans;
}
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
int mat[16][16];
int dp[(1 << 16)], sums[(1 << 16)];
int calculate(int mask) {
int ans = 0;
for (int i = 0; i < 17; i++) {
if (mask & (1 << i)) {
for (int j = i + 1; j < 17; j++) {
if (mask & (1 << j)) {
ans += mat[i][j];
}
}
}
}
return ans;
}
void pre_compute_sums() {
for (int i = 0; i <= (1 << 16); i++) {
sums[i] = calculate(i);
dp[i] = inf;
}
}
int solve(int mask) {
if (mask == 0)
return 0;
if (dp[mask] != inf)
return dp[mask];
int s = mask;
int ans = 0;
while (s > 0) {
ans = max(ans, sums[s] + solve(mask - s));
s = (s - 1)&mask;
}
return dp[mask] = ans;
}
int32_t main() {
fastIO();
int t = 1;
w(t) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> mat[i][j];
}
}
pre_compute_sums();
cout << solve((1 << n) - 1);
nl;
}
return 0;
}
// cout << "Case #" << i << ": " << answer << endl; | 1 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string S;
cin>>S;
bool alpha[26];
string ans;
rep(i,26) alpha[i]=false;
rep(i,S.size()){
alpha[S[i]-'a']=true;
}
if(S.size()<26){
rep(i,26){
if(alpha[i]==false){
ans=S;
ans.push_back('a'+i);
break;
}
}
}else if(S=="zyxwvutsrqponmlkjihgfedcba"){
ans="-1";
}else{
string T=S;
next_permutation(S.begin(),S.end());
int j=0;
while(S[j]==T[j]){
ans.push_back(S[j]);
j++;
}
ans.push_back(S[j]);
}
cout<<ans<<endl;
} | 1 |
#include<iostream>
using namespace std;
struct Test{
int A[3];
bool R;
};
Test tests[1000];
int info[301], M[3], N;
int main()
{
while(true)
{
for(int i = 0; i <= 300; i++)
info[i] = 2;
cin >> M[0] >> M[1] >> M[2];
if(!(M[0] || M[1] || M[2]))
break;
cin >> N;
for(int i = 1; i <= N; i++)
cin >> tests[i].A[0] >> tests[i].A[1] >> tests[i].A[2] >> tests[i].R;
bool b = true;
while(b)
{
b = false;
for(int i = 1; i <= N; i++)
{
if(tests[i].R)
{
for(int j = 0; j < 3; j++)
{
if(info[tests[i].A[j]] != 1)
{
info[tests[i].A[j]] = 1;
b = true;
}
}
}
else
{
int tmp = 0;
bool f = false;
for(int j = 0; j < 3; j++)
{
tmp += info[tests[i].A[j]] == 1;
}
if(tmp == 2)
{
for(int j = 0; j < 3; j++)
{
if(info[tests[i].A[j]] == 2)
{
info[tests[i].A[j]] = 0;
b = true;
}
}
}
}
}
}
for(int i = 1; i <= M[0] + M[1] + M[2]; i++)
{
cout << info[i] << endl;
}
}
} | #include <stdio.h>
int main()
{
int month, day, n;
int md[12] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30};
while (1) {
scanf("%d %d", &month, &day);
if (month == 0) break;
n = 0;
for (int i = 0; i < month; i++) {
n += md[i];
}
n += day;
switch (n%7) {
case 0: printf("Wednesday\n"); break;
case 1: printf("Thursday\n"); break;
case 2: printf("Friday\n"); break;
case 3: printf("Saturday\n"); break;
case 4: printf("Sunday\n"); break;
case 5: printf("Monday\n"); break;
case 6: printf("Tuesday\n"); break;
}
}
return 0;
} | 0 |
#include <stdio.h>
#include <string.h>
int main() {
int a, b;
scanf("%d %d",&a,&b);
char str[a+b+1];
scanf("%s",&str);
int len = strlen(str);
int flag = 0;
for (int i = 0; i < len; i++)
{
if (48 <= str[i] && str[i] <= 57)
{
continue;
}
else
{
if (i == a)
{
flag = 1;
}
else
{
flag = 0;
break;
}
}
}
flag ? printf("Yes\n") : printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string h;
cin >> h;
if(h == "hi" || h == "hihi" || h == "hihihi" || h == "hihihihi" || h == "hihihihihi"){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 50005;
const int MOD = 1000000007;
int n, x, y, z, cnt;
int p[10][MAXN], fin[10][MAXN], t[MAXN];
int dp[2][45][MAXN];
map <string, int> mp;
string r[MAXN];
vector <string> f (int x) {
vector <string> res;
if (x == 0) {
res.push_back("");
return res;
}
for (int i=0; i<x; i++) {
vector <string> tmp = f(i);
for (auto s : tmp) res.push_back(((char) (x - i + '0')) + s);
}
return res;
}
void ubaci (string s) {
int len = s.size();
int curr = 0;
for (int i=0; i<len; i++) {
int d = s[i] - '0';
if (p[d][curr] == 0) p[d][curr] = ++cnt;
curr = p[d][curr];
}
t[curr] = 1;
}
void dfs (string s, int br) {
mp[s] = br;
r[br] = s;
for (int i=0; i<10; i++) {
if (p[i][br]) dfs(s + ((char) (i + '0')), p[i][br]);
}
}
void gen () {
vector <string> sx = f(x), sy = f(y), sz = f(z);
for (auto s1 : sx) {
for (auto s2 : sy) {
for (auto s3 : sz) {
ubaci(s1 + s2 + s3);
}
}
}
mp[""] = 0;
dfs("", 0);
for (int i=0; i<=cnt; i++) {
int len = r[i].size();
for (int j=len; j>=0; j--) {
string suf = r[i].substr(j);
if (mp.find(suf) != mp.end()) {
int ind = mp[suf];
for (int k=0; k<10; k++) {
if (p[k][ind] != 0) fin[k][i] = p[k][ind];
}
}
}
}
}
int f (int flg, int pos, int br) {
//for (int i=0; i<pos; i++) cout << " ";
//cout << "bla " << flg << " " << pos << " " << br << endl;
if (dp[flg][pos][br] != -1) return dp[flg][pos][br];
if (pos == n) return flg;
int res = 0;
for (int i=0; i<10; i++) {
res = (res + f(flg | t[fin[i][br]], pos + 1, fin[i][br])) % MOD;
}
return dp[flg][pos][br] = res;
}
int main () {
memset(dp, -1, sizeof dp);
cin >> n >> x >> y >> z;
gen();
cout << f(0, 0, 0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int main() {
// U: 3^N fits, which hints towards a fancy subset DP
// i.e. the one that is magically 3^n when it looks like
// it should be 2^2n
cin.tie(0);
cin.sync_with_stdio(0);
int n; cin >> n;
long long a[n][n];
for(int i = 0; i<n; ++i) {
for(int j = 0; j<n; ++j) {
cin >> a[i][j];
}
}
// first, compute the costs of every subset (if grouped)
long long costs[1<<n];
for(int i = 0; i<(1<<n); ++i) {
vector<int> in_group;
for(int j = 0; j<n; ++j) {
if((i >> j) & 1) {
in_group.push_back(j);
}
}
costs[i] = 0;
for(int j = 0; j<in_group.size(); ++j) {
for(int k = j+1; k<in_group.size(); ++k) {
costs[i] += a[in_group[j]][in_group[k]];
}
}
}
// next, magic
long long dp[1<<n];
for(int i = 0; i<(1<<n); ++i) {
dp[i] = LLONG_MIN;
}
dp[0] = 0;
for(int i = 0; i<(1<<n); ++i) {
// ugh I can't quite remember it...
int j = i;
do {
j = (j - 1) & i; // go through all masks containing i as a submask...
dp[i] = max(dp[i], dp[j] + costs[i^j]);
} while (j != i);
}
cout << dp[(1<<n)-1] << endl;
}
| 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int N, K; cin >> N >> K;
int arr[N];
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
sort(arr, arr + N, greater<int>());
for (int i = 0; i < K; i++) {
ans += arr[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, l, m=101;
cin >> n >> l;
for(int i=l; i<l+n; i++)m=min(abs(i), m);
int ans=0;
for(int i=l; i<l+n; i++){
if(abs(i)==m)continue;
ans+=i;
}
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
int n;
int a, b, c;
int mn;
cin >> n;
if (n == 2){
cin >> a >> b;
mn = min(a, b);
}
else{
cin >> a >> b >> c;
mn = min(a, min(b, c));
}
for (int i = 1; i <= mn; i++){
if (n == 2){
if (a%i == 0 && b%i == 0) cout << i << endl;
}
else if (a%i == 0 && b%i == 0 && c%i == 0) cout << i << endl;
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0)
//#define MULTI_TEST
//#define GOOGLE
#ifdef LOCAL
#include "debugger.h"
#else
#define db(...)
#endif
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<int>
#define s64 set<ll>
#define p32 pair<int, int>
#define p64 pair<ll, ll>
#define sz(v) (ll)(v).size()
#define fi first
#define se second
#define ln '\n'
const ll MOD = 1e9 + 7;
inline ll add(ll a, ll b, ll m) { return (((a % m + b % m) % m + m) % m); }
inline ll mul(ll a, ll b, ll m) { return (((a % m * b % m) % m + m) % m); }
void solve(int tc)
{
int n, q;
cin >> n >> q;
map<ll, vector<p64>> hol;
for (int i = 0; i < n; i++)
{
ll si, fi, xi;
cin >> si >> fi >> xi;
hol[xi].push_back({si, fi});
}
s64 peeps;
map<ll, ll> ans;
v64 D(q, 0);
for (int i = 0; i < q; i++)
{
cin >> D[i];
peeps.insert(D[i]);
}
for (auto itr : hol)
{
sort(itr.se.begin(), itr.se.end());
for (auto x : itr.se)
{
ll si = x.fi, fi = x.se;
ll xi = itr.fi;
auto l = peeps.lower_bound(si - xi);
auto r = peeps.upper_bound((2 * fi - 2 * xi - 1) / 2);
if (r != peeps.begin())
r--;
else
continue;
queue<ll> rem;
for (auto lol = l; lol != peeps.end() && *lol <= *r; lol++)
ans[*lol] = xi, rem.push(*lol);
while (sz(rem))
{
peeps.erase(rem.front());
rem.pop();
}
}
}
for (ll x : D)
{
if (!ans.count(x))
cout << -1 << ln;
else
cout << ans[x] << ln;
}
return;
}
int main()
{
#ifndef LOCAL
FASTIO;
#endif
int t = 1;
#ifdef LOCAL
clock_t start, stop;
start = clock();
#endif
#ifdef MULTI_TEST
cin >> t;
#endif
for (int tc = 1; tc < t + 1; tc++)
{
#ifdef GOOGLE
cout << "Case #" << tc << ": ";
#endif
solve(tc);
}
#ifdef LOCAL
stop = clock();
cerr << "Time :" << fixed << setprecision(5) << double(stop - start) / double(CLOCKS_PER_SEC) << "s" << ln;
#endif
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int d, t, s, minute;
cin >> d >> t >> s;
if (d % s) {
minute = d / s + 1;
}
else {
minute = d / s;
}
if (minute <= t)
std::cout << "Yes\n";
else
std::cout << "No\n";
return 0;
} | #include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int k; cin>>k;
string s; cin>>s;
for(int i=0; i<min(k, (int)s.size());i++) cout<<s[i];
if((int)s.size() > k)
cout<<"...";
cout<<"\n";
return 0;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
//幅優先探索のテンプレ.デフォルトではstartからの距離を返す.
//graphは隣接リスト.startは探索開始地点
vector<int> bfs(vector<vector<int>> &graph, int start){
queue<int> todo;
vector<int> dist(graph.size(),-1);
dist[start] = 0;
todo.push(start);
while(!todo.empty()){
int now = todo.front();
todo.pop();
for (int i=0;i<graph[now].size();i++){
int nxt = graph[now][i];
if (dist[nxt] != -1) continue;
dist[nxt] = dist[now] + 1;
todo.push(nxt);
}
}
return dist;
}
const int D = 80*160+10;
const int D2 = D*2;
typedef bitset<D2> bs;
int a[100][100];
bs dp[90][90];
int main() {
int h, w;
cin >> h >> w;
rep(i,h)rep(j,w) {
int x;
cin >> x;
a[i][j] = x;
}
rep(i,h)rep(j,w) {
int x;
cin >> x;
a[i][j] = abs(x-a[i][j]);
}
dp[0][0][D-a[0][0]] = 1;
dp[0][0][D+a[0][0]] = 1;
rep(i,h)rep(j,w) {
if (i) {
dp[i][j] |= dp[i-1][j]<<a[i][j];
dp[i][j] |= dp[i-1][j]>>a[i][j];
}
if (j) {
dp[i][j] |= dp[i][j-1]<<a[i][j];
dp[i][j] |= dp[i][j-1]>>a[i][j];
}
}
int ans = D2;
rep(i,D2) if (dp[h-1][w-1][i]) {
ans = min(ans, abs(i-D));
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){
int H,W;cin>>H>>W;
int A[H][W] = {}; int a;
rep(i,0,H)rep(j,0,W){ cin>>a; A[i][j] += a; }
rep(i,0,H)rep(j,0,W){ cin>>a; A[i][j] -= a; }
bool dp[H+1][W+1][12801] = {}; dp[0][1][0] = 1;
rep(i,1,H+1)rep(j,1,W+1){
int t = abs(A[i-1][j-1]);
rep(k,0,12801){
if(k + t <= 12800) dp[i][j][k+t] |= dp[i-1][j][k] | dp[i][j-1][k];
dp[i][j][abs(k - t)] |= dp[i-1][j][k] | dp[i][j-1][k];
}
}
rep(i,0,12801){
if(dp[H][W][i]){
cout<<i<<endl;
break;
}
}
} | 1 |
#include <cstdio>
int main()
{
int a,b,c,d;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (a + b > c + d)
{
printf("Left");
}
else if (a + b < c + d)
{
printf("Right");
}
else if (a + b == c + d)
{
printf("Balanced");
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int d,t,s;
cin>>d>>t>>s;
float time = (d/(s*1.0));
if(time<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
//template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
//template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define ln '\n'
#define space ' '
using LL = long long;
using pii = pair<int,int>;
const int INF = 2e9;
const int NN = 2e3;
const int MOD = 998244353;
namespace Mm{
inline int mul(const LL &x, const LL &y) { return (x*y)%MOD; }
inline int add(const LL &x, const LL &y) { return (x+y)%MOD; }
inline int power(const LL &x, const LL &n){ if(n == 0) return 1; int y=power(x, n>>1); y=mul(y,y); return (n&1)?mul(y,x):y; }
inline int inv(const LL &x){ return power(x, MOD-2); }
// int _fact[2*NN] = {0};
// inline int fact(const int &x){ return (x==0 ? 1 : (_fact[x]!=0 ? _fact[x] : _fact[x]=mul(x, fact(x-1)))); }
// inline int cnk(const int &n, const int &k){ return (n<k)?0:mul(fact(n),inv(mul(fact(k),fact(n-k)))); }
int _cnk[2*NN+1][2*NN+1] = {0};
inline int cnk(const int &n, const int &k){ return (n<k)?0:(k==0)?1:(_cnk[n][k]!=0?_cnk[n][k]:_cnk[n][k]=add(cnk(n-1,k),cnk(n-1,k-1))); }
} using namespace Mm;
int n,k;
int dp[NN+1][NN+1];
int nbPairs[2*NN+1];
#define read(a,b) cin>>a>>b
#define write(a,b) cout<<a<<b
int32_t main(){ FAST;
read(k,n);
dp[0][0] = 1;
for(int i=1; i<=NN; ++i){ // #pairs
int prefSum = 0;
for(int j=0; j<=NN; ++j){ // #items to distribute on pairs
dp[i][j] = add(dp[i-1][j], add(prefSum, prefSum)); // k € [1;j]
prefSum = add(prefSum, dp[i-1][j]);
}
}
for(int i=1; i<=k; ++i) for(int j=i+1; j<=k; ++j) ++nbPairs[i+j];
for(int i=2; i<=2*k; ++i){
int ans = 0;
int others = k - 2*nbPairs[i];
if(i&1){
if(others == 0){
ans = dp[nbPairs[i]][n];
write(ans, ln);
continue;
}
for(int giveOthers=0; giveOthers<=n; ++giveOthers){
int givePairs = n-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
}
else{
--others;
if(others == 0){
ans = add(dp[nbPairs[i]][n], dp[nbPairs[i]][n-1]);
write(ans, ln);
continue;
}
for(int giveOthers=0; giveOthers<=n; ++giveOthers){
int givePairs = n-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
for(int giveOthers=0; giveOthers<=n-1; ++giveOthers){
int givePairs = n-1-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
}
write(ans, ln);
}
} | #include <bits/stdc++.h>
using namespace std;
#define VIC ios::sync_with_stdio(0);cin.tie(0);ios_base::sync_with_stdio(0);
#define wtf(s) freopen((s), "w", stdout)
#define rff(s) freopen((s), "r", stdin)
#define pi (2 * acos(0))
typedef long double ld;
typedef long long ll;
#define endl '\n'
#define matrix vector<vector<ll>>
ll fact[4009] , inv[4009] , mod=998244353 , n, k;
ll fp(ll x , ll exp)
{
if(exp == 0)
return 1;
if(exp % 2 == 0)
return fp((x * x) % mod, exp / 2) % mod;
return ((fp((x * x) % mod, exp / 2) % mod) * x) % mod;
}
void calcFacAndInv(ll n)
{
fact[0] = inv[0] = 1;
for (ll i = 1; i <= n; i++)
{
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r)
{
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
ll npr(ll n, ll r)
{
return (fact[n] * inv[n - r]) % mod;
}
int main()
{
VIC
cin>>k>>n;
calcFacAndInv(4000);
for(ll i=2;i<=2*k;i++)
{
ll p=0, ans = ncr(n+k-1,k-1);
for(int j=1;j<=i/2;j++)
if(j <= k && i-j<=k)
p++;
for(int j=1;j<=p;j++)
{
// cout<<j<<" "<<p<<endl;
if(2*j>n)break;
ll cur=ncr(p,j) * ncr(n-2*j+k-1,k-1);
if(j%2==0)
ans+=cur;
else
ans-=cur;
ans %= mod;
ans=(ans+ mod)%mod;
}
cout<<ans<<"\n";
}
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
vector<int> tpsort(vector<vector<int>>& G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0) que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point
{
double x;
double y;
};
struct LineSegment
{
Point start;
Point end;
};
double tenkyori(const LineSegment& line, const Point& point)
{
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll m = 0;
ll ans = 1;
for (int i = 0; i < 2 * n; i++) {
if (i % 2 == 0 && s[i] == 'W' || i % 2 == 1 && s[i] == 'B') {
ans *= m;
m--;
ans %= 1000000007;
}
else {
m++;
}
}
if (m != 0)cout << 0 << endl;
else {
for (ll i = 0; i < n; i++) {
ans *= (i+1);
ans %= 1000000007;
}
cout << ans << endl;
}
} | #include<bits/stdc++.h>
#define MOD (long long)(1e9+7)
using namespace std;
int n,y;
int main()
{
cin >> n >> y;
int ok=0;
if(y%1000)
{
cout << -1 << ' ' << -1 << ' ' << -1;
return 0;
}
else y/=1000;
for(int i=0; !ok&&i<=y/10; i++)
for(int j=0; j<=y/5; j++)
if((y-i*10-j*5)>=0 && (y-i*10-j*5)+i+j == n)
{
cout << i << ' ' << j << ' ' << (y-i*10-j*5);
ok=1;
break;
}
if(!ok) cout << -1 << ' ' << -1 << ' ' << -1;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<P>>q;
fill(d.begin(),d.end(),1e9);
q.push({d[s]=0,s});
while(q.size()){
auto p=q.top();q.pop();
if(p.first>d[p.second])continue;
for(auto& a:E[p.second]){
int x=get<0>(a),y=get<1>(a)+p.first;
if(f)y=get<2>(a)+p.first;
if(y<d[x])d[x]=y,q.push({y,x});
}
}
}
};
main(){
int n,m,a,b,c,d,k;
while(cin>>n>>m,n){
Graph E(m);
for(int i=0;i++<n;E.add_edge(--a,--b,c,d),E.add_edge(b,a,c,d))cin>>a>>b>>c>>d;
cin>>k;
for(int i=0;i++<k;cout<<E.d[--b]<<endl){
cin>>a>>b>>c;
E.dijkstra(--a,c);
}
}
} | #include<iostream>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=1;i<=n;i++)
using namespace std;
typedef pair<int, int> P;
int c[100][100]={};
int t[100][100]={};
int main()
{
int n,m,a,b;
int i,j,k;
int p,q,r;
while(1){
cin>>n>>m;
if(n==0 && m==0)break;
rep(i,m)rep(j,m)c[i][j]=t[i][j]=INF;//INFテ」ツ?ァテ・ツ按敕ヲツ慊淌・ツ個?
rep(i,m)c[i][i]=t[i][i]=0;//テ・ツ青古ゥツァツ?」ツ?ッ0
rep(i,n){
cin>>a>>b;
cin>>c[a][b]>>t[a][b];
c[b][a]=c[a][b];
t[b][a]=t[a][b];
}
rep(k,m)rep(i,m)rep(j,m){
c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
t[i][j]=min(t[i][j],t[i][k]+t[k][j]);
}
cin>>k;
rep(i,k){
cin>>p>>q>>r;
if(r)
cout<<t[p][q]<<endl;
else
cout<<c[p][q]<<endl;
}
}
} | 1 |
#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 = 998244353;//1000000007;
template<class _T> static void getval(_T& a) {
std::cin >> a;
}
template<class _T> static void getval(_T& a, _T& b) {
std::cin >> a >> b;
}
template<class _T> static void getval(_T& a, _T& b, _T& c) {
std::cin >> a >> b >> c;
}
static void exec();
int main()
{
exec();
fflush(stdout);
return 0;
}
template <class _T> static _T tp_modpow(_T a, _T n, _T mod = (_T)1) {
_T ans = 1;
while (n > 0) {
if (n & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
n >>= 1;
}
return ans;
}
static void exec()
{
int N;
getval(N);
int d0;
getval(d0);
std::vector<LLONG> count(N, 0);
for (int i = 1; i < N; i++) {
int di;
getval(di);
count[di]++;
}
if (d0 || count[0]) {
printf("0\n");
return;
}
count[0]++;
LLONG ans = 1;
for (int i = 1; i < N; i++) {
LLONG val = tp_modpow(count[i - 1], count[i], MOD_NUM);
ans = (ans * val) % MOD_NUM;
}
printf("%lld\n", ans);
}
| #include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin >> N;
int c[N], flg=0;
for (int i = 0; i < N; i++){
c[i] = 0;
}
for (int i = 0; i < N; i++){
int tmp;
cin >> tmp;
if (i==0 && tmp==0){
flg = 1;
}
c[tmp] += 1;
}
if (c[0]==1 && flg == 1) {
unsigned long long ans = 1, tmp = 1;
unsigned long long t = 998244353;
for (int i = 2; i < N; i++){
if (c[i-1] == 0 && c[i] > 0){
ans = 0;
break;
}else if(c[i] == 0){
continue;
}
tmp = c[i-1];
for (int j = 2; j <= c[i]; j++){
tmp = tmp % t;
tmp = tmp * (c[i-1] % t);
}
ans = ans % t;
tmp = tmp % t;
ans *= tmp;
ans %= t;
}
printf("%llu\n", ans);
}else{
printf("0\n");
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10010;
const string MININF = "-INF";
int match[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[MAXN]; // i本のマッチ棒を使ったときの最大数
void chmax(string &a, string b)
{
if (a == MININF)
{
a = b;
}
else if (a.size() < b.size())
{
a = b;
}
else if (a.size() == b.size())
{
if (a < b)
{
a = b;
}
}
}
int main()
{
int N, M, a;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++)
{
cin >> A.at(i);
}
for (int i = 0; i < MAXN; i++)
{
dp[i] = MININF;
}
dp[0] = "";
for (int i = 0; i <= N; i++)
{
if (dp[i] == MININF)
continue;
for (int a : A)
{
chmax(dp[i + match[a]], dp[i] + (char)(a + '0'));
}
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll dp[10010]; // i本使って作れる最大桁数
int num[10] = {0,2,5,5,4,5,6,3,7,6};
int main(){
int n, m;
cin >> n >> m;
rep(i, 10010) dp[i] = -INF;
dp[0] = 0;
int a[m];
rep(i,m) cin >> a[i];
sort(a,a+m);
reverse(a,a+m);
rep(i, n+1){
rep(j, m){
if (i >= num[a[j]]) dp[i] = max(dp[i], dp[i-num[a[j]]] + 1);
}
}
vector<char> ans;
// rep(i, m) cout << a[i] << " ";
// cout << endl;
int i = n;
while(i > 0){
bool flag = false;
rep(j, m){
if (i - num[a[j]] < 0) continue;
if (dp[i - num[a[j]]] == dp[i]-1){
ans.push_back(a[j] + '0');
i -= num[a[j]];
// cout << "j=" << j << endl;
flag = true;
break;
}
}
if (!flag) break;
}
rep(i, ans.size()) cout << ans[i];
cout << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#include<sstream>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
void call(int n){
for(int i=1;i<=n;i++){
stringstream ss;
ss<<i;
char c[8];
ss>>c;
if(i%3==0||strstr(c,"3"))
cout<<" "<<i;
}
cout<<endl;
}
int main(){ _;
int n;cin>>n;
call(n);
} | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
void call(int n) {
int i = 1;
do {
int x = i;
bool END_CHECK_NUM = false;
if (x % 3 == 0) {
cout << " " << i;
END_CHECK_NUM = true;
}
do {
if (!END_CHECK_NUM && x % 10 == 3) {
cout << " " << i;
END_CHECK_NUM = true;
}
x /= 10;
} while (!END_CHECK_NUM && x);
} while (++i <= n);
cout << endl;
}
int main() {
int n;
cin >> n;
call(n);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> veca(a);
vector<int> vecb(b);
int minia = INF;
int minib = INF;
rep(i, a) {
cin >> veca.at(i);
minia = min(minia, veca.at(i));
}
rep(i, b) {
cin >> vecb.at(i);
minib = min(minib, vecb.at(i));
}
int mini = minia + minib;
int dismini = INF;
vector<vector<int> > dis(m, vector<int> (3));
rep(i, m) {
rep(j, 3) {
cin >> dis.at(i).at(j);
}
dismini = min(dismini, veca.at(dis.at(i).at(0) - 1) + vecb.at(dis.at(i).at(1) - 1) - dis.at(i).at(2));
}
cout << min(dismini, mini) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int INF = 2e9;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
ll A, B, m;
cin >> A >> B >> m;
vl a(A);
vl b(B);
ll minia = INF;
ll minib = INF;
rep(i, A){
cin >> a[i];
chmin(minia, a[i]);
}
rep(i,B){
cin >> b[i];
chmin(minib, b[i]);
}
ll ans = minia + minib;
rep(i, m){
ll x, y, c;
cin >> x >> y >> c;
ll tmp = a[x - 1] + b[y - 1] - c;
chmin(ans, tmp);
}
print(ans);
} | 1 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
ll n,a; cin >> n;
map<ll,ll> mp;
set<ll> st;
ll ans = 1;
ll prev,val;
bool f = false;
rep(i,n){
cin >> a;
if(mp.count(a) == 0) mp[a] = 1;
else mp[a] ++;
st.insert(a);
if(a == 0 && i != 0){
cout << 0;
return 0;
}
if(a == 0 && i == 0) f = true;
}
if(!f){
cout << 0;
return 0;
}
for(auto itr = st.begin(); itr != st.end(); ++itr) {
if(*itr == 0) {
prev = mp[*itr];
val = *itr;
}
else{
if(*itr - val != 1){
cout << 0;
return 0;
}
if(prev == 0){
cout << 0;
return 0;
}
rep(i,mp[*itr]){
ans = (prev*ans)%998244353;
}
prev = mp[*itr];
val = *itr;
}
}
cout << ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e3+10;
const LL MOD=1e9+7;
int n,m,px[N*N],py[N*N];
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++) {
int x; scanf("%d",&x);
if (px[x]) { puts("0"); return 0; }
px[x]=1;
}
for (int j=1;j<=m;j++) {
int y; scanf("%d",&y);
if (py[y]) { puts("0"); return 0; }
py[y]=1;
}
LL ans=1,usedN=0,usedM=0;
for (LL i=n*m;i;i--) {
if (px[i] && py[i]) { usedN++; usedM++; continue; }
if (px[i]) { usedN++; ans=(ans*usedM)%MOD; }
if (py[i]) { usedM++; ans=(ans*usedN)%MOD; }
if (!px[i] && !py[i]) ans=(ans*(usedN*usedM-(n*m-i)))%MOD;
}
cout<<ans;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define N 100
#define INF 1000000
int main(){
int n, tmp, p[N + 1], dp[N + 1][N + 1];
cin >> n;
for(int i = 1 ; i <= n ; i++){
cin >> p[i-1] >> p[i];
}
for(int i = 1 ; i <= n ; i++){
dp[i][i] = 0;
}
for(int l = 2 ; l <= n ; l++){ //l = ???????????????????????????????????????
for(int i = 1 ; i <= n - l + 1 ; i++){
int j = i + l - 1;
dp[i][j] = INF;
for(int k = i ; k <= j - 1 ; k++){
tmp = dp[i][k] + dp[k + 1][j] + p[i - 1] * p[k] * p[j];
if(dp[i][j] > tmp) dp[i][j] = tmp;
else dp[i][j] = dp[i][j];
}
}
}
cout << dp[1][n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353;
int main(){
int N, T;
cin >> N >> T;
vector<iint> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first >> A[i].second;
}
sort(ALL(A));
vector<vector<int>> dp(N+1, vector<int>(T));
int ans = 0;
for (int i = 0; i < N+1; i++) {
dp[i][0] = 0;
}
for (int i = 0; i < T; i++) {
dp[0][i] = 0;
}
for (int n = 1; n < N+1; n++) {
for (int t = 1; t < T; t++) {
if(t - A[n-1].first >= 0){
dp[n][t] = max(dp[n-1][t], dp[n-1][t-A[n-1].first] + A[n-1].second);
}
else{
dp[n][t] = dp[n-1][t];
}
}
for (int t = T; t < T+A[n-1].first; t++) {
if(t - A[n-1].first >= 0){
ans = max(ans, dp[n-1][t-A[n-1].first] + A[n-1].second);
}
}
}
printf("%d\n", ans);
} | 0 |
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void)
{
int students_number;
int pm[10000], pe[10000], pj[10000];
scanf("%d", &students_number);
while (1) {
if (students_number == 0) {
break;
} else {
for (int i = 0; i < students_number; ++i) {
scanf("%d %d %d", &pm[i], &pe[i], &pj[i]);
}
for (int i = 0; i < students_number; ++i) {
dividing(pm[i], pe[i], pj[i]);
}
scanf("%d", &students_number);
}
}
return 0;
}
void dividing(int pm, int pe, int pj)
{
char rank;
if (pm == 100 || pe == 100 || pj == 100) {
rank = 'A';
} else if (pm + pe >= 90 * 2) {
rank = 'A';
} else if (pm + pe + pj >= 80 * 3) {
rank = 'A';
} else if (pm + pe + pj >= 70 * 3) {
rank = 'B';
} else if (pm + pe + pj >= 50 * 3 && (pm >= 80 || pe >= 80)) {
rank = 'B';
} else {
rank = 'C';
}
printf("%c\n", rank);
} | #include <stdio.h>
int main(void){
int n;
int pm, pe, pj;
double avr;
while (scanf("%d", &n), n){
for (int i=0; i<n; i++){
scanf("%d %d %d", &pm, &pe, &pj);
avr = (pm+pe+pj)/3.;
if (pm==100 || pe==100 || pj==100){
puts("A");
} else if (pm+pe >= 180){
puts("A");
} else if (avr>=80){
puts("A");
} else if (avr >= 70){
puts("B");
} else if (avr >= 50 && (pm>=80 || pe >= 80)){
puts("B");
} else {
puts("C");
}
}
}
return 0;
}
| 1 |
#include <stdio.h>
void merge(int *,int,int,int);
void mergesort(int*,int,int);
long long cnt=0;
int L[100002],R[100002];
int main(){
int A[200000],i,n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&A[i]);
mergesort(A,0,n);
printf("%ld\n",cnt);
return 0;
}
void merge(int *a,int left,int mid,int right){
int i,k,j,n1=mid-left,n2=right-mid;
for(i=0;i<n1;i++){
L[i]=a[left+i];
}
for(i=0;i<n2;i++){
R[i]=a[mid+i];
}
L[n1]=2147483647;
R[n2]=2147483647;
i=0;
j=0;
for(k=left;k<right;k++){
if(L[i]<=R[j])a[k]=L[i++];
else{
a[k]=R[j++];
cnt+=n1-i;
}
}
return;
}
void mergesort(int *a,int left,int right){
int mid;
if(left+1<right){
mid=(left+right)/2;
mergesort(a,left,mid);
mergesort(a,mid,right);
merge(a,left,mid,right);
}
else return;
}
| #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repq(i,a,n) for(int i=a; i<=n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
// Binary Indexed Tree (BIT)
// Verified: AOJ DSL_2_B: Range Sum Query (int??????)
template <typename T>
struct BIT{
private:
vector<T> array;
const int n;
public:
// ?????????
BIT(int _n) : array(_n + 1, 0), n(_n) {}
// 1???????????? i???????????§????´???????????±???????
T sum(int i) {
T s = 0;
while(i > 0) {
s += array[i];
i -= i & -i; // LSB ??????
}
return s;
}
// [i, j] ???????´??????????
T sum(int i, int j) {
T ret_i = sum(i-1);
T ret_j = sum(j);
return ret_j - ret_i;
}
// i ????????? ????´? x ?????????
void add(int i, T x) {
while(i <= n) {
array[i] += x;
i += i & -i; // LSB ??????
}
}
};
signed main() {
int n; cin >> n;
BIT<int> b(n);
vector<int> a(n);
map<int, int> m;
rep(i,0,n) {
cin >> a[i];
m[a[i]];
}
int newnum = 1;
for(auto &x : m) x.second = newnum++;
rep(i,0,n) a[i] = m[a[i]];
int ans = 0;
rep(j,0,n) {
ans += j - b.sum(a[j]);
b.add(a[j], 1);
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#include<vector>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int mod=1e9+7;
int main(){
IOS;
int n,dr;
cin>>n>>dr;
if(n>=10)
cout<<dr;
else
cout<<dr+100*(10-n);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " << var << endl
const ll mod = 1000000007;
int main(){
int n;
cin >> n;
if (n==1) {
cout << "Hello World" << endl;
return 0;
}
int a, b;
cin >> a >> b;
int ans = a + b;
cerr << ans << endl;
cout << ans << endl;
return 0;
}
| 0 |
//j
#include <stdio.h>
int main ()
{
int step= 0;
int a, b, c;
scanf ("%d %d %d", &a, &b, &c);
if (a<b)
{
for (int i=1; i <= a; i++)
{
if (b*i >= c)
{
printf ("%d", i);
return 0;
}
}
}
if (b<a)
{
for (int j=1; j <= b; j++)
{
if (a*j >= c)
{
printf ("%d", j);
return 0;
}
}
}
if (b=a)
{
for (int k=1; k <= b; k++)
{
if (a*k >= c)
{
printf ("%d",k);
return 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
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);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
char toLowerCase(char c){
if(isLowerCase(c)){
return c;
}else{
return c+'a'-'A';
}
}
char toUpperCase(char c){
if(isLowerCase(c)){
return c-('a'-'A');
}else{
return c;
}
}
ll powm(ll a,ll n, ll m){
ll ret=1;
while(n>0){
if(n%2==1){
ret=(ret*a)%m;
}
n>>=1;
a=(a*a)%m;
}
return ret;
}
const string yesno(bool ans){
return (ans?"Yes":"No");
}
void func(vector<int>& l, int depth, int idx){
;
}
int main() {
int h,w,n;cin>>h>>w>>n;
int val=max(h,w);
int ans=(n+val-1)/val;
cout<<ans<<endl;
return 0;
}
| 1 |
// This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
if(neg)x=-x;return true;
}
template<typename T> void print_int(T x)
{
if(x<0)putchar('-'),x=-x;
short a[20]= {},sz=0;
while(x>0)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) (get1(a)&&get1(b))
#define get3(a,b,c) (get1(a)&&get2(b,c))
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);
const int maxn=100111;
int n,s,x[maxn];
LL p[maxn],ans;
int calc(int l,int r)
{
if(x[r]<s)
{
ans+=s-x[l];
return l;
}
if(x[l]>s)
{
ans+=x[r]-s;
return r;
}
if(p[l]>=p[r])
{
p[l]+=p[r];
ans+=x[r]-x[calc(l,r-1)];
return r;
}
else
{
p[r]+=p[l];
ans+=x[calc(l+1,r)]-x[l];
return l;
}
}
int main()
{
get2(n,s);
for(int i=1;i<=n;i++)get2(x[i],p[i]);
calc(1,n);
printendl(ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define N 1000100
ll n,s,ans,x[N],p[N];
using namespace std;
int main(){
scanf("%lld%lld",&n,&s);
for (ll i=1;i<=n;i++) scanf("%lld%lld",&x[i],&p[i]);
for (ll l=1,r=n;l<=r;){
if (x[l]>=s){ans+=x[r]-s; break;}//所有人都在一边直接开过去
if (x[r]<=s){ans+=s-x[l]; break;}
ans+=x[r]-x[l]; //每次来回开一趟
if (p[l]>=p[r])
while (l<r && p[l]>=p[r]) p[l]+=p[r],r--;//相同往左开
else while (l<r && p[l]<p[r]) p[r]+=p[l],l++;
}
printf("%lld\n",ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<" ";
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
double a[n];
double num=1e9,sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
sum/=n;
for(int i=0;i<n;i++){
num=min(num,abs(a[i]-sum));
}
for(int i=0;i<n;i++){
if(abs(sum-a[i])==num){
cout<<i<<endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
int main() {
ll n;
cin >> n;
vector<vll> a(n, vll(2));
long double avg = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i][0];
avg += a[i][0];
a[i][1] = i;
}
avg /= n;
ll m = -1;
sort(all(a));
for (ll i = 0; i < n; i++) {
if (a[i][0] == avg) {
cout << a[i][1] << endl;
return 0;
}
if (a[i][0] > avg) {
while (i > 0 && a[i][0] == a[i - 1][0]) i--;
m = i;
break;
}
}
if (m == 0) {
cout << a[m][1] << endl;
return 0;
}
ll x = m - 1;
while (x > 0 && a[x][0] == a[x - 1][0]) x--;
//cout << a[m][0] - avg << " " << avg - a[x][0] << endl;
if (a[m][0] - avg > avg - a[x][0]) cout << a[x][1] << endl;
else if (a[m][0] - avg < avg - a[x][0]) cout << a[m][1] << endl;
else {
cout << min(a[x][1], a[m][1]) << endl;
}
} | 1 |
#include <stdio.h>
int main(void)
{
int a[1010];
int b[1010];
int t[1010];
int ans[1010];
int i=0;
int j=0;
int n=0;
a[0] = 1;
for(;;)
{
scanf("%d",&t[j]);
if(t[j]==0)
{
break;
}
j++;
}
a[1]=1;
a[2]=2;
a[3]=4;
for(i=4;i<1010;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
ans[i]=a[i]/3650;
}
int k,unk;
for(k=0;k<j;k++)
{
printf("%d\n",ans[t[k]]+1);
}
} | #include <bits/stdc++.h>
#define DICE_SIZE 6
using namespace std;
class Dice {
private:
int number[DICE_SIZE];
int work_space[DICE_SIZE];
void reset_number(int, int, int, int, int, int);
public:
Dice(int *);
void turn(char);
int peek_top();
};
Dice::Dice(int *number) {
for (int i = 0; i < DICE_SIZE; i++) {
this->number[i] = number[i];
}
}
void Dice::turn(char direction) {
for (int i = 0; i < DICE_SIZE; i++) work_space[i] = number[i];
switch (direction) {
case 'N':
reset_number(work_space[1], work_space[5], work_space[2], work_space[3], work_space[0], work_space[4]);
break;
case 'E':
reset_number(work_space[3], work_space[1], work_space[0], work_space[5], work_space[4], work_space[2]);
break;
case 'S':
reset_number(work_space[4], work_space[0], work_space[2], work_space[3], work_space[5], work_space[1]);
break;
case 'W':
reset_number(work_space[2], work_space[1], work_space[5], work_space[0], work_space[4], work_space[3]);
break;
}
}
int Dice::peek_top() {
return number[0];
}
void Dice::reset_number(int num0, int num1, int num2, int num3, int num4, int num5) {
number[0] = num0;
number[1] = num1;
number[2] = num2;
number[3] = num3;
number[4] = num4;
number[5] = num5;
}
int main() {
int number[DICE_SIZE];
for (int i = 0; i < DICE_SIZE; i++) cin >> number[i];
Dice *dice = new Dice(number);
string query;
cin >> query;
for (int i = 0; i < query.size(); i++) dice->turn(query[i]);
cout << dice->peek_top() << endl;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 999999999
#define pa pair<int,int>
using namespace std;
int n,a[200][200]={0};
void prim(){
int d[200]={0};
priority_queue<pair<int,pa> > PQ;
pair<int,pa> q;
pa r;
int wei=0;
int w=6;
int u=w,z=0;
d[w]=1;
while(z!=n-1){
for(int j=n-1;j>-1;j--){
if(a[u][j]<=0 && d[j]==0 && u!=j) PQ.push(make_pair(a[u][j],make_pair(u,j)));
}
while(1){
if(PQ.size()==0) {
cout<<"dv"<<endl;
break;
}
q=PQ.top();
PQ.pop();
r=q.second;
// cout<<"rsec"<<r.second<<endl;
if(d[r.second]==0) break;
}
u=r.second;
// cout<<"a" <<u<<endl;
d[u]=1;
wei=wei+q.first;
z++;
// cout<<z<<" "<<-q.first<<" "<<u<<" "<<r.first<<endl;
}
cout<<-wei<<endl;
}
int main(){
// your code goes here
int m;
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>m;
a[i][j]=-m;
}
}
prim();
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int P[10010];
void init(int N);
int root(int a);
bool is_same_set(int a,int b);
void unite(int a,int b);
struct Node {
int cost,start,goal;
bool operator<( const Node& right ) const {
return cost == right.cost ? start < right.start : cost < right.cost;
}
};
vector<Node> Nodes;
int main() {
int N;
cin >> N;
for (int i=0;i<N;++i) {
for (int j=0;j<N;++j) {
int buf;
cin >> buf;
if (buf!=-1) {
Node bufNode = {buf,i,j};
Nodes.push_back(bufNode);
}
}
}
sort(Nodes.begin(),Nodes.end());
init(N); int totalCost = 0;
for (int i=0;i<Nodes.size();++i) {
if (is_same_set(Nodes[i].start,Nodes[i].goal)==false) {
unite(Nodes[i].start,Nodes[i].goal);
totalCost += Nodes[i].cost;
}
}
cout << totalCost << endl;
}
void init(int N) {
for (int i=0;i<=N;++i) P[i] = i;
}
int root(int a) {
if (P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a,int b) {
return root(a)==root(b);
}
void unite(int a,int b) {
P[root(a)] = root(b);
} | 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b; string s;
cin >> a >> b >> s;
bool flag = true;
rep(i,0,a) {
if (s[i] == '-') {
flag = false;
}
}
if (s[a] != '-') {
flag = false;
}
rep(i,a+1,a+b+1) {
if (s[i] == '-') {
flag = false;
}
}
if (flag) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, S;
cin >> A >> B >> S;
cout << ((regex_match(S, regex("\\d{" + A + "}-\\d{" + B + "}"))) ? "Yes" : "No") << "\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll l, r; cin >> l >> r;
if(r - l >= 2019)
{
cout << '0' << endl;
return 0;
}
ll ans = 2020;
for(ll i = l; i <= r; i++)for(ll j = i+1; j <= r; j++){
if(i * j % 2019 < ans) ans = i * j % 2019;
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
#define pll pair<int , int>
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define pii 3.14159265358979323
#define inf LLONG_MAX
#define ones(x) __builtin_popcount(x)
#define fill(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
#define hell 998244353
ll mod_pow(ll a,ll b,ll m)
{
ll res = 1;
while(b)
{
if(b&1)
{
res=(res*a) % m;
}
a=(a*a) % m;
b>>=1;
}
return res;
}
ll mod_inverse(ll a)
{
return mod_pow(a , mod-2 , mod);
}
void solve()
{
int l , r;
cin >> l >> r;
int lol = 2019;
int ans = inf;
for(int i = 1; i <= 2019; ++i) {
int num = (l/2019)*2019;
num += i;
if(num < l) {
num += 2019;
}
//cout << num << endl;
if(num > r) {
continue;
}
for(int j = 1; j <= 2019; ++j) {
int tm;
if(i == j) {
tm = num + 2019;
}
else {
tm = (l/2019)*2019;
tm += j;
if(tm < l) {
tm += 2019;
}
}
if(num >= l && num <= r && tm >= l && tm <= r) {
ans = min(ans , (num*tm)%2019);
}
}
}
cout << ans;
}
signed main() {
fast;
int t = 1;
//cin >> t;
while(t--) {
solve();
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////
int digit[50];
void solve(){
int n;
cin >> n;
if(n==0){
print(0);
return;
}
bool plus=true;
if(n<0) {
plus=false;
n=-n;
}
int ctr=0;
while(n>0){
if(n&1){
digit[ctr]=1;
}
ctr++;
n/=2;
}
if(plus){
for(ll i=ctr-1; i>0; i--){
if(i&1){
if(digit[i]==1) digit[i+1]++;
}
}
repi(i,1,45){
while(digit[i]>1){
digit[i+1]++;
digit[i+2]++;
digit[i]-=2;
}
}
}
else{
for(ll i=ctr-1; i>=0; i--){
if(i%2==0){
if(digit[i]==1) digit[i+1]++;
}
}
repi(i,1,45){
while(digit[i]>1){
digit[i+1]++;
digit[i+2]++;
digit[i]-=2;
}
}
}
bool start=false;
for(ll i=38;i>=0;i--){
if(!start&&digit[i]==0) continue;
if(!start&&digit[i]==1){
start=true;
cout << digit[i];
continue;
}
cout << digit[i];
}
cout << endl;
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=10007;
int main() {
int N;
cin>>N;
string t;
int x=N;
if(x==0){cout<<0<<endl;return 0;}
while(x){
int a=x%(-2);
if(a<0){a+=2;x-=2;}
t.push_back(a+'0');
x/=(-2);
}
reverse(t.begin(),t.end());
cout<<t<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end(), greater<int>());
int ans = 0;
rep(i, k) ans += l[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
ll gcd(ll a, ll b){
ll r,temp;
if (a < b){
temp = a;
a = b;
b = temp;
}
while ( (r = a % b) != 0){
a = b;
b = r;
}
return b;
}
int main(){
ll N,K;
cin >> N >> K;
vector<ll> A(N);
rep(i,N) cin >> A[i];
sort(all(A));
ll gcd_num = A[0];
rep(i,N) gcd_num = gcd(gcd_num, A[i]);
bool possible = true;
if (A[N - 1] < K) possible = false;
if (K % gcd_num != 0) possible = false;
if (possible) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5,inf=1e10;
ll n,ans;
pair<ll,ll> prfx[N],sfx[N],a[N];
inline pair<ll,ll> inter(pair<ll,ll> u,pair<ll,ll> v){
pair<ll,ll> range = make_pair( max(v.first,u.first) , min(v.second,u.second) );
range.second = max(range.first,range.second);
return range;
}
inline void relax(pair<ll,ll> v,pair<ll,ll> u){
ans = max(ans , v.second - v.first + u.second - u.first);
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin>>n;
for(ll i=0;i<n;i++)cin>>a[i].first>>a[i].second,a[i].second++;
sort(a,a+n);
prfx[0]=make_pair(0,inf);
for(ll i=0;i<n;i++)prfx[i+1]=inter(prfx[i],a[i]);
sfx[n]=make_pair(0,inf);
for(ll i=n-1;i>=0;i--)sfx[i]=inter(sfx[i+1],a[i]);
for(ll i=0;i<n;i++)relax(a[i],inter(prfx[i],sfx[i+1]));
for(ll i=1;i<n;i++)relax(prfx[i],sfx[i]);
cout<<ans;
}
| //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define mem(a,v) memset((a), (v), sizeof (a))
#define endl "\n"
#define case(t) cout << "Case #" << (t) << ": "
#define reada(a, n) for (int _i = 0; _i < (n); _i++) read(a[_i])
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;
template<class T> void read(T& x) { cin >> x; }
template<class X, class Y> void read(pair<X,Y>& a) { read(a.first), read(a.second); }
template<class T> void read(vector<T>& x) { trav(y, x) read(y); }
template<class T, class... O> void read(T& x, O&... y) { read(x), read(y...); }
string to_string(const char& x) { return string(1,x); }
string to_string(const char*& x) { return (string)x; }
string to_string(const string& x) { return x; }
template<class T, class U> string to_string(const pair<T,U>& x) { return to_string(x.first) + " " + to_string(x.second); }
template<class T> string to_string(const vector<T>& x) { string ret = ""; bool f = 0; trav(y, x) ret += (!f ? "" : " ") + to_string(y), f = 1; return ret; }
void print() { cout << endl; }
template<class T> void pr(const T& x) { cout << to_string(x); }
template<class T, class... O> void print(const T& x, const O&... y) { pr(x); if (sizeof...(y)) pr(" "); print(y...); }
int main() {
FIO
int n; read(n);
vector<pair<int,int>> a(n); read(a);
sort(all(a), [](pii l, pii r) { return (l.first != r.first) ? l.first < r.first : l.second < r.second; });
vector<pair<int,int>> b;
for (auto x: a) {
while (sz(b) && b.back().first <= x.first && x.second <= b.back().second)
b.pop_back();
b.push_back(x);
}
int ans = 0;
for (int i = 0; i+1 < sz(b); i++)
ans = max(ans, max(0, b[0].second - b[i].first + 1) + max(0, b[i+1].second - b.back().first + 1));
sort(all(a), [](pii l, pii r) { return l.second - l.first == r.second - r.first ? l.first < r.first : l.second - l.first > r.second - r.first; });
int i = 0;
for (; i+1 < n && a[0] == a[i]; i++);
int val = a[0].second - a[0].first + 1;
int lo = 0, hi = inf;
for (; i < n; i++)
lo = max(lo, a[i].first), hi = min(hi, a[i].second);
val += max(0, hi - lo + 1);
sort(all(a), [](pii l, pii r) { return l.second - l.first == r.second - r.first ? l.first > r.first : l.second - l.first > r.second - r.first; });
i = 0;
for (; i+1 < n && a[0] == a[i]; i++);
lo = 0, hi = inf;
for (; i < n; i++)
lo = max(lo, a[i].first), hi = min(hi, a[i].second);
val = max(val, a[0].second - a[0].first + 1 + max(0, hi - lo + 1));
print(max(val, ans));
return 0;
}
| 1 |
using namespace std;
#include <bits/stdc++.h>
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a<=b){
if(d<=c){
std::cout << a+d << std::endl;
}
else {
std::cout << a+c << std::endl;
}
}
else{
if(c<=d){
std::cout << b+c << std::endl;
}
else{
std::cout << b+d << std::endl;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>A,B;
for(int i=0;i<2;i++){
int a;
cin >> a;
A.push_back(a);
}
for(int i=0;i<2;i++){
int b;
cin >> b;
B.push_back(b);
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
cout << A.at(0) + B.at(0) << '\n';
return 0;
} | 1 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
typedef long long int lli;
typedef pair<int,int> mp;
typedef pair<int,mp> mmp;
#define fir first
#define sec second
struct unifo{
int un;
int uni[100005];
void init(int n){
rep(i,n)uni[i]=i;
un=n;
}
int find(int p){
if(uni[p]==p)return p;
else return (uni[p]=find(uni[p]));
}
void mer(int p,int q){
uni[find(p)]=find(q);
}
bool same(int p,int q){
return find(p)==find(q);
}
};
int kruskal(int n,vector<mmp>& es){
unifo u;
u.init(n);
sort(es.begin(),es.end());
int res=0;
rep(i,es.size()){
mmp pa=es[i];
int a=pa.sec.fir,
b=pa.sec.sec,
c=pa.fir;
if(!u.same(a,b)){
res+=c;
u.mer(a,b);
}
}
return res;
}
int n,m;
//vector<mp> vs[105];
vector<mmp> es;
int main(void){
int n,m;
scanf("%d%d",&n,&m);
rep(i,m){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
//vs[a].push_back(mp(b,c));
//vs[b].push_back(mp(a,c));
es.push_back(mmp(c,mp(a,b)));
}
printf("%d\n",kruskal(n,es));
return 0;
} | //*********************************************************************************************************************************
//* **
//* SSSSSSSSSSSS MMMM MMMM HHHH HHHH DDDDDDDDDDDD **
//* SSSSSSSSSSSS CSAA Numbered MMMMM MMMMM HHHH HHHH DDDDDDDDDDDDD **
//* SSSS A PROGRAM BY: MMMMMM MMMMMM HHHH HHHH DDDD DDDDD **
//* SSSS MMMMMMM MMMMMMM HHHH HHHH DDDD DDDD **
//* SSSSSSSSSSSS AAAAAAAAAAAA MMMMMMMMMMMMMMMMMMMM MMMMMMMM MMMMMMMM HHHHHHHHHHHHHHHH DDDD DDD **
//* SSSSSSSSSSSS AAAAAAAAAAAA MMMMMMMMMMMMMMMMMMMM MMMM MMMM MMMM MMMM HHHHHHHHHHHHHHHH DDDD DDD **
//* SSSS AAAA AAAA MMMM MMMM MMMM MMMM MMMMMMMM MMMM HHHH HHHH DDDD DDDD **
//* SSSS AAAA AAAA MMMM MMMM MMMM MMMM MMMMMM MMMM HHHH HHHH DDDD DDDD **
//* SSSSSSSSSSSS AAAAAAAAAAAAA MMMM MMMM MMMM MMMM MMMM MMMM HHHH HHHH DDDDDDDDDDDDD **
//* SSSSSSSSSSSS AAAAAAAAAAAAAA MMMM MMMM MMMM MMMM MMMM HHHH HHHH DDDDDDDDDDDD **
//* **
//********************************************************************************************************************************
//|| ||
//|| CSAA AA###B ddmmYYYY ||
//|| ?? SMP(SAM-MHD-PGM) @ AEH_COT96 ||
//|| Program Name: ||
//|| AA###B_<xxxxNAMExxxx> ||
//|| ||
/////******************************************\\
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 1e4+3;
const int oo = 3e7+3;
typedef pair <int, int> pii;
vector <pii> G[maxn];
vector <pii> ans;
bool used[maxn]; // Already in MST
long long pim [maxn]; // Partner in MST
long long mdti[maxn]; // Min_dis to MST :: Minimal Distance to Include
long long n, m;
long long ansvalue;
bool MST(){
fill_n(mdti, n, oo);
fill_n(pim, n, -1);
fill_n(used, n, false);
mdti[0] = 0;
for (int i = 0; i < n; i++) {
int v = -1;
for (int j=0; j<n; j++)
if ( !used[j] && (v == -1 || mdti[j] < mdti[v]))
v = j;
// if (mdti[v] == oo)
// return false;
used[v] = true;
if (pim[v] != -1){
ans.push_back ( make_pair( pim[v], v ) );
ansvalue += mdti[v];
}
for (int j = 0; j < G[v].size(); j++)
if ( G[v][j].second < mdti[ G[v][j].first ] ) {
mdti[ G[v][j].first ] = G[v][j].second;
pim [ G[v][j].first ] = v;
}
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b, w;
cin >> a >> b >> w;
G [a].push_back( make_pair( b, w) );
G [b].push_back( make_pair( a, w) );
}
// if (MST())
// for (pii e : ans)
// cout << e.first << " " << e.second << endl;
// else cout << -1;
if (MST())
cout << ansvalue << endl;
}
/**/
// ?? SMP(SAM-MHD-PGM) @ AEH_COT96
// SamMHD (Saman Mahdanian) | 1 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
int main() {
double R;
double pi = M_PI;
cin >> R;
double ans = 2 * R * pi;
cout << ans << endl;
return 0;
} | 1 |
#include<stdio.h>
#include<limits.h>
#define NIL -1
static const int MAX = 500;
static const int INFTY = (1<<21);
int n, i, j, e, v, sum, u , minV;
main(){
int M[MAX][MAX], key[MAX], L[MAX],A[MAX];
scanf("%d", &n);
for ( i = 0; i< n; i++ ){
for ( j = 0; j < n; j++ ){
scanf("%d", &e);
M[i][j] = (e==-1)?INFTY:e;
}
}
for(i = 0; i < n; i++){
key[i] = INT_MAX;
L[i] = NIL;
A[i] = NIL;
}
key[0]=0;
for(;;){
u = NIL;
minV = INT_MAX;
for(i = 0; i < n; i++){
if(key[i] < minV && A[i] == NIL){
u = i;
minV = key[i];
}
}
if(u == NIL)break;
A[u] = u;
for(v = 0; v < n; v++){
if(M[u][v] < key[v] && A[v] == NIL){
key[v] = M[u][v];
L[v] = u;
}
}
}
sum = 0;
for ( i = 0; i < n; i++ ){
if ( L[i] != -1 ) sum +=M[L[i]][i];
}
printf("%d\n", sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてからつかうこと
constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int intceil(int a, int b) {
return (a + (b - 1)) / b;
}
signed main() {
cin >> N;
vi a(N);
cin >> a;
map<int, int> mp;
vector<ll> v;
REP(i, N) {
int x = ++mp[a[i]];
if ((x & 1) == 0) {
v.push_back(a[i]);
}
}
sort(v.rbegin(), v.rend());
if (v.size() >= 2)
cout << (ll)v[0] * (ll)v[1] << endl;
else
cout << 0 << endl;
} | 0 |
#include <stdio.h>
int main (){
char all[20];
scanf("%s", all);
all[0] = '2';
all[1] = '0';
all[2] = '1';
all[3] = '8';
printf("%s", all);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod)
{
a %= _mod; b %= _mod; ll res = 1;
switch (op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break;
}
if (res < 0) { res += _mod; } return res;
}
int main()
{
string S;
cin >> S;
if (len(S) == 2) {
cout << S << endl;
} else {
reverse(all(S));
cout << S << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define INF INT_MAX/3
#define BV_SIZE 64ULL // 64bit
#define MAX_BV_NUM 100 // m <= 100*64 = 6400
unsigned long long Peq[MAX_BV_NUM][0x100];
int levenshteinDistance(string a,string b) {
int m=a.size(),n=b.size();
int num_of_bv = (m + BV_SIZE -1) / BV_SIZE;
for (int i = 0; i < m; i++) {
Peq[i / BV_SIZE][a[i]] |= 1ULL << ((unsigned long long)i % BV_SIZE);
}
int score = m;
unsigned long long Pv[MAX_BV_NUM], Mv[MAX_BV_NUM], Ph[MAX_BV_NUM], Mh[MAX_BV_NUM], Xv[MAX_BV_NUM], Xh[MAX_BV_NUM], Eq[MAX_BV_NUM], Xt[MAX_BV_NUM], Xa[MAX_BV_NUM];
unsigned long long top = 1ULL << (((unsigned long long)m - 1ULL) % BV_SIZE);
for(int i = 0; i < num_of_bv; i++) {
Pv[i] = ~0ULL; Mv[i] = 0ULL;
}
for (int j = 0; j < n; j++) {
for(int i = 0; i < num_of_bv; i++){
Eq[i] = Peq[i][b[j]];
Xv[i] = Eq[i] | Mv[i];
Xt[i] = Eq[i] & Pv[i];
}
unsigned long long carry = 0ULL;
for(int i = 0; i < num_of_bv; i++){
Xa[i] = Xt[i] + Pv[i] + carry;
if(Xt[i] == ~0ULL && carry == 1ULL){
carry = 1ULL;
}else{
unsigned long long cXt = Xt[i] + carry;
carry = (((cXt & Pv[i]) | ((cXt | Pv[i]) & ( ~ (cXt + Pv[i]) ))) >> 63ULL) & 1ULL;
}
}
for(int i = 0; i < num_of_bv; i++){
Xh[i] = (Xa[i] ^ Pv[i]) | Eq[i];
Ph[i] = Mv[i] | ( ~ (Xh[i] | Pv[i]) );
Mh[i] = Pv[i] & Xh[i];
}
if((Ph[num_of_bv - 1] & top) != 0ULL)score++;
else if((Mh[num_of_bv - 1] & top) != 0ULL)score--;
unsigned long long Ph_carry = 1ULL;
unsigned long long Mh_carry = 0ULL;
for(int i = 0; i < num_of_bv; i++){
unsigned long long nxt_Ph_carry = (Ph[i] >> 63ULL) & 1ULL;
Ph[i] = (Ph[i] << 1ULL) | Ph_carry;
Ph_carry = nxt_Ph_carry;
unsigned long long nxt_Mh_carry = (Mh[i] >> 63ULL) & 1ULL;
Pv[i] = ((Mh[i] << 1ULL) | Mh_carry ) | ( ~ (Xv[i] | Ph[i]) );
Mh_carry = nxt_Mh_carry;
Mv[i] = Ph[i] & Xv[i];
}
}
return score;
}
int main(){
string a,b;
cin>>a>>b;
cout<<levenshteinDistance(a,b)<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,N) for(int i = 0; i<(int)(N); i++)
#define REP(i,k,N) for(int i = k; i<(int)(N); i++)
#define INF 10000000
typedef long long ll;
using namespace std;
const int MAX_N = 1001;
int d[MAX_N][MAX_N];
int main(){
string ch1,ch2;
cin >> ch1;
cin >> ch2;
rep(y,ch1.size()+1) rep(x,ch2.size()+1){
if(y==0) {d[y][x]=x; continue;}
if(x==0) {d[y][x]=y; continue;}
int m_l_u = min(d[y-1][x]+1,d[y][x-1]+1);
if(ch1[y-1] == ch2[x-1]) {
d[y][x] = min(m_l_u,d[y-1][x-1]);
}else{
d[y][x] = min(m_l_u,d[y-1][x-1]+1);
}
}
cout << d[ch1.size()][ch2.size()] << endl;
return 0;
}
| 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <ctime>
#include<unordered_set>
#include<complex>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;
const int MAX = 100 + 47;
string s;
int ROW[MAX][MAX];
int COL[MAX][MAX];
int dp[3][MAX][MAX][MAX];
void Max(int& key, int val)
{
key = max(key, val);
}
int getCol(int col, int i, int j)
{
if (i > j) return 0;
int res = COL[j][col];
if (i) res -= COL[i - 1][col];
return res;
}
int getRow(int row, int i, int j)
{
if (i > j) return 0;
int res = ROW[row][j];
if (i) res -= ROW[row][i - 1];
return res;
}
int main()
{
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
ios::sync_with_stdio(false); cin.tie(0);
int h, w, x, y;
cin >> h >> w;
FOR(i, 0, h)
{
cin >> s;
FOR(j, 0, SZ(s))
{
if (s[j] == 'o')
{
COL[i][j] = 1;
ROW[i][j] = 1;
}
if (j) ROW[i][j] += ROW[i][j - 1];
if (i) COL[i][j] += COL[i - 1][j];
if (s[j] == 'E')
{
x = i;
y = j;
}
}
}
FILL(dp, -1);
dp[0][0][0][0] = 0;
int ans = 0;
int C = 0;
int N = 1;
//cout << w << ""
//cout << x << " " << y << endl;
FOR(L, 0, w + 1)
{
FOR(R, 0, w + 1)
{
FOR(U, 0, h + 1)
{
FOR(D, 0, h + 1)
{
//cout << L << " " << R << " " << U << " " << D << endl;
if (dp[C][R][U][D] == -1) continue;
//cout << L << " " << R << " " << U << " " << D << ": " << dp[C][R][U][D] << endl;
ans = max(ans, dp[C][R][U][D]);
{
int l = max(R, y - L);
int r = min(y + R, w - 1 - L);
if (h - 1 - x - U - D > 0)
{
Max(dp[C][R][U][D + 1], dp[C][R][U][D] + getRow(x + D + 1, l, r));
}
if (x - D - U > 0)
{
//cout << "*" << endl;
Max(dp[C][R][U + 1][D], dp[C][R][U][D] + getRow(x - U - 1, l, r));
//cout << dp[C][R][U + 1][D] << endl;
}
}
{
int l = max(D, x - U);
int r = min(x + D, h - 1 - U);
if (w - 1 - y - L - R > 0)
{
Max(dp[C][R + 1][U][D], dp[C][R][U][D] + getCol(y + R + 1, l, r));
}
if (y - L - R > 0)
{
Max(dp[N][R][U][D], dp[C][R][U][D] + getCol(y - L - 1, l, r));
}
}
}
}
}
swap(C, N);
FOR(R, 0, w + 1)
{
FOR(U, 0, h + 1)
{
FOR(D, 0, h + 1)
{
dp[N][R][U][D] = -1;
}
}
}
}
//FOR(L, 0, y + 1)
//{
// FOR(R, 0, w - y)
// {
// FOR(U, 0, x + 1)
// {
// FOR(D, 0, h - x)
// {
// cout << L << " " << R << " " << U << " " << D << ": " << dp[L][R][U][D] << endl;
// }
// }
// }
//}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll dp[n+1][6];
ll INF = 1e18;
rep(i, n+1) rep(j, 3) dp[i][j] = -INF;
rep(i, 3) if(i < n) dp[i][i] = a[i];
rep(i, n) rep(j, 3){
for(int d = 0; j + d < 3; d++){
int bef = i - 2 - d;
if(bef < 0) continue;
chmax(dp[i][j+d], dp[bef][j] + a[i]);
}
}
ll ans = -INF;
int d = 1 + n%2;
rep(i, d+1){
int j = n - 1 - i;
if(j >= 0) chmax(ans, dp[j][d - i]);
}
cout << ans << endl;
}
| 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;
}
| #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
// 距離でやると困る
int main(){
int N;
cin >> N;
int a[N], b[N], c[N], d[N];
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
for(int i=0; i<N; i++) cin >> c[i] >> d[i];
P rl[N];
for(int i=0; i<N; i++){
rl[i] = P(c[i], d[i]);
}
sort(rl, rl+N);
int cnt = 0;
bool used[N];
fill(used, used+N, false);
for(int i=0; i<N; i++){
int rx = rl[i].first;
int ry = rl[i].second;
int mx = -1;
int ind = -1;
for(int j=0; j<N; j++){
if(used[j]) continue;
if(i == j) continue;
if(rx <= a[j] || ry <= b[j]) continue;
if(mx < b[j]){
mx = b[j];
ind = j;
}
}
if(ind != -1){
cnt++;
used[ind] = true;
// cout << i << " " << ind << endl;
}
}
cout << cnt << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
int main(){
int n,m;cin>>n;
string s;
map<string,int> dic;
for(int i=0;i<n;i++){
cin>>s;
dic[s]++;
}
cin>>m;
for(int i=0;i<m;i++){
cin>>s;
dic[s]--;
}
int ans=0;
for(auto p:dic){
auto v=p.second;
if(v>ans)ans=v;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ll long long
int main() {
int n, k;
cin >> n >> k;
vector<int> x(n);
rep(i, n)
cin >> x[i];
int ans=INT_MAX;
for (int i = 0;i < n - k + 1;++i) {
int l = x[i];
int r = x[i + k - 1];
int m = min(abs(l), abs(r)) + abs(l - r);
ans = min(ans, m);
}
cout << ans << endl;
} | 0 |
#include<iostream>
using namespace std;
int main(){
int m, d, ans, month, i, total = 0;
while(1){
cin >> m >> d;
if (m == 0) break;
for(i = 1; i < m; i ++){
if(i==1||i==3||i==5||i==7||i==8||i==10||i==12){
total += 31;
}
else if(i == 2){
total += 29;
}
else{
total += 30;
}
}
total += d;
ans = total % 7;
switch (ans){
case 1:cout << "Thursday" << endl;
break;
case 2:cout << "Friday" << endl;
break;
case 3:cout << "Saturday" << endl;
break;
case 4:cout << "Sunday" << endl;
break;
case 5:cout << "Monday" << endl;
break;
case 6:cout << "Tuesday" << endl;
break;
case 0:cout << "Wednesday" << endl;
break;
}
ans = 0, total = 0;
}
return 0;
} | #include <stdio.h>
int main(){
int a,i;
long long b,c,d,j;
scanf("%d",&a);
if(a==2){
scanf("%lld %lld",&b,&c);
if(b>c)i=c;
else i=b;
for(j=1;j<=i;j++)if(b%j==0&&c%j==0)printf("%lld\n",j);
}else {
scanf("%lld %lld %lld",&b,&c,&d);
if(b<c&&b<d)i=b;
if(c<b&&c<d)i=c;
if(d<c&&d<b)i=d;
for(j=1;j<=i;j++)if(b%j==0&&c%j==0&&d%j==0)printf("%lld\n",j);
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x,y;
cin>>x>>y;
if(x==0 || y==0){
if(y>x)
cout<<y+abs(x)<<endl;
else
cout<<abs(y)+x+1<<endl;
}else if(x*y>0){
if(x<y)
cout<<y-x<<endl;
else
cout<<x-y+2<<endl;
}else if(x*y<0)
cout<<abs(abs(y)-abs(x))+1<<endl;
} | #include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int x, y;
cin >> x >> y;
// 入力終了
// 1.初めにBを押すか押さないか決める
// 2.Aを0回以上押す
// 3.最後にBを押すか押さないか決める
int firstB[2] = {-1, 1}, secondB[2] = {-1, 1};
int ans = 2000000000;
int tmpx, tmpy;
rep(i, 2){
rep(j, 2){
int tmp = 0;
// 初めにBを押すなら-xを代入，押さないならxを代入
tmpx = x*firstB[i];
if(firstB[i] == -1)
tmp++;
// 最後にBを押すなら-yを代入，押さないならyを代入
tmpy = y*secondB[j];
if(secondB[j] == -1)
tmp++;
// tmpx > tmpyなら，Aを押しても題意を満たさない
if(tmpx > tmpy)
continue;
// tmpxからtmpyまでAを押す
tmp = tmp + tmpy - tmpx;
ans = min(ans, tmp);
}
}
// 解答
cout << ans << endl;
return 0;
}
| 1 |
#pragma GCC optimize ("O3")
#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 << endl;
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int 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 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);
ll N;
cin >> N;
if (N == 0) {
print(0);
return 0;
}
vector<pair<ll, ll>> v;
ll l = 0, r = 0;
ll c = 1;
REP(i, 50) {
v.eb(l, r);
if (l <= N && N <= r) break;
(i % 2 ? l : r) += c;
c *= -2;
}
string S(v.size() - 1, '0');
c /= -2;
REVFOR(i, 1, v.size()) {
if (v[i].fi <= N && N <= v[i].se && (v[i-1].fi > N || v[i-1].se < N)) {
S[i - 1] = '1';
N -= c;
}
c /= -2;
}
reverse(ALL(S));
print(S);
}
| //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
int merge(VI& a, int s1, int s2, int t){
int i, j, res = 0;
VI tmp;
for(i=s1,j=s2;i<s2&&j<t;){
if(a[i] > a[j]){
tmp.PB(a[j++]);
res += s2-s1-(i-s1);
}
else{
tmp.PB(a[i++]);
}
}
while(i<s2) tmp.PB(a[i++]);
while(j<t) tmp.PB(a[j++]);
for(i=s1;i<t;++i)
a[i] = tmp[i-s1];
return res;
}
int sort(VI& a, int s, int t){
if(s+1 >= t) return 0;
int m = (s + t) / 2, res = 0;
res += sort(a, s, m);
res += sort(a, m, t);
res += merge(a, s, m, t);
return res;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N; cin >> N;
VI a(N); REP(i,N) cin >> a[i];
int ans = sort(a, 0, N);
cout << a[0];
REP(i,N-1) cout << " " << a[i+1];
cout << endl;
cout << ans << endl;
return 0;
} | 0 |
#include <cstdio>
#include <cmath>
using namespace std;
int main(void)
{
int h, w;
int h2;
double w2;
for (;;) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0)
return 0;
int z = pow(h, 2) + pow(w, 2);
w2 = sqrt(z);
for(h2 = h+1; h2 < w2; h2++) {
w2 = sqrt(z - pow(h2, 2));
if (w2 == static_cast<int>(w2))
break;
}
if(w2 <= h2) {
z++;
for (int flag = 0; flag == 0; z++) {
for(h2 = 1; pow(h2,2) < z/2; h2++) {
w2 = sqrt(z - pow(h2, 2));
if (w2 == static_cast<int>(w2)) {
flag = 1;
break;
}
}
}
}
printf("%d %d\n", h2, static_cast<int>(w2));
}
} | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<pair<int, pair<int,int>>>v;
for (int i = 1; i <= 150; i++) {
for (int j = i + 1; j <= 150; j++) {
v.push_back({ i*i + j*j ,{i,j} });
}
}
sort(v.begin(), v.end());
cin >> H >> W;
while (H) {
bool flag = false;
for (auto i : v) {
if (flag) {
cout << i.second.first << " " << i.second.second << endl;
break;
}
if (i.second.first == H&&i.second.second == W) {
flag = true;
}
}
cin >> H >> W;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << ": " << x << endl;
#else
#define debug(x)
#endif
int main() {
cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);
string s; cin >> s;
// 長さ2ならXXのみ
if(s.size() == 2) {
if(s[0] == s[1]) cout << 1 << " " << 2 << endl;
else cout << -1 << " " << -1 << endl;
return 0;
}
// XXがあったら出力して終了
rep(i, s.size()-1) {
if(s[i] == s[i+1]) {
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
// XYXがあったら出力して終了
rep(i, s.size()-2) {
if(s[i] == s[i+2]) {
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
// どれもなければ-1
cout << -1 << " " << -1 << endl;
}
| #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
long long Comb(int a,int b){
if(a<b||b<0)return 0;
return fact[a]*finv[b]%mod*finv[a-b]%mod;
}
void init_C(int n){
fact[0]=finv[0]=inv[1]=1;
for(int i=2;i<n;i++){
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
}
for(int i=1;i<n;i++){
fact[i]=fact[i-1]*i%mod;
finv[i]=finv[i-1]*inv[i]%mod;
}
}
long long pw(long long a,long long b){
long long ret=1;
while(b){
if(b%2)ret=ret*a%mod;
a=a*a%mod;
b/=2;
}
return ret;
}
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
double ABS(double a){return max(a,-a);}
// ここから編集しろ
long long ans[510][510];
int p[21000];
vector<int>v;
long long gcd(long long a,long long b){
while(a){b%=a;swap(a,b);}return b;
}
int main(){
int a;scanf("%d",&a);
if(a==2){
printf("4 7\n23 10\n");return 0;
}
p[0]=p[1]=-1;
for(int i=2;i<21000;i++){
if(p[i]!=-1){
if(i>2)v.push_back(i);
p[i]=1;
for(int j=i+i;j<21000;j+=i)p[j]=-1;
}
}
for(int i=0;i<a;i++){
for(int j=0;j<a;j++){
if((i+j)%2)continue;
int X=(i+j)/2;
int Y=(i-j+500)/2+500;
long long ks=1;
ks*=v[X];
ks*=v[Y];
ans[i][j]=ks;
}
}
for(int i=0;i<a;i++){
for(int j=0;j<a;j++){
if((i+j)%2){
long long cur=1;
if(i)cur=cur/gcd(cur,ans[i-1][j])*ans[i-1][j];
if(j)cur=cur/gcd(cur,ans[i][j-1])*ans[i][j-1];
if(i<a-1)cur=cur/gcd(cur,ans[i+1][j])*ans[i+1][j];
if(j<a-1)cur=cur/gcd(cur,ans[i][j+1])*ans[i][j+1];
cur++;
ans[i][j]=cur;
}
}
}
for(int i=0;i<a;i++){
for(int j=0;j<a;j++){
if(j)printf(" ");
printf("%lld",ans[i][j]);
}
printf("\n");
}
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 111;
rep(i,n){
if(ans >= n){
cout << ans;
return 0;
}
ans +=111;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << ceil(n/111.0)*111 << endl;
return 0;
} | 1 |
#include <iostream>
using namespace std;
void call(int n) {
for(int i=1;i<n+1;i++)
{
if( i%3==0 )
{
cout << " " << i;
}
else
{
int x = i;
while(x>0)
{
if( x%10==3 )
{
cout << " " << i;
break;
}
x = x/10;
}
}
}
cout << endl;
}
int main() {
int n;
cin >> n;
call(n);
} | #include<stdio.h>
int main(void)
{
int x,a,c;
scanf("%d",&x);
a=3;
for(c=1;c<=x;c++){
a=x*x*x;
}
printf("%d\n",a);
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
// ?§?????????¨????????¨???????????????????¨???????????§???????
template <typename T>
struct Edge {
int from, to;
T cost;
Edge(int s, T d) : to(s), cost(d) {}
Edge(int f, int s, T d) : from(f), to(s), cost(d) {}
bool operator<(const Edge &e) const {
return cost < e.cost;
}
bool operator>(const Edge &e) const {
return cost > e.cost;
}
};
template <typename T>
using Graph = vector< vector< Edge<T> > >;
// ??¢??????????±??????? (artPoints)
// ???????±??????? (bridges)
// ??¢?????????????????????????????¨????????£?????§???????????£???????????????????????????????????¨
// ????????????????????????????????£?????§???????????£????????????????????????????????¨
template <typename T>
struct graphLink {
vector<int> ord, low, parent;
vector< vector< Edge<T> > > G;
vector< pair<int, int> > brdgs;
int cnt, v;
// init
graphLink(int _n) : ord(_n, -1), low(_n, 0),
parent(_n, -1), G(_n), cnt(0), v(_n) {}
bool is_bridge(int x, int y) {
if(ord[x] > ord[y]) swap(x, y);
return ord[x] < low[y];
}
// example: dfs(0);
void dfs(int cur, int prev=-1) {
low[cur] = cnt;
ord[cur] = cnt++;
for(auto x : G[cur]) {
if(ord[x.to] < 0) {
parent[x.to] = cur;
dfs(x.to, cur);
low[cur] = min(low[cur], low[x.to]);
}
else if(x.to != prev) {
low[cur] = min(low[cur], ord[x.to]);
}
if(cur != x.to && is_bridge(cur, x.to)) {
brdgs.emplace_back(make_pair(cur, x.to));
}
}
}
set<int> artPoints(int root) {
set<int> se;
int num = 0;
rep(i,0,v) {
// printf("%lld: %lld %lld\n", i, ord[parent[i]], low[i]);
if(parent[i] < 0) continue;
if(parent[i] == root) num++;
else if(ord[parent[i]] <= low[i]) se.insert(parent[i]);
}
if(num >= 2) se.insert(0);
return se;
}
// vp ??? ???????????±?????????
set<pii> bridges(vector<pii> vp) {
set<pii> se;
rep(i,0,vp.size()) {
if(ord[vp[i].first] < low[vp[i].second] || ord[vp[i].second] < low[vp[i].first]) {
// se.insert(vp[i]);
// ????????? (????????????????????????????????°???????????????????????§??\??????)
int mi = min(vp[i].first, vp[i].second);
int ma = max(vp[i].first, vp[i].second);
se.insert(pii(mi, ma));
}
}
return se;
}
};
signed main() {
int V, E; cin >> V >> E;
graphLink<int> gr(V);
rep(i,0,E) {
int s, t; cin >> s >> t;
gr.G[s].push_back(Edge<int>(t, 1));
gr.G[t].push_back(Edge<int>(s, 1));
}
gr.dfs(0);
set<int> ans = gr.artPoints(0);
for(auto x : ans) cout << x << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<sstream>
#include<map>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 1;i--)
#define ALL(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
ll n, m, x = 0, y,z,w,h, sum= 0, ans = 0;
string s, t;
int main() {
cin >> h >> w; vector<vector<int>> a(h, vector<int>(w));
rep(i, h) {
rep(j, w) cin >> a[i][j];
}vector<pair<int, int>> p,q;
rep(i, h) {
if (i % 2 == 0) {
rep(j, w - 1) {
if (a[i][j] % 2 == 1) {
a[i][j + 1]++;
sum++;
p.push_back({ i,j });
q.push_back({ i,j + 1 });
}
}
if (a[i][w - 1] % 2 == 1 && i != h - 1) {
a[i + 1][w - 1]++;
sum++;
p.push_back({ i,w - 1 });
q.push_back({ i + 1,w - 1 });
}
}
else {
rrep(j, w) {
if (a[i][j] % 2 == 1) {
a[i][j - 1]++;
sum++;
p.push_back({ i,j });
q.push_back({ i,j - 1 });
}
}
if(a[i][0] % 2 == 1 && i != h - 1) {
a[i + 1][0]++;
sum++;
p.push_back({ i,0 });
q.push_back({ i + 1,0 });
}
}
}
cout << sum << endl;
rep(i, p.size()) {
cout << p[i].first + 1 << " " << p[i].second+ 1 << " " << q[i].first+1 << " ";
cout << q[i].second + 1 << endl;
}
} | 0 |
#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 pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
int ii() { int x; if (scanf("%d", &x)==1) return x; else return 0; }
long long il() { long long x; if (scanf("%lld", &x)==1) return x; else return 0; }
string is() { string x; cin >> x; return x; }
char ic() { char x; cin >> x; return x; }
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v){cerr << #v << endl; for(const auto& xxx: v){cout << xxx.first << " " << xxx.second << "\n";}} //動作未確認
void br() { putchar('\n'); }
// #define gcd __gcd //llは受け取らない C++17~のgcdと違うので注意
// int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(),a.end() //sort(begin_end(vec));
#define REP(i,m,n) for(ll i=(ll)(m) ; i < (ll)(n) ; i++ )
#define DREP(i,m,n) for(ll i=(ll)(m) ; i > (ll)(n) ; i-- )
#define rep(i,n) REP(i,0,n)
#define m_p(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 p_b push_back
#define SZ(x) ((int)(x).size) //size()がunsignedなのでエラー避けに
// coutによるpairの出力（空白区切り）
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << " " << p.second << ")";}
// coutによるvectorの出力（空白区切り）
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i]; if (i < len - 1) s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
//最大値、最小値の更新。更新したor等しければtrueを返す
template<typename T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<typename T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
//4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// -------- template end - //
// - library ------------- //
// --------- library end - //
int main(){
ll N = il();
vector<ll> as;
rep(i, N){
as.push_back(il());
}
// 構成可否判定
if (as[0] != 0){
cout << -1 << endl;
return 0;
}
rep(i, N-1){
// i : 0 ~ N-2
if (as[i] < as[i+1]-1){
cout << -1 << endl;
return 0;
}
}
// ここから必ず構成可能
ll ans = 0;
// i-as[i]があったらそれをキーとして値を1にする
unordered_map<ll, ll> flags;
DREP(i, N-1, -1){
// i : N-1 ~ 0
if (flags[i-as[i]] == 0){
ans += as[i];
flags[i-as[i]] = 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int n;
int res = 0;
struct node {
int id;
int parent;
};
node v[100];
vector<tuple<int, int, int>> cost;
vector<int> path;
int find(node x){
if(x.parent == -1){
REP(i, path.size())
v[path[i]].parent = x.id;
path.clear();
return x.id;
}
else{
path.push_back(x.id);
return find(v[x.parent]);
}
}
void marge(node x, node y){
int x_id = find(x);
int y_id = find(y);
if(x_id == y_id)
return;
else
v[y_id].parent = x_id;
return;
}
bool judge(node x, node y){
vector<int> xpath, ypath;
return find(x) == find(y);
}
int main() {
cin >> n;
REP(i, n) REP(j, n) {
int tmp;
cin >> tmp;
if(tmp != -1)
cost.push_back(make_tuple(tmp, i, j));
}
REP(i, n){
v[i].id = i;
v[i].parent = -1;
}
sort(ALL(cost));
REP(i, cost.size()){
node from = v[get<1>(cost[i])];
node to = v[get<2>(cost[i])];
if(judge(from, to)){
continue;
}
res += get<0>(cost[i]);
marge(from, to);
}
cout << res << endl;
return 0;
} | 0 |
#include<iostream>
using namespace std;
int main ()
{
int n, a, p, k;
cin >> n;
a = n / 100;
k = a * 100 + a * 10 + a;
p = (a + 1) * 100 + (a + 1) * 10 + a + 1;
if(n <= k)
cout << k;
else
cout << p;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int n;
int main() {
cin >> n;
for (int i = 1; i < 10; ++i) {
if (i * 111 >= n) {
cout << i * 111 << endl;
exit(0);
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9+10;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ngcd(vector<ll> a) {
ll res = a[0];
for(ll i=1; i<a.size() && res!=1; i++) res = gcd(a[i], res);
return res;
}
ll nlcm(vector<ll> a){
ll res = a[0];
for(ll i=1; i<a.size(); i++) res = lcm(a[i], res);
return res;
}
bool is_prime(ll n) {
if(n < 2) return false;
for (ll i = 2; i * i <= n; i++) if (n % i == 0) return false;
return true;
}
ll digsum(ll n) {
ll res=0;
while(n) res += n%10, n /= 10;
return res;
}
ll digcnt(ll n){
ll res=0;
while(n) res++, n /= 10;
return res;
}
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) ++res[i], n /= i;
}
if (n != 1) res[n] = 1;
return res;
}
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll n,m; cin>>n>>m;
auto v=divisor(m);
ll ans=1;
for(auto e: v){
if(m-e*(n-1)>0 && (m-e*(n-1))%e==0) chmax(ans,e);
}
cout<<ans<<endl;
} | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
#define p 1000000007
using namespace std;
namespace ywy{
inline ll mi(int a,int b){
ll ans=1,tmp=a;while(b){
if(b&1)ans=(ans*tmp)%p;tmp=(tmp*tmp)%p;b>>=1;
}return(ans);
}int jc[5000001],jcny[5000001],dp[2022][2022];
inline ll cnm(int n,int m){
if(n<m)return(0);ll cjr=jc[n];cjr*=jcny[m];cjr%=p;cjr*=jcny[n-m];return(cjr%p);
}
inline void pre(int n){
jc[0]=1;for(register int i=1;i<=n;i++)jc[i]=((ll)jc[i-1]*i)%p;jcny[n]=mi(jc[n],p-2);
for(register int i=n-1;i>=0;i--)jcny[i]=((ll)jcny[i+1]*(i+1))%p;
}
void ywymain(){
int n,k;cin>>n>>k;if(k==1){
cout<<1<<endl;return;
}pre(n*k);dp[1][0]=dp[1][1]=1;for(register int i=2;i<=n;i++){
for(register int j=i;j>=0;j--){
if(!j)dp[i][j]=dp[i][j+1];else{
dp[i][j]=(dp[i][j+1]+((dp[i-1][j-1]*(ll)i)%p)*cnm(i*k-j-1,k-2))%p;
}
}
}cout<<dp[n][0]<<endl;
}
}
int main(){
ywy::ywymain();return(0);
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int,int> pint;
#define rep(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int main(){
int n;
cin>>n;
rep(i,n){
string str;
int out=0;
int rui=0;
int score=0;
for(;out<3;){
cin>>str;
if(str=="HIT"){
if(rui==3)score++;
else rui++;
}
if(str=="HOMERUN"){
score+=rui+1;
rui=0;
}
if(str=="OUT"){
out++;
}
}
cout<<score<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
class Baseball{
public:
Baseball();
void init();
int getPoint();
void hit();
void homerun();
// @return false - the inning ends.
bool out();
private:
int point;
unsigned int outs;
bool base[3];
};
Baseball::Baseball(){
init();
}
void Baseball::init(){
point = 0;
outs = 0;
for (int i=0; i<3; ++i) {
base[i] = false;
}
}
inline int Baseball::getPoint(){
return point;
}
void Baseball::hit(){
if (base[2]) {
++point;
}
for (int i=2; i>0; --i) {
base[i] = base[i-1];
}
base[0] = true;
}
void Baseball::homerun(){
++point; // batter's point
// runner's point
for (int i=0; i<3; ++i) {
if (base[i]) {
++point;
}
}
for (int i=0; i<3; ++i) {
base[i] = false;
}
}
bool Baseball::out(){
++outs;
if (outs > 2) {
return false;
}else{
return true;
}
}
int main(){
int n; // number of data sets
std::cin >> n;
for (int i=0; i<n; ++i) {
Baseball inning;
std::string str;
while (true) {
std::getline(std::cin,str);
if (str=="HIT"){
inning.hit();
}
else if (str=="HOMERUN"){
inning.homerun();
}
else if (str=="OUT"){
if (!inning.out()) {
break;
}
}
}
// output
std::cout << inning.getPoint() << std::endl;
}
return 0;
} | 1 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define DEBUG true
#ifdef ONLINE_JUDGE
#undef DEBUG
#define DEBUG false
#endif
using namespace std;
#define TRACE(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr << endl;}
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << "[" << *it << " = " << a << "]";
err(++it, args...);
}
#define MAXN ((int)2e5+5)
#define MOD ((int)1e9 + 7)
#define INF ((int)1e9 + 9)
#define ll long long
#define _ << " " <<
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define LOG(x) if(DEBUG) cerr << x << endl;
#define pb push_back
#define all(x) x.begin(), x.end()
#define endl "\n"
#define pii pair<int,int>
#define mid ((l+r)/2)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll ans = 0;
ll a;
double b, f;
cin >> a >> b;
ll w = b*100 + 0.01;
ans = (a*w) / 100;
cout << fixed << ans << endl;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
//cin>>t;
while( t-- )
{
int a,b;
cin>>a>>b;
cout<<a*b;
}
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uld = unsigned long long;
using P = pair<int,int>;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;}
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;}
//struct area
//function area
//main area
int main(){
string s;
cin >> s;
int n = s.size();
bool check = true;
int C_place;
//一個目
if(s[0] != 'A'){
check = false;
}
//二個目
int cnt = 0;
for(int i=2; i<n-1; i++){
if(s[i] == 'C'){
cnt++;
C_place = i;
}
}
if(cnt != 1) check = false;
//三個目
rep(i, n){
if(i == C_place || i == 0) continue;
if(!('a' <= s[i] && s[i] <= 'z')){
check = false;
}
}
cout << (check ? "AC" : "WA") << endl;
}
/*
一個ずつ判定する
・s[0] == 'A'
・2 <= i <= s.size()-2 cnt = 1
・上二つ以外の座標において'a' <= s[i] <= 'z'を満たす
*/ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
ll N; cin >> N;
bool isPrime = true;
vector<ll> div;
for(ll i = 1; i * i <= N; i++) {
if(N % i == 0) {
if(i != 1) isPrime = false;
div.push_back(i);
}
}
ll n = div.back(), m = N / n;
string ans = to_string(m);
cout << ans.size() << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b >> s;
string ans = "Yes";
if (s.at(a) != '-') {
ans = "No";
}
for (int i = 0; i < a+b+1; i++) {
if (i == a) continue;
if (s.at(i) == '-') ans = "No";
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
double P1x,P1y,P2x,P2y;
cin >> P1x >> P1y >> P2x >> P2y;
printf("%.8lf\n", sqrt((P1x-P2x)*(P1x-P2x)+(P1y-P2y)*(P1y-P2y)));
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.