code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f
int max(int x,int y)
{
return x>y?x:y;
}
int min(int x,int y)
{
return x<y?x:y;
}
int d[110][110];
void floyd(int n)
{
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
d[i][j]=min(d[i][j],(d[i][k]+d[k][j]));
}
}
}
}
void into(int n)
{
memset(d,INF,sizeof(d));
for(int i=0;i<n;i++)
d[i][i]=0;
}
int main()
{
int n,m;
int a,b,k;
while(~scanf("%d",&n),n)
{
into(12);
m=0;
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&k);
d[a][b]=d[b][a]=k;
m=max(max(a,b),m);
}
floyd(m+1);
int minn=INF;
int kase;
for(int i=0;i<=m;i++)
{
int ans=0;
for(int j=0;j<=m;j++)
{
ans+=d[i][j];
}
if(ans<minn)
{
minn=ans;
kase=i;
}
}
printf("%d %d\n",kase,minn);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(int i=0;i<10;i++){
int msk=1<<i;
if((in&msk)!=0){
res++;
}
}
return res;
}
template<typename T>
void show2dVector(vector<vector<T>>& v){
for(int i=0;i<v.size();i++){
int m=v[i].size();
cout<<i<<" : ";
for(int j=0;i<m;i++){
cout<<v[i][j]<<" ";
}
cout<<endl;
}
}
void bfs(const vector<vector<int>>&g, int v, vector<bool>& seen){
seen[v]=true;
cout<<v<<" ";
for(auto next: g[v]){
if(seen[next]){
continue;
}
bfs(g,next,seen);
}
}
bool dfs(vector<vector<int>> &g,int start,int goal,vector<bool>&seen){
bool res=false;
seen[start]=true;
if(start==goal){
return true;
}
for(auto next: g[start]){
if(seen[next]){
continue;
}
res=dfs(g,next,goal,seen);
if(res){
break;
}
}
return res;
}
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b) {
return a*b/gcd(a,b);
}
bool isLowerCase(char c){
return (c>='a'&&c<='z');
}
const string outputYesNo(bool ans){
return (ans?"Yes":"No");
}
int main() {
string a,b,c;cin>>a>>b>>c;
string ans="aaa";
ans[0]=a[0]+'A'-'a';
ans[1]=b[0]+'A'-'a';
ans[2]=c[0]+'A'-'a';
cout<<ans<<endl;
return 0;
}
| 0 | 86,290,991 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
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 long long INF = 1LL << 60;
#define PI 3.14159265359
bool dp[100100];
int main () {
int N; string S;
cin >> N >> S;
long long r =0, g =0, b = 0;
for(auto c : S){
if(c == 'R') ++r;
else if(c == 'G') ++g;
else ++b;
}
long long all = r*g*b;
long long sub =0;
for(int i = 0; i<N; ++i){
for(int j =i+1; j<N; ++j){
if(S[i]== S[j])continue;
int k =j*2-i;
if(k>=N || S[k] == S[i]|| S[k]== S[j])continue;
++sub;
}
}
cout << all-sub << endl;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
bool G[10][10];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
G[a][b] = G[b][a] = true;
}
vector<int> ord(N);
for (int i = 0; i < N; ++i) {
ord[i] = i;
}
int res = 0;
do {
if (ord[0] != 0) break;
bool ok = true;
for (int i = 0; i < N-1; ++i) {
int from = ord[i];
int to = ord[i+1];
if (!G[from][to]) {
ok = false;
}
}
if (ok) {
++res;
}
} while (next_permutation(ord.begin(), ord.end()));
cout << res << endl;
}
| 0 | 57,101,656 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
long a,b;
cin >> a>>b;
long ans;
if(a==1||b==1){
ans=max(1LL,a-2LL)*max(1LL,b-2LL);
}
else{
ans=max(0LL,a-2LL)*max(0LL,b-2LL);
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define endl "\n"
#define M_PI 3.14159265358979323846
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define fix_prec cout.setf( std::ios::fixed, std:: ios::floatfield ); cout.precision(9);
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int,int>>
#define pb(v,x) v.push_back(x)
#define pii pair<int,int>
#define mp(a,b) make_pair(a,b)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
lli const mod = 1e9+7;
lli const modl = 1e18;
lli gcd(lli x, lli y)
{
if (y == 0)
return x;
return gcd(y, x % y);
}
lli fib(int n)
{
lli a,b,c,i;
a=0,b=1;
if(n == 0)
return a;
for(i=2;i<=n;i++)
{
c=a+b;
a=b;
b=c;
}
return b;
}
bool isprime(lli n)
{
if(n<=1)
return false;
else if(n==2)
return true;
else if(n%2==0)
return false;
else
{
int i;
for(i=3;i*i<=n;i++)
{
if(n%i==0)
return false;
}
return true;
}
}
void readwrite()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
vector<lli>prime(100000+7,1);
void buildprime(lli n)
{
lli i,j;
prime[0]=prime[1]=0;
for(i=2;i*i<=n;i++)
{
if(prime[i])
{
for(j=i*i;j<=n;j+=i)
prime[j]=0;
}
}
}
lli dp[1005][1005];
lli comb[1005][1005];
lli ncr(lli n,lli r)
{
if(n==r)
return 1;
if(r==0)
return 1;
if(r==1)
return n;
if(dp[n][r]!=0)
return dp[n][r];
return dp[n][r] = (ncr(n-1,r)%mod+ncr(n-1,r-1)%mod)%mod;
}
void ncrm()
{
comb[0][0]=1;
for(int i=1;i<1001;i++)
{
comb[i][0]=1;
for(int j=1;j<=i;j++)
{
comb[i][j]=(comb[i-1][j]%mod+comb[i-1][j-1]%mod)%mod;
}
}
}
lli binpowm(lli a,lli b)
{
lli res=1;
a%=mod;
while(b)
{
if(b&1)
res=((res%mod)*(a%mod))%mod;
a=((a%mod)*(a%mod))%mod;
b>>=1;
}
return res%mod;
}
lli fact(lli n)
{
lli i,res=1;
for(i=1;i<=n;i++)
res=((res%mod)*(i%mod))%mod;
return res%mod;
}
void solve()
{
string s;
cin>>s;
lli n,i,sum=0;
n=s.length();
vector<lli> a(n+1,0);
for(i=0;i<n;i++)
{
if(s[i]=='<')
{
if(a[i]<a[i+1])
continue;
else
a[i+1]=a[i]+1;
}
else
{
if(a[i]>a[i+1])
continue;
else
a[i]=a[i+1]+1;
}
}
for(i=n-1;i>=0;i--)
{
if(s[i]=='>')
{
if(a[i]>a[i+1])
continue;
else
a[i]=a[i+1]+1;
}
else
{
if(a[i]<a[i+1])
continue;
else
a[i+1]=a[i]+1;
}
}
for(i=0;i<n+1;i++)
sum+=a[i];
cout<<sum;
}
int main()
{
fast_io;
fix_prec;
int t=1;
while(t--)
{
solve();
cout<<endl;
}
return 0;
}
| 0 | 94,094,045 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int d, A;
int sunuke[N] = {0};
for (int i = 0; i < K; i++) {
cin >> d;
for (int j = 0; j < d; j++) {
cin >> A;
sunuke[A - 1]++;
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (sunuke[i] == 0) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
int main(void){
long long N, ans=0;
std::cin >> N;
std::vector<long long> A(N + 1);
for (int i=0; i<N+1; ++i){
std::cin >> A.at(i);
}
for (int i=0; i<N; ++i){
long long b, tmp;
std::cin >> b;
tmp = A.at(i) - b;
if (tmp < 0){
ans += A.at(i);
if (A.at(i + 1) + tmp < 0){
ans += A.at(i + 1);
A.at(i + 1) = 0;
} else {
ans += -tmp;
A.at(i + 1) += tmp;
}
} else {
ans += b;
}
}
std::cout << ans << std::endl;
return 0;
}
| 0 | 1,909,420 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vvi = vector<vi>;
using vc = vector<char>;
using vs = vector<string>;
using vpii = vector<pii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
constexpr int dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0};
template<typename A, typename B> bool cmin(A &a, const B &b) { if (a > b) { a = b; return true; } else return false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { if (a < b) { a = b; return true; } else return false; }
namespace fpl {
template<typename V, typename F> constexpr V fmap(V v, const F &f) { transform(all(v), v.begin(), f); return v; }
template<typename V, typename F> constexpr V filterNot(V v, const F &f) { v.erase(remove_if(all(v), f), v.end()); return v; }
template<typename V, typename F> constexpr V filter(V v, const F &f) { return filterNot(v, [&](typename V::value_type x) { return !f(x); }); }
template<typename X, typename V, typename F> constexpr X fold(const X &x, const V &v, const F &f) { return accumulate(all(v), x, f); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V, typename F> constexpr bool andall(const V &v, const F &f) { for (auto &p : v) if (!f(p)) return false; return true; }
template<typename V, typename F> constexpr bool orany(const V &v, const F &f) { for (auto &p : v) if(f(p)) return true; return false; }
constexpr int gcd(int a, int b) { int c = 0; while (a) { c = a; a = b % a; b = c; } return b; }
constexpr int pows(int a, int b) { int c = 1; while (b) { if (odd(b)) c *= a; b >>= 1; a *= a; } return c; }
}
using namespace fpl;
main {
int h, w;
cin >> h >> w;
rep(i, h) rep(j, w) {
string s;
cin >> s;
if (s == "snuke") {
cout << char(j + 'A') << i + 1 << endl;
bye;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[100005]={0};
int main(){
ll n;
cin>>n;
vector<ll> vec,cos,cnt,pos;
vec.push_back(0);
cos.push_back(0);
cnt.push_back(0);
pos.push_back(0);
ll max_val=0;
for(int i=1;i<=n;i++){
ll a;
cin>>a;
if(a>max_val) {
vec.push_back(a);
cos.push_back(0);
cnt.push_back(0);
pos.push_back(i);
max_val=a;
}
int pos=lower_bound(vec.begin(),vec.end(),a)-vec.begin();
cnt[pos-1]++;
cos[pos]+=a-vec[pos-1];
}
ll k=vec.size();
for(int i=k-1;i>0;i--){
cnt[i-1]+=cnt[i];
}
for(int i=1;i<k;i++){
ans[pos[i]]=(vec[i]-vec[i-1])*cnt[i]+cos[i];
}
for(int i=1;i<=n;i++) cout<<ans[i]<<endl;
}
| 0 | 42,198,573 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A,B;
cin>>A>>B;
int ans=(A-1)*(B-1);
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n;
cin>>n;
cout<< n*n;
return 0;
}
| 0 | 41,636,990 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, M;
cin >> N >> M;
map<int, vector<pair<int, int>>> city_map;
int p, y;
for ( int i=0; i<M; i++ ) {
cin >> p >> y;
city_map[p].push_back(make_pair(y, i));
}
vector<pair<int, int>> ans(M);
int pref, original_idx;
vector<pair<int, int>> cities;
for ( pair<int, vector<pair<int, int>>> itr : city_map ) {
pref = itr.first;
cities = itr.second;
sort(cities.begin(), cities.end());
for ( int i=0; i<(int)cities.size(); i++ ) {
original_idx = cities.at(i).second;
ans[original_idx] = make_pair(pref, i + 1);
}
}
for ( int i=0; i<M; i++ )
printf("%06d%06d\n", ans.at(i).first, ans.at(i).second);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n; cin >> n;
vi v(n + 2), jf(n + 2, n + 1), jf2(n + 2, n + 1), jb(n + 2, 0), jb2(n + 2, 0);
rep(i, 1, n + 1) cin >> v[i];
{
set<int> indices;
set<int, greater<int>> indices_dec;
vector<pair<int, int>> prs;
rep(i, 1, n + 1) prs.push_back({ v[i], i });
sort(all(prs)); reverse(all(prs));
for (auto p : prs) {
{
auto it = indices.upper_bound(p.second);
if (it != indices.end()) {
jf[p.second] = *it;
++it;
if (it != indices.end()) {
jf2[p.second] = *it;
}
}
}
{
auto it = indices_dec.upper_bound(p.second);
if (it != indices_dec.end()) {
jb[p.second] = *it;
++it;
if (it != indices_dec.end()) {
jb2[p.second] = *it;
}
}
}
indices.insert(p.second);
indices_dec.insert(p.second);
}
}
ll ans = 0;
rep(i, 1, n + 1) {
ll p = 0;
p += 1ll * (jb[i] - jb2[i]) * (jf[i] - i);
p += 1ll * (i - jb[i]) * (jf2[i] - jf[i]);
ans += 1ll * p * v[i];
}
cout << ans << endl;
}
| 0 | 31,763,021 |
#include <iostream>
int main() {
int n, i;
std::cin >> n >> i;
std::cout << n - i + 1 << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef vector<ll> vi;
const int MOD = 1000000007;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x, y, z;
if (a >= b){
x = a - b;
}
else if(a<b){
x = b - a;
}
if(b>=c){
y = b - c;
}
else if(b<c){
y = c - b;
}
if(a>=c){
z = a - c;
}
else if(a<c){
z = c - a;
}
bool ans = false;
if(z<=d){
ans = true;
}
else if(z>d){
if(y<=d&& x<=d){
ans = true;
}
}
if(ans){
print("Yes");
}
else{
print("No");
}
}
| 0 | 95,420,119 |
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <stack>
#include <string>
#include <algorithm>
#include <set>
#include <sstream>
#include <bit>
#include <bitset>
#include <cstdint>
#include <iomanip>
#include <queue>
#include <initializer_list>
#include <stdio.h>
typedef long long int ll;
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<ll>data(N);
ll ans = 0;
for (int i = 0; i < N; i++)cin >> data[i];
sort(data.begin(), data.end());
reverse(data.begin(), data.end());
if (K >= N) {
cout << 0 << endl;
}
else {
data.erase(data.begin(),data.begin()+K);
for (int i = 0; i < data.size(); i++)ans += data[i];
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string x,y;
cin>>x>>y;
int l=x.length(),m=y.length(),j;
if(l<m) cout<<"LESS"<<endl;
else if(l>m) cout<<"GREATER"<<endl;
else{
for(j=0;j<l;j++){
if(x.at(j)<y.at(j)){
cout<<"LESS"<<endl;
break;
}
else if(x.at(j)>y.at(j)){
cout<<"GREATER"<<endl;
break;
}
}
if(j==l) cout<<"EQUAL"<<endl;
}
}
| 0 | 57,278,630 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int gcd(int a,int b){
int temp;
while(b!=0){
temp=a;
a=b;
b=temp%b;
}
return a;
}
int main(){
int n,k; cin>>n>>k;
vector<int> a(n,0);
rep(i,n) cin>>a[i];
sort(al(a));
int GCD=a[0];
rep(i,n-1) GCD=gcd(GCD,a[i+1]);
if(k<=a.back() && k%GCD==0)
cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b){
if( a < b ) swap(a,b);
if(a%b == 0) return b;
else return gcd(b,a%b);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a[i];
int ans = a[0];
for(int i = 1; i < n; ++i){
ans = gcd(ans, a[i]);
}
cout << ans << endl;
return 0;
}
| 0 | 91,477,962 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<string> divide={"maerd","remaerd","esare","resare"};
reverse(S.begin(),S.end());
bool can=true;
for(int i=0;i<S.size();){
bool can2=false;
for(int j=0;j<4;j++){
string d=divide.at(j);
if(S.substr(i,d.size())==d){
can2=true;
i+=d.size();
}
}
if(!can2){
can=false;
break;
}
}
if(can){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K; cin >> N >> K;
vector<ll> P(N), C(N);
for (auto& x: P) cin >> x, x--;
for (auto& x: C) cin >> x;
ll res = -1e18;
for (int i = 0; i < N; i++) {
vector<ll> sum;
ll t = 0;
int idx = i;
do {
t += C[idx];
sum.push_back(t);
idx = P[idx];
} while (idx - i);
for (int j = 0; j < min<int>(K, sum.size()); j++) res = max(res, sum[j]);
ll sz = sum.size();
for (int j = 0; j < sz; j++) {
if (j < K % sz) {
res = max(res, K / sz * sum.back() + sum[j]);
} else {
int cnt = K / sz - 1;
if (cnt < 0) break;
res = max(res, cnt * sum.back() + sum[j]);
}
}
}
cout << res << endl;
}
| 0 | 44,038,790 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(void)
{
int n;
char sti[21];
scanf("%s",sti);
n=strlen(sti);
for(int i=n-1;i>=0;i--){
cout<<sti[i];
}
cout<<"\n";
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int q;
ll solve(ll a,ll b){
ll ans;
ll s=ll(sqrt(a*b));
ans=2*s-1;
if(s*(s+1)>=a*b)ans--;
if(s*s==a*b&&a!=b)ans--;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>q;
rep(i,q)
{
ll a,b;
cin>>a>>b;
cout<<solve(a,b)<<endl;
}
return 0;
}
| 0 | 9,594,471 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
ll n = 0, k;
bool result = true;
while(n < S.length() && result) {
ll k = S.length() - n;
if(k >= 5) {
string sClip = S.substr(n, 5);
if(sClip == "dream") {
n += 5;
if(k >= 7 && S.substr(n, 2) == "er") {
n += 2;
if(k >= 8 && S[n] == 'a') {
n -= 2;
}
}
} else if(sClip == "erase") {
n += 5;
if(k >= 6 && S[n] == 'r') {
n += 1;
}
} else {
result = false;
}
} else {
result = false;
}
}
if(result) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
ll gcdf(ll a, ll b)
{
if(a < b) swap(a,b);
while(a%b){
ll tmp = a%b;
a = b;
b = tmp;
}
return b;
}
int main()
{
ll i,j;
ll n,k;
cin >> n >> k;
ll tmp;
ll m = 0;
cin >> tmp;
m = max(m,tmp);
for(i = 1;i < n;++i){
ll a;
cin >> a;
m = max(m, a);
tmp = gcdf(tmp, a);
}
if(k > m || k%tmp) cout << "IMPOSSIBLE" << endl;
else cout << "POSSIBLE" << endl;
return 0;
}
| 0 | 87,479,960 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, d, x;
int tmp;
cin >> r >> d >> x;
rep(i, 10) {
int tmp = x;
x = r * x - d;
cout << x << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, M;
ll prev = 0;
map<ll, ll> B;
ll count = 0;
cin >> N >> M;
B[0]++;
rep(i, N) {
ll temp;
cin >> temp;
temp += prev;
B[temp % M]++;
prev = temp;
}
iter(i, B) count += i.second * (i.second - 1) / 2;
cout << count << endl;
return 0;
}
| 0 | 1,123,474 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
const int MAX_N = 200005;
int N;
int A[MAX_N], B[MAX_N];
signed main()
{
cin >> N;
int cnt = 0;
int sumA = 0;
int minA = INF_INT_MAX;
int minB = INF_INT_MAX;
bool flag = true;
REP(i,N) {
cin >> A[i] >> B[i];
if(A[i] > B[i]) {
if(minB == INF_INT_MAX) {
minB = B[i];
} else if(minB > B[i]) {
minB = B[i];
}
}
if(A[i] != B[i]) {
flag = false;
}
}
if(flag) {
cout << 0 << endl;
return 0;
}
int ans = 0;
flag = true;
REP(i,N) {
if(B[i] == minB && flag) {
ans += A[i] - B[i];
flag = false;
} else {
ans += A[i];
}
}
cout << ans << endl;
return 0;
}
|
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
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;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s, t;
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> s >> t;
ans = LINF;
rep(i, Size(s) - Size(t) + 1) {
cnt = 0;
rrep(j, i, i + Size(t)) {
if (s[j] != t[j - i]) cnt++;
}
ans = min(ans, cnt);
}
Cout(ans);
return 0;
}
| 0 | 72,451,137 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main(){
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll>p(a), q(b), res, r;
rep(i, 0, a)cin >> p[i];
rep(i, 0, b)cin >> q[i];
rep(i, 0, c){
ll r2;
cin >> r2;
r.push_back(r2);
}
sort(p.begin(),p.end(),greater<ll>());
sort(q.begin(),q.end(),greater<ll>());
sort(r.begin(),r.end(),greater<ll>());
ll ans = 0;
rep(i, 0, x)res.push_back(p[i]);
rep(i, 0, y)res.push_back(q[i]);
rep(i, 0, c)res.push_back(r[i]);
sort(res.begin(),res.end(),greater<ll>());
rep(i, 0, x+y)ans += res[i];
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define vi vector<int>
#define pb push_back
#define i197 1000000007
#define MAX_N 200002
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<Pii,int> Piii;
const int inf=1000000000;
struct edge{
int myc,to,c,cost;
};
struct pos{
int to,cost,color;
};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int f[MAX_N]={};
int b[MAX_N]={};
int main() {
int r,d,x;
cin>>r>>d>>x;
rep(i,10){
x=r*x-d;
cout<<x<<endl;
}
return 0;
}
| 0 | 69,404,336 |
#include <cstdio>
#include <cmath>
long Parent(long i) {
return (long)floor((double)i / 2.0);
}
long Left(long i) {
return 2 * i;
}
long Right(long i) {
return (2 * i + 1);
}
int main() {
int H;
scanf("%d", &H);
long A[H];
for (int i=0; i<H; i++) scanf("%ld", &A[i]);
for (int i=0; i<H; i++) {
printf("node %d: key = %ld, ", i + 1, A[i]);
int p = Parent(i + 1) - 1;
int r = Right(i + 1) - 1;
int l = Left(i + 1) - 1;
if (0 <= p && p < H) printf("parent key = %ld, ", A[p]);
if (l < H) printf("left key = %ld, ", A[l]);
if (r < H) printf("right key = %ld, ", A[r]);
printf("\n");
}
}
|
#include<iostream>
#include<list>
#include<utility>
#include<algorithm>
using namespace std;
int main() {
list<int> L;
int n;
cin >> n;
pair<string,int> u;
for(int i=0;i<n;i++) {
cin >> u.first;
if (u.first[0] == 'i')
{
cin >> u.second;
L.push_front(u.second);
}
else if (u.first[6] == 'F')
{L.pop_front();
}
else if (u.first[6] == 'L')
{L.pop_back();
}
else if (u.first[0] == 'd')
{
cin >> u.second;
for (list<int>::iterator it = L.begin(); it != L.end(); it++){
if (*it==u.second) {L.erase(it); break;}
}
}
}
int i=0;
for (list<int>::iterator it = L.begin(); it != L.end(); it++){
if (i++) cout << " ";
cout << *it;
}
cout << endl;
return 0;
}
| 0 | 386,106 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int m=1e9;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
t=1;
while(t--)
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n<=k)
{
cout<<n*x<<endl;
}
else
{
cout<<(k)*x+(n-k)*y<<endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
template<typename T> inline string toString(const T &a){
ostringstream oss;
oss << a;
return oss.str();
};
int main(){
int N;
cin >> N;
vector<int> A(N),B(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
vector<bool> fixed(N,false);
fixed[0] = fixed[N-1] = true;
if(N == 1){
if(A[0] != B[0]){
cout << 0 << endl;
return 0;
}
}
for(int i=1; i<N-1; i++){
if(A[i-1] < A[i]){
if(A[i] > B[i]){
cout << 0 << endl;
return 0;
}
fixed[i] = true;
}
if(B[i] > B[i+1]){
if(B[i] > A[i]){
cout << 0 << endl;
return 0;
}
fixed[i] = true;
}
}
ll ans = 1;
for(int i=0; i<N; i++){
if(fixed[i]) continue;
if(A[i] > B[i]){
ans *= B[i];
}else{
ans *= A[i];
}
ans %= mod;
}
cout << ans << endl;
return 0;
}
| 0 | 96,290,060 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n;
cin >> n;
vpii ba(n);
rep(i, n) cin >> ba[i].second >> ba[i].first;
vpii cd(n);
rep(i, n) cin >> cd[i].first >> cd[i].second;
RSORT(ba); VSORT(cd);
int ans = 0;
rep(i, n) rep(j, n) {
int a = ba[j].second, b = ba[j].first;
int c = cd[i].first, d = cd[i].second;
if (a<c && b<d) {
++ans;
ba[j] = { INF, INF };
cd[i] = { 0, 0 };
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int start,end,number;
cin >> start >> end >> number ;
int counter=0;
for(int i=start ; i<=end ; i++ ){
if(number%i==0)
counter++;
}
cout << counter << endl;
return 0;
}
| 0 | 376,307 |
#include <bits/stdc++.h>
using namespace std;
long long k;
int main()
{
cin >>k;
printf("%d\n",50);
long long t1=k%50,t2=k/50;
for(int i=1;i<=t1;i++)
printf("%lld ",t2-t1+51+49);
for(int i=t1+1;i<=50;i++)
printf("%lld ",t2-t1+49); puts("");
return 0;
}
|
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define P pair<int, int>
# define mp make_pair
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; }
int main() {
int n; cin >> n;
vector<int> a(n), b(n);
int maxi = 0;
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(ALL(b)); reverse(ALL(b));
rep(i, n){
if(a[i]==b[0]) cout << b[1] << endl;
else cout << b[0] << endl;
}
}
| 0 | 36,720,513 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<vector<char>> S(2 * N, vector<char>(2 * N));
rep(i, N) {
rep(j, N) {
char c;
cin >> c;
S[i][j] = S[i + N][j] = S[i][j + N] = S[i + N][j + N] = c;
}
}
int res = 0;
for(int sy = 0; sy < N; sy++) {
int ok = 1;
for(int i = 0; i < N; i++) {
for(int j = i + 1; j < N; j++) {
if(S[sy + i][j] != S[sy + j][i])
ok = 0;
}
}
if(ok) {
res += N - sy;
}
}
for(int sx = 1; sx < N; sx++) {
int ok = 1;
for(int i = 0; i < N; i++) {
for(int j = i + 1; j < N; j++) {
if(S[i][sx + j] != S[j][sx + i])
ok = 0;
}
}
if(ok) {
res += N - sx;
}
}
cout << res << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> v1;
int main(){
int n,p,q;
int i,j,k;
int a,b,c;
int s=0;
while(cin>>n>>p>>q){
if(!n)break;
p--,q--;
v1.clear();
for(i=0;i<n;i++){
cin>>a;
v1.push_back(a);
}
sort(v1.rbegin(),v1.rend());
a=0;
for(i=p;i<=q;i++){
if(a<=v1[i]-v1[i+1]){
a=v1[i]-v1[i+1];
s=i+1;
}
}
cout<<s<<endl;
}
}
| 0 | 75,913,149 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int dp[100001];
int main(){
int n;
cin >> n;
for (int i = 0; i <= 100000; i++) dp[i] = MOD;
dp[0] = 0;
for (int i = 0; i <= 100001; i++){
if (dp[i] != MOD){
for (int j = 0; j <= 7; j++){
if (i + (int)pow(6, j) <= 100000){
dp[i+(int)pow(6, j)] = min(dp[i+(int)pow(6, j)], dp[i] + 1);
}
}
for (int j = 1; j <= 6; j++){
if (i + (int)pow(9, j) <= 100000){
dp[i+(int)pow(9, j)] = min(dp[i+(int)pow(9, j)], dp[i] + 1);
}
}
}
}
cout << dp[n] << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) c.begin(),c.end()
static const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
static const int MOD = (int)(1e9 + 7);
signed main() {
for (int n, x; cin >> n >> x&&n;) {
int cnt = 0;
rep(i, 1, n)rep(j, i + 1, n) {
int k = x - (i + j);
if (k > j&&k <= n)cnt++;
}
cout << cnt << endl;
}
return 0;
}
| 0 | 29,265,545 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
#include <cctype>
#include <bitset>
using namespace std;
int main(){
int n,i,j,p,A[9];
for(i = 0;i < 9;i++) cin >> A[i];
cin >> n;
for(i = 0;i < n;i++){
cin >> p;
for (j = 0; j < 9; j++){
if(A[j] == p) A[j] = -1;
}
}
if(A[0] == -1 && A[1] == -1 && A[2] == -1){
cout << "Yes" << endl;
}
else if (A[3] == -1 && A[4] == -1 && A[5] == -1){
cout << "Yes" << endl;
}
else if (A[6] == -1 && A[7] == -1 && A[8] == -1){
cout << "Yes" << endl;
}
else if (A[0] == -1 && A[3] == -1 && A[6] == -1){
cout << "Yes" << endl;
}
else if (A[1] == -1 && A[4] == -1 && A[7] == -1){
cout << "Yes" << endl;
}
else if (A[2] == -1 && A[5] == -1 && A[8] == -1){
cout << "Yes" << endl;
}
else if (A[0] == -1 && A[4] == -1 && A[8] == -1){
cout << "Yes" << endl;
}
else if (A[2] == -1 && A[4] == -1 && A[6] == -1){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include<iostream>
int main(void){
int H, W;
while(1){
std::cin >> H >> W;
if (H == 0 && W ==0) break;
for (int i = 1; i <= H; i++) {
if (i == 1 || i == H){
for (int j = 1; j <= W; j++) {
std::cout << '#';
}
std::cout << std::endl;
} else {
for (int j = 1; j <= W; j++) {
if (j == 1 || j == W) {
std::cout << '#';
} else {
std::cout << '.';
}
}
std::cout << std::endl;
}
}
std::cout << std::endl;
}
return 0;
}
| 0 | 28,346,481 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }
#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9
const int n = 10;
int h[n];
int main()
{
rep(i, n) cin >> h[i];
sort(h, h+n, greater<int>());
cout << h[0] << endl << h[1] << endl << h[2] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
const int P = 1e9+7;
#define fr(i,low,up,st) for(register int i = low;i <= up;i += st)
#define nfr(i,low,up,st) for(register int i = low;i >= up;i -= st)
#define clr(a) memset(a,0,sizeof a)
#define SZ(a) (a.size())
int n,m,k;
char ch[N];
int a[N];
int cnt;
int ans = 1;
int bc = 0,wc = 0;
int main(){
scanf("%d",&n);
scanf("%s",ch+1);
fr(i,1,2*n,1){
if(i%2 == 1 && ch[i] == 'B')a[i] = 1,++bc;
else if(i%2 == 0 && ch[i] == 'W')a[i] = 1,++wc;
else if(i%2 == 0 && ch[i] == 'B')a[i] = -1,--bc;
else a[i] = -1,--wc;
if(bc < 0 || wc < 0){
puts("0");
return 0;
}
}
if(bc || wc){
puts("0");
return 0;
}
fr(i,1,2*n,1){
cnt += a[i];
if(cnt < 0){
puts("0"); return 0;
}
if(a[i] == -1)ans = 1LL*ans*(cnt+1)%P;
}
if(cnt != 0)puts("0");
fr(i,1,n,1){
ans = 1LL*ans*i%P;
}
printf("%d\n",ans);
return 0;
}
| 0 | 87,800,780 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> v, ans, sum, memo;
map<long long, long long> mp;
void solve();
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
long long x;
cin >> x;
++mp[x];
}
solve();
for(int i = 0; i < n; ++i) cout << ans[i] << endl;
return 0;
}
void solve() {
ans.assign(n, 0);
for(auto now : mp) v.push_back(now.second);
sort(v.begin(), v.end());
sum = v;
long long vsize = v.size();
for(int i = 1; i < vsize; ++i) sum[i] += sum[i - 1];
memo.assign(n, 0);
for(int i = 0; i < n; ++i) {
auto it = lower_bound(v.begin(), v.end(), i + 1);
long long id = it - v.begin();
if(--id >= 0) memo[i] += sum[id];
memo[i] += (vsize - id - 1) * (i + 1);
memo[i] /= i + 1;
}
for(int i = 0; i < n; ++i) {
auto it = lower_bound(memo.begin(), memo.end(), i,
greater<long long>());
ans[i] = it - memo.begin();
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 1e18LL
const ll MAX = 1000000000000000000;
int main(){
int n; cin >> n;
vector<string> w(n);
bool exist = false;
rep(i, n){
cin >> w[i];
rep(j, i){
if(w[i] == w[j]){
exist = true;
}
}
}
if(exist){
cout << "No" << endl;
return 0;
}
for(int i = 1; i < n; i++){
string s1 = w[i-1];
char c1 = s1[s1.size()-1];
string s2 = w[i];
char c2 = s2[0];
if(c1 != c2){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0 | 12,260,250 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int n, k;
cin >> n >> k;
if(n % k == 0) cout << 0 << ln;
else cout << 1 << ln;
}
|
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vector<int> toposort(int n,vector<int> G[],int h[]){
stack<int> st;
vector<int> res;
for(int i=0;i<n;i++){
if(!h[i])st.push(i);
}
while(!st.empty()){
int id=st.top();
st.pop();
res.push_back(id);
for(auto e:G[id]){
h[e]--;
if(!h[e])st.push(e);
}
}
return res;
}
int main(){
int n,m;cin>>n>>m;
vector<int> G[10010];
int h[10010];
for(int i=0;i<m;i++){
int s,t;cin>>s>>t;
G[s].push_back(t);
h[t]++;
}
vector<int> ans=toposort(n,G,h);
for(auto e:ans){
cout<<e<<endl;
}
}
| 0 | 18,268,086 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin_popcountll(x)
#define f first
#define se second
#define inc(v,n,x) v.assign(n,x)
#define incd(v,n) v.resize(n)
#define iniz(n) memset(n,0,sizeof(n))
#define inin(n) memset(n,-1,sizeof(n))
#define inimi(n) memset(n,0xc0,sizeof(n))
#define inima(n) memset(n,0x3f,sizeof(n))
#define all(v) (v).begin(),(v).end()
using namespace std;
template<typename T1,typename T2>istream &operator>>(istream &is, vector<pair<T1,T2>> &v) { for (pair<T1,T2> &t : v) is >> t.f>>t.se; return is; }
template<typename T>istream &operator>>(istream &is, vector<T> &v) { for (T &t : v) is >> t; return is; }
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &t : v) {os << t <<" ";} os << '\n'; return os; }
const int N=200001;
double pi=acos(-1.0);
int md=1e9+7;
const int INF=1e15;
int dx1[]={0,0,-1,1};
int dy1[]={1,-1,0,0};
template<class T>
T abst(T a)
{return a<0?-a:a;}
void solve()
{
int x,y;cin>>x>>y;
int cnt=0;
while(x<=y)
{
cnt++;
x*=2;
}
cout<<cnt;
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int t=1;
for(int i=1;i<=t;i++)
{
solve();
}
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
while(n !=0 && k !=0){
int a;
int s[100010];
s[0]=0;
for(int i=0;i<n;i++){
cin >> a;
s[i+1]=s[i]+a;
}
int m=0;
for(int i=0;i<n-k;i++){
if(m < s[i+k]-s[i]){
m = s[i+k]-s[i];
}
}
cout << m << endl;
cin >> n >> k;
}
}
| 0 | 25,540,951 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define gap ' '
#define L(i) ((i) - (&i))
const int MAXN = 1e9+1;
const int MAX = 1e6 + 1;
const int MOD = 1e9;
const int INF = 1e9 + 5;
int main(){
int n,k,s; cin >> n >> k >> s;
vector<int> a;
for(int i = 0; i < k; ++i)
a.push_back(s);
while(a.size() < n){
int t = s+10;
t = t % MOD;
a.push_back(t);
}
for(int i = 0; i < n; ++i)
cout << a[i] << gap;
cout << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 998244353
#define INF LLONG_MAX/2
#define PI acos(-1.0)
typedef long long ll;
typedef pair<int,int> Pii;
typedef tuple<int,int,int> Tiii;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<Pii> VPii;
typedef vector<string> Vs;
typedef priority_queue<int> PQi;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
void vout(Vi &v){for(int i=0;i<(v).size();i++) cout<<v[i]<<" ";cout<<endl;}
void vout(Vs &v){for(int i=0;i<(v).size();i++) cout<<v[i]<<" ";cout<<endl;}
void vvout(VVi &v){for(int i=0;i<(v).size();i++) vout(v[i]);}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int digit(int k,int i){string s = to_string(k);return s[s.size()-i]-'0';}
void uniq(Vi &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end());}
int ctoi(char c){if(c>='0'&&c<='9'){return c-'0';}return 0;}
int leng(int n){string s=to_string(n); return s.size();}
int digitsum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}
int lesscount(int x,Vi &a){return lower_bound(a.begin(),a.end(),x)-a.begin();}
int orlesscount(int x,Vi &a){return upper_bound(a.begin(),a.end(),x)-a.begin();}
int morecount(int x,Vi &a){return a.size()-orlesscount(x,a);}
int ormorecount(int x,Vi &a){return a.size()-lesscount(x,a);}
int count(int x,Vi &a) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}
Vi accum(Vi &v){Vi ret((v).size()+1);REP(i,0,(v).size()) ret[i+1]=ret[i]+v[i];return ret;}
bool comp(Pii a,Pii b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
signed main(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);
int n;
cin>>n;
Vi d(n);
REP(i,0,n){
cin>>d[i];
if(i==0) if(d[i]!=0) {cout<<0<<endl;return 0;}
if(i!=0) if(d[i]==0) {cout<<0<<endl;return 0;}
}
int maxd=*max_element(ALL(d));
map<int,int> ma;
REP(i,0,n){
ma[d[i]]++;
}
int ans=1;
REP(i,0,maxd){
if(ma[i]==0){cout<<0<<endl;return 0;}
ans = (ans * mypow(ma[i],ma[i+1],MOD))%MOD;
}
cout<<ans<<endl;
return 0;
}
| 0 | 66,654,475 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 1000034000;
typedef vector<ll> vecl;
typedef vector<int> veci;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
uintmax_t combination(unsigned int n, unsigned int r)
{
if (r * 2 > n)
r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for (unsigned int i = 1; i <= r; ++i)
{
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vecl A(N);
vecl B(N);
map<ll, ll> M;
ll ans = 0;
for (int i = 0; i < N; i++)
{
cin >> A[i];
M[A[i]]++;
}
B = A;
sort(all(B));
for (auto iter = M.begin(); iter != M.end();iter++)
{
if(iter->second > 1)ans += combination(iter->second,2);
}
for (int i = 0; i < N;i++)
{
cout << ans - M[A[i]]+1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const int MAX = 1000000;
const int MOD = 1000000007;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
int n, k;
cin >> n >> k;
vector<ll>h(n);
if(n<k)k=n;
rep(i, 0, n)cin >> h[i];
sort(h.begin(),h.end(),greater<ll>());
ll ans = 0;
rep(i, 0, n){
if(k>0){
k--;
}else{
ans += h[i];
}
}
cout << ans << endl;
}
| 0 | 33,262,062 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define eb emplace_back
#define pi pair<int,int>
#define vp vector<pair<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod=1e9+7;
const string sp=" ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(12);
}
signed main(){
init();
run();
return 0;
}
void run(){
int n,k;
cin>>n>>k;
int m=(n-1)*(n-2)/2;
if(m<k){
cout<<-1<<endl;
return;
}
cout<<(n-1)+m-k<<endl;
REP(i,2,n)cout<<1<<sp<<i<<endl;
int cnt=m-k;
REP(i,2,n){
REP(j,i+1,n){
if(!cnt)return;
cout<<i<<sp<<j<<endl;
cnt--;
}
}
}
|
#include<stdio.h>
int main(){
int apel,potongan;
scanf("%d %d", &apel, &potongan);
int total=((apel*3)+potongan)/2;
printf("%d\n", total);
return 0;
}
| 0 | 82,131,746 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define mREP(i,a,b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll RepeatSquaring(ll N, ll P, ll M){
if(P==0) return 1;
if(P%2==0){
ll t = RepeatSquaring(N, P/2, M);
return t*t % M;
}
return N * RepeatSquaring(N, P-1, M);
}
int main(){
int n,m;
cin>>n>>m;
cout<<n-m+1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int dp[n-1]={0};
dp[0] = 0;
for(int i=1;i<n;i++){
dp[i] = INT_MAX;
int step_1, step_2;
if(i-1 >= 0){
dp[i] = min(dp[i], dp[i-1] + abs(a[i]-a[i-1]));
}
if(i-2 >= 0){
dp[i] = min(dp[i], dp[i-2] + abs(a[i]-a[i-2]));
}
}
cout << dp[n-1] << endl;
return 0;
}
| 0 | 76,266,838 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
int num = 111;
int x = 0;
for (int i = 1; i <= 9; i++) {
x = num * i;
if (x - n >= 0) {
break;
}
}
cout << x << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define FI freopen("input.txt", "r", stdin)
#define FO freopen("output.txt", "w", stdout)
#define FasterIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
#define mem(x,y) memset(x,y,sizeof(x));
#define pii pair<int,int>
#define mk make_pair
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define endl '\n'
const double PI = acos(-1.0);
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
int dx4[]= {+1, -1, +0, +0};
int dy4[]= {+0, +0, +1, -1};
#define isValid(a, b, R, C) (0 <= a && a < R) && (0 <= b && b < C)
int dx8[]= {+0, +0, +1, -1, -1, +1, -1, +1};
int dy8[]= {-1, +1, +0, +0, +1, +1, -1, -1};
int dr[] = {-1, 1, -2, -2, -1, 1, 2, 2};
int dc[] = {-2, -2, -1, 1, 2, 2, 1, -1};
void test_case()
{
int coin, value;
cin >> coin >> value;
string ans = "No";
if(500 * coin >= value)ans = "Yes";
cout << ans << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
#endif
int T = 1;
for(int tc = 1; tc <= T; ++tc)
{
test_case();
}
return 0;
}
| 0 | 91,492,240 |
#include <iostream>
using namespace std;
int main()
{
int A , B, C;
cin>>A>>B>>C;
if ( A != B && A!=C){
cout<< A<< endl;
}
else if (B!=A && B!=C){
cout<<B<< endl;
}
else {
cout << C<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
char key[10][6] = {
{},
{5, '.', ',', '!', '?', ' '},
{3, 'a', 'b', 'c'},
{3, 'd', 'e', 'f'},
{3, 'g', 'h', 'i'},
{3, 'j', 'k', 'l'},
{3, 'm', 'n', 'o'},
{4, 'p', 'q', 'r', 's'},
{3, 't', 'u', 'v'},
{4, 'w', 'x', 'y', 'z'}
};
int main(){
int N;
std::cin >> N;
while(N){
int row = 0;
int count = -1;
std::string str;
std::cin >> str;
for(int i = 0; i < (int)str.size(); i++){
int num = str[i] - '0';
if(num != 0){
row = num;
count++;
}else{
if(row != 0)
std::cout << key[row][ (count % key[row][0]) + 1 ];
row = 0;
count = -1;
}
}
std::cout << std::endl;
N--;
}
return 0;
}
| 0 | 16,780,157 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int i = 0; i < N; i++){
cin >> x[i];
}
int hantei;
for(int i = 0; i < M; i++){
cin >> y[i];
}
for(int i = X + 1; i <= Y; i++){
hantei = 1;
for(int j = 0; j < N; j++){
if(x[j] >= i){ hantei = 0; break;}
}
for(int k = 0; k < M; k++){
if(y[k] < i){ hantei = 0; break; }
}
if(hantei == 1){ cout << "No War" << endl; return 0; }
}
cout << "War" << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define int long long
#define problem ""
template<typename A, typename B, typename C>
struct triple{
A X;
B Y;
C Z;
triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0){
return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b){
if (a.X != b.X)
return a.X < b.X;
if (a.Y != b.Y)
return a.Y < b.Y;
return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p){
ofs << "( " << p.F << " , " << p.S << " )";
return ofs;
}
template<typename T>
void print(T a){
for (auto i : a)
cout << i << ' ';
cout << '\n';
}
template<typename T>
T max(T a, T b, T c){
return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c){
return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a){
return *min_element(all(a));
}
template<typename T, typename D>
D max(T a){
return *max_element(all(a));
}
struct custom_hash{
static uint64_t splitmix64(uint64_t x){
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const{
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void solve(){
int n; cin >> n;
int ans = 0;
rngi(i, n) ans += (i + 1) * (n - i);
rng(n - 1){
int x, y; cin >> x >> y;
if(x > y) swap(x, y);
ans -= x * (n - y + 1);
}
cout << ans << '\n';
};
signed main()
{
if(0){
freopen(problem".in", "r", stdin);
freopen(problem".out", "w", stdout);
}
srand(time(NULL));
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int t = 1;
rng(t) solve();
}
| 0 | 67,270,185 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<int>());
if (s < t)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
|
#pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n, a[maxn];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
ll ans = 0;
for(int i = 1; i <= n; i++) {
ans += a[i]/2;
a[i] &= 1;
if(a[i] && a[i+1]) ans++, a[i]--, a[i+1]--;
}
cout << ans;
}
| 0 | 76,961,795 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
vector<int> L;
int N, A, B, C;
const int INF = 1 << 30;
int rec(int index, int a, int b, int c)
{
if (N == index)
{
if (!a || !b || !c)
{
return INF;
}
else
{
return abs(A - a) + abs(B - b) + abs(C - c);
}
}
int res = rec(index + 1, a, b, c);
res = min(res, rec(index + 1, a + L[index], b, c) + (a ? 10 : 0));
res = min(res, rec(index + 1, a, b + L[index], c) + (b ? 10 : 0));
res = min(res, rec(index + 1, a, b, c + L[index]) + (c ? 10 : 0));
return res;
}
int main()
{
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++)
{
int l;
cin >> l;
L.push_back(l);
}
cout << rec(0, 0, 0, 0) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
int main() {
ll N;
cin >> N;
vector<ll>A(N), B(N);
rep(i, N) {
cin >> A[i] >> B[i];
}
ll count = 0;
for (ll i = N - 1; i >= 0; i--) {
A[i] += count;
if (A[i] % B[i] != 0) {
count += B[i] - (A[i] % B[i]);
}
}
cout << count;
return 0;
}
| 0 | 13,135,150 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
int main(){
long long N,T;
cin >> N >> T;
vector<long long> t(N,0);
long long sum=0;
for(long long i=0;i<N;i++){
cin >> t[i];
if(i==0){
sum+=0;
}
if(i>=1){
if((t[i]-t[i-1])<T){
sum+=t[i]-t[i-1];
}else{
sum+=T;
}
}
}
sum+=T;
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,int>>ans;
if(n%2==1){
for(int l=1,r=n-1;l<r;l++,r--){
ans.emplace_back(l,r);
}
}else{
bool flag=false;
for(int l=1,r=n-1;l<r;l++,r--){
if(!flag && r-l<=n/2){
--r;
flag=true;
}
ans.emplace_back(l,r);
}
}
for(int i=0;i<m;i++){
printf("%d %d\n",ans[i].first,ans[i].second);
}
return 0;
}
| 0 | 6,244,755 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
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; }
struct UnionFind{
vector<int> par;
UnionFind(int N) : par(N) {
for(int i=0; i<N; i++) par[i] = i;
}
int root(int x){
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y){
return root(x) == root(y);
}
};
int main(void){
int N,M; cin >> N >> M;
VI p(N), id2num(N);
REP(i,N){
cin >> p[i]; p[i]--;
id2num[p[i]] = i;
}
UnionFind uf(N);
REP(i,M){
int x,y; cin >> x >> y;
x--; y--;
uf.unite(x,y);
}
int ans = 0;
REP(i,N){
if(i == p[i]) ans++;
else if(uf.same(i,id2num[i])) ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
vector<string> str;
vector<string> sn;
for(int i=0; i<n; i++){
string s;
cin >> s;
str.push_back(s);
sn.push_back(s);
}
sort(str.begin(),str.end());
for(int i=0; i<str.size(); i++){
if(str[i]==str[i-1]){
cout << "No" <<endl;
return 0;
}
}
bool ans = false;
for(int i=1; i<sn.size(); i++){
int ind = sn[i-1].size()-1;
char first = sn[i][0];
char last = sn[i-1][ind];
if(first!=last){
cout << "No" <<endl;
return 0;
}else{
ans = true;
}
}
if(ans == true){
cout << "Yes" <<endl;
}
}
| 0 | 49,635,043 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e13;
int main()
{
ll N, K;
cin >> N >> K;
vector<vector<ll>> s(N);
for (int i = 0; i < N; i++)
{
ll t, d;
cin >> t >> d;
t--;
s[t].push_back(d);
}
for (auto &v : s)
{
sort(v.begin(), v.end(), greater<ll>());
if (v.empty())
v.push_back(-INF);
}
sort(s.begin(), s.end(), [](vector<ll> a, vector<ll> b) { return a[0] > b[0]; });
ll cur = 0;
priority_queue<ll> pq;
for (int i = 0; i < K; i++)
{
cur += s[i][0];
for (int j = 1; j < s[i].size(); j++)
pq.push(s[i][j]);
}
for (int i = K; i < N; i++)
for (int j = 0; j < s[i].size(); j++)
pq.push(s[i][j]);
ll ans = cur + K * K;
for (ll x = K - 1; x >= 1; x--)
{
ll v = s[x][0];
ll w = pq.top();
if (v < w)
{
pq.pop();
cur += w;
pq.push(v);
cur -= v;
ans = max(ans, cur + x * x);
}
else
{
break;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#define PI 3.1415926535897932384626433832795028841971
using namespace std;
int main(){
long long max,min,sum,sum2,num;
max = -1000001;
min = 1000001;
sum = 0;
sum2 = 0;
cin >> num;
for(int ii=0;ii<num;ii++){
int val;
cin >> val;
if(max < val){
max = val;
}
if(min > val){
min = val;
}
if( sum < 2000000000){
sum += val;
}
else{
sum2 += val;
}
}
cout << min << " " << max << " " << sum + sum2 << endl;
return 0;
}
| 0 | 81,221,332 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
const int MAXN = 2345;
const int MOD = (int)1e9 + 7;
int A[MAXN], B[MAXN];
int dp[MAXN][MAXN][3];
int main() {
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
for (int i = 1; i <= M; i++) scanf("%d", &B[i]);
for (int i = 0; i <= N; i++) dp[i][0][0] = 1;
for (int j = 0; j <= M; j++) dp[0][j][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
dp[i][j][1] = dp[i][j - 1][1];
dp[i][j][2] = dp[i - 1][j][2];
dp[i][j][0] = (dp[i - 1][j - 1][0] + dp[i][j][1]) % MOD;
dp[i][j][0] = (dp[i][j][0] + dp[i][j][2]) % MOD;
if (A[i] == B[j]) {
dp[i][j][1] = (dp[i][j][1] + dp[i - 1][j - 1][0]) % MOD;
dp[i][j][2] = (dp[i][j][2] + dp[i - 1][j - 1][0]) % MOD;
dp[i][j][0] = (dp[i][j][0] + dp[i - 1][j - 1][0]) % MOD;
}
}
}
printf("%d\n", dp[N][M][0]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct StronglyConnectedComponents
{
vector< vector< int > > gg, rg;
vector< pair< int, int > > edges;
vector< int > comp, order, used;
StronglyConnectedComponents(size_t v) : gg(v), rg(v), comp(v, -1), used(v, 0) {}
void add_edge(int x, int y)
{
gg[x].push_back(y);
rg[y].push_back(x);
edges.emplace_back(x, y);
}
int operator[](int k)
{
return (comp[k]);
}
void dfs(int idx)
{
if(used[idx]) return;
used[idx] = true;
for(int to : gg[idx]) dfs(to);
order.push_back(idx);
}
void rdfs(int idx, int cnt)
{
if(comp[idx] != -1) return;
comp[idx] = cnt;
for(int to : rg[idx]) rdfs(to, cnt);
}
void build(vector< vector< int > > &t)
{
for(int i = 0; i < gg.size(); i++) dfs(i);
reverse(begin(order), end(order));
int ptr = 0;
for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;
t.resize(ptr);
set< pair< int, int > > connect;
for(auto &e : edges) {
int x = comp[e.first], y = comp[e.second];
if(x == y) continue;
if(connect.count({x, y})) continue;
t[x].push_back(y);
connect.emplace(x, y);
}
}
};
void solve()
{
int V, E;
cin >> V >> E;
StronglyConnectedComponents scc(V);
for(int i = 0; i < E; i++) {
int s, t;
cin >> s >> t;
scc.add_edge(s, t);
}
vector< vector< int > > g;
scc.build(g);
vector< int > rev(V);
for(int i = 0; i < V; i++) rev[scc[i]] = i;
for(int i = 0; i < V; i++) cout << rev[i] << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 0 | 81,555,889 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int m = 0, f = 1, table[] = {1, 1};
string rep;
cout << "0\n"; cin >> rep;
if(rep == "Female") table[0] = f, table[1] = m;
else if(rep == "Male") table[0] = m, table[1] = f;
else return 0;
int s = 0, t = n;
for(int i=0; i<50; i++){
int mid = (s + t) / 2;
cout << mid << endl;
cin >> rep;
if(rep == "Female")
if(table[mid%2] == f) s = mid + 1;
else t = mid;
else if(rep == "Male")
if(table[mid%2] == m) s = mid + 1;
else t = mid;
else
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<string,ll> P;
void Main() {
ll n;
R n;
P a[n];
rep(i,n) cin >> a[i].F >> a[i].S;
string s;
R s;
int ans=0,f=0;
rep(i,n) {
if(f) ans+=a[i].S;
if(a[i].F==s) f=1;
}
pr(ans);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
| 0 | 8,640,456 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
int n = s.size();
bool ans = false;
rep(i, n){
rep(j, n){
if(j < i) continue;
if(s.substr(0, i)+s.substr(j) == "keyence") ans = true;
}
}
if(ans) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 100005
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll,ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
void test_case() {
int n , p;
cin>>n>>p;
string s;
cin>>s;
if( 10 % p == 0) {
ll ans = 0;
for(int i=n; i>=1; i--) {
ll val = s[i-1] - '0';
if(val % p == 0) {
ans+= i;
}
}
cout<<ans<<endl;
return;
}
ll ans = 0;
ll mul = 1;
vecl L(p+1, 0);
L[0] = 1;
ll r = 0;
for(int i=n-1; i>=0; i--) {
r = ((s[i] - '0') * mul + r) % p;
ans+= L[r];
L[r]++;
mul = (mul * 10) % p;
}
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed<<setprecision(20);
int t = 1;
while (t--)
{
test_case();
}
}
| 0 | 18,622,055 |
#include<iostream>
using namespace std;
int main(void){
int a,b,c = 0;
cin >> a >> b >> c;
int sum = a+b;
if(c > sum){
cout << "No";
}else
{
cout << "Yes";
}
}
|
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#include <random>
#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int (X) = (A);(X) <= (Y);++(X))
#define _rep2(X, Y) for (int (X) = 0;(X) < (Y);++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X, Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define all(X) (X).begin(),(X).end()
#define len(X) ((int)(X).size())
#define mod(n, m) (((n)%(m)+(m))%(m))
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
const int INFINT = 1 << 30;
const ll INFLL = 1LL << 60;
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_M = 200000;
int M;
int d[MAX_M];
ll c[MAX_M];
int main() {
cin >> M;
rep(i, M) cin >> d[i] >> c[i];
ll D = 0, S = 0;
rep(i, M) {
D += c[i];
S += d[i] * c[i];
}
cout << (D - 1) + (S - 1) / 9;
return 0;
}
| 0 | 15,066,687 |
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template <class T>
void read(T &x)
{
char ch;
for (ch=getchar();(ch<'0'||ch>'9')&&ch!='-';) ch=getchar();
x=0;int t=1;if (ch=='-') {ch=getchar();t=-1;}
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
x*=t;
}
int main()
{
#ifndef ONLINE_JUDGE
#endif
int n;scanf("%d",&n);
int k=1,s=1;
while (s<n)
{
k++;s+=k;
}
for (int i=k;i;i--)
if (n>=i) {printf("%d\n",i);n-=i;}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int d;
cin >> d;
if (d == 25)
cout << "Christmas" << endl;
else if (d == 24)
cout << "Christmas Eve" << endl;
else if (d == 23)
cout << "Christmas Eve Eve" << endl;
else if (d == 22)
cout << "Christmas Eve Eve Eve" << endl;
return 0;
}
| 0 | 37,738,310 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
typedef long long ll;
using namespace std;
const ll MOD = 998244353;
int N, D[100001];
ll C[100001];
int main() {
INCANT;
cin >> N;
rep(i, N) {
cin >> D[i];
C[D[i]]++;
}
ll ans = (C[0]>1 || D[0]!=0)?0ll:1ll;
for (int i=1; i<N; i++) {
ans*=C[D[i]-1];
ans%=MOD;
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int fact[9] = { 1, 1, 2, 6, 24, 120, 720, 5040, 40320 };
int order[9];
int n; cin >> n;
int porder = 0, qorder = 0;
for (int i = 0; i <= n; ++i) order[i] = i;
for (int i = 0; i < n; ++i) {
int a; cin >> a;
porder += fact[n - i - 1] * (order[a] - 1);
for (int j = a + 1; j <= n; ++j) --order[j];
}
++porder;
for (int i = 0; i <= n; ++i) order[i] = i;
for (int i = 0; i < n; ++i) {
int a; cin >> a;
qorder += fact[n - i - 1] * (order[a] - 1);
for (int j = a + 1; j <= n; ++j) --order[j];
}
++qorder;
cout << abs(porder - qorder) << endl;
}
| 0 | 1,343,958 |
#include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
for(auto &e:t) fill_v(e,v);
}
const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD) a -= MOD;
}
void mulM(long long &a, long long b) {
a = ((a%MOD)*(b%MOD))%MOD ;
}
const int MAX = 510000;
long long 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;
}
}
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;
}
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > 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;
}
bool g[101][101];
int main() {
ll N;
cin >> N;
ll sum = 0;
vector<ll> A(N);
REP(i, N) {
cin >> A[i];
sum += A[i];
}
if (sum % (N * (N + 1) / 2) != 0) {
cout << "NO" << endl;
return 0;
}
ll k = sum / (N * (N + 1) / 2);
vector<ll> d(N);
REP(i, N) {
if (i + 1 == N) d[i] = A[0] - A[i] - k;
else d[i] = A[i + 1] - A[i] - k;
}
bool ans = true;
REP(i, N) {
if(d[i] == 0) continue;
if(d[i] > 0 || (-d[i]) % N != 0) {
ans = false;
break;
}
}
if (ans) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
ll sum[N+1];
sum[0] =0;
ll canNotNum =0;
for(int i=0;i<N-1;i++){
sum[i+1] = sum[i] + A[i];
if(sum[i+1]*2 < A[i+1]){
canNotNum = (i+1);
}
}
cout << N- canNotNum << endl;
return 0;
}
| 0 | 38,120,966 |
#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
bool flag = false;
int begin;
for (begin = S.size() - T.size(); begin >= 0; --begin){
flag = true;
for (int j = 0; j < T.size(); ++j){
if(S[begin + j] != '?' && S[begin + j] != T[j]){
flag = false;
break;
}
}
if(flag) break;
}
if(!flag){
printf("UNRESTORABLE\n");
return 0;
}
for (int i = 0; i < begin; ++i){
if(S[i] == '?') S[i] = 'a';
}
for (int i = begin; i < begin + T.size(); ++i){
if(S[i] == '?') S[i] = T[i - begin];
}
for (int i = begin + T.size(); i < S.size(); ++i){
if(S[i] == '?') S[i] = 'a';
}
for (int i = 0; i < S.size(); ++i){
printf("%c", S[i]);
}
printf("\n");
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int main() {
int N, K;
cin >> N >> K;
cout << ((N%K==0)?0:1) << endl;
return 0;
}
| 0 | 20,670,988 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for(unsigned i = 0;i < moto;i ++){
S.insert(s[i]);
}
if(S.size() == moto)cout << "yes" << endl;
else cout << "no" << endl;
}
|
#include<stdio.h>
int main(void)
{
double f,e,x;
int a,b,d,r;
scanf("%d %d",&a,&b);
d=a/b;
r=a%b;
e=a;
x=b;
f=e/x;
printf("%d %d %1f",d,r,f);
return 0;
}
| 0 | 16,506,790 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
string s;
cin >> s;
string ans="Yes";
if(n%2==0){
rep(i, n/2){
if(s[i]!=s[n/2+i]){
ans = "No";
break;
}
}
}else{
ans = "No";
}
cout << ans << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define Cinint(n) int n;\
cin >> n;
#define Cinvecint(a, n) vector<int> a(n);\
for (int i = 0; i < (int)(n); i++) {\
int num;\
cin >> num;\
a.at(i) = num;\
}
#define Cinstring(s) string s;\
cin >>s;
int main() {
Cinint(k);
Cinint(a);
Cinint(b);
bool flag = true;
rep1(i, 1001) {
if (i%k == 0) {
if ((a <= i) && (i <= b)) {
cout << "OK" << endl;
flag = false;
break;
}
}
}
if (flag) {
cout << "NG" << endl;
}
}
| 0 | 90,032,429 |
#include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <vector>
#define REP(i,n) for(long long int i=0;i<n;i++)
#define P 1000000007
using namespace std;
long long int powmp(long long x,long long n){
const long long p = 1000000007;
if(n==0) return 1;
long long y = x%p;
if(n==1) return y;
long long tmp = (powmp(y,n/2))%p;
if(n%2==0) return (tmp*tmp)%p;
else return (powmp(y,n-1)*y)%p;
}
int main(long long int argc, char const *argv[])
{
long long int w,h;
priority_queue<long long int, vector<long long int>, greater<long long int> > pqw;
priority_queue<long long int, vector<long long int>, greater<long long int> > pqh;
long long int cw=0;
long long int ch=0;
long long int ans = 0;
cin >> w >> h;
REP(i,w){
long long int t;
cin >> t;
pqw.push(t);
}
REP(i,h){
long long int t;
cin >> t;
pqh.push(t);
}
REP(i,w+h){
if(pqh.empty()){
long long int t = pqw.top();
pqw.pop();
ans += t*(h+1-ch);
cw++;
}
else if(pqw.empty()){
long long int t = pqh.top();
pqh.pop();
ans += t*(w+1-cw);
ch++;
}
else if(pqw.top()<pqh.top()){
long long int t = pqw.top();
pqw.pop();
ans += t*(h+1-ch);
cw++;
}
else if(pqw.top()>pqh.top()){
long long int t = pqh.top();
pqh.pop();
ans += t*(w+1-cw);
ch++;
}
else{
long long int t = pqw.top();
pqw.pop();
ans += t*(h+1-ch);
cw++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
int t[102], v[102];
t[0] = 0;
for(int i = 0; i < n; i++){
cin >> t[i + 1];
t[i + 1] *= 2;
t[i + 1] += t[i];
}
for(int i = 0; i < n; i++){
cin >> v[i];
v[i] *= 2;
}
int b[50000];
for(int i = 0; i <= t[n]; i++) b[i] = min(i, t[n] - i);
for(int i = 0; i < n; i++){
for(int j = 0; j < t[i]; j++) b[j] = min(b[j], v[i] + t[i] - j);
for(int j = t[i]; j < t[i + 1]; j++) b[j] = min(b[j], v[i]);
for(int j = t[i + 1]; j <= t[n]; j++) b[j] = min(b[j], v[i] + j - t[i + 1]);
}
int ans = 0;
for(int i = 0; i < t[n]; i++) ans += b[i] + b[i + 1];
cout << fixed << setprecision(15) << ans / 8.0 << endl;
}
| 0 | 10,589,803 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod = MOD7;
void ERROR(int num) { cout << "ERROR" << num << endl; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
int M = 0;
rep(i,N) { cin >> A[i]; M=max(A[i],M); }
vector<int> check(M+5,0);
for(int x: A){
if(check[x]!=0){
check[x] = 2;
continue;
}
for(int i=x; i <= M+1; i+=x) check[i]++;
}
int ans = 0;
for(int x: A){
if(check[x]==1) ans++;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define rep0(i,n) for(ll i=0;i<n;i++)
#define rrep0(i, n) for(ll i=(ll)(n);i>0;--i)
#define rrep(i, a, b) for(ll i=(ll)(a);i>=(ll)(b);--i)
#define pb(z) push_back(z)
#define ff /first
#define ss second
#define caset int t;cin>>t;for(int tt=1;tt<=t;tt++)
#define sz(X) ((ll)(X).size())
#define scan(X) scanf("%s", (X))
#define ms(v,val) memset((v),(val),sizeof((v)))
#define ms0(X) memset((X), 0, sizeof((X)))
#define ms1(X) memset((X), -1, sizeof((X)))
#define m_p(a,b) make_pair(a,b)
#define get_pos(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define lcm(a,b) (a*b)/__gcd(a,b)
#define INF9 1000000010
#define INF18 4000000000000000010
#define bpll(a) __builtin_popcountll(a)
#define sqr(a) ((a)*(a))
#define nl "\n"
#define mod 1e9+7;
#define mx_el(v) *max_element(all(v));
#define mn_el(v) *min_element(all(v));
#define pcase(z,x) cout<<"Case "<<z<<": "<<x<<"\n"
const double pi = 2*acos(0) ;
#define display(v) vi :: iterator it;for(it=(v).begin();it!=(v).end();it++){cout << *it << " " ;}cout << endl;
#define taking(n,v) for(ll i=0;i<(n);i++){ll inp;cin>>inp;(v).push_back(inp);}
void start(){
#ifndef ONLINE_JUDGE
freopen("input.txt" , "r" , stdin) ;
freopen("output.txt" , "w" , stdout) ;
#endif
}
void solve()
{
ld w,h,x,y;cin>>w>>h>>x>>y;
cout << setprecision(10) << (w*h)/2.0 << " ";
w/=2,h/=2;
cout << (w==x&&h==y?"1":"0") << nl;
}
int main(){
fast_io
solve();
return 0;
}
| 0 | 43,644,445 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
while (true) {
cin >> h >> w >> n;
if (h + w == 0) return 0;
int sheet[20][20] = {};
while (n--) {
int x, y;
cin >> x >> y;
sheet[x][y] = 1;
}
int dp[20][20] = {};
dp[1][0] = 1;
for (int i = 1; i <= h; ++i) {
for (int j = 1; j <= w; ++j) {
if (sheet[i][j] == 1) continue;
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
cout << dp[h][w] << endl;
}
}
|
#if 0
accept?????????
40?????????????????£???
???????????¨??????????????¢?´¢???????????????????????????
???????????????????????????????????°????????????????????????
31-169584????????????????????????????????¨??£??????????????????????????£????????§????????????????????????????????????
#endif
#include <queue>
#include <iostream>
using namespace std;
int w,h;
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
char mat[100][100];
bool valid(int x,int y)
{
return (x>=0)&&(x<w)&&(y>=0)&&(y<h)&&(mat[x][y]!='#');
}
void bfs(int x,int y) {
int sum=1;
queue<pair<int,int> >Q;
pair<int,int>p;
p=make_pair(x,y);
Q.push(p);
while (! Q.empty()) {
pair<int,int> cur = Q.front();
Q.pop();
for (int i=0;i<4;i++) {
if (valid(cur.first+dx[i],cur.second+dy[i])) {
Q.push(make_pair(cur.first+dx[i],cur.second+dy[i]));
sum++;
mat[cur.first+dx[i]][cur.second+dy[i]]='#';
}
}
mat[cur.first][cur.second]='#';
}
cout<<sum<<endl;
}
int main() {
int x,y;
while(cin>>w>>h && w!=0){
for(int j=0;j<h;++j){
for(int i=0;i<w;++i){
cin >> mat[i][j];
if(mat[i][j]=='@'){
x=i,y=j;
}
}
}
bfs(x,y);
}
}
| 0 | 58,385,455 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " = " << x << endl
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
string s;
cin >> s;
if ( s[0] != 'A' ){
cout << "WA" << endl;
return 0;
}
int ichi,hantei = 0,count = 0;
for ( int i = 2; i < s.size() -1; i++){
if ( s[i] == 'C' ){
hantei = 1;
ichi = i;
count++;
}
}
if ( hantei == 0 || count >= 2 ){
cout << "WA" << endl;
return 0;
}
for ( int i = 1; i < s.size(); i++){
if ( i == ichi ){
continue;
}
if ( s[i] < 97 || s[i] > 122 ){
cout << "WA" << endl;
return 0;
}
}
cout << "AC" << endl;
}
|
#include<bits/stdc++.h>
#define sc(x) scanf("%lld",&x)
#define pcase(x) printf("Case %d: ",x++)
#define pn printf("\n")
#define fri(f) for(int i=0;i<f;i++)
#define frj(f) for(int j=0;j<f;j++)
#define reset(x,e) memset(x,e,sizeof(x))
#define all(x) x.begin(),x.end()
#define input freopen("input.txt","r",stdin);
#define output freopen("output.txt","w",stdout)
#define infi INT_MAX
#define m_v 3000000
#define pii pair<int,int>
#define pch pair<char,char>
#define pll pair<ll,ll>
#define mgraph map<int,vector<int> >
#define mp make_pair
#define pb push_back
#define clr(x) memset(x,0,sizeof(x))
#define frx(x,y) for(int x=0;x<y;x++)
#define ff first
#define ss second
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
bool checkbitt(ll num,int pos);
ll setbitt(ll num,ll pos);
ll resetbitt(ll num,int pos);
const ll mod = 1e9 + 7;
const ll N = 1e6 + 10;
int solve(){
int a,b;
cin>>a>>b;
if(a%3==0 || b%3==0 || (a+b)%3==0) cout<<"Possible";
else cout<<"Impossible";
cout<<endl;
return 0;
}
int main(){
#ifndef ONLINE_JUDGE
input;
output;
#endif
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(0);
#endif
int cs=1;
int cn=1;
while(cs--){
solve();
}
}
bool checkbitt(ll num,int pos){return (num>>pos) & 1;}
ll setbitt(ll num,ll pos){return (1<<pos) | num;}
ll resetbitt(ll num,int pos){if(!checkbitt(num,pos)) return num;else return (1<<pos)^num;}
| 0 | 54,390,819 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long LL ;
LL ans, sum, xorr ;
deque<LL> ar ;
void update(int n){
while(true){
if((sum + n) == (xorr ^ n))
break ;
sum -= ar.front() ;
xorr ^= ar.front() ;
ar.pop_front() ;
}
sum += n ;
xorr ^= n ;
ar.push_back(n) ;
ans += (LL)ar.size() ;
}
int main(){
LL n, a ;
cin >> n ;
while(n--){
cin >> a ;
update(a) ;
}
cout << ans << endl ;
return 0;
}
|
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for(ll i = 2; i * i <= n; i++) {
if(n % i)
continue;
res.emplace_back(i, 0);
while(n % i == 0) {
n /= i;
res.back().second++;
}
}
if(n != 1)
res.emplace_back(n, 1);
return res;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
const ll INF = LONG_MAX;
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;
}
using Graph = vector<vector<int>>;
vector<bool> seen;
void dfs(const Graph &g, int v) {
seen[v] = true;
for(auto next_v : g[v]) {
if(seen[next_v])
continue;
dfs(g, next_v);
}
}
struct node {
int to, weight;
};
using Edge = vector<node>;
void addEdge(bool directed, Edge *edges, int u, int v, int wt) {
edges[u].push_back({v, wt});
if(!directed) {
edges[v].push_back({u, wt});
}
}
int pre_node[100000];
void zeroOneBFS(Edge *edges, vector<int> &dist, int src) {
for(int i = 0; i < dist.size(); i++)
dist[i] = INT_MAX;
deque<int> Q;
dist[src] = 0;
Q.push_back(src);
while(!Q.empty()) {
int v = Q.front();
Q.pop_front();
for(int i = 0; i < edges[v].size(); i++) {
if(dist[edges[v][i].to] > dist[v] + edges[v][i].weight) {
dist[edges[v][i].to] = dist[v] + edges[v][i].weight;
pre_node[edges[v][i].to] = v;
if(edges[v][i].weight == 0)
Q.push_front(edges[v][i].to);
else
Q.push_back(edges[v][i].to);
}
}
}
for(int i = 0; i < dist.size(); i++)
cout << dist[i] << " ";
}
int main() {
#ifdef LOCAL
std::ifstream in("code.txt");
std::cin.rdbuf(in.rdbuf());
#endif
int a, b;
cin >> a >> b;
string s;
cin >> s;
bool is_ok = true;
if(s.size() != a + b + 1) {
is_ok = false;
} else {
rep(i, s.size()) {
if(i == a) {
if(s[i] != '-') {
is_ok = false;
}
} else {
if('0' <= s[i] && s[i] <= '9') {
} else {
is_ok = false;
}
}
}
}
if(is_ok)
cout << "Yes";
else
cout << "No";
return 0;
}
| 0 | 70,168,517 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int a, b;
cin >> a >> b;
if (a+b == 15) {
cout << "+" << endl;
} else if (a*b == 15) {
cout << "*" << endl;
} else {
cout << "x" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
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; }
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<": "
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll)
#define gre(n) greater<n>()
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const int INF = 1000000000;
const ll INF64 = 922337203685477580ll;
const ll MOD = 1000000007ll;
const dou pi=3.141592653589793;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll moddiv(ll a,ll b){
a%=MOD;
return a*modinv(b,MOD)%MOD;
}
int main(){
ll n,k;
std::cin >> n>>k;
VEC(ll,a,n);
std::vector<ll> c1(n),c2(n);
ll ans=0;
rep(i,n){
rep(j,n){
if(a[i]>a[j]){
c1[i]++;
if(i<j)c2[i]++;
}
}
}
rep(i,n){
ll d=((2*c2[i]+(k-1)*c1[i]))%MOD;
d*=k;
d=moddiv(d,2ll);
ans+=d;
ans%=MOD;
}
std::cout << ans << std::endl;
}
| 0 | 5,874,769 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,X;
cin>>N>>X;
vector<ull>dp(N+1);
dp[0]=1;
for(int i=0;i<N;i++)dp[i+1]=1+dp[i]+1+dp[i]+1;
vector<ull>p(N+1);
p[0]=1;
for(int i=0;i<N;i++)p[i+1]=p[i]+1+p[i];
ull ans=0;
for(int i=N;i>=0;i--){
if(i==0){
ans++;
break;
}
if(X<=1){
break;
}
else if(X<=dp[i-1]+1){
X--;
}
else if(X==dp[i-1]+2){
ans+=p[i-1]+1;
break;
}
else if(X<=dp[i-1]+dp[i-1]+2){
ans+=p[i-1]+1;
X-=dp[i-1]+2;
}
else{
ans+=p[i];
break;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,k;
cin >> n >> k;
ll v[n];
for(ll i=0;i<n;i++) cin >> v[i];
ll res=0;
for(ll a=0;a<=min(n,k);a++){
for(ll b=0;b+a<=min(n,k);b++){
ll cur=0;
vector<ll> vec;
for(ll i=0;i<a;i++){
vec.push_back(v[i]);
cur+=v[i];
}
for(ll i=0;i<b;i++){
vec.push_back(v[n-1-i]);
cur+=v[n-1-i];
}
sort(vec.begin(),vec.end());
for(ll i=0;i<min(k-a-b,(ll)vec.size());i++){
if(vec[i]<0) cur-=vec[i];
}
res=max(res,cur);
}
}
cout << res << endl;
}
| 0 | 97,595,598 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).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; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int a, b;
cin >> a >> b;
cout << ((a * b) % 2 ? "Odd" : "Even") << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for(int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for(int i = (n-1LL); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef bitset<1000> B;
typedef pair <int, B > D;
typedef long double ld;
const int INF = 2000000;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
B bs;
vector<vector<D> > mat(n, vector<D>(n, make_pair(INF, bs)));
rep (i, n) {
mat[i][i] = make_pair(0, bs);
}
rep (i, m) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
B tmp;
tmp.set(i);
mat[a][b] = mat[b][a] = make_pair(c, tmp);
}
rep (k, n) {
rep (i, n) {
rep (j, n) {
if (mat[i][k].first == INF || mat[k][j].first == INF) continue;
if (chmin(mat[i][j].first, mat[i][k].first + mat[k][j].first)) {
mat[i][j].second = mat[i][k].second | mat[k][j].second;
}
}
}
}
rep (i, n) {
rep (j, n) {
bs |= mat[i][j].second;
}
}
cout << m - bs.count() << "\n";
return 0;
}
| 0 | 55,072,734 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
ll N;
cin>>N;
v A(N);
rep(i,0,N)cin>>A[i];
sort(all(A));
ll sum =0;
rep(i,1,N){
if(A[i] == A[i-1])sum++;
}
if(sum%2 == 1)sum++;
cout<<N-sum;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
#define chmax(x,a) x=max(x,a)
#define chmin(x,a) x=min(x,a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX_6 1001001
#define MAX_7 10010010
#define SENTINEL 2000000000
#define NIL -1
const int MOD = 1000000007;
#define INF 1<<30
#define INFTY 1LL<<61
#define MAX_INT INT_MAX
#define Endl '\n'
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
template<class T> bool contain(const std::string& s, const T& v) {
return s.find(v) != std::string::npos;
}
using Edge=pair<int,ll>;
using Graph=vector<vector<int> >;
using Edge=pair<int,ll>;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main(){
int n;cin>>n;
vector<string>S(n);
rep(i,n)cin>>S[i];
ll ans=0;
ll ABnum=0,Anum=0,Bnum=0;
rep(i,n){
int l=(int)S[i].size();
for(int j=0;j<(int)S[i].size()-1;j++){
if(S[i][j]=='A' && S[i][j+1]=='B')ans++;
}
if(S[i][0]=='B' && S[i][l-1]=='A')ABnum++;
else if(S[i][0]=='B')Bnum++;
else if(S[i][l-1]=='A')Anum++;
}
if(ABnum==0)ans+=min(Anum,Bnum);
else if(Anum+Bnum>0)ans+=min(Anum,Bnum)+ABnum;
else if(Anum+Bnum==0)ans+=min(Anum,Bnum)+ABnum-1;
cout<<ans<<endl;
}
| 0 | 83,965,352 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr = new type[n]
#define w(x) int x; cin>>x; while(x--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
bool isPrime(int n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6)
{
if (n % i == 0 || n % (i + 2) == 0)
return false;
}
return true;
}
vector<int> Sieve(int n)
{
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int i = 2; i * i <= n; i++)
{
if (prime[i])
{
for (int j = i * i; j <= n; j += i)
{
prime[j] = false;
}
}
}
vector<int> primes;
for (int i = 2; i <= n; i++)
{
if (prime[i])
primes.pb(i);
}
return primes;
}
map<int, int> primeFactors(int n)
{
mii factors;
while (n % 2 == 0)
{
n /= 2;
factors[2]++;
}
for (int i = 3; i <= sqrt(n); i += 2)
{
while (n % i == 0)
{
factors[i]++;
n /= i;
}
}
if (n > 2)
factors[n]++;
return factors;
}
int32_t main()
{
FIO;
int n, k;
cin >> n >> k;
mk(arr, n, int);
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n, greater<int>());
int ans = 0;
for (int i = 0; i < n; i++)
{
if (i >= k)
{
ans += arr[i];
}
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
bool f(int i){
int dgt=0;
while (i) {
dgt++;
i/=10;
}
return dgt%2==1;
}
int main(int argc, const char * argv[]) {
int n;
cin>>n;
int ans=0;
for(int i=1;i<=n;i++){
if(f(i)==true) ans++;
}
cout<<ans<<endl;
return 0;
}
| 0 | 78,434,313 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) (ll) a.size()
#define all(a) a.begin(), a.end()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
const ll MAX = 2e5;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
int main(){
fastio;
ll tc,n,m,a,b;
cin >> n >> a >> b;
cout << a* (n/(a+b) ) + min(a,n%(a+b)) << endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <bitset>
#include <utility>
#include <cstring>
#include <numeric>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int,int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i,n) for(int i=0;i<n;i++)
#define repll(i,n) for(long long int i=0;i<n;i++)
#define fin(ans) cout<<(ans)<<endl
#define P 1000000007
#define STI(s) atoi(s.c_str())
#define mp(p,q) make_pair(p,q)
#define Sort(a) sort(a.begin(),a.end())
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const int INF = INT_MAX;
const long long LLINF = 1LL<<60;
template <typename T_char>
char ToUpper (char cX) { return toupper(cX); }
ll digit(ll a){
ll count = 0;
for (ll i = 0; i < a; i++)
{ if (a == 0)
{
break;
}else
{
a = a/10;
count++;
}
}
return count;
}
#include <cstdint>
uintmax_t comb(unsigned int n, unsigned int r) {
if ( r * 2 > n ) r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for ( unsigned int i = 1; i <= r; ++i ) {
dividend *= (n-i+1);
divisor *= i;
}
return dividend / divisor;
}
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(void){ios::sync_with_stdio(false);cin.tie(0);
ll x,y,i = 1;
cin >> x >> y;
if(x%y == 0){
cout << -1 << endl;
}else{
while(1){
if(x * i % y != 0){
cout << x*i << endl;
return 0;
}
if(x*i > pow(10,18)){
cout << -1 << endl;
return 0;
}
i++;
}
}
return 0;}
| 0 | 70,235,453 |
#include <iostream>
#include <cmath>
#include <cassert>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
typedef long long ll;
const ll INF = (ll)1e18 + 1;
ll H, W;
void print(){ std::cout << std::endl; }
template <typename Head> void print(Head&& head) { std::cout << head << std::endl; }
template <typename Head, typename... Tail> void print(Head&& head, Tail&&... tail)
{
std::cout << head << " ";
print(std::forward<Tail>(tail)...);
}
int main(int argc, char* argv[])
{
ll A, B;
std::cin >> A >> B;
A--;
B--;
H = 100;
W = 100;
std::vector< std::string > grid(H, std::string(W, '#'));
for (ll y = 51; y < H; y++) {
for (ll x = 0; x < W; x++) {
grid[y][x] = '.';
}
}
for (ll y = 0; y < 50; y+=2) {
for (ll x = 0; x < W; x+=2) {
if (A > 0) {
grid[y][x] = '.';
A--;
}
}
}
for (ll y = 52; y < H; y+=2) {
for (ll x = 0; x < W; x+=2) {
if (B > 0) {
grid[y][x] = '#';
B--;
}
}
}
print(H, W);
for (ll y = 0; y < H; y++) {
print(grid[y]);
}
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "------------------------------------\n" ;
rep(i,n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n" ;
}
void pr2d(vector<vector<ll>> vec){
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n" ;
rep(i,h){
rep(j,w){
cout << vec.at(i).at(j) << " ";
}
cout << "\n";
}
cout << "------------------------------------\n" ;
}
int main(){
ll n ; cin >> n;
vector<ll> a(n+1);
rep(i,n+1) cin >> a.at(i);
if(n!=0 && a.at(0) != 0){
cout << -1 << endl;
return 0;
}
if(n==0){
if(a.at(0) == 1){
cout << 1 << endl;
}else{
cout << -1 << endl;
}
return 0;
}
vector<ll> rui(n+1,0);
rui.at(n) = a.at(n);
for(int i=n-1;i>=0;i--){
rui.at(i) = rui.at(i+1) + a.at(i);
}
vector<ll> nokori(n+1,0);
nokori.at(0) = 1;
for(int i=1;i<n;i++){
ll max_bunki = nokori.at(i-1)*2;
if(max_bunki <= rui.at(i)){
nokori.at(i) = nokori.at(i-1) * 2 - a.at(i);
}else{
nokori.at(i) = rui.at(i) - a.at(i);
}
if(nokori.at(i) <= 0){
cout << -1 << endl;
return 0;
}
}
if(a.at(n) < nokori.at(n-1) || a.at(n) > nokori.at(n-1)*2){
cout << -1 << endl;
return 0;
}
ll ans = 0;
rep(i,n+1) ans+=a.at(i);
rep(i,n) ans+=nokori.at(i);
cout << ans << endl;
return 0;
}
| 0 | 16,189,881 |
#include<iostream>
using namespace std;
int main(){
int f=0,s=0,t=0,num,tmp;
for(int i=0;i<10;i++){
cin>>num;
if(num>t){
t=num;
}
if(t>s){
tmp=s;
s=t;
t=tmp;
}
if(s>f){
tmp=f;
f=s;
s=tmp;
}
}
cout << f << endl << s << endl << t << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int X, Y, Z, K;
scanf("%d", &X);
scanf("%d", &Y);
scanf("%d", &Z);
scanf("%d", &K);
std::vector<long long > A(X), B(Y), C(Z);
for (int i=0; i<X; i++){
scanf("%lld", &A[i]);
}
for (int i=0; i<Y; i++){
scanf("%lld", &B[i]);
}
for (int i=0; i<Z; i++){
scanf("%lld", &C[i]);
}
std::vector<long long > BC;
for (int i=0; i<Y; i++){
for (int j=0; j<Z; j++){
BC.push_back(B[i]+C[j]);
}
}
std::sort(BC.begin(), BC.end());
std::sort(A.begin(), A.end(), std::greater<int>());
long long min = 1;
long long max = 2e18;
while(max-min>1){
long long mid = (min+max)/2;
int count = 0;
for (int i=0; i<X; i++){
auto itr = std::lower_bound(BC.begin(), BC.end(), mid-A[i]);
count += BC.end()-itr;
}
if (count<K){
max=mid;
} else {
min=mid;
}
}
long long thresh = min - 2;
std::vector<long long > ans;
for (int i=0; i<X; i++){
auto itr = std::lower_bound(BC.begin(), BC.end(), thresh-A[i]);
while(itr!=BC.end()){
ans.push_back(A[i]+(*itr));
itr++;
}
}
std::sort(ans.begin(), ans.end(), std::greater<long long >());
for (int i=0; i<K; i++){
printf("%lld\n", ans[i]);
}
return 0;
}
| 0 | 63,437,536 |
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else{
rep(i,number){
fspattern_draft.at(floor) = i;
setfspattern_core(floor+1,number,degree);
}
}
}
void setfspattern(int number,int degree){
int64_t array_num = 1;
rep(i,degree){
array_num *= number;
}
fspattern = vector<vector<int>>(array_num,vector<int>(degree));
fspattern_draft = vector<int>(degree);
setfspattern_core(0,number,degree);
}
int main(){
int n;
cin >> n;
vector<int> a(2*n);
rep(i,2*n){
cin >> a.at(i);
}
sort(a.begin(),a.end());
int sum = 0;
rep(i,n){
sum += min(a.at(2*i),a.at(2*i+1));
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.length()>b.length()){
cout << "GREATER" << endl;
}else if(a.length()<b.length()){
cout << "LESS" << endl;
}else{
for(int i = 0; i < a.length(); i++){
if(a[i]>b[i]){
cout << "GREATER" << endl;
break;
}else if(a[i]<b[i]){
cout << "LESS" << endl;
break;
}else{
if(i == a.length()-1){
cout << "EQUAL" << endl;
}
}
}
}
return 0;
}
| 0 | 39,151,078 |
#include<iostream>
#include<cstdio>
using namespace std;
int parent(int num)
{
return num / 2;
}
int left(int num)
{
return num * 2;
}
int right(int num)
{
return num * 2 + 1;
}
int main()
{
int A[100000];
int N;
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= N; i++) {
printf("node %d: key = %d, ", i, A[i]);
if (parent(i) > 0)printf("parent key = %d, ", A[parent(i)]);
if (left(i) <= N)printf("left key = %d, ", A[left(i)]);
if (right(i) <= N)printf("right key = %d, ", A[right(i)]);
printf("\n");
}
return 0;
}
|
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
int n, k;
int a[5000];
bitset<5001> DP[5001];
bitset<5001> DQ[5001];
void pre() {
DP[0][0] = true;
DQ[0][0] = true;
for (int i = 0; i < n; ++i) {
DP[i + 1] = DP[i] | (DP[i] << a[i]);
DQ[i + 1] = DQ[i] | (DQ[i] << a[n - 1 - i]);
}
}
bool no_need(int i) {
bitset<5001> x = DP[i];
bitset<5001> y = DQ[n - 1 - i];
const int lo = max(0, k - a[i]);
const int hi = k;
vector<int> p(k + 2);
for (int i = 0; i <= k; ++i) {
p[i + 1] = p[i] + y[i];
}
for (int i = 0; i < hi; ++i) {
if (!x[i]) continue;
int l = max(0, lo - i);
int r = hi - i;
if (p[r] - p[l] > 0) return false;
}
return true;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> a[i];
pre();
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += no_need(i);
}
cout << sum << endl;
}
| 0 | 34,983,989 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e12
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define max(x) *max_element(all(x))
#define min(x) *min_element(all(x))
using namespace std;
ll fac[MAX], finv[MAX], inv[MAX];
void comint()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; ++i)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll 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;
}
bool is_prime(ll N)
{
for (ll i = 2; i * i <= N; ++i)
{
if (N % i == 0)
return false;
}
return true;
}
vector<ll> soinsubunkai(long long N)
{
vector<ll> tmp;
ll num = N;
for (ll i = 2; i * i <= N; ++i)
{
if (N % i == 0)
{
ll j = N / i;
if (is_prime(i))
{
while (num % i == 0)
{
tmp.push_back(i);
num /= i;
}
}
if (is_prime(j))
{
while (num % j == 0)
{
tmp.push_back(j);
num /= j;
}
}
}
}
return tmp;
}
ll modinv(ll a, ll m)
{
ll b = m, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll modpow(ll a, ll n, ll m)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
ll ans = 0;
cin >> N;
vector<ll> vec(N);
rep(i, N) cin >> vec[i];
vector<ll> ruisekiwa(N + 1);
set<ll> st;
ruisekiwa[0] = 0;
rep(i, N)
{
ruisekiwa[i + 1] = ruisekiwa[i] + vec[i];
}
sort(all(ruisekiwa));
map<ll, ll> mp;
for (auto i : ruisekiwa)
mp[i]++;
for (auto i : mp)
{
ans += i.second * (i.second - 1) / 2;
}
cout << ans << endl;
}
|
#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;
cin >>A>>B;
if(A.size()==B.size()){
if(A==B){
cout<<"EQUAL"<<endl;
}else if(A>B){
cout<<"GREATER"<<endl;
}else{
cout<<"LESS"<<endl;
}
}else if(A.size()>B.size()){
cout<<"GREATER"<<endl;
}else{
cout<<"LESS"<<endl;
}
return 0;
}
| 0 | 79,950,776 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template<class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template<class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template<class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\nTOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
void smain() {
ll n;
cin >> n;
cout << (n - 1) / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string S;
cin >> S;
if(S=="zyxwvutsrqponmlkjihgfedcba"){
cout <<-1<<endl;
return 0;
}
vector<bool> used(26,false);
for(int i=0;i<S.size();i++){
used[S[i]-'a'] = true;
}
for(int i=0;i<26;i++){
if(!used[i]){
char s = 'a' +i;
cout << S+s << endl;
return 0;
}
}
for(int i=S.size()-2;i>=0;--i){
if(S[i] < S[i+1]){
int lastNum =26;
for(int j=S.size()-1;j>i;--j){
if(S[i] < S[j]){
lastNum = min(lastNum,S[j]-'a');
}
}
string ans="";
for(int j=0;j<i;j++){
ans += S[j];
}
char s = 'a'+lastNum;
ans += s;
cout << ans << endl;
return 0;
}
}
return 0;
}
| 0 | 17,254,864 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector < string > S(n);
for (int i = 0; i < n; i++) {
cin >> S[i];
}
vector < vector < int >>cnt(26, vector < int >(n));
for (int i = 0; i < n; i++) {
for (size_t j = 0; j < S[i].size(); j++) {
cnt[S[i][j] - 'a'][i]++;
}
}
int ans[26];
for (int i = 0; i < 26; i++) {
ans[i] = INT_MAX;
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < n; j++) {
ans[i] = min(ans[i], cnt[i][j]);
}
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < ans[i]; j++) {
char s = 'a' + i;
cout << s;
}
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define FOR(i, a, b) for (ll i = (a), i < (N): i++)
#define all(A) (A).begin(), (A).end()
int main(){
int N;
cin >> N;
int V[N];
rep(i, N) cin >> V[i];
vector<pii> A(1e5 + 10), B(1e5+10);
rep(i, 1e5+10) {
A[i].first = 0;
B[i].first = 0;
A[i].second = i;
B[i].second = i;
}
rep(i, N) {
if (i % 2 == 0) {
A[V[i]].first++;
}
else B[V[i]].first++;
}
sort(all(A), [](pii a, pii b) {return a.first > b.first;});
sort(all(B), [](pii a, pii b) {return a.first > b.first;});
int ans = 0;
if (A[0].second == B[0].second) {
ans = N - max(A[0].first + B[1].first, A[1].first + B[0].first);
}
else ans = N - A[0].first - B[0].first;
cout << ans << endl;
return 0;
}
| 0 | 62,306,963 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,m;
cin>>n>>m;
vector<pair<int64_t, int64_t> > student_pos(n);
for(int i=0;i<n;i++){
cin>>student_pos.at(i).first>>student_pos.at(i).second;
}
vector<pair<int64_t, int64_t> > checkpoint_pos(m);
for(int i=0;i<m;i++){
cin>>checkpoint_pos.at(i).first>>checkpoint_pos.at(i).second;
}
for(int i=0;i<n;i++){
int64_t min_dist=10000000000;
int64_t index_min_dist;
for(int j=0;j<m;j++){
int64_t dist=abs(student_pos.at(i).first-checkpoint_pos.at(j).first)+abs(student_pos.at(i).second-checkpoint_pos.at(j).second);
if(dist<min_dist){
min_dist=dist;
index_min_dist=j+1;
}
}
cout<<index_min_dist<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
string toBin(int n){
if(n == 1)return "1";
else if(n == 0)return "0";
return toBin(n/2) + to_string(n%2);
}
int main(){
ll n, k;
cin >> n >> k;
ll sum = 0;
vector<ll> a(n);
rep(i, n)cin >> a[i];
vector<ll> b;
rep(i, n){
ll sum = 0;
for(ll j=i; j<n; ++j)sum+=a[j], b.push_back(sum);
}
ll ans = 0;
for(ll i=40; i>=0; --i){
ll cnt = 0;
ll x = ans|(1LL<<i);
rep(j, b.size()){
if((x&b[j])==x)cnt++;
}
if(cnt>=k)ans=x;
}
cout << ans << endl;
}
| 0 | 7,329,622 |
#include <iostream>
using namespace std;
using ll = long long;
const int K = 1e5 + 10;
const int mod = 1e9 + 7;
ll dp[K];
ll qmi(int m, int k, int p) {
ll res = 1 % p, t = m;
while (k) {
if (k & 1) res = res * t % p;
t = t * t % p;
k >>= 1;
}
return res;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = k; i >= 1; --i) {
dp[i] = qmi(k / i, n, mod);
for (int j = 2 * i; j <= k; j += i) {
dp[i] -= dp[j];
dp[i] = (dp[i] % mod + mod) % mod;
}
}
ll res = 0;
for (int i = 1; i <= k; i++) (res += dp[i] * i % mod) %= mod;
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int n; cin >> n;
vector<int> a(n); cin >> a;
int ans = 1e9;
int sum = accumulate(all(a), 0);
int pre = 0;
for (int i = 0; i + 1 < n; i++) {
pre += a[i];
int suf = sum - pre;
ans = min(ans, abs(suf - pre));
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
| 0 | 88,133,083 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n == 1) return p % m;
else if (n % 2 == 1) return p * pow_mod(p, n - 1, m) % m;
else {
ll tmp = pow_mod(p, n / 2, m);
return (tmp * tmp) % m;
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
ll com_mod(ll n, ll k, ll m) {
if (k == 0) return 1;
else {
ll x = 1;
ll y = 1;
for (ll i = 0; i < k; i++) {
x = (x * (n - i)) % m;
y = (y * (i + 1)) % m;
}
ll res = (x * pow_mod(y, m - 2, m)) % m;
return res;
}
}
int main() {
vector<int> a(3);
for (int i = 0; i < 3; i++) cin >> a[i];
sort(a.begin(), a.end());
cout << a[2] - a[0] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct TopologicalGraph
{
vector< vector<int> > graph;
vector<int> order;
TopologicalGraph(int sz):graph(sz){}
TopologicalGraph(vector< vector<int> > graph):graph(graph){}
void add_edge(int from, int to)
{
graph[from].push_back(to);
}
bool visit(int u, vector<int>& color)
{
color[u] = 1;
for(int v : graph[u]) {
if(color[v] == 2) continue;
if(color[v] == 1) return false;
if(!visit(v, color)) return false;
}
order.push_back(u);
color[u] = 2;
return true;
}
bool sort()
{
vector<int> color((int)graph.size(), 0);
for(int i = 0; i < (int)color.size(); i++) {
if(color[i] == 0 && !visit(i, color)) return false;
}
reverse(order.begin(), order.end());
return true;
}
void print_order()
{
for(int i = 0; i < (int)order.size(); i++) cout << order[i] << endl;
}
};
int main()
{
int V, E; cin >> V >> E;
TopologicalGraph graph(V);
while(E--) {
int s, t; cin >> s >> t;
graph.add_edge(s, t);
}
graph.sort();
graph.print_order();
return 0;
}
| 0 | 59,335,552 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
lint a,b,c,k; cin>>a>>b>>c>>k;
cout<<(k%2==0?a-b:b-a)<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
int main (){
int n;
cin >> n;
int ans=1;
while(n>=ans*2){
ans*=2;
}
cout << ans << endl;
return 0;
}
| 0 | 76,901,226 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a,b;
char c;
cin >> a >> c >> b;
a = (c == '+' ? a + b : a - b);
cout << a << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
if(n>=1 && n<=100)
{
int a[n];
int flag = 1;
for(int i=0; i<n; i++)
{
cin >> a[i];
if(a[i]<-100 || a[i]>100)flag = 0;
}
if(flag)
{
int finalans=0;
int sum = 0;
for(int i=0; i<n; i++)
{
sum += a[i];
}
float mean = 1.0*sum/n;
if((mean - floor(mean))>0.5)
{
for(int i=0; i<n; i++)
{
finalans += (ceil(mean)-a[i])*(ceil(mean)-a[i]);
}
}
else {
for(int i=0; i<n; i++)
{
finalans += (floor(mean)-a[i])*(floor(mean)-a[i]);
}
}
cout << finalans << endl;
}
}
return 0;
}
| 0 | 95,599,190 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1001001001;
const ll LONGINF = 1001001001001001LL;
const ll MOD = 1000000007LL;
const double PI = acos(-1);
const double EPS = 1e-9;
int main() {
int N; cin >> N;
vector< pair<int, int> > points(N);
for(int i=0; i<N; i++) {
int x, y; cin >> x >> y;
points[i] = make_pair(x, y);
}
sort(points.begin(), points.end(), [](auto a, auto b) {
double ra = atan2(a.second, a.first);
double rb = atan2(b.second, b.first);
return ra < rb;
});
double ans = 0;
for(int i=0; i<N; i++) {
double x = 0, y = 0;
for(int l=0; l<N; l++) {
int k = (i + l) % N;
x += points[k].first, y += points[k].second;
ans = max(ans, sqrt(x*x + y*y));
}
}
printf("%.12f\n", ans);
return 0;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
vector<ll> a(n);
forn(i, n) cin >> a[i];
map<ll, ll> c;
c[0]++;
c[a[0] % m]++;
for (int i = 1; i < n; i++)
{
a[i] = a[i - 1] + a[i];
c[a[i] % m]++;
}
ll ans = 0;
for (auto it : c) ans = ans + (it.second - 1) * it.second / 2;
cout << ans;
}
| 0 | 4,099,420 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
using namespace std;
int inf = 0x3f3f3f3f;
int maps[50][50];
void floyd(int k,int n)
{
for(int t =k; t<=n; t++)
for(int i = k; i<=n; i++)
for(int j = k; j<=n; j++)
if(maps[i][j]>maps[i][t]+maps[t][j])
maps[i][j]=maps[i][t]+maps[t][j];
}
int main(void)
{
int n;
while(scanf("%d",&n)&&n)
{
memset(maps,inf,sizeof(maps));
int ma = 0;
int k = inf;
for(int i = 0; i<n; i++)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
maps[x][y] = maps[y][x] = w;
maps[i][i] = 0;
ma = max(ma,x);
ma = max(ma,y);
k = min(k,x);
k = min(k,y);
}
floyd(k,ma);
int mi = inf,b=k;
for(int i = k;i <=ma; i++)
{
int sum = 0;
for(int j = k; j<=ma; j++)
{
sum += maps[i][j];
}
if(sum<mi) b = i,mi=sum;
}
printf("%d %d\n",b,mi);
}
return 0;
}
|
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int M, K;
int main(){
scanf("%d%d", &M, &K);
int all = pow(2, M);
if (M == 0){
if (K == 0) printf("0 0\n");
else printf("-1\n");
return 0;
}
if (M == 1){
if (K == 0) printf("0 0 1 1\n");
else printf("-1\n");
return 0;
}
if (K >= all){
printf("-1\n"); return 0;
}
if (K == 0){
printf("0");
for (int i = 1; i < all; i++) printf(" %d", i);
for (int i = all - 1; i >= 0; i--) printf(" %d", i);
printf("\n");
return 0;
}
printf("0 %d 0", K);
for (int i = 1; i < all; i++){
if (i == K) continue;
printf(" %d", i);
}
printf(" %d", K);
for (int i = all - 1; i >= 1; i--){
if (i == K) continue;
printf(" %d", i);
}
printf("\n");
return 0;
}
| 0 | 11,046,000 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n, x, y;
char s[500];
cin >> s;
n = strlen(s);
x = n;
while(1)
{
x = x - 2;
y = strncmp((s), (s+(x/2)), (x/2));
if(y==0)
{
cout << x << endl;
break;
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
int main()
{
std::string str,exstr;
while(std::cin >> str){
if(str == "-"){
break;
}
int exnum,b;
std::cin >> exnum;
std::vector<int> num;
num.clear();
for(int a = 0;a < exnum;a++){
std::cin >> b;
num.push_back(b);
}
for(int x : num){
exstr = str.substr(0,x);
str.erase(str.begin(),str.begin() + x);
str += exstr;
}
std::cout <<str <<std::endl;
}
return 0;
}
| 0 | 23,591,378 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> gr[N];
int slt, cnt[5], mark[N];
long long ans;
bool z;
void dfs(int v, int rang = 1) {
mark[v] = rang;
for (auto u : gr[v]) {
if (!mark[u])
dfs(u, 3 - rang);
else {
if (mark[u] == mark[v])
z = true;
}
}
}
int main() {
int n, m;
cin >> n >> m;
slt = n;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
gr[x].push_back(y);
gr[y].push_back(x);
}
for (int i = 0; i < n; i++) {
z = false;
if (!mark[i]) {
if (gr[i].size() > 0) {
dfs(i);
if (z == true)
cnt[0]++;
else
cnt[1]++;
}
else {
slt--;
}
}
}
ans = 1ll * n * n - 1ll * slt * slt + cnt[0] + 2 * cnt[1] + 1ll * cnt[0] * (cnt[0] - 1) + 1ll * 2 * cnt[1] * cnt[0] + 1ll * 2 * cnt[1] * (cnt[1] - 1);
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
const ll MAX_N=1e6+10,INF=99999999;
ll n,a[MAX_N],s[MAX_N],from[MAX_N],to[MAX_N],w[MAX_N];
vector<int> adj[MAX_N];
void dfs(int v,int p){
for(int k:adj[v]){
int u=from[k]^to[k]^v;
if(u!=p){
dfs(u,v);
if(adj[u].size()==1){
w[k]=a[u];
}
else{
w[k]=(2*a[u])-s[u];
}
if(w[k]<0){
cout<<"NO";
exit(0);
}
s[v]+=w[k];
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-1;i++){
cin>>from[i]>>to[i];
adj[from[i]].pb(i);
adj[to[i]].pb(i);
}
dfs(1,0);
ll sum=0;
for(int u:adj[1]){
sum+=w[u];
}
if(adj[1].size()>1 && 2*a[1]!=sum){
cout<<"NO";
return 0;
}
if(adj[1].size()==1 && a[1]!=sum){
cout<<"NO";
return 0;
}
for(int i=1;i<=n;i++){
ll mx=-INF,sum=0;
for(int u:adj[i]){
mx=max(mx,w[u]);
sum+=w[u];
}
if(2*mx>sum && adj[i].size()>1){
cout<<"NO";
return 0;
}
}
cout<<"YES";
}
| 0 | 91,228,634 |
#include <iostream>
#include <string>
#include <map>
#include <cmath>
using namespace std;
long long fact(long long x, int life) {
if (life == 0)
return 1;
else if (x == 1)
return 1;
else
return (x * fact(x - 1, life - 1)) % 1000000007;
}
int main(int argc, char* argv[]) {
int N;
cin >> N;
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < N; ++i) {
if (m.find(s[i]) == m.end())
m[s[i]] = 0;
++m[s[i]];
}
long long ret = 1;
for (map<char, int>::iterator i = m.begin(); i != m.end(); ++i) {
ret *= i->second + 1;
ret %= 1000000007;
}
cout << ret - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, right = 0, sum = 0, ans = 0;
cin >> N;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int64_t left = 0; left < N; left++) {
while(right < N && sum + A.at(right) == (sum ^ A.at(right))){
sum += A.at(right);
right++;
}
ans += right - left;
if (right == left) {
right++;
}
else {
sum -= A.at(left);
}
}
cout << ans << endl;
}
| 0 | 20,748,805 |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
ll a[n];
rep(i, n) { cin >> a[i]; }
ll ans = 0;
rep(i, n) {
ans += a[i] / 2;
a[i] %= 2;
if (i != n - 1) {
if (a[i] && a[i + 1]) {
a[i]--;
a[i + 1]--;
ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 1e5 + 5;
ll a[maxn];
int n;
ll L;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> L;
for(int i = 1;i <= n;i++){
cin >> a[i];
}
int pos = -1;
for(int i = 1;i < n;i++){
if(a[i] + a[i + 1] >= L){
pos = i;
break;
}
}
if(pos == -1){
cout << "Impossible" << endl;
}else{
cout << "Possible" << endl;
for(int j = 1;j < pos;j++){
cout << j << endl;
}
for(int j = n - 1;j > pos;j--){
cout << j << endl;
}
cout << pos << endl;
}
return 0;
}
| 0 | 80,308,811 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
string S;
cin >> N >> S;
const long long MOD = 1000000000 + 7;
vector<long long> v( 26 );
for( int i = 0; i < N; i++ ) {
int n = S[i] - 'a';
v[n]++;
}
long long ans = 1;
for( int i = 0; i < 26; i++ ) {
if( v[i] == 0 ) continue;
ans *= v[i] + 1;
ans %= MOD;
}
ans = (ans - 1 + MOD) % MOD;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;cin>>n>>m;
vector<vector<ll>> v(m);
rep(i,n){
ll a,b;cin>>a>>b;
if(m-a<0) continue;
v[m-a].push_back(b);
}
priority_queue<ll> que;
ll ans=0;
for(int i=m-1;i>=0;i--){
for(auto x:v[i]){
que.push(x);
}
if(que.empty()) continue;
ans+=que.top();que.pop();
}
cout<<ans<<endl;
return 0;
}
| 0 | 33,828,052 |
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rrep(i,a,b) for(int i = a ; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#define nl "\n"
#define debug2(x, y) cout << #x << " = " << x << " " << #y << " = " << y << nl;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
const int MAXN = 100005;
ll mod=1000000007;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt;
tt = 1;
while(tt--){
string s,t;
cin>>s>>t;
string ans = "~";
int n = s.size();
int m = t.size();
rep(i,0,n - m){
string s2 = s;
bool ok = true;
rep(j,0,m-1){
if(s[i+j]==t[j] || s[i+j]=='?'){
s2[i+j] = t[j];
}
else{
ok = false;
false;
}
}
if(ok){
replace(s2.begin(), s2.end(), '?', 'a');
ans = min(ans, s2);
}
}
if(ans == "~"){
cout<<"UNRESTORABLE"<<nl;
}
else{
cout<<ans<<nl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
if(v.size() >= 200) {
return "Too big container";
}
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
const int dy8[8] = { 1, 1, 1, 0, 0, -1, -1, -1 };
const int dx8[8] = { -1, 0, 1, -1, 1, -1, 0, 1 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M; cin >> N >> M;
vector<PINT> L(N);
rep(i, N) {
int a,b; cin >> a >> b;
L[i] = make_pair(a, b);
}
sort(all(L));
int curI = 0;
int ans = 0;
priority_queue<int> pq;
for(int day = 1; day <= M; ++day) {
for(; curI < N && L[curI].first <= day; ++curI) {
pq.push(L[curI].second);
}
if(!pq.empty()) {
ans += pq.top();
pq.pop();
}
}
print(ans);
}
| 0 | 29,324,411 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int a[6],c1=0,c2=0,c3=0,c4=0;
for(int i=0;i<6;i++){
cin>>a[i];
if(a[i]==1) c1++;
else if(a[i]==2) c2++;
else if(a[i]==3) c3++;
else c4++;
}
if((c1>2||c2>2)||(c3>2||c4>2)) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
for(int i = 0; i < n; ++i){
cin >> w[i];
}
int res = 1000000;
int c1,c2;
for(int i = 0; i < n; ++i){
c1 = 0;
c2 = 0;
for(int j = 0; j < n; ++j){
if(j <= i){
c1 += w[j];
}else{
c2 += w[j];
}
}
res = min({res,abs(c1-c2)});
}
cout << res;
}
| 0 | 94,706,072 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int d;
cin >> d;
cout << ((d > 24) ? "Christmas\n" : (d > 23) ? "Christmas Eve\n" : (d > 22) ? "Christmas Eve Eve\n" : "Christmas Eve Eve Eve\n");
return 0;
}
|
#include<iostream>
int main(){
int m,f,r;
std::string c;
while(1){
std::cin >> m >> f >> r;
if(m==-1 && f==-1 && r==-1) break;
if(m==-1 || f==-1){
c= "F";
}else if(m+f>=80) {
c="A";
}else if(m+f>=65) {
c="B";
}else if(m+f>=50) {
c="C";
}else if(m+f>=30) {
if(r>=50) c="C";
else c="D";
}else {
c="F";
}
std::cout << c << std::endl;
}
return 0;
}
| 0 | 58,330,753 |
#include<iostream>
using namespace std;
int main(){
int f[3]={1,1,1},n;
cin >> n;
while(1<n--){
f[2]=f[0]+f[1];
f[0]=f[1];
f[1]=f[2];
}
cout<<f[2]<<endl;
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<numeric>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
#define MOD 1000000007
int main(){
long long n,m;
cin >> n >> m;
long long s[n+1],t[m+1];
for(int i=1;i<n+1;i++){
cin >> s[i];
}
for(int i=1;i<m+1;i++){
cin >> t[i];
}
long long sum[n+1][m+1];
long long dp[n+1][m+1];
for(int i=0;i<n+1;i++){
for(int j=0;j<m+1;j++){
sum[i][j] = 0;
dp[i][j] = 0;
}
}
dp[0][0] = 0;
for(int i=1;i<n+1;i++){
for(int j=1;j<m+1;j++){
if(s[i] == t[j]){
dp[i][j] = sum[i-1][j-1]+1;
}
else{
dp[i][j] = 0;
}
dp[i][j] %= MOD;
sum[i][j] = sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+dp[i][j];
sum[i][j] %= MOD;
}
}
long long ans = sum[n][m];
ans += 1;
ans %= MOD;
ans += MOD;
ans %= MOD;
cout << ans << endl;
return 0;
}
| 0 | 64,396,129 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn= 5e5+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int n,k;
int main(){
cin>>n>>k;
int even=0, odd=0; ll ans=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
if(x%2==0){
even++;
}
else odd++;
}
if(k==0){
if(odd>2)
ans=pow(2, odd+even-1);
if(odd==2){
ans=pow(2,even+1);
}
if(odd<2){
if(even)
ans=pow(2,even);
}
cout<<ans;
}
else {
if(odd==0)cout<<0;
else {
ans=pow(2, odd+even-1);
cout<<ans;
}
}
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
ll a[maxn],r[maxn],l[maxn];
inline ll Pow2(int i){
if(i<63) return 1ll<<i;
else return 1e18;
}
int main()
{
int n;
cin>>n;
for(int i=0; i<=n; i++) cin>>a[i];
ll ans=0;
l[n+1]=0,r[n+1]=0;
for(int i=n; i>=0; --i)
{
l[i]=l[i+1]/2+l[i+1]%2;
r[i]=r[i+1];
l[i]+=a[i];
r[i]+=a[i];
if(l[i]>Pow2(i))
{
cout<<-1<<endl;
return 0;
}
r[i]=min(r[i],Pow2(i));
}
for(int i=1; i<=n-1; i++)
{
ll x=l[i-1],y=r[i-1];
x-=a[i-1];
y-=a[i-1];
y=2*y;
l[i]=max(l[i],x);
r[i]=min(r[i],y);
}
for(int i=0; i<=n; i++)
{
ans+=r[i];
}
cout<<ans<<endl;
return 0;
}
| 0 | 57,301,562 |
#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define DBG(x) cerr << #x << ": " << (x) << " (L" << __LINE__ << ")" << endl;
#define FOR(i, n) for (auto i : (n))
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
void setmin(int& a, int b) {
if (a > b) a = b;
}
const int INF = 1000000;
int main() {
int H, W;
cin >> H >> W;
vector<string> grid(H);
REP(i, H) cin >> grid[i];
vector<vector<int>> dp(H + 1, vector<int>(W + 1, INF));
dp[1][1] = grid[0][0] == '.' ? 0 : 1;
int dr[] = {-1, 0};
int dc[] = {0, -1};
REP(r, H) REP(c, W) REP(dir, 2) {
int pr = r + dr[dir];
int pc = c + dc[dir];
if (dp[pr + 1][pc + 1] == INF) continue;
int changed = grid[r][c] != grid[pr][pc];
setmin(dp[r + 1][c + 1], dp[pr + 1][pc + 1] + changed);
}
DBG(dp[H][W]);
cout << (dp[H][W] + 1) / 2 << endl;
}
|
#include<bits/stdc++.h>
#define mod 1000000009
#define int long long
#define garou ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int pow(int p,int r){
int ans=1;
while(r>0){
if(r&1){
ans=((ans%mod)*(p%mod))%mod;
}
r=r>>1;
p=((p%mod)*(p%mod))%mod;
}
return ans;
}
signed main() {
garou;
int k;
cin>>k;
queue<int> q;
vector<int> v;
for(int i=1;i<=9;i++){
q.push(i);
v.push_back(i);
}
while(q.front()<=3234566667){
int a=q.front();
q.pop();
if(a%10!=0){
int b=a*10+(a%10)-1;
v.push_back(b);
q.push(b);
}
int b=a*10+(a%10);
v.push_back(b);
q.push(b);
if(a%10!=9){
int b=a*10+(a%10)+1;
v.push_back(b);
q.push(b);
}
}
cout<<v[k-1];
}
| 0 | 49,097,505 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int lld;
const lld mod = 1e9+7;
const lld INF = 1e9;
int fib[45] = {0};
int f(int n)
{
if (n == 0 || n == 1)
{
fib[n] = 1;
return fib[n];
}else
{
if (fib[n] != 0)
{
return fib[n];
}
fib[n] = f(n-1) + f(n-2);
return fib[n];
}
}
int main()
{
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const int N = 1e5 + 10;
const ll M = 998244353;
int main() {
ll n, x, m;
cin >> n >> x >> m;
map<ll, int> pos;
pos[x] = 1;
ll ans[m + 2], mpos = -1, len = 0, lpos = -1;
ans[1] = x;
ll suum = x;
for (int i = 2; i <= min(n, m + 1); ++i) {
ans[i] = (ans[i - 1] * ans[i - 1]) % m;
suum += ans[i];
if (pos.find(ans[i]) == pos.end())
pos[ans[i]] = i;
else {
mpos = pos[ans[i]];
len = i - mpos;
lpos = i;
break;
}
}
if (mpos == -1)
return cout << suum << endl, 0;
ll res = 0;
for (int i = 1; i < mpos; ++i) {
res += ans[i];
}
ll sum = ans[mpos];
for (int i = mpos + 1; i < lpos; ++i) {
sum += ans[i];
}
n -= mpos - 1;
res += (n / len) * sum;
n %= len;
for (int i = mpos; i < mpos + n; ++i) {
res += ans[i];
}
cout << res << endl;
}
| 0 | 17,276,092 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+5,mod=1e9+7;
int main() {
int n;
cin>>n;
ll ans=0,sum=0;
vector<int> v;
for (ll i = 0; i < n; ++i)
{
ll x;
cin>>x;
sum+=x;
if(x==0){
ans+=sum/2;
sum=0;
}
}
ans+=sum/2;
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define float double
#define pb push_back
#define FF first
#define SS second
#define N 100005
#define MOD 1000000007
#define fn(i,n) for(int i=0;i<n;i++)
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define pii pair<int,int>
#define mp make_pair
#define INF 9223372036854775807
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
int n,m;
string s[1001];
int dp[1001][1001];
int recmemo(int i,int j)
{
if(dp[i][j]!=-1) return dp[i][j];
if(i==0 && j==0) return 1;
int a=0;
if(i>0 && s[i-1][j]=='.') a=recmemo(i-1,j);
int b=0;
if(j>0 && s[i][j-1]=='.') b=recmemo(i,j-1);
dp[i][j]=(a+b)%MOD;
return dp[i][j];
}
signed main()
{
speed;
cin>>n>>m;
memset(dp,-1,sizeof(dp));
for(int i=0;i<n;i++) cin>>s[i];
cout<<recmemo(n-1,m-1);
}
| 0 | 79,050,178 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x) cerr << #x << " = " << (x) << endl
using namespace std;
#ifdef _MSC_VER
const bool test = true;
#else
const bool test = false;
#endif
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
const int MAX = (int)2e5 + 5;
ll factorial(ll n) {
if (n == 0) return 1;
return n * factorial(n-1);
}
int main() {
ll n;
cin >> n;
cout << factorial(n) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define fi first
#define se second
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
fio;
string s; cin>>s;
ll sum=0;
vector<int> v;
for(int i=0;i<s.length();i++){
if(s[i]=='B'){
v.push_back(i);
}
}
reverse(v.begin(),v.end());
int size=s.length()-1;
for(int i=0;i<v.size();i++){
sum+=(size-v[i]);
size-=1;
}
cout<<sum<<'\n';
return 0;
}
| 0 | 33,752,766 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };
int a[5000];
int dp[5000];
int main(){
ios::sync_with_stdio(false);
int n;
int smax;
while(1){
scanf("%d", &n);
if(n==0) break;
REP(i, n) scanf("%d", &a[i]);
dp[0]=a[0];
smax =a[0];
FOR(i, 1, n){
dp[i]=max(dp[i-1]+a[i], a[i]);
}
REP(i, n){
smax=max(dp[i], smax);
}
printf("%d\n", smax);
}
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
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/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}
long long 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 llpow(ll n,ll i){ll cnt=n; for(ll j=0;j<i-1;j++){n*=cnt;}return n;}
int main() {
ll n,c,k;
cin>>n>>c>>k;
v(ll) t(n);
ll ans=1;
rep(i,n) cin>>t[i];
sort(all(t));
ll cnt=c-1;
ll state=t[0];
rrep(i,n-1){
if(cnt==0||t[i]>state+k){
state=t[i];
cnt=c;
ans++;
}
if(t[i]<=state+k){
cnt--;
}
}
cout<<ans<<endl;
}
| 0 | 94,694,180 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int main() {
int a,b,k; cin >> a >> b >> k;
int i = 100;
while(i>0) {
if (a%i==0 && b%i==0) {
k--;
if(k == 0) { COUT(i); break; }
}
i--;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using P = pair<ld,ld>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=998244353;
ll N,M,R;
vector<vector<ll>> d(205, vector<ll>(205, INF));
vector<ll> r(8,0);
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
cin >> N;
cin >> M;
cin >> R;
for(ll i=0;i<R;++i){cin>>r[i];r[i]--;}
vector<ll> A(M,0);
vector<ll> B(M,0);
vector<ll> C(M,0);
for(ll i=0;i<M;++i){cin>>A[i]>>B[i]>>C[i];A[i]--;B[i]--;}
for(ll i=0;i<M;++i){
d[A[i]][B[i]]=C[i];d[B[i]][A[i]]=C[i];
}
for(ll i=0;i<N;++i)d[i][i]=0;
for(ll i=0;i<N;++i)
for(ll j=0;j<N;++j)
for(ll k=0;k<N;++k)chmin(d[j][k],d[j][i]+d[i][k]);
vector<ll> zyun(R,0);
iota(zyun.begin(), zyun.end(), 0);
ll ans=INF;
do{
ll sum=0;
for(ll i=0;i<R-1;++i){
sum+=d[r[zyun[i]]][r[zyun[i+1]]];
}
chmin(ans,sum);
}while(next_permutation(zyun.begin(), zyun.end()));
prt(ans)
return 0;
}
| 0 | 57,038,505 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 10000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main(){
int64_t n;
cin >> n;
vector<int64_t> v = divisor(n);
int64_t ans = 0;
for(int64_t i = 0; i < v.size(); i++){
int64_t m = n / v[i];
if(m >= v[i]+2 && m >= 3){
ans += (m-1);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#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 _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int a, b;
int main(){
cin >> a >> b;
if(a < b){
rep(i, b){
cout << a;
}
cout << endl;
}
else{
rep(i, a){
cout << b;
}
cout << endl;
}
}
| 0 | 93,414,462 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int n,a,i;
double x=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
x+=(double)1/a;
}
printf("%lf\n",1/x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[5]={},sum=0,m=0;
for(int i=0;i<5;i++)
{
cin>>a[i];
sum+=((a[i]+9)/10 * 10);
m = max(m,(((a[i]+9)/10 * 10)-a[i]));
}
cout<<sum-m;
return 0;
}
| 0 | 85,957,634 |
#include<iostream>
using namespace std;
int main(){
string s1,s2,s3;
cin>>s1>>s2>>s3;
char x = s1[0]-0x20;
char y = s2[0]-0x20;
char z = s3[0]-0x20;
string s = {x,y,z};
cout<<s<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
int h,w,ans=1,ty;
cin>>h>>w;
vector<string>grid(h);
rep(i,h)cin>>grid[i];
rep(i,h)rep(j,w)if(grid[i][j]=='#'){
ty=1;
if(i>0&&grid[i-1][j]=='#')ty=0;
else if(i<h-1&&grid[i+1][j]=='#')ty=0;
else if(j>0&&grid[i][j-1]=='#')ty=0;
else if(j<w-1&&grid[i][j+1]=='#')ty=0;
if(ty)ans=0;
}
if(ans)cout<<"Yes";
else cout<<"No";
return 0;
}
| 0 | 39,545,383 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
string s;
ll k,count=0;
cin >> s >> k;
rep(i,100){
if(s[i]=='1') count++;
if(s[i]!='1') break;
}
if(k>count){
rep(i,100){
if(s[i]!='1'){
cout << s[i] << endl;
return 0;
}
}
}
if(k<=count) cout << 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(x) cout << #x << " = " << (x) << endl
#define vuniq(v) v.erase(unique(v.begin(), v.end()), v.end());
#define mins(m, s) m.insert(make_pair(s, 1));
#define mfin(m, s) m.find(s) != m.end()
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
int main(){
ll n, ans = 0;
string s;
map<string, ll> m;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> s;
asort(s);
m[s]++;
}
for (auto e : m) {
ll cnt = e.second * (e .second - 1) / 2;
ans += cnt;
}
cout << ans << endl;
return 0;
}
| 0 | 92,219,361 |
#include <bits/stdc++.h>
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ ";
for(auto v:V)os << v << " "; return os << "]";
}
template<class T> ostream& operator<<(ostream &os, set<T> S){ os << "{ ";
for(auto s:S) os<<s<<" "; return os<<"}";
}
template<class L, class R> ostream& operator<<(ostream &os, pair<L,R> P) {
return os<<"("<<P.first<<","<< P.second << ")";
}
template<class L, class R> ostream& operator<<(ostream &os, map<L,R> M) {
os<<"{ ";for(auto m:M)os<<"("<<m.first<<":"<<m.second<<")";
return os<<"}";
}
#define cerr cout
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...) 1
#endif
#define ll long long
#define ld long double
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define I insert
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define all(v) (v).begin(),(v).end()
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef vector<pii> vpii;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mp make_pair
const int mod = 1e9+7;
inline int add(int a,int b){a+=b;if(a>=mod)a-=mod; return a;}
inline int sub(int a,int b){a-=b;if(a<0) a += mod; return a;}
inline int mul(int a, int b){ return a*1ll*b%mod;}
inline int power(int x, ll y){
int res = 1;
while(y){
if(y&1) res = mul(res , x);
x = mul(x,x);
y >>= 1;
}
return res;
}
const int N = 5e3 + 100;
const ll INF = 1e18;
vector<vll> v;
int P[N];
ll C[N];
bool vis[N];
ll k;
ll solve(vll &vec){
ll tot = 0;
ll n = vec.size();
for(auto it : vec) tot += it;
ll ans = tot*(k/n);
ll p = k%n;
vll q = vec;
for(auto it : vec) q.push_back(it);
if(p == 0) return ans;
ll curr = 0;
ll mx = -INF;
for(int i = 0;i < p-1; ++i){
curr += q[i];
}
for(int i = p-1;i < 2*n; ++i){
curr += q[i];
mx = max(mx , curr);
curr -= q[i-(p-1)];
}
return ans+mx;
}
int main(){
fio; cout<<fixed<<setprecision(25);
int n; cin >> n;
cin >> k;
for(int i =1 ;i <= n ; ++i) cin >> P[i];
for(int i =1;i <= n ; ++i) cin >> C[i];
for(int i = 1;i <= n ; ++i){
if(!vis[i]){
int id = i;
vll vv;
while(!vis[id]){
vv.push_back(C[id]);
vis[id] =1;
id = P[id];
}
v.push_back(vv);
}
}
ll ans = -INF;
for(auto &it : v){
for(ll i = 1;i <= min(n*1ll,k); ++i){
ll tmp = k;
k = i;
ans = max(ans , solve(it));
k = tmp;
}
for(ll i = k;i >= max(1ll, k-n);--i){
ll tmp = k;
k = i;
ans = max(ans , solve(it));
k = tmp;
}
ans = max(ans , solve(it));
}
cout << ans << endl;
return 0;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
ll A, B, K;
cin >> A >> B >> K;
if(A > K) {
A = A - K;
} else {
K = K - A;
A = 0;
if (B > K) {
B = B - K;
} else {
B = 0;
}
}
cout << A << " " << B << endl;
return 0;
}
| 0 | 100,312,714 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
rep(i, s.size()) {
if(i % 2 == 0) cout << s[i];
}
cout << endk;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS std::cin.tie(0);std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define vvp vector<vector<pair<int,int>>>
using Graph = vector<vector<int>>;
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define output_s(s) printf("%s\n",(s).c_str())
#define END cout<<"\n"
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define RepS(i,n,m) for(int i=(int)(n);i<=(int)(m);i++)
#define RRepS(i,n,m) for(int i=(int)(n);i>=(int)(m);i--)
#define SRepS(i,n,m) for(int i=(int)(n);i*i<=(int)(m);i++)
#define RepA(x) for(auto &item:(x))
void CINT(){}
template<class Head,class... Tail> void CINT(Head&& head,Tail&&... tail){cin>>head; CINT(move(tail)...);}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
#define VCIN(x) for(auto &item:x) cin>>item
void OUT(){}
template<class Head,class...Tail> void OUT(Head&& head,Tail&&...tail){cout<<head<<(sizeof...(tail)?" ":"\n"); OUT(move(tail)...);}
#define COUT(...) OUT(__VA_ARGS__)
template<typename TypeInt>TypeInt GCD(TypeInt a,TypeInt b){return a%b==0?b:GCD(b,a%b);}
template<typename TypeInt>TypeInt LCM(TypeInt a,TypeInt b){return a*b/GCD(a,b);}
template<class T>inline bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
template<class T>bool comp(T a,T b){return abs(a)<abs(b);}
void YES(bool f){printf(f?"YES\n":"NO\n");}
void Yes(bool f){printf(f?"Yes\n":"No\n");}
void Possible(bool f){printf(f?"Possible\n":"Impossible\n");}
void POSSIBLE(bool f){printf(f?"POSSIBLE\n":"IMPOSSIBLE\n");}
void PrimeFactorize(long long num,vector<long long> &ret){
vector<long long> prime(num+1,0);
vector<long long>::iterator it;
while(num%2==0){
num /= 2;
prime[2]++;
}
for(int i=3;i<=num;i++){
while(num%i==0){
num /= i;
prime[i]++;
}
}
copy(prime.begin(),prime.end(),back_inserter(ret));
}
bool IsPrime(int x){
if(x<2) return false;
else if(x==2) return true;
else if(x%2==0) return false;
for(int i=3;i*i<=x;i+=2){
if(x%i==0)return false;
}
return true;
}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const int NMAX = 55;
const int INF = 1e9;
const long long LINF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9+7;
bool flag = false;
signed main(){
SCIN(s);
int n=s.size();
vi a(n+1,0);
rep(i,n){
if(s[i]=='<')chmax(a[i+1],a[i]+1);
}
RRepS(i,n-1,0){
if(s[i]=='>')chmax(a[i],a[i+1]+1);
}
ll ans=0;
rep(i,n+1)ans+=a[i];
COUT(ans);
return 0;
}
| 0 | 39,974,480 |
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
ll ans = LLONG_MIN;
for (int i = 0; i < n; ++i) {
vector<bool> vis(n);
int idx = i;
vector<ll> sum = {0}, hi = {LLONG_MIN};
while (!vis[p[idx] - 1]) {
idx = p[idx] - 1;
vis[idx] = true;
sum.emplace_back(sum.back() + c[idx]);
hi.emplace_back(max(hi.back(), sum.back()));
}
int m = sum.size() - 1;
int f = k / m, rem = k % m;
ll result;
if (f > 0)
result = max(hi[m], max(sum[m] * f + (rem == 0 ? 0 : hi[rem]),
sum[m] * (f - 1) + hi[m]));
else
result = hi[rem];
ans = max(ans, result);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin >> S >> T;
if( S.size() < T.size() ){
cout << "UNRESTORABLE" << endl;
return 0;
}
bool same = true;
string ans = "UNRESTORABLE";
for(int i=0;i<=S.size()-T.size();i++){
for(int j=0;j<T.size();j++){
if( S.at(i+j) != T.at(j) && S.at(i+j) != '?' ){
same = false;
}
}
if(same){
ans = S;
for(int j=0;j<S.size();j++){
if(S.at(j) == '?') ans.at(j) = 'a';
}
for(int j=0;j<T.size();j++){
ans.at(i+j) = T.at(j);
}
}
same = true;
}
cout << ans << endl;
return 0;
}
| 0 | 55,390,395 |
#include <iostream>
int main(){
int N, K;
std::cin >> N >> K;
int ans = K;
for (int i=0; i<N-1; i++){
ans = ans * (K-1);
}
std::cout << ans << std::endl;
}
|
#include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
long long K;
cin >> S;
cin >> K;
long long num1st1 = 0;
long long the1stNon1 = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '1') {
++num1st1;
}
else {
the1stNon1 = S[i] - '0';
break;
}
}
if (K <= num1st1) {
cout << 1 << endl;
}
else {
cout << the1stNon1 << endl;
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 0 | 90,553,170 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
char b;
signed main() {
cin >> b;
if (b=='A') cout << 'T' << endl;
else if (b=='T') cout << 'A' << endl;
else if (b=='C') cout << 'G' << endl;
else cout << 'C' << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 1000)
{
string t = "000";
int a = i;
rep(j, 3)
{
if (a == 0)
break;
t[2 - j] = a % 10 + '0';
a /= 10;
}
int cnt = 0;
bool found = false;
rep(j, s.size())
{
if (s[j] == t[cnt])
{
cnt++;
if (cnt == 3)
{
found = true;
break;
}
}
}
if (found)
ans++;
}
cout << ans << endl;
return 0;
}
| 0 | 50,532,857 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
template <typename T>
void ce(const T n){cerr << n << endl;}
template <typename T>
void ce(initializer_list<T> v){for(T i : v) cerr << i << ' '; cout << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 2019;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);
int main(void){
ll n, k;
cin >> n >> k;
VecP a(n);
rep(i, n) cin >> a[i].sc >> a[i].fs;
sort(all(a));
reverse(all(a));
Vec cs(n);
rep(i, n){
if(i == 0) cs[i] = a[i].fs;
else cs[i] = cs[i - 1] + a[i].fs;
}
VecB used(n, false);
unordered_set<ll> ust;
ll ans = 0, sum = 0;
ll l = k - 1, r = 0;
repn(i, k){
while(r < n && ust.find(a[r].sc) != ust.end()) r++;
if(r >= n) break;
ust.insert(a[r].sc);
used[r] = true;
if(r <= l) chmax(ans, cs[l] + i * i);
else{
sum += a[r].fs;
while(used[l]){
sum += a[l--].fs;
}
l--;
if(l < 0) break;
chmax(ans, cs[l] + sum + i * i);
}
ce({l, r, ans});
}
co(ans);
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
enum {L, R};
const int keys[] = {
L, L, L, L, L, L, L, R, R, R, R, R, R, R,
R, R, L, L, L, L, R, L, L, L, R, L
};
int main() {
for (;;) {
string line;
cin >> line;
if (line == "#") break;
int len = line.length();
int prv = keys[line[0] - 'a'];
int count = 0;
for (int i = 1; i < len; i++) {
int cur = keys[line[i] - 'a'];
if (prv != cur) count++;
prv = cur;
}
cout << count << endl;
}
return 0;
}
| 0 | 86,949,819 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.