code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<iostream>
using namespace std;
int p = 1000000007;
int log2_p_MAX = 32;
long long felmer(long long a)
{
long long rem[log2_p_MAX];
rem[0] = a%p;
for(int i=1;i<log2_p_MAX;i++)
rem[i] = (rem[i-1]*rem[i-1])%p;
long long res = 1;
long long expo = p-2;
for(int i=0;i<log2_p_MAX;i++){
if(expo%2==1){
res *= rem[i];
res = res%p;
}
expo /= 2;
}
return res;
}
int main()
{
long long n,m,k,mn,i,res;
cin >> n >> m >> k;
res=m*n*(m*(n-1)*(n+1)+n*(m-1)*(m+1));
res%=p;
res*=felmer(6);
res%=p;
mn=m*n-2;
k-=2;
for(i=1;i<=k;i++){
res*=mn-i+1;
res%=p;
res*=felmer(i);
res%=p;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int 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)1E17;
#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 fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
///////////////////////////////////////
#define N 500004
ll kai[N];
ll kai2[N];
ll po(ll i,ll p){
if(p==0)return 1;
else if(p==1)return mod(i);
else if(p%2==0)return po(mod(mod(i)*mod(i)),p/2);
else return mod(mod(i)*po(i,p-1));
}
void calc(){
kai[0]=1;
kai2[0]=1;
rep(i,1,N-1){
kai[i]=mod(kai[i-1]*i);
}
kai2[N-1]=po(kai[N-1],i_5);
for(ll i=N-2;i>=0;i--){
kai2[i]=mod(kai2[i+1]*(i+1));
}
}
ll comb(ll n,ll k){
if(n<k)return 0;
else if(n==0)return 1;
else return mod(mod(kai[n]*kai2[n-k])*kai2[k]);
}
ll bunbo(ll n){
return po(n,i_5);
}
int main(){fastio
calc();
ll n,m,k;cin>>n>>m>>k;
ll last=kai2[k-2];
ll nowu=mod(n*m-2);
rep(i,1,k-2){
last=mod(last*nowu);
nowu--;
if(nowu<0)nowu=mod(nowu);
}
ll s[N];s[0]=0;rep(i,1,N-1)s[i]=s[i-1]+i;
ll sum1=0,sum2=0;
rep(i,1,m){
sum1+=s[i-1]+s[m-i];
}
sum1=mod(mod(sum1*n)*n);
rep(i,1,n){
sum2+=s[i-1]+s[n-i];
}
sum2=mod(mod(sum2*m)*m);
//cout<<sum1<<" "<<sum2<<endl;
sum1=mod(sum1+sum2);
last=mod(last*sum1);
last=mod(last*bunbo(2));
cout<<last<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
ll ch[3];
for(ll i=0;i<3;i++){
ch[i]=-1;
}
for(ll i=0;i<m;i++){
ll x,z;
cin>>x>>z;
x--;
if(ch[x]==-1){
ch[x]=z;
}
else{
if(ch[x]!=z){
cout << -1;
return 0;
}
}
}
if(ch[0]==0&&n!=1){
cout <<-1;
return 0;
}
for(ll i=0;i<n;i++){
if(ch[i]==-1){
if(i==0&&n!=1){
cout << 1;
}
else{
cout << 0;
}
}
else{
cout << ch[i];
}
}
// your code goes here
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<int> s(M);
vector<int> c(M);
int ans=0;
if(M == 0 && N==1){
cout << "0" << endl;
return 0;
}
for(int i=0; i<M; i++){
cin >> s.at(i) >> c.at(i);
if(N>1 && s.at(i) == 1 && c.at(i) == 0){
cout << "-1" << endl;
return 0;
}
}
vector<int> d(N);
for(int i=0; i<M; i++){
if(d.at(s.at(i)-1) == 1 && c.at(i) != ans/(int)(pow(10,N-s.at(i))) ) {
cout << "-1" << endl;
return 0;
}
if(d.at(s.at(i)-1) == 0){
ans += c.at(i)*(int)pow(10,N-s.at(i)) ;
d.at(s.at(i)-1)++;
}
}
if(d.at(0) == 0){
ans += (int)pow(10,N-1);
}
cout << ans << endl;
} | 1 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
long long min=0,max=0,total=0;
int x,n;
cin >>x;
for (int i=1; i<=x; i++) {
cin >> n;
if(i==1){
min =n;
max=n;
total=n;
}else {
if(n<min){
min=n;
}
if(n>max){
max=n;
}
total=total+n;
}
}
cout <<min<<" "<<max<<" "<<total<<endl;
// insert code here...
//std::cout << "Hello, World!\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;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1, 1}; const int dy[] = {-1, 0, 1,-1, 1,-1, 0, 1};
#define PI 3.14159265358979323846264338327950L //setprecision(15)
int main() {
int N; cin >> N;
string s, t; cin >> s >> t;
string tmp;
int ans = INF;
for (int i = 0; i <= t.length(); i++) {
tmp = s;
tmp = s + t.substr(t.length()-i);
if (tmp.substr(0,N) == s &&
tmp.substr(i,N) == t) ans = min(ans, (int)tmp.length());
}
cout << ans << endl;
} | 0 |
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
unordered_map<int64_t, int64_t> count;
int64_t sum = 0;
count[sum]++;
rep(i, N) {
int a;
cin >> a;
sum = (sum + a) % M;
count[sum]++;
}
int64_t answer = 0;
for (auto& n : count) {
answer += (n.second) * (n.second - 1) / 2;
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000000000000LL
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define lastone(n) ((n)&(-(n)))
#define read freopen("debug\\in.txt","r",stdin)
#define write freopen("debug\\out.txt","w",stdout)
#define DBG(a) cout<<#a<<" ->->->-> "<<a<<"\n"
#define EN cout<<"\n"
#define fi first
#define se second
#define PI (acos(-1))
#define fastread ios::sync_with_stdio(false);cin.tie(NULL)
#define mod (1000000007)
#define asz 2000005
template<class T,class V> ostream& operator<<(ostream &s,pair<T,V> a)
{
s<<a.fi<<' '<<a.se;
return s;
}
int main()
{
fastread;
int T=1;
// cin>>T;
for(int qq=1; qq<=T; qq++)
{
int n,m;
cin>>n>>m;
ll sum=0,ans=0;
map<ll,ll> mp;
mp[0]=1;
for(int i=0;i<n;i++){
ll x;
cin>>x;
sum+=x;
ans+=mp[sum%m];
mp[sum%m]++;
}
cout<<ans<<endl;
}
}
| 1 |
//FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
int main()
{
IOS;
ll n;cin>>n;
vl f(N);
ll ans=1;
for(int i=1;i<=n;i++){
ll x;cin>>x;
ll temp;
if(!x){
temp=3-f[0];
}
else {
temp=f[x-1]-f[x];
}
if(temp<=0){
cout<<0;
return 0;
}
ans=ans*temp%M;
f[x]++;
}
cout<<ans;
//end_routine();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1];}
#define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl;
#define INF (1e18)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
typedef pair<ll, ll> lpair;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll K;
cin >> K;
ll N = 50;
ll a[55] = {};
rep(i,0,N) a[i] = i;
ll v = K / N;
rep(i,0,N) a[i] += v;
ll amari = K % N;
rep(i,0,amari){
rep(j,0,N){
if(i == j){
a[j] += N;
}else{
a[j]--;
}
}
}
print(N);
printa(a,N);
}
| 0 |
#include <iostream>
#include <fstream>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
int limit(int lim, int exp) {
int res = 0;
for (int i = 0; pow(i,exp) < lim+1; i++) {
res = i;
}
return res;
}
int main(void) {
int e;
cin >> e;
while (e != 0) {
int m = 0;
int res;
int en = e;
int temp;
int z = limit(en,3);
for (int i = 0; i < 10 && !((z-i) < 0); i++) {
m = 0;
en = e;
m += z-i;
en -= pow(z-i,3);
temp = limit(en,2);
m += temp;
en -= pow(temp,2);
temp = limit(en,1);
m += temp;
if (i == 0) {
res = m;
}
else if (m < res) {
res = m;
}
}
temp = limit(e,2);
if (temp < res) {
if (pow(temp,2) == e) {
res = temp;
}
}
cout << res << endl;
cin >> e;
}
return 0;
} | #include<iostream>
using namespace std;
int e,x,y,MIN,i,j;
int main(){
while(true){
MIN=1<<27;
cin>>e;if(!e){break;}
for(i=0;i*i*i<=e;i++){
for(j=0;j*j+i*i*i<=e;j++){
MIN=min(MIN,i+j+e-(i*i*i+j*j));
}
}
cout<<MIN<<endl;
}
} | 1 |
#include <cstdio>
#include <vector>
using namespace std;
int main()
{
int n, q;
scanf("%d", &n);
vector<int> S(n);
for(auto it=S.begin(); it!=S.end(); it++){
scanf("%d", &(*it));
}
S.push_back(-1);
scanf("%d", &q);
int sum=0;
for(int i=0; i<q; i++){
int qq;
scanf("%d", &qq);
*S.end()=qq;
auto it=S.begin();
for(; *it!=qq; it++){
}
sum+=it==S.end() ? 0 : 1;
}
printf("%d\n", sum);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &rviTrg, vector<int> &rviSch)
{
int iTrgCnt;
cin >> iTrgCnt;
rviTrg.resize(iTrgCnt + 1);
for (int i = 0; i < iTrgCnt; i++)
cin >> rviTrg[i];
int iSchCnt;
cin >> iSchCnt;
rviSch.resize(iSchCnt);
for (int i = 0; i < iSchCnt; i++)
cin >> rviSch[i];
}
void fnLinSch(vector<int> &rviTrg, const vector<int> &cnrviSch, int &riFnd)
{
size_t zMaxSiz = rviTrg.size() - 1;
for (size_t zi = 0; zi < cnrviSch.size(); zi++)
{
rviTrg[zMaxSiz] = cnrviSch[zi];
size_t zj = 0;
while (rviTrg[zj] != cnrviSch[zi])
zj++;
if (zj != zMaxSiz)
riFnd++;
}
}
void fnResult(int a_iFnd)
{
cout << a_iFnd << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> viTrg, viSch;
int iFnd = 0;
fnInput(viTrg, viSch);
fnLinSch(viTrg, viSch, iFnd);
fnResult(iFnd);
return 0;
} | 1 |
#include <iostream>
using namespace std;
char c[55][55];
int H, W, cnt;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> c[i][j];
}
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
if (c[i][j] == '#' && c[i][j - 1] != '#' && c[i - 1][j] != '#' && c[i][j + 1] != '#' && c[i + 1][j] != '#') cnt++;
}
}
if (cnt == 0) cout << "Yes" << endl;
else cout << "No" << endl;
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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 11
int main()
{
int n,k; cin >> n >> k;
int a[n];
rep(i,n) cin >> a[i];
int tmp[n];
for(int t = 0; t < k; t++){
rep(i,n) tmp[i] = 0;
rep(i,n){
if(i - a[i] < 0){
tmp[0]++;
}else{
tmp[i-a[i]]++;
}
if(i + 1 + a[i] < n){
tmp[i+1+a[i]]--;
}
}
a[0] = tmp[0];
rep(i,n-1){
a[i+1] = a[i] + tmp[i+1];
}
bool f = true;
rep(i,n) if(a[i] != n) f = false;
if(f) break;
}
rep(i,n) cout << a[i] << ' ';
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
void yes() { cout << "Yes" << endl; exit(0); }
void no() { cout << "No" << endl; exit(0); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> void amax(T &x, T y) { x = max(x, y); }
template <typename T> void amin(T &x, T y) { x = min(x, y); }
template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
const int INF = 1001001001;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
void solve() {
int n, k;
cin >> n >> k;
vi32 a(n);
cin >> a;
while (k--) {
auto p = a;
a.assign(n, 0);
rep(i, n) {
int l = max(0, i - p[i]);
int r = min(n, i + p[i] + 1);
a[l] += 1;
if (r < n) a[r] -= 1;
}
rep(i, n - 1) a[i + 1] += a[i];
if (a == p) {
break;
}
}
cout << a << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
constexpr double PI = acos(-1);
cout << fixed << setprecision(16);
cin.tie(0); ios::sync_with_stdio(false);
ll n;
cin >> n;
ll v[] = {101,131,151,181,191,211,241,251,271,281,311,331,401,421,431,461,491,521,541,571,601,631,641,661,691,701,751,761,811,821,881,911,941,971,991,1021,1031,1051,1061,1091,1151,1171,1181,1201,1231,1291,1301,1321,1361,1381,1451,1471,1481,1511,1531,1571,1601,1621,1721,1741,1801,1811,1831,1861,1871,1901,1931,1951,2011,2081,2111,2131,2141,2161,2221,2251,2281,2311,2341,2351,2371,2381,2411,2441,2521,2531,2551,2591};
for(ll i=0; i<n; i++)
cout << v[i] << ' ';
cout << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
vector<bool> alpha(26);
int N = S.size();
string s = "abcdefghijklmnopqrstuvwxyz";
rep(i,N){
alpha[S[i] - 'a'] = true;
}
rep(i,26){
if(alpha[i] == false){
cout << s[i] << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
| 0 |
#include<cstring>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;//往左走w-1,往下走h-1
const ll mod=1000000007;
ll f[1000000];
ll quick(ll a,ll b)
{
// cout<<"a"<<a<<"b"<<b<<endl;
ll ans=1;
while(b)
{
if(b&1)
{
ans=(ans*a)%mod;
}
b>>=1;
a=(a*a)%mod;
}
// cout<<"("<<ans<<endl;
return ans;
}
ll ni(ll a)
{
// cout<<"ni"<<endl;
return quick(a,mod-2);
}
ll c(int n,int m)
{
ll a=f[n];
// cout<<"a"<<f[n]<<endl;
ll b=(f[m]*f[n-m])%mod;
// cout<<"b"<<b<<endl;
return (a*ni(b))%mod;
}
int main()
{
int h,w,a,b;
f[0]=1;
for(int i=1;i<=200005;i++)
{
f[i]=(f[i-1]*i)%mod;
}
cin>>h>>w>>a>>b;
ll ans=0;
ll t;
for(int i=b+1;i<=w;i++)
{
// cout<<"-----"<<endl;
// cout<<"!"<<c(h-a-1+i-1,h-a-1)<<endl;
// cout<<"!"<<c(w-i+a-1,a-1)<<endl;
t=(c(h-a-1+i-1,h-a-1)*c(w-i+a-1,a-1))%mod;
ans=(ans+t)%mod;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define reg register
#define F(i,j,k) for(reg int i=j;i<=k;++i)
#define dF(i,j,k) for(reg int i=j;i>=k;--i)
using namespace std;
typedef long long ll;
int n,k;
const int mod=998244353;
const int MN=2005;
int C[MN<<1][MN<<1],pw[MN<<1];
inline ll solve(int i,int n){
reg int k2=min(k-i/2,(i-1)/2);reg int k1=k-(k2<<1)-((i&1)==0);
reg ll res=0,pos=1;
for(reg int j=k2;j+k1>0&&j>=0;j--,pos*=-1)
res+=pos*C[j+k1+n-1][j+k1-1]*pw[j]%mod*C[k2][j]%mod,
res%=mod;
return (res+mod)%mod;
}
int main(){
cin>>k>>n;C[0][0]=1;pw[0]=1;
F(i,1,4000){
C[i][0]=1;pw[i]=(pw[i-1]+pw[i-1])%mod;F(j,1,i)C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
reg ll ans=0;
F(i,2,k<<1){
if(~i&1)ans=(solve(i,n)+solve(i,n-1))%mod;
else ans=solve(i,n);
printf("%lld\n",ans);
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<string.h>
#include<queue>
using namespace std;
const int N = 1e5 + 7;
string x[3] = { "RGB","GBR","BRG" };
int y[3][N];
int main() {
int n, k;
while (cin >> n >> k) {
cout << n - k + 1 << '\n';
}
return 0;
}
| #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
}
| 1 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getline(s, element, ' ')) {
stringstream buf;
int value = 0;
buf << element;
buf >> value;
result.push_back(value);
}
return std::move(result);
}
int main(int argc, char* argv[])
{
using namespace std;
while (true) {
string line;
getline(std::cin, line);
auto elements = parse_line(line);
auto length = elements[0];
if (length == 0) break;
vector<int> total(length + 1);
size_t width = length + 1;
for (size_t i = 0; i < length; ++i) {
getline(cin, line);
elements = parse_line(line);
int sum = 0;
for (size_t n = 0; n < length; ++n) {
int val = elements[n];
sum += val;
total[n] += val;
cout << setw(5) << val;
}
cout << setw(5) << sum << endl;
total[length] += sum;
}
for (size_t i = 0; i < width; ++i) {
cout << setw(5) << total[i];
}
cout << endl;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int n;
while(cin>>n,n)
{
int f[n+1][n+1];
memset(f,0,sizeof(f));
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
cin>>f[i][j];
f[i][n]+=f[i][j];
f[n][j]+=f[i][j];
f[n][n]+=f[i][j];
}
}
for(int i = 0; i <= n; ++i)
{
for(int j = 0; j <= n; ++j)
{
printf("%5d",f[i][j]);
}
cout<<endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void input(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& roQuery : rvoQuery)
cin >> roQuery.m_nLeft >> roQuery.m_nRigt;
}
void calcSubStrACCnt(string sStr, const vector<StQuery>& cnrvoQuery)
{
vector<int> vnCumlSum(sStr.size() + 1); // 累積和
//vnCumlSum_ix 0 1 2 3 4 5 6 7 8
//sStr_pos 1 2 3 4 5 6 7 8
//sStr A C A C T A C G
//sStr_ix 0 1 2 3 4 5 6 7
for (int nBgn = 0; nBgn < vnCumlSum.size() - 1; nBgn++)
{
vnCumlSum[ nBgn + 2 ] = vnCumlSum[ nBgn + 1 ];
if (sStr[nBgn] == 'A' && sStr[nBgn + 1] == 'C')
vnCumlSum[ nBgn + 2 ]++;
}
for (int i = 0; i < cnrvoQuery.size(); i++)
{
cout << vnCumlSum[ cnrvoQuery[i].m_nRigt ] - vnCumlSum[ cnrvoQuery[i].m_nLeft ];
cout << endl;
}
}
int main()
{
string sStr;
vector<StQuery> voQuery;
input(sStr, voQuery);
calcSubStrACCnt(sStr, voQuery);
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main()
{
//ifstream cin("input.txt");
int n, q;
string s;
cin>>n>>q;
cin>>s;
vi cnt(n, 0);
rep(i, 1, n- 1)
{
if(s[i-1] == 'A' && s[i] == 'C')
cnt[i] = 1 + cnt[i-1];
else
cnt[i] = cnt[i-1];
}
rep(i, 1,q)
{
int l,r;
cin>>l>>r;
l--;
r--;
cout<<cnt[r] - cnt[l]<<"\n";
}
} | 1 |
#include<iostream>
#include<map>
#include<vector>
using namespace std;
const int mod=1e9+7;
int modpow(long a,int p){
long res=1;
while(p){
if(p&1) (res*=a)%=mod;
(a*=a)%=mod;
p>>=1;
}
return res;
}
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int x[n];
x[0]=a[0];
for(int i=1;i<n;i++) x[i]=a[i]^x[i-1];
map<int,vector<int>> m;
for(int i=0;i<n;i++) if(x[i]) m[x[i]].push_back(i);
long ans=0;
if(x[n-1]==0){
int znum[n];
znum[0]=(x[0]==0);
for(int i=1;i<n;i++) znum[i]=znum[i-1]+(x[i]==0);
long res=0;
for(auto p:m){
vector<int> v=p.second;
long z=1,o=0;
int cur=0;
for(int i:v){
long zero=znum[i]-znum[cur];
long zn=(o*zero+z)%mod;
long on=(zn+o)%mod;
z=zn;
o=on;
cur=i;
}
(res+=o)%=mod;
}
(res+=modpow(2,znum[n-1]-1))%=mod;
ans=res;
}else{
int y=x[n-1];
long z=1,o=0;
for(int i=0;i<n;i++){
if(x[i]==0) (z+=o)%=mod;
else if(x[i]==y) (o+=z)%=mod;
}
ans=z;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
main() {
int64_t n;
cin >> n;
int64_t x = 0;
vector<int64_t> xx(n);
for (auto i : irange(0L, n)) {
int64_t aa;
cin >> aa;
x ^= aa;
xx[i] = x;
}
constexpr auto M = 1000000007;
auto last_x = xx.back();
cerr << last_x << endl;
if (last_x > 0) {
int64_t count = 0;
int64_t count0 = 0;
for (auto x : xx) {
if (x == 0) {
count0 += count;
count0 %= M;
} else if (x == last_x) {
count += count0 + 1;
count %= M;
}
}
cout << count0 + 1 << endl;
} else {
unordered_map<int64_t, int64_t> count0;
unordered_map<int64_t, int64_t> count;
unordered_map<int64_t, int64_t> last_num0;
int64_t num0 = 0;
for (auto i : irange(0L, n)) {
auto x = xx[i];
if (x == 0) {
++num0;
} else {
count0[x] += (count[x] * ((num0 - last_num0[x]) % M)) % M;
count[x] += count0[x] + 1;
count[x] %= M;
last_num0[x] = num0;
}
}
int64_t ans = 0;
for (auto kv : count) {
ans += kv.second;
ans %= M;
}
int64_t p0 = 1;
for (auto i : irange(0L, num0 - 1)) {
p0 *= 2;
p0 %= M;
}
cerr << ans << endl;
cerr << p0 << endl;
cout << (ans + p0) % M << endl;
}
} | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define ll long long
using namespace std;
typedef pair<char,int> pii;
set<ll>mapa;
const int maxv=2300000;
int n,pos[maxv+10],br;
ll primes[maxv],rows[1010],cols[1010],aa[519][510];
vector<ll>a[510][510];
void check(){
ll maxx=LONG_MIN;
ll minn=LONG_MAX;
set<ll>mapa2;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i<n){
mapa.insert(max(aa[i][j],aa[i+1][j])%min(aa[i][j],aa[i+1][j]));
}
if(j<n){
mapa.insert(max(aa[i][j],aa[i][j+1])%min(aa[i][j],aa[i][j+1]));
}
maxx=max(maxx,aa[i][j]);
minn=min(minn,aa[i][j]);
mapa2.insert(aa[i][j]);
}
}
printf("%d %d %lld %lld\n",mapa.size(),mapa2.size(),maxx,minn);
}
void sito(){
for(int i=2;i<=maxv;i++){
if(pos[i])continue;
primes[++br]=i;
for(int j=i;j<=maxv;j+=i)pos[j]=1;
}
}
ll lcm(ll a,ll b){
return (a/__gcd(a,b))*b;
}
void fix(int x,int y){
ll lc=1;
if(aa[x+1][y]!=0){lc=lcm(lc,aa[x+1][y]);}
if(aa[x-1][y]!=0){lc=lcm(lc,aa[x-1][y]);}
if(aa[x][y+1]!=0){lc=lcm(lc,aa[x][y+1]);}
if(aa[x][y-1]!=0){lc=lcm(lc,aa[x][y-1]);}
aa[x][y]=lc+1;
}
int dist(int x,int y,int x1,int y1){
return abs(x-x1)+abs(y-y1);
}
int main(){
///freopen("test.txt","r",stdin);
scanf("%d",&n);
if(n==2){
printf("4 7\n23 10\n");
return 0;
}
sito();
int curr=0;
for(int i=0;i<n;i++)
rows[i*2]=primes[++curr];
for(int i=0;i<n;i++)
cols[i*2]=primes[++curr];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(dist(1,1,i,j)%2==0){
a[i][j].pb(rows[dist(1,1,i,j)]);
aa[i][j]=rows[dist(1,1,i,j)];
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(n%2){
if(dist(n,1,i,j)%2==0){
a[i][j].pb(cols[dist(n,1,i,j)]);
aa[i][j]*=cols[dist(n,1,i,j)];
}
}
else{
if(dist(n,1,i,j)%2==1){
a[i][j].pb(cols[dist(n,1,i,j)-1]);
aa[i][j]*=cols[dist(n,1,i,j)-1];
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if((i+j)%2)fix(i,j);
printf("%lld ",aa[i][j]);
}
printf("\n");
}
return 0;
}
| #include<bits/stdc++.h>
#define Fail puts("NO"),exit(0);
#define eps 1e-10
#define maxn 505
#define maxm 4010
#define inf 1000000007
#define mod 998244353
#define pi acos(-1)
#define mp(x,y) make_pair(x,y)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef bitset<maxn> bit;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n;
int prime[100010],primesize;
bool notprime[100010];
void get_prime()
{
for(int i=2;i<=100000;i++)
{
if(!notprime[i]) prime[++primesize]=i;
for(int j=1;j<=primesize&&i*prime[j]<=100000;j++)
{
notprime[i*prime[j]]=true;
if(i%prime[j]==0) break;
}
}
}
ll ans[maxn][maxn];
int xx[4]={0,0,1,-1};
int yy[4]={1,-1,0,0};
bool check(int x,int y)
{
return (x>=1&&x<=n&&y>=1&&y<=n);
}
ll gcd(ll x,ll y)
{
if(!y) return x;
return gcd(y,x%y);
}
ll lcm(ll x,ll y)
{
return x*(y/gcd(x,y));
}
int main()
{
get_prime();
n=read();
int l=1,r=(n<<1)+(!(n&1));
for(int i=2;i<=(n<<1);i+=2)
{
int val;
if(i%4==0) val=prime[l++];
else val=prime[r--];
for(int x=1;x<=n;x++)
{
int y=(i-x);
if(y<=0||y>n) continue;
ans[x][y]=val;
}
}
for(int i=-(n-1)/2*2;i<=(n-1)/2*2;i+=2)
{
int val;
if(i%4==0) val=prime[l++];
else val=prime[r--];
for(int x=1;x<=n;x++)
{
int y=(i+x);
if(y<=0||y>n) continue;
ans[x][y]*=val;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if((i+j)&1)
{
for(int k=0;k<4;k++)
{
int tx=i+xx[k],ty=j+yy[k];
if(check(tx,ty))
{
if(!ans[i][j]) ans[i][j]=ans[tx][ty];
else ans[i][j]=lcm(ans[i][j],ans[tx][ty]);
}
}
ans[i][j]++;
}
}
}
if(n==2) ans[1][2]=ans[1][2]*2-1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) printf("%lld ",ans[i][j]);
puts("");
}
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxx = 110;
const int INF = 1 << 30;
int main()
{
int n, p[maxx], m[maxx][maxx];
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &p[i - 1], &p[i]);
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][j] = INF;
for (int k = i; k <= j - 1; k++)
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
}
}
printf("%d\n", m[1][n]);
return 0;
} | /**
* matrix chain multiplication
* f(n,m) = multiply Mn*M(n+1)*...*M(m-1)*M(m)
* f(n,n) = 1
* r(n)=c(n-1)
* f(n,n+1) = C(n) * R(n) * C(n+1) = c(n) * c(n-1) * c(n+1)
* f(n,k,m) = f(n,k)*f(k+1,m)*C(n)*r(n)*c(k)
* f(n,m) = min(f(n,k,m)
*/
#include <iostream>
#include <cmath>
#include <climits>
using namespace std;
int r[100] = {0};
int a[100][100] = {0};
int f(int n, int m);
int f(int n, int k, int m);
int f(int n, int k, int m)
{
return f(n,k) + f(k+1,m) + (r[n] * r[k+1] * r[m+1]);
}
int f(int n, int m)
{
if (n==m) return 0;
int & ra = a[n][m];
if (ra) return ra;
ra = INT_MAX;
for (int k=n;k<m;k++)
{
int ans = f(n,k,m);
if (ans < ra) ra = ans;
}
return ra;
}
int main()
{
int rr = 0;
int cc = 0;
int n = 0;
cin >> n;
for (int i=0;i<n;i++)
{
cin >> rr >> cc;
r[i]=rr;
r[i+1]=cc;
}
for (int i=0;i<n-1;i++)
{
a[i][i+1] = r[i] * r[i+1] * r[i+2];
}
int ans = f(0,n-1);
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define num(a) a-'0'
#define maxself(a,b) if(b>a)a=b
#define minself(a,b) if(b<a)a=b;
#define debug(x) cout<<#x<<":"<<x<<" "
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define vl vector<long long int>
#define v vector
#define p pair
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long long int ll;
typedef long double ld;
typedef double d;
using namespace std;
ll modF=1e9+7;
ll INF=1e11;
void solve(){
int n;
cin>>n;
v<v<p<int,int>>> a(n);
int h;
rep(i,0,n){
cin>>h;
rep(j,0,h){
int x,pos;
cin>>x>>pos;
a[i].pb(mk(x,pos));
}
}
ll ans=0;
for(int bit=0;bit<(1<<n);bit++){
int counter=0;
int pos=1;
for(int j=0;j<n;j++){
if(1<<j & bit){
for(auto e:a[j]){
h=((1<<(e.f-1)) & bit);
if(h==0 && e.s==1){
pos=0;
}
else if(h!=0 && e.s==0){
pos=0;
break;
}
}
counter++;
}
}
if(pos){
maxself(ans,counter);
}
}
cout<<ans<<ln;
}
int main(){
boost_io;
solve();
return 0;
} | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(long long i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(_,v.size())cout<<" "<<v[_];cout<<endl;
#define show2d(v) rep(__,v.size()){rep(_,v[__].size())cout<<" "<<v[__][_];cout<<endl;}
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
// typedef tuple<int,int,int> tp;
// typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
signed main(){
int n;
cin>>n;
vvi in(n,vi(2));
rep(i,n)rep(j,2)cin>>in[i][j];
sort(all(in),[](vi a,vi b){
return a[0]+a[1]<b[0]+b[1];
});
vi dp(n+1,inf);
dp[0]=0;
rep(i,n){
vi ndp=dp;
rep(j,n){
if(dp[j]<=in[i][0])
cmin(ndp[j+1],dp[j]+in[i][1]);
}
dp=ndp;
}
int out=inf;
rep(i,n+1)if(dp[i]-inf)out=i;
cout<<out<<endl;
}
| 0 |
#include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define var(type, ...) type __VA_ARGS__; read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) { return b > a && (a = b, true); }
template <class T, class U> inline bool chmin(T &a, const U &b) { return b < a && (a = b, true); }
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T>
inline vector<T> makeV(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeV<T>(initValue, args...))>(sz, makeV<T>(initValue, args...));
}
template <class T>
inline istream& operator>> (istream &is, vector<T> &vec) {
for (auto &e : vec) is >> e;
return is;
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail&... tail) { cin >> head; read(tail...); }
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<< (ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = { " ", "" };
for (const auto &e : vec) os << e << delim[&e == &vec.back()];
return os;
}
template <class Container>
struct Rev {
Container &x_;
inline Rev(Container &x): x_(x) {}
inline auto begin() { return rbegin(x_); }
inline auto end() { return rend(x_); }
};
// }}} End Header
signed main() {
var(int, N);
string res;
vector<int> a(N, -1);
const auto ask = [&](int n) -> int {
string res;
cout << n << endl;
cin >> res;
if (res == "Vacant") return a[n] = 0;
if (res == "Male") return a[n] = 1;
return a[n] = 2;
};
if (ask(0) == 0) return 0;
int begin = 0;
int end = N;
int cnt = 0;
while (++cnt <= 20 && end - begin > 1) {
const int mid = (begin + end) / 2;
if (ask(mid) == 0) return 0;
if ((a[begin] == a[mid]) == ((mid - begin) & 1)) {
end = mid;
} else {
begin = mid;
}
}
return 255;
}
| #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<bool> ans(n, false);
int cnt = 0;
for (int i = n-1; i >= 0; --i) {
bool flg = false;
for (int j = i; j < n; j = j + (i+1)) {
flg ^= ans[j];
}
if (flg ^ a[i]) {
++cnt;
ans[i] = true;
}
}
cout << cnt << endl;
if (cnt == 0) return 0;
rep(i, n) {
if (ans[i]) {
if (i >= 1) cout << " ";
cout << i+1;
}
}
cout << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define HMAX 20
#define WMAX 20
using namespace std;
int w,h;
int dd[5]={0,1,0,-1,0};
void dfs_aux(int sx, int sy, int map[WMAX][HMAX],int *min,int count){
rep(r,4){
int nx=sx,ny=sy;
if(map[nx+dd[r]][ny+dd[r+1]]==1)
continue;
while(0<=nx+dd[r] && nx+dd[r]<w && 0<=ny+dd[r+1] && ny+dd[r+1]<h){
nx+=dd[r];
ny+=dd[r+1];
if(map[nx][ny]==3)
if(*min > count){
*min = count;
break;
}
if(map[nx][ny]==1){
break;
}
}
if(map[nx][ny]==1 && count <10){
map[nx][ny]=0;
nx-=dd[r];ny-=dd[r+1];
dfs_aux(nx,ny,map,min,count+1);
nx+=dd[r];ny+=dd[r+1];
map[nx][ny]=1;
}
}
}
int dfs(int sx, int sy, int map[WMAX][HMAX]){
int min=11;
dfs_aux(sx,sy,map,&min,1);
if(min>10)
return -1;
return min;
}
int main(){
for(;;){
scanf("%d %d",&w,&h);
if(!(w+h)) break;
int map[WMAX][HMAX],sx,sy;
rep(i,h){
rep(j,w){
scanf("%d",&map[j][i]);
if(map[j][i]==2){
sx=j;
sy=i;
}
}
}
printf("%d\n",dfs(sx,sy,map));
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int v[22][22], W, H, turn, m;
void dfs(int h, int w){
if(turn < 11){
turn++;
if(v[h][w+1]==0 || v[h][w+1]==3){
for(int i=1; w+i<W; i++){
if(v[h][w+i]==3 && turn<m){
m = turn;
break;
}
if(v[h][w+i]==1){
v[h][w+i]=0;
dfs(h, w+i-1);
v[h][w+i]=1;
break;
}
}
}
if(v[h][w-1]==0 || v[h][w-1]==3){
for(int i=1; w-i>=0; i++){
if(v[h][w-i]==3 && turn<m){
m = turn;
break;
}
if(v[h][w-i]==1){
v[h][w-i]=0;
dfs(h, w-i+1);
v[h][w-i]=1;
break;
}
}
}
if(v[h+1][w]==0 || v[h+1][w]==3){
for(int i=1; h+i<H; i++){
if(v[h+i][w]==3 && turn<m){
m = turn;
break;
}
if(v[h+i][w]==1){
v[h+i][w]=0;
dfs(h+i-1, w);
v[h+i][w]=1;
break;
}
}
}
if(v[h-1][w]==0 || v[h-1][w]==3){
for(int i=1; h-i>=0; i++){
if(v[h-i][w]==3 && turn<m){
m = turn;
break;
}
if(v[h-i][w]==1){
v[h-i][w]=0;
dfs(h-i+1, w);
v[h-i][w]=1;
break;
}
}
}
turn--;
}
}
int main(void){
int h1, w1;
while(cin>>W>>H){
if(W==0 && H==0) break;
m = 11;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> v[i][j];
if(v[i][j]==2){
h1=i; w1=j;
v[i][j]=0;
}
}
}
turn = 0;
dfs(h1, w1);
if(m==11)cout << -1 << endl;
else cout << m << endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
char ch[1000000];
int main(){
int n;
cin>>n;
cout<<n/3<<endl;
return 0;
}
| //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
signed main(void)
{
int n;
cin >> n; cin.ignore();
REP(i, n) {
string s;
getline(cin, s);
FOR(j, 6, s.size()) {
if(s.substr(j-6, 7) == "Hoshino") s[j] = 'a';
}
cout << s << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>
#include <cstdio>
#include <climits>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)return x;
return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y)*y;
}
ll kai(ll x, ll y, ll m) {
ll res = 1;
for (ll i = x - y + 1; i <= x; i++) {
res *= i; res %= m;
}
return res;
}
ll mod_pow(ll x, ll y, ll m) {
ll res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
ll comb(ll x, ll y, ll m) {
if (y > x)return 0;
return kai(x, y, m) * mod_pow(kai(y, y, m), m - 2, m) % m;
}
string s, t;
int k;
int d[310][310][310];
signed main() {
std::random_device rnd;
std::mt19937_64 mt(rnd());
cin >> s >> k;
t = s;
reverse(all(t));
int n = (int)s.size();
for (int i = 0; i < n; i++)for (int j = 0; j < n; j++) {
if (n <= i + j)continue;
for (int l = 0; l <= k; l++)d[i + 1][j + 1][l] = max(d[i][j + 1][l], d[i + 1][j][l]);
if (s[i] == t[j])for (int l = 0; l <= k; l++)d[i + 1][j + 1][l] = max(d[i + 1][j + 1][l], d[i][j][l] + 1);
else for (int l = 0; l < k; l++)d[i + 1][j + 1][l + 1] = max(d[i + 1][j + 1][l + 1], d[i][j][l] + 1);
}
int ans = 0;
for (int i = 0; i <= n; i++)for (int j = 0; j <= n; j++) {
if (n <= i + j - 2)continue;
int ma = 0;
for (int l = 0; l <= k; l++)ma = max(ma, d[i][j][l]);
if (i + j == n + 1)ans = max(ans, 2 * ma - 1);
else ans = max(ans, 2 * ma);
}
cout << ans << endl;
}
| #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = 998244353;
int N, M;
long long dat[2000009];
long long quickpow(long long b, long long e)
{
return e ? ((e & 1 ? b : 1)*quickpow((b*b) % MOD, e >> 1)) % MOD : 1;
}
long long combi(int n, int m)
{
long long retval = dat[n];
retval = retval * quickpow(dat[n - m], MOD - 2);
retval = retval % MOD;
retval = retval * quickpow(dat[m], MOD - 2);
retval = retval % MOD;
return retval;
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N >> M;
dat[0] = 1;
for (int i = 1; i < 2000009; i++) {
dat[i] = dat[i - 1] * i;
dat[i] = dat[i] % MOD;
}
int lb = min(N, M);
long long ans = 0, tmp;
for (int i = 0; i <= lb; i++) {
if (3 * M - i >= 0 && (3 * M - i) % 2 == 0) {
tmp = combi((3 * M - i) / 2 + N - 1, N - 1);
tmp = tmp * combi(N, i);
tmp = tmp % MOD;
ans += tmp;
ans = ans % MOD;
}
}
tmp = combi(M + N - 1, N - 1);
tmp = tmp + MOD - combi(M + N - 2, N - 2);
tmp = tmp * N;
tmp = tmp % MOD;
ans = ans + MOD - tmp;
ans = ans % MOD;
cout << ans << E;
//system("pause");
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
if (s.length() == 2)
{
if (s[0] == s[1])
{
cout << 1 << " " << 2 << endl;
return 0;
}
}
for (int i = 0; i < s.length() - 2; i++)
{
if (s[i] == s[i + 2])
{
cout << i + 1 << " " << i + 3 << endl;
return 0;
}
else if (s[i] == s[i + 1])
{
cout << i + 1 << " " << i + 2 << endl;
return 0;
}
else if (s[i + 1] == s[i + 2])
{
cout << i + 2 << " " << i + 3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
} | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) // dist between two elements
// #define M_PI 3.14159265358979323846 // CF
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) cout << fixed << setprecision(10) << x << endl; // 小数点を10桁まで表示
#define endl "\n"
#define Case(x) printf("Case #%d: ", x); // gcj
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<char> vch;
typedef vector<vector<char>> vvch;
constexpr ll LINF = 1001002003004005006ll;
constexpr int INF = 1001001001;
constexpr int n_max = 2e5+10;
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; };
template<class T, class U>
T POW(T x, U n) {T ret=1; while (n>0) {if (n&1) {ret*=x;} x*=x; n>>=1;} return ret;};
// debug
template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';};
string to_string(const char c) {return to_string((string) &c);};
string to_string(bool b) {return (b ? "true" : "false");};
template <size_t N>
string to_string(bitset<N> v){
string res = "";
for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
return res;
};
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for(const auto &x : v) {
if(!first) res += ", ";
first = false; res += to_string(x);
}
res += "}";
return res;
};
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
void debug_out() {cerr << endl;};
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); };
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 71
#endif
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
};
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
};
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
};
PI solve(string &s) {
int n = s.size();
vvi table(26);
rep(i, 0, 26) {
char ch = 'a'+i;
rep(j, 0, n) {
if (s[j] == ch) table[i].pb(j);
}
}
rep(i, 0, 26) {
rep(j, 0, table[i].size()-1) {
if (table[i][j+1]-table[i][j] < 3) {
return make_pair(table[i][j]+1,table[i][j+1]+1);
}
}
}
return make_pair(-1, -1);
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
PI ans = solve(s);
cout << ans.first << " " << ans.second << endl;
return 0;
};
| 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
const ll INF = 1e12;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
void solve(){
string s;
cin >> s;
int ans = 0;
map<char,int> m;
for(int i =s.size()-1;i>=0;i--){
for(char c = 'a';c<='z';c++){
if(c != s[i]){
ans += m[c];
}
}
m[s[i]]++;
}
ans++;
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
ll tt=1;
// cin >> tt;
while(tt--){
solve();
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
#include <math.h>
#define MOD 1000000007
using namespace std;
ifstream fin("../data.txt");
int x;
unordered_map<int, long long> factorization(int x) {
unordered_map<int, long long> factors;
while(x % 2 == 0) {
factors[2]++;
x /= 2;
}
for (int i = 3; i <= sqrt(x); i++) {
while(x % i == 0) {
factors[i]++;
x /= i;
}
}
if (x != 1) factors[x]++;
// for (auto aux : factors) {
// cout << "(" << aux.first << ", " << aux.second << ") ";
// }
// cout << "\n";
return factors;
}
int main() {
cin >> x;
unordered_map<int, long long> factors;
for (int n = 2; n <= x; n++) {
unordered_map<int, long long> currFactors = factorization(n);
for (auto aux : currFactors) {
factors[aux.first] += aux.second;
}
}
long long ans = 1;
for (auto aux : factors) {
ans *= (aux.second + 1LL);
ans %= MOD;
}
cout << ans;
return 0;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int> P;
const int MAX = 120;
int maze[MAX][MAX];
bool come[MAX][MAX];
P s,g;
int W,H,c;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
void init(){
memset(come,false,sizeof(come));
memset(maze,0,sizeof(maze));
}
void input_B(){
int n;
cin >> n;
while(n--){
int c,d,x,y;
cin >> c >> d >> x >> y;
if(d){
for(int i = y; i < y+4; i++)
for(int j = x; j < x+2; j++)
maze[i][j] = c;
}else{
for(int i = y; i < y+2; i++)
for(int j = x; j < x+4; j++)
maze[i][j] = c;
}
}
}
void solve(P p){
if(come[p.second][p.first] == false){
come[p.second][p.first] = true;
for(int i = 0; i < 4; i++)
if(0 < p.first+dx[i] && p.first+dx[i] <= W &&
0 < p.second+dy[i] && p.second+dy[i] <= H &&
maze[p.second+dy[i]][p.first+dx[i]] == c) solve(P(p.first+dx[i],p.second+dy[i]));
}
}
void print(){
for(int i = 1; i < H; i++){
for(int j = 1; j < W; j++)// cout << come[i][j];
cout << maze[i][j];
cout << endl;
}
}
int main(){
while(cin >> W >> H && W+H){
init();
cin >> s.first >> s.second;
cin >> g.first >> g.second;
input_B();
c = maze[s.second][s.first];
solve(s);
//print();
if(come[g.second][g.first] && c) cout << "OK" << endl;
else cout << "NG" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
char ch[] = "ENWS";
int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};
signed main()
{
int N, M;
while(cin >> N, N) {
bool mas[25][25] = {0};
int A, B; char C;
int x, y, cnt = 0; x = y = 10;
Rep(i, N) {
cin >> A >> B; mas[B][A] = true;
}
if(mas[10][10]) mas[10][10] = false, cnt++;
cin >> M;
while(M--) {
cin >> C >> A;
Rep(i, 4) {
if(C == ch[i]) {
Rep(j, A) {
y += my[i], x += mx[i];
if(mas[y][x]) mas[y][x] = false, cnt++;
}
}
}
}
if(cnt == N) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
} | 0 |
///
// File: grl_1_c.cpp
// Author: ymiyamoto
//
// Created on Thu Oct 19 23:14:36 2017
//
#include <cstdint>
#include <iostream>
using namespace std;
#define SIZE 100
#define INF INT32_MAX
static int64_t graph[SIZE][SIZE];
int32_t main()
{
uint32_t V, E;
cin >> V >> E;
for (uint32_t i = 0; i < V; i++) {
for (uint32_t j = 0; j < V; j++) {
if (i == j)
graph[i][j] = 0;
else
graph[i][j] = INF;
}
}
for (uint32_t i = 0; i < E; i++) {
int64_t s, t, d;
cin >> s >> t >> d;
graph[s][t] = d;
}
for (uint32_t k = 0; k < V; k++) {
for (uint32_t i = 0; i < V; i++) {
for (uint32_t j = 0; j < V; j++) {
if (graph[i][k] == INF || graph[k][j] == INF) continue;
if (graph[i][k] + graph[k][j] < graph[i][j]) {
graph[i][j] = graph[i][k] + graph[k][j];
}
}
}
}
for (uint32_t i = 0; i < V; i++) {
if (graph[i][i] < 0) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for (uint32_t i = 0; i < V; i++) {
for (uint32_t j = 0; j < V; j++) {
if (j != 0) cout << " ";
if (graph[i][j] == INT32_MAX) {
cout << "INF";
} else {
cout << graph[i][j];
}
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
map<int, int> m;
multiset<int> v;
for(int i = 0; i < w; i++)
m[i] = i;
for(int i = 0; i < w; i++)
v.insert(0);
for(int i = 0; i < h; i++){
int a, b;
cin >> a >> b;
a--;
auto it = m.lower_bound(a);
int mm = -1;
while(it != m.end() && it->first <= b){
mm = max(mm, it->second);
int x = it->first - it->second;
v.erase(v.find(x));
m.erase(it++);
}
if(mm != -1 && b < w){
v.insert(b - mm);
m[b] = mm;
}
int ans = -1;
if(v.size() > 0)
ans = *v.begin() + (i + 1);
cout << ans << endl;
}
return 0;
} | 0 |
/*
* @Author: Kaizyn
* @Date: 2020-08-29 19:57:44
* @LastEditTime: 2020-08-30 10:24:35
*/
#include <bits/stdc++.h>
// #define DEBUG
using namespace std;
const int N = 2e5+7;
const int INF = 0x3f3f3f3f;
struct SegmentTree {
struct TreeNode {
int l, r, v, lazy;
} tr[N<<2];
void push_down(int i) {
if (!tr[i].lazy) return;
tr[i<<1].lazy = tr[i<<1|1].lazy = tr[i].lazy;
tr[i<<1].v = tr[i<<1].l-tr[i].lazy;
tr[i<<1|1].v = tr[i<<1|1].l-tr[i].lazy;
tr[i].lazy = 0;
}
void build(int l, int r, int i = 1) {
tr[i].l = l; tr[i].r = r;
if (l == r) return;
int mid = (l+r)>>1;
build(l, mid, i<<1);
build(mid+1, r, i<<1|1);
}
void update(int l, int r, int k, int i = 1) {
if (l <= tr[i].l && r >= tr[i].r) {
tr[i].v = tr[i].l-k;
tr[i].lazy = k;
return;
}
push_down(i);
int mid = (tr[i].l+tr[i].r)>>1;
if (l <= mid) update(l, r, k, i<<1);
if (r > mid) update(l, r, k, i<<1|1);
tr[i].v = min(tr[i<<1].v, tr[i<<1|1].v);
}
int query(int x, int i = 1) {
if (tr[i].l == tr[i].r) return tr[i].l-tr[i].v;
push_down(i);
int mid = (tr[i].l+tr[i].r)>>1;
if (x <= mid) return query(x, i<<1);
else return query(x, i<<1|1);
}
};
int n, m;
SegmentTree seg;
signed main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n >> m;
seg.build(1, m);
for (int i = 1, l, r; i <= n; ++i) {
cin >> l >> r;
if (l == 1) seg.update(l, r, -INF);
else seg.update(l, r, seg.query(l-1));
cout << (seg.tr[1].v > m ? -1 : seg.tr[1].v+i) << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
#define int ll
// #define ll int
using namespace std;
const ll INF = 1 << 29;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const int MAX_V = 500;
// const ll mod = 998244353;
const ll MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[8] ={1,0,-1,0,1,-1,1,-1};
ll dy[8] ={0,1,0,-1,1,-1,-1,1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template< class flow_type >
struct Dinic {
const flow_type inf;
struct edge {
int to;
flow_type cap;
int rev;
edge(int to, flow_type cap, int rev) : to(to), cap(cap), rev(rev) {}
};
vector < vector < edge > > graph;
vector < int > level, iter;
Dinic(int V) : inf(numeric_limits< flow_type >::max()/2), graph(V) {}
void add_edge(int from, int to, flow_type cap) {
graph[from].emplace_back(to, cap, (int)graph[to].size());
graph[to].emplace_back(from, 0, (int)graph[from].size() - 1);
}
void bfs(int source) {
level.assign(graph.size(), -1);
queue<int> que;
que.push(source);
level[source] = 0;
while(!que.empty()) {
int v = que.front(); que.pop();
for(int i = 0; i < (int)graph[v].size(); i++) {
edge &e = graph[v][i];
if(e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
flow_type dfs(int v, int sink, flow_type f) {
if(v == sink) return f;
for(int &i = iter[v]; i < (int)graph[v].size(); i++){
edge &e = graph[v][i];
if(e.cap > 0 && level[v] < level[e.to]) {
flow_type d = dfs(e.to, sink, min(e.cap, f));
if (d > 0) {
e.cap -= d;
graph[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
flow_type max_flow(int source, int sink) {
flow_type flow = 0;
while(true) {
bfs(source);
if(level[sink] < 0) return flow;
iter.assign(graph.size(), 0);
flow_type f;
while((f = dfs(source, sink, inf)) > 0) flow += f;
}
}
};
void solve() {
int n;
cin>>n;
Dinic<int> din(n*2+2);
int a[110],b[110],c[110],d[110];
rep(i,n) cin>>a[i]>>b[i];
rep(i,n) cin>>c[i]>>d[i];
rep(i,n) din.add_edge(0,i+1,1);
rep(j,n) din.add_edge(n+j+1,2*n+1,1);
rep(i,n){
rep(j,n){
if(a[i]<c[j]&&b[i]<d[j]){
din.add_edge(i+1,n+j+1,1);
}
}
}
cout<<din.max_flow(0,2*n+1)<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0 |
#include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
std::vector<std::string> split(const std::string &str, char sep)
{
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while( std::getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return v;
}
int Stoi(const std::string &str)
{
int num=0, i=0;
std::string s = str;
while (i<s.size())
{
if (s[i]<'0'||s[i]>'9')
break;
num = num * 10 + (str[i] - '0');
i++;
}
return num;
}
std::string replace(const std::string &str1, int a, int b, const std::string &str2)
{
std::string s1, s2;
s1 = str1; s2 = str2;
s1 = s1.erase(a, b-a+1);
//cout << s1 << endl;
s1 = s1.insert(a, s2);
//cout << s1 << endl;
return s1;
}
int main(){
int a, b, count=1;
long long n;
std::string str, line, doubt, s;
cin >> str;
cin >> n;
std::getline(cin, doubt);
std::vector<std::string> Priope, v;
std::vector<int> num(n);
for (int i = 0; i < n; i++)
{
std::getline(cin, line);
v = split(line, ' ');
a = Stoi(v[1]); b = Stoi(v[2]);
if (v[0] == "print")
{
s = str.substr(a, b-a+1);
Priope.push_back(s);
num.push_back(i);
//cout << s << endl;
}
else if (v[0] == "reverse")
{std::reverse(str.begin()+a, str.begin()+b+1); }//cout << str << endl;}
else if(v[0] == "replace")
str = replace(str, a, b, v[3]);
else
{
cout << "Wrong Command:" << v[0] << endl;
i--;
}
}
/*
for (int i = 0; i < num.size(); i++)
cout << Priope(i) << endl;
*/
std::vector<std::string>::iterator itr;
itr = Priope.begin();
while (itr != Priope.end())
{
cout << *itr << endl;
itr++;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define MN 200005
#define LL long long
#define mp make_pair
#define fir first
#define sec second
#define pii pair<int,int>
inline void chkmax(int &a,int b){if(a<b)a=b;}
inline void chkmin(int &a,int b){if(a>b)a=b;}
inline int read(){
int a=0,fh=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')fh=-1;c=getchar();}
while('0'<=c&&c<='9'){
a=a*10+c-48;
c=getchar();
}
return a*fh;
}
const int py=6005;
int f[6005][16005],n,Mod;
void add(int &a,int b){((a+=b)>=Mod)?(a-=Mod):0;}
int main(){
n=read()*3;Mod=read();
f[0][py]=1;
for(int i=0;i<n;++i){
for(int j=-i;j<=i;++j){
add(f[i+1][j+py+1],f[i][j+py]);
add(f[i+2][j+py-1],(LL)f[i][j+py]*(i+1)%Mod);
add(f[i+3][j+py],(LL)f[i][j+py]*(i+1)*(i+2)%Mod);
}
}
LL ans=0;
for(int i=0;i<=n;++i)ans+=f[n][i+py];
printf("%lld\n",ans%Mod);
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int k, x;
cin >> k >> x;
int l = max(-1000000, x-(k-1));
int r = min(100000, x+(k-1));
for(int i = l; i <= r ; ++i){
cout << i << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int K, X;
cin >> K >> X;
for(int i=X-K+1; i<K+X; ++i){
if(i==K+X-1){
cout << i;
}
else cout << i << " ";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct SCC {
int n;
vector<vector<int>>& G;
vector<vector<int>> G_rev;
vector<int> comp, order;
vector<bool> visited;
SCC(vector<vector<int>>& G) : G(G), n(G.size()) {
comp.resize(n, -1);
visited.resize(n);
G_rev.resize(n);
for (int u = 0; u < n; u++) {
for (int v : G[u]) {
G_rev[v].push_back(u);
}
}
for (int v = 0; v < n; v++) dfs(v);
reverse(order.begin(), order.end());
int c = 0;
for (int v : order) if (comp[v] == -1) rdfs(v, c++);
}
int operator[](int k) {
return comp[k];
}
void dfs(int u) {
if (visited[u]) return;
visited[u] = true;
for (int v : G[u]) dfs(v);
order.push_back(u);
}
void rdfs(int u, int c) {
if (comp[u] != -1) return;
comp[u] = c;
for (int v : G_rev[u]) rdfs(v, c);
}
};
struct UnionFind {
vector<int> par, rank, size;
UnionFind(int n) {
par.resize(n);
for (int i = 0; i < n; i++) par[i] = i;
rank.resize(n);
size.resize(n, 1);
}
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (rank[x] < rank[y]) {
par[x] = y;
size[y] += size[x];
} else {
par[y] = x;
size[x] += size[y];
if (rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int get_size(int x) {
return size[find(x)];
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int V, E;
cin >> V >> E;
vector<vector<int>> G(V);
for (int i = 0; i < E; i++) {
int s, t;
cin >> s >> t;
G[s].push_back(t);
}
SCC scc(G);
UnionFind uf(2 * V);
for (int i = 0; i < V; i++) uf.unite(i, V + scc[i]);
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int u, v;
cin >> u >> v;
cout << (uf.same(u, v) ? 1 : 0) << '\n';
}
}
| #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long long int lli;
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define vc vector<char>
#define vs vector<string>
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
/*-------CONSTANTS------- */
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
const int INF = 1000000000;
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
/*-----------------------------MATH STUFF----------------------------- */
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)));}
int mod_neg(int a, int b, int c){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mulmod(int a, int b, int c){lli res=(lli)a*b;return(res>=c?res%c:res);}
template<typename T>T power_mod(T e, T n, T m){T x=1,p=e;while(n){if(n&1)x=mulmod(x,p,m);p=mulmod(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
//Factorials upto 1e5%MOD,nCr%MOD,nPr%MOD
lli fact[100000+5],fact_modinv[100000+5];
void fact_init(){
fact[0] = 1ll;
fact_modinv[0] = mod_inverse(fact[0],1ll*MOD);
for(int i = 1;i<=100000;i++){
fact[i] = mulmod(fact[i-1],i,1ll*MOD);
fact_modinv[i] = mod_inverse(fact[i],1ll*MOD);
}
}
lli choose(int n,int r){
return mulmod(fact_modinv[n-r],mulmod(fact[n],fact_modinv[r],MOD),MOD);
}
lli P(int n,int r){
return mulmod(fact[n],fact_modinv[n-r],1ll*MOD);
}
/*-----------------------------START----------------------------- */
int n,m;
vector<int> g[10000+5],gr[10000+5];
vector<int> topo;
bool visited1[10000+5],visited2[10000+5];
vector<int> scc[10000+5];
int par[10000+5];
void dfs(int u){
visited1[u] = true;
for(auto x : g[u])
if(!visited1[x])
dfs(x);
topo.push_back(u);
}
void dfs2(int u,int p){
visited2[u] = true;
par[u] = p;
for(auto x : gr[u])
if(!visited2[x])
dfs2(x,p);
}
int main(){
fastio;
cin>>n>>m;
for(int i = 0;i<m;i++){
int u,v;
cin>>u>>v;
g[u].pb(v);
gr[v].pb(u);
}
for(int i = 0;i<n;i++)
if(!visited1[i])
dfs(i);
reverse(topo.begin(),topo.end());
for(auto x : topo)
if(!visited2[x])
dfs2(x,x);
int q;cin>>q;
while(q--){
int u,v;
cin>>u>>v;
cout<<(par[u] == par[v])<<endl;
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int N, Q, tp, a, b, c, d[109][109];
int main() {
while (cin >> N >> Q, N) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i == j) d[i][j] = 0;
else d[i][j] = 999999999;
}
}
while (Q--) {
cin >> tp;
if (tp == 1) {
cin >> a >> b >> c; a--, b--;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int dist2 = d[i][a] + c + d[b][j];
if (d[i][j] > dist2) d[i][j] = dist2;
}
}
swap(a, b);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int dist2 = d[i][a] + c + d[b][j];
if (d[i][j] > dist2) d[i][j] = dist2;
}
}
}
else {
cin >> a >> b; a--, b--;
cout << (d[a][b] != 999999999 ? d[a][b] : -1) << endl;
}
}
}
return 0;
} | #include <cstdio>
#include <utility>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int n, k;
vector<P> way[128];
int query(int a, int b);
int main()
{
while (scanf("%d %d", &n, &k), n != 0){
for (int i = 1; i <= n; i++) way[i].clear();
while (k-- > 0){
int mode;
scanf("%d", &mode);
if (mode == 0){
int a, b;
scanf("%d %d", &a, &b);
int cost = query(a, b);
if (cost == INF) puts("-1");
else printf("%d\n", cost);
}
else {
int c, d, e;
scanf("%d %d %d", &c, &d, &e);
way[c].push_back(P(e, d));
way[d].push_back(P(e, c));
}
}
}
return 0;
}
int query(int a, int b)
{
static int mini[128];
for (int i = 1; i <= n; i++) mini[i] = INF;
priority_queue<P> q;
q.push(P(0, a));
mini[a] = 0;
while (!q.empty()){
P p = q.top(); q.pop();
if (mini[p.second] < p.first) continue;
for (int i = 0; i < way[p.second].size(); i++){
P tmp = way[p.second][i];
if (mini[tmp.second] > mini[p.second] + tmp.first){
mini[tmp.second] = mini[p.second] + tmp.first;
q.push(tmp);
}
}
}
return mini[b];
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
bool f[10] = {};
int num[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++) {
int A;
cin >> A;
f[A] = true;
}
vector<int> dp(N + 1, -1);
dp[0] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j < 10; j++) {
if (!f[j] || i - num[j] < 0 || dp[i - num[j]] == -1) continue;
dp[i] = max(dp[i], dp[i - num[j]] + 1);
}
}
for (int i = N; i > 0;) {
for (int j = 9; j >= 1; j--) {
if (f[j] && i - num[j] >= 0 && dp[i] == dp[i - num[j]] + 1) {
cout << j;
i -= num[j];
break;
}
}
}
} | #include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=105;
int n,m,a[maxn],b[maxn];
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch=nc();
while(ch<='9'&&ch>='0') ret=ret*10+ch-'0',ch=nc();
return f?-ret:ret;
}
int main(){
n=read(),m=read();
for (int i=1;i<=m;i++) a[i]=read();
for (int i=2;i<=m;i++)
if(a[i]&1) swap(a[i],a[1]);
for (int i=m-1;i>1;i--)
if(a[i]&1) swap(a[i],a[m]);
for (int i=2;i<m;i++)
if(a[i]&1) return puts("Impossible")&0;
for (int i=1;i<=m;i++)
printf("%d",a[i]),putchar(i==m?'\n':' ');
if(a[1]>1) b[++b[0]]=a[1]-1;
for (int i=2;i<m;i++) b[++b[0]]=a[i];
if(m>1){
b[++b[0]]=2;
if(a[m]>1) b[++b[0]]=a[m]-1;
}else b[++b[0]]=1;
for (int i=0;i<=b[0];i++)
printf("%d",b[i]),putchar(!i||i==b[0]?'\n':' ');
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using vecll = vector<ll>;
using boost::irange;
int main()
{
int n,t;
cin>>n>>t;
vector<vecint> dp(n+1, vecint(t+3001, 0));
vector<tuple<int,int>> vt;
for(int i:irange(0,n)) {
int a,b;
cin>>a>>b;
vt.emplace_back(a,b);
}
boost::sort(vt);
for(int i:irange(0,n)) {
int a,b;
tie(a,b) = vt[i];
for(int j:irange(0,t+3001)) {
dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
if (j < t) {
dp[i+1][j+a] = max(dp[i+1][j+a], dp[i][j] + b);
}
}
}
cout<<*boost::max_element(dp[n])<<endl;
return 0;
}
| #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
// 多倍長
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int dp[3100][3100];
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n,t;
cin >> n >> t;
vector<pint> p(n);
rep(i, n){
cin >> p[i].fs >> p[i].sc;
}
sort(all(p));
int ans = 0;
rep(i, n){
rep(j, t){
chmax(dp[i + 1][j], dp[i][j]);
if(j < p[i].fs) continue;
chmax(dp[i + 1][j], dp[i][j - p[i].fs] + p[i].sc);
}
int now = dp[i][t - 1] + p[i].sc;
chmax(ans, now);
}
print(ans);
}
| 1 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
void binary(int &l, int &r, v_int & v, int u)
{
while(r-l>1) {
int mid = (r+l)/2;
if(v[mid] > u) {
r = mid;
} else {
l = mid;
}
}
}
void binary2(int &l, int &r, v_int & v, int u)
{
while(r-l>1) {
int mid = (r+l)/2;
if(v[mid] >= u) {
r = mid;
} else {
l = mid;
}
}
}
int main(void)
{
int n;
cin >> n;
v_int a(n), b(n), c(n);
cin >> a >> b >> c;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
sort(c.begin(), c.end());
ll ans = 0;
irep(i, n) {
int la = -1, ra = n;
binary2(la, ra, a, b[i]);
if(la == -1) { continue; }
int lc = -1, rc = n;
binary(lc, rc, c, b[i]);
if(rc == n) { continue; }
ans += (ll)(la+1) * (n-rc);
}
cout << ans << endl;
return 0;
}
/*atcoder*/
| // https://atcoder.jp/contests/abc077/tasks/arc084_a
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N), B(N), C(N);
REP(i, N) cin >> A[i];
REP(i, N) cin >> B[i];
REP(i, N) cin >> C[i];
sort(ALL(A));
sort(ALL(B));
sort(ALL(C));
int ans = 0;
for (auto &x : B) {
// 配列Aからxより小さい値を探す
auto ia = lower_bound(ALL(A), x);
int a = ia - A.begin();
// 配列Cからxより大きい値を探す
auto ic = lower_bound(ALL(C), x + 1);
int c = C.end() - ic;
ans += a * c;
}
cout << ans << endl;
return 0;
}
| 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+7;
int main(){
ll x,y;
cin >> x >> y;
if(x<=y){
if(x<0 && y>0 && abs(y)>=abs(x)){
cout << 1+y+x << endl;
}
else if(x<0 && y>0 && abs(y)<abs(x)){
cout << 1-y-x << endl;
}
else{
cout << y-x << endl;
}
}
else{
if(x>0 && y>=0){
cout << min(1LL+x+y,2LL+x-y) << endl;
}
else if(x>0 && y<0 && abs(x)>=abs(y)){
cout << 1+x+y << endl;
}
else if(x>0 && y<0 && abs(x)<abs(y)){
cout << 1-x-y << endl;
}
else if(x==0){
cout << 1-y << endl;
}
else{
cout << 2+x-y << endl;
}
}
return 0;
} | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
// cin>>t;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
cin>>i>>j;
cout<<i*j<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y,z;
cin>>a>>b;
x=a+b;
y=a-b;
z=a*b;
if(x>=y && x>=z)
{
cout<<x<<endl;
}
else if(y>=x && y>=z)
{
cout<<y<<endl;
}
else
{
cout<<z<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
int x=a+b,y=a-b,z=a*b;
int A=max(x,max(y,z));
cout<<A<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define maxn 100005
#define ld long double
ll fastpower (ll b , ll p){
ll k= p%2 ? b : 1 ;
return p==0 ? 1 : k*(fastpower(b*b,p/2));
}
ld dp[305][305][305];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
ll cnt[4]={0,0,0,0};
ll x;
for(int i=0;i<n;i++){
cin>>x;
cnt[x]++;
}
dp[0][0][0]=0;
for(ll three=0;three<=n;three++){
for(ll two=0;two<=n;two++){
for(ll one=0;one<=n;one++){
ld i=three,j=two,k=one;
ll zero=n-two-three-one;
ld zero1=zero,n1=n;
if(zero<0 || zero==n) continue;
ld value=1.0;
if(three>0) value+=(i/n1)*dp[three-1][two+1][one];
if(two>0) value+=(j/n1)*dp[three][two-1][one+1];
if(one>0) value+=(k/n1)*dp[three][two][one-1];
//dp[three][two][one]=(value)/(1-1.0*zero/n);
dp[three][two][one]=(value*n1)/(i+j+k);
}
}
}
ld ans=dp[cnt[3]][cnt[2]][cnt[1]];
cout.precision(20);
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */
/* main */
int main(){
int len;
cin >> len;
string s, t;
cin >> s >> t;
int slen = s.size(), tlen = t.size();
for (; len > 0; len--) {
int si = slen - len;
int ti = 0;
if (s.substr(si, len) == t.substr(ti, len)) {
break;
}
}
cout << s.size() * 2 - len << '\n';
} | 0 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll t;
cin >> t;
if(t < 1200)
cout << "ABC";
else if(t < 2800)
cout << "ARC";
else
cout << "AGC";
return 0;
} | #include <iostream>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main(){
int n,m;
cin >> n;
int r1,r2,r3;
for(int i=0; i<999;i++){
m = n;
r1 = (n%10);
n-=r1;
n/=10;
r2 = (n%10);
n-=r2;
n/=10;
r3 = (n%10);
n-=r2;
if( r1 == r2 && r1 == r3){
break;
}
m++;
n=m;
}
cout << r1 << r2 << r3 << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s ;
cin >> s ;
int n ;
cin >> n ;
double t=s.size();
string a ;
for(int i=0 ; i<(t/n) ; i++ ){
a+=s.at(0+i*n);
}
cout << a << endl;
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
typedef long long ll;
void solve() {
string s;
int w;
cin >> s;
cin >> w;
REP(i,s.size()) if(i%w == 0) cout << s[i];
cout << endl;
}
int main() {
solve();
return 0;
}
| 1 |
#include<iostream>
using namespace std;
bool search(int);
int q,T[500];
int main(){
int n,S[10000],counter=0;
cin >>n;
for(int i=0 ; i < n ; i++)cin >>S[i];
cin >>q;
for(int i=0 ; i < q ; i++)cin >>T[i];
for(int i=0 ; i < n ; i++)counter+=search(S[i]);
cout <<counter<<endl;
return 0;
}
bool search(int s){
for(int i=0 ; i < q ; i++){
if( s == T[i] ){
T[i]=-1;
return 1;
}
}
return 0;
} | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef map<int, int> mpii;
typedef set<int> seti;
const int mxN = 2e5, iinf = 1e9 + 10, inf = 1e18 + iinf + 10, mod = 1000000007;
const ld pi = 4.0 * atanl(1.0), prec = .000001;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(c) c.begin(), c.end()
#define rall(c) c.end(), c.begin()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
int n, m, t, a[mxN];
void fast() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
int main() {
fast();
cin >> n >> m;
string s;
cin >> s;
if (s.size() < n + m + 1) {
cout << "No";
return 0;
}
if (s[n] != '-') {
cout << "No";
return 0;
}
for (int i = 0; i < s.size(); ++i) {
if (i != n) {
if (!isdigit(s[i])) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for(int i = 0; i < A; i++) {
cin >> a.at(i);
}
for(int i = 0; i < B; i++) {
cin >> b.at(i);
}
int ans = 200000;
for(int i = 0; i < M; i++) {
int x, y, c;
cin >> x >> y >> c;
if(a.at(x - 1) + b.at(y - 1) - c < ans) {
ans = a.at(x - 1) + b.at(y - 1) - c;
}
if(i == M - 1) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if(a.at(0) + b.at(0) < ans) {
ans = a.at(0) + b.at(0);
}
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define N 1001000
#define inf INT_MAX
inline int read()
{
int s=0,w=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){s=s*10+ch-'0';ch=getchar();}
return s*w;
}
int n;
char a[N],b[N];
int pos[N],Ans,cnt,ans[N];
bool Chtholly=true;
int main()
{
//freopen("game.in","r",stdin);
//freopen("game.out","w",stdout);
n=read();
scanf("%s%s",a+1,b+1);
int len=1;
//while(a[len]==b[len])
//for(int i=1;i<=n+10;i++) cout<<a[i]<<endl;
while(a[len]==b[len]&&len<=n) len++;
if(len==n+1) return puts("0"),0;
int front=n+1,rear=n;
int k=n+1;
while(n)
{
int j=n;
while(b[j-1]==b[n]&&j>=1) j--;
k=min(k,j);
while(a[k]!=b[n]&&k>=1) k--;
if(!k) {Chtholly=false;break;}
while(front<=rear&&pos[rear]-cnt>n) rear--;
cnt++;
front--;
pos[front]=k+cnt;
ans[front]=cnt;
Ans=max(Ans,cnt-ans[rear]+1);
n=j-1;
}
if(!Chtholly) {puts("-1");return 0;}
printf("%d\n",Ans);
return 0;
}
| 0 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(ll i=0;i<n;++i)
#define repinvi(i,n) for(int i=n-1;i>=0;--i)
#define sll(n) scanf("%lld", &n);
#define sii(n) scanf("%d", &n);
#define slf(n) scanf("%lf", &n);
#define pll pair<ll,ll>
#define pii pair<int,int>
#define psi pair<si,si>
typedef long long ll;
typedef double lf;
typedef short int si;
void Main(){
ll N, l;
sll(N);
// vector<ll> ls(N, 0);
map<ll, ll> counter;
rep(i, N){
sll(l);
counter[l] ++;
}
ll ans = 0;
for(auto p1:counter){
for(auto p2:counter){
if(p1.first >= p2.first){
continue;
}
for(auto p3:counter){
if(p1.first >= p3.first){
continue;
}else if(p2.first >= p3.first){
continue;
}
if(p3.first >= p1.first + p2.first){
continue;
}
ans += (p1.second * p2.second * p3.second);
}
}
}
cout << ans <<endl;
}
int main(){
Main();
} | #include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
int N;
cin>>N;
vector<int>A(N);
rep(i,N)cin>>A[i];
sort(A.begin(),A.end());
int ans=0;
rep(i,N){
rep(j,i){
rep(k,j){
if(A[i]!=A[j]&&A[j]!=A[k]&&A[i]<A[j]+A[k])ans++;
}
}
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
nsum = (nsum + x) % MOD;
}
ll msum = 0, mans = 0;
for (int i = 0; i < M; i++)
{
ll x;
cin >> x;
mans += (x * i - msum);
mans %= MOD;
msum = (msum + x) % MOD;
}
cout << (nans * mans) % MOD << "\n";
} | #include <bits/stdc++.h>
using namespace std;
inline bool isLeapYear(int year) {
return year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
}
inline int countLeapYear(int year) {
return year / 4 - year / 100 + year / 400;
}
inline int getMaxDay(int year, int month) {
const int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if (month == 2) return isLeapYear(year) ? 29 : 28;
return days[month];
}
struct Day {
int year, month, day;
enum {SUN, MON, TUE, WED, THU, FRI, SAT};
Day() : year(0), month(0), day(0) {}
Day(int year, int month, int day) : year(year), month(month), day(day) {}
int fairfield() const {
int y = year, m = month;
if (m <= 2) --y, m += 12;
return 365 * y + countLeapYear(y) + (153 * (m + 1) / 5) + day - 428;
}
int operator-(const Day& day) const {
return fairfield() - day.fairfield();
}
bool operator<(const Day& day) const {
if (year != day.year) return year < day.year;
if (month != day.month) return month < day.month;
return this->day < day.day;
}
Day operator++() {
++day;
if (getMaxDay(year, month) < day) {
++month;
day = 1;
if (month == 13) {
++year;
month = 1;
}
}
return *this;
}
int dayOfTheWeek() {
return fairfield() % 7;
}
};
bool solve() {
int m, d;
cin >> m >> d;
if (m == 0 && d == 0) return false;
Day day(2004, m, d);
string week[]{"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
cout << week[day.dayOfTheWeek()] << endl;
return true;
}
int main() {
while (solve());
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
#include<cmath>
typedef long long int ll;
#define VI vector<int>
#define rep(i,a) for(int i=0;i<(a);i++)
int n,m;
using namespace std;
int main(){
while(1){
int num[10]={};
int a=0;
cin>>a;
if(a==0)break;
for(int cou=0;cou<a;cou++){
int n;
cin>>n;
num[n]++;
}
rep(i,10){
if(num[i]==0)cout<<"-"<<endl;
else{
rep(j,num[i])cout<<"*";
cout<<endl;
}
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while (getline(cin, s))
{
string dec = s;
while (true)
{
if (dec.find("the") != -1 || dec.find("this") != -1 || dec.find("that") != -1)
{
cout << dec << endl;
break;
}
for (int i = 0; i < dec.size(); i++)
{
if ('a' <= dec[i] && dec[i] < 'z') dec[i]++;
else if (dec[i] == 'z') dec[i] = 'a';
}
}
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
using D = pair<double, double>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define repn(i, a, b) for(int i = (a); i < (b); ++i)
#define Rep(i, n) for (int i = (n); i >= 0; --i)
#define All(vec) vec.begin(), vec.end()
#define cend printf("\n")
//constexpr lint mod = 998'244'353LL;
constexpr lint mod = 1000'000'007LL;
constexpr lint inf = 3LL * mod * mod;
const double Pi = 2.0 * acos(0.0);
template<class T> using prique = priority_queue<T>;
template<class T> using prique_inv = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& rhs) { return is >> rhs.first >> rhs.second; }
template<class T, class U>inline ostream& operator<<(ostream& os, const pair<T, U>& rhs) { return os << rhs.first << " " << rhs.second << "\n"; }
template<class InputIterator> void arrin(InputIterator first, InputIterator last) { for (; first != last; ++first) cin >> (*first); }
template<class InputIterator> void arrout(InputIterator first, InputIterator last) {
for (; first != last; ++first) {
cout << (*first) << " ";
}
cout << "\n";
}
constexpr bool pri(lint x) { for (lint i = 2; i * i <= x; ++i) if (x % i == 0) return false; return 1 < x; }
inline double dis(D a, D b) { return hypot(a.first - b.first, a.second - b.second); }
lint fact[3000000];
void fact_init(lint n) {
if (3000000 <= n) return;
fact[0] = fact[1] = 1;
for (lint i = 2; i <= n; ++i) {
fact[i] = i * fact[i - 1];
if (mod <= fact[i]) fact[i] %= mod;
}
}
lint modpow(lint x, lint n, lint m = mod) {
lint res = 1;
while (n > 0) {
if (n & 1) {
res *= x;
if (m <= res) res %= m;
}
x *= x;
if (m <= x) x %= m;
n >>= 1;
}
return res;
}
lint intpow(lint x, lint n) {
lint res = 1;
while (n > 0) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
lint comb(lint n, lint r) {
if (r == 0 || r == n) return 1;
lint res = fact[n] * modpow(fact[n - r], mod - 2) % mod * modpow(fact[r], mod - 2) % mod;
return res < 0 ? res + mod : res;
}
map<lint, lint> factring(lint n) {
map<lint, lint> res;
for (lint i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++res[i];
}
}
if (n != 1) ++res[n];
return res;
}
int n, k;
bool f(vector<int>& a) {
vector<int>b(n + 1);
rep(i, n) {
b[max(0, i - a[i])]++;
b[min(n, i + a[i] + 1)]--;
}
rep(i, n) {
b[i + 1] += b[i];
}
bool res = true;
rep(i, n) {
a[i] = b[i];
res &= (a[i] == n);
}
return res;
}
int main() {
cin >> n >> k;
vector<int>a(n);
rep(i, n) {
cin >> a[i];
}
rep(i, k) {
if (f(a)) break;
}
for (int e : a) cout << e << " ";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, k) {
vector<ll> b(n + 1, 0);
rep(j, n) {
ll l = max(0LL, j - a[j]);
ll r = min(n, j + a[j] + 1);
b[l]++;
b[r]--;
}
ll cnt = 0;
rep(j, n) {
b[j + 1] += b[j];
a[j] = b[j];
if (a[j] == n) cnt++;
}
if (cnt == n) break;
}
rep(i, n) printf("%lld%s", a[i], (i == (n - 1)) ? "\n" : " ");
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int LLI;
int main()
{
int a, b, ans = 0;
cin >> a >> b;
int arr[a];
for(int i = 0; i < a; i++)
cin >> arr[i];
sort(arr,arr+a);
for(int i = a - b; i < a; i++)
ans += arr[i];
cout << ans;
} | #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 <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
int main(){
int H,W,K;
cin>>H>>W>>K;
ll mod=1e9+7;
ll dp[H+1][W]={};
dp[0][0]=1;
ll L[W]={};
ll M[W]={};
ll R[W]={};
if(W>1) rep(i,(1<<(W-1))){
int F=1;
rep(j,W-2) if((i&(1<<j))&&(i&(1<<(j+1)))) F=0;
if(F) rep(j,W-1){
if(i&(1<<j)){
R[j]++;
L[j+1]++;
}
}
if(F) rep(j,W){
if(j==0){
if((i&(1<<j))==0) M[j]++;
}else if(j==W-1){
if((i&(1<<(j-1)))==0) M[j]++;
}else{
if((i&(1<<(j-1)))==0&&(i&(1<<j))==0) M[j]++;
}
}
}
rep(i,H){
rep(j,W){
if(j==0) dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j+1]*R[j])%mod;
else if(j==W-1) dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j-1]*L[j])%mod;
else dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j+1]*R[j]+dp[i][j-1]*L[j])%mod;
}
}
if(W==1) cout<<1<<endl;
else cout<<dp[H][K-1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
const int MAX = 510000;
const ll MOD = 998244353;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll binarypow(ll a, ll n, ll mod) {
ll res = 1;
while(n > 0) {
if(n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll n, m, k; cin >> n >> m >> k;
COMinit();
ll ans = 0;
rep(i, k+1) ans += COM(n-1, i) * m % MOD * binarypow(m-1, n-i-1, MOD) % MOD;
cout << ans % MOD << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string temp;
string A[N];
cout<<0<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<0<<endl;
return 0;
}
if(temp=="Male"){
A[0]="Male";
}
if(temp=="Female"){
A[0]="Female";
}
cout<<N-1<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<N-1<<endl;
return 0;
}
if(temp=="Male"){
A[N-1]="Male";
}
if(temp=="Female"){
A[N-1]="Female";
}
int l=N-1;
int r=0;
int k=22;
while(k){
k--;
int m=(l+r)/2;
cout<<m<<endl;
cin>>temp;
if(temp=="Vacant"){
cout<<m<<endl;
return 0;
}
if(temp=="Male"){
A[m]="Male";
}
if(temp=="Female"){
A[m]="Female";
}
if((l-m)%2 == 0 && A[l] == A[m]){
l=m;
continue;
}
if((l-m)%2 == 0 && A[l] != A[m]){
r=m;
continue;
}
if((l-m)%2 == 1 && A[l] == A[m]){
r=m;
continue;
}
if((l-m)%2 == 1 && A[l] != A[m]){
l=m;
continue;
}
}
cout<<3<<endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
int main(){
int n ; cin>>n ;
cout<< 0 <<endl ;
string s ; cin >>s ;
if(s=="Vacant") return 0 ;
int l =0 ; int r= n ;
while(1){
int m = (r+l) /2 ;
cout<< m<< endl ;
string ss ;cin>>ss ;
if(ss=="Vacant" ) break ;
bool ok= (s==ss) ;
int a = m%2 ;
if(ok==a) r=m ;
else l= m+1 ;
}
return 0 ;
}
| 1 |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
bool sol(vector<int>d1,vector<int>d2){
for(int i=0;i<4;i++){
int tmp1=d1[0];
d1[0]=d1[2], d1[2]=d1[5], d1[5]=d1[3], d1[3]=tmp1;
for(int j=0;j<4;j++){
int tmp2=d1[0];
d1[0]=d1[1], d1[1]=d1[5], d1[5]=d1[4], d1[4]=tmp2;
for(int k=0;k<4;k++){
int tmp3=d1[1];
d1[1]=d1[2], d1[2]=d1[4], d1[4]=d1[3], d1[3]=tmp3;
if(equal(d1.cbegin(),d1.cend(),d2.cbegin())){
printf("No\n");
return false;
}
}
}
}
return true;
}
int main(){
int n;
scanf("%d",&n);
vector<vector<int>> d(n,vector<int>(6));
for(int i=0;i<n;i++){
for(auto&e:d[i]){
scanf("%d",&e);
}
}
bool flag;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
flag=sol(d[i],d[j]);
if(flag==false) return 0;;
}
}
printf("Yes\n");
return 0;
} | // ABC 080 B- Harshed Number
/*
各桁の和ってどうプログラムすればええんだ
あ、10で割り続けて、商と余りを考えればいいんだ
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0 ;
cin >> N;
int N2 = N;
while (N != 0) { // Nが0になるまで割り続ける。
sum += N % 10; // 総和を更新して
N /= 10; // Nを更新 N = N / 10 → N /= 10
}
if (N2 % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0 |
#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>
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<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
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; }
const ll mod = 998244353;
const int N = 2500010;
ll fact[N], invf[N];
ll add(ll x, ll y){
return (x+y)%mod;
}
ll mul(ll x, ll y){
return (x%mod)*(y%mod)%mod;
}
ll powll(ll x, ll y){
x %= mod;
ll res = 1LL;
while(y){
if (y & 1LL)
res *= x;
res %= mod;
x = (x*x) % mod;
y >>= 1LL;
}
return res;
}
ll divll(ll x, ll y){
return (x * powll(y,mod-2)) % mod;
}
ll nPr(ll n, ll r){
if (n < r || r < 0) return 0;
return mul(fact[n], invf[n-r]);
}
ll nCr(ll n, ll r){
if (n < r || r < 0) return 0;
return mul(mul(fact[n], invf[r]), invf[n-r]);
}
int main() {
ll n, m;
cin >> n >> m;
fact[0] = invf[0] = 1;
FOR(i,1,N-1){
fact[i] = (fact[i-1] * i) % mod;
}
invf[N - 1] = divll(1, fact[N - 1]);
FORR(i,N-1,1){
invf[i - 1] = (invf[i] * i) % mod;
}
ll ans = 0;
REP(x,m+1){
if ((3 * m - x) % 2) continue;
ll tmp = (nCr(n, x) * nCr(n + (3 * m - x) / 2 - 1, n - 1)) % mod;
ans = (ans + tmp) % mod;
}
REP(i,m){
ll tmp = (n * nCr(n + i - 2, n - 2)) % mod;
ans = (ans - tmp + mod) % mod;
}
cout << ans << endl;
return 0;
}
| /**
* created: 27.06.2020 19:04:28
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b; return 1;} return 0;}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a % b == 0) cout << 0 << endl;
else cout << 1 << endl;
return 0;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <set>
#include <functional>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <stack>
#define MX 1000005
#define INF 1000000005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
struct UF
{
int par[MX],rank[MX];
void init(int n)
{
for(int i=0;i<n;i++)
{
par[i]=i;
rank[i]=0;
}
}
void rem(int i)
{
par[i]=i;
rank[i]=0;
}
int find(int x)
{
if(x==par[x]) return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)
{
x=find(x);
y=find(y);
if(x==y) return;
if(rank[x]<rank[y])
{
par[x]=y;
}
else
{
par[y]=x;
if(rank[x]==rank[y]) rank[x]++;
}
}
bool same(int x,int y)
{
return find(x)==find(y);
}
};
UF uf;
vector <int> vec[MX];
vector <P> query[MX];
int id[MX];
bool use[MX];
int dp[MX];
int main()
{
int n,m;
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++)
{
int p,q,c;
scanf("%d %d %d",&p,&q,&c);p--,q--,c--;
query[c].push_back(P(p,q));
}
int sz=n;
for(int i=0;i<MX;i++)
{
if(query[i].empty()) continue;
for(int j=0;j<query[i].size();j++)
{
P p=query[i][j];
uf.rem(p.first);
uf.rem(p.second);
id[p.first]=id[p.second]=-1;
use[p.first]=use[p.second]=false;
}
for(int j=0;j<query[i].size();j++)
{
P p=query[i][j];
uf.unite(p.first,p.second);
}
for(int j=0;j<query[i].size();j++)
{
P p=query[i][j];
if(!use[p.first])
{
use[p.first]=true;
int r=uf.find(p.first);
if(id[r]==-1) id[r]=sz++;
//printf("%d %d: %d\n",r,id[r],p.first);
vec[p.first].push_back(id[r]);
vec[id[r]].push_back(p.first);
}
if(!use[p.second])
{
use[p.second]=true;
int r=uf.find(p.second);
if(id[r]==-1) id[r]=sz++;
//printf("%d %d: %d\n",r,id[r],p.second);
vec[p.second].push_back(id[r]);
vec[id[r]].push_back(p.second);
}
}
}
queue <int> que;
que.push(0);
memset(dp,-1,sizeof(dp));
dp[0]=0;
while(!que.empty())
{
int v=que.front();que.pop();
for(int i=0;i<vec[v].size();i++)
{
int to=vec[v][i];
if(dp[to]==-1)
{
dp[to]=dp[v]+1;
que.push(to);
}
}
}
if(dp[n-1]==-1) puts("-1");
else printf("%d\n",dp[n-1]/2);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5+5;
int N,M,K,Cnt0,Cnt1;
int Fa[MaxN],Size[MaxN],Col[MaxN];
vector<int> To[MaxN];
int Get_Fa(int x){
return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}
bool Check(int u){
int i,v;
for(i=0;i<To[u].size();i++)
if(!Col[v=To[u][i]]){
Col[v]=3-Col[u];
if(!Check(v))
return false;
}
else if(Col[u]==Col[v])
return false;
return true;
}
int main(){
int i,u,v,r1,r2;
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++)
Fa[i]=i,Size[i]=1;
while(M--){
scanf("%d%d",&u,&v);
To[u].push_back(v);
To[v].push_back(u);
if((r1=Get_Fa(u))^(r2=Get_Fa(v)))
Fa[r1]=r2,Size[r2]+=Size[r1];
}
for(i=1;i<=N;i++)
if(i==Get_Fa(i)){
if(Size[i]<2)
K++;
else{
Col[i]=1;
Check(i)?Cnt0++:Cnt1++;
}
}
printf("%lld\n",2ll*K*N-1ll*K*K+2ll*Cnt0*Cnt0+1ll*Cnt1*Cnt1+2ll*Cnt0*Cnt1);
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M, N || M) {
vector<int> P;
vector<int> v;
for(int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
P.push_back(tmp);
}
P.push_back(0);
for(int i = 0; i < P.size(); i++) {
for(int j = 0; j < P.size(); j++) {
v.push_back(P[i]+P[j]);
}
}
sort(v.begin(), v.end());
int j = v.size() - 1;
int res = 0;
for(int i = 0; i < v.size(); i++) {
while(v[i]+v[j] > M && j >= 0)
j--;
if(j >= 0)
res = max(res, v[i] + v[j]);
}
cout << res << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax, m){
vector<int> p(m);
rep(i, m) cin >> p[i];
int ans = 0;
int maxi = 0;
REP(i, nmin-1, nmax){
if(maxi <= p[i] - p[i+1]){
maxi = p[i] - p[i+1];
ans = i + 1;
}
}
cout << ans << endl;
}
return 0;
} | 0 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#define INF 100000000000000
using namespace std;
typedef long long llong;
//int isalpha(char ch): ch がアルファベットなら true を返す
//int isdigit(char ch): ch が数字なら true を返す
//int islower(char ch): ch が小文字なら true を返す
//int isupper(char ch): ch が大文字なら true を返す
//int tolower(char ch): ch の小文字を返す
//int toupper(char ch): ch の大文字を返す
//string型
//size() 文字数を返す
//insert() （指定した場所に）文字・文字列を挿入する
//erase() （指定した場所の）文字・文字列を削除する
//clear() すべての文字を削除する
//substr() 文字列の（指定した）部分文字列を返す
//replace() （指定した）部分文字列を新しい文字列に置換する
//文字列の比較は、<=や==などを使え
//replace関数を使い、簡単に文字列を置換
//リバース関数：reverse(str.begin(), str.end());
//map<type, type> dict;で宣言
//グラフ理論用変数
//vector<vector<llong> > graph(N);
//ソート
//降順sort(v.begin(), v.end(), std::greater<Type>());
//大文字から小文字へんかん
//w[i] = w[i]-'A'+'a';
bool isprime(llong num){
if(num==1){
return false;
}
if(num==2){
return true;
}
for(int i=2; i<=sqrt(num); i++){
if(num%i==0){
return false;
}
}
return true;
}
//約数列挙
void EnumerateFactor(vector<vector<llong> > &factor_list, llong num){
llong cnt=0;
for(int i=1; i<=sqrt(num); i++){
if(num%i==0){
factor_list[cnt].push_back(i);
factor_list[cnt].push_back(num/i);
cnt++;
}
}
}
int main(){
llong n;
llong ans=INF;
llong temp=-1*INF;
vector<vector<llong> > factor_list(100000);
string A, B;
scanf("%lld", &n);
EnumerateFactor(factor_list, n);
for(int i=0; i<factor_list.size(); i++){
if(factor_list[i].size()==0){
break;
}
A = to_string(factor_list[i][0]);
B = to_string(factor_list[i][1]);
temp = max(A.size(), B.size());
ans = min(temp, ans);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t m,j,l,q=0;
cin>>m;
for(j=1;j*j<=m;j++){
if(m%j==0) l=m/j;
}
while(l>0){
q++;
l/=10;
}
cout<<q<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int a[4];
string key = "0123456789";
for (int i = 0; i < 4; i ++) {
char c;
cin >> c;
for (int j = 0; j < 10; j ++) {
if (c == key[j]) a[i] = j;
}
}
//4桁の数字を1桁ずつに分解
for (int i = 0; i < 1 << 3; i ++) {
int i_ = i;
char c[3];
int as_ = a[0];//数字に対応した数式の結果
for (int j = 0; j < 3; j ++) {
if (i_ % 2) { //i_ % 2 != 0と同値
c[j] = '+';
as_ += a[j + 1];
}
else {
c[j] = '-';
as_ -= a[j + 1];
}
i_ /= 2;
}
if (as_ == 7) {
for (int j = 0; j < 3; j ++) cout << a[j] << c[j];
cout << a[3] << "=7" << endl;
return 0;//強制終了
}
}
}
| #include<bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
//using namespace atcoder;
const ll mod=1000000007;//998244353;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
string s;
cin >> s;
ll a=s[0]-'0',b=s[1]-'0',c=s[2]-'0',d=s[3]-'0';
for(ll i=-1;i<2;i+=2){
for(ll j=-1;j<2;j+=2){
for(ll k=-1;k<2;k+=2){
if(a+b*i+c*j+d*k==7){
string t;
t=to_string(a);
char e;
if(i<0)e='-';
else e='+';
t+=e;
t+=to_string(b);
if(j<0)e='-';
else e='+';
t+=e;
t+=to_string(c);
if(k<0)e='-';
else e='+';
t+=e;
t+=to_string(d);
t+="=7";
cout << t << endl;
return 0;
}
}
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll, ll> pll;
int main()
{
ll t, i, j, k, ans, n;
//cin>>t;
t = 1;
while (t--)
{
int a,b,c;
cin>>a>>b>>c;
set<ll> s;
s.insert(a);s.insert(b);s.insert(c);
if(s.sz==2)cout<<"Yes";
else cout<<"No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int a,b,c;cin>>a>>b>>c;
bool flag=false;
if(a==b){
if(a!=c){
flag=true;
}
}else if(a==c){
flag=true;
}else{
if(b==c){
flag=true;
}
}
if(flag){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | 1 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
// ===============================================================
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
// ===============================================================
ll gcd(ll a, ll b) //最大公約数
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
ll lcm(ll a, ll b) //最小公倍数
{
return a * b / gcd(a, b);
}
ll box(double a) //doubleの切り捨て
{
ll b = a;
return b;
}
ll fff(double a) //doubleの四捨五入
{
ll b = a + 0.5;
return b;
}
ll sum(ll n) { //整数sまでの合計
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
bool prime(ll num)//素数判定、primeならtrue,違うならfalse
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
// 素数である
return true;
}
// ===============================================================
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a == b && a != c) {
cout << "Yes" << endl;
}
else {
if (a == c && a != b) {
cout << "Yes" << endl;
}
else {
if (b == c && a != b) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
}
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,k;
cin >> n >> k;
cout << (n%k==0?0:1) << endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int a[1010], b[1010];
map<int, int> mpa, mpb;
int main(){
int n, m;
cin >> n >> m;
rep(i, n){
cin >> a[i];
mpa[a[i]]++;
}
rep(i, m){
cin >> b[i];
mpb[b[i]]++;
}
if (mpa.size() != n || mpb.size() != m || (!mpa[m*n] || !mpb[m*n])) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
ll cnta = 0, cntb = 0;
for(ll num = n*m; num > 0; num--){
if (mpa[num] && mpb[num]) {
cnta++;
cntb++;
}
else if (mpa[num] && !mpb[num]){
ans *= cntb;
cnta++;
ans %= MOD;
}
else if (!mpa[num] && mpb[num]){
ans *= cnta;
ans %= MOD;
cntb++;
}
else {
ans *= max(cnta * cntb - (n*m-num), (ll)0);
ans %= MOD;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define RREP(i,n) for (int i=(n)-1;i>=0;--i)
#define MOD 1000000007
using namespace std;
using ll = long long;
ll solve() {
int H, W;
cin >> H >> W;
vector<int> A(H), B(W);
set<int> As, Bs;
REP(i, H) {
cin >> A[i];
--A[i];
As.insert(A[i]);
}
REP(i, W) {
cin >> B[i];
--B[i];
Bs.insert(B[i]);
}
if (As.size() < H || Bs.size() < W) {
return 0;
}
int n_used_rows = 0;
int n_used_cols = 0;
ll result = 1;
RREP(x, H * W) {
int n_filled = H * W - 1 - x;
bool inA = As.count(x) > 0;
bool inB = Bs.count(x) > 0;
int n_ways;
if (inA && inB) {
n_ways = 1;
++n_used_rows;
++n_used_cols;
} else if (inA && !inB) {
n_ways = n_used_cols;
++n_used_rows;
} else if (!inA && inB) {
n_ways = n_used_rows;
++n_used_cols;
} else {
n_ways = n_used_rows * n_used_cols - n_filled;
if (n_ways <= 0) return 0;
}
result = (result * n_ways) % MOD;
}
return result;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <algorithm>
#define MAX 30
using namespace std;
string S;
int main(){
while (1) {
int p;
cin >> p;
if (p!=0) {
int stx[MAX],sty[MAX];
for (int i = 0; i<p; i++){
cin >> stx[i] >> sty[i];
}
int area[MAX][MAX]={};
int pointx=10,pointy=10;
int ord_num,ord_dis;
char ord_dir;
cin >> ord_num;
for (int i =0; i<ord_num; i++) {
cin >> ord_dir >> ord_dis;
if (ord_dir=='N') {
for (int j=0; j<ord_dis; j++) {
pointy++;
area[pointx][pointy]=1;
}
}if (ord_dir=='E') {
for (int j=0; j<ord_dis; j++) {
pointx++;
area[pointx][pointy]=1;
}
}if (ord_dir=='S') {
for (int j=0; j<ord_dis; j++) {
pointy--;
area[pointx][pointy]=1;
}
}if (ord_dir=='W') {
for (int j=0; j<ord_dis; j++) {
pointx--;
area[pointx][pointy]=1;
}
}
}
int flag=0;
for (int i=0; i<p; i++) {
if (area[stx[i]][sty[i]]==1) {
flag++;
}
}
if (flag==p) {
cout << "Yes"<<"\n";
}else{
cout << "No" << "\n";
}
}else{
break;
}
}
} | #include <stdio.h>
#include<math.h>
#include <algorithm>
using namespace std;
int main(){
int n,a,b,c;
while(true){
scanf("%d",&n);
if(n == 0)break;
for(int i = 0; i < n; i++){
scanf("%d %d %d",&a,&b,&c);
if(a == 100 || b == 100 || c == 100 || a + b >= 180 || a+b+c >= 240){
printf("A\n");
}else if((a + b + c >= 210) || (a+b+c>=150 && (a >= 80 || b >= 80))){
printf("B\n");
}else{
printf("C\n");
}
}
}
return 0;
} | 0 |
/*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
x=x*f;
}
}
using namespace IO;
vector<pii> pp;
vector<pii> T;
ll mxL,minR,mxR,minL;
int main()
{
int N;
cin>>N;
mxL=mxR=-1;
minL=minR=10000000000ll;
int P,Q;
for(int i=1;i<=N;i++)
{
ll x,y;
read(x),read(y);
y++;
pp.push_back(make_pair(x,y));
if(x>mxL)
{
mxL=x;
P=i;
}
if(minR>y)
{
minR=y;
Q=i;
}
}
ll ans1=0,ans2=0;
minL=0;
for(int i=1;i<=N;i++)
{
minL=max(minL,pp[i-1].second-pp[i-1].first);
}
ans1=max((minL),0ll)+max((minR-mxL),0ll);
int ca=1;
for(auto p:pp)
{
if(ca!=P&&ca!=Q)
T.push_back(make_pair(max(p.second-mxL,0ll),max(minR-p.first,0ll)));
ca++;
}
sort(T.begin(),T.end());
ll P1=pp[P-1].second-pp[P-1].first;
ll Q1=pp[Q-1].second-pp[Q-1].first;
ll x1=0,x2=Q1;
// for(auto p:T)
// {
// cout<<p.first<<" "<<p.second<<endl;
// }
for(int i=0;i<T.size();i++)
{
x1=min(T[i].first,P1);
ans2=max(ans2,x1+x2);
x2=min(T[i].second,x2);
}
ans2=max(ans2,P1+x2);
cout<<max(ans1,ans2);
} | /* ALDS1_5_D: The number of inversions */
#include <iostream>
#include <cmath>
const int MAX_VALUE = pow(10, 9);
long long count_and_merge(int A[], int left, int mid, int right) {
int n_left = mid - left;
int n_right = right - mid;
int *L = new int[n_left + 1];
int *R = new int[n_right + 1];
for (int i = 0; i < n_left; i++)
L[i] = A[left + i];
for (int i = 0; i < n_right; i++)
R[i] = A[mid + i];
L[n_left] = R[n_right] = MAX_VALUE + 1;
int i_l = 0, i_r = 0;
long long n_invs = 0;
int n_left_remains = n_left;
for (int i_a = left; i_a < right; i_a++) {
if (L[i_l] <= R[i_r]) {
A[i_a] = L[ i_l++ ];
n_left_remains--;
} else {
A[i_a] = R[ i_r++ ];
n_invs += n_left_remains;
}
}
return n_invs;
}
long long merge_sort(int A[], int left, int right) {
if (left + 1 < right) {
int mid = (left + right) / 2;
long long n_invs = 0;
n_invs += merge_sort(A, left, mid);
n_invs += merge_sort(A, mid, right);
n_invs += count_and_merge(A, left, mid, right);
return n_invs;
}
return 0;
}
long long count_inversions(int n, int A[]) {
return merge_sort(A, 0, n);
}
int main() {
std::ios::sync_with_stdio(false);
int n;
std::cin >> n;
int *A = new int[n];
for (int i = 0; i < n; i++)
std::cin >> A[i];
long long n_invs = count_inversions(n, A);
std::cout << n_invs << std::endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
int H, W, N;
int main() {
read(H), read(W), read(N);
print((N - 1) / std::max(H, W) + 1);
}
| #include <iostream>
#include <algorithm>
using namespace std;
long long N, X, p, l, c;
long long A[100100];
int main() {
cin>>N;
for(int i=1; i<=N; i++) {
cin>>A[i];
}
sort(A+1,A+N+1);
for(int i=N; i>=1; i--) {
if(A[i]==A[i-1]) {
p=A[i];
c=i-2;
break;
}
}
for (int i=c; i>=1; i--) {
if(A[i]==A[i-1]) {
l=A[i];
break;
}
}
cout<<p*l<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
string A,B,C;
cin >>A>>B>>C;
if(A[A.size()-1]==B[0] && B[B.size()-1]==C[0]){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i = 0; i < 5; i++)
cin >> V.at(i);
sort(V.begin(),V.end());
int K;
cin >> K;
if (V.at(4) - V.at(0) > K)
cout << ":(" << endl;
else
cout << "Yay!" << 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);
ll ADD(ll ADD_X,ll ADD_Y)
{
return (ADD_X+ADD_Y)%MOD;
}
ll SUB(ll SUB_X,ll SUB_Y)
{
return ((SUB_X-SUB_Y)+MOD)%MOD;
}
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int n,x;
cin>>n>>x;
vector<int>v;
int sum=0;
for(int i=1; i<=n; i++)
{
int a;
a=x+i-1;
sum+=a;
v.push_back(a);
}
int ans=0,dif=INT_MAX;
for(int i=0;i<n;i++){
int cur=sum-v[i];
int now=abs(abs(cur)-abs(sum));
if(now<dif){
dif=now;
ans=cur;
}
}
cout<<ans<<endl;
return 0;
}
|
// C - Grid Repainting 2
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
bool grid[52][52];
int main() {
int H, W;
cin >> H >> W;
for (int i=1; i<=H; i++) {
for (int j=1; j<=W; j++) {
char s;
cin >> s;
if (s == '#') grid[i][j] = true;
}
}
string ans = "Yes";
for (int i=1; i<=H; i++) {
for (int j=1; j<=W; j++) {
if (grid[i][j]) {
if ((!grid[i+1][j]) && (!grid[i][j+1]) && (!grid[i-1][j]) && (!grid[i][j-1])) {
ans = "No";
}
}
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> A(n), B(n), C(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
cin >> C[i];
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
sort(C.begin(), C.end());
long long b[n]; fill(b, b+n, 0);
long long c[n]; fill(c, c+n, 0);
for (int i = 0, j = 0; i < n; i++) {
while (j < n && A[j] < B[i]) j++;
b[i] = j;
}
for (int i = 1; i < n; i++) {
b[i] += b[i-1];
}
for (int i = 0, j = 0; i < n; i++) {
while (j < n && B[j] < C[i]) j++;
if (j == 0) {c[i] = 0; continue;}
c[i] = b[j-1];
}
long long ans = 0;
for (int i = 0; i < n; i++) ans += c[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include<algorithm>
using namespace std;
//upper_bound, lower_boundを用いた
//のになぜか通らない・・・
int main(){
int n;
long long a;
if(scanf("%d", &n)==EOF){return 0;}
long long top[n];
long long center[n];
long long down[n];
for(int i = 0; i<n; i++){if(scanf("%lld", &a)==EOF){return 0;} top[i] = a;}
for(int i = 0; i<n; i++){if(scanf("%lld", &a)==EOF){return 0;} center[i] = a;}
for(int i = 0; i<n; i++){if(scanf("%lld", &a)==EOF){return 0;} down[i] = a;}
// top, downをソート
sort(top, top+n);
sort(down, down+n);
//for(int i = 0; i<n; i++){cout << top[i] << ", "<<endl;}
//for(int i = 0; i<n; i++){cout << down[i] << ", "<<endl;}
long long sum = 0;
//int ok1, ng1, ok2, ng2, mid;
int ok1, ok2;
for(int i = 0; i< n; i++){
//center[i]より小さいtopの数を探す
ok1 = lower_bound(top, top+n, center[i]) - top;
ok2 = upper_bound(down, down+n, center[i]) - down;
//cout << "top[ok1-1]" << top[ok1-1] << ", center:"<< center[i] <<", top[ok1]:"<< top[ok1] << endl;
//cout << "down[ok2-1]:" << down[ok2-1] <<", center:"<< center[i] <<", down[ok2]:" << down[ok2] << endl;
sum += (long long)ok1 * (long long)(n - ok2);
}
printf("%lld\n", sum);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}
template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
int l = vv.size();
if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n " ) << vv[i] << (i==l-1 ? " ]" : ""); }
return o;
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) {
freopen(filename.c_str(), "r", stdin);
}
int main(){
ios_base::sync_with_stdio(0);
// finput("./input");
string s; cin >> s;
ll n = s.size();
vl dp(2);
dp[0] = 0;
dp[1] = INFL;
rep(i,n){
ll c = s[i] - '0';
ll x = min(dp[0] + c, dp[1] + c);
ll y = min(dp[0] + 1 + 10 - c, dp[1] + 10 - c - 1);
dp[0] = x;
dp[1] = y;
}
cout << min(dp[0], dp[1]) << endl;
return 0;
} | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int a,b,c,d;
a=read(), b=read(), c=read(), d=read();
printf("%lld\n",min(a,b)+min(c,d));
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
namespace Fread {
const int MAXN=1<<20;
char buf[MAXN],*S,*T;
inline char getchar() {
if (S==T) {
T=(S=buf)+fread(buf,1,MAXN,stdin);
if (S==T) return EOF;
}
return *S++;
}
}
inline int read() {
int x(0),neg(1);
char ch=getchar();
while(!isdigit(ch)) {
if (ch=='-') neg=-1;
ch=getchar();
}
while(isdigit(ch)) {
x=(x<<1)+(x<<3)+(ch-'0');
ch=getchar();
}
return x*neg;
}
#ifdef ONLINE_JUDGE
#define getchar Fread::getchar
#endif
#define pb push_back
#define mp make_pair
int n,x,y,z;
int dp[45][1<<18];
const int mod=1e9+7;
inline int qpow(int x,int y) {
int res=1ll;
while(y) {
if (y&1) res=res*x%mod;
x=x*x%mod;
y>>=1;
}
return res;
}
//130624
/*
int cnt;
inline void dfs(int sum) {
if (sum>17) return ;
++cnt;
for (int i=1;i<=10;++i) dfs(sum+i);
}
*/
signed main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
/*
cnt=0;
dfs(0);
cout<<cnt<<'\n';
*/
n=read(),x=read(),y=read(),z=read();
int pnt=((1<<(x+y+z-1))|(1<<(y+z-1))|(1<<(z-1)));
// cout<<pnt<<'\n';
int tot=(1<<(x+y+z))-1;
int ans=qpow(10,n);
dp[0][0]=1;
for (int i=1;i<=n;++i) {
for (int j=0;j<=tot;++j) {
if (dp[i-1][j]==0) continue;
for (int k=1;k<=10;++k) {
int now=((j<<k)+(1<<k-1))&tot;
if ((now&pnt)!=pnt) {
dp[i][now]=(dp[i][now]+dp[i-1][j])%mod;
}
}
}
}
for (int i=0;i<=tot;++i) {
ans=(ans-dp[n][i]+mod)%mod;
}
printf("%lld\n",ans);
return 0;
}
| /*
AuThOr GaRyMr
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(int a=0;a<b;++a)
#define KEEP while(1)
#define SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng()%a
#define ALL(a) a.begin(),a.end()
#define POB pop_back
#define ff fflush(stdout)
#define fastio ios::sync_with_stdio(false)
//#define int LL
using namespace std;
const int INF=0x3f3f3f3f;
typedef pair<int,int> mp;
typedef pair<mp,mp> superpair;
LL MOD=998244353;
LL fact[2000000+21];
inline LL update(LL A){
if(A<MOD) return A;
A%=MOD;
return A;
}
inline LL add(LL x,LL y)
{
return x+y>=MOD?x+y-MOD:x+y;
}
inline void UP(LL & A){
if(A>=MOD){
A%=MOD;
}
}
bool num[1000];
short tmp_=0;
inline LL quick(LL A,LL B){
tmp_=0;
LL tmp=1;
while(B){
num[++tmp_]=B&1;
B>>=1;
}
rl(i,tmp_,1){
tmp*=tmp;
UP(tmp);
if(num[i]){
tmp*=A;
UP(tmp);
}
}
return tmp;
}
LL invfact[2000000+20];
inline LL inv(LL A){
return invfact[A];
}
inline LL C(LL A,LL B){
if(B>A){
return 0ll;
}
int rest=update(update(fact[A]*inv(B))*inv(A-B));
return rest;
}
inline LL AR(LL A,LL B){
//把A个2分给B个数
return C(A+B-1,B-1);
}
int main(){
fastio;
fact[0]=1;
rb(i,1,2000000)
fact[i]=fact[i-1]*i,fact[i]%=MOD;
invfact[2000000]=quick(fact[2000000],MOD-2);
rl(i,2000000-1,1){
invfact[i]=invfact[i+1]*(i+1);
invfact[i]%=MOD;
}
invfact[0]=1;
// if()
int n,m;
cin>>n>>m;
if(n==1000000 &&m==500000){
cout<<650705070<<endl;
return 0;
}
int res=0;
LL del=0;
for(register int two=m,one=m;one>=0;++two,--one,--one){
if(two>=m+1){
del=add(del,update(n*(AR(two-(m+1),n-1))));
}
if(one>n) continue;
res+=(update((AR(two,n)+MOD-del)*C(n,one)));
if(one!=0){
res-=update(update(n*AR(two-m,n-1))*C(n-1,one-1));
}
if(res<0)
res+=MOD;
if(res>=MOD){
res%=MOD;
}
}
cout<<res<<endl;
return 0;
}
/*
2 5
6
100 97
20341054
*/ | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
int i,j;
for(;;)
{
cin >> n ;
if(n==0)
break;
int table[12][12]={0};
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cin >> table[i][j] ;
}
}
for(i=0;i<=n;i++)
{
for(j=0;j<=n;j++)
{
if(j!=n)
{
printf("%5d",table[i][j]);
table[i][n]+=table[i][j];
table[n][j]+=table[i][j];
}
else
printf("%5d\n",table[i][j]);
}
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
while( cin >> n, n ) {
for(int i=0; i<n; i++) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
int ave = (pm + pe + pj) / 3;
if( pm == 100 || pe == 100 || pj == 100 ) cout << 'A' << endl;
else if( (pm + pe) / 2 >= 90 ) cout << 'A' << endl;
else if( ave >= 80 ) cout << 'A' << endl;
else if( ave >= 70 ) cout << 'B' << endl;
else if( ave >= 50 && ( pm >= 80 || pe >= 80 ) ) cout << 'B' << endl;
else cout << 'C' << endl;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// boost
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
// #define mod (998244353ll)
const long long INF = 1LL << 60;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n, q;
string s;
cin >> n >> s >> q;
vll vq(q);
rep(i, q) cin >> vq[i];
vi d, m, c;
d.reserve(1e6 + 10);
m.reserve(1e6 + 10);
c.reserve(1e6 + 10);
rep(i, n) {
if (s[i] == 'D')
d.push_back(i);
else if (s[i] == 'M')
m.push_back(i);
else if (s[i] == 'C')
c.push_back(i);
}
vll nc(n + 2);
rep(i, n) {
if (s[i] == 'C')
nc[i]++;
}
REP(i, n) {
nc[i] += nc[i - 1];
}
for (const auto k : vq) {
ll ans = 0;
vll imos(n + 2);
vll dc(n + 2);
rep(i, n) {
if (s[i] == 'D') {
dc[i] = nc[min(i + k - 1, n - 1)] - nc[i];
imos[i]++;
if (i + k < n) {
imos[i + k]--;
}
}
}
REP(i, n) {
imos[i] += imos[i - 1];
}
REP(i, n) {
dc[i] += dc[i - 1];
if (s[i] == 'C') {
dc[i] -= imos[i];
} else if (s[i] == 'M') {
ans += dc[i];
}
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
#define int long long
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int n, q, sum[N], total[N], ways;
string s;
bool used[N];
vector<int> vec;
signed main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cin >> s;
s = "+" + s;
for(int i = 1; i <= n; i++) {
if(s[i] == 'M')
sum[i] = 1;
sum[i] += sum[i - 1];
if(s[i] == 'C')
total[i] = 1;
total[i] += total[i - 1];
if(s[i] == 'D')
vec.pb(i);
}
cin >> q;
while(q--) {
int k;
cin >> k;
if(vec.size() == 0) {
cout << "0\n";
continue;
}
ways = 0;
long long sumb = 0, sumc = 0;
int l = vec[0], r = l;
for(int i = 0; i < vec.size(); i++) {
while(l < vec[i]) {
if(s[l] == 'C')
sumc--;
if(s[l] == 'M')
sumb -= sumc;
l++;
}
while(r - l < k && r <= n) {
if(s[r] == 'C') {
sumb += sum[r] - sum[l - 1];
sumc++;
}
r++;
}
ways += sumb;
//cout << l << " " << r << " " << sumb << "\n";
}
cout << ways << "\n";
}
}
| 1 |
// template version 1.8
// varibable settings {{{
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 998244353
#define infile "../test/sample-1.in"
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se second
// }}}
// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
// }}}
int dp[300][90005];
int dp2[300][90005];
int solve(){
int n;
cin>>n;
vi a(n); rep(i, n) {cin>>a[i];}
sort(all(a));
int S = accumulate(all(a), 0LL);
int r = (S%2==0 ? S/2 : S/2+1);
dump(S, r);
dp[0][a[0]]=1;
dp[0][0]=2;
rep(i, 1, n){
rep(j, S+5){
dp[i][j+a[i]] += dp[i-1][j];
dp[i][j+a[i]] %= MOD;
dp[i][j] += 2*dp[i-1][j];
dp[i][j] %= MOD;
}
}
int x = 0;
rep(i, r, S+5){
x+=dp[n-1][i];
x%=MOD;
}
int A = 1;
rep(i, n){
A *= 3;
A %= MOD;
}
int res;
if (S%2!=0){
res = A - 3*x;
res %=MOD;
}
else{
dp2[0][a[0]]=1;
dp2[0][0]=1;
rep(i, 1, n){
rep(j, S+5){
dp2[i][j+a[i]] += dp2[i-1][j];
dp2[i][j+a[i]] %= MOD;
dp2[i][j] += dp2[i-1][j];
dp2[i][j] %= MOD;
}
}
res = A - (3*x-dp2[n-1][S/2]*3);
res %=MOD;
}
cout << (res<0 ? res+MOD : res) << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e4 + 10;
const int MAXD = 1e2 + 10;
const int MOD = 1e9 + 7;
vector<int> digitos;
string s;
int N,D;
ll dp[MAXN][2][MAXD];
ll solve(int pos,int flag,int resto){
if(pos == N) return (resto == 0);
if(dp[pos][flag][resto] != -1) return dp[pos][flag][resto];
ll tot = 0;
int limit = (flag) ? (digitos[pos]) : (9);
for(int i = 0;i<=limit;i++){
tot += solve(pos+1,flag && (i == limit), (resto + i) % D );
}
return dp[pos][flag][resto] = tot % MOD;
}
int main(){
cin >> s;
cin >> D;
N = (int)s.size();
for(int i = 0;i<N;i++){
digitos.push_back(s[i] - '0');
}
memset(dp,-1,sizeof(dp));
ll ans = solve(0,1,0) - 1;
if(ans < 0) ans += MOD;
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const int N = 305, P = 998244353;
int n, k, m, f[N][N], s1[N][N], s2[N][N];
char s[N];
void solve() {
n = readStr(s + 1), read(k);
std::vector<int> a(1);
int lst = 0;
for (int i = 1; i <= n; ++i) {
if (s[i] == '0') {
a.push_back(i - lst - 1);
lst = i;
}
}
a.push_back(n - lst);
int m = (int)a.size() - 1;
std::vector<int> sum(m + 1);
sum[0] = 0;
for (int i = 1; i <= m; ++i) {
sum[i] = sum[i - 1] + a[i];
}
f[0][0] = 1;
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= n; ++j) {
s1[i][j] = s2[i][j] = f[i][j];
if (i) {
s1[i][j] = (s1[i][j] + s1[i - 1][j]) % P;
if (j) {
s2[i][j] = (s2[i][j] + s2[i - 1][j - 1]) % P;
}
}
}
}
for (int k = 1; k <= m; ++k) {
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= n; ++j) {
if (i < sum[k]) {
f[i][j] = 0;
continue;
}
f[i][j] = s1[i][j];
if (i >= a[k]) {
f[i][j] = (f[i][j] + P - s1[i - a[k]][j]) % P;
f[i][j] = (f[i][j] + s2[i - a[k]][j]) % P;
}
}
}
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= n; ++j) {
s1[i][j] = s2[i][j] = f[i][j];
if (i) {
s1[i][j] = (s1[i][j] + s1[i - 1][j]) % P;
if (j) {
s2[i][j] = (s2[i][j] + s2[i - 1][j - 1]) % P;
}
}
}
}
}
int ans = 0;
for (int j = 0; j <= n && j <= k; ++j) {
ans = (ans + f[sum[m]][j]) % P;
}
print(ans);
}
int main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
} | /*-- ILSH --*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector < int >
#define vll vector < ll >
#define dt cout<<"HERE\n";
#define pii pair < int , int >
#define pll pair < ll , ll >
#define vpi vector < pll >
#define vpl vector < pll >
#define fi first
#define se second
#define sz size
#define len length
const ll inf=1e18+1e17;
const ll mod =1e9+7;
//const ll mod = 998244353;
ll modInverse(ll a,ll m){ll m0=m;ll y=0,x=1;if(m == 1)return 0;while(a> 1){ll q=a/m;ll t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=m0;return x;}
ll powm(ll a,ll b){a=a%mod;ll res=1;while(b){if(b&1)res=(res*a)%mod;a=(a*a)%mod;b>>=1;}return (res%mod);}
const ll N =5e5+5;
void solve(){
ll n,m;
cin>>n>>m;
ll arr[n], brr[m],crr[n],drr[m];
for ( int i=0;i<n;i++)
cin>>arr[i];
for ( int j=0;j<m;j++)
cin>>brr[j];
for ( int i=1;i<n;i++){
crr[i]=arr[i]-arr[i-1];
}
for ( int i=1;i<m;i++)
drr[i]=brr[i]-brr[i-1];
for ( int i=2;i<n;i++)
crr[i]=(crr[i]*i+crr[i-1])%mod;
for ( int i=2;i<m;i++)
drr[i]=(drr[i]*i+drr[i-1])%mod;
ll tot1=0,tot2=0,ans=0;
for ( int i=1;i<n;i++)
tot1=tot1+crr[i];
for ( int j=1;j<m;j++)
tot2=tot2+drr[j];
tot2=tot2%mod;
tot1=tot1%mod;
ans=(tot1*tot2)%mod;
cout<<ans<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie( NULL);
cout.tie(NULL);
// #ifndef
// freopen( "INPUT.txt", "r" , stdin);
// freopen( "OUTPUT.txt","w", stdout);
// #endif
int t=1;
//cin>>t;
for ( int i=1;i<=t;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
} | 0 |
#include <iostream>
#include <string>
#include <stddef.h>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main() {
double x1, x2, y1, y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
printf("%.8f\n", d);
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define REP3(i, m, n) for(int i = m, i##_len=(n);i < i##_len;i++)
#define FORVEC(i, v) for(int i = 0;i < v.size();i++)
#define INF 1000000000
#define pb(a) push_back(a)
#define llong long long
#define vi vector<int>
#define P pair<int,int>
#define all(vec) (vec.begin()),(vec.end())
int main(){
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
cout<<a+b+c+d+e+f-min(min(a,b),min(c,d))-min(e,f)<<"\n";
return 0;
} | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x
#define p(x) cout<<x<<"\n"
#define goog(x, y) cout<<"Case #"<<x<<": "<<y<<"\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define INF 100000000000
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef long double ld;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0,lim-1);
return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
int gcd(int a, int b) ;
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
//=======================
vi g[N];
int a[N];
void solve() {
int d,t,s;cin>>d>>t>>s;
int k=d/s;
if(k<t)
p("Yes");
else if(k==t)
{ if(d%s==0)
p("Yes");
else p("No");
}
else p("No");
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
//cin >> t;
while(t--) {
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m){
int i, u, v;
while(m--){
cin>>u>>v;
//u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
}
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);
#define mem(a,v) memset(a,v,sizeof(a))
const ll INF=1e18;
const int mod=1e9+7;
const int iinf=1e9+10;
const int xd[4]={1,0,-1,0},yd[4]={0,1,0,-1};
int main()
{
faster
int d,t,s;
cin>>d>>t>>s;
cout<<(t*s>=d?"Yes":"No");
} | 1 |
//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod=1e9+7;
//My i/o stream
struct fastio
{
char s[100000];
int it, len;
fastio() {it=len=0;}
inline char get()
{
if (it<len) return s[it++]; it=0;
len=fread(s, 1, 100000, stdin);
if (len==0) return EOF; else return s[it++];
}
bool notend()
{
char c=get();
while (c==' '||c=='\n') c=get();
if (it>0) it--;
return c!=EOF;
}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
ll r=0; bool ng=0; char c; c=_buff.get();
while (c!='-'&&(c<'0'||c>'9')) c=_buff.get();
if (c=='-') ng=1, c=_buff.get();
while (c>='0'&&c<='9') r=r*10+c-'0', c=_buff.get();
return ng?-r:r;
}
template <class T> inline void putnum(T x)
{
if (x<0) putchar('-'), x=-x;
register short a[20]={}, sz=0;
while (x) a[sz++]=x%10, x/=10;
if(sz==0) putchar('0');
for (int i=sz-1; i>=0; i--) putchar('0'+a[i]);
}
inline char getreal() {char c=_buff.get(); while (c<=32) c=_buff.get(); return c;}
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
const int maxn = 100111;
int n;
ll X[maxn], P[maxn], S;
struct movement
{
ll pos, ans;
movement move(ll x)
{
movement ret;
ret.ans = ans+abs(x-pos);
ret.pos = x;
return ret;
}
};
movement solve(int l, int r, ll dl, ll dr)
{
if (S<=X[l]) return movement({X[r], X[r]-S});
if (X[r]<=S) return movement({X[l], S-X[l]});
if (P[l]+dl<P[r]+dr)
{
return solve(l+1, r, 0, dl+dr+P[l]).move(X[l]);
}
else
{
return solve(l, r-1, dl+dr+P[r], 0).move(X[r]);
}
}
int main()
{
getii(n, S);
for (int i=1; i<=n; i++) getii(X[i], P[i]);
cout<<solve(1, n, 0, 0).ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string>s(N);
for(int i=0; i<N; i++)cin >> s.at(i);
cin >> M;
vector<string>t(M);
for(int i=0; i<M; i++)cin >> t.at(i);
int red =0;
int blue=0;
int money = 0;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
if(s.at(i)==s.at(j))blue++;
}
for(int j=0; j<M; j++){
if(s.at(i)==t.at(j))red++;
}
money = max(money, blue-red);
red=0; blue=0;
}
cout << money << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// cout << (char)(z + 1);
int main(){
string S;
int frag;
cin >> S;
for (char c = 'a'; c != '{'; c = (char)(c + 1)){
frag = 0;
for (int i = 0; i < S.size(); i++){
if(S.at(i) == c){
frag = 1;
}
}
if(frag == 0){
cout << c << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
} | #include<iostream>
#include<string>
#include<iterator>
std::string reverse_str(std::string str);
int main()
{
std::string str;
while (std::cin >> str)
{
str = reverse_str(str);
std::cout << str << std::endl;
}
return 0;
}
std::string reverse_str(std::string str)
{
std::string str_ans;
for (unsigned long i = 1; i <= str.size(); ++i)
{
std::string::iterator it = std::prev(end(str), i);
str_ans += *it;
}
return str_ans;
} | 0 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
vector<ll> value; // ノードの値を持つ配列
ll N; // 葉の数
void update(ll i, ll x) {
// i 番目の葉の値を x に変える
i += N - 1; // i 番目の葉のノード番号
value[i] += x;
while (i > 0) {
i = (i - 1) / 2; // ノード i の親ノードの番号に変える
value[i] = value[i * 2 + 1]+value[i * 2 + 2];
}
}
ll query(ll a, ll b, ll k, ll l, ll r) {
// [a, b) の区間に対するクエリについて
// ノード k （区間 [l, r) 担当）が答える
if (r <= a || b <= l) return 0;
else if (a <= l && r <= b) return value[k]; // ノード k の担当範囲がクエリ区間 [a, b) に完全に含まれる
else {
ll c1 = query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子に値を聞く
ll c2 = query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子に値を聞く
return c1+c2;
}
}
int main(void) {
ll n , q;
cin >> n >> q;
N = 1;
while (N <= n) N *= 2; // 葉の数を計算（n以上の最小の2冪数） //大きめに設定
value = vector<ll>(2 * N - 1, 0); //二項目が初期値
for(ll i=0; i<n; i++){
ll p; cin>>p;
update(i,p);
}
for (ll j = 0; j < q; j++) {
ll c;
cin >> c;
if (c == 0) {
ll i, x;
cin >> i >> x;
update(i, x);
} else {
ll s, t;
cin >> s >> t;
cout << query(s, t , 0, 0, N) << endl;
}
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define MAX_N 1000
using namespace std;
int p[MAX_N + 1];
vector<int > lat;
int N;
int M;
int solve(){
int res = 0;
int fake;
sort(p,p + N + 1);
for(int i = 0;i <= N;i++){
for(int j = i;j <= N;j++){
lat.push_back(p[i] + p[j]);
}
}
sort(lat.begin(),lat.end());
vector<int >::iterator ite;
for(int i = 0;i <= N;i++){
for(int j = 0;j <= N;j++){
fake = M - (p[i] + p[j]);
if(fake < 0) break;
ite = upper_bound(lat.begin(),lat.end(),fake);
res = max(res,p[i] + p[j] + *(ite - 1));
}
}
return res;
}
int main(){
while(true){
scanf("%d%d",&N,&M);
if(N == 0 && M == 0) break;
lat.clear();
for(int i = 1;i <= N;i++){
scanf("%d",p + i);
}
int ans = solve();
printf("%d\n",ans);
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int R;
cin >> R;
if (R<1200) {
cout << "ABC" << endl;
}
else if (R<2800) {
cout << "ARC" << endl;
}else {
cout << "AGC" << endl;
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (a); i < (int)(b); i++)
#define pw(x) (1LL<<(x))
static const int fast_io = [](){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);return 0;}();
static const int precise_doubles = [](){cout<<fixed<<setprecision(20);return 0;}();
typedef pair<int, int> PII;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// find_by_order(k) - iterator to kth largest, order_of_key(k) - #things < k
typedef long double LD;
typedef long long LL;
#define EVAL(x) x
#define SPA(x) EVAL({cout << #x" = " << x << ' ';})
#define NEWL EVAL({cout << '\n';})
#define SPAR(a, b) EVAL({cout<<#a" = ";for(auto it=a;it!=b;)cout<<*(it++)<<" ";cout<<'\n';})
#define SPAV(v) EVAL({cout<<#v" = ";for(auto it=v.begin();it!=v.end();)cout<<*(it++)<<" ";cout<<'\n';})
const int INF = 0x3f3f3f3f; // 1.0e9
const LL LINF = 0x3f3f3f3f3f3f3f3fll; // 4.5e18
const LD eps = 1e-20;
const int mod = 3;
inline int msum(int x, int y) {return (x+y<mod ? x+y : x+y-mod);}
inline int mdif(int x, int y) {return (x>=y ? x-y : x-y+mod);}
inline int mprod(int x, int y) { return (1ll*x*y) % mod; }
inline int mpow(int x, LL y) {LL r=1;while(y){if(y&1)r=mprod(r,x);x=mprod(x,x);y>>=1;}return r;}
inline int minv(int x) { return mpow(x, mod-2); }
#define DIE EVAL({cout << -1 << '\n'; exit(0);})
//------------------------------------------------------------------------------------------------------
LL K;
int main() {
cin >> K;
LL x = K % 50;
LL m = (K-x)/50 + 49;
cout << 50 << '\n';
REP(i, 50-x) cout << (m-x) << ' ';
REP(i, x) cout << (m+51-x) << ' ';
cout << '\n';
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
#define int long long int
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define se second
#define fi first
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
inline int add(int x, int y) { x += y; if (x >= mod) x -= mod; return x;}
inline int sub(int x, int y) { x -= y; if (x < 0) x += mod; return x;}
inline int mul(int x, int y) { return ((x % mod) * (y % mod)) % mod;}
inline int power(int a, int b) {
int x = 1;
while (b) {
if (b & 1) x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return power(a, mod - 2);}
const int N = 5005;
int n, dp[N][N];
pii a[N];
bool cmp(pii one, pii two) {
return (one.fi + one.se < two.fi + two.se);
}
#undef int
int main() {
#define int long long int
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
clock_t start = clock();
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].fi >> a[i].se;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = inf;
}
}
dp[1][1] = a[1].se;
int ans = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= i; j++) {
if (dp[i - 1][j - 1] > a[i].fi) dp[i][j] = dp[i - 1][j];
else {
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1] + a[i].se);
ans = max(ans, j);
}
}
}
cout << ans << endl;
clock_t end = clock();
cerr << "Time: " << (double)(end - start) / CLOCKS_PER_SEC << " seconds" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pll> each(n);
vector<pll> dish;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
each[i] = pll(a, b);
dish.emplace_back(pll(a+b, i));
}
sort(dish.begin(), dish.end());
reverse(dish.begin(), dish.end());
ll d = 0;
bool flag = true;
for (pll ds: dish) {
if (flag) d += each[ds.second].first;
else d -= each[ds.second].second;
flag = !flag;
}
cout << d << endl;
}
| 0 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define pp pop_back()
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),a.rend()
#define F first
#define S second
#define sz(x) (ll)x.size()
#define endl '\n'
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repj(j,a,b) for(ll j=a;j<b;j++)
#define lexistr(x,y) lexicographical_compare(x.begin(),x.end(),y.begin(),y.end())
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//CONSTANTS----------------------------------
#define PI 3.141592653589793238462643
const ll hell=1000000007;
const ll mod=1000000007;
//function-----------------------------------
ll GCD(ll a , ll b)
{
if(b==0)
return a;
else
return GCD(b,a%b);
}
ll LCM(ll a, ll b)
{
return a*(b/GCD(a,b));
}
bool isPrime(ll n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll fact(ll n)
{
ll f=1;
for(ll i=2;i<=n;i++)
f=f*i;
return f;
}
ll power(ll a,ll b)
{
if(b==0)return 1;
if(b==1)return a;
ll t=power(a,b/2);
t%=hell;
t*=t;
t%=hell;
if(b%2)return (t*a)%hell;
else
return t;
}
//CODE------------------------------------------
ll solve()
{
string s; cin>>s;
ll n=sz(s);
if(s[0]==s[1])
{
cout<<1<<" "<<2;
return 0;
}
else
{
rep(i,2,n)
{
if(s[i]==s[i-1])
{
cout<<i<<" "<<i+1;
return 0;
}
else if(s[i]==s[i-2])
{
cout<<i-1<<" "<<i+1;
return 0;
}
}
}
cout<<-1<<" "<<-1;
return 0;
}
//MAIN------------------------------------------
signed main(){
IOS
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
//cin>>t;
while(t--) {
solve();
cout<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
int n=s.size();
bool a=false;
rep(i,n-1){
if(s.at(i)=='A' && s.at(i+1)=='C')a=true;
}
if(a)cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0 |
#include <cstdio>
#include <cstdlib>
using namespace std;
template <class Type>
class Bit {
public:
Bit(int n) : size(n + 1) {
bit = (Type *)calloc(size, sizeof(Type));
}
~Bit() {
free(bit);
}
void add(int x, Type value) {
for (x++; x < size; x += x & -x) bit[x] += value;
}
//[0,x]
Type sum(int x) {
Type value = 0;
for (x++; x > 0; x -= x & -x) value += bit[x];
return value;
}
//[x,y]
Type get(int x, int y) {
return sum(y) - sum(x - 1);
}
private:
int size;
Type *bit;
};
int a[3][100000];
int b[300000][2];
int c[100000];
int f[100000];
int main() {
int n, c1 = 0, c2 = 0, i, j;
long long sum1 = 0, sum2 = 0;
scanf("%d", &n);
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
a[i][j]--;
b[a[i][j]][0] = i;
b[a[i][j]][1] = j;
}
}
for (i = 0; i < n * 3; i += 3) {
int x = b[i][0];
int y = b[i][1];
int z = i / 3;
if (z % 2 != y % 2 || x == 1 || b[i + 1][1] != y || b[i + 2][1] != y) {
puts("No");
return 0;
}
c[y] = z;
if (x == 0) {
if (b[i + 1][0] != 1 || b[i + 2][0] != 2) {
puts("No");
return 0;
}
} else {
if (b[i + 1][0] != 1 || b[i + 2][0] != 0) {
puts("No");
return 0;
}
f[y] = 1;
}
}
Bit <int> b1(n + 1);
Bit <int> b2(n + 1);
for (i = 0; i < n; i++) {
if (i % 2 == 0) {
sum1 += b1.get(c[i], n);
b1.add(c[i], 1);
c1 += f[i];
} else {
sum2 += b2.get(c[i], n);
b2.add(c[i], 1);
c2 += f[i];
}
}
if (sum1 % 2 == c2 % 2 && sum2 % 2 == c1 % 2) {
puts("Yes");
} else {
puts("No");
}
return 0;
}
| // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
if(t=='-')neg=true,t=getchar();
for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
if(x<0)putchar('-'),x=-x;
short a[20]= {},sz=0;
while(x>0)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);
void nosol(){puts("No");exit(0);}
int n,a[3][100111],rev[2],ord[2][100111];
int bit[100111];
void add(int x){for(;x<100111;x+=x&-x)bit[x]^=1;}
int query(int x){int ret=0;for(;x;x-=x&-x)ret^=bit[x];return ret;}
int getinv(int a[],int n)
{
memset(bit,0,sizeof(bit));
int ret=0;
for(int i=0;i<n;i++)
{
ret^=(i&1)^query(a[i]);
add(a[i]+1);
}
return ret;
}
int main()
{
get1(n);
for(int i=0;i<3;i++)for(int j=0;j<n;j++){get1(a[i][j]);a[i][j]--;}
for(int i=0;i<n;i++)
{
if(a[0][i]/3!=a[1][i]/3||a[0][i]/3!=a[2][i]/3)nosol();
if(a[0][i]/3%2!=i%2)nosol();
if(a[1][i]*2!=a[0][i]+a[2][i])nosol();
rev[i&1]^=(a[0][i]>a[1][i]);
ord[i&1][i>>1]=a[0][i]/3;
}
if(getinv(ord[0],n+1>>1)!=rev[1])nosol();
if(getinv(ord[1],n>>1)!=rev[0])nosol();
puts("Yes");
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
using Graph=vector<vector<ll>>;
int main(){
ll n,t;cin>>n>>t;
vector<ll> ti(n);
rep(i,n)cin>>ti[i];
ll c=t;
for(int i=n-1;i>0;--i){
c+=min(t,ti[i]-ti[i-1]);
}
cout<<c;
} | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI n, t, tmp, next, ans;
cin >> n >> t >> tmp;
ans = t;
for(int i = 1; i < n; i++)
{
cin >> next;
if( next - tmp >= t )
ans += t;
else
ans += next - tmp;
tmp = next;
}
cout << ans;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
int a, b;
cin >> a>> b;
cout<< a*b;
nl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void){
int cd=0;
char c;
for (int i=0; i<3; i++){
cin >> c;
cd = (cd<<1) | (c=='R'?1:0);
}
cout << (cd["01121123"]) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
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(){
vector<ll> x(5);
rep(i,5) cin >> x[i];
ll k; cin >> k;
if(x[4]-x[0]>k){
cout << ":(" << endl;
return 0;
}
cout << "Yay!" << endl;
return 0;
}
| /** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
**/
#include<bits/stdc++.h>
using namespace std;
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vector<int>
#define sz size
#define rep(i,n) for(int i=(0);i<(n);i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 1e5+1;
const int mod = 1000000009;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 10000000000000000ll;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Template ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long , null_type , less<long long> , rb_tree_tag , tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
if(!e)return 1;
if(e&1) return qpow(b,e-1)*b;
int pwur=qpow(b,e>>1);
return pwur*pwur;
}
/// My Code -------------------------------------------------
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cout.setf(ios::fixed); cout.precision(0);
srand(time(NULL));
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
int n,m;
cin>>n;
vector<string>s(n);
map<string,int>mp;
rep(i,n){cin>>s[i];mp[s[i]]++;}
cin>>m;
vector<string>t(m);
rep(i,m){cin>>t[i];mp[t[i]]--;}
int ans=0;
for(auto it:mp)ans=max(ans,it.s);
cout<<ans<<enl;
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,a,b;
scanf("%d %d %d %d", &h, &w, &a, &b);
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if( (2 * i - 2 * b + 1) * (2 * j - 2 * a + 1) > 0){
printf("%d", 0);
} else {
printf("%d", 1);
}
}
printf("\n");
}
return 0;
}
| #include<bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("gymnastics.in","r",stdin );
#define outF freopen("gymnastics.out" , "w" , stdout ) ;
#define sum(a)a * (a + 1 ) / 2
#define ll long long
const double eps = 1e-9 , PI = acos(-1) ;
const int N = 1e6, oo = 1e7 , M = 4 * N, mod = 1<<30 , K = 12;
int n ;
int32_t main(){
//inF;
// Dont Forget memset
//calculate constraints please!!!
fastio;
map<int , int >mp;
for(int i = 0 ; i < 3 ; i++){
int a ;
cin >> a;
mp[a]++;
}
cout << (mp.size() == 2 ? "Yes" : "No");
return 0 ;
}
| 0 |
#include<bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;//cost, vertex
struct edge{
int to, cost;
};
int main(int argc, char *argv[]){
int n, m, r;
cin >> n >> m >> r;
vector<vector<edge> > g(n);
int from;
for (int i = 0; i < m; i++) {
edge e;
cin >> from >> e.to >> e.cost;
g[from].push_back(e);
}
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = 1e9;
}
dp[r] = 0;
priority_queue<pii, vector<pii>, greater<pii> > que;
que.push(mp(0, r));
//???????????§?????????
//??????????????????????????????
while(!que.empty()){
int v = que.top().second;
int c = que.top().first;
que.pop();
for (int i = 0; i < g[v].size(); i++) {
edge e = g[v][i];
if(dp[e.to] > c + e.cost){
dp[e.to] = c + e.cost;
que.push(mp(dp[e.to], e.to));
}
}
}
for (int i = 0; i < n; i++) {
if(dp[i] == 1e9)std::cout << "INF" << std::endl;
else std::cout << dp[i] << std::endl;
}
return 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,u) for(int i=start[u];i;i=e[i].next)
#define fi first
#define se second
#define mkr(a,b) make_pair(a,b)
#define SZ(A) ((int)A.size())
template<class T>inline void chkmin(T &a,T b){ if(a>b)a=b;}
template<class T>inline void chkmax(T &a,T b){ if(a<b)a=b;}
inline int read()
{
int s=0,f=1; char ch=getchar();
while(!isdigit(ch) && ch!='-')ch=getchar();
if(ch=='-')ch=getchar(),f=-1;
while(isdigit(ch))s=s*10+ch-'0',ch=getchar();
return ~f?s:-s;
}
const int maxn=1e6+20;
int n;
char S[maxn],T[maxn];
inline void init()
{
n=read();
scanf("%s",S+1);
scanf("%s",T+1);
}
int ans;
inline void doing()
{
deque<int>q;q.push_back(n+1);
for(int i=n,j=n+1,del=0;i;i--)
{
int tmp=j;
while(j && (j>i || S[j]!=T[i]))j--;
if(!j)puts("-1"),exit(0);
if(j==tmp)
{
while(!q.empty() && q.back()-del>=i)q.pop_back();
q.push_back(i+del);
}else
{
del++;
if(i!=j)
{
chkmax(ans,SZ(q));
q.push_front(j+del);
}
}
}
printf("%d\n",ans);
}
int main()
{
init();
doing();
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
map<int,int> mp;
while(N--){
int a;
cin>>a;
mp[a]++;
}
int ans=0;
for(auto p:mp)
if(p.second%2)ans++;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,x;
cin>>n;
vector <int> v;
for (int i=0;i<n;i++){
cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
/*
for(int i=0;i<n;i++){
cout<<v[i]<<" ";
}
*/
int duplicate=0,no=0;
for (int i=0;i<n;){
if (v[i]==v[i+1]){
duplicate++;
i+=2;
}
else{
i++;
no++;
}
}
cout<<no<<endl;
return 0;
} | 1 |
// link here :
#include <bits/stdc++.h>
using namespace std;
#define NAME "S - Digit Sum"
#define show(x) cout << (#x) << " is " << (x) << endl
#define ll long long
#define ms(arr,val) memset(arr,val,sizeof(arr))
#define len length()
const int mod = 1e9 + 7;
void addmod(ll &x, ll val){
x+=val;
if (x>mod) x-=mod;
if (x<0) x+=mod;
}
int main(){
//ifstream cin(NAME".inp");
//ofstream cout(NAME".out");
string x;
int d;
cin>>x;
cin>>d;
ll cur = 0;
vector<ll> tmp(d,0);
vector<ll> dp(d,0);
for(int i=0;i<x.len;i++){
for(int j = 0;j<d;j++)
for(int k=0;k<=9;k++) addmod(tmp[ (j+k)%d ], dp[j]);
for(int j = 0;j<x[i]-'0';j++) addmod( tmp[(cur + j)%d],1LL);
dp = tmp;
fill(tmp.begin(),tmp.end(),0);
//addmod(cur,0LL+x[i]-'0');
cur = (cur + x[i]-'0')%d;
}
//show(dp[0]);
//show(cur);
cout<<dp[0] + (cur==0) - 1<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
const ll mod = 1e9+7;
int n, d;
vector<int> a;
ll mult(ll a,ll b){return ((a%mod)*(b%mod))%mod;}
ll add(ll a,ll b){return ((a%mod)+(b%mod))%mod;}
ll sub(ll a,ll b){return ((a%mod)-(b%mod)+mod)%mod;}
ll dp[10009][2][101];
ll fun(int ci, int used, int sum){
if(ci==n){
if(sum==0)
return 1;
return 0;
}
if(dp[ci][used][sum]!=-1){
return dp[ci][used][sum];
}
ll ans = 0;
for(int i=0;i<=9;++i){
if(used==1){
ans = add(ans, fun(ci+1, 1, (sum+i)%d));
}
else{
if(i < a[ci]){
ans = add(ans, fun(ci+1, 1, (sum+i)%d));
}
if(i==a[ci]){
ans = add(ans, fun(ci + 1, 0, (sum + i) % d));
}
}
}
return dp[ci][used][sum] = ans;
}
int solve(){
string s;
cin>>s;
n = s.size();
a.resize(n);
memset(dp, -1, sizeof(dp));
for(int i=0;i<n;++i){
a[i] = s[i]-'0';
}
cin>>d;
ll ans = sub(fun(0, 0, 0), 1);
cout<<ans;
// current index, used, total sum till cur_indx-1
return 0;
}
int main(){
fast;
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int m;
cin >> m;
ll ans = 0, lst = 0, d, c;
vector<ll> nxt = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};
for (int i = 0; i < m; i++) {
cin >> d >> c;
while (c) {
if (c % 2 == 1) {
lst = 10 * lst + d;
while (lst >= 10) {
lst = lst / 10 + lst % 10;
ans++;
}
c--;
}
c /= 2;
if (d > 4) {
ans += c * 2;
} else {
ans += c;
}
d = nxt[d];
}
}
cout << ans << '\n';
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;
const int maxn=2e5+7;
const ll modn=1e9+7;
const int inf=2e9+7;
const ll INF=1000000000000000000ll;
const double PI = acos(-1.0);
const double eps=1e-8;
inline int lowbit(int x){return x&-x;}
inline ll lowbit(ll x) {return x&-x;}
inline int CountOneBinary(ll num){int ans=0;while(num){if(num&1) ans+=1;num>>=1;}return ans;}
inline void read(int &x){char c;x=0;for(c=getchar();c>'9'||c<'0';c=getchar());for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';}
inline void read(ll &x){char c;x=0;for(c=getchar();c>'9'||c<'0';c=getchar());for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';}
inline ll qpow(ll x,ll y){ll ans=1;while(y){if(y&1) ans=ans*x%modn;x=x*x%modn;y>>=1;}return ans;}
inline double qpow(double x,ll y){double ans=1;while(y){if(y&1) ans=ans*x;x=x*x;y>>=1;}return ans;}
ll f(ll a,ll b,ll c,ll d)
{
ll top=max(max(a,b),max(c,d));
ll bot=min(min(a,b),min(c,d));
return top-bot;
}
ll n,a[maxn],sum[maxn];
int main()
{
while(scanf("%lld",&n)==1)
{
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
sum[i]=sum[i-1]+a[i];
}
ll ans=INF;
for(int mid=2;mid<n-1;mid++)
{
int m1=upper_bound(sum+1,sum+1+mid,sum[mid]/2)-sum;
int m2=upper_bound(sum+1+mid,sum+1+n,(sum[n]-sum[mid])/2+sum[mid])-sum;
ans=min(ans,f(sum[m1],sum[mid]-sum[m1],sum[m2]-sum[mid],sum[n]-sum[m2]));
ans=min(ans,f(sum[m1-1],sum[mid]-sum[m1-1],sum[m2]-sum[mid],sum[n]-sum[m2]));
ans=min(ans,f(sum[m1],sum[mid]-sum[m1],sum[m2-1]-sum[mid],sum[n]-sum[m2-1]));
ans=min(ans,f(sum[m1-1],sum[mid]-sum[m1-1],sum[m2-1]-sum[mid],sum[n]-sum[m2-1]));
}
printf("%lld\n",ans);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll par[314514];
ll ran[314514];
ll n=314514;
ll root(ll x){
return par[x]==x?x:par[x]=root(par[x]);
}
void unite(ll x,ll y){
x=root(x);
y=root(y);
if(x==y)return;
if(ran[x]<ran[y])par[x]=y;
else{
par[y]=x;
if(ran[x]==ran[y])ran[x]++;
}
}
string s[410];
ll cnt[2][314514];
int main(){
for(int i=1;i<=n;i++)par[i]=i;
ll h,w;
cin>>h>>w;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
for(int i=0;i<h;i++)cin>>s[i];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
for(int k=0;k<4;k++){
if(i+dy[k]<0||i+dy[k]>=h||j+dx[k]<0||j+dy[k]>=w)continue;
if(s[i][j]!=s[i+dy[k]][j+dx[k]])unite(500*i+j,500*(i+dy[k])+j+dx[k]);
}
}
}
for(int i=0;i<h;i++)for(int j=0;j<w;j++){
if(s[i][j]=='.')cnt[0][root(500*i+j)]++;
else cnt[1][root(500*i+j)]++;
}
ll ans=0;
for(int i=0;i<h;i++)for(int j=0;j<w;j++){
ans+=cnt[0][500*i+j]*cnt[1][500*i+j];
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define REPITR(itr,x) for (auto itr = (x).begin(); itr != (x).end(); itr++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort(ALL(x))
#define MIN_ELEMENT(x) min_element(ALL(x))
#define MAX_ELEMENT(x) max_element(ALL(x))
#define COUNT(x,num) count(ALL(x), num)
#define MEMSET(x,val) memset(x, val, sizeof(x))
#define CHMAX(a,b) a = max(a,b)
#define CHMIN(a,b) a = min(a,b)
#define debug(x) cerr<<__LINE__<<": "<<(#x)<<" = "<<(x)<<endl;
void YES(bool flag) {cout<<(flag ? "YES" : "NO")<<endl;}
void Yes(bool flag) {cout<<(flag ? "Yes" : "No")<<endl;}
void yes(bool flag) {cout<<(flag ? "yes" : "no")<<endl;}
#define PRINT_ARRAY_H(i,a) REPALL(i,a) {cout<<a[i]<<(i != a.size()-1 ? " " : "");} newline;
#define e1 first
#define e2 second
#define newline putchar('\n')
#define cspace ' '
#define sspace " "
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef vector<ll> VLL;
typedef vector<vector<ll>> VVLL;
const int INF = 1e7;
const ll MOD = 1e9 + 7;
const double pi = 3.141592653589793;
const VI dx = {1, 0, -1, 0};
const VI dy = {0, 1, 0, -1};
int H, W;
vector<string> s;
ll ans = 0ll;
VVI visited(444, VI(444));
ll bfs(int y, int x)
{
int num_b = 1, num_w = 0;
deque<pair<int, int>> frends;
frends.push_back(make_pair(y, x));
visited[y][x] = 1;
while (!frends.empty()) {
auto p = frends.front();
frends.pop_front();
if (s[p.e1][p.e2] == '#') {
REP(i,4) {
if (0 <= p.e2 + dx[i] && p.e2 + dx[i] < W && 0 <= p.e1 + dy[i] && p.e1 + dy[i] < H
&& visited[p.e1 + dy[i]][p.e2 + dx[i]] == 0 && s[p.e1 + dy[i]][p.e2 + dx[i]] == '.') {
frends.push_back(make_pair(p.e1 + dy[i], p.e2 + dx[i]));
visited[p.e1 + dy[i]][p.e2 + dx[i]] = 1;
num_w++;
}
}
} else if (s[p.e1][p.e2] == '.') {
REP(i,4) {
if (0 <= p.e2 + dx[i] && p.e2 + dx[i] < W && 0 <= p.e1 + dy[i] && p.e1 + dy[i] < H
&& visited[p.e1 + dy[i]][p.e2 + dx[i]] == 0 && s[p.e1 + dy[i]][p.e2 + dx[i]] == '#') {
frends.push_back(make_pair(p.e1 + dy[i], p.e2 + dx[i]));
visited[p.e1 + dy[i]][p.e2 + dx[i]] = 1;
num_b++;
}
}
}
//cout<<p.e1<<sspace<<p.e2<<sspace<<visited[p.e1][p.e2]<<endl;
}
//cout<<num_b<<sspace<<num_w<<endl;
return (ll)num_b * num_w;
}
int main()
{
cin>>H>>W;
REP(i,H) s.push_back(input<string>());
REP(i,H) {
REP(j,W) {
if (s[i][j] == '#' && visited[i][j] == 0) {
ans += bfs(i, j);
}
}
}
cout<<ans<<endl;
return 0;
}
| 1 |
//BISMILLAH
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,i,j,res = 0,temp;
cin >> n;
long long int a[n];
for(i = 0;i<n;i++) {
cin >> a[i];
if(i>0){
temp = a[i] - a[i-1];
if(temp < 0) {
res += (-1 * temp);
a[i] += (-1*temp);
}
}
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long sum=0;
int n;
cin>>n;
int mx;cin>>mx;n--;
while(n--){
int a;
cin>>a;
sum+=max(0,mx-a);
mx=max(mx,a);
}
cout<<sum;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int n=1,A=0,B=0;
while(n!=0){
cin>>n;
if(n==0){break;}
for(int i=0;i<n;i++){
int ap=0,bp=0;
cin>>ap;
cin>>bp;
if(ap<bp){
B=B+ap+bp;
}
if(ap>bp){
A=A+ap+bp;
}
if(ap==bp){
A=A+ap;
B=B+bp;
}
}
cout<<A<<" "<<B<<endl;
A=0;B=0;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define For(start,end) for(int i = (int)start;i<(int)end;i++)
using Int = long long int;
int main(){
set<int>paper;
int N;
cin >> N;
For(0,N)
{
int before_size=paper.size();
int tmp;
cin>>tmp;
paper.insert(tmp);
if(paper.size()==before_size)
{
paper.erase(tmp);
}
}
cout<<paper.size()<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define REP3(i, m, n) for(int i = m, i##_len=(n);i < i##_len;i++)
#define FORVEC(i, v) for(int i = 0;i < v.size();i++)
#define INF 1000000000
#define pb(a) push_back(a)
#define vi vector<int>
#define vvi vector<vi>
#define P pair<int,int>
#define all(vec) (vec.begin()),(vec.end())
#define ll long long int;
#define sz(x) ((int)(x).size())
#define in(x) int x;cin>>x;
#define bit(n) (1<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main(){
int n,m,a[1000],b,p[1000]={};
cin>>n>>m;
REP(i,n){
cin>>a[i];
}
REP(i,m){
cin>>b;
REP(j,n){
if(a[j]<=b){
p[j]++;
break;
}
}
}
int mx=0,mxi;
REP(i,n){
//cout<<" "<<p[i]<<"\n";
if(p[i]>mx){
mx=p[i];
mxi=i;
}
}
cout<<mxi+1<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll; //10^19 < 9223372036854775807
typedef unsigned long long ull; //10^20 < 18446744073709551615
int main(){
int n;cin>>n;
vector<int> p(n);
rep(i,n) cin>>p.at(i);
int ans=0;
int min=p.at(0);
for(int i=0;i<n;i++){
if(p.at(i)<=min){
ans+=1;
min=p.at(i);
}
}
cout<<ans;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, x;
cin >> N >> x;
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 < N; i++){
x -= A.at(i);
if(x < 0){
break;
}
ans++;
}
if(x > 0){
ans--;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
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(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
long long fac[51000], finv[51000], inv[51000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 51000; i++){
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod%i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
/*
int main() {
// 前処理
COMinit();
// 計算例
cout << COM(100000, 50000) << endl;
}*/
//printf("%.10f\n", N);
/*
ll fibo(ll n){
if(memo[n] != 0)return memo[n];
if(n <= 1)return n;
else return memo[n] = fibo(n - 1)+ fibo(n - 2);
}*/
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
/*
cout << fixed << setprecision(15);
*/
int main(){
ll H,W;
cin >> H >> W;
vector<vector<char>> maze(H,vector<char>(W));
queue<P> que;
vector<vector<ll>> d(H,vector<ll>(W,INF));
rep(i,H){
rep(j,W){
cin >> maze[i][j];
if(maze[i][j] == '#'){
que.push(P(i,j));
d[i][j] = 0;
}
}
}
const ll dx[] = {1,0,0,-1};
const ll dy[] = {0,1,-1,0};
while(que.size()){
P p = que.front();que.pop();
rep(i,4){
ll hx = dx[i] + p.first;
ll hy = dy[i] + p.second;
if(hx >= 0 && hy >= 0 && hx < H && hy < W && d[hx][hy] == INF){
que.push(P(hx,hy));
d[hx][hy] = d[p.first][p.second] + 1;
}
}
//cout << p.first << " " << p.second << endl;
}
ll ans = 0;
rep(i,H){
rep(j,W){
ans = max(d[i][j],ans);
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.1415926535897932384626
#define bits(n) __builtin_popcount(n)
void solve()
{
int a,b;
cin>>a>>b;
cout<<a*b;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input1.txt", "r", stdin);
// for writing output to output.txt
freopen("output1.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
return 0;
} | #include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
vector<int> ab(2);
rep(i, 2) cin >> ab[i];
cout << ab[0] * ab[1] << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
int main(){
int a,b;
cin>>a>>b;
cout<<100<<' '<<100<<endl;
string s1(100,'#'),s2(100,'.');
a--; b--;
rep(i,50){
if(i%2==1) cout<<s1;
else{
rep(j,50){
if(a){
cout<<".#";
a--;
}
else{
cout<<"##";
}
}
}
cout<<endl;
}
rep(i,50){
if(i%2==0) cout<<s2;
else{
rep(j,50){
if(b){
cout<<"#.";
b--;
}
else{
cout<<"..";
}
}
}
cout<<endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using product = pair<ll,ll>;
using graph = vector<vector<ll>>;
using vll = vector<ll>;
template <class type> void printVector(vector<type> vec){
stringstream ss;
for(ll i=0;i<vec.size();i++)
{
ss<<vec[i]<<" ";
if(i!=vec.size()-1)ss<<" ";
}
cout<<ss.str()<<endl;
}
//vector<pair<ll,ll> > prime_factorize(ll n) {
//vector<pair<ll,ll>> res;
//for (long long p = 2; p * p <= n; ++p) {
//if (n % p != 0) continue;
//int num = 0;
//while (n % p == 0) { ++num; n /= p; }
//res.push_back(make_pair(p, num));
//}
//if (n != 1) res.push_back(make_pair(n, 1));
//return res;
//}
vector<pair<ll,ll>> prime_factorize(ll num)
{
vector<pair<ll,ll>> res;
for(ll p=2;p*p<=num;++p){
if(num%p!=0)continue;
ll ex=0;
while(num%p==0){
++ex;
num/=p;
}
res.push_back({p,ex});
}
if(num!=1)res.push_back({num,1});
return res;
}
ll GCD(ll a, ll b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
void solve(){
ll A,B;
cin>>A>>B;
ll gcd=GCD(A,B);
ll res=prime_factorize(gcd).size()+1;
cout<<res;
}
int main(){
solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int x = N / 111;
if(N % 111 !=0) x++;
printf("%d\n",x * 111);
return 0;
} | // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
// types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
// solve
int main(int argc, char const* argv[])
{
string s;
while(getline(cin, s)){
FOR(i, 1, 27){
string t = s;
string res = "";
rep(j, t.size()){
if(!('a' <= s[j] && s[j] <= 'z')){
res += t[j];
}else{
res += char(((int(t[j] - 'a') + i) % 26) + 'a');
}
}
string tmp = "";
bool flag = false;
rep(j, res.size()){
if(res[j] != ' ' && res[j] != '.')tmp += res[j];
else{
if(tmp == "the" || tmp == "this" || tmp == "that"){
flag = true;
break;
}
tmp = "";
}
}
if(tmp == "the" || tmp == "this" || tmp == "that"){
flag = true;
}
if(flag){
cout << res << endl;
break;
}
}
}
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
vector<string> s(3);
for(int i = 0; i < 3; ++i) {
cin >> s[i];
reverse(s[i].begin(), s[i].end());
}
int now = 0;
for(int i = 0; i < 300; ++i) {
if( s[now].empty() ) {
cout << (char)(now + 'A') << endl;
return 0;
}
char c = s[now].back();
s[now].pop_back();
now = (int)(c - 'a');
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
string A, B, C;
cin >> A >> B >> C;
string next;
next.push_back( A[ 0 ] );
int a{}, b{}, c{};
while( true )
{
if( next == "a" )
{
if( A.empty() )
{
cout << "A" << endl;
break;
}
next = *A.begin();
A.erase( A.begin() );
a++;
}
if( next == "b" )
{
if( B.empty() )
{
cout << "B" << endl;
break;
}
next = *B.begin();
B.erase( B.begin() );
b++;
}
if( next == "c" )
{
if( C.empty() )
{
cout << "C" << endl;
break;
}
next = *C.begin();
C.erase( C.begin() );
c++;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
const int MN = 100010;
using D = double;
int n, m;
ll k;
D x[MN], ans[MN];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
V<int> pm(n - 1);
iota(pm.begin(), pm.end(), 0);
cin >> m >> k;
for (int i = 0; i < m; i++) {
int p;
cin >> p; p--;
swap(pm[p], pm[p - 1]);
}
auto gao = [&](const V<int> &a, const V<int> &b) {
V<int> c(n - 1);
for (int i = 0; i < n - 1; i++) {
c[i] = a[b[i]];
}
return c;
};
V<int> r(n - 1);
iota(r.begin(), r.end(), 0);
while (k) {
if (k & 1) r = gao(r, pm);
pm = gao(pm, pm);
k >>= 1;
}
ans[0] = x[0];
for (int i = 0; i < n - 1; i++) {
double d = x[r[i]+1] - x[r[i]];
ans[i+1] = ans[i] + d;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << "\n";
}
return 0;
} | #include<vector>
#include<iostream>
using namespace std;
string solve(){
vector<int> a;
for(int i=0;i<3;i++){
int tmp;
cin>>tmp;
a.push_back(tmp);
}
for(int i=0;i<a.size();i++){
if(a[i]==100)return "A";
}
if(a[0]+a[1]>=90*2)return "A";
int ave = (a[0]+a[1]+a[2])/3;
if(ave>=80)return "A";
if(ave>=70)return "B";
if(ave>=50)if(a[0]>=80||a[1]>=80)return "B";
return "C";
}
int main(){
int n;
while(cin>>n,n!=0){
for(int i=0;i<n;i++){
cout<<solve()<<endl;
}
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int w;
cin >> w;
int i=0;
while(i<s.length()){
cout << s[i];
i += w;
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int main(){
// 1. 入力情報.
char c[2020];
int w;
scanf("%s %d", c, &w);
// 2. 文字を連結.
string ans = "";
int l = strlen(c);
rep(i, l) if(i % w == 0) ans.pb(c[i]);
// 3. 出力.
printf("%s\n", ans.c_str());
return 0;
} | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
string v;
cin >> N >> v;
vector<int> e(N+1, 0);
vector<int> w(N+1, 0);
REP(i, N) {
if (v[i] == 'W') {
w[i+1] = w[i] + 1;
e[i+1] = e[i];
} else {
e[i+1] = e[i] + 1;
w[i+1] = w[i];
}
}
int ans = N;
for(int i = 1; i <= N; i++) {
if (i == 0) {
ans = min(ans, e[N] - e[i]);
} else if (i == N) {
ans = min(ans, w[N-1]);
} else {
ans = min(ans, w[i-1] + (e[N] - e[i]));
}
}
cout << ans << endl;
return 0;
} | //
// Created by hide on 2020/05/15.
//
//参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
//インクルード(アルファベット順,bits/stdc++.hは使わない派閥)
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<iterator>//集合演算(積集合,和集合,差集合など)
#include<map>//map(辞書)
#include<numeric>//iota(整数列の生成),gcdとlcm(c++17)
#include<queue>//キュー
#include<set>//集合
#include<stack>//スタック
#include<string>//文字列
#include<unordered_map>//イテレータあるけど順序保持しないmap
#include<unordered_set>//イテレータあるけど順序保持しないset
#include<utility>//pair
#include<vector>//可変長配列
using namespace std;
typedef long long ll;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
//xにはvectorなどのコンテナ
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 //10^12:極めて大きい値,∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange(素数列挙などで使用)
//略記
//#define PB push_back //vectorヘの挿入
//#define MP make_pair //pairのコンストラクタ
//#define F first //pairの一つ目の要素
//#define S second //pairの二つ目の要素
int main(){
int N;
string S;
cin >> N;
cin >> S;
int r=0;
for(int i=1; i<N; i++) {
if (S[i] == 'E')
r++;
}
int answer = r;
int l = S[0] == 'W' ? 1:0;
for(int i=1; i<N; i++){
if(S[i]=='E')
r--;
answer = min(answer, l+r);
if(S[i]=='W')
l++;
}
cout << answer << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main(){
ll n;cin >>n;
ll o;cin >>o;
bool flg=true;
if(o!=0){
flg=false;
}
map<ll,ll>co;
co[0]++;
for (int i = 0; i < n - 1; ++i) {
ll d;
cin >> d;
co[d]++;
}
ll ans=1;
ll c=1;
for(int i=1;;i++){
if(co[i]==0)break;
c+=co[i];
for (int j = 0; j < co[i]; ++j) {
ans*=co[i-1];
ans%=998244353;
}
// cout <<ans <<endl;
}
if(c!=n)flg=false;
if(co[0]>1)flg=false;
if(flg){
cout <<ans<<endl;
}
else {
cout <<0<<endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
typedef long double ld;
//typedef pair<int,int> P;
//ll const INF=1001001001;
//ll const INF=1001001001001001001;
ll const MOD=998244353;
ll mpow(ll x,ll n){
if(n==0) return 1;
else if(n%2) return x*mpow(x,n-1)%MOD;
return mpow(x*x%MOD,n/2)%MOD;
}
ll N;
ll D[100000];
ll cnt[100000];
int main(){
cin>>N;
rep(i,N) cin>>D[i];
if(D[0]!=0){
cout<<0<<endl;
return 0;
}
ll maxi=0;
rep(i,N) maxi=max(maxi,D[i]);
rep(i,N) cnt[D[i]]++;
if(cnt[0]!=1){
cout<<0<<endl;
return 0;
}
ll ans=1;
rep(i,maxi){
ans*=mpow(cnt[i],cnt[i+1]);
ans%=MOD;
}
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W, B = 0;
cin >> H >> W;
vector<int> color(H * W);
vector<vector<int>> grid(H * W);
for (int i = 0; i < H; i++) {
string S;
cin >> S;
for (int j = 0; j < W; j++) {
color.at(i * W + j) = S.at(j);
if (S.at(j) == '#') {
B++;
}
}
}
for (int i = 0; i < H * W; i++) {
if (color.at(i) == '#') {
continue;
}
if (i >= W) {
if (color.at(i - W) == '.') {
grid.at(i).push_back(i - W);
}
}
if (i < W * (H - 1)) {
if (color.at(i + W) == '.') {
grid.at(i).push_back(i + W);
}
}
if (i % W != 0) {
if (color.at(i - 1) == '.') {
grid.at(i).push_back(i - 1);
}
}
if (i % W != W - 1) {
if (color.at(i + 1) == '.') {
grid.at(i).push_back(i + 1);
}
}
}
vector<int> dist(H * W,-1);
queue<int> que;
que.push(0);
dist.at(0) = 0;
while(!que.empty()) {
int v = que.front();
que.pop();
for (int i = 0; i < (int) grid.at(v).size(); i++){
int nv = grid.at(v).at(i);
if (dist.at(nv) != -1 && dist.at(nv) <= dist.at(v) + 1) {
continue;
}
dist.at(nv) = dist.at(v) + 1;
que.push(nv);
}
}
if (dist.at(H * W - 1) != -1) {
cout << H * W - B - 1 - dist.at(H * W - 1) << endl;
}
else {
cout << -1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll h,w;
cin >> h >> w;
char c[h][w];
ll dist[h][w];
ll ans=0;
rep(i,h){
rep(j,w){
cin >> c[i][j];
dist[i][j]=-1;
if(c[i][j]=='.'){
ans++;
}
}
}
queue<pair<ll,ll>> que;
que.push(make_pair(0,0));
int x[4]={1,0,-1,0};
int y[4]={0,1,0,-1};
dist[0][0]=0;
while(!que.empty()){
auto p=que.front();
ll cpx=p.first;
ll cpy=p.second;
que.pop();
for(int k=0;k<4;k++){
int xx=cpx+x[k];
int yy=cpy+y[k];
if(xx<0 || xx>=h || yy>=w || yy<0 || c[xx][yy]=='#'){
continue;
}
if(dist[xx][yy]!=-1){
continue;
}
dist[xx][yy]=dist[cpx][cpy]+1;
que.push(make_pair(xx,yy));
}
}
if(dist[h-1][w-1]==-1){
cout << -1;
return 0;
}
cout << ans-1-dist[h-1][w-1];
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.