code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int bs(ll k,vector<ll> & v){
int l = -1,r = v.size();
while(r-l > 1){
int mid = (l+r)/2;
if(v[mid] < k)l = mid;
else r = mid;
}
return r;
}
int main(){
ll n;
cin >> n;
vector<vector<ll>> v(30);
vector<P> w(n);
rep(i,n){
string s;cin >> s;
ll a = 0,b = 0,digit = 0;
rep(k,s.size()){
if(s[k] == '.'){
for(ll j = k+1;j < s.size();j++)b = b*10+s[j]-'0',digit++;
break;
}
a = a*10+s[k]-'0';
}
a *= 1000000000ll;
rep(g,9-digit)b *= 10ll;
a += b;
ll two = 0,five = 0;
while(!(a & 1))two++,a >>= 1;
while(!(a % 5))five++,a /= 5;
w[i] = make_pair(five,two);
v[five].push_back(two);
}
rep(i,30)sort(ALL(v[i]));
ll res = 0;
rep(i,n){
ll k = max(0,18-w[i].first);
for(ll j = k;j < 30;j++){
ll pos = max(0,bs(18-w[i].second,v[j]));
ll l = v[j].size();
res += l - pos;
}
if(w[i].first >= 9 && w[i].second >= 9)res--;
}
res >>= 1;
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
vector<vector<int> > ten(20, vector<int>(20, 0));
ll cnt = 0;
REP(i, n) {
double x; cin >> x;
ll tmp = x * 1e9 + 0.1;
int two = 0;
int five = 0;
while (!(tmp % 2)) {
tmp /= 2;
two++;
}
while (!(tmp % 5)) {
tmp /= 5;
five++;
}
if (two > 18) two = 18;
if (five > 18) five = 18;
for (int j = 18 - two; j <= 18; j++)
for (int k = 18 - five; k <= 18; k++)
cnt += ten[j][k];
ten[two][five]++;
}
cout << cnt << '\n';
return 0;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
class Dice{
public:
int l1,l2,l3,l4,l5,l6;
void East(){
int t = l1;
l1 = l4;
l4 = l6;
l6 = l3;
l3 = t;
}
void West(){
int t = l1;
l1 = l3;
l3 = l6;
l6 = l4;
l4 = t;
}
void South(){
int t=l1;
l1 = l5;
l5 = l6;
l6 = l2;
l2 = t;
}
void North(){
int t=l1;
l1 = l2;
l2 = l6;
l6 = l5;
l5 = t;
}
};
int main() {
Dice dice;
int l1,l2,l3,l4,l5,l6;
char d;
cin>>l1>>l2>>l3>>l4>>l5>>l6;
dice.l1 = l1;
dice.l2 = l2;
dice.l3 = l3;
dice.l4 = l4;
dice.l5 = l5;
dice.l6 = l6;
while(cin>>d){
if(d=='E')dice.East();
else if(d=='W')dice.West();
else if(d=='S')dice.South();
else dice.North();
}
cout<<dice.l1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int w;
cin>>S>>w;
int i=0;
while(i<S.size()){
cout<<S[i];
i+=w;
}
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
bool ok=true;
int ans=1e9;
//O(N * LOG(MAX(a)))
for(int& x : a) {
cin >> x;
if(x&1) ok=false;
int cnt=0;
while(x) {
if(x&1) {
ans=min(ans,cnt);
break;
}
cnt++;
x/=2;
}
}
if(!ok) {
puts("0");return 0;
}else {
cout << ans;
}
return 0;
}
| #include<iostream>
#include<vector>
using namespace std;
int num_2(int a) {
int ret=0;
while (a % 2 == 0) {
ret++;
a /= 2;
}
return ret;
}
int even(vector<vector<int>> a) {
int ret = a.at(1).at(0);
for (int i = 0; i < a.at(0).size(); i++) {
if (ret > a.at(1).at(i))ret = a.at(1).at(i);
}
return ret;
}
int main() {
int n;
cin >> n;
vector<vector<int>> a(2,vector<int> (n));
for (int i = 0; i < n; i++) {
cin >> a.at(0).at(i);
}
for (int i = 0; i < n; i++) {
a.at(1).at(i) = num_2(a.at(0).at(i));
}
cout << even(a) << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
//Made with <3 by MinumCoklatPanas
typedef long long ll;
const int INF = 1e9;
const ll INFF = 1e18;
const int MAXN = 510;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
vector< pair<int,int> > adj[100010];
ll sum[100010];
void dfs(int u,ll curSum,int prv)
{
sum[u] = curSum;
for (auto it : adj[u]) if (it.first != prv)
{
dfs(it.first,curSum + it.second,u);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1 ; i < n ; i++)
{
int a,b,c;
cin >> a >> b >> c;
adj[a].push_back({b,c});
adj[b].push_back({a,c});
}
int q,k;
cin >> q >> k;
dfs(k,0,-1);
while (q--)
{
int u,v;
cin >> u >> v;
ll ans = sum[u] + sum[v];
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int n;
void dijkstra(vector<vector<pair<ll,ll>>>& graph,vector<long long> &distance,int start){
priority_queue<pair<ll,ll>> PQ;
vector<bool> checked(n,false);
distance[start]=0;
PQ.push(make_pair(0,start));
int u;
while(1){
u=-1;
while(!PQ.empty()){
if(!checked[PQ.top().second]){
u=PQ.top().second;
distance[u]=-PQ.top().first;
PQ.pop();
break;
}
PQ.pop();
}
if(u==-1)break;
checked[u]=true;
for(int i=0;i<graph[u].size();i++){
PQ.push(make_pair(-(distance[u]+graph[u][i].second),graph[u][i].first));
}
}
}
int main(){
in(n);
vector<vector<pair<ll,ll>>> graph(n);
vector<ll> distance(n,1000000000000000000);
int u,k,v,c,q;
rep(i,n-1){
in(u,v,c);
graph[u-1].push_back(make_pair(v-1,c));
graph[v-1].push_back(make_pair(u-1,c));
}
in(q,k);
dijkstra(graph,distance,k-1);
rep(i,q){
in(u,v);
out(distance[u-1]+distance[v-1]);
}
} | 1 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int);
int integral(int);
int main(void) {
int a, b;
while(cin >> a >> b) {
cout << integral(a) << endl;
cout << integral(b) << endl;
}
return 0;
}
int integral(int d){
int n = 600 / d;
int sum = 0;
for (int i = 1; i < n; i++) {
sum = sum + f(d * i) * d;
}
return sum;
}
int f(int a) {
return a * a;
} | #include<iostream>
using namespace std;
int solve(int d){
int ret=0;
for(int i=d;i<=600-d;i+=d)
ret+=i*i*d;
return ret;
}
int main(){
int d;
while(cin>>d){
cout<<solve(d)<<endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
signed main(){
int M,L,R;
while(cin>>M>>L>>R,M||L||R){
vint P(M);rep(i,M)cin>>P[i];
sort(all(P));reverse(all(P));
int val=0,ma=0;
for(int i=L-1;i<R;i++){
int tmp=P[i]-P[i+1];
if(tmp>=val){
val=tmp;
ma=i+1;
}
}
cout<<ma<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define range(i,c,o) for(register int i=(c);i<(o);++i)
using namespace std;
// fast_io BEGIN HERE
namespace IO
{
static const size_t isize=1000000;
char *cur,pool[isize];
inline void clear()
{
rewind(stdin),cur=pool+isize;
}
inline char getC()
{
if(cur==pool+isize)
{
int siz=fread(pool,1,isize,stdin);
if(siz<isize) pool[siz]='\0'; cur=pool;
if(!siz) return '\0';
}
return *(cur++);
}
inline unsigned getU()
{
char c; unsigned r=0;
while(!isdigit(c=getC()));
for(;isdigit(c);c=getC())
{
r=(r<<3)+(r<<1)+c-'0';
}
return r;
}
inline char *getS(char*str)
{
char *i=str,c; while(isspace(c=getC()));
for(;!isspace(c)&&c;c=getC()) *(i++)=c;
return *i='\0',str;
}
static const size_t osize=100;
char stk[osize];
template<typename T>
inline size_t putU(const T&n,const char&c='\n')
{
int bot=osize;
stk[--bot]=c,stk[--bot]=n%10+'0';
for(T i=n;i/=10;stk[--bot]=i%10+'0');
return fwrite(stk+bot,osize-bot,1,stdout);
}
inline size_t putS(const char*str)
{
return fwrite(str,strlen(str),1,stdout);
}
}
// fast_io END HERE
static int N;
// BIT BEGIN HERE
int bit[1000005];
inline int lowbit(const int&x) {return x&-x;}
inline void modify(const int&x,const int&y)
{
for(int i=x+1;i;i-=lowbit(i)) bit[i]=min(bit[i],y);
}
inline int query(const int&x)
{
int ret=0x7FFFFFFF;
for(int i=x+1;i<N+2;i+=lowbit(i)) ret=min(ret,bit[i]);
return ret;
}
// BIT END HERE
char S[1000005],T[1000005];
int pre[1000005],las[1000005],rec[1000005];
deque<int> que;
int main()
{
//freopen("game.in" ,"r",stdin );
//freopen("game.out","w",stdout);
IO::clear(),N=IO::getU();
IO::getS(S),IO::getS(T);
if(!strcmp(S,T)) return IO::putS("0\n"),0;
for(int i=N,j=N;i--;pre[i]=j)
{
for(j-=j>i;~j&&S[j]!=T[i];--j);
if(!~j) return IO::putS("-1\n"),0;
}
int ans=0,cnt=0;
for(int i=0;i<N;)
{
rec[cnt]=i,las[cnt++]=pre[i];
for(++i;i<N&&pre[i]==pre[i-1];++i);
}
memset(bit,0x7F,sizeof bit);
modify(N-cnt,cnt+1);
for(int i=cnt;i--;)
{
modify(las[i]-i,i+1);
ans=max(ans,query(rec[i]-i)-i);
}
return IO::putU(ans),0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
ll N,M;
cin >> N >> M;
if(N*N==M){
cout << N << endl;
}else if(N*N<M){
for(ll i=N;i*i<M;i++){
if(M%i==0){
cout << M/i << endl;
return 0;
}
}
for(ll i=N-1;i>0;i--){
if(M%i==0){
cout << i << endl;
return 0;
}
}
}else{
for(ll i=M/N;i>0;i--){
if(M%i==0){
cout << i << endl;
return 0;
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define bitrep(bit,A) for(int bit=A; ;bit=(bit-1)&A)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) (ll)((a).size())
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
#define chmax(x,a) x=max(x,a)
#define chmin(x,a) x=min(x,a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define SORT(c) stable_sort(ALL(c))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100//5
#define MAX2 200100
#define MAX_6 1001001//6
#define MAX_7 10010010//7
#define SENTINEL 2000000000//9
#define NIL -1
const int MOD = 1000000007;
#define INF 1<<30
#define INFTY 1LL<<61
#define MAX_INT INT_MAX
#define Endl '\n'
#define greater greater<int>()
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
using Edge=pair<int,ll>;
using Graph=vector<vector<bool> >;//ll or Edge
using Edge=pair<int,ll>;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
// g++ -o a a.cpp -Wall -lm -std=c++17
vector<ll>divisor(int 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(ALL(res));
return res;
}
int main(){
ll n,m;cin>>n>>m;
VI s=divisor(m);
ll ans;
for(auto b:s){
if(m/b>=n)ans=b;
}
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
long long n,k;
cin>>n>>k;
long double ch[200010];
for(ll i=0;i<n;i++){
cin>>ch[i];
}
long double ans=0;
for(ll i=0;i<k;i++){
long double now=ch[i];
now=(ch[i]+1)/2;
ans+=now;
}
//printf("%.10Lf\n",ans);
long double cnt=ans;
for(ll i=0;i+k<n;i++){
cnt+=-(ch[i]+1)/2+(ch[i+k]+1)/2;
ans=max(ans,cnt);
}
printf("%.10Lf",ans);
// your code goes here
return 0;
} | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair
#ifndef ONLINE_JUDGE
# define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
# define LOG(x) ((void)0)
#endif
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double PI=acos(-1);
const ll INF = 1LL<<62;
const ll MINF = -(1LL<<62);
template<typename T> T getint() {
T val=0;
char c;
bool neg=false;
while((c=gc()) && !(c>='0' && c<='9')) {
neg|=c=='-';
}
do {
val=(val*10)+c-'0';
} while((c=gc()) && (c>='0' && c<='9'));
return val*(neg?-1:1);
}
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)
int main() {
IO;
ll a,b;
cin>>a>>b;
cout<<a*b<<"\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MAX = 1000000;
using Graph =vector<vector<lint>>;
typedef pair<lint,lint> P;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(lint n, lint k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num)
{
if (num < 2) return 0;
else if (num == 2) return 1;
else if (num % 2 == 0) return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return 0;
}
}
return 1;
}
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;
}
lint lcm(lint a,lint b){
return a/__gcd(a,b)*b;
}
lint gcd(lint a,lint b){
return __gcd(a,b);
}
///解説AC
int main(){
double n,m,d;
cin>>n>>m>>d;
if(d==0){
printf("%.9f",1/n*(m-1));
}else{
printf("%.9f",2*(n-d)/n/n*(m-1));
}
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
const double PI=3.14159265358979323846;
const in MOD = 1000000007;
const in INF=1e18+7;
const int inf=1e9+7;
using P=pair<int,int>;
vector<int> dx={0,1,-1,0};
vector<int> dy={1,0,0,-1};
using ld=long double;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << fixed << setprecision(10);
ld n,m,d;
cin>>n>>m>>d;
ld ans=(m-1.0)*(n-d);
if(d!=0.0) ans *=2.0;
ans /=n;
ans /=n;
cout<<ans<<'\n';
}/*
./problem.exe
*/ | 1 |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template<class T>
void print(T x,int suc=1)
{
cout<<x;
if(suc==1) cout<<'\n';
else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
for(int i=0;i<v.size();i++)
print(v[i],i==(int)(v.size())-1?suc:2);
}
const int maxn=4e5+7;
int a[maxn],b[maxn];
int s[maxn],t[maxn];
int len;
int fail[maxn];
void getfail()
{
memset(fail, 0, sizeof(fail));
int j = 0, k = fail[0] = -1;
while (j < len)
{
while (k != -1 && t[j] != t[k])
k = fail[k];
fail[++j] = ++k;
}
}
vi ans;
int kmp()
{
int n = len*2, m = len;
int i = 0, j = 0;
int ret = 0;
while (i < n)
{
while (j != -1 && s[i] != t[j])
j = fail[j];
i++, j++;
if (j == m)
{
ans.push_back(i-len);
ret++, j = fail[j];
}
}
return ret;
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int j=0;j<n;j++) cin>>b[j];
if(n==1)
{
cout<<0<<" "<<(a[0]^b[0])<<'\n';
return 0;
}
for(int i=1;i<n+n;i++) s[i-1]=a[i%n]^a[(i-1)%n];
for(int i=1;i<n;i++) t[i-1]=b[i]^b[i-1];
len=n-1;
getfail();
kmp();
for(auto u:ans) cout<<u<<" "<<(b[0]^a[u])<<'\n';
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll N;
cin>>N;
ll A[2*N],AA[N],B[2*N],BB[N];
REP(i,N) cin>>AA[i];
REP(i,N) cin>>BB[i];
REP(i,N){
A[i]=AA[i]^AA[(i+1)%N];
A[N+i]=A[i];
}
REP(i,N){
B[i]=BB[i]^BB[(i+1)%N];
B[N+i]=B[i];
}
ll base=1007,P[N+1],HA=0,HB=0;
P[0]=1;
RREP(i,N) P[i]=P[i-1]*base%MOD;
REP(i,N){
HA+=A[i]*P[N-1-i]%MOD;
HA%=MOD;
HB+=B[i]*P[N-1-i]%MOD;
HB%=MOD;
}
REP(i,N){
if(HA==HB){
ll X=AA[i]^BB[0];
cout<<i<<" "<<X<<endl;
}
HA=HA*base%MOD;
HA-=A[i]*P[N]%MOD;
HA+=A[i+N];
HA%=MOD;
if(HA<0) HA+=MOD;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,x[100005],y[100005],mod=1e9+7;
ll calc(ll a[],ll n){
ll ans =0 ;
for(ll i=0;i<n-1;i++)a[i]=a[i+1]-a[i];
n-=1;
for(ll i=0;i<n;i++){
ans = ans + (i+1)*(n-i)%mod*a[i]%mod;
ans%=mod;
}
return ans;
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin>>n>>m;
for(ll i=0;i<n;i++)cin>>x[i];
for(ll i=0;i<m;i++)cin>>y[i];
cout<< (calc(x,n) * calc(y,m) )%mod;
} | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
int n; scanf("%d", &n);
std::vector<i64> a(n);
for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
i64 m, k; scanf("%lld%lld", &m, &k);
std::vector<int> b(m);
for(int i = 0; i < m; i++) {
scanf("%d", &b[i]);
b[i]--;
}
std::vector<i64> d(n - 1);
for(int i = 0; i < d.size(); i++) d[i] = a[i + 1] - a[i];
std::vector<int> op(d.size());
for(int i = 0; i < op.size(); i++) op[i] = i;
for(auto v: b) std::swap(op[v - 1], op[v]);
std::vector<int> ret(d.size());
for(int i = 0; i < d.size(); i++) ret[i] = i;
std::function<void ()> solve = [&]() {
while(k) {
if(k & 1) {
std::vector<int> tmp(ret.size());
for(int i = 0; i < op.size(); i++) {
tmp[i] = ret[op[i]];
}
ret.swap(tmp);
}
std::vector<int> nxt = op;
for(int i = 0; i < op.size(); i++) {
nxt[i] = op[op[i]];
}
op.swap(nxt);
k >>= 1;
}
};
solve();
std::vector<i64> ans(n, 0); ans[0] = a[0];
for(int i = 0; i < ret.size(); i++) ans[i + 1] = d[ret[i]];
for(int i = 0; i < ret.size(); i++) ans[i + 1] += ans[i];
for(auto v: ans) printf("%lld\n", v);
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
int ba[12][12];
int dx[] = {1,0,-1,0};
int dy[] = {0,-1,0,1};
void dfs(int x,int y) {
REP(i,4) {
int xx = x+dx[i];
int yy = y+dy[i];
if (xx<0||xx>=12||yy<0||yy>=12) continue;
if (ba[xx][yy]) {
ba[xx][yy] = 0;
dfs(xx,yy);
}
}
}
int main() {
char b;
while(cin >> b) {
ba[0][0] = b-'0';
REP(i,12) {
REP(j,12) {
if (i==0&&j==0)continue;
char a;
cin >> a;
ba[j][i] = a-'0';
}
}
int ans = 0;
REP(i,12) {
REP(j,12) {
if (ba[i][j]) {
ans++;
dfs(i,j);
}
}
}
cout << ans << endl;
}
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, num;
vector< int > a;
while( 1 ) {
cin >> n;
if( n == 0 ) break;
int Max = -100001;
a.push_back( 0 );
for( int i = 0; i < n; i++ ) {
cin >> num;
a.push_back( num );
}
for( int i = 1; i <= n; i++ ) {
a[i] = max( a[i], a[i] + a[i - 1] );
Max = max( Max, a[i] );
}
cout << Max << endl;
a.clear();
}
return 0;
} | 0 |
#include <cstdio>
#include <iostream>
#define ri register int
using namespace std;
typedef long long LL;
const int N = 102;
char ch[N][N];
short le[N][N], up[N][N], dp[N][N][N][N];
inline void upd(short &x, short y) {
if (x < y) x = y;
}
int main() {
int n, m, ex, ey;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++) {
scanf("%s", ch[i] + 1);
for (int j = 1; j <= m; j ++) {
le[i][j] = le[i][j - 1];
up[i][j] = up[i - 1][j];
if (ch[i][j] == 'o') le[i][j] ++, up[i][j] ++;
if (ch[i][j] == 'E') ex = i, ey = j;
}
}
short t, ans = 0;
for (ri U = ex; U; U --)
for (ri D = ex; D <= n; D ++)
for (ri L = ey; L; L --)
for (ri R = ey; R <= m; R ++) {
t = dp[U][D][L][R];
ans = max(ans, t);
if (U - 1 > D - ex) upd(dp[U - 1][D][L][R], t + le[U - 1][min(R, m - (ey - L))] - le[U - 1][max(L - 1, R - ey)]);
if (n - D > ex - U) upd(dp[U][D + 1][L][R], t + le[D + 1][min(R, m - (ey - L))] - le[D + 1][max(L - 1, R - ey)]);
if (L - 1 > R - ey) upd(dp[U][D][L - 1][R], t + up[min(D, n - (ex - U))][L - 1] - up[max(U - 1, D - ex)][L - 1]);
if (m - R > ey - L) upd(dp[U][D][L][R + 1], t + up[min(D, n - (ex - U))][R + 1] - up[max(U - 1, D - ex)][R + 1]);
}
cout << ans << endl;
return 0;
}
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
const int N=200005;
const LL inf=1ll<<40;
int n,q,sta,stb;
int x[N];
struct tree
{
LL mv1[N*4],mv2[N*4],tag[N*4];//mv1-> f[x]-x mv2 -> f[x]+x
void pushup(int k)
{
mv1[k]=min(mv1[k<<1],mv1[k<<1|1]);
mv2[k]=min(mv2[k<<1],mv2[k<<1|1]);
}
void setv(int k,LL v){tag[k]+=v;mv1[k]+=v;mv2[k]+=v;}
void pushdown(int k)
{
if(!tag[k])return;
setv(k<<1,tag[k]);setv(k<<1|1,tag[k]);
tag[k]=0;
}
void build(int k,int l,int r)
{
tag[k]=0;
if(l==r){mv1[k]=mv2[k]=inf;return;}
int mid=(l+r)>>1;
build(k<<1,l,mid);build(k<<1|1,mid+1,r);
pushup(k);
}
void upd(int k,int l,int r,int pos,LL v)
{
if(l==r){if(v<mv1[k]+l){mv1[k]=v-l;mv2[k]=v+l;}return;}
int mid=(l+r)>>1;
pushdown(k);
if(mid>=pos)upd(k<<1,l,mid,pos,v);
else upd(k<<1|1,mid+1,r,pos,v);
pushup(k);
}
LL query1(int k,int l,int r,int ql,int qr)// query mv1
{
if((l>=ql&&r<=qr)||mv1[k]>=inf)return mv1[k];
int mid=(l+r)>>1;LL res=inf;
pushdown(k);
if(mid>=ql)res=min(res,query1(k<<1,l,mid,ql,qr));
if(mid<qr)res=min(res,query1(k<<1|1,mid+1,r,ql,qr));
return res;
}
LL query2(int k,int l,int r,int ql,int qr)// query2 mv2
{
if((l>=ql&&r<=qr)||mv2[k]>=inf)return mv2[k];
int mid=(l+r)>>1;LL res=inf;
pushdown(k);
if(mid>=ql)res=min(res,query2(k<<1,l,mid,ql,qr));
if(mid<qr)res=min(res,query2(k<<1|1,mid+1,r,ql,qr));
return res;
}
LL querya(int k,int l,int r)
{
if(l==r)return mv1[k]+l;
int mid=(l+r)>>1;
pushdown(k);
return min(querya(k<<1,l,mid),querya(k<<1|1,mid+1,r));
}
}t;
int Abs(int x){return x<0?-x:x;}
int input()
{
int x=0,F=1;
char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')F=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x*F;
}
int main()
{
cin>>n>>q>>sta>>stb;
for(int i=1;i<=q;i++)x[i]=input();
x[0]=sta;
t.build(1,1,n);
t.upd(1,1,n,stb,0);
for(int i=1;i<=q;i++)
{
LL minv=min(t.query1(1,1,n,1,x[i])+x[i],t.query2(1,1,n,x[i]+1,n)-x[i]);
t.setv(1,Abs(x[i]-x[i-1]));
t.upd(1,1,n,x[i-1],minv);
}
cout<<t.querya(1,1,n);
return 0;
}
| 0 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
const char nl = '\n';
void solve() {
int n;
cin >> n;
int ara[n];
for(int i = 0; i < n; ++i){
cin >> ara[i];
}
sort(ara, ara + n);
ll a(0), b(0);
ll len = n - 1;
char c(1);
while(len){
if(ara[len] == ara[len - 1]){
if(c){
a = ara[len];
c = 0;
}
else{
b = ara[len];
break;
}
len--;
}
len--;
}
cout << a * b << nl;
}
int main() {
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;cin >> n;
vector<ll> A(n), abs_A(n);
ll min_abs_A = 1e10;
int minus_cnt = 0;
for (int i = 0; i < n; i++){
cin >> A[i];
abs_A[i] = abs(A[i]);
min_abs_A = min(min_abs_A, abs_A[i]);
if (A[i] < 0) minus_cnt++;
}
ll ans = accumulate(abs_A.begin(), abs_A.end(), 0LL);
if (minus_cnt % 2) {
ans -= min_abs_A * 2;
}
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r;
cin>>r;
if(r<1200)
cout<<"ABC";
else if(r<2800 && r>=1200)
cout<<"ARC";
else
cout<<"AGC";
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N;
cin>>N;
cout<<(N-2)*180<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 10**9
int main() {
ll n,prev=-1;
cin >> n;
rep(i,100000){
if (pow(i,2)<=n){
prev=pow(i,2);
}
else{
cout << prev << endl;
break;
}
}
} | #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 int64_t Int;
int main(){
Int N;
cin >> N;
Int ans = 0;
for (Int i = 1; i * i <= N; i++) {
ans = i * i;
}
cout << ans << endl;
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
string str;
while( getline( cin, str ) ){
for( int i = 0;i < 26;i++ ){
for( int j = 0;j < str.size();j++ ){
if( str[j] >= 'a' && str[j] <= 'y' ) str[j]++;
else if( str[j] == 'z' ) str[j] = 'a';
}
if( str.find( "the" ) != string::npos || str.find( "this" ) != string::npos || str.find( "that" ) != string::npos ) {cout << str << endl; break;}
}
}
return 0;
} | #include <iostream>
using namespace std;
class Rect{
public:
int w;
int h;
int diagonal;
};
void swap(int *a,int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
Rect rect[11180];
for(int i=0;i<11180;i++){
rect[i].diagonal=1000000;
}
int cnt=0;
for(int i=1;i<=150;i++){
for(int j=1;j<i;j++){
rect[cnt].w=i;
rect[cnt].h=j;
rect[cnt].diagonal =i*i+j*j;
cnt++;
}
}
for(int i=0;i<11180;i++){
for(int j=11180-1;j>i;j--){
if(rect[j].diagonal<=rect[j-1].diagonal){
swap(&rect[j].h,&rect[j-1].h);
swap(&rect[j].w,&rect[j-1].w);
swap(&rect[j].diagonal,&rect[j-1].diagonal);
}
}
}
for(int i=0;i<11180;i++){
for(int j=11180-1;j>i;j--){
if(rect[j].diagonal==rect[j-1].diagonal && rect[j].h<=rect[j-1].h){
swap(&rect[j].h,&rect[j-1].h);
swap(&rect[j].w,&rect[j-1].w);
swap(&rect[j].diagonal,&rect[j-1].diagonal);
}
}
}
/*
for(int i=0;i<=10100;i++){
cout<<"i="<<i<<endl;
cout<<"h="<<rect[i].h<<"w="<<rect[i].w<<"diagonal="<<rect[i].diagonal<<endl;
}
*/
int inH,inW;
while(cin>>inH>>inW){
if(inH==0 && inW ==0)break;
for(int i=0;i<11180;i++){
if(rect[i].h == inH && rect[i].w == inW){
/*
cout<<"rectH="<<rect[i].h<<"rectW="<<rect[i].w<<endl;
cout<<"inH ="<<inH<<"inW="<<inW<<endl;
cout<<i<<" "<<i+1<<endl;
*/
cout<<rect[i+1].h<<" "<<rect[i+1].w<<endl;
break;
}
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string res = "";
for (int i = sy; i < ty; i++) {
res += 'U';
}
for (int i = sx; i < tx; i++) {
res += 'R';
}
for (int i = sy; i < ty; i++) {
res += 'D';
}
for (int i = sx; i < tx; i++) {
res += 'L';
}
res += 'L';
for (int i = sy; i < ty + 1; i++) {
res += 'U';
}
for (int i = sx; i < tx + 1; i++) {
res += 'R';
}
res += 'D';
res += 'R';
for (int i = sy; i < ty + 1; i++) {
res += 'D';
}
for (int i = sx; i < tx + 1; i++) {
res += 'L';
}
res += 'U';
cout << res;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//using namespace atcoder;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void solve() {
int A, B, C, D; cin >> A >> B >> C >> D;
int K; cin >> K;
int t1 = A * 60 + B;
int t2 = C * 60 + D;
int d = t2 - t1;
print(d - K);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
//int q;
//cin >> q;
//while (q--)
solve();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9 * 2;
int main() {
int n;
while(cin >> n && n){
int a[5010] = {0};
for(int i = 0; i < n; ++i)
scanf("%d", &a[i]);
int ans = -INF;
for(int i = 0; i < n; ++i){
int sum = 0;
for(int j = i; j < n; ++j){
sum += a[j];
if(ans < sum)
ans = sum;
}
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int main(void){
int lp;
cin >> lp;
int* ary =(int*)malloc(sizeof(int)*lp);
for(int i=0;i<lp;i++) {
cin >> ary[i];
}
int count =0;
for(int i=0;i<lp;i++) {
for(int j=0;j<lp-i-1;j++) {
if(ary[j] > ary[j+1]) {
int tmp=ary[j];
ary[j] = ary[j+1];
ary[j+1] = tmp;
count++;
}
}
}
for(int i=0;i<lp;i++) {
if(i==lp-1)
printf("%d\n",ary[i]);
else
printf("%d ",ary[i]);
}
printf("%d\n",count);
free(ary);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll mod(ll val) {
ll res = val % MOD;
if(res < 0) {
res += MOD;
}
return res;
}
// N^P mod M（ただしM == -1の時はmodを取らない）
template<typename T>
T RS(T N, T P, T M){
if(P == 0) {
return 1;
}
if(P < 0) {
return 0;
}
if(P % 2 == 0){
ll t = RS(N, P/2, M);
if(M == -1) return t * t;
return t * t % M;
}
if(M == -1) {
return N * RS(N,P - 1,M);
}
return N * RS(N, P-1, M) % M;
}
int N;
bool flag[310][310][310];
double dp[310][310][310];
double solve(int a,int b,int c) {
if(flag[a][b][c]) {
return dp[a][b][c];
}
flag[a][b][c] = true;
if(a == 0 && b == 0 && c == 0) {
return dp[a][b][c] = 0;
}
double fans = 1 / ( 1 - (double)(N - a - b - c) / N);
if(a > 0) {
fans += solve(a - 1,b,c) * a / N / (1 - (double)(N - a - b - c) / N);
}
if(b > 0) {
fans += solve(a + 1,b - 1,c) * b / N / (1 - (double)(N - a - b - c) / N);
}
if(c > 0) {
fans += solve(a,b + 1,c - 1) * c / N / (1 - (double)(N - a - b - c) / N);
}
return dp[a][b][c] = fans;
}
int main() {
cin >> N;
int one = 0;
int two = 0;
int three = 0;
for(int i = 0;i < N;i++) {
int A;
cin >> A;
if(A == 1) {
one++;
}
else if(A == 2) {
two++;
}
else {
three++;
}
}
for(int i = 0;i < 310;i++) {
for(int j = 0;j < 310;j++) {
for(int k = 0;k < 310;k++) {
flag[i][j][k] = false;
}
}
}
cout << fixed;
cout << setprecision(12) << solve(one,two,three) << endl;
} | // @author: khangtq1
#include <bits/stdc++.h>
using namespace std;
#define fto(i, a, b) for(int i = a; i < b; ++i)
#define fdto(i, a, b) for(int i = b - 1; i >= a; --i)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define fill(arr, val) memset(arr, val, sizeof(arr))
#define what_is(x) cerr << #x << " is " << x << "\n"
#define setpre(x) fixed << setprecision(x)
#define all(arr) (arr).begin(), (arr).end()
#define pb push_back
#define mp make_pair
#define pqueue priority_queue
#define unmap unordered_map //hashmap
#define unset unordered_set //hashset
#define mtset multiset
#define endl '\n'
using ll = long long;
using db = double;
using ii = pair<int, int>;
using vi = vector<int>;
const db PI = acos(-1);
#define MOD 1000000007
void solve();
/// ================================ main ==============================
int main() {
//ios::sync_with_stdio(false);
//cin.tie(nullptr);
int tt =1;
//cin >> tt;
while(tt--) {
solve();
}
return 0;
}
/// ================================ solve =============================
const int MAXN = 305;
double p[MAXN][MAXN][MAXN], ev[MAXN][MAXN][MAXN ];
void solve() {
int n;
scanf("%d", &n);
vector<int> cnt(4);
for(int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
++cnt[x];
}
p[cnt[1]][cnt[2]][cnt[3]] = 1;
for(int c = n; c >= 0; --c) {
for(int b = n; b >= 0; --b) {
for(int a = n; a >= 0; --a) {
if(a == 0 && b == 0 && c == 0) {
continue;
}
if(a + b + c > n) {
continue;
}
// dp[a][b][c]
double p_waste = (double) (n - (a + b + c)) / n;
// p_waste + p_waste^2 + ... = S
// 1 + S = S / p_waste
double ev_waste = p_waste / (1 - p_waste) + 1;
ev[a][b][c] += ev_waste * p[a][b][c];
// remove 1 -> dp[a-1][b][c]
// we will eventually choose one of a+b+c
if(a != 0) {
double p_go = (double) a / (a + b + c);
p[a-1][b][c] += p[a][b][c] * p_go;
ev[a-1][b][c] += ev[a][b][c] * p_go;
}
// remove 2 -> dp[a+1][b-1][c]
if(b != 0) {
double p_go = (double) b / (a + b + c);
p[a+1][b-1][c] += p[a][b][c] * p_go;
ev[a+1][b-1][c] += ev[a][b][c] * p_go;
}
// remove 3
if(c != 0) {
double p_go = (double) c / (a + b + c);
p[a][b+1][c-1] += p[a][b][c] * p_go;
ev[a][b+1][c-1] += ev[a][b][c] * p_go;
}
}
}
}
printf("%.10lf\n", ev[0][0][0]); // + cnt[1] + 2 * cnt[2] + 3 * cnt[3]);
}
/*
==================================+
INPUT: |
3
1 1 1
==================================+
OUTPUT: |
5.5
==================================+
*/
| 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//using namespace atcoder;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void Yes(bool cond) { cout << (cond ? "Yes" : "No") << '\n'; }
void YES(bool cond) { cout << (cond ? "YES" : "NO") << '\n'; }
void solve() {
int D, T, S; cin >> D >> T >> S;
Yes(S*T >= D);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
//int q;
//cin >> q;
//while (q--)
solve();
}
| /*
Contest 111
B - AtCoder Beginner Contest 111
Rakesh Kumar --> 27/09/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::vector<int> table;
for (int i = 1; i <= 9; ++i)
table.emplace_back(i * 111);
int n = 0;
std::cin >> n;
if (n % 111 == 0)
std::cout << n << std::endl;
else
std::cout << table[n / 111] << std::endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void read(int &x){
char ch=getchar();x=0;
for (;ch==' '||ch=='\n';ch=getchar());
for (;ch!=' '&&ch!='\n';x=x*10+ch-'0',ch=getchar());
}
void write(int x){
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n,m,ans=2e9,SUM,dis[17][17],num[33000],dp[33000][17];
int main(){
read(n),read(m);
for (int i=0;i<m;i++){
int x,y,c;read(x),read(y),read(c);SUM+=c;
dis[x-1][y-1]=dis[y-1][x-1]=c;
}
for (int i=1;i<(1<<n);i++){
int cnt;
for (int j=0;j<n;j++) if ((1<<j)&i){
cnt=j;break;
}
num[i]=num[i^(1<<cnt)];
for (int k=0;k<n;k++) if ((1<<k)&i) num[i]+=dis[k][cnt];
}
for (int i=0;i<33000;i++) for (int j=0;j<17;j++)dp[i][j]=-5e8;
dp[1][0]=0;
for (int i=1;i<(1<<n);i++){
for (int j=0;j<n;j++){
for (int k=0;k<n;k++) if ((i&(1<<j))>0 && (i&(1<<k))>0 && dis[j][k]) dp[i][j]=max(dp[i][j],dp[i^(1<<j)][k]+dis[j][k]);
for (int k=i;k>=0;k=(k-1)&i){
if (k&(1<<j)) dp[i][j]=max(dp[i][j],dp[i^k|(1<<j)][j]+num[k]);
if (k==0) break;
}
}
if ((1<<(n-1))&i) ans=min(ans,SUM-dp[i][n-1]);
}
write(ans);
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int INF = 1000 * 1000 * 1000;
const int N = 100;
int n;
int c[N][N];
int d[N];
bool used[N];
int prim() {
int i, res = 0;
for (i=0; i<n; i++) {
d[i] = INF;
used[i] = false;
}
d[0] = 0;
while (1) {
int v = -1;
for (i=0; i<n; i++)
if (!used[i] && (v==-1 || (v>=0 && d[i]<d[v])))
v = i;
if (v==-1) break;
used[v] = true;
res += d[v];
for (i=0; i<n; i++)
d[i] = min(d[i], c[v][i]);
}
return res;
}
int main() {
int i, j;
scanf("%d ", &n);
for (i=0; i<n; i++)
for (j=0; j<n; j++) {
scanf("%d ", &(c[i][j]));
if (c[i][j]==-1) c[i][j] = INF;
}
printf("%d\n", prim());
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(){
int X;
cin >> X;
int D = X%10;
X /= 10;
int C = X%10;
X /= 10;
int B = X%10;
X /= 10;
int A = X;
if(A+B+C+D==7){
cout <<A<<"+"<<B<<"+"<<C<<"+"<<D<<"=7";
}else if(A+B+C-D==7){
cout <<A<<"+"<<B<<"+"<<C<<"-"<<D<<"=7";
}else if(A+B-C+D==7){
cout <<A<<"+"<<B<<"-"<<C<<"+"<<D<<"=7";
}else if(A+B-C-D==7){
cout <<A<<"+"<<B<<"-"<<C<<"-"<<D<<"=7";
}else if(A-B+C+D==7){
cout <<A<<"-"<<B<<"+"<<C<<"+"<<D<<"=7";
}else if(A-B+C-D==7){
cout <<A<<"-"<<B<<"+"<<C<<"-"<<D<<"=7";
}else if(A-B-C+D==7){
cout <<A<<"-"<<B<<"-"<<C<<"+"<<D<<"=7";
}else if(A-B-C-D==7){
cout <<A<<"-"<<B<<"-"<<C<<"-"<<D<<"=7";
}
return 0;
} | #include<stdio.h>
int main(){
char nama1[102], nama2[102];
scanf("%s %s", nama1, nama2);
printf("%s%s\n", nama2, nama1);
return 0;
} | 0 |
#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;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
cin >> A.at(0);
ll ans = 0;
rep(i,N-1){
cin >> A.at(i+1);
if(A.at(i+1) < A.at(i)){
ans += A.at(i) - A.at(i+1);
A.at(i+1) = A.at(i);
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
typedef unsigned long long ull;
#define vvi std::vector<std::vector<int> >
#define vvs std::vector<std::vector<string> >
#define MODs 1000000007;
typedef long long int ll;
using namespace std;
int main(int argc, char const *argv[]) {
int N;
ll ans = 0;
string s, S, t, T="";
std::cin >> N;
std::cin >> s;
S = s.substr(0, N);
t = s.substr(N);
for(int i=0;i<N;i++) T+=t[N-1-i];
std::vector<int> num(26, 0);
for(int i=0;i<N;i++) num[S[i]-'a']++, num[T[i]-'a']--;
bool flag = true;
for(int i=0;i<26;i++) if(num[i]!=0) flag = false;
vvs str = vv(0, 2, "", string);
for(int i=0;i<(1<<N);i++){
int n = i+(1<<20), count=0;
string ah = "", bh = "";
while(count<N){
if(n%2==1) ah += T[count];
if(n%2==0) bh += T[count];
count++;
n/=2;
}
str.push_back(std::vector<string> {ah, bh});
}
sort(str.begin(), str.end());
for(int i=0;i<(1<<N);i++){
int n = i + (1<<20), count=0;
string ah="", bh="";
while(count<N){
if(n%2==1) ah += S[count];
if(n%2==0) bh += S[count];
count++;
n/=2;
}
int k = upper_bound(str.begin(), str.end(), std::vector<string> {ah,bh}) - lower_bound(str.begin(), str.end(), std::vector<string> {ah, bh});
ans += k;
}
std::cout << (!flag?0:ans) << '\n';
return 0;
}
| #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um =unordered_map<pair<string,string>,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void prt(T v){cout<<v<<'\n';}
template <typename T> inline bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> inline bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ld pi=3.14159265358979323846;
const ld eps=1e-10;
#define debug(v) cout<<#v<<": ";prt(v);
template <typename A,typename B>
inline void prt(pair<A,B> p){cout<<"("<<p.first<<", "<<p.second<<")\n";}
template <typename A,typename B,typename C>
inline void prt(tuple<A,B,C> p){cout<<"("<<get<0>(p)<<", "<<get<1>(p)<<", "<<get<2>(p)<<")\n";}
inline void prt(bool p){if(p)cout<<"True"<<'\n';else cout<<"False"<<'\n';}
template <typename T>
inline void prt(vector<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(deque<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(unordered_map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(set<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(multiset<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N;
cin >> N;
string S;
cin >> S;
reverse(S.begin()+N, S.end());
unordered_map<string,unordered_map<string,ll>> M;
for(ll i=0;i<(1LL<<N);++i){
string s="";
string t="";
for(ll j=0;j<N;++j){
if(i&(1LL<<j))s+=S[j];
else t+=S[j];
}
M[s][t]++;
}
S=S.substr(N,N);
ll ans=0;
for(ll i=0;i<(1LL<<N);++i){
string s="";
string t="";
for(ll j=0;j<N;++j){
if(i&(1LL<<j))s+=S[j];
else t+=S[j];
}
if(M[s][t]){ans+=M[s][t];}
}
prt(ans);
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct pos{
int x;
int y;
};
pos dir[] = {
{1, 0},
{-1, 0},
{0, 1},
{0, -1}
};
int main(){
int H, W;
int depth_max = 0;
vector<vector<int>> depth;
queue<pos> dest;
cin >> H >> W;
depth.resize(H, vector<int>(W, -1));
for (int i = 0; i < H; i++){
string str;
cin >> str;
for (int j = 0; j < W; j++){
char c = str[j];
if(c == '#'){
dest.push({i, j});
depth[i][j] = 0;
}
}
}
while(dest.size() != 0){
pos now = dest.front();
dest.pop();
for (int i = 0; i < 4; i++){
pos next = {now.x + dir[i].x, now.y + dir[i].y};
if(next.x < 0 || H <= next.x || next.y < 0 || W <= next.y){
continue;
}
if(depth[next.x][next.y] != -1){
if(depth[next.x][next.y] > depth[now.x][now.y] + 1){
depth[next.x][next.y] = depth[now.x][now.y] + 1;
dest.push(next);
}
continue;
}
depth[next.x][next.y] = depth[now.x][now.y] + 1;
dest.push(next);
}
}
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if(depth[i][j] > depth_max){
depth_max = depth[i][j];
}
}
}
cout << depth_max << endl;
} | //https://codeforces.com/blog/entry/64250?#comment-576206
#include<bits/stdc++.h>
#define ll double
ll dp[301][301][301];
ll solve(int one, int two, int three, int& n)
{
if(one < 0 || two < 0 || three < 0)
return 0;
if(three == 0 && two == 0 && one == 0)
return 0;
if(dp[one][two][three] > 0)
return dp[one][two][three];
int remaining = one + two + three;
ll exp_val = n + one * solve(one - 1, two, three, n)
+ two * solve(one + 1,two - 1, three, n)
+ three * solve(one, two + 1, three - 1, n);
return dp[one][two][three] = exp_val / remaining;
}
int main()
{
using namespace std;
int n;
cin >> n;
int one = 0, two = 0, three = 0;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
if(x == 1) one++;
else if(x == 2) two++;
else three++;
}
memset(dp, -1, sizeof(dp));
cout << fixed << setprecision(9) << solve(one, two, three, n);
return 0;
}
| 0 |
#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define mx 1000008
#define pii pair<int,int>
#define pi acos(-1.0)
#define pb push_back
#define ss second
#define ff first
typedef long long int ll;
///adjacent move
int fx[4]={0,+1,0,-1};
int fy[4]={+1,0,-1,0};
///knight
ll prime[mx];
void seive()
{
for(int i=2;i<mx;i+=2) prime[i]=2;
for(int i=3;i<mx;i+=2) prime[i]=i;
ll sq=sqrt(mx);
for(int i=3;i<=sq;i+=2){
if(prime[i]==i){
for(int j=i*i;j<mx;j+=i){
if(prime[j]==j) prime[j]=i;
}
}
}
}
int a[1000004];
ll f[2000004];
ll po[2000004];
int main()
{
//seive();
int t=1;
//cin>>t;
int c=0;
vector<ll>vec;
for(int i=2;i<mx;i++){
if(prime[i]==i){
vec.push_back(i);
}
}
while(t--){
ll n,m;
cin>>n;
ll a[n*2+7];
for(int i=1;i<=2*n;i++) cin>>a[i];
ll sum=0;
sort(a+1,a+2*n+1);
for(int i=1;i<=2*n;i++){
if(i&1) sum+=a[i];
}
cout<<sum<<endl;
}
}
| #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
int main() {
int N;
cin >> N;
set<ll> numbers;
map<ll, ll> map_numbers;
REP(i, N) {
ll tmp;
cin >> tmp;
numbers.insert(tmp);
map_numbers[tmp]++;
}
ll ans = 0;
FORR(t, 37, 1) {
ll x = pow(2, t-1);
ll y = pow(2, t);
if(numbers.size() == 0) break;
ll max = *numbers.rbegin();
if(max < x) continue;
set<ll> to_remove;
for(auto a = numbers.rbegin(); a != numbers.rend(); ++a) {
if(map_numbers[*a]==0) continue;
if(*a < x) break;
if(map_numbers[y - *a]>0 && *a != y - *a) {
ll num_pair = min(map_numbers[*a], map_numbers[y-*a]);
ans+=num_pair;
map_numbers[y-*a]-=num_pair;
map_numbers[*a]-=num_pair;
if(map_numbers[*a] == 0)
to_remove.insert(*a);
if(map_numbers[y-*a] == 0)
to_remove.insert(y-*a);
} else if(map_numbers[y - *a]>=2 && *a == y - *a) {
ll num_pair = map_numbers[*a] / 2;
ans+=num_pair;
map_numbers[*a]-=num_pair;
if(map_numbers[*a] == 0)
to_remove.insert(*a);
} else {
map_numbers[*a] = 0;
to_remove.insert(*a);
}
}
for(ll r: to_remove) {
numbers.erase(numbers.find(r));
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
#define ll long long
#define fr(i,a,n) for (int i=a;i<n;i++)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vipb(v) int x;cin>>x;v.pb(x);
#define vllpb(v) ll x;cin>>x;v.pb(x);
#define in(x) cin>>x;
#define in2(x,y) cin >> x >> y;
#define in3(x,y,z) cin>>x>>y>>z;
#define in4(a,x,y,z) cin>>a>>x>>y>>z;
#define in5(a,b,x,y,z) cin>>a>>b>>x>>y>>z;
typedef vector<int> VI;
typedef vector<ll> VL;
string s;
ll n, m, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
if (i + k -1<= n)
m++;
}
cout << m << endl;
return 0;
} | #include<iostream>
int main(){
int n,k;
std::cin >> n >> k;
std::cout << n-k+1;
return 0;
} | 1 |
#include <stdio.h>
int main() {
int A, B, pos = 0;
char S[20];
scanf("%d %d %s", &A, &B, S);
for (int i = 0; S[i] != '\0'; i++) {
if (S[i] == '-') {
pos += i;
}
}
pos == A ? puts("Yes") : puts("No");
return 0;
}
| #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
int a,b;
cin>>a>>b>>s;
bool flag=true;
for(int i=0;i<a;i++){
int num=s[i]-'0';
if(num<0||num>9)flag=false;
}
if(s[a]!='-')flag=false;
for(int i=a+1;i<a+b+1;i++){
int num=s[i]-'0';
if(num<0||num>9)flag=false;
}
if(flag)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vll vector<ll>
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(int argc, char const *argv[]) {
string s;std::cin >> s;
ll n;std::cin >> n;
for(int i=0;i<s.size();i+=n) std::cout << s[i];
std::cout << '\n';
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vvl vector<vl>
#define pii pair<int, int>
#define pli pair<ll, int>a
#define pb push_back
#define sz(x) int(x.size())
#define mp make_pair
#define all(a) (a).begin(),(a).end()
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; }
ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
const ll INF = 1LL << 60;
const int dh[4] = {1,0,-1,0};
const int dw[4] = {0,1,0,-1};
class UnionFind{
public:
vi Parent;
UnionFind(int n){
Parent = vi(n,-1);
}
int root(int a){
if(Parent[a] < 0) return a;
else return Parent[a] = root(Parent[a]);
}
int size(int a){
return -Parent[root(a)];
}
bool merge(int a, int b){
a = root(a);
b = root(b);
if(a == b) return false;
if(size(a) < size(b)) swap(a,b);
Parent[a] += Parent[b];
Parent[b] = a;
return true;
}
};
class Factrial{
public:
vl Fac;
Factrial(int MAX){
Fac = vl(MAX+1);
rep(i,MAX) {
if(i == 0) Fac[i+1] = 1;
else Fac[i+1] = ((i+1)*Fac[i])%MOD;
}
}
};
int main(){
string s; int w; cin >> s >> w;
string ans;
for(int i = 0; i < sz(s); i += w) {
ans += s[i];
}
cout << ans << endl;
} | 1 |
#include <iostream>
#include<string>
#include<map>
using namespace std;
int main(){
string s; cin >> s;
int check[26] = {};
for(int i = 0; i < s.size(); i++){
int t = s[i]-'a';
check[t] = 1;
}
for(int i = 0; i < 26; i++){
if(check[i] == 0) {
char ans = 'a' + i;
cout << ans << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int harshad(int n) {
int res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
int main() {
int n;
cin >> n;
int sum_of_digits = harshad(n);
if (n % sum_of_digits == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <cstring>
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <numeric>
#include <float.h>
#include <math.h>
#include <sstream>
#include <iterator>
using namespace std;
using Graph = vector<vector<int>>;
// repマクロの定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
// allマクロの定義
#define all(v) v.begin(), v.end()
// 大きい順
#define rall(v) v.rbegin(), v.rend()
#define vi vector<int>
#define vl vector<ll>
const long long INF = 1LL << 60;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
bool is_prime(const unsigned n){
switch(n){
case 0: // fall-through
case 1: return false;
case 2: // fall-through
case 3: return true;
} // n > 3 が保証された
if(n % 2 == 0 || n % 3 == 0) return false;
// n は 2 と 3 のいずれの倍数でもないことが保証された
// これより n は (6の倍数)-1 か (6の倍数)+1 である
// 6の倍数前後の数を使って試し割りをする
for(unsigned i = 5; i * i <= n; i += 6) {
if(n % i == 0) return false; // (6の倍数)-1
if(n % (i+2) == 0) return false; // (6の倍数)+1
}
return true;
}
map<int,int> mp;
int primeFactorization(int a){ //素因数分解を出力するプログラム
int i,sq;
if(a%2==0){ //偶数の場合
if(!mp.count(2)){
mp[2] = 1;
}
else{
mp[2] +=1;
}
return primeFactorization(a/2); //2で割った値で再帰
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){ //3以上√a以下の奇数の場合
if(a%i==0){
if(!mp.count(i)){
mp[i] = 1;
}
else{
mp[i] += 1;
}
return primeFactorization(a/i); //割れた値で再帰
}
}
//偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if(a!=1){ //aが1でないなら、a自身は素数
if(!mp.count(a))
mp[a] = 1;
else{
mp[a] += 1;
}
}
return 0;
}
ll kaizyou(ll n){
if(n == 1){
return 1;
}
else{
return (n * kaizyou(n-1)) % 1000000007;
}
}
int main(){
int A,B,M; cin >> A >> B >> M;
vi a(A);
vi b(B);
int p,q;
p = q = 100000000;
rep(i,A){
cin >> a[i];
chmin(p,a[i]);
}
rep(i,B) {
cin >> b[i];
chmin(q,b[i]);
}
int mi = p + q;
rep(i,M){
int x,y,c;cin >> x >> y >> c;
x--;
y--;
chmin(mi,a[x]+b[y]-c);
}
cout << mi << endl;
}
| #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B];
int x[M], y[M], c[M];
int a_min=1000000, b_min=1000000;
rep(i,A) {
cin >> a[i];
if(a[i] < a_min) a_min = a[i];
}
rep(i,B) {
cin >> b[i];
if(b[i] < b_min) b_min = b[i];
}
rep(i,M) cin >> x[i] >> y[i] >> c[i];
int res = a_min + b_min;
int price = 0;
for(int i=0; i<M; i++){
price = a[x[i]-1] + b[y[i]-1] - c[i];
if(price < res){
res = price;
}
}
cout << res << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
int ans = 0;
for(int i = 0; i < K; i++){
ans += A.at(N - 1 - i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.size() >= k && x > pq.top()) {
pq.pop();
pq.push(x);
}
}
int res = 0;
while (!pq.empty()) {
res += pq.top(); pq.pop();
}
cout << res << "\n";
}
| 1 |
#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#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 pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
pair<int, i_i> tab[100];
bool xsort(pair<int, i_i> qwe, pair<int, i_i> rty){
return qwe.X > rty.X;
}
bool ysort(pair<int, i_i> qwe, pair<int, i_i> rty){
return qwe.Y.X < rty.Y.X;
}
signed main(void){
int i, j;
for(int testcase = 0;testcase >= 0;testcase++){
int(n);
rep(i, n)tab[i] = mp(0, mp(i, 0));
rep(i, n * (n - 1) / 2){
int4(a, b, c, d);
--a; --b;
if(c == d){
++tab[a].X;
++tab[b].X;
}else if(c > d){
tab[a].X += 3;
}else{
tab[b].X += 3;
}
}
sort(tab, tab + n, xsort);
tab[0].Y.Y = 1;
rep1(i, n){
if(tab[i - 1].X == tab[i].X)tab[i].Y.Y = tab[i - 1].Y.Y;
else tab[i].Y.Y = i + 1;
}
sort(tab, tab + n, ysort);
rep(i, n)pri(tab[i].Y.Y);
/*/
//*/ break;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a, b, c, d, i, j, cnt=1, n;
int s[100]={ }, r[100];
cin >> n;
for (i=0; i<n*(n-1)/2; i++){
cin >> a >> b >> c >> d;
if (c>d){
s[a-1]+=3;
} else if (c<d){
s[b-1]+=3;
} else {
s[a-1]+=1; s[b-1]+=1;
}
}
for (i=0; i<n; i++){
for (j=0; j<n; j++){
if (s[i]<s[j]) cnt++;
}
cout << cnt << endl;
cnt=1;
}
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
int pre[n];
string str;
for(int i=0;i<n;i++){
cin >> pre[i];
}
cin >> str;
for(int i=0;i<str.size();i++){
for(int j=pre[i%n];j>0;j--){
str[i]--;
if(str[i]<=('A'-1)) str[i]='z';
if(str[i]==96 ) str[i] = 'Z';
}
}
cout << str << endl;
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll INF=1e18;
// Binary Indexed Tree (Fenwick Tree)
// https://youtu.be/lyHk98daDJo?t=7960
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
//末尾の要素(i&-i)をたす→一つ上の階層なので、要素の更新の時に使える
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
//末尾の要素(i&-i)を引く→一つ上の一つ左の階層なので、要素の総和をとる時に使える
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main() {
ll n,q;
cin>>n>>q;
BIT <ll> B(n);
vector<ll> a(n);
rep(i,n){
cin>>a[i];
B.add(i,a[i]);
}
rep(i,q){
ll t1,t2,t3;
cin>>t1>>t2>>t3;
if(t1==0){
B.add(t2,t3);
}
else{
ll ans=B.sum(t2,t3);
cout<<ans<<endl;
}
}
}
| 0 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
double d[10], v1, v2;
vector<int> result;
while (scanf("%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,%lf,\n",
d, d+1, d+2, d+3, d+4, d+5, d+6, d+7, d+8, d+9, &v1, &v2) != EOF) {
double hoge = 0;
for (int i = 0; i < 10; i++)
hoge += d[i];
hoge /= v1 + v2;
hoge *= v1;
for (int i = 0; i < 10; i++) {
hoge -= d[i];
if (hoge <= 0) {
result.push_back(i+1);
break;
}
}
}
for (int i = 0; i < result.size(); i++)
cout << result[i] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
double a[10], v1, v2;
double t1[11], t2[11];
int cross;
char k;
int i;
while(cin>>a[0]){
for(i=1; i<10; i++) cin>>k>>a[i];
cin>>k>>v1>>k>>v2;
t1[0]=0;
for(i=1; i<11; i++) t1[i]=t1[i-1]+a[i-1]/v1;
t2[10]=0;
for(i=9; i>=0; i--) t2[i]=t2[i+1]+a[i]/v2;
for(i=1; i<11; i++){
if(t1[i]>=t2[i]){
cross=i; break;
}
}
printf("%d\n", cross);
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
if(min({a.at(i-1),a.at(i),a.at((i+1)%(n+1))})==a.at(i)||max({a.at(i-1),a.at(i),a.at((i+1)%(n+1))})==a.at(i))
cout<<s-2*min(d.at(i-1),d.at(i))<<endl;
else
cout<<s<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> a(n + 2), d(n + 1), sd(n);
rep(i, n) cin >> a[i + 1];
int sum = 0;
rep(i, n + 1) {
d[i] = abs(a[i + 1] - a[i]);
sum += d[i];
}
rep(i, n)
sd[i] = abs(a[i + 2] - a[i]);
rep(i, n) {
cout << sum - d[i] - d[i + 1] + sd[i] << "\n";
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
string s;
cin >> s;
rep(i,s.size()-1){
if(s[i]=='A'&&s[i+1]=='C'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main()
{
string s;
cin >> s;
if(s.find("AC") != string::npos)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(1e6)+10;
int n,m,sum,s,a[maxn],b[maxn];
char S[maxn];
int N,id[maxn],d[maxn],tot;
bool cmpa(int x,int y) { return a[x]<a[y]; }
bool cmpb(int x,int y) { return b[x]>b[y]; }
int main() {
//freopen("1.txt","r",stdin);
read(n);
for (int i=1;i<=n;i++) {
scanf("%s",S+1);
m=strlen(S+1);
s=0;
for (int j=1;j<=m;j++) {
if (S[j]=='(') s++; else s--;
a[i]=max(a[i],-s);
}
sum+=s;
s=0;
for (int j=m;j>=1;j--) {
if (S[j]=='(') s++; else s--;
b[i]=max(b[i],s);
}
//printf("%d %d\n",a[i],b[i]);
}
if (sum!=0) { printf("No\n"); return 0; }
sum=0;
for (int i=1;i<=n;i++) if (b[i]>=a[i]) d[++tot]=i;
sort(d+1,d+tot+1,cmpa);
for (int i=1;i<=tot;i++) id[++N]=d[i];
tot=0;
for (int i=1;i<=n;i++) if (b[i]<a[i]) d[++tot]=i;
sort(d+1,d+tot+1,cmpb);
for (int i=1;i<=tot;i++) id[++N]=d[i];
for (int i=1;i<=N;i++) {
if (sum-a[id[i]]<0) { printf("No\n"); return 0; }
sum+=b[id[i]]-a[id[i]];
}
printf("Yes\n");
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ | #include <iostream>
#include <cstdlib>
const int MAX_SIZE = 1000000;
const int MAX_M = 100 + 1;
void insertionSort(int A[], int n, int g, int &count) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i -g;
while ((j >= 0) && (A[j] > v)) {
A[j + g] = A[j];
j -= g;
count = count + 1;
}
A[j + g] = v;
}
}
int main() {
int n = 0;
std::cin >> n;
int A[MAX_SIZE] = {0};
for (int i = 0; i < n; i++) {
std::cin >> A[i];
}
int m = 0;
int G[MAX_M] = {0};
G[0] = 1;
m++;
while (G[m] < n) {
int g = 3 * G[m - 1] + 1;
if (g >= n) {
break;
} else {
G[m] = g;
}
m++;
}
std::cout << m << std::endl;
int count = 0;
for (int i = m - 1; i >= 0; i--) {
std::cout << G[i];
if (i > 0) {
std::cout << " ";
} else {
std::cout << std::endl;
}
insertionSort(A, n, G[i], count);
}
std::cout << count << std::endl;
for (int i = 0; i < n; i++) {
std::cout << A[i] << std::endl;
}
return 0;
} | 0 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespace std;
#define mod 1000000007
class UF
{
private:
vector<int> root;
public:
UF(int n)
{
root = vector<int>(n + 1, -1);
}
int getroot(int n)
{
if(root[n] == -1) return n;
else return root[n] = getroot(root[n]);
}
void add(int x, int y)
{
x = getroot(x);
y = getroot(y);
if(x == y) return;
if(x > y) swap(x, y);
root[y] = x;
return;
}
};
int main()
{
int n;
cin >> n;
priority_queue<pair<int, pair<int, int> > > qu;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int w;
cin >> w;
if(w >= 0){
qu.push(make_pair(-w, make_pair(i, j)));
}
}
}
UF uf(n);
int ans = 0;
while(!qu.empty()){
int cost = -(qu.top()).first;
int x = ((qu.top()).second).first;
int y = ((qu.top()).second).second;
qu.pop();
if(uf.getroot(x) == uf.getroot(y)) continue;
ans += cost;
uf.add(x, y);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n; // number of vertices
int P[20200], A[20200], B[20200], C[20200];
pair<int, int> D[20200]; // Weights and coordinates
int root(int a) { // find the root of a
if (P[a] == a) return a; // a is the root
return (P[a] = root(P[a])); // find root of a, make it a's parent
}
bool is_same_set(int a, int b) { // a and b are in the same group?
return root(a) == root(b);
}
void unite(int a, int b) { // put a and b in same group
P[root(a)] = root(b);
}
int main() {
cin >> n; // the number of vertices
for (int i=0; i<n; ++i) {
P[i] = i; // Initialize vertices to disjoint sets
for (int j=0; j<n; ++j) {
A[(n * i) + j] = i;
B[(n * i) + j] = j;
cin >> C[(n * i) + j];
}
}
for (int i=0; i < n*n; i++) {
D[i].first = C[i];
D[i].second = i;
}
sort(D, D+n*n);
int sum = 0;
for (int i=0; i<n*n; ++i) {
if (D[i].first >= 0) { // Assuming the weight is not -1
if (!is_same_set(A[D[i].second], B[D[i].second])) {
unite(A[D[i].second], B[D[i].second]);
sum += D[i].first;
}
}
}
cout << sum << endl;
} | 1 |
// VU TRUONG AN
#include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
const int base = 200003;
const long long MM = 1ll * MOD * MOD;
int n;
bool Count(int x){
string s;
while(x > 0){
int pos = x % 10;
s += pos + '0';
x /= 10;
}
n = s.length();
s = " " + s;
for(int i = 1;i <= n / 2;++i){
if(s[i] != s[n - i + 1]) return 0;
}
return 1;
}
void Solve(){
int a,b;
cin >> a >> b;
int ans = 0;
for(int i = a;i <= b;++i){
ans += Count(i);
}
cout << ans;
}
void NumTime(){cerr << "Toi" << "\n";cerr << "Di" << "\n";cerr << "Chep" << "\n";cerr << "Code" << "\n";}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
#endif
int test = 1;
// cin >> test;
while(test--){
NumTime();
Solve();
}
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int answer = 0;
for (int i=A; i<=B; i++){
int a, b, c, d, e;
a = i % 10; //1の位
b = (i % 100 - i % 10) / 10; //10の位
c = (i % 1000 - i % 100) / 100; //100の位
d = (i % 10000 - i % 1000) / 1000; //1,000の位
e = (i % 100000 - i % 10000) / 10000; //10,000の位
if (a == e && b == d)
answer++;
}
cout << answer << endl;
}
| 1 |
#include <stdio.h>
int main(){
char name1[110];
char name2[110];
scanf("%s%s", &name1, &name2);
printf("%s%s", name2, name1);
return 0;
} | #include<bits/stdc++.h>
#define N 10
using namespace std;
int main(){
int a[N],b[N],ansa,ansb;
for(int i=0;i<N;i++)cin>>a[i];
for(int i=0;i<N;i++)cin>>b[i];
sort(a,a+N,greater<int>());
sort(b,b+N,greater<int>());
ansa=ansb=0;
for(int i=0;i<3;i++)ansa+=a[i];
for(int i=0;i<3;i++)ansb+=b[i];
cout<<ansa<<' '<<ansb<<endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main(void) {
int N;cin>>N;
vector<int> A(N + 2);
// departure
A.push_back(0);
for (int i = 1; i <= N; i++) cin>>A[i];
// goal
A.push_back(0);
int SUM[N + 1];
int sum = 0;
for (int i = 0; i <= N; i++) {
SUM[i] = abs(A[i + 1] - A[i]);
sum += SUM[i];
}
// 結果出力
for (int i = 1; i <= N; i++) {
cout << sum - SUM[i - 1] - SUM[i] + abs(A[i + 1] - A[i - 1]) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 16;
const int MAXL = (1 << 16) + 10;
const ll NEG = -1e18;
vector<int> grafo[MAXL];
ll valor[MAXL],dp[MAXL],mat[MAXN][MAXN];
int vis[MAXL],N;
void brute(int pos,int bitmask,int submask){
if(pos == N){
if(__builtin_popcount(submask) == 0) return;
grafo[bitmask].push_back(submask);
return;
}
brute(pos+1,bitmask,submask);
brute(pos+1, bitmask | (1 << pos), submask );
brute(pos+1, bitmask | (1 << pos), submask | (1 << pos) );
}
void calcula(){
for(int bitmask = 1;bitmask < (1 << N);bitmask++){
for(int i = 0;i<N;i++){
if(!(bitmask & (1 << i))) continue;
for(int j = i+1;j<N;j++){
if(!(bitmask & (1 << j))) continue;
valor[bitmask] += mat[i][j];
}
}
}
}
ll solve(int bitmask){
if(bitmask == 0) return 0;
if(vis[bitmask]) return dp[bitmask];
vis[bitmask] = 1;
ll best = NEG;
for(int submask : grafo[bitmask]){
best = max(best, solve(bitmask ^ submask) + valor[submask] );
}
return dp[bitmask] = best;
}
int main(){
cin >> N;
for(int i = 0;i<N;i++){
for(int j = 0;j<N;j++){
cin >> mat[i][j];
}
}
brute(0,0,0);
calcula();
cout << solve((1 << N) - 1) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(deg) (((deg)/360)*2*M_PI)
#define rad2deg(rad) (((rad)/2/M_PI)*360)
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
const ll INF = (1LL<<60);
const int INFi = (1<<29);
/*素数判定*/
bool is_prime(ll n){
if(n==1) return false;
for(ll i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return true;
}
/*約数列挙*/
vll enum_divisors(ll n){
vll l;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
l.push_back(i);
if(n/i != i) l.push_back(n/i);
}
}
sort(all(l));
return l;
}
/*素因数分解*/
vector<P> prime_factorize(ll n){
vector<P> l;
for(ll i=2;i*i<=n;i++){
if(n%i!=0) continue;
ll e = 0;
while(n%i==0){
e++;
n /= i;
}
l.push_back({i, e});
}
if(n!=1) l.push_back({n, 1});
return l;
}
/*最小公倍数*/
ll lcm(ll a, ll b){
return a*b/__gcd(a,b);
}
/*最大公約数*/
ll gcd(ll a, ll b){
return __gcd(a,b);
}
/*組み合わせ(Combination)*/
const ll CMAX = 1010000;
const ll CMOD = 1e9+7;
ll fac[CMAX], finv[CMAX], inv[CMAX];
// テーブルを作る前処理
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < CMAX; i++) {
fac[i] = fac[i - 1] * i % CMOD;
inv[i] = CMOD - inv[CMOD%i] * (CMOD / i) % CMOD;
finv[i] = finv[i - 1] * inv[i] % CMOD;
}
}
// 二項係数計算
ll comb(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % CMOD) % CMOD;
}
int main(){
ll n, q; cin >> n >> q;
string s; cin >> s;
vll l(q), r(q); rep(i, q) cin >> l[i] >> r[i];
vll a(n, 0);
a[0] = 0;
bool b = false;
if(s[0]=='A') b = true;
rep2(i, 1, n){
a[i] = a[i-1];
if(b && s[i]=='C'){
a[i]++;
}
if(s[i]=='A'){
b = true;
}
else{
b = false;
}
}
rep(i, q){
cout << a[r[i]-1]-a[l[i]-1] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int table[501][501];
int C[501][501];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, Q;
cin >> N >> M >> Q;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
table[l][r]++;
}
for (int i = 1; i <= N; i++) {
C[i][1] = table[i][1];
for (int j = 2; j <= N; j++) {
C[i][j] = C[i][j - 1] + table[i][j];
}
}
for (int i = 0; i < Q; i++) {
int p, q;
cin >> p >> q;
int ans = 0;
for (int i = p; i <= q; i++) {
ans += C[i][q] - C[i][p - 1];
}
cout << ans << endl;
}
return 0;
}
| 0 |
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
template <class T>
IN void in(T &x)
{
x = 0; R char c = gc;
for (; !isdigit(c); c = gc);
for (; isdigit(c); c = gc)
x = (x << 1) + (x << 3) + c - 48;
}
template <class T> IN T max(T a, T b) {return a > b ? a : b;}
template <class T> IN T min(T a, T b) {return a < b ? a : b;}
template <class T> IN T abs(T a) {return a > 0 ? a : -a;}
int n, q;
struct Node
{
ll val[3], tag;
Node(){std::memset(val, 63, sizeof(val));}
}tree[MX << 2];
IN void pushup(R int now)
{
tree[now].val[0] = min(tree[ls].val[0], tree[rs].val[0]);
tree[now].val[1] = min(tree[ls].val[1], tree[rs].val[1]);
tree[now].val[2] = min(tree[ls].val[2], tree[rs].val[2]);
}
IN void pushdown(R int now)
{
if (tree[now].tag)
{
tree[ls].val[0] += tree[now].tag;
tree[ls].val[1] += tree[now].tag;
tree[ls].val[2] += tree[now].tag;
tree[ls].tag += tree[now].tag;
tree[rs].val[0] += tree[now].tag;
tree[rs].val[1] += tree[now].tag;
tree[rs].val[2] += tree[now].tag;
tree[rs].tag += tree[now].tag;
tree[now].tag = 0;
}
}
void modify(R int now, R int lef, R int rig, R int pos, R ll v)
{
if (lef == rig)
{
tree[now].val[0] = v;
tree[now].val[1] = v - pos;
tree[now].val[2] = v + pos;
return;
}
pushdown(now);
int mid = lef + rig >> 1;
if (pos <= mid) modify(ls, lef, mid, pos, v);
else modify(rs, mid + 1, rig, pos, v);
pushup(now);
}
IN void add(R ll v)
{
tree[1].tag += v;
tree[1].val[0] += v;
tree[1].val[1] += v;
tree[1].val[2] += v;
}
ll query(R int now, R int lef, R int rig, R int lb, R int rb, R int id)
{
if (lef >= lb && rig <= rb) return tree[now].val[id];
pushdown(now);
int mid = lef + rig >> 1; ll ret = LONG_LONG_MAX;
if (lb <= mid) ret = query(ls, lef, mid, lb, rb, id);
if (rb > mid) ret = min(ret, query(rs, mid + 1, rig, lb, rb, id));
return ret;
}
int main(void)
{
int a, b, last, cur, del;
ll res1, res2, res3;
in(n), in(q), in(a), in(b);
in(last);
modify(1, 1, n, b, abs(last - a));
modify(1, 1, n, a, abs(last - b));
W (--q)
{
in(cur); del = abs(last - cur);
res1 = query(1, 1, n, cur, cur, 0) + del;
res2 = query(1, 1, n, 1, cur, 1) + cur;
res3 = query(1, 1, n, cur + 1, n, 2) - cur;
res1 = min(res1, min(res2, res3));
add(del);
modify(1, 1, n, last, res1);
last = cur;
}
printf("%lld", tree[1].val[0]);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,a,b) for(int i=(a),_end_=(b);i<=_end_;i++)
#define DREP(i,a,b) for(int i=(a),_end_=(b);i>=_end_;i--)
#define EREP(i,a) for(int i=start[(a)];i;i=e[i].next)
template<class T>inline void chkmax(T &a,T b){ if(a<b)a=b;}
template<class T>inline void chkmin(T &a,T b){ if(a>b)a=b;}
#define fi first
#define se second
#define mkr(a,b) make_pair(a,b)
inline int read()
{
int sum=0,p=1;char ch=getchar();
while(!(('0'<=ch && ch<='9') || ch=='-'))ch=getchar();
if(ch=='-')p=-1,ch=getchar();
while('0'<=ch && ch<='9')sum=sum*10+ch-48,ch=getchar();
return sum*p;
}
const int maxn=2e5+20;
int n,q,sta,stb,x[maxn];
ll s[maxn];
struct Fenwick_Tree {
int rev;
ll s[maxn];
Fenwick_Tree(int _rev=0){ rev=_rev;}
inline void Clear(){ memset(s,63,sizeof(s));}
inline void Add(int x,ll d){ for(x=rev?n-x+1:x;x<=n;x+=x&(-x))chkmin(s[x],d);}
inline ll Sum(int x){ ll res=1ll<<60; for(x=rev?n-x+1:x;x;x-=x&(-x))chkmin(res,s[x]); return res;}
}A(0),B(1);
inline void init()
{
n=read();q=read(); sta=read(); stb=read();
REP(i,1,q)x[i]=read();
}
ll dp[maxn];
ll ans=1ll<<60;
inline void doing()
{
A.Clear(); B.Clear();
x[0]=sta;
REP(i,2,q)s[i]=s[i-1]+abs(x[i]-x[i-1]);
dp[0]=abs(x[1]-stb); A.Add(sta,dp[0]-sta); B.Add(sta,dp[0]+sta);
REP(i,1,q)
{
dp[i]=s[i]+min(x[i+1]+A.Sum(x[i+1]) , -x[i+1] + B.Sum(x[i+1]));
A.Add(x[i],-s[i+1]-x[i]+dp[i]); B.Add(x[i],-s[i+1]+x[i]+dp[i]);
chkmin(ans,dp[i]+s[q]-s[i+1]);
}
}
int main()
{
init();
doing();
swap(sta,stb); doing();
printf("%lld\n",ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define scout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
bool isplime(int p){
if(p==1) return false;
for(int i=2;i<p;i++) {
if(p%i==0) return false;
}
return true;
}
int main() {
int n; cin >> n;
for(int i=31;i<=55555;i+=30) {
if(isplime(i)) {
if(i!=31) cout << " ";
cout << i;
n--;
}
if(n==0) break;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;//条件によってYes、Noを出力する
const int MOD=1000000007;
const double pi = 3.141592653589793;
//素数判定 O(√N)
bool isPrime(int64_t x){
if(x<=1){
return false;
}
for(int i=2 ;i*i<=x ;i++){
if(x%i==0){
return false;
}
}
return true;
}
int main(){
int n;
cin>>n;
vector<int> prime;
set<int> s;
vector<int> ans;
for(int i=2;i<=55555;i++){
if(isPrime(i)){
prime.push_back(i);
}
}
int sum=0;
int k=0;
//5で割って1余る素数だけ入れてけばどの5個選んでも5の倍数だね
//天才すぎる かっけえ・・・・・(思いつかなった)
while(ans.size()!=n){
if(prime[k]%5==1){
ans.push_back(prime[k]);
}
k++;
}
rep(i,n){
cout<<ans[i]<<" ";
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void milktea() {
int d, g;
cin >> d >> g;
vector<int> p(d), c(d);
for(int i = 0; i < d; i++) {
cin >> p[i] >> c[i];
}
int ans = 1e9;
for(int bit = 0; bit < (1 << d); bit++) {
int s = 0, num = 0, m = -1;
for(int i = 0; i < d; i++) {
if(bit & 1 << i) {
s += 100 * (i+1) * p[i] + c[i];
num += p[i];
} else {
m = i;
}
}
cout << '\n';
if(s < g) {
int s1 = 100 * (m+1);
int need = (g - s + s1 - 1) / s1;
if(need >= p[m]) continue;
num += need;
}
ans = min(ans, num);
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt=1;
//cin >> tt;
while(tt--) milktea();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
string S;
cin >> N >> S;
reverse(S.begin() + N, S.end());
map<pair<string, string>, int64_t> mp[2];
for (int64_t i = 0; i < (1LL << N); i++) {
for (int64_t j = 0; j < 2; j++) {
string str1, str2;
for (int64_t k = 0; k < N; k++) {
if (i & (1LL << k)) {
str1 += S[k + N * j];
} else {
str2 += S[k + N * j];
}
}
mp[j][make_pair(str1, str2)]++;
}
}
int64_t ans = 0;
for (const auto& p : mp[0]) {
ans += mp[0][p.first] * mp[1][p.first];
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2005;
int n, m, q;
char B[Maxn][Maxn];
int sq[Maxn][Maxn];
int edH[Maxn][Maxn], edV[Maxn][Maxn];
int main()
{
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n; i++)
scanf("%s", B[i] + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (i + 1 <= n && B[i][j] == '1' && B[i + 1][j] == '1')
edH[i + 1][j]++;
if (j + 1 <= m && B[i][j] == '1' && B[i][j + 1] == '1')
edV[i][j + 1]++;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
sq[i][j] = sq[i - 1][j] + sq[i][j - 1] - sq[i - 1][j - 1] + int(B[i][j] == '1');
edH[i][j] += edH[i - 1][j] + edH[i][j - 1] - edH[i - 1][j - 1];
edV[i][j] += edV[i - 1][j] + edV[i][j - 1] - edV[i - 1][j - 1];
}
while (q--) {
int r1, c1, r2, c2; scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
int V = sq[r2][c2] - sq[r1 - 1][c2] - sq[r2][c1 - 1] + sq[r1 - 1][c1 - 1];
int E = edH[r2][c2] - edH[r1][c2] - edH[r2][c1 - 1] + edH[r1][c1 - 1] +
edV[r2][c2] - edV[r1 - 1][c2] - edV[r2][c1] + edV[r1 - 1][c1];
printf("%d\n", V - E);
}
return 0;
}
| #include<cmath>
#include<cstdio>
#include<cctype>
#include<vector>
inline int getint() {
register char ch;
while(!isdigit(ch=getchar()));
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
const int N=600;
int n,d1,d2,col[2][N*N];
std::vector<std::pair<int,int>> v[2];
inline int id(const int &x,const int &y) {
return x*N+y;
}
inline bool check(const int &x) {
return 0<=x&&x<n*2;
}
void dfs(const int &x,const int &t) {
const int i=x/N,j=x%N;
for(auto &d:v[t]) {
const int nx=i+d.first,ny=j+d.second;
if(!check(nx)||!check(ny)) continue;
const int y=id(i+d.first,j+d.second);
if(!col[t][y]) {
col[t][y]=col[t][x]==1?2:1;
dfs(y,t);
}
}
}
int main() {
n=getint(),d1=getint(),d2=getint();
for(register int i=0;i<=d1;i++) {
const int j=sqrt(d1-i*i);
if(i*i+j*j!=d1) continue;
v[0].emplace_back(std::make_pair(i,j));
v[0].emplace_back(std::make_pair(-i,j));
v[0].emplace_back(std::make_pair(i,-j));
v[0].emplace_back(std::make_pair(-i,-j));
}
for(register int i=0;i<=d2;i++) {
const int j=sqrt(d2-i*i);
if(i*i+j*j!=d2) continue;
v[1].emplace_back(std::make_pair(i,j));
v[1].emplace_back(std::make_pair(-i,j));
v[1].emplace_back(std::make_pair(i,-j));
v[1].emplace_back(std::make_pair(-i,-j));
}
for(register int i=0;i<n*2;i++) {
for(register int j=0;j<n*2;j++) {
if(!col[0][id(i,j)]) {
col[0][id(i,j)]=1;
dfs(id(i,j),0);
}
if(!col[1][id(i,j)]) {
col[1][id(i,j)]=1;
dfs(id(i,j),1);
}
}
}
for(register int i=0,cnt=0;i<n*2;i++) {
for(register int j=0;j<n*2;j++) {
if(col[0][id(i,j)]==1&&col[1][id(i,j)]==1) {
printf("%d %d\n",i,j);
if(++cnt==n*n) return 0;
}
}
}
} | 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << max(n - h + 1, 1) * max(n - w + 1, 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {if(a < b) {a= b;return 1;}return 0;}
template <class T> inline bool chmin(T &a, T b) {if(a > b) {a= b;return 1;}return 0;}
ll mod= 1e9 + 7;
int main(){
string a,b,c;
cin >> a >>b >> c;
int an=a.size(),bn=b.size(),cn=c.size();
if(a[an-1]==b[0] && b[bn-1]==c[0]){cout << "YES" << endl;}else{cout << "NO" <<endl;}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(){ T x; cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main()
{
while (int e = in()){
int m = 1e8;
for (int z = 0; z <= 100; ++z){
for (int y = 0; y <= 1000; ++y){
int x = e - (sq(z) * z + sq(y));
if (x < 0) continue;
m = min(m, z + y + x);
}
}
printf("%d\n", m);
}
return (0);
} | #include <iostream>
using namespace std;
int main() {
int e,small ;
while(cin >> e && e>0){
small = e;
for(int z = 0; z*z*z <= e; z++){
for(int y = 0; y*y+z*z*z <= e; y++){
int x = e-y*y-(z*z)*z;
small=min(small, x+y+z);
}
}
cout << small << endl ;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int fa[101000],n,k,ans,f[101000];
vector<int> e[101000];
void dfs(int x){
int mx=0;
for(int v:e[x]) dfs(v),mx=max(mx,f[v]+1);
if(x==1||fa[x]==1) return;
if(mx==k-1) ans++,f[x]=-1;
else f[x]=mx;
}
int main(){
read(n);read(k);
for(int i=1;i<=n;i++) read(fa[i]);
if(fa[1]!=1) fa[1]=1,ans=1;
for(int i=2;i<=n;i++) e[fa[i]].push_back(i);
dfs(1);
cout<<ans<<'\n';
return 0;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define x first
#define y second
typedef pair<int,int> pii;
const int MAXN=105;
int n,m;
int sumr[MAXN][MAXN],sumc[MAXN][MAXN],f[MAXN][MAXN][MAXN];
char s[MAXN][MAXN];
pii ed;
int main(){
//freopen("robot.in","r",stdin);
//freopen("robot.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%s",s[i]+1);
for(int j=1;j<=m;j++){
sumr[i][j]=sumr[i-1][j];
sumc[i][j]=sumc[i][j-1];
if(s[i][j]=='o') sumr[i][j]++,sumc[i][j]++;
if(s[i][j]=='E') ed.x=i,ed.y=j;
}
}
int ans=0;
memset(f,-1,sizeof f);
f[0][0][0]=0;
int U=ed.x-1,D=n-ed.x,L=ed.y-1,R=m-ed.y;
for(int l=0;l<=L;l++)
for(int r=0;r<=R;r++)
for(int u=0;u<=U;u++)
for(int d=0;d<=D;d++){
if(f[r][u][d]==-1) continue;
ans=max(ans,f[r][u][d]);
int left=max(r+1,ed.y-l),right=min(m-l,ed.y+r);
int up=max(d+1,ed.x-u),down=min(n-u,ed.x+d);
if(left>right||up>down) continue;
int temp;
if(u<U-d){
temp=sumc[ed.x-u-1][right]-sumc[ed.x-u-1][left-1];
f[r][u+1][d]=max(f[r][u+1][d],f[r][u][d]+temp);
}
if(d<D-u){
temp=sumc[ed.x+d+1][right]-sumc[ed.x+d+1][left-1];
f[r][u][d+1]=max(f[r][u][d+1],f[r][u][d]+temp);
}
if(r<R-l){
temp=sumr[down][ed.y+r+1]-sumr[up-1][ed.y+r+1];
f[r+1][u][d]=max(f[r+1][u][d],f[r][u][d]+temp);
}
if(l<L-r){
temp=sumr[down][ed.y-l-1]-sumr[up-1][ed.y-l-1];
f[r][u][d]=max(f[r][u][d],f[r][u][d]+temp);
}
}
printf("%d",ans);
fclose(stdin);
fclose(stdout);
}
| 0 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(ll i = 0; i < n; i++)
int main(){
int x;
cin >> x;
cout << x * x * x << endl;
}
| #include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int n;
cin >> str;
cin >> n;
while (n-- > 0) {
string q, p;
int a, b, size;
cin >> q;
cin >> a >> b;
size = b - a + 1;
if (q == "print") {
cout << str.substr(a, size) << endl;
} else if (q == "reverse") {
string sub = str.substr(a, size);
for (int i = a, i_ = sub.length() - 1; i_ < sub.length(); ++i, --i_) {
str[i] = sub[i_];
}
} else {
cin >> p;
str.replace(a, size, p);
}
}
} | #include<iostream>
using namespace std;
string rep(string s,int a,int b,string p);
string rev(string s,int a,int b);
void pri(string s,int a,int b);
int main(){
string code,k,p;
int n,a,b;
string haki;
getline(cin,code);
cin >> n;
getline(cin, haki);
for(int i = 0; i < n; i++){
cin >> k;
if(k == "replace"){
cin >> a >> b >> p;
code = rep(code ,a,b,p);
}else if(k == "reverse"){
cin >> a >> b;
code =rev(code , a,b);
}else if(k == "print"){
cin >> a >> b;
pri(code, a,b);
}
getline(cin,haki);
}
}
string rep(string s,int a, int b, string p){
for(int i = a; i <=b; i++){
s[i] = p[i-a];
}
return s;
}string rev(string s, int a, int b){
string p = s;
for(int i = a; i <= b; i++){
s[i] = p[b-i+a];
}
return s;
}
void pri(string s, int a, int b){
for(int i = a; i <= b;i++){
cout <<s[i];
}
cout << endl;
}
| 1 |
//#define MYDEBUG
#include <bits/stdc++.h>
#ifdef MYDEBUG
#define dbp(x) cout<<#x<<": "<<x<<endl
#define dbp2(x,y) cout<<#x<<","<<#y<<": "<<x<<","<<y<<endl
#define dbp3(x,y,z) cout<<#x<<","<<#y<<","<<#z<<": "<<x<<","<<y<<","<<z<<endl
#define dbp4(w,x,y,z) cout<<#w<<","<<#x<<","<<#y<<","<<#z<<": "<<w<<","<<x<<","<<y<<","<<z<<endl
#define ifcin(x) std::ifstream cin(x)
#else
#define dbp(x)
#define dbp2(x,y)
#define dbp3(x,y,z)
#define dbp4(w,x,y,z)
#define ifcin(x)
#endif
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define rep(i, from, to) for(int i=from; i<to; ++i)
#define REP(i, from, to) for(int i=from; i<=to; ++i)
#define EPS = 1e-14;
using std::vector;
using std::cout;
using std::cin;
using std::endl;
using std::max;
using std::min;
using std::swap;
using std::string;
using std::fill;
using std::pair;
using std::sort;
using std::reverse;
using std::pair;
using std::greater;
using std::priority_queue;
using std::ostream;
typedef std::complex<int> P;
template<typename T>
ostream& operator<<(ostream& out, const vector<vector<T> >& v) {
for (size_t i = 0; i < v.size(); ++i) {
out << v[i] << endl;
}
return out;
}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
out << "[";
size_t last = v.size() - 1;
for (size_t i = 0; i < v.size(); ++i) {
out << v[i];
if (i != last) {
out << ",";
}
}
out << "]";
return out;
}
const int MAX_N = 1 << 17;
const int LAZY_INIT = -1;
const int VAL_INIT = INT_MAX;
int N = 1;
int mini[MAX_N*2], lazy[MAX_N*2];
void init(int n_){
while(N < n_){
N *= 2;
}
for(int i = 0; i < N*2 - 1; ++i){
lazy[i] = LAZY_INIT;
mini[i] = VAL_INIT;
}
}
void setLazy(int k, int v){
lazy[k] = v;
mini[k] = v;
}
void push(int k){
if(lazy[k] == LAZY_INIT){
return;
}
setLazy(k*2+1, lazy[k]);
setLazy(k*2+2, lazy[k]);
lazy[k] = LAZY_INIT;
}
void fix(int k){
mini[k] = min(mini[k*2+1], mini[k*2+2]);
}
void fill(int qL, int qR, int val, int k=0, int nL=0, int nR=N){
if(nR<=qL || qR<=nL){
return;
}
if(qL<=nL && nR<=qR){
setLazy(k, val);
return;
}
push(k);
int nM = (nL+nR)/2;
fill(qL, qR, val, k*2+1, nL, nM);
fill(qL, qR, val, k*2+2, nM, nR);
fix(k);
}
int minimum(int qL, int qR, int k=0, int nL=0, int nR=N){
if(qR<=nL || nR <=qL){
return VAL_INIT;
}
if(qL<=nL && nR<=qR){
return mini[k];
}
push(k);
int nM = (nL+nR)/2;
int vl = minimum(qL, qR, k*2+1, nL, nM);
int vr = minimum(qL, qR, k*2+2, nM, nR);
return min(vl, vr);
}
void print(){
cout << "mini: ";
rep(i, 0, N-1+N){
cout << mini[i] << ",";
}
cout << endl;
cout << "lazy: ";
rep(i, 0, N-1+N){
cout << lazy[i] << ",";
}
cout << endl;
}
int n, q;
void solve() {
ifcin("/storage/emulated/0/AppProjects/AtCoder/jni/in.txt");
cin >> n >> q;
init(n);
rep(query_index, 0, q){
int com;
cin >> com;
if(com==0){
int s,t,x;
cin >> s >> t >> x;
//print();
fill(s, t+1, x);
//dbp4(N, s,t,x);
//print();
//cout << endl;
}else{
int i;
cin >> i;
cout << minimum(i, i+1) << endl;
}
}
}
int main() {
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second
int n, m;
int x, y;
int a[110][110];
char buf[110];
void in(){
read(n, m);
for(int i=1; i<=n; ++i){
scanf("%s", buf+1);
for(int j=1; j<=m; ++j){
a[i][j]=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
if(buf[j] == 'o'){
++a[i][j];
} else if(buf[j] == 'E'){
x=i; y=j;
}
}
}
}
int dp[102][102][102][102];
int rect(int L1, int R1, int D1, int U1, int L2, int R2, int D2, int U2){
int L=max(L1, L2);
int R=min(R1, R2);
int D=max(D1, D2);
int U=min(U1, U2);
if(L>R || D>U) return 0;
if(0) printf("%d %d %d %d\n", L, R, D, U);
return a[R][U]-a[L-1][U]-a[R][D-1]+a[L-1][D-1];
}
int main()
{
in();
for(int w=1; w<=n; ++w){
for(int h=1; h<=m; ++h){
for(int l=1; l+w-1<=n; ++l){
int r=l+w-1;
if(x<l || r<x) continue;
for(int d=1; d+h-1<=m; ++d){
int u=d+h-1;
if(y<d || u<y) continue;
int me=dp[l][r][d][u];
auto f = [&](int A, int B, int C, int D){
int I=l+A;
int J=r+B;
int K=d+C;
int L=u+D;
int nv = rect(1+(r-x), n-(x-l), 1+(u-y), m-(y-d),
(A||B)?(A?I:J):(I),
(A||B)?(A?I:J):(J),
(C||D)?(C?K:L):(K),
(C||D)?(C?K:L):(L)
);
int& T=dp[I][J][K][L];
if(T < me+nv){
if(0) printf("upd from %d-%d, %d-%d to df %d %d %d %d : %d+%d = %d\n",
l,r,d,u, A,B,C,D, me, nv, me+nv);
}
T=max(T, me+nv);
};
if(1 < l) f(-1, 0, 0, 0);
if(r < n) f(0, 1, 0, 0);
if(1 < d) f(0, 0, -1, 0);
if(u < m) f(0, 0, 0, 1);
}
}
}
}
printf("%d\n", dp[1][n][1][m]);
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define el '\n'
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x) cout<<"debug: "<<x<<endl
#define $in(v,n) ;rep(II,0,n)cin>>v[II]
inline void IN(void){return;}
template<typename F,typename... R>inline void IN(F& f, R&... r){cin>>f;IN(r...);}
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int main(){
int n, r;
IN(n, r);
if(n >= 10) cout << r << el;
else {
r += 100*(10-n);
cout << r << el;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
set<ll> data;
ll n;
cin >> n;
rep(i,0,n){
ll a;
cin >> a;
if(data.count(a)){
data.erase(a);
}else{
data.insert(a);
}
}
cout<<data.size()<<endl;
return 0;
} | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int h,w;
scanf("%d %d",&h, &w);
int aaiDeffer[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
scanf("%d", &aaiDeffer[i][j]);
}
}
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
int x;
scanf("%d", &x);
aaiDeffer[i][j] = abs(aaiDeffer[i][j] - x); //aaiDeffer[i][j]に2整数の差を入れる
}
}
vector<vector<vector<char>>> vvviCanValue(h, vector<vector<char>>(w, vector<char>(12801, 0))); //(i,j)が0~12800の値を取れるか
vvviCanValue[0][0][aaiDeffer[0][0]] = 1;
for(int i = 1; i < h; i++){
for(int j = 0; j < 12801; j++){
if(vvviCanValue[i - 1][0][j] == 1){
int x = aaiDeffer[i][0];
vvviCanValue[i][0][abs(j - x)] = 1;
vvviCanValue[i][0][j + x] = 1;
}
}
}
for(int i = 1; i < w; i++){
for(int j = 0; j < 12801; j++){
if(vvviCanValue[0][i - 1][j] == 1){
int x = aaiDeffer[0][i];
vvviCanValue[0][i][abs(j - x)] = 1;
vvviCanValue[0][i][j + x] = 1;
}
}
}
for(int i = 1; i < h; i++){
for(int j = 1; j < w; j++){
for(int k = 0; k < 12801; k++){
if(vvviCanValue[i - 1][j][k] == 1 || vvviCanValue[i][j - 1][k] == 1){
int x = aaiDeffer[i][j];
vvviCanValue[i][j][abs(k - x)] = 1;
vvviCanValue[i][j][k + x] = 1;
}
}
}
}
for(int i = 0; i < 12801; i++){
if(vvviCanValue[h-1][w-1][i] == 1){
printf("%d",i);
break;
}
}
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string data;
int n;
cin>>data>>n;
while (n--){
string order,p; int a,b;
cin>>order>>a>>b;
if (order=="replace"){
cin>>p;
data.replace(a,b-a+1,p);
}
else if(order=="reverse") reverse(begin(data)+a,begin(data)+b+1);
else if (order=="print") cout<<data.substr(a,b-a+1)<<endl;
}
return 0;
} | 0 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
int main() {
ll n, y;
cin >> n >> y;
y /= 1000;
ll yc = 0;
for (ll i = 0; i < n+1; i++) {
for(ll j = 0; j < n+1; j++) {
if (i+j > n) continue;
yc = 10*i+5*j+(n-(i+j));
if (yc == y) {
printf("%lld %lld %lld", i, j, n-(i+j));
re0;
}
}
}
mes("-1 -1 -1");
} |
#include <bits/stdc++.h>
using namespace std;
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
// syntax sugar: `for (int i = 0; i < N; ++i)`
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
// syntax sugar: 多次元vector
#define VECTOR_DIM3(T, name, d1, d2, d3, initValue) \
std::vector<std::vector<std::vector<T>>> name(d1, std::vector<std::vector<T>>(d2, std::vector<int>(d3, initValue)));
#define VECTOR_DIM2(T, name, d1, d2, initValue) \
std::vector<std::vector<T>> name(d1, std::vector<T>(d2, initValue));
#define VECTOR_DIM1(T, name, d1, initValue) \
std::vector<T> name(d1, initValue);
#define ll long long
#define ld long double
// ABC085C - Otoshidama
int main(){
int n, y; // 1 <= n <= 2000
cin >> n >> y;
for (int a = 0; a <= n; ++a) {
const int total = a * 10000;
if (y < total) {
break;
}
for (int b = 0; b <= n-a; ++b) {
const int total2 = total + b * 5000;
if (y < total2) {
break;
}
const int c = (n-a-b);
if (total2 + c * 1000 == y) {
cout << a << " " << b << " " << c << endl;
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
const double eps=1e-9;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template<class graph_type,class T> std::vector<T> spfa(const graph_type &graph,const int start){
std::vector<T> dist(graph.size(),std::numeric_limits<T>::max());
std::deque<int> dq;
std::vector<bool> in_dq(graph.size(),false);
dist[start]=0;
dq.push_back(start);
in_dq[start]=true;
int64_t denom=1,numer=0;
auto small_label_first=[&](){
const int u=dq.front(),v=dq.back();
if(dist[u]>dist[v]){
dq.pop_back();
dq.push_front(v);
}
};
auto large_label_last=[&](){
while(dist[dq.front()]*denom>numer){
dq.push_back(dq.front());
dq.pop_front();
}
};
while(!dq.empty()){
const int u=dq.front();
dq.pop_front();
in_dq[u]=false;
--denom;
numer-=dist[u];
for(const auto &edge:graph[u]){
const int v=edge.first;
if(dist[v]>dist[u]+edge.second){
dist[v]=dist[u]+edge.second;
if(!in_dq[v]){
dq.push_back(v);
in_dq[v]=true;
++denom;
numer+=dist[v];
small_label_first();
large_label_last();
}
}
}
}
return dist;
}
void solve(){
int v,e,r;
cin >> v >> e >> r;
vector<vector<pair<int,int>>> graph(v);
rep(i,0,e){
int s,t,d;
cin >> s >> t >> d;
graph[s].push_back(make_pair(t,d));
}
vector<int> dist=spfa<vector<vector<pair<int,int>>>,int>(graph,r);
rep(i,0,v){
if(dist[i]==std::numeric_limits<int>::max()) cout << "INF" << endl;
else cout << dist[i] << endl;
}
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(10);
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
const int INF=1e9+10;
const int N=1e5+10;
struct edge
{
int to,cost;
edge(){}
edge(int t,int c):to(t),cost(c){}
};
vector<edge> G[N];
int V,E,S;
int d[N];
void init(int n)
{
for(int i=0;i<=n;i++) G[i].clear();
}
void Dijkstra(int s)
{
fill(d,d+V,INF);
d[s]=0;
priority_queue<P,vector<P>,greater<P> > q;
q.push(P(0,s));
while(!q.empty())
{
P tmp=q.top();q.pop();
int v=tmp.second;
if(d[v]<tmp.first) continue;
for(int i=0;i<G[v].size();i++)
{
edge &e=G[v][i];
if(d[e.to]>d[v]+e.cost&&d[v]!=INF)
{
d[e.to]=d[v]+e.cost;
q.push(P(d[e.to],e.to));
}
}
}
}
int main()
{
while(scanf("%d %d %d",&V,&E,&S)!=EOF)
{
init(V);
for(int i=0;i<E;i++)
{
int s,t,c;
scanf("%d %d %d",&s,&t,&c);
G[s].push_back(edge(t,c));
}
Dijkstra(S);
for(int i=0;i<V;i++)
{
if(d[i]==INF)
{
puts("INF");
continue;
}
printf("%d\n",d[i]);
}
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int bit[55][55];
void add(int x, int y){
for(int i=x;i>0;i-=(i&-i)){
for(int j=y;j>0;j-=(j&-j)){
bit[i][j]++;
}
}
}
ll get(int x, int y){
ll ret =0;
for(int i=x;i<55;i+=(i&-i)){
for(int j=y;j<55;j+=(j&-j)){
ret+=bit[i][j];
}
}
return ret;
}
ll get2(ll x){
ll ret = 1;
while(x%2==0){
ret++;
x/=2;
}
return ret;
}
ll get5(ll x){
ll ret = 1;
while(x%5==0){
ret++;
x/=5;
}
return ret;
}
void solve(){
int n;
cin>>n;
ll ans = 0;
for(int i=1;i<=n;i++){
ld inp;
cin>>inp;
ll trt = llround(inp*1e9);
ll x = get2(trt);
ll y = get5(trt);
ll xp = max(1ll,20-x);
ll yp = max(1ll,20-y);
ans+=get(xp,yp);
add(x,y);
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for(int i = a ; i < (int)n ; i++)
using namespace std;
int A[100001];
int partition(int p, int r){
int i;
i = p-1;
REP(j, p, r){
if(A[j] <= A[r]){
i++;
swap(A[i], A[j]);
}
}
swap(A[i+1], A[r]);
return i+1;
}
signed main(){
int n;
cin >> n;
rep(i, n){
cin >> A[i];
}
int ret = partition(0, n-1);
rep(i, n){
if(i > 0) cout << " ";
if(ret == i){
cout << "[" << A[i] << "]";
}else{
cout << A[i];
}
}
puts("");
} | 0 |
#include<bits/stdc++.h>
//g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> M;
rep(i, N) {
map<ll, ll>::iterator it = M.lower_bound(A[i]);
if(M.size() == 0 || it == M.begin()) {
M[A[i]]++;
} else {
it--;
(*it).second--;
if((*it).second == 0) {
M.erase(it);
}
M[A[i]]++;
}
}
ll ans = 0;
for(pair<ll, ll> item: M) {
ans += item.second;
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;++i) cin >> a[i];
multiset<int> ms;
for(int i=0;i<n;++i){
int s=a[i];
auto itr=ms.lower_bound(s);
if(itr!=ms.begin())ms.erase(--itr);
ms.insert(s);
}
cout << ms.size() << endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
map<ll,ll> mp;
for(int i = 0;i < n;i++)cin >> a[i],mp[a[i]]++;
sort(a.rbegin(),a.rend());
ll res = 0;
for(int i = 0;i < n;i++){
if(mp[a[i]] == 0)continue;
mp[a[i]]--;
ll now = 2;
while(1){
if(now > a[i])break;
now *= 2;
}
ll pan = now - a[i];
if(mp[pan] >= 1)res++,mp[pan]--;
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N; cin>>N;
vi A(N);
rep(i,0,N) cin>>A[i];
int ans=0;
map<int,int,greater<int>> M;
rep(i,0,N) M[A[i]]++;
for(auto p:M){
int X=p.first;
REP(i,1,60){
int P=(1ll<<60-i);
if(M.count(P-X)){
if(P-X==X){
ans+=M[X]/2;
M[X]%=2;
}
else{
int Q=min(M[P-X],M[X]);
ans+=Q;
M[P-X]-=Q;
M[X]-=Q;
}
}
}
}
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int a[N+5], dp[N+5], cnt;
int main(){
int n; scanf("%d", &n);
for (int i = 1; i <= n; ++i){
scanf("%d", a+i);
}
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i){
int pos = upper_bound(dp + 1, dp + cnt + 1, a[i]) - dp;
dp[pos] = a[i]; cnt = max(cnt, pos);
}
printf("%d\n", cnt);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
Graph G;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> b;
rep(i, n){
int a; cin >> a;
if(b.empty()){
b.push_back(a);
continue;
}else{
auto itr = lower_bound(b.begin(), b.end(), a);
int idx = distance(b.begin(), itr);
if(idx == 0) b.insert(b.begin(), a);
else b[idx - 1] = a;
}
}
//for(auto it : b) cout << it << endl;
cout << b.size() << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <stack>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main()
{
string str;
cin >> str;
if (str.size() < 26)
{
map<char, ll> mp;
for (ll i = 0; i < str.size(); i++)
{
mp[str[i]]++;
}
for (char i = 'a'; i < 'z' + 1; i++)
{
if (mp[i] == 0)
{
cout << str + i << endl;
return 0;
}
}
}
ll index = str.size() - 1;
for (ll i = str.size() - 1; i > 0 ; i--)
{
if (str[i - 1] > str[i])
{
index = i - 1;
}
else break;
}
if (index == 0)
{
cout << -1 << endl;
return 0;
}
string q = str.substr(index, 1);
for (ll i = index; i < str.size(); i++)
{
if (str.substr(index - 1, 1) < str.substr(i, 1))
{
q = min(q, str.substr(i, 1));
}
}
string ans;
if (index != 1)
{
ans += str.substr(0, index - 1);
}
cout << ans + q << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
//find_by_order(k):returns iterator to kth element starting from 0
//order_of_key(k):returns count of elements strictly smaller than k
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "C:\Users\navodit\Desktop\mycodes\pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
void solve(){
map<string,int> week;
week["MON"] = 1;
week["TUE"] = 2; week["WED"] = 3; week["THU"] = 4; week["FRI"] = 5; week["SAT"] = 6;
week["SUN"] = 0;
string s;
cin >> s;
cout << 7 - week[s];
}
signed main() {
unsyncIO();
int tt =1 ;
// cin >> tt;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| 0 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
//#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int main(void)
{
int N;
cin >> N;
lli x;
cin >> x;
lli a[N];
for (int i = 0; i < N; i++)
{
cin >> a[i];
}
sort(a, a + N);
lli sum[N + 1];
fill(sum, sum + N + 1, 0);
int cnt = 0;
for (int i = 1; i <= N; i++)
{
sum[i] = sum[i - 1] + a[i - 1];
}
for (int i = 0; i <= N; i++)
{
if (sum[i] > x)
{
cout << i - 1 << endl;
return 0;
}
else if (sum[i] == x)
{
cout << i << endl;
return 0;
}
else if (i == N)
{
cout << N - 1 << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x,sum=0;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int ans=0;
for(int i=0;i<n;i++)
{
if(sum+a[i]<=x&&i<n-1)
{
++ans;
sum+=a[i];
}
else if(sum+a[i]<=x && i==n-1)
{
if(sum+a[i]==x)
++ans;
}
else
break;
}
cout<<ans;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int N, A[100000];
bool check()
{
int even = 0, odd = 0;
for(int i = 0; i < N; i++) {
if(A[i] & 1) ++odd;
else ++even;
}
if(even & 1) return (true);
if(odd > 1) return (false);
for(int i = 0; i < N; i++) {
if(A[i] == 1) return (false);
if(A[i] & 1) --A[i];
}
int gcd = 0;
for(int i = 0; i < N; i++) {
gcd = __gcd(gcd, A[i]);
}
for(int i = 0; i < N; i++) {
A[i] /= gcd;
}
return !check();
}
int main()
{
cin >> N;
for(int i = 0; i < N; i++) cin >> A[i];
if(check()) cout << "First" << endl;
else cout << "Second" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
ll n;
cin >> n;
vector<ll> a(n, 0);
map<ll, ll> m;
rep1(i, n) cin >> a[i];
rep1(i, n){
if (m[a[i]]!=0){
cout << "NO" << endl;
return 0;
}
m[a[i]]++;
}
cout << "YES" << endl;
//printf("%.12f", ans);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
/***********debug tools***********/
template<class T> inline ostream& operator<<(ostream& os,vector<T> arr) {os << "["; for(int i = 0; i < (int)arr.size(); i++)os << arr[i] << (i == (int)arr.size() - 1 ? "]" : ",");os << endl;return os;}
template<typename A, typename B> ostream& operator<<(ostream& os, const pair<A,B>& p){os << "{" << p.first << "," << p.second << "}";return os; }
#define prvec(v) cerr<<#v<<": [";for(int __i = 0;__i < (int)(v).size(); __i++)cerr<<((v)[__i])<<(__i+1==(int)(v).size()?"]\n":",");
#define print(x) cerr<<#x<<": "<<(x)<<endl
/*********************************/
const int D = 30;
const int MAX_N = 100000;
int n, l;
vector<int> x;
vector<vector<int>> tor, tol;
void ftor() {
for(int i = 0; i < n; i++) {
int L = i + 1, R = n; //ooooxxx
while(R - L > 1) {
int mid = (L + R) / 2;
(x[mid] - x[i] <= l ? L : R) = mid;
}
tor[0][i] = L;
}
tor[0][n - 1] = n - 1;
for(int i = 0; i < D - 1; i++) {
for(int j = 0; j < n; j++) {
tor[i + 1][j] = tor[i][tor[i][j]];
}
}
}
void ftol() {
for(int i = 1; i < n; i++) {
int L = -1, R = i - 1;//xxxxxoooo
while(R - L > 1) {
int mid = (L + R) / 2;
(x[i] - x[mid] <= l ? R : L) = mid;
}
tol[0][i] = R;
}
tol[0][0] = 0;
for(int i = 0; i < D - 1; i++) {
for(int j = 0; j < n; j++) {
tol[i + 1][j] = tol[i][tol[i][j]];
}
}
}
int main()
{
cin >> n;
x.resize(n), tor.resize(D, vector<int>(n));
tol = tor;
for(int i = 0; i < n; i++)cin >> x[i];
cin >> l;
ftor();
ftol();
int Q; cin >> Q;
while(Q--) {
int a, b;
cin >> a >> b;
a--,b--;
if(a > b) {
int l = 0, r = 2 * n;//xxxxxxoooo
while(r - l > 1) {
int mid = (l + r) / 2;
int pos = a;
for(int i = 0; i < D; i++) {
if(mid & (1<<i))pos = tol[i][pos];
}
(pos <= b ? r : l) = mid;
}
cout << r << endl;
} else {
int l = 0, r = 2 * n;//xxxxxxoooo
while(r - l > 1) {
int mid = (l + r) / 2;
int pos = a;
for(int i = 0; i < D; i++) {
if(mid & (1<<i))pos = tor[i][pos];
}
(pos >= b ? r : l) = mid;
}
cout << r << endl;
}
}
}
| #include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cctype>
#include <iostream>
#include <cstring>
#include <algorithm>
#define R register
#define IN inline
#define W while
#define ls (now << 1)
#define rs ((now << 1) | 1)
#define MX 200500
#define gc getchar()
#define ll long long
template <class T>
IN void in(T &x)
{
x = 0; R char c = gc;
for (; !isdigit(c); c = gc);
for (; isdigit(c); c = gc)
x = (x << 1) + (x << 3) + c - 48;
}
template <class T> IN T max(T a, T b) {return a > b ? a : b;}
template <class T> IN T min(T a, T b) {return a < b ? a : b;}
template <class T> IN T abs(T a) {return a > 0 ? a : -a;}
int n, q;
struct Node
{
ll val[3], tag;
Node(){std::memset(val, 63, sizeof(val));}
}tree[MX << 2];
IN void pushup(R int now)
{
tree[now].val[0] = min(tree[ls].val[0], tree[rs].val[0]);
tree[now].val[1] = min(tree[ls].val[1], tree[rs].val[1]);
tree[now].val[2] = min(tree[ls].val[2], tree[rs].val[2]);
}
IN void pushdown(R int now)
{
if (tree[now].tag)
{
tree[ls].val[0] += tree[now].tag;
tree[ls].val[1] += tree[now].tag;
tree[ls].val[2] += tree[now].tag;
tree[ls].tag += tree[now].tag;
tree[rs].val[0] += tree[now].tag;
tree[rs].val[1] += tree[now].tag;
tree[rs].val[2] += tree[now].tag;
tree[rs].tag += tree[now].tag;
tree[now].tag = 0;
}
}
void modify(R int now, R int lef, R int rig, R int pos, R ll v)
{
if (lef == rig)
{
tree[now].val[0] = v;
tree[now].val[1] = v - pos;
tree[now].val[2] = v + pos;
return;
}
pushdown(now);
int mid = lef + rig >> 1;
if (pos <= mid) modify(ls, lef, mid, pos, v);
else modify(rs, mid + 1, rig, pos, v);
pushup(now);
}
IN void add(R ll v)
{
tree[1].tag += v;
tree[1].val[0] += v;
tree[1].val[1] += v;
tree[1].val[2] += v;
}
ll query(R int now, R int lef, R int rig, R int lb, R int rb, R int id)
{
if (lef >= lb && rig <= rb) return tree[now].val[id];
pushdown(now);
int mid = lef + rig >> 1; ll ret = LONG_LONG_MAX;
if (lb <= mid) ret = query(ls, lef, mid, lb, rb, id);
if (rb > mid) ret = min(ret, query(rs, mid + 1, rig, lb, rb, id));
return ret;
}
int main(void)
{
int a, b, last, cur, del;
ll res1, res2, res3;
in(n), in(q), in(a), in(b);
in(last);
modify(1, 1, n, b, abs(last - a));
modify(1, 1, n, a, abs(last - b));
W (--q)
{
in(cur); del = abs(last - cur);
res1 = query(1, 1, n, cur, cur, 0) + del;
res2 = query(1, 1, n, 1, cur, 1) + cur;
res3 = query(1, 1, n, cur + 1, n, 2) - cur;
res1 = min(res1, min(res2, res3));
add(del);
modify(1, 1, n, last, res1);
last = cur;
}
printf("%lld", tree[1].val[0]);
} | 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;
}
signed main() {
ll T;
cin >> N >> T;
vi t(N);
cin >> t;
REP(i, N - 1) {
if (t[i + 1] - t[i] > T)
ans += T;
else
ans += t[i + 1] - t[i];
}
ans += T;
cout << ans << endl;
} | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
int x, y, z;
cin >> x >> y >> z;
int ansx, ansy, ansz;
ansx = y;
ansy = x;
x = y;
y = ansy;
ansx = z;
ansz = x;
cout << ansx << " " << ansy << " " << ansz << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
const int MAX = 2600000;
int mod = 998244353;
int n, m;
int fact[MAX];
int inv[MAX];
int factInv[MAX];
void initFact() {
int i;
fact[0] = fact[1] = 1;
factInv[0] = factInv[1] = 1;
inv[1] = 1;
for (i = 2; i <= 3 * m + n; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
factInv[i] = factInv[i - 1] * inv[i] % mod;
}
}
int comb(int n, int k) {
if (k > n) return 0;
return fact[n] * factInv[n - k] % mod * factInv[k] % mod;
}
signed main() {
cin >> n >> m;
initFact();
int x;
int ng = 0;
for (x = 2 * m + 1; x <= 3 * m; x++) {
int res = n * comb(3 * m - x + n - 2, n - 2) % mod;
ng += res;
ng %= mod;
}
//奇数がx個
for (x = m + 1; x <= n; x++) {
if (x > 3 * m) break;
if ((3 * m - x) % 2 != 0) continue;
int res = comb((3 * m - x) / 2 + n - 1, n - 1) * comb(n, x) % mod;
ng += res;
ng %= mod;
}
int all = comb(3 * m + n - 1, n - 1);
int ans = (all - ng + mod) % mod;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, x;
cin >> N >> x;
vector<ll> a(N);
rep(i, N) { cin >> a[i]; }
ll cnt = 0;
for (int i = 0; i < N - 1; i++) {
if (a[i] + a[i + 1] > x) {
int diff = a[i] + a[i + 1] - x;
if (diff > a[i + 1])
cnt += a[i + 1], a[i + 1] = 0;
else
cnt += diff, a[i + 1] -= diff;
}
}
for (int i = 0; i < N - 1; i++) {
if (a[i] + a[i + 1] > x) {
int diff = a[i] + a[i + 1] - x;
a[i] -= diff, cnt += diff;
}
}
cout << cnt << endl;
} | 0 |
#include<cstdio>
#define For(i,A,B) for(i=A;i<=(B);++i)
char a[1005][1005];
void work(int x,int k){
if(k==4){
a[x][x]=a[x][x+1]=a[x][x+3]=a[x+1][x+3]=a[x+2][x]=a[x+3][x]=a[x+3][x+2]=a[x+3][x+3]='a';
a[x+1][x]=a[x+1][x+1]=a[x+2][x+2]=a[x+2][x+3]='b';
a[x][x+2]=a[x+1][x+2]=a[x+2][x+1]=a[x+3][x+1]='c';
}else if(k==5){
a[x][x]=a[x][x+1]=a[x][x+4]=a[x+1][x+4]=a[x+3][x]=a[x+4][x]=a[x+4][x+3]=a[x+4][x+4]='a';
a[x][x+2]=a[x][x+3]=a[x+1][x]=a[x+2][x]=a[x+2][x+4]=a[x+3][x+4]=a[x+4][x+1]=a[x+4][x+2]='b';
a[x+1][x+1]=a[x+1][x+2]=a[x+2][x+3]=a[x+3][x+3]='c';
}else if(k==6){
a[x][x]=a[x][x+1]=a[x][x+3]=a[x+1][x+3]=a[x+2][x+5]=a[x+3][x+2]=a[x+3][x+3]=a[x+3][x+5]=a[x+4][x]=a[x+5][x]=a[x+5][x+4]=a[x+5][x+5]='a';
a[x+1][x]=a[x+1][x+1]=a[x+2][x+2]=a[x+2][x+3]=a[x+4][x+1]=a[x+4][x+4]=a[x+4][x+5]=a[x+5][x+1]='b';
a[x][x+2]=a[x+1][x+2]=a[x+2][x+4]=a[x+3][x+4]='c';
}else{
a[x][x]=a[x][x+1]=a[x][x+6]=a[x+1][x+6]=a[x+2][x+2]=a[x+2][x+3]=a[x+3][x+4]=a[x+4][x+4]=a[x+5][x]=a[x+6][x]=a[x+6][x+5]=a[x+6][x+6]='a';
a[x][x+2]=a[x][x+3]=a[x+2][x+6]=a[x+3][x]=a[x+3][x+6]=a[x+4][x]=a[x+6][x+3]=a[x+6][x+4]='b';
a[x+1][x+1]=a[x+1][x+2]=a[x+1][x+5]=a[x+2][x+5]=a[x+4][x+1]=a[x+5][x+1]=a[x+5][x+4]=a[x+5][x+5]='c';
}
}
int main(){
int n,i,j;
scanf("%d",&n);
if(n==2)puts("-1");
else if(n==3)puts("aa.\n..a\n..a");
else{
For(i,1,n)
For(j,1,n)a[i][j]='.';
For(i,0,(n>>2)-2)work((i<<2)+1,4);
i=(n&3)+4;
work(n-i+1,i);
For(i,1,n)puts(a[i]+1);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 2) {
cout << -1 << endl;
return 0;
}
if (n % 3 == 0) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i % 3 == 0 && j % 3 < 2) {
cout << 'a';
} else if (i % 3 < 2 && j % 3 == 2) {
cout << 'b';
} else if (i % 3 == 2 && j % 3 > 0) {
cout << 'c';
} else if (i % 3 > 0 && j % 3 == 0) {
cout << 'd';
} else {
cout << '.';
}
}
cout << endl;
}
return 0;
}
if (n % 4 == 0) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i / 2 % 2 == j / 2 % 2) {
if (i % 2 == 0) {
cout << 'a';
} else {
cout << 'b';
}
} else {
if (j % 2 == 0) {
cout << 'c';
} else {
cout << 'd';
}
}
}
cout << endl;
}
return 0;
}
if (n % 2 == 0) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i / 2 + j / 2 == n / 2 - 1) {
cout << '.';
} else if ((i / 2 % 2 == j / 2 % 2) == (i / 2 + j / 2 < n / 2 - 1)) {
if (i % 2 == 0) {
cout << 'a';
} else {
cout << 'b';
}
} else {
if (j % 2 == 0) {
cout << 'c';
} else {
cout << 'd';
}
}
}
cout << endl;
}
return 0;
}
if (n % 4 == 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= n - 3 && j >= n - 3) {
int ni = n - 1 - i, nj = n - 1 - j;
if (ni % 3 == 0 && nj % 3 < 2) {
cout << 'a';
} else if (ni % 3 < 2 && nj % 3 == 2) {
cout << 'b';
} else if (ni % 3 == 2 && nj % 3 > 0) {
cout << 'c';
} else if (ni % 3 > 0 && nj % 3 == 0) {
cout << 'd';
} else {
cout << '.';
}
} else if (n - 5 <= i && i < n - 3 && n - 5 <= j && j < n - 3) {
cout << '.';
} else if (i >= n - 3 && j >= n - 5) {
cout << (char) ('e' + ((n - j) / 2 + i) % 3);
} else if (i >= n - 5 && j >= n - 3) {
cout << (char) ('e' + ((n - i) / 2 + j) % 3);
} else {
if (i / 4 - j / 4) {
cout << '.';
} else if (i / 2 % 2 == j / 2 % 2) {
if (i % 2 == 0) {
cout << 'a';
} else {
cout << 'b';
}
} else {
if (j % 2 == 0) {
cout << 'c';
} else {
cout << 'd';
}
}
}
}
cout << endl;
}
return 0;
}
if (n % 4 == 3) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= n - 3 && j >= n - 3) {
int ni = n - 1 - i, nj = n - 1 - j;
if (ni % 3 == 0 && nj % 3 > 0) {
cout << 'a';
} else if (ni % 3 > 0 && nj % 3 == 0) {
cout << 'b';
} else {
cout << '.';
}
} else if (n - 7 <= i && i < n - 3 && n - 7 <= j && j < n - 3) {
cout << '.';
} else if (i >= n - 3 && j >= n - 7) {
cout << (char) ('e' + ((n - j) / 2 + i) % 3);
} else if (i >= n - 7 && j >= n - 3) {
cout << (char) ('e' + ((n - i) / 2 + j) % 3);
} else {
if (i / 4 - j / 4) {
cout << '.';
} else if (i / 2 % 2 == j / 2 % 2) {
if (i % 2 == 0) {
cout << 'a';
} else {
cout << 'b';
}
} else {
if (j % 2 == 0) {
cout << 'c';
} else {
cout << 'd';
}
}
}
}
cout << endl;
}
return 0;
}
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
using P = pair<int,int>;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
const int N = 405;
const int INF = 1e9;
char board[N][N];
int h,w;
bool is_in(int x, int y) {
if(0 <= x && x < h && 0 <= y && y < w) return true;
return false;
}
signed main() {
cin >> h >> w;
rep(i,h) rep(j,w) cin >> board[i][j];
vector<vector<int>> d(h, vector<int> (w, INF));
int ans = 0;
rep(ii,h) rep(jj,w) {
if(board[ii][jj] != '#' || d[ii][jj] != INF) continue;
int sx = ii, sy = jj;
queue<P> que;
d[sx][sy] = 0;
que.push({sx,sy});
int cnt = 0;
int black = 1;
while(!que.empty()) {
int cx = que.front().first;
int cy = que.front().second;
que.pop();
for (int i = 0; i < 4; i++) {
int nx = cx + dx[i];
int ny = cy + dy[i];
if(!is_in(nx, ny)) continue;
if(board[nx][ny] == board[cx][cy] || d[nx][ny] != INF) continue;
if(board[nx][ny] == '.') cnt++;
else if(board[nx][ny] == '#') black++;
d[nx][ny] = d[cx][cy] + 1;
que.push({nx, ny});
}
}
ans += cnt * black;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using T = tuple<ll, ll, ll>;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
string s;
cin >> n >> s >> q;
rep(_, q) {
int k;
cin >> k;
vector<T> res(n);
ll ans = 0;
rep(i, n) {
if (i)
res[i] = res[i-1];
if (i-k >= 0) {
if (s[i-k] == 'D') {
get<2>(res[i]) -= get<1>(res[i]);
get<0>(res[i])--;
}
if (s[i-k] == 'M')
get<1>(res[i])--;
}
if (s[i] == 'D')
get<0>(res[i])++;
if (s[i] == 'M') {
get<1>(res[i])++;
get<2>(res[i]) += get<0>(res[i]);
}
if (s[i] == 'C')
ans += get<2>(res[i]);
}
cout << ans << '\n';
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,char>> array(m);
for(int i=0;i<m;i++) cin >> array.at(i).first >> array.at(i).second;
int s,g;
s = 1;
for(int i=0;i<n-1;i++) s*=10;
g = s * 10;
if(n == 1) s = 0;
for(int i=s;i<g;i++){
string str_number = to_string(i);
bool flag = true;
for(int j=0;j<m;j++){
if(str_number.at(array.at(j).first - 1) != array.at(j).second) flag = false;
}
if(flag){
cout << str_number << endl;
return 0;
}
}
cout << -1 << endl;
} | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,n,maxi=0,f=0,mini=INF;
ll sum=0;
string str,sub;
ll h,w;
ll m;
cin>>n>>m;
if(m==0){
if(n==1){
cout<<0<<endl;
}else if(n==2){
cout<<10<<endl;
}else{
cout<<100<<endl;
}
return 0;
}
vector<pair<ll,ll>> s(m);
rep(i,m){
cin>>a>>b;
s[i]=make_pair(a,b);
}
f=0;
sort(s.begin(),s.end());
sum=0;
if(s[0].first==1) {
//sum-=100;
if(s[0].second==0&&n!=1) f=1;
sum+=100*s[0].second;
}
if(s[0].first==2){
//if(s[0].second==0&&n==2) f=1;
sum+=10*s[0].second;
// sum-=10;
}
if(s[0].first==3){
//sum-=1;
sum+=1*s[0].second;
}
for(ll i=1;i<m;i++){
if(s[i-1].first==s[i].first&&s[i-1].second!=s[i].second) f=1;
else if(s[i-1].first==s[i].first&&s[i-1].second==s[i].second) continue;
else{
if(s[i].first==1) {
// sum-=100;
if(s[i].second==0&&n!=1) f=1;
sum+=100*s[i].second;
}
if(s[i].first==2) {
// sum-=10;
sum+=10*s[i].second;
}
if(s[i].first==3) {
// sum--;
sum+=1*s[i].second;
}
}
}
if(n==1&&sum!=0) sum/=100;
if(n==2&&sum!=0) sum/=10;
if(n==3&&sum!=0&&sum<100) sum+=100;
if(n==2&&sum<10) sum+=10;
if(f!=1&&sum==0&&n==1){
cout<<0<<endl;
return 0;
}
if(f==1){
cout<<"-1"<<endl;
}else{
cout<<sum<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int m;
cin >> m;
ll sum = 0, n = 0;
rep(i,m)
{
ll c, d;
cin >> d >> c;
n += c;
sum += c * d;
}
cout << n - 1 + ((sum - 1) / 9) << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int nax = 5010;
const ll INF = 1e18L;
ll dp[nax][nax];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
for (int i = 0; i < nax; ++i) {
for (int j = 0; j <= i; ++j) {
dp[i][j] = INF;
}
}
dp[0][0] = 0;
int n;
cin >> n;
vector<pair<int, int>> q(n);
for (int i = 0; i < n; ++i) {
cin >> q[i].first >> q[i].second;
q[i].first += q[i].second;
}
sort(q.begin(), q.end());
for (int i = 0; i < n; ++i) {
q[i].first -= q[i].second;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= i; ++j) {
if (dp[i][j] == INF) continue;
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
if (dp[i][j] <= q[i].first) {
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + q[i].second);
}
}
}
int ans = 0;
for (int i = 0; i <= n; ++i) {
if (dp[n][i] != INF) {
ans = i;
}
}
cout << ans << '\n';
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
typedef vector<int> vi;
typedef vector<vi> vvi;
const int INFTY=1<<29;
int dfs(vvi& a,int ci,int cj,int depth)
{
if(depth==10)
return INFTY;
int h=a.size(),w=a[0].size();
int di[]={-1,1,0,0},dj[]={0,0,-1,1};
int res=INFTY;
rep(k,4){
for(int i=ci+di[k],j=cj+dj[k];;i+=di[k],j+=dj[k]){
if(i<0 || h<=i || j<0 || w<=j)
break;
if(a[i][j]==1){
if(abs(i-ci)+abs(j-cj)>1){
a[i][j]=0;
res=min(res,dfs(a,i-di[k],j-dj[k],depth+1));
a[i][j]=1;
}
break;
}
if(a[i][j]==3)
return depth+1;
}
}
return res;
}
int main()
{
for(int w,h;cin>>w>>h;){
vvi a(h,vi(w));
rep(i,h) rep(j,w)
cin>>a[i][j];
rep(i,h) rep(j,w)
if(a[i][j]==2){
a[i][j]=0;
int res=dfs(a,i,j,0);
cout<<(res==INFTY?-1:res)<<endl;
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using vvi = std::vector<std::vector<int>>;
void solve()
{
using namespace std;
constexpr int inf = (1 << 23);
int n;
cin >> n;
vector<int> d(n + 1);
for (int i = 0; i < n; ++i)
{
cin >> d[i];
if(i + 1 != n)
cin.ignore(numeric_limits<streamsize>::max(), ' ');
}
cin.ignore(numeric_limits<streamsize>::max(), ' ');
cin >> d[n];
vvi dp (n, vector<int>(n, 0));
//自分自身との積は乗算が発生しない
for (int i = 0; i < n; ++i)
dp[i][i] = 0;
for (int l = 1; l < n; ++l)
{
for (int i = 0; i < n - l; ++i)
{
int j = i + l;
dp[i][j] = inf;
for (int k = i; k < j; ++k)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + d[i] * d[k + 1] * d[j + 1]);
}
}
}
cout << dp[0][n - 1] << endl;
}
int main()
{
solve();
return 0;
}
| 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int N=200000+100;
const db pi=acos(-1.0);
#define lowbit(x) (x)&(-x)
#define sqr(x) (x)*(x)
#define rep(i,a,b) for (register int i=a;i<=b;i++)
#define per(i,a,b) for (register int i=a;i>=b;i--)
#define go(u,i) for (register int i=head[u],v=sq[i].to;i;i=sq[i].nxt,v=sq[i].to)
#define fir first
#define sec second
#define mkp make_pair
#define pb push_back
#define maxd 998244353
#define eps 1e-8
inline int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
namespace My_Math{
#define N 100000
int fac[N+100],invfac[N+100];
int add(int x,int y) {return x+y>=maxd?x+y-maxd:x+y;}
int dec(int x,int y) {return x<y?x-y+maxd:x-y;}
int mul(int x,int y) {return 1ll*x*y%maxd;}
ll qpow(ll x,int y)
{
ll ans=1;
while (y)
{
if (y&1) ans=mul(ans,x);
x=mul(x,x);y>>=1;
}
return ans;
}
int getinv(int x) {return qpow(x,maxd-2);}
int C(int n,int m)
{
if ((n<m) || (n<0) || (m<0)) return 0;
return mul(mul(fac[n],invfac[m]),invfac[n-m]);
}
void math_init()
{
fac[0]=invfac[0]=1;
rep(i,1,N) fac[i]=mul(fac[i-1],i);
invfac[N]=getinv(fac[N]);
per(i,N-1,1) invfac[i]=mul(invfac[i+1],i+1);
}
#undef N
}
using namespace My_Math;
int n,a[N];
ll sum[N];
ll calc(int l,int r) {return sum[r]-sum[l-1];}
int main()
{
n=read();
rep(i,1,n) a[i]=read();
rep(i,1,n) sum[i]=sum[i-1]+a[i];
int l=1,r=3;
ll ans=1e18;
rep(i,2,n-2)
{
while ((l+2<=i) && (abs(calc(1,l)-calc(l+1,i))>abs(calc(1,l+1)-calc(l+2,i)))) l++;
while ((r+2<=n) && (abs(calc(i+1,r)-calc(r+1,n))>abs(calc(i+1,r+1)-calc(r+2,n)))) r++;
ll mx=0,mn=1e18,x;
x=calc(1,l);mx=max(mx,x);mn=min(mn,x);
x=calc(l+1,i);mx=max(mx,x);mn=min(mn,x);
x=calc(i+1,r);mx=max(mx,x);mn=min(mn,x);
x=calc(r+1,n);mx=max(mx,x);mn=min(mn,x);
ans=min(ans,mx-mn);
}
printf("%lld\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), s(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
s[i] = a[i] + (i ? s[i - 1] : 0);
}
ll ans = 1e18;
int j = 0, k = 2;
for (int i = 1; i < n - 2; i++) {
while (j + 1 < i && s[j] < s[i] - s[j]) {
j++;
}
while (k + 1 < n - 1 && s[k] - s[i] < s[n - 1] - s[k]) {
k++;
}
for (int u = j - 1; u <= j; u++) {
for (int v = k - 1; v <= k; v++) {
if (0 <= u && i < v) {
vector<ll> x = {s[u], s[i] - s[u], s[v] - s[i], s[n - 1] - s[v]};
sort(x.begin(), x.end());
ans = min(ans, x[3] - x[0]);
}
}
}
}
cout << ans << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int fa[MAXN], n, dep[MAXN], ans, K;
int head[MAXN], nxt[MAXN];
int dfs(int u) {
int res = dep[u];
for (int i = head[u]; i; i = nxt[i]) {
dep[i] = dep[u] + 1;
res = std::max(dfs(i), res);
}
if (res - dep[u] == K - 1 && fa[u] != 1) fa[u] = 1, ++ans, res = 0;
return res;
}
void dfs2(int u) {
for (int i = head[u]; i; i = nxt[i])
dep[i] = dep[u] + 1, dfs2(i);
}
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> K;
for (int i = 1; i <= n; ++i) std::cin >> fa[i];
for (int i = 2; i <= n; ++i)
nxt[i] = head[fa[i]], head[fa[i]] = i;
for (int i = head[1]; i; i = nxt[i]) dfs(i);
memset(head, 0, n + 1 << 2);
memset(dep, 0, n + 1 << 2);
for (int i = 2; i <= n; ++i)
nxt[i] = head[fa[i]], head[fa[i]] = i;
for (int i = head[1]; i; i = nxt[i]) dep[i] = 1, dfs2(i);
bool flg = true;
for (int i = 1; i <= n; ++i) flg &= (K - dep[i]) % (dep[fa[1]] + 1) == 0;
ans += !flg;
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n,k,head[maxn],to[maxn],nextt[maxn],tot = 1,ans;
void add(int x,int y)
{
to[tot] = y;
nextt[tot] = head[x];
head[x] = tot++;
}
int dfs(int u,int faa,int from)
{
int res = 0;
for (int i = head[u];i;i = nextt[i])
{
int v = to[i];
if (v == faa)
continue;
res = max(res,dfs(v,u,from) + 1);
}
if (u != from && res >= k - 1)
{
ans++;
return -1;
}
else
return res;
}
int main()
{
scanf("%d%d",&n,&k);
for (int i = 1; i <= n; i++)
{
int x;
scanf("%d",&x);
if (i == 1)
{
if (x != 1)
ans++;
}
else
add(x,i);
}
for (int i = head[1];i;i = nextt[i])
dfs(to[i],1,to[i]);
printf("%d\n",ans);
return 0;
}
| 1 |
#include <iostream>
int main(){
std::string inp;
std::cin >> inp;
for(char& c:inp)
if (c == '7') {std::cout << "Yes"; return 0;}
std::cout << "No";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
string ans;
if(a==b){
if(a!=c){
ans="Yes";
}else{
ans="No";
}
}else if(b==c){
if(a!=c){
ans="Yes";
}else{
ans="No";
}
}else if(c==a){
if(b!=c){
ans="Yes";
}else{
ans="No";
}
}else{
ans="No";
}
cout<<ans<<endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
int a[3];
cin >> n;
for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
vector<int> can;
for(int i=1;i*i<=a[0];i++){
if(!(a[0]%i)){
can.push_back(i);
if(i*i!=a[0])can.push_back(a[0]/i);
}
}
vector<int> ans;
for(int i=1;i<n;i++){
ans.clear();
for(int j=0;j<can.size();j++){
if(!(a[i]%can[j]))ans.push_back(can[j]);
}
can = ans;
}
sort(can.begin(),can.end());
for(int i=0;i<can.size();i++)cout << can[i] << endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,mini = 100000000;
cin >> n;
int num[n];
for(int i=0;i<n;i++){
cin >> num[i];
mini = min(num[i],mini);
}
for(int i=1;i<=mini;i++){
if(n == 2){
if(num[0]%i == 0 && num[1]%i == 0) cout << i << endl;
}
else if(n == 3){
if(num[0]%i == 0 && num[1]%i == 0 && num[2]%i == 0) cout << i << endl;
}
}
} | 1 |
#include <iostream>
using namespace std;
int main(){
string s;cin>>s;
int festival_len = 8;
int name_len = s.size() - 8;
for (int i=0;i<name_len;i++){
cout << s[i];
}
cout << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double d = sqrt(n);
int i = d;
int ans = i * i;
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int pre_e[MAX],pre_w[MAX],suf_w[MAX],suf_e[MAX];
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int len;
string s;
cin>>len;
cin>>s;
for(int i=1; i<=len; i++)
{
pre_e[i]=pre_e[i-1];
pre_w[i]=pre_w[i-1];
if(s[i-1]=='E')
pre_e[i]++;
else
pre_w[i]++;
}
for(int i=len; i>=1; i--)
{
suf_e[i]=suf_e[i+1];
suf_w[i]=suf_w[i+1];
if(s[i-1]=='E')
suf_e[i]++;
else
suf_w[i]++;
}
int mx=INT_MAX;
for(int i=1;i<=len;i++){
int x=pre_w[i-1]+suf_e[i+1];
mx=min(x,mx);
}
cout<<mx<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N; string S; cin >> N >> S;
string first[262200] = {}, second[262200] = {};
for(int i = 0; i < (1 << N); i++){
string tmp1, tmp2;
for(int j = 0; j < N; j++){
if((i >> j) & 1) tmp1.push_back(S.at(j));
else tmp2.push_back(S.at(j));
}
reverse(tmp2.begin(), tmp2.end());
first[i] = tmp1 + '1' + tmp2;
}
for(int i = 0; i < (1 << N); i++){
string tmp1, tmp2;
for(int j = 0; j < N; j++){
if((i >> j) & 1) tmp1.push_back(S.at(N+j));
else tmp2.push_back(S.at(N+j));
}
reverse(tmp2.begin(), tmp2.end());
second[i] = tmp2 + '1' + tmp1;
}
sort(second, second + (1 << N));
long long int ans = 0;
for(int i = 0; i < (1 << N); i++){
ans += upper_bound(second, second + (1 << N), first[i]) - lower_bound(second, second + (1 << N), first[i]);
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
long long M=1e9+7;
void solve(){
int n;
cin>>n;
long long sum=0,ans=0,p;
for(int i=0;i<n;i++){
cin>>p;
ans= (ans+(p*sum)%M)%M;
sum=(sum+p)%M;
}
cout<<ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){fastio
ll n;cin>>n;
ll a[n];rep(i,0,n-1)cin>>a[i];
ll b=0;
ll c=0;
rep(i,0,n-1){
b+=a[i];
c+=a[i]*a[i];
b=mod(b);
c=mod(c);
}
ll ans=mod(b*b-c);
if(ans%2==0){
cout<<mod(ans/2)<<endl;
}else{
cout<<mod((ans+i_7)/2)<<endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 100000000;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
const ll MAX = 200010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
ll n;
string s;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> s;
map<pair<string,string>,ll> count;
rep(bit,1<<n){
string s1,t1;
rep(i,n){
if (bit&(1<<i)){
s1 += s[i+n];
}
else{
t1 += s[i+n];
}
}
reverse(all(t1));
count[make_pair(t1,s1)]++;
}
ll ans = 0;
rep(bit,1<<n){
string s1,t1;
rep(i,n){
if (bit&(1<<i)){
s1 += s[i];
}
else{
t1 += s[i];
}
}
reverse(all(t1));
ans += count[make_pair(s1,t1)];
}
PRINT(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define debug(a) cerr << #a << ": " << a << endl
typedef long long ll;
typedef pair<int, int> ii;
#define x first
#define y second
const int N = 20;
int n;
char s[2 * N];
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
cin >> n;
scanf("%s", s);
vector< pair<string, string> > v1, v2;
int mask_end = 1 << n;
for (int mask = 0; mask < mask_end; mask++) {
string tmp1, tmp2;
for (int i = 0; i < n; i++) {
if (mask & 1 << i) tmp1 += s[i];
else tmp2 += s[i];
}
reverse(tmp2.begin(), tmp2.end());
v1.push_back({tmp1, tmp2});
}
for (int mask = 0; mask < mask_end; mask++) {
string tmp1, tmp2;
for (int i = 0; i < n; i++) {
if (mask & 1 << i) tmp1 += s[n + i];
else tmp2 += s[n + i];
}
reverse(tmp2.begin(), tmp2.end());
v2.push_back({tmp1, tmp2});
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
ll ans = 0LL;
for (auto i : v1) {
swap(i.x, i.y);
auto res = equal_range(v2.begin(), v2.end(), i);
ans += res.y - res.x;
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) (x.begin(), x.end())
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int a, b;
cin >> a >> b;
cout << max({a+b, a-b, a*b}) << endl;
} | #include <iostream>
using namespace std ;
int main()
{
int A, B, c, d, e;
cin>>A;
cin>>B;
c =(A + B);
d =(A - B);
e =(A * B);
if (c >= e&&c >= d)
{
cout<<c<<endl;
}
else if (e >= d&&e >= c)
{
cout<<e<<endl;
}
else if (d >= e&&d >= c)
{
cout<<d<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
cin >> a[i][j];
}
}
int di[] = {1, 0, -1, 0};
int dj[] = {0, 1, 0, -1};
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
if(a[i][j] == '.') {
continue;
}
int x = 0;
for (int k = 0; k < 4; k++) {
x += (a[i + di[k]][j + dj[k]] == '#');
}
if(!x) {
cout << "No";
return;
}
}
}
cout << "Yes";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| #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 all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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; }
//name[i][j]-> vvl name(i,vl(j))
//map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
vi vx={-1,0,1,0};
vi vy={0,1,0,-1};
using pi = pair<int,int>;
signed main(){
int a,b; cin>>a>>b;
vvi v(a,vi(b));
queue<pi> q;
rep(i,0,a){
rep(j,0,b){
char c; cin>>c;
if(c=='#'){
v[i][j]=1;
q.push(make_pair(i,j));
}
else v[i][j]=0;
}
}
while(!q.empty()){
pi p=q.front(); q.pop();
int k,l; tie(k,l)=p;
bool ok=false;
rep(i,0,4){
k+=vx[i]; l+=vy[i];
if(k>=0 && k<a){
if(l>=0 && l<b){
if(v[k][l]==1)ok=true;
}
}
k-=vx[i]; l-=vy[i];
}
if(!ok){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | 1 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
#include<atcoder/fenwicktree>
using namespace atcoder;
int n,q;
int main(){
cin>>n>>q;
fenwick_tree<ll> fw(n);
for(int i=0;i<n;i++){
int x;
cin>>x;
fw.add(i,x);
}
for(int i=0;i<q;i++){
int t;
cin>>t;
if(t==0){
int p,x;
cin>>p>>x;
fw.add(p,x);
}
else{
int l,r;
cin>>l>>r;
cout<<fw.sum(l,r)<<endl;
}
}
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
class Solve {
public:
void solve() {
Int N, M;
cin >> N >> M;
vector<Int> A(M);
int ki = 0;
for (int i = 0; i < M; ++i) {
cin >> A[i];
if (A[i] % 2) ki++;
}
if (ki > 2) {
cout << "Impossible" << endl;
return;
}
sort(all(A), [](Int a, Int b) {
return a % 2 > b % 2;
});
if (A.size() > 1 && A[1] % 2 == 1) {
swap(A[1], A.back());
}
vector<Int> B = A;
if (B.size() == 1) {
B.push_back(1);
B[0]--;
if (B[0] == 0) {
swap(B[0], B[1]);
}
}
B[0]--;
B.back()++;
if (B[0] == 0) {
B.erase(B.begin());
}
if (B.back() == 0) {
B.pop_back();
}
for (int i = 0; i < M; ++i) {
cout << A[i] << " ";
}
cout << endl;
cout << B.size() << endl;
for (auto e : B) {
cout << e << " ";
}
cout << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| 0 |
#include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
A -= A%2;
B += A/2;
A /= 2;
}
else{
B-=B%2;
A+=B/2;
B/=2;
}
}
cout << A <<" "<< B << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
vector<int> ball(200005,0);
void putball(int n){
for(int i=1; i<=sqrt(n); i++){
if(n%i==0){
ball.at(i)++;
if(i!=n/i)ball.at(n/i)++;
//cout << "putball " << i << endl;
}
}
}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
int ballcount = 0;
vector<int> b;
rep(i,n){
int j = n-i;
if((ball.at(j)%2)!=a.at(j-1)){
putball(j);
b.push_back(j);
ballcount++;
//cout << "putball " << j << endl;
}
}
if((ball.at(1)%2)==a.at(0)){
cout << ballcount << endl;
rep(i,b.size()) cout << b.at(i) << " ";
}else{
cout << "-1";
}
//cout << "hoge";
//rep(i,n) cout << ball.at(i+1) << " ";
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
int n;
cin >> n;
V<int> a(n);
rep(i,n) cin >> a[i];
int tot = 0;
rep(i,n) tot += a[i];
V<P> v(n);
rep(i,n) {
v[i] = make_pair(abs(tot-a[i]*n), i);
}
sort(all(v));
cout << v[0].se << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int x,y,tx,ty;
cin>>x>>y>>tx>>ty;
int n=abs(x-tx);
int m=abs(y-ty);
cout<<string(n,'R')<<string(m,'U');
cout<<string(n,'L')<<string(m,'D');
cout<<'L'<<string(m+1,'U')<<string(n+1,'R')<<'D';
cout<<'R'<<string(m+1,'D')<<string(n+1,'L')<<'U';
cout<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W, A, B;
cin >> H >> W >> A >> B;
for (int i = 0; i < B; i++) {
for (int j = 0; j < A; j++) {
cout << 0;
}
for (int j = A; j < W; j++) {
cout << 1;
}
cout << endl;
}
for (int i = B; i < H; i++) {
for (int j = 0; j < A; j++) {
cout << 1;
}
for (int j = A; j < W; j++) {
cout << 0;
}
cout << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const double PI = 4*atan(1);
const ll INF = 1e18;
const int MX = 100001;
string S;
int num[300001][3][2][3]; // yes even, yes odd, current parity, current num
void ad(int& x, int y) {
x = (x+y)%MOD;
}
void solve() {
num[0][0][0][0] = 1;
F0R(i,sz(S)) F0R(a,3) F0R(b,2) F0R(c,3) if (num[i][a][b][c]) {
if (S[i] != '1') ad(num[i+1][a][b][c == 2 ? 1 : c+1],num[i][a][b][c]);
if (S[i] != '0') {
if (c == 0) {
if (b == 0) ad(num[i+1][max(a,1)][b^1][0],num[i][a][b][c]);
else ad(num[i+1][a>0?2:0][b^1][0],num[i][a][b][c]);
} else if (c == 1) {
ad(num[i+1][a][b][0],num[i][a][b][c]);
} else {
ad(num[i+1][a][b^1][0],num[i][a][b][c]);
}
}
}
int ans = 0;
F0R(a,3) F0R(b,2) F0R(c,3)
if (a == 2 || (a == 1 && b == 1 && c == 0))
ad(ans,num[sz(S)][a][b][c]);
cout << ans << "\n";
}
string gen() {
string t;
F0R(i,5) {
int k = rand();
if (k % 3 == 0) t += '0';
else if (k % 3 == 1) t += '1';
else t += '?';
}
return t;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> S;
solve();
}
// read the question correctly (is y a vowel?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?) | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }
//----------------------------------------------------------------
int nmax=200000; // 2*(10^5)
vvec g(nmax);
void solve4ts()
{
int N; cin >> N;
cout << 0 << endl;
string first; cin >> first;
int l = 0, r = N;
if(first!="Vacant")while (1) {
int m = (l + r) / 2;
cout << m << endl;
string s; cin >> s;
if (s == "Vacant")break;
if (m % 2 && s != first || m % 2 == 0 && s == first)l = m + 1;
else r = m;
}
}
//-----------------------------------------------------------------
signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
int repeat = 1;
// cin >> repeat;
while(repeat--) solve4ts();
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };
template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };
using namespace std;
//******************** dumps ************************//
template <typename T>
void dump(const T &data, vector<int> &iter)
{
cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
for (auto elem : data)
dump(elem, iter);
cout << endl;
}
template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
for (auto elem : iter)
{
cout << "[" << elem << "]";
}
cout << endl;
for (int i = 0; i < data.size(); i++)
{
iter.push_back(i);
dump(data[i], iter);
iter.pop_back();
}
cout << endl;
}
template <typename T>
void dump(const vector<T> &data, int dummy)
{
for (int i = 0; i < data.size(); i++)
{
cout << "[" << i << "] " << data[i] << endl;
}
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
vector<int> iter;
dump(data, iter);
}
///////////////////////////////////////////////
void solve(long long K, std::string S)
{
int n = S.size();
if (K < n)
{
S = S.substr(0, K);
S += "...";
}
cout << S << endl;
}
int main()
{
cout << setprecision(10);
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
/// https://ideone.com/Fd5s8n
int k;
cin>>k;
string s;
cin>>s;
if(s.length()<=k)
cout << s << endl;
else{
for(int i=0;i<k;i++)
cout << s[i];
cout << "..." << endl;
}
return 0;
}
| 1 |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << 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 n, m;
vector<vector<int>> a;
void solve() {
cin >> n >> m;
a.assign(n, vector<int>(m));
rep(i, n) {
rep(j, m) {
cin >> a[i][j];
-- a[i][j];
}
}
vector<int> used(n, 0), check(m, 1);
int ans = n;
int cnt = 0;
while(true) {
map<int, int> mp;
rep(i, n) {
while(used[i] < m && !check[a[i][used[i]]]) {
used[i] ++;
}
mp[a[i][used[i]]] ++;
}
set<int> se; int ma = 0;
for(auto p: mp) {
if(ma == p.sc) {
se.insert(p.fr);
} else if(ma < p.sc) {
se.clear();
ma = p.sc;
se.insert(p.fr);
}
}
chmin(ans, ma);
for(auto j: se) {
check[j] = 0;
++ cnt;
}
if(cnt == m) break;
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#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 newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
int N,M;
cin >> N >> M;
vvi A(N,vi(M));
rep(i,N) {
rep(j,M) {
cin >> A[i][j];
A[i][j]--;
}
}
int ans = INF;
vi except(M,0);
while(1) {
vi cnt(M,0);
rep(i,N) {
int idx=0;
while(idx < M && except[A[i][idx]]) idx++;
if(idx==M) {
cout << ans << endl;
return 0;
}
cnt[A[i][idx]]++;
}
int n = 0;
rep(i,M) {
n = max(n,cnt[i]);
}
ans = min(ans,n);
rep(i,M) {
if(cnt[i]==n) {
except[i]++;
}
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int n = s.length();
if(s.length()==2){
if(s[0]==s[1]) cout<<"1 2";
else cout<<"-1 -1";
return 0;
}
bool f = false;
for(int i=0; i+1<n; i++){
if(s[i]==s[i+1]) {
cout<<i+1<<" "<<i+2;
f = true;
break;
}
}
for(int i=0; i+2<n && f!=true; i++){
if(s[i]==s[i+1] || s[i+2]==s[i+1] || s[i]==s[i+2]) {
cout<<i+1<<" "<<i+3;
f = true;
break;
}
}
if(!f) cout<<"-1 -1";
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef short int sh;
const int inf=0x3f3f3f3f;
const int MAX=1e5+10;
const int mod=1e9+7;
vector<int>vec[26];
char str[MAX];
void Get_Pos()
{
for(int i=0;str[i];i++)
{
int k=str[i]-'a';
vec[k].push_back(i);
}
}
void Solve()
{
for(int i=0;i<26;i++)
{
int l=vec[i].size();
for(int j=0;j<l;j++)
{
int t=vec[i].at(j);
for(int k=j+1;k<l;k++)
{
int r=vec[i].at(k);
if(((k-j+1)<<1)>r-t+1)
{
printf("%d %d\n",t+1,r+1);
return;
}
}
}
}
printf("-1 -1\n");
}
int main()
{
int n;
while(scanf("%s",str)!=EOF)
{
Get_Pos();
Solve();
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll a, b;
cin >> a >> b;
rep(i, 100) {
ll now = i * a - i + 1;
if(now < b) continue;
cout << i << endl;
return 0;
}
} | #include <iostream>
int main()
{
int A, B;
std::cin >> A >> B;
if ((B-1)%(A-1)==0) std::cout << (B-1)/(A-1) << std::endl;
else std::cout << (B-1)/(A-1) + 1 << std::endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef long double ld;
// a>b -> a==b;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
// a<b -> a==b;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(void)
{
ll N, A, B, i, X[100001], ans=0;
cin >> N >> A >> B;
for(i=1; i<=N; i++){
cin >> X[i];
if(i>=2){
ans += min(A*(X[i]-X[i-1]), B);
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
///**************************DONE****************************///
int main()
{
LL n, t;
cin >> n >> t;
LL ans = 0, x = 0;
for(int i = 0; i < n; i++){
LL a;
cin >> a;
if(x < a)
ans += t;
else
ans += a + t - x;
x = a + t;
}
cout << ans << '\n';
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
string ten[3]={"A","B","C"};
int main()
{
int n;
cin>>n;
for(;n!=0;cin>>n)
{
rep(i,n)
{
int ma,en,ja;
int ans=2;
cin>>ma>>en>>ja;
if(((ma+en+ja)/3>=50&&(ma>=80||en>=80))||(ma+en+ja)/3>=70)ans=1;
if((ma+en+ja)/3>=80||(ma+en)/2>=90||en==100||ja==100||ma==100)ans=0;
cout<<ten[ans]<<endl;
}
}
} | #include<iostream>
using namespace std;
int main(void)
{
int n,pm[10001],pe[10001],pj[10001];
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>pm[i]>>pe[i]>>pj[i];
}
for(int i=0;i<n;i++){
if(pm[i]==100||pe[i]==100||pj[i]==100||(pm[i]+pe[i])/2>=90||(pm[i]+pe[i]+pj[i])/3>=80)
cout<<"A\n";
else if((pm[i]+pe[i]+pj[i])/3>=70)cout<<"B\n";
else if((pm[i]>=80||pe[i]>=80)&&(pm[i]+pe[i]+pj[i])/3>=50)cout<<"B\n";
else cout<<"C\n";
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define oo 1000000010
#define mod 1000000007
const int N = 100010;
int n , m , arr[N] , v , p;
bool check(int mid){
int val = arr[mid] + m;
if(arr[n - p] > val)
return false;
long long all = 0;
for(int i = 0 ;i < n - p + 1;i++){
all += min(m , max(0 , val - arr[i]));
}
all /= m;
if(all >= v - (p - 1))
return true;
return false;
}
int main(){
scanf("%d%d%d%d",&n,&m,&v,&p);
for(int i = 0 ;i < n;i++){
scanf("%d",&arr[i]);
}
sort(arr,arr+n);
int low = 0 , high = n - 1 , res = n , mid;
while(high >= low){
mid = (low + high) / 2;
if(check(mid))
res = mid , high = mid - 1;
else
low = mid + 1;
}
cout << n - res << endl;
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
unsigned gaps[] = {1,8,23,77,281,1073,4193,16577,65921,262913,1050113};
// generated from pow(4,i)+3*pow(2,i-1)+1 (prefixed with 1)
unsigned insertion_sort(unsigned a[], unsigned n, unsigned gap){
unsigned i,count = 0;
for(i = gap; i < n; i++){
unsigned v = a[i];
int j = i - gap;
while(j >= 0 && a[j] > v){
a[j+gap] = a[j];
j -= gap;
count++;
}
a[j+gap] = v;
}
return count;
}
void shell_sort(unsigned a[], unsigned n){
int i;
unsigned gap_num = 0;
while(gaps[++gap_num] < n);
gap_num--;
unsigned count = 0;
for(i = gap_num; i >= 0; i--) count += insertion_sort(a,n,gaps[i]);
printf("%u\n",(gap_num+1));
for(i = gap_num; i; i--) printf("%u ",gaps[i]);
printf("%u\n",gaps[0]);
printf("%u\n",count);
}
int main(){
unsigned n,i;
scanf("%u",&n);
unsigned* a = (unsigned*)malloc(sizeof(unsigned)*n);
for(i = 0; i < n; i++) scanf("%u",&a[i]);
shell_sort(a,n);
for(i = 0; i < n; i++) printf("%u\n",a[i]);
free(a);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1){
int m,nmin,nmax;
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0) break;
int p[m];
for(int i=0; i<m; i++){
cin >> p[i];
}
sort(p,p+m,greater<int>());
pair<int,int> ans = make_pair(0,0);
for(int i=nmin; i<=nmax; i++) {
if(ans.second <= p[i-1] - p[i]){
ans = make_pair(i,p[i-1] - p[i]);
}
}
cout << ans.first << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
long double N,M,D;
cin >> N >> M >> D;
if(D==0){
cout << setprecision(10) << (1/N)*(M-1) << endl;
}else{
// 1組の隣り合った項の差がDである確率は
// 2(N-D)通り / N*N通り
cout << setprecision(10) << 2*(M-1)*(N-D)/N/N << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn=3e5+10, maxm=1e6+10, lg=21, mod=1e9+7, inf=1e18;
string s;
ll n,dp[maxn][3][3],ans;
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>s;
dp[0][0][0]=1;
for(int i=0;i<SZ(s);i++)for(int t0=0;t0<3;t0++)for(int t1=0;t1<3;t1++){
if(s[i]!='0'){
if(t0) (dp[i+1][t0-1][t1]+=dp[i][t0][t1])%=mod;
else (dp[i+1][t0][min(t1+1,2)]+=dp[i][t0][t1])%=mod;
}
if(s[i]!='1'){
if(t0>1) (dp[i+1][t0-1][t1]+=dp[i][t0][t1])%=mod;
else (dp[i+1][t0+1][t1]+=dp[i][t0][t1])%=mod;
}
}
for(int t0=0;t0<3;t0++)for(int t1=t0;t1<3;t1++) (ans+=dp[SZ(s)][t0][t1])%=mod;
cout<<ans;
return 0;
}
| #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <array>
#include <list>
#include <stack>
#include <valarray>
using namespace std;
typedef unsigned uint;
typedef long long Int;
typedef unsigned long long UInt;
const int INF = 1001001001;
const Int INFLL = 1001001001001001001LL;
template<typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<typename T> void chmin(T& a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T& a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
double fin() { double x; scanf("%lf", &x); return x; }
Int lin() { Int x; scanf("%lld", &x); return x; }
const Int MO = 1000000007;
int N;
char S[300050], T[300050];
Int dp1[300050][2], lef[300050];
Int dp2[300050][2][2];
inline void add(Int& a, Int b) {
a += b;
if (a >= MO) a -= MO;
}
Int solve() {
if (T[0] == '1' && T[N - 1] == '1') {
Int ret = 1;
for (int i = 0; i < N; ++i) {
if (T[i] == '?') {
(ret *= 2) %= MO;
}
}
return ret;
}
if (T[0] == '1') {
reverse(T, T + N);
}
memset(dp1, 0, sizeof(dp1));
memset(lef, 0, sizeof(lef));
dp1[0][0] = 1;
for (int i = 0; i < N; ++i) {
if (T[i] != '1') {
add(dp1[i + 1][0], dp1[i][0]);
add(dp1[i + 1][0], dp1[i][1]);
}
if (T[i] != '0') {
add(dp1[i + 1][1], dp1[i][0]);
add((i % 2 == 0) ? lef[i + 1] : dp1[i + 1][1], dp1[i][1]);
}
}
reverse(T, T + N);
memset(dp2, 0, sizeof(dp2));
dp2[0][0][0] = 1;
for (int i = 0; i < N; ++i) {
for (int flg = 0; flg < 2; ++flg) {
if (T[i] != '1') {
add(dp2[i + 1][flg][0], dp2[i][flg][0]);
add(dp2[i + 1][flg][0], dp2[i][flg][1]);
}
if (T[i] != '0') {
int nflg = flg || (i == 0);
add(dp2[i + 1][nflg][1], dp2[i][flg][0]);
nflg |= (i % 2 == 0);
add(dp2[i + 1][nflg][1], dp2[i][flg][1]);
}
}
}
Int ret = lef[N];
for (int i = 1; i < N; i += 2) {
add(ret, lef[i] * (dp2[N - i][1][0] + dp2[N - i][1][1] + dp2[N - i][0][1]) % MO);
}
return ret;
}
int main() {
scanf("%s", S);
N = strlen(S);
if (N == 1) {
puts(S[0] == '0' ? "0" : "1");
return 0;
}
Int res = 0;
for (int i = 0; i < 4; ++i) {
memcpy(T, S, sizeof(T));
if (S[0] != '?' && S[0] != (i & 1) + '0') continue;
if (S[N-1] != '?' && S[N-1] != (i / 2) + '0') continue;
T[0] = (i & 1) + '0';
T[N-1] = (i / 2) + '0';
(res += solve()) %= MO;
}
printf("%lld\n", res);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int h, w;
cin >> h >> w;
vs s(h);
rep(i, h) cin >> s[i];
queue<pii> q;
vector<vi> dist(h, vi(w, INF));
q.emplace(0, 0);
dist[0][0] = 0;
while (!q.empty()) {
auto p = q.front(); q.pop();
int y = p.first, x = p.second, d = dist[y][x];
const vi dy = { -1, 0, 1, 0 }, dx = { 0, 1, 0, -1 };
rep(i, 4) {
int ny = y + dy[i], nx = x + dx[i];
if (ny<0||ny>=h||nx<0||nx>=w) continue;
if (s[ny][nx] == '#') continue;
if (dist[ny][nx] <= d+1) continue;
q.emplace(ny, nx);
dist[ny][nx] = d+1;
}
}
int cnt = 0;
rep(i, h) rep(j, w) if (s[i][j] == '.') ++cnt;
if (dist[h-1][w-1] == INF) cout << -1 << endl;
else cout << (cnt-dist[h-1][w-1]-1) << endl;
return 0;
}
| #include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> Q; Q.push(make_pair(0, 1));
bool visited[N]; for (int i = 0; i < N; i++) visited[i] = false;
visited[0] = true;
int score = -1;
while (!Q.empty()) {
auto front = Q.front(); Q.pop();
int u = front.first, d = front.second;
if (u == H*W-1) { score = white_num-d; break; }
vector<int> e;
if (u >= W) e.push_back(u-W);
if (u % W > 0) e.push_back(u-1);
if (u % W < W-1) e.push_back(u+1);
if (u / W < H-1) e.push_back(u+W);
for (int v : e) {
if (A[v] && !visited[v]) {
visited[v] = true;
Q.push(make_pair(v, d+1));
}
}
}
cout << score << endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
#define coa cout << ans << endl; return 0;
using namespace std;
using ll = long long;
template<typename T>
using vec = vector<T>;
template<typename T>
using vvec = vector<vector<T>>;
using qint = queue<int>;
using sint = stack<int>;
using pii = pair<int, int>;
int main(){
string s;
cin >> s;
map<int, int> alphabet;
for(auto c : s){
alphabet[c]++;
}
string ans;
for(char c = 'a'; c <= 'z'; c++){
if(alphabet[c] == 0){
ans.push_back(c);
}
}
if(ans.empty()) ans += "None";
else ans = ans[0];
coa
}
| #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(){
string az="abcdefghijklmnopqrstuvwxyz";
string s;
cin >> s;
sort(s.begin(),s.end());
int i=0,j=0;
rep(j,s.size()){
if(az[i]==s[j])i++;
if(i==26){cout << "None" << endl;return 0;}
}
cout << az[i];
return 0;
} | 1 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,y;
cin>>n>>y;
long long f=y/10000;
f(i,0,f+1){
f(j,0,n-i+1){
if(10000*i+5000*j+1000*(n-j-i)==y){
cout<<i<<" "<<j<<" "<<n-i-j<<endl;
return 0;
}
}
}
cout<<-1<<" "<<-1<<" "<<-1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>> spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
//-----------------------------------------
//-----------------------------------------
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start,end;
start = std::chrono::system_clock::now();
ll n, k ;
cin >> n >> k ;
vll a(n) ;
REP(i,n){
cin >> a[i] ;
}
ll ans = LINF ;
ll tmp ;
REP(i,n-k+1){
ll l = a[i] ;
ll r = a[i+k-1] ;
if(l*r<0){
l = abs(l) ;
r = abs(r) ;
tmp = 2*min(l,r) + max(l,r) ;
ans = min(ans,tmp) ;
}
else{
l = abs(l) ;
r = abs(r) ;
tmp = max(l,r) ;
ans = min(ans,tmp) ;
}
}
cout << ans <<endl;
end = std::chrono::system_clock::now();
auto elapsed = std::chrono::duration_cast< std::chrono::milliseconds >(end - start).count();
//std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| 0 |
Subsets and Splits