code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 44
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, M;
cin >> N >> M;
multiset<long long> A;
for(size_t i = 0; i < N; i++) {
long long a;
cin >> a;
A.insert(a);
}
for(int i = 0; i < M; i++) {
auto itr = A.end();
itr--;
long long a = *itr;
A.erase(itr);
A.insert(a / 2);
}
for(long long a : A) {
ans += a;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
vector<int>v;
int n;
int a;
for (int i = 0; i<9; i++){
cin>>a;
v.push_back(a);
}
cin>>n;
set<int>s;
for (int i = 0; i<n; i++){
cin>>a;
s.insert(a);
}
int b,c;
for (int i = 0; i<9; i+=3){
a = v[i];
b = v[i+1];
c = v[i+2];
if (s.count(a) && s.count(b) && s.count(c)){
cout<<"Yes";
return 0;
}
}
for (int i = 0; i<3; i++){
a = v[i];
b = v[i+3];
c = v[i+6];
if (s.count(a) && s.count(b) && s.count(c)){
cout<<"Yes";
return 0;
}
}
a = v[0];
b = v[4];
c = v[8];
if (s.count(a) && s.count(b) && s.count(c)){
cout<<"Yes";
return 0;
}
a = v[2];
b = v[4];
c = v[6];
if (s.count(a) && s.count(b) && s.count(c)){
cout<<"Yes";
return 0;
}
cout<<"No";
return 0;
}
| 0
| 15,984,307
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int,int> dic;
for(int i=0;i<N;i++){
int a;
cin>>a;
dic[a]++;
}
int sum=0;
for(auto & x:dic){
if(x.first>x.second){
sum+=x.second;
}
else{
sum+=(x.second-x.first);
}
}
cout<<sum<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<int> a(n);
priority_queue<int> q;
ll extra=0,ans=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
int b;
cin>>b;
if(a[i]<b) ans++,extra+=b-a[i];
else q.push(a[i]-b);
}
while(extra>0){
if(q.empty()){
cout<<-1<<endl;
return 0;
}
int x=q.top();
q.pop();
extra-=x;
if(x!=0) ans++;
}
cout<<ans<<endl;
}
| 0
| 34,988,048
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n, m;
char tmp;
string ans = "";
while (true){
cin >> n;
if (n == 0)
break;
vector<char> before(n);
vector<char> after(n);
for (int i = 0; i < n; ++i){
cin >> before[i];
cin >> after[i];
}
cin >> m;
for (int i = 0; i < m; ++i){
cin >> tmp;
for (int j = 0; j < n; ++j){
if (tmp == before[j]){
tmp = after[j];
break;
}
}
ans += tmp;
}
cout << ans << endl;
ans = "";
before.clear();
after.clear();
}
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
using namespace __gnu_pbds;
#define data_set(type) tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define ld long double
#define f(i,x,n) for(int i=x;i<=n;i++)
#define fe(x,v) for(auto &x :v)
#define nf(i,x,n) for(int i=n;i>=x;i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define ook(num) order_of_key(num)
#define fbo(num) find_by_order(num)
#define gcd(a,b) __gcd(a,b)
#define bits(n) __builtin_popcountll(n)
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define RE rend()
#define RB rbegin()
#define B begin()
#define E end()
#define acc(v, x) accumulate(all(v), x)
#define p(a,b) pair<a,b>
#define F first
#define S second
#define sz size()
#define v(x) vector<x>
#define m(a,b) map<a,b>
#define u_m(a,b) unordered_map<a,b>
#define mm(a,b) multimap<a,b>
#define s(a) set<a>
#define us(a) unordered_set<a>
#define ms(a) multiset<a>
#define maxy __LONG_LONG_MAX__
#define miny INT_MIN
#define PI 3.14159265358979323846
const int inf= 1e9 +1;
const int inf64= 1e18 -1;
const int MOD= 1e9 +7;
void Solve()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
while(b<=a && k>0)
{
b *=2;
k--;
}
while(c<=b && k>0)
{
c *=2;
k--;
}
if(c>b && b>a) cout<<"Yes";
else cout<<"No";
}
signed main()
{
speed
int q=1;
while(q--)
Solve();
return 0;
}
| 0
| 83,595,346
|
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl
#define YORN(f) cout<<((f)?"YES":"NO")<<endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
yorn(a <= c && c <= b);
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod = 998244353;
vector<int> fac(300001);
vector<int> ifac(300001);
long long fpow(long long a,long long n){
long long ret=1;
if(n==1) return a;
if(n%2==0) {
ret = fpow(a*a%mod, n/2) %mod ;
}else {
ret = (a%mod)*fpow(a*a%mod, n/2) %mod;
}
return ret %mod;
}
int comb(int a, int b){
if(a == 0 && b == 0)return 1;
if(a < b || a < 0)return 0;
int tmp = ifac[a-b]* ifac[b] % mod;
return tmp * fac[a] % mod;
}
const double PI=3.14159265358979323846;
int dp[100][100];
int tmp[100][100];
signed main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = b-a+1;
int aa = a-1;
int tmp1 = b/d + b/c - b/(d*c/__gcd(d,c));
int tmp2 = aa/d + aa/c - aa/(d*c/__gcd(d,c));
ans -= (tmp1- tmp2);
cout << ans << endl;
return 0;
}
| 0
| 47,310,347
|
#include "bits/stdc++.h"
using namespace std;
typedef long double ll;
#define REP(i, a, b) for(ll i = ll(a); i <= ll(b); i++)
int main()
{
ll a,b;
cin>>a>>b;
if(a>b)
cout<<"GREATER";
else if(a<b)
cout<<"LESS";
else if(a==b)
cout<<"EQUAL";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll A, B, C, D;
cin >> A >> B >> C >> D;
if(A+B > C+D){
cout << "Left" << endl;
}
else if(A+B == C+D){
cout << "Balanced" << endl;
}
else{
cout << "Right" << endl;
}
return 0;
}
| 0
| 66,394,731
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}
int main(void){
loop(i,1,10)loop(j,1,10)cout<<i<<"x"<<j<<"="<<i*j<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
string s;
vector<char> c;
cin >> s;
rep(i, s.size()) if (s[i] != 'x') c.push_back(s[i]);
bool ok = false;
for (int i = 0; i < c.size() / 2; ++i) {
if (c[i] == c[c.size() - 1 - i])
continue;
else
ok = true;
}
if (s.size() == 1) {
puts("0");
return 0;
}
if (ok) {
puts("-1");
return 0;
}
int i = 0, j = s.size() - 1;
do {
if (s[i] == s[j]) {
i++, j--;
} else {
if (s[i] == 'x') {
i++;
ans++;
} else {
j--;
ans++;
}
}
} while (i <= j);
cout << ans << endl;
return 0;
}
| 0
| 96,623,887
|
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a*a-b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
clock_t startTime;
long double getTime(){
return (long double)(clock()-startTime)/CLOCKS_PER_SEC;
}
int main(){
startTime=clock();
int n;
cin >> n;
ll a[n],b[n];
ll k=0;
ll sum=0;
FOR(i,n){
cin >> a[i];
}
FOR(i,n){
cin >> b[i];
}
FOR(i,n){
sum+=b[i]-a[i];
if(a[i] < b[i])
k+=(b[i]-a[i]+1)/2;
}
if(sum < 0) {cout << "No"; return 0;}
else if(k > sum) cout << "No";
else cout << "Yes";
return 0;
}
| 0
| 33,824,216
|
#include <bits/stdc++.h>
#define MOD 1e9+7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
int n, m;
cin >> n >> m;
int t = 100 * (n - m) + 1900 * m;
cout << t * (1 << m) << endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> istream& operator>>(istream &is, pair<S, T> &p){ return is >> p.first >> p.second; }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ return os << "[" << p.first << ", " << p.second << "]"; }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define For1(i, n) for(int i = 1; i <= (n); i ++)
#define Rof(i, n) for(int i = (n)-1; i >= 0; i --)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
#define Return(x) { Cout(x); return 0; }
int main(void){
Cin(int, n, k);
Cins(int, n, a);
vc<ll> b;
b.reserve(n*(n+1)/2);
Cusum(ll, a, sa);
For(l, n) for(int r = l; r < n; r ++) b.push_back(sa[r+1] - sa[l]);
ll ans = 0;
for(ll d = 62; d >= 0; d --){
ll mask = 1ll << d;
ans ^= mask;
int c = 0;
for(ll &x : b) if((ans & x) == ans) c ++;
if(c < k) ans ^= mask;
}
Cout(ans);
}
| 0
| 8,921,567
|
#include<bits/stdc++.h>
using namespace std;
long long read()
{
char ch=getchar();long long x=0,ff=1;
while(ch<'0'||ch>'9') {if(ch=='-') ff=-ff;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*ff;
}
void write(long long aa)
{
if(aa<0) putchar('-'),aa=-aa;
if(aa>9) write(aa/10);
putchar(aa%10+'0');
return;
}
long long n,m,ans,X,Y,K,ff,col;
long long vis[200005];
long long tot,head[200005],nx[800005],to[800005];
void jia(long long aa,long long bb)
{
tot++;
nx[tot]=head[aa];
to[tot]=bb;
head[aa]=tot;
return;
}
void dfs(int rt)
{
vis[rt]=col;
if(rt<=n&&vis[rt+n]==col) ff=1;
else if(rt>n&&vis[rt-n]==col) ff=1;
for(int i=head[rt];i;i=nx[i])
{
int yy=to[i];
if(vis[yy]) continue;
dfs(yy);
}
return;
}
int main()
{
n=read();m=read();
for(int i=1;i<=m;++i)
{
int x=read(),y=read();
jia(x,y+n);jia(y+n,x);
jia(y,x+n);jia(x+n,y);
}
for(int i=1;i<=n*2;++i) if(!vis[i])
{
ff=0;++col;dfs(i);
if(!head[i]) K++;
else if(!ff) X++;
else Y++;
}
X/=2;K/=2;
write(X*(2*X+Y)+Y*(X+Y)+K*2*n-K*K);
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> X;
vector<string> U;
for (int i = 0; i < N; i++) {
float x;
string u;
cin >> x >> u;
X.push_back(x);
U.push_back(u);
}
float total_yen = 0.0;
for (int i = 0; i < N; i++) {
if (U[i] == "JPY") {
total_yen = total_yen + X[i];
}
else if (U[i] == "BTC") {
total_yen = total_yen + X[i]* 380000.0;
}
}
cout << total_yen << endl;
}
| 0
| 59,663,242
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#define inf 1e9+7
#define pb push_back
#define make make_pair
#define kaku(a) cout << a << endl;
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define PI 3.14159265359
long long gcd(long long a,long long b){ return b==0?a:gcd(b,a%b);}
long long lcm(long long a,long long b){ return a/gcd(a,b)*b;}
typedef pair<ll,ll> Pair;
typedef set<ll> Set;
const ll max_s=1000010;
const ll MOD=1e9+7;
string s;
ll dp1[max_s],dp2[max_s];
void dp(){
if(s[0]==0){
dp1[0]=1;
dp2[0]=0;
}
else{
dp1[0]=2;
dp2[0]=1;
}
for(ll i=1;i<s.size();i++){
if(s[i]=='0'){
dp1[i]=dp1[i-1];
dp2[i]=dp2[i-1]*3;
dp2[i]%=MOD;
}
else{
dp1[i]=dp1[i-1]*2;
dp1[i]%=MOD;
dp2[i]=dp1[i-1]+dp2[i-1]*3;
dp2[i]%=MOD;
}
}
}
int main(){
cin >> s;
rep(i,max_s){
dp1[i]=0;dp2[i]=0;
}
dp();
cout << (dp1[s.size()-1]+dp2[s.size()-1])%MOD << endl;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v;
for (int i = 0; i < n - 1; i++) {
vector<int> vv(3, 0);
cin >> vv[0] >> vv[1] >> vv[2];
v.push_back(vv);
}
for (int i = 0; i < n - 1; i++) {
int t = v[i][1];
for (int j = i; j < n - 1; j++) {
t = max(t, v[j][1]);
if ((t - v[j][1]) % v[j][2] > 0) {
t = v[j][1] + ((t - v[j][1]) / v[j][2] + 1) * v[j][2];
}
t += v[j][0];
}
cout << t << endl;
}
cout << 0 << endl;
}
| 0
| 83,587,586
|
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
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++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
while(scanf("%d",&n),n)
{
int m=0;
memset(map,INF,sizeof(map));
for(i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&t);
map[a][b]=map[b][a]=min(map[a][b],t);
if(a>m) m=a;
if(b>m) m=b;
}
floyd(m);
int tmp=0,ans=INF,k;
for(i=0;i<=m;i++)
{
for(j=0;j<=m;j++)
{
if(i==j)
continue;
tmp+=map[i][j];
}
if(tmp<ans)
{
ans=tmp;
k=i;
}
tmp=0;
}
printf("%d %d\n",k,ans);
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
typedef long long int ll;
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> b(n);
rep (i, n-1) cin >> b[i];
int A = 0;
rep (i, n) {
if (i == 0)
A += b[0];
else if (i == n - 1)
A += b[n - 2];
else
A += min(b[i - 1], b[i]);
}
cout << A << endl;
return 0;
}
| 0
| 3,691,166
|
#include<bits/stdc++.h>
#define ntest 0
using namespace std;
long long x[5], res;
void solve() {
for (int i = 1; i <= 4; ++i) cin >> x[i];
res = LLONG_MIN;
for (int i = 1; i <= 2; ++i)
for (int j = 3; j <= 4; ++j) res = max(res, x[i] * x[j]);
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if(ntest){
int t;
cin >> t;
while(t--) solve();
} else {
solve();
}
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <numeric>
#include <float.h>
#include <math.h>
#include <sstream>
#include <iterator>
using namespace std;
using Graph = vector<vector<int>>;
#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 all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vi vector<int>
#define vl vector<ll>
const long long INF = 1LL << 60;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
bool is_prime(const unsigned n){
switch(n){
case 0:
case 1: return false;
case 2:
case 3: return true;
}
if(n % 2 == 0 || n % 3 == 0) return false;
for(unsigned i = 5; i * i <= n; i += 6) {
if(n % i == 0) return false;
if(n % (i+2) == 0) return false;
}
return true;
}
map<int,int> mp;
int primeFactorization(int a){
int i,sq;
if(a%2==0){
if(!mp.count(2)){
mp[2] = 1;
}
else{
mp[2] +=1;
}
return primeFactorization(a/2);
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
if(!mp.count(i)){
mp[i] = 1;
}
else{
mp[i] += 1;
}
return primeFactorization(a/i);
}
}
if(a!=1){
if(!mp.count(a))
mp[a] = 1;
else{
mp[a] += 1;
}
}
return 0;
}
ll kaizyou(ll n){
if(n == 1){
return 1;
}
else{
return (n * kaizyou(n-1)) % 1000000007;
}
}
int main(){
int n; cin >> n;
vi e;
vi o;
rep(i,n){
int a; cin >> a;
if(i % 2 == 0) e.push_back(a);
else o.push_back(a);
}
if(n % 2 == 0){
reverse(all(o));
for(auto u: o){
cout << u << " " ;
}
for(auto v: e){
cout << v << " " ;
}
cout << endl;
}
else{
reverse(all(e));
for(auto u: e){
cout << u << " ";
}
for(auto v: o){
cout << v << " ";
}
cout << endl;
}
}
| 0
| 31,960,200
|
#include <iostream>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
using lli = long long int;
using Vint = vector<int>;
using Vlli = vector<lli>;
using Wint = vector<Vint>;
using Wlli = vector<Vlli>;
using pii = pair<int, int>;
using pll = pair<lli, lli>;
constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1), make_pair(0, -1)};
constexpr char BR = '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); (i)++)
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); i--)
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
template <class T> inline int argmin(vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){a = max(a, b);}
template <class T> inline void chmin(T &a, T b){a = min(a, b);}
inline int toInt(string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline int toInt(const string s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
if(n == 0) return "0";
std::string res = "";
if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
std::reverse(res.begin(), res.end()); return '-' + res;}
while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}
class Solve{
private:
int n, k;
Vint A, non_negative_A;
Vlli subSum_A, subSum_non_negative_A;
public:
void input_n_and_k(void){scanf("%d%d\n", &n, &k);}
void input_As(void){
A.resize(n); non_negative_A.resize(n); subSum_A.resize(n + 1); subSum_non_negative_A.resize(n + 1);
subSum_A.at(0) = 0; subSum_non_negative_A.at(0) = 0;
REP(i, n){
int u; scanf("%d", &u);
A.at(i) = u; non_negative_A.at(i) = max(0, u);
subSum_A.at(i + 1) = subSum_A.at(i) + u;
subSum_non_negative_A.at(i + 1) = subSum_non_negative_A.at(i) + non_negative_A.at(i);
}
}
lli from_x(int x){
lli sum1, sum2, sum3;
sum1 = subSum_non_negative_A.at(x);
sum2 = max(0LL, subSum_A.at(x + k) - subSum_A.at(x));
sum3 = subSum_non_negative_A.at(n) - subSum_non_negative_A.at(x + k);
return sum1 + sum2 + sum3;
}
lli solve(void){
lli res = -INFi;
FOReq(i, 0, (const int)(n - k)) chmax(res, from_x(i));
return res;
}
};
int main(void){
Solve sss;
sss.input_n_and_k();
sss.input_As();
printf("%lld\n", sss.solve());
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll cnt_p[52], cnt_all[52];
ll recursion(ll n, ll x) {
if (n == 0) {
if (x <= 0)
return 0;
else
return 1;
}
if (x - 1 <= cnt_all[n - 1]) {
return recursion(n - 1, x - 1);
} else {
return cnt_p[n - 1] + 1 + recursion(n - 1, x - 2 - cnt_all[n - 1]);
}
}
int main() {
ll N, X;
cin >> N >> X;
cnt_p[0] = 1;
cnt_all[0] = 1;
for (int i = 1; i <= N; i++) {
cnt_p[i] = 2 * cnt_p[i - 1] + 1;
cnt_all[i] = 2 * cnt_all[i - 1] + 3;
}
ll ans = recursion(N, X);
cout << ans << endl;
return 0;
}
| 0
| 7,769,100
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
int A,B,C;
cin >> A >> B >> C;
vector<int> V(100);
rep(i,100) {
V[i] = A*(i + 1)%B;
}
int flag = 0;
rep(j,100) {
if (V[j] == C) {
cout << "YES" << endl;
flag++;
break;
}
}
if (flag == 0) {
cout << "NO" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string in,out;
cin>>in;
int j=0;
for(int i=0;i<in.size();i++){
if(in.at(i)=='0'){
out.push_back(j);
out.at(j)='0';
j++;
}else if(in.at(i)=='1'){
out.push_back(j);
out.at(j)='1';
j++;
}else if(out.size()>0){
out.pop_back();
j--;
}
}
cout<<out<<endl;
}
| 0
| 57,614,863
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
const long long INF = 100000000;
long long N, M, R;
cin >> N >> M >> R;
vector<long long>r(R);
for(long long i = 0; i < R; ++i){
cin >> r[i];
--r[i];
}
vector<vector<long long>>adj(N, vector<long long>(N, INF));
for(long long i = 0; i < M; ++i){
long long A, B, C;
cin >> A >> B >> C;
--A;--B;
adj[A][B] = adj[B][A] = C;
}
for(int k=0;k<N;++k){
for(int i=0;i<N;++i){
for(int j=0;j<N;++j){
if(adj[i][k]!=INF&&adj[k][j]!=INF){
adj[i][j]=min(adj[i][j],adj[i][k]+adj[k][j]);
}
}
}
}
long long ans=100000000;
sort(r.begin(),r.end());
do{
long long tmp=0;
for(int i=1;i<R;++i)tmp+=adj[r[i-1]][r[i]];
ans=min(ans,tmp);
}while(next_permutation(r.begin(),r.end()));
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
const int mx = 1e5 + 5;
int vis[mx], val[mx];
int n, m;
vector<pii> G[mx];
bool dfs(int x){
vis[x] = 1;
for(pii u : G[x]){
if(vis[u.first]){
if(val[u.first] != val[x] + u.second) return false;
else continue;
}
val[u.first] = val[x] + u.second;
if(!dfs(u.first)) return false;
}
return true;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n >> m;
for(int i = 0, a, b, w; i < m; i++){
cin >> a >> b >> w;
G[a].emplace_back(b,w);
G[b].emplace_back(a,-w);
}
for(int i = 1; i <= n; i++){
if(!vis[i] && !dfs(i)){
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
}
| 0
| 83,344,278
|
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 100010;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll odd = 0,even = 0;
ll n,p,a;
cin >> n >> p;
rep(i,n){
cin >> a;
if (a%2) odd++;
else even++;
}
ll ans;
if (p == 0){
ans = pow(2,even)*(odd == 0 ? 1 : pow(2,odd-1));
}
else{
ans = pow(2,even)*(odd == 0 ? 0 : pow(2,odd-1));
}
PRINT(ans);
}
|
#include <iostream>
#include <vector>
using namespace std;
const int N=200001;
bool vis[N];
int count=0;
void dfs(vector<vector<int>> &g, int root){
vis[root]=true;
count+=1;
for(int v:g[root]){
if(!vis[v]){
dfs(g,v);
}
}
}
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> g(n);
for(int i=0; i<m;++i){
int u,v;
cin>>u>>v;
u--;v--;
g[u].push_back(v);
g[v].push_back(u);
}
int mx=0;
for(int i=0;i<n; ++i){
count=0;
if(!vis[i]){
dfs(g,i);
}
mx=max(mx,count);
}
cout<<mx<<endl;
return 0;
}
| 0
| 32,168,411
|
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
double S(double a, double b, double c, double d, double e, double f) {
double ans;
ans = abs((a*1000 - e*1000) * (d*1000 - f * 1000) - (b * 1000 - f * 1000) * (c * 1000 - e * 1000));
return ans;
}
int main(){
double x[4], y[4], s[3], SS, SSS;
while(true){
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
if (cin.eof()) { break; }
s[0] = S(x[0], y[0], x[1], y[1], x[3], y[3]);
s[1] = S(x[0], y[0], x[2], y[2], x[3], y[3]);
s[2] = S(x[1], y[1], x[2], y[2], x[3], y[3]);
if(s[0] * s[1] * s[2] == 0){
cout << "NO" << endl;
continue;
}
SS = s[0] + s[1] + s[2];
SSS = S(x[0], y[0], x[1], y[1], x[2], y[2]);
if (SS == SSS) { cout << "YES" << endl; }
else { cout << "NO" << endl; }
}
return 0;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include <queue>
#include<boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::multiprecision;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIF(v, n) printf("%."#n"f\n", v)
#define PRIY PRI("Yes")
#define PRIN PRI("No")
template<typename A, typename B>
void mins(A & a, const B & b) { a = min(a, (A)b); };
template<typename A, typename B>
void maxs(A & a, const B & b) { a = max(a, (A)b); };
double eps = 1e-4;
double integ(double v1, double v2, double dx) {
return (v1 + v2) * dx / 2.0;
}
int main() {
double inf = 1e18;
ll N; cin >> N;
vector<double> T(N+1);
vector<double> V(N);
T[0] = 0;
REP(i, 1, N+1) {
cin >> T[i];
T[i] += T[i - 1];
}
REP(i, 0, N) cin >> V[i];
vector<double> val(2 * T.back() + 1);
vector<double> tbl_r(N), tbl_l(N);
tbl_l[0] = inf;
tbl_r[N - 1] = inf;
REP(i, 1, N)tbl_l[i] = min(tbl_l[i - 1], V[i - 1] - T[i]);
for (int i = N - 2; i >= 0; --i) tbl_r[i] = min(tbl_r[i + 1], V[i + 1] + T[i + 1]);
val[0] = 0;
int area = 0;
REP(i, 1, 2 * T.back() + 1) {
double t = (double)i / 2.0;
if (t > T[area+1]) ++area;
double ceil_val = min(t, T.back() - t);
mins(ceil_val, V[area]);
mins(ceil_val, tbl_l[area] + t);
mins(ceil_val, tbl_r[area] - t);
if (val[i - 1] + 0.5 < ceil_val + eps) val[i] = val[i - 1] + 0.5;
else if (val[i - 1] < ceil_val + eps) val[i] = val[i - 1];
else val[i] = val[i - 1] - 0.5;
}
double ans = 0;
REP(i, 1, 2 * T.back() + 1) ans += integ(val[i], val[i - 1], 0.5);
PRIF(ans, 5);
return 0;
}
| 0
| 57,741,357
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int dp[N];
int a[N];
int b[N];
void solve(){
memset(dp,0x3f,sizeof dp);
int h,n;
cin>>h>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
}
dp[0] = 0;
for(int i=1;i<=1e4+h;i++){
for(int j=1;j<=n;j++){
if(i>=a[j]){
dp[i] = min(dp[i],dp[i-a[j]]+b[j]);
}
}
}
int ans = 1e9;
for(int i=h;i<1e4+h;i++)ans =min(ans,dp[i]);
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
#define REP(i, vec) for(auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 1000000007;
const int inf = (1 << 21);
const long long INF = 1LL << 60;
using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;
using vll = vector<pair<ll, ll>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template<class T> inline T LCM(T a, T b) { return (a + (b - 1)) / b; }
int round_int(int a, int b) { return (a + (b - 1)) / b; }
constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };
constexpr array<int, 10> cost = { -1,2,5,5,4,5,6,3,7,6 };
int calc_cost(deque<int> d) {
int res = 0;
while (!d.empty()) {
int v = d.front(); d.pop_front();
res += cost[v];
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
vi a(m);
rep(i, m) cin >> a[i];
vector<vector<deque<int>>> dp(n + 1, vector<deque<int>>(m));
for (int i = 0; i <= n; ++i) {
for (int j = 0; j < m; ++j) {
int c = cost[a[j]];
if (i - c >= 0 && calc_cost(dp[i - c][j]) + c == i) {
deque<int> pre = dp[i - c][j];
if (pre.size() == 0) pre.push_back(a[j]);
else if (pre.front() > a[j]) pre.push_back(a[j]);
else pre.push_front(a[j]);
dp[i][j] = pre;
}
if (j != 0) {
deque<int> pre = dp[i][j - 1];
if (pre.size() < dp[i][j].size()) continue;
else if (pre.size() > dp[i][j].size()) dp[i][j] = pre;
else if (pre.size() == dp[i][j].size()) {
if (pre.size() == 0) continue;
deque<int> tmp1 = pre, tmp2 = dp[i][j];
for (int k = 0; k < pre.size(); ++k) {
int l = tmp1.front(), r = tmp2.front();
tmp1.pop_front(), tmp2.pop_front();
if (l > r) {
dp[i][j] = pre;
break;
}
else if (l < r) {
break;
}
}
}
}
}
}
int mx = dp[n][m - 1].size();
rep(i, mx) {
int v = dp[n][m - 1].front(); dp[n][m - 1].pop_front();
cout << v;
}
}
| 0
| 33,204,127
|
#include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int sum = 0;
int largest = 0;
int smallest = 1000;
for (int i = 0; i < N; ++i) {
cin >> S;
if (largest < S) {
largest = S;
} if (smallest > S) {
smallest = S;
}
sum += S;
}
cout << ((sum - largest - smallest) / (N - 2)) << endl;
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define MAX_INT 15
#define PI 3.141592653589793
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi(a, b, c, d) for(int a = b; a < c; a += d)
#define fl(a, b, c, d) for(ll a = b; a < c; a += d)
#define fei(a, b, c, d) for(int a = b; a <= c; a += d)
#define fel(a, b, c, d) for(ll a = b; a <= c; a += d)
#define quit exit(0)
#define mem(x, a) memset(x, a, sizeof x)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcl pair<char, ll>
#define psl pair<string, ll>
ll N, M, A, B, C;
ll arr[MAX_INT], arr1[MAX_INT], data[MAX_INT];
vector<ll> V;
unordered_map<ll, ll> mp;
set<ll> s;
string S1 = "";
string S2 = "";
string S3 = "";
ll cases;
int main() {
go;
cin >> S1 >> S2 >> S3;
cout << (char)(toupper(S1[0])) << (char)(toupper(S2[0])) << (char)(toupper(S3[0])) << "\n";
return 0;
}
| 0
| 252,553
|
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,s,e) for(int i=s;i<e;i++)
#define reple(i,s,e) for(int i=s;i<=e;i++)
#define revrep(i,n) for(int i=n-1;i>=0;i--)
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define all(x) (x).begin(),(x).end()
int main()
{
int N;
cin >> N;
string S;
cin >> S;
map<char, ll> counts;
rep(i, N) counts[S[i]]++;
ll ans = 1;
for (auto n : counts)
{
ans *= (n.second + 1);
ans %= mod;
}
cout << ans - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
string s;
cin >> s;
ll n = s.length();
for (int i = 0; i < n - 1; i++)
{
if (s[i] == s[i + 1])
{
cout << i + 1 << " " << i + 2 << endl;
return 0;
}
}
for (int i = 0; i < n - 2; i++)
{
if (s[i] == s[i + 2])
{
cout << i + 1 << " " << i + 3 << endl;
return 0;
}
}
cout << -1 << " " << -1 << endl;
}
| 0
| 68,523,536
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#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;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll s; cin>>s;
ll v = 1000000000;
ll x = (v - s % v) % v;
ll y = (s+x)/v;
cout<<"0 0 1000000000 1 "<<x<<' '<<y<<endl;
}
|
#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.at(i);
}
int M;
cin >> M;
vector<string> T(M);
for (int i=0; i<M; i++) {
cin >> T.at(i);
}
int score=0;
for (int i=0; i<N; i++) {
int a=0;
for (int j=0; j<N; j++) {
if (S.at(i) == S.at(j)) {
a++;
}
}
for (int j=0; j<M; j++) {
if (S.at(i) == T.at(j)) {
a--;
}
}
if (a > score) {
score = a;
}
}
cout << score << endl;
}
| 0
| 74,089,488
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
reverse_iterator<std::string::iterator> r = s.rbegin();
string rev(r, s.rend());
cout << rev << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
string s;
priority_queue<ll> q;
vector<ll> ans;
while(cin >> s,s!="end"){
ll x;
if(s=="insert"){
cin >> x;
q.push(x);
}
if(s=="extract"){
ll tmp=q.top();
q.pop();
ans.push_back(tmp);
}
}
int n=ans.size();
for(int i=0;i<n;++i){
cout << ans[i] << endl;
}
return 0;
}
| 0
| 42,551,011
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll K, S;
cin >> K >> S;
ll count = 0;
for (ll x = 0; x <= K; ++x) {
for (ll y = 0; y <= K; ++y) {
ll z = S - (x + y);
if (z < 0) continue;
if (z > K) continue;
count++;
}
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void solve(void)
{
int H,W; cin>>H; cin>>W;
int A,B; cin>>A; cin>>B;
vector<vector<int> > res (H,vector<int>(W,0));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
res[i][j] = (i<B)^(j<A);
}
}
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cout<<res[i][j];
}
cout<<endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| 0
| 92,307,423
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
string ans;
for(int i=0; i<e.size(); i++){
ans+=o.at(i);
ans+=e.at(i);
}
if(o.size()>e.size()){
ans+=o.at(o.size()-1);
}
cout << ans << endl;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void)
{
string s;
cin >> s;
if (s[5] == '1') {
mes("TBD");
re0;
}
if (s[6] == '5' || s[6] == '6' || s[6] == '7' || s[6] == '8' || s[6] == '9') {
mes("TBD");
re0;
}
mes("Heisei");
}
| 0
| 50,528,091
|
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Int = long long;
const int MOD = 1000000007;
const ll INF = numeric_limits<ll>::max();
const int inf = 1e8;
typedef pair<int,int> P;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue;
int main(){
cin.tie( 0 ); ios::sync_with_stdio( false );
int d;
cin >> d;
switch(d){
case 25:
cout << "Christmas" << endl;
break;
case 24:
cout << "Christmas Eve" << endl;
break;
case 23:
cout << "Christmas Eve Eve" << endl;
break;
case 22:
cout << "Christmas Eve Eve Eve" << endl;
break;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main(){
ll n, minn = 1e9+7, ans = 1e9+7; cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
minn = min(a[i],minn);
}
for(auto x : a){
if(x % minn != 0 && gcd(x,minn) == 1){
put(1);
return 0;
}
}
ans = a[0];
for(auto x : a){
if(x == minn) continue;
ans = min(ans, gcd(x, minn));
}
put(ans);
}
| 0
| 19,554,443
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y);
signed main() {
int n;
long long t[100], g, ans;
cin >> n;
for ( int i = 0; i < n; i++ ) {
cin >> t[i];
}
g = t[0];
for ( int i = 1; i < n; i++ ) {
if ( t[i] % g == 0 ) {
g = t[i];
} else if ( g % t[i] != 0 ) {
g = (t[i] / gcd(t[i], g)) * g;
}
}
cout << g << endl;
return (0);
}
long long gcd(long long x, long long y) {
if ( y > x ) {
swap(x, y);
}
long long z = x % y;
while ( z != 0 ) {
x = y;
y = z;
z = x % y;
}
return (y);
}
|
#include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using ll = long long;
ll INF = LLONG_MAX / 4000 - 100;
ll mod = 1e9 + 7;
int dx[] = {-1,0,1,0}, dy[] = {0,1,0,-1};
vector<ll> prime;
class fact {
public:
int fmod = 1e9+7;
vector<int> fac, inv;
fact (int n, int Mod = 1e9+7) {
fmod = Mod;
fac = vector<int>(n,0);
inv = vector<int>(n,0);
fac[0] = 1; for (int i = 1; i < n; i++) fac[i] = fac[i-1] * i % fmod;
for (int i = 0;i < n;i++) inv[i] = fact::POW(fac[i],fmod-2);
}
ll nCr(ll n, ll r) {if(n < r) return 0; return (fac[n] * inv[r] % fmod) * inv[n-r] % fmod;}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%fmod;}a = a * a%fmod; b >>= 1;}return c;}
inline int operator [] (int i) {return fac[i];}
};
template <class T = ll> T in() {T x; cin >> x; return (x);}
void DEBUG(vector<int> a) {for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<endl;}
void EMP(int x) {cout<<"!!!"<<x<<"!!!"<<endl;}
ll GCD(ll a, ll b) {ll c; while (b != 0) {c = a % b; a = b; b = c;}return a;}
ll LCM(ll a, ll b) {return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b);}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%mod;}a = a * a%mod; b >>= 1;}return c;}
void PRI(ll n) {bool a[n + 1LL]; for (int i = 0; i < n + 1LL; i++) {a[i] = 1LL;}for (int i = 2; i < n + 1LL; i++) {if (a[i]) {prime.pb(i); ll b = i; while (b <= n) {a[b] = 0; b += i;}}}}
template <typename T> T chmin(T& a, T b) {if(a>b)a=b;return a;}
template <typename T> T chmax(T& a, T b) {if(a<b)a=b;return b;}
bool isSqrt(ll a) {return pow(sqrt(a),2) == a ? 1 : 0;}
void YesNo(bool a) {if (a) cout << "Yes"; else cout << "No"; cout << endl;}
void yesno(bool a) {if (a) cout << "yes"; else cout << "no"; cout << endl;}
void YESNO(bool a) {if (a) cout << "YES"; else cout << "NO"; cout << endl;}
double dis(int x1, int x2, int y1, int y2) {
return sqrt((double)abs(x1-x2)*(double)abs(x1-x2)+(double)abs(y1-y2)*(double)abs(y1-y2));
}
bool solve() {
int k; cin >> k;
int n = 50; int cnt = k / n;
int ans[n];
rep (i, n) ans[i] = n + cnt - 1;
int rem = k % n;
int tmp = 0;
rep (i, n) {
int p = min(rem - tmp, 10ll);
ans[i] += p * n;
ans[i] -= rem - p;
tmp += p;
}
cout << n << endl;
rep (i, n) cout << ans[i] << " "; cout << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 0
| 26,639,478
|
#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;
const double PI = acos(-1);
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() {
string s, t; cin >> s >> t;
if (t.substr(0, s.size()) == s) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<iostream>
using namespace std;
#include<string>
int main()
{
string s;
getline(cin, s);
int i;
for(i = 0; s[i]; i++){
if((s[i] >= 'a') && (s[i] <= 'z')){
cout << char(s[i] - 32);
}else if((s[i] >= 'A') && (s[i] <= 'Z')){
cout << char(s[i] + 32);
}else{ cout << s[i];}
}
cout << endl;
return 0;
}
| 0
| 46,347,366
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M;
vector<pair<int, int>> A;
int m[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string k;
string ans;
int ans_len = -1;
bool dfs(int n) {
if ((int)k.size() < ans_len - 3) return true;
if (n == 0) {
ans_len = max(ans_len, (int)k.size());
string tmp_k = k;
sort(tmp_k.begin(), tmp_k.end(), greater<char>());
if (k.size() == ans_len && tmp_k > ans) {
ans = tmp_k;
}
return false;
}
if (n < 0) return false;
for (auto a : A) {
k.push_back('0' + a.second);
if (dfs(n - a.first)) return true;
k.pop_back();
}
return false;
}
int main() {
cin >> N >> M;
for (int i=0; i<M; i++) {
int a;
cin >> a;
A.push_back(make_pair(m[a], -a));
}
sort(A.begin(), A.end());
for (int i=0; i<M; i++) {
A[i] = make_pair(A[i].first, -A[i].second);
}
dfs(N);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
const double PI = acos(-1);
const int mod = 1e9+7;
const long long INF = (1LL << 60);
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a / gcd(a,b) * b;}
ll stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(ll a, ll b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmax(T &a, const T &b){ if(a < b){ a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(a > b){ a=b; return 1; } return 0; }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> h(n);
rep(i, 0, n) cin >> h[i];
ll ans = 0, cnt = 0;
rep(i, 0, n-1){
if(h[i] < h[i+1]) cnt = 0;
else{
cnt++;
chmax(ans, cnt);
}
}
cout << ans << endl;
return 0;
}
| 0
| 97,760,866
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
signed main(){
int n, m;
scanf("%d %d", &n, &m);
vector<ll> x(n), y(n), z(n);
for(int i = 0; i < n; i++){
scanf("%lld %lld %lld", &x[i], &y[i], &z[i]);
}
ll ans = 0;
for(int bit = 0; bit < (1 << 3); bit++){
ll ans1 = 0;
bool x1 = (bit & (1 << 0)), x2 = (bit & (1 << 1)), x3 = (bit & (1 << 2));
vector<ll> data(n, 0);
for(int i = 0; i < n; i++){
if(x1) data[i] += x[i];
else data[i] -= x[i];
if(x2) data[i] += y[i];
else data[i] -= y[i];
if(x3) data[i] += z[i];
else data[i] -= z[i];
}
sort(data.begin(), data.end(), greater<ll>());
for(int i = 0; i < m; i++){
ans1 += data[i];
}
ans = max(ans, ans1);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<ll> H(N+1);
for(int i=1; i<=N; i++){
cin >> H[i];
}
vector<vector<ll>> dp1(N+1, vector<ll>(N+1, 1e18));
vector<vector<ll>> dp2(dp1);
dp1[0][0] = 0;
for(int i=0; i<N; i++){
for(int j=0; j<=i; j++){
for(int k=0; k<N; k++){
dp2[j][k] = dp1[j][k];
dp2[i+1][k+1] = min(dp1[j][k]+max(0ll, H[i+1]-H[j]), dp2[i+1][k+1]);
}
}
dp1 = dp2;
}
ll ans=dp1[N][N-K];
for(int j=0; j<=N; j++){
for(int k=N-K; k<=N; k++){
ans = min(ans, dp1[j][k]);
}
}
cout << ans << endl;
return 0;
}
| 0
| 4,019,955
|
#include <iostream>
#include <vector>
#define MAX_VALUE 10001
void counting_sort(std::vector<int>& a) {
std::vector<int> c(MAX_VALUE, 0);
for (int i=0; i<a.size(); i++) {
c[a[i]]++;
}
for (int i=1; i<c.size(); i++) {
c[i] = c[i] + c[i-1];
}
std::vector<int> b(a.size());
for (int i=0; i<a.size(); i++) {
b[c[a[i]]-1] = a[i];
c[a[i]]--;
}
a.swap(b);
}
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i=0; i<n; i++) {
std::cin >> a[i];
}
counting_sort(a);
for (int i=0; i<n-1; i++) {
std::cout << a[i] << " ";
}
std::cout << a[n-1] << std::endl;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vector<int>>;
static long long INF = (1LL<<62);
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S, T, U;
cin >> N;
cin >> S >> T;
for(int i=0; i<N; i++){
U.push_back(S[i]);
U.push_back(T[i]);
}
printf("%s\n", U.c_str());
return 0;
}
| 0
| 51,273,876
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define Flag(x) (1<<(x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
typedef unsigned long long int ull;
typedef long long lint;
int main(void){
lint X,Y;
cin >> X >> Y;
if(X%Y==0) cout << -1 << endl;
else cout << X << endl;
}
|
#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>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
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 main(int argc, char* argv[])
{
int n;
int ans[100] = {0};
int y,m,d;
cin >> n;
for (int i=0; i<n; i++) {
cin >> y >> m >> d;
if(y%3 == 0){
ans[i] += (10 - m)*20+(21-d);
}else{
if(m%2 == 0){
ans[i] += (20-d);
ans[i] +=( (10-m)/2 )*19;
ans[i] += ((10-m) - ((10-m)/2)) * 20;
ans[i] += 5;
}else {
ans[i] += (21-d);
ans[i] += ( (10-m)/2 )*20;
ans[i] += ((10-m) - ((10-m)/2)) * 19;
ans[i] += 5;
}
}
ans[i] += (999 - y) / 3 * 200;
ans[i] += ((999-y) - (999 - y)/3) * 195;
}
for (int i=0; i<n; i++) {
cout << ans[i] << endl;
}
return 0;
}
| 0
| 54,839,454
|
#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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define fo(i,j,n) for (int i=(j); 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() {
char x, y; cin >> x >> y;
if(x < y) cout << '<' << ln;
else if(x == y) cout << '=' << ln;
else cout << '>' << ln;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string a, b;
cin >> a >> b;
if(a[0] == 'H' && b[0] == 'H')
cout << "H" << endl;
else if(a[0] == 'D' && b[0] == 'D')
cout << "H" << endl;
else if(a[0] == 'D' && b[0] == 'H')
cout << "D" << endl;
else if(a[0] == 'H' && b[0] == 'D')
cout << "D" << endl;
return 0;
}
| 0
| 48,496,596
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <functional>
#include <map>
#include <set>
#include <cmath>
#include <string>
#define SIZE 200005
#define INF 1000000005LL
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int n;
ll K;
int main()
{
scanf("%d",&n);
int dp[50];
for(int i=0;i<=n;i++){
if(i==0||i==1){
dp[i]=1;continue;
}
dp[i] = dp[i-1]+dp[i-2];
}
printf("%d\n",dp[n]);
return 0;
}
|
#include <iostream>
int main(){
long double x1,y1,x2,y2,x3,y3,x4,y4;
int a;
std::cin>>a;
for(int s=0;s<a;s++){
std::cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if((y2-y1)/(x2-x1)==(y4-y3)/(x4-x3)){
std::cout<<"YES"<<std::endl;
}else{
std::cout<<"NO"<<std::endl;
}
}
return 0;
}
| 0
| 83,004,766
|
#include<stdio.h>
int main()
{
int count=0;
int a,b,c,d,n;
while(scanf("%d",&n)!=EOF)
{
count=0;
for(a=0; a<10; a++)
for(b=0; b<10; b++)
for(c=0; c<10; c++)
for(d=0; d<10; d++)
if(a+b+c+d==n)
count++;
printf("%d\n",count);
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
vector<int> tpsort(vector<vector<int>>& G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0) que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point
{
double x;
double y;
};
struct LineSegment
{
Point start;
Point end;
};
double tenkyori(const LineSegment& line, const Point& point)
{
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>>z(n);
vector<ll> x(n);
vector<ll> y(n);
for (int i = 0; i < n; i++) {
cin >> z[i].first >> z[i].second;
x[i] = z[i].first;
y[i] = z[i].second;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
ll ans = 4023456789123456789;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
ll a = 0;
ll b = 1;
while (b < n) {
ll mn = 0;
for (int k = 0; k < n; k++) {
if (z[k].first >= x[i] && z[k].first <= x[j] && z[k].second >= y[a] && z[k].second <= y[b])mn++;
}
if (k <= mn) {
ans = min(ans, (x[j] - x[i]) * (y[b] - y[a]));
a++;
}
else {
b++;
}
}
}
}
cout << ans << endl;
}
| 0
| 56,565,144
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount(bit) __builtin_popcount(bit)
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x)))
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
ll ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return -1;
}
template <typename T>
string make_string(T N)
{
string ret;
T now = N;
while (now > 0)
{
T x = now % 10;
ret += (char)('0' + x);
now /= 10;
}
reverse(all(ret));
return ret;
}
template <typename T>
T gcd(T a, T b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
template <typename T>
T lcm(T x, T y)
{
T z = gcd(x, y);
return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++)
{
if (n % i == 0)
{
return false;
}
i++;
}
return true;
}
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;
}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main()
{
cout << fixed << setprecision(30);
ll N, K;
cin >> N >> K;
vector<ll> t(N), d(N);
loop(i, N)
{
cin >> t[i] >> d[i];
}
vector<pair<ll, ll>> pairs(N);
loop(i, N) pairs[i] = make_pair(d[i], t[i]);
sort(all(pairs));
reverse(all(pairs));
loop(i, N)
{
t[i] = pairs[i].second;
d[i] = pairs[i].first;
}
t.push_back(100008);
d.push_back(-1e18 + 9);
ll kind = 0;
vector<bool> seen(100010, false);
vector<ll> num(100010);
ll ans = 0;
loop(i, K)
{
ans += d[i];
if (!seen[t[i]])
kind++;
seen[t[i]] = true;
num[t[i]]++;
}
ans += kind * kind;
vector<ll> trade;
for (ll i = K - 1; i >= 0; i--)
{
if (num[t[i]] > 1)
{
trade.push_back(d[i]);
num[t[i]]--;
}
}
ll ind = 0;
ll preans = ans;
loop(i, N - K)
{
if (!seen[t[K + i]] && ind != trade.size())
{
seen[t[K + i]] = true;
preans -= trade[ind];
preans += d[K + i];
preans += 2 * kind + 1;
kind++;
ans = max(ans, preans);
ind++;
}
}
putout(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
ifstream cinn("ride.in");ofstream coutt("ride.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
int n,m;
int fr[100005];
int dp[100005];
signed main(){
FASTER;
cin>>n>>m;
for(int i=1;i<=m;i++){
int x;cin>>x;
fr[x]=1;
}
dp[0]=1;
dp[1]=1-fr[1];
for(int i=2;i<=n;i++){
if(!fr[i])dp[i]=(dp[i-1]+dp[i-2])%MOD;
}
cout<<dp[n];
}
| 0
| 23,449,779
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n;
cin>>n;
cout<<180*(n-2)<<endl;
return 0;
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define N_TIMES(i, n) for ( uint64_t i = 0; i < n; ++i )
#define N_TIMES_REV(i, n) for ( int64_t i = n - 1; i >= 0; --i )
using namespace std;
struct Point
{
int64_t x, y;
Point(int64_t x, int64_t y) : x(x), y(y) {}
int64_t operator-(const Point &p) const {
return abs(x - p.x) + abs(y - p.y);
}
};
int main()
{
uint64_t H, W, D;
cin >> H >> W >> D;
vector<Point> A(H * W, Point(0, 0));
N_TIMES(h, H) {
N_TIMES(w, W) {
uint64_t a;
cin >> a;
A[a - 1] = Point(w, h);
}
}
uint64_t N = ((H * W) / D) + 1;
vector<vector<uint64_t>> cumsum(D);
N_TIMES(i, D) {
cumsum[i] = vector<uint64_t>(N, 0);
N_TIMES(n, N - 1) {
uint64_t k = i + n * D;
if (k + D >= H * W) { break; }
cumsum[i][n + 1] = (A[k + D] - A[k]) + cumsum[i][n];
}
}
uint64_t Q;
cin >> Q;
N_TIMES(q, Q) {
uint64_t L, R;
cin >> L >> R;
--L, --R;
uint64_t i = L % D;
uint64_t n = (L - i) / D, m = (R - i) / D;
cout << (cumsum[i][m] - cumsum[i][n]) << endl;
}
return 0;
}
| 0
| 92,131,525
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;
int main(){
long long s;
cin >> s;
vector<long long> a(1000001);
a[0] = s;
for(long long i = 1; i <= 1000000; i++){
if(a[i-1] % 2 == 0) a[i] = a[i-1]/2;
else a[i] = 3*a[i-1]+1;
}
set<long long> T;
for(long long i = 0; i <= 1000000; i++){
if(T.find(a[i]) == T.end()) T.insert(a[i]);
else{
printf("%lld\n", i+1);
return 0;
}
}
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int n;
LDP vec[110];
vector<ld> ang_={(ld)0,pi,-pi},ang={(ld)0,pi,-pi};
void solve(){
cin >> n;
rep(i,n){
int x,y;
cin >> x >> y;
vec[i]=P(x,y);
}
rep(i,n){
ld a1,a2;
a1=atan2(vec[i].second,vec[i].first)+pi/2;
a2=atan2(vec[i].second,vec[i].first)-pi/2;
if (a1>pi) a1-=pi;
if (a2<-pi) a2+=pi;
ang_.push_back(a1);
ang_.push_back(a2);
ang_.push_back(atan2(vec[i].second,vec[i].first));
ang.push_back(a1);
ang.push_back(a2);
ang.push_back(atan2(vec[i].second,vec[i].first));
}
sort(ang_.begin(),ang_.end());
rep(i,(int)ang_.size()-1){
ang.push_back((ang_[i]+ang_[i+1])/2);
}
sort(ang.begin(),ang.end());
ld ans=0;
rep(i,ang.size()){
ld a=ang[i];
ld p=cos(a),q=sin(a);
ld x=0,y=0;
rep(k,n){
if (p*vec[k].first+q*vec[k].second>=0) {
x+=vec[k].first;
y+=vec[k].second;
}
}
ans=max(ans,sqrt(x*x+y*y));
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
}
| 0
| 46,469,041
|
#include<iostream>
#include<cmath>
#include<string>
#include<cstdlib>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<string.h>
#include<iomanip>
using namespace std;
int main()
{
int k=1000,sum=0,count[1000];
int n[1000],x[1000];
for(int i=0;i<k;i++)
{
sum++;
cin>>n[i]>>x[i];
if(n[i]==0&&x[i]==0)
break;
}
memset(count,0,100*sizeof(int));
for(int p=0;p<sum;p++)
{
for(int i=1;i<=n[p]-2;i++)
for(int j=2;j<=n[p]-1;j++)
for(int k=3;k<=n[p];k++)
if(i+j+k==x[p]&&k>j&&j>i&&k>i)
count[p]++;
}
for(int i=0;i<sum-1;i++)
cout<<count[i]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
template <class t, class u>
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
void chmax(t& a, u b) {
if (a < b) a = b;
}
ll f(int x) {
if (x == -1) return 0;
if (x == 0) return 0;
if (x == 1) return 1;
return x + f(x - 1);
}
int main() {
string s;
cin >> s;
int n = s.size() + 1;
vector<ll> a(n);
REP(i, n - 1) {
if (s[i] == '<') {
chmax(a[i + 1], a[i] + 1);
}
}
per(i, n - 1) {
if (s[i] == '>') {
chmax(a[i], a[i + 1] + 1);
}
}
ll mx = 0;
REP(i, n) mx += a[i];
cout << mx << endl;
}
| 0
| 82,363,304
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
int INF=1<<29;
int main(){
ios::sync_with_stdio(false);
double N,tmp=0,sum=0;
cin>>N;
vector<double> t(N),v(N);
for(int i=0;i<N;i++){
cin>>t[i];
sum+=t[i];
t[i]+=tmp;
tmp=t[i];
}
for(int i=0;i<N;i++) cin>>v[i];
vector<double> table(sum*2+1);
for(double i=1;i<=sum;i++) table[i]=(i-1)*1+0.5;
for(double i=sum*2;i>=sum+1;i--) table[i]=(sum*2-i)*1+0.5;
for(int i=0;i<N;i++){
if(i!=0){
for(double j=t[i-1]*2+1;j<=t[i]*2;j++){
table[j]=min(table[j],2*v[i]);
}
for(double j=t[i-1]*2;j>=1;j--){
table[j]=min(table[j],2*v[i]+(t[i-1]*2-j)*1+0.5);
}
for(double j=t[i]*2+1;j<=table.size();j++){
table[j]=min(table[j],2*v[i]+(j-(t[i]*2+1))*1+0.5);
}
}else if(i==0){
for(double j=1;j<=t[i]*2;j++){
table[j]=min(table[j],2*v[i]);
}
for(double j=t[i]*2+1;j<=table.size();j++){
table[j]=min(table[j],2*v[i]+(j-(t[i]*2+1))*1+0.5);
}
}
}
double ans=0;
for(int i=1;i<table.size();i++){
ans+=table[i];
}
ans/=4;
cout<<fixed<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int x[12];
int y[12];
scanf("%d %d %d",&x[0],&x[1],&x[2]);
scanf("%d %d %d",&x[3],&x[4],&x[5]);
scanf("%d %d %d",&x[6],&x[7],&x[8]);
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&y[i]);
for(int i = 0 ; i < 9 ; i++){
for(int j = 1 ; j <= n ; j++){
if(x[i] == y[j])
x[i] = 0;
}
}
if(x[0] == x[1] && x[1] == x[2])
cout << "Yes" << endl;
else if(x[3] == x[4] && x[4] == x[5])
cout << "Yes" << endl;
else if(x[6] == x[7] && x[7] == x[8])
cout << "Yes" << endl;
else if(x[0] == x[4] && x[4] == x[8])
cout << "Yes" << endl;
else if(x[2] == x[4] && x[4] == x[6])
cout << "Yes" << endl;
else if(x[0] == x[3] && x[3] == x[6])
cout << "Yes" << endl;
else if(x[1] == x[4] && x[4] == x[7])
cout << "Yes" << endl;
else if(x[2] == x[5] && x[5] == x[8])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 0
| 32,225,695
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
enum Face
{
TOP = 0,
FRONT = 1,
RIGHT = 2,
LEFT = 3,
BACK = 4,
BOTTOM = 5,
};
void roll(vector<int> &f, string cmd)
{
int tmp;
for (int i = 0; i < cmd.size(); i++)
{
switch (cmd[i])
{
case 'E':
tmp = f[TOP];
f[TOP] = f[LEFT];
f[LEFT] = f[BOTTOM];
f[BOTTOM] = f[RIGHT];
f[RIGHT] = tmp;
break;
case 'N':
tmp = f[TOP];
f[TOP] = f[FRONT];
f[FRONT] = f[BOTTOM];
f[BOTTOM] = f[BACK];
f[BACK] = tmp;
break;
case 'S':
tmp = f[TOP];
f[TOP] = f[BACK];
f[BACK] = f[BOTTOM];
f[BOTTOM] = f[FRONT];
f[FRONT] = tmp;
break;
case 'W':
tmp = f[TOP];
f[TOP] = f[RIGHT];
f[RIGHT] = f[BOTTOM];
f[BOTTOM] = f[LEFT];
f[LEFT] = tmp;
break;
default:
break;
}
}
}
int main()
{
vector<int> f(6);
int q;
int top_init, front_init;
int top, front;
for (int i = 0; i < 6; i++)
{
cin >> f[i];
if (i == TOP)
{
top_init = f[i];
}
else if (i == FRONT)
{
front_init = f[i];
}
}
cin >> q;
vector<int> res(q);
for (int i = 0; i < q; i++)
{
cin >> top >> front;
if (top != f[TOP])
{
if (top == f[FRONT])
{
roll(f, "N");
}
else if (top == f[RIGHT])
{
roll(f, "W");
}
else if (top == f[LEFT])
{
roll(f, "E");
}
else if (top == f[BACK])
{
roll(f, "S");
}
else if (top == f[BOTTOM])
{
roll(f, "NN");
}
}
if (front == f[FRONT])
{
res[i] = f[RIGHT];
}
else if (front == f[RIGHT])
{
roll(f, "WSE");
res[i] = f[RIGHT];
}
else if (front == f[LEFT])
{
roll(f, "ESW");
res[i] = f[RIGHT];
}
else if (front == f[BACK])
{
roll(f, "WSSE");
res[i] = f[RIGHT];
}
}
for (int i = 0; i < q; i++)
{
cout << res[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define INF 1000000000
#define MOD 1000000007
void solve() {
ll n;
cin >> n;
bool flag = false;
for(ll i = 2; i*i <= n; ++i) {
if (!(n%i)) {
flag = 1;
break;
}
}
if (!flag && n^1) {
cout << 1 << "\n";
return;
}
unordered_map<ll, int> div;
int ans = 0;
while (!(n%2)) {
n /= 2;
div[2]++;
}
for (ll i = 3; i*i <= n; i += 2) {
while (!(n%i)){
++div[i];
n /= i;
}
}
if (n > 1) div[n]++;
for (auto& i: div) {
int k = 1;
while (i.se >= k) {
++ans;
i.se -= k;
++k;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
solve();
return 0;
}
| 0
| 34,085,276
|
#include<iostream>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
#define _GLIBCXX_DEBUG
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define pii pair<long long,long long>
#define ppii pair<long long,pair<long long,long long>>
#define all(x) (x).begin(),(x).end()
#define rep(x) for(int i = 0;i < (x);i++)
#define repj(x) for(int j = 0;j < (x);j++)
#define REP(i,x) for(int (i) = 0;(i) < (x);(i)++)
#define rrep(x) for(int i = (x);i >= 0;i--)
#define mod 1000000007
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
typedef vector<vector<long long>> vii;
typedef long long lint;
typedef long long ll;
lint qp(int a, ll b) { int ans = 1; do { if (b & 1)ans = 1ll * ans*a; a = 1ll * a*a; } while (b >>= 1); return ans; }
lint qp(int a, ll b, int mo) { int ans = 1; do { if (b & 1)ans = 1ll * ans*a%mo; a = 1ll * a*a%mo; } while (b >>= 1); return ans; }
lint gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
long long INF = 1e14;
const int MAX_N = 1 << 17;
const int cf = 100010;
int main(void) {
int n; cin >> n;
string s; cin >> s;
vector<int> a(n);
int da[2] = { 1,-1 };
int db[2] = { 1, - 1 };
vector<int> lyn(n);
rep(n) {
if (s[i] == 'o') lyn[i] = 1;
else lyn[i] = -1;
}
for (int p = 0; p < 2; p++) {
for (int q = 0; q < 2; q++) {
a[0] = da[p], a[1] = da[q];
for (int i = 2; i < n ; i++) {
a[i] = a[i - 2] * a[i - 1] * lyn[i-1];
}
if (a[0] == a[n - 1] * a[n - 2] * lyn[n - 1] && a[1] == a[0] * a[n - 1] * lyn[0]) {
for (int i : a) {
if (i == 1) cout << 'S'; else cout << 'W';
}
cout << endl;
return 0;
}
else continue;
}
}
cout << -1 << endl;
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
#define S 21
llfor;
const ll mod=1000000007;
const double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll ans=1;rep(i,0,n){ans*=x;ans%=mod;}return ans;}
ll fact(ll x){ll ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)*fact(n-r)/fact(r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=1,tmp=n;while(tmp/10>0){tmp/=10;d++;}return d;}
void matcpy(ll a[S][S],ll b[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)b[i][j]=a[i][j];i=t;}
void matrst(ll a[S][S]){ll t=i;rep(i,0,S)rep(j,0,S)a[i][j]=0;i=t;}
void matpow(ll a[S][S]){ll ans[S][S];matrst(ans);ll t=i,k;rep(i,0,S)rep(j,0,S)rep(k,0,S)ans[i][j]+=a[i][k]*a[k][j];matcpy(ans,a);i=t;}
void matmul(ll a[S][S],ll b[S][S], ll as[S][S]){ll t=i,k;matrst(as);rep(i,0,S)rep(j,0,S)rep(k,0,S)as[i][j]+=a[i][k]*b[k][j];i=t;}
int main(){
ll n,d;
cin>>n>>d;
ll a[d+10][n+10];
rep(i,0,n)rep(j,0,d)cin>>a[i][j];
ll k,dis,ans=0;
rep(i,0,n){
rep(j,i+1,n){
dis=0;
rep(k,0,d)dis+=(a[i][k]-a[j][k])*(a[i][k]-a[j][k]);
if((ll)sqrt(dis)*(ll)sqrt(dis)==dis)ans++;
}
}
pr(ans);
return 0;}
| 0
| 31,285,827
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define REPE(i, n) for (int (i)=0; (i) <= (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
signed main()
{
int a, b;
cin >> a >> b;
string s;
cin >> s;
for (int i = 0; i < a; i++)
{
if (s[i] == '-')
{
No();
return 0;
}
}
if (s[a] != '-')
{
No();
return 0;
}
for (int i = 0; i < b; i++)
{
if (s[a + 1 + i] == '-')
{
No();
return 0;
}
}
Yes();
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int n; cin >> n;
long long cnt = 0;
long long previous = 0;
for (int i = 1; i <= n; i++){
long long height; cin >> height;
if (height < previous) {
cnt += previous - height;
height = previous;
}
previous = height;
}
cout << cnt << endl;
}
| 0
| 36,938,726
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, K; cin >> N >> K;
if (N % K == 0) cout << 0 << endl;
else cout << 1 << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define pq priority_queue
#define MZ 1000000007
bool ok(long long x,long long a,long long b)
{
long long lt,rt;
if(x%2)
{
lt=x/2+1;
rt=x/2+1;
}
else
{
lt=x/2;
rt=x/2+1;
}
if(a<=lt)
lt++;
if(b<=rt)
rt++;
if((lt*rt)>=(a*b))
return 0;
if((a>lt) && (a<=x) && (b<(rt-a+lt)))
{
if(((a+1)*(rt-a+lt))>=(a*b))
return 0;
}
if((b>rt) && (b<=x) && (a<(lt-b+rt)))
{
if(((b+1)*(lt-b+rt))>=(a*b))
return 0;
}
lt++;
rt--;
if(lt==a)
lt++;
if(rt==b)
rt--;
if(lt*rt>=a*b)
return 0;
return 1;
}
int main()
{
int q;
long long a,b,l,r,mid;
scanf("%d",&q);
while(q--)
{
scanf("%lld%lld",&a,&b);
l=0;
r=2LL*MZ;
while(l!=r)
{
mid=(l+r+1)/2;
if(ok(mid,a,b))
l=mid;
else
r=mid-1;
}
printf("%lld\n",l);
}
return 0;
}
| 0
| 17,652,366
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n,m;
cin >> n >> m;
ll ans;
if(m<=n*2) ans = m/2;
else ans = n+(m-n*2)/4;
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string s; cin >> s;
int K; cin >> K;
int N = s.size();
ll cnt_1 = 0, cnt_2 = 0,cnt_3 = 0;
rep(i,N){
if (i+1<N && s[i]==s[i+1]){
cnt_1++;
i++;
}
}
s += s;
rep(i,s.size()){
if (i+1<2*N && s[i]==s[i+1]){
cnt_2++;
i++;
}
}
s += s;
rep(i,s.size()){
if (i+1<3*N && s[i]==s[i+1]){
cnt_3++;
i++;
}
}
if (K%2) cout << cnt_1 + (cnt_3-cnt_1)*(K/2) << endl;
else cout << cnt_2 + (cnt_3-cnt_1)*(K/2-1) << endl;
return 0;
}
| 0
| 4,352,895
|
#include <cstdio>
#include <cmath>
#include <limits>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdint>
#include <functional>
#include <sstream>
#define rep(i, s, g) for (i = s; i < g; i++)
using namespace std;
using ll = long long;
using ss = stringstream;
const ll mod = 1000000000 + 7;
const ll llmax = pow(10, 18);
vector<ll> Eratosthenes(ll N )
{
vector<bool> is_prime( N + 1 );
for( int i = 0; i <= N; i++ )
{
is_prime[ i ] = true;
}
vector<ll> P;
for( int i = 2; i <= N; i++ )
{
if( is_prime[ i ] )
{
for( int j = 2 * i; j <= N; j += i )
{
is_prime[ j ] = false;
}
P.emplace_back( i );
}
}
for (auto &&q : P)
{
cout << N << ","<< q << endl;
}
return P;
}
int main() {
ll N;
cin >> N;
ll num;
ll ans = 0;
for (ll i = 1; i < N ; i++)
{
ll N2 = N - i;
ll p = 1;
for (int i = 2; i <= sqrt(N2); i++) {
int cnt = 0;
while (N2 % i == 0) {
cnt ++;
N2 /= i;
}
p *= (cnt + 1);
if (N2 == 1) break;
}
if(N2 != 1) p *= 2;
ans += p;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep_a(i,a,n) for(int i=a;i<n;i++)
#define all(ds) ds.begin(), ds.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef vector< long long > vi;
typedef pair<long long, long long> ii;
typedef priority_queue <ll> pq;
#define o_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define graph vector<vi>
const ll mod = 1000000007;
const ll INF = (ll)1e18;
const ll MAXN = 1000006;
ll po(ll x, ll n ){
ll ans=1;
while(n>0){
if(n&1) ans=(ans*x)%mod;
x=(x*x)%mod;
n/=2;
}
return ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
while(T--){
ll n;
cin>>n;
ll d[n];
ll sum=0;
rep(i,n){
cin>>d[i];
sum+=d[i];
}
ll ans=0;
rep(i,n){
ans+=d[i]*(sum-d[i]);
}
cout<<ans/2<<el;
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
}
| 0
| 80,213,923
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
typedef vector<bool> vb;
const ll INF=1LL << 60;
const ll MOD=1e9+7;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vb t(n+1, true);
rep(i ,m){
int a;
cin >> a;
t[a]=false;
}
vl dp(100010, 0);
dp[0]=1;
rep(i, n)for(int j=i+1; j<=min(n, i+2); j++){
if(t[j]){
dp[j]+=dp[i];
dp[j]%=MOD;
}
}
cout << dp[n] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int main() {
fast();
long long n;
cin>>n;
long long sum=0;
long long t=5;
long long k=10;
long long j=1;
if(n%2==1){
cout<<0<<"\n";
return 0;
}else{
while(binpow(t,j)<=n){
sum+=n/binpow(t,j);
sum-=max(n-binpow(t,j),(ll)0)/(2*binpow(t,j))+1;
j++;
}
cout<<sum<<"\n";
return 0;
}
}
| 0
| 67,276,403
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
map<ll, ll> mp;
rep(i, n) {
ll a, b;
cin >> a >> b;
mp[a] += b;
}
ll ans, cnt = 0;
for (auto x : mp) {
cnt += x.second;
if (k <= cnt) {
ans = x.first;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define pb push_back
#define csl ios_base::sync_with_stdio(false); cin.tie(NULL)
typedef long long ll;
#define reps(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define rep(i,b) for(ll i=0;i<ll(b);i++)
typedef vector<long long> vll;
typedef vector<pair<int,int>> vii;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int main()
{
csl;
int a,b;
cin >> a >> b;
map<int,int> m;
m[a]++,m[b]++;
int flag = -1;
for(auto i:{1,2,3})
{
if(m[i])
continue;
else
flag = i;
}
cout << flag << endl;
}
| 0
| 59,616,011
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
ll dp[2][110][10];
int main() {
string s;
ll k;
cin >> s >> k;
ll m = s.size();
dp[0][0][0] = 1;
rep(id, 2) {
rep(i, m) {
rep(j, 4) {
ll lim = s[i] - '0';
if(id) {
lim = 9;
}
exrep(x, 0, lim) {
dp[id || x < lim][i+1][j + (x != 0)] += dp[id][i][j];
}
}
}
}
ll ans = (dp[0][m][k] + dp[1][m][k])%mod;
out(ans);
re0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef unordered_map<int,int> mii;
typedef unordered_map<char,int> mci;
typedef unordered_map<string,int> msi;
#define pb push_back
#define f first
#define s second
void solve() {
int n,k,ans; cin>>n>>k;
vi A(n),pre(k+1);
for(int i=0;i<n;i++) cin>>A[i];
vvi dp(n+1,vi(k+1));
for(int i=0;i<=n;i++) {
dp[i][0] = 1;
}
for(int i=1;i<=k;i++) {
dp[0][i] = 0;
}
for(int i=1;i<=n;i++) {
pre[0] = dp[i-1][0];
for(int j=1;j<=k;j++) {
pre[j] = (pre[j-1] + dp[i-1][j])%MOD;
}
for(int j=1;j<=k;j++) {
dp[i][j] = pre[j];
if(A[i-1]<j) {
dp[i][j] = (dp[i][j] - pre[j-A[i-1]-1] + MOD)%MOD;
}
dp[i][j] %= MOD;
}
}
cout<<dp[n][k]<<endl;
}
int32_t main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0); cout.tie(0);
int tc; tc=1;
for (int t = 1; t <= tc; t++) {
solve();
}
}
| 0
| 87,078,248
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,an;
cin>>n;
an=((2*n)-4)*90;
cout<<an<<endl;
return 0;
}
|
#include<iostream>
#include<unordered_map>
using namespace std;
int main(){
long N, K;
cin >> N >> K;
long A[N+1];
long S[N+1];
S[0]=0;
for(long i=1; i<N+1; i++){
cin >> A[i];
S[i]=S[i-1]+A[i];
}
long ans=0;
unordered_map<long, long> mp;
for(long j=1; j<=N; j++ ){
if( j-K >= 0 ){
mp[ (S[j-K]-(j-K))%K ] -= 1;
}
if( j-1 >= 0 ){
mp[ (S[j-1]-(j-1))%K ] += 1;
}
ans += mp[ (S[j]-j)%K ];
}
cout << ans << endl;
return 0;
}
| 0
| 80,582,264
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
long long f(string s) {
int N = s.size();
long long sum = 0;
for (long long i = 0, j = 0; i < N; i = j) {
while (j < N && s[i] == s[j])j++;
sum += (j - i) / 2;
}
return sum;
}
int main() {
string S;
cin >> S;
long long N = S.size();
long long K;
cin >> K;
bool same = true;
for (int i = 0; i < N; i++) if (S[0] != S[i]) same = false;
if (same) {
cout << (N * K) / 2 << endl;
return 0;
}
long long d1 = f(S);
long long d2 = f(S + S);
long long a = d1;
long long d = d2 - d1;
cout << a + (K -1) * d << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
string s;
cin >> s;
int ans = 1<<29;
for (int i = 0; i <= 1; i++) {
int a = i;
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] - '0' != a) count++;
a = 1 - a;
}
ans = min(ans, count);
}
cout << ans << endl;
return 0;
}
| 0
| 8,026,260
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int lcs(string X, string Y) {
int n, m;
int c[1001][1001] = { 0 };
int maxlcs = 0;;
m = X.size();
n = Y.size();
X = ' ' + X;
Y = ' ' + Y;
for (int i = 1; i <= m; i++)c[i][0] = 0;
for (int j = 1; j <= n; j++)c[0][j] = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (X[i] == Y[j])
c[i][j] = c[i - 1][j - 1] + 1;
else
c[i][j] = max(c[i][j - 1],c[i - 1][j]);
maxlcs = max(maxlcs, c[i][j]);
}
}
return maxlcs;
}
int main() {
int n;
string S1, S2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S1 >> S2;
cout << lcs(S1, S2) << endl;
}
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,int> P;
vector<ll> V[110000],T,S;
ll sumT[110000],sumS[110000];
int main(){
int N,K,t;
ll d;
cin>>N>>K;
for(int i=0;i<N;i++){
cin>>t>>d;
t--;
V[t].push_back(d);
}
for(int i=0;i<N;i++){
sort(V[i].begin(),V[i].end(),greater<ll>());
}
for(int i=0;i<N;i++){
for(int j=0;j<(int)V[i].size();j++){
if(j==0) T.push_back(V[i][j]);
else S.push_back(V[i][j]);
}
}
sort(T.begin(),T.end(),greater<ll>());
sort(S.begin(),S.end(),greater<ll>());
for(int i=0;i<(int)T.size();i++){
sumT[i+1]=sumT[i]+T[i];
}
for(int i=0;i<(int)S.size();i++){
sumS[i+1]=sumS[i]+S[i];
}
ll ans=0;
for(int i=0;i<=K;i++){
if((int)T.size()>=i)
ans=max(ans,sumT[i]+sumS[K-i]+i*i);
}
cout<<ans<<endl;
}
| 0
| 13,998,258
|
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <fstream>
#include <climits>
using namespace std;
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
int INF = INT_MAX;
ll mod = 998244353;
ll power(ll a, ll b){
ll result = 1;
while (b>0){
if (b%2==1) result *= a;
a*=a;
b/=2;
}
return result;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,x,m;
cin>>n>>x>>m;
vector<int> seen(m);
int ind = 1;
ll now = x;
seen[now] = 1;
ind++;
ll ans = 0;
vector<ll> pref;
pref.push_back(0);
pref.push_back(x);
now = power(now, 2) % m;
if (seen[now]){
cout<< n * now<<"\n";
return 0;
}
while (seen[now] == 0 && ind<=n){
seen[now] = ind;
pref.push_back(pref[pref.size()-1] + now);
ind++;
now = power(now, 2) % m;
}
if (ind - 1 == n){
ans = pref[pref.size()-1];
cout<<ans<<"\n";
return 0;
}
ll first = seen[now]-1;
ll length = ind - first-1;
ll k = (n-first)/length;
ans = k* (pref[ind-1] - pref[first]) + pref[first];
ll last = first + 1 + length*k;
while (last<=n){
ans+=now;
now = power(now, 2) % m;
last++;
}
cout<<ans<<"\n";
}
|
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
string S;
cin>>S;
map<char, int> chrmap;
for(int i=0;i<S.size();++i){
chrmap[S[i]]++;
}
char ans = 'A';
for(char i='a';i<='z';++i){
if(chrmap[i]==0){
ans = i;
break;
}
}
if(ans=='A'){
bool can = false;
int index;
vector<char> arr;
char max;
for(int i=25;i>=1;--i){
if(S[i-1]<S[i]){
can = true;
index = i-1;
max = S[i-1];
arr.push_back(S[i]);
break;
}
else {
arr.push_back(S[i]);
}
}
if(can){
for(int i=0;i<index;++i){
cout<<S[i];
}
sort(arr.begin(), arr.end());
for(int i=0;i<arr.size();++i){
if(S[index]<arr[i]){
cout<<arr[i]<<endl;
break;
}
}
}
else cout<<-1<<endl;
}
else cout<<S+ans<<endl;
}
| 0
| 29,477,872
|
#include <bits/stdc++.h>
#define INF 2000000001
#define MAX 502
using namespace std;
int main()
{
int H;
int heap[MAX];
cin >> H;
for (int i = 0; i < MAX; i++) {
if (i >= 1 && i <= H)
cin >> heap[i];
else
heap[i] = INF;
}
for (int i = 1; i <= H; i++) {
cout << "node " << i << ": ";
cout << "key = " << heap[i] << ", ";
if (heap[i / 2] != INF)
cout << "parent key = " << heap[i / 2] << ", ";
if (heap[i * 2] != INF)
cout << "left key = " << heap[i * 2] << ", ";
if (heap[i * 2 + 1] != INF)
cout << "right key = " << heap[i * 2 + 1] << ", ";
cout << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF (1<<20)
typedef pair<int,int> P;
vector<P> edge[10];
int dijkstre(int pos){
int min_cost[10];
fill_n(min_cost,10,INF);
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0,pos));
while(!que.empty()){
P p = que.top(); que.pop();
int cost = p.first;
int now = p.second;
if(min_cost[now] < cost) continue;
min_cost[now] = cost;
for(int i=0;i<edge[now].size();i++){
int nc = edge[now][i].second;
int next = edge[now][i].first;
if(cost+nc < min_cost[next]){
que.push(P(cost+nc,next));
}
}
}
int sum = 0;
for(int i=0;i<10;i++){
if(min_cost[i] != INF){
sum += min_cost[i];
}
}
return sum;
}
int main(){
int n;
while(1){
cin >> n;
if(n == 0) break;
int l=100,r=0;
for(int i=0;i<10;i++){
edge[i].clear();
}
for(int i=0;i<n;i++){
int a,b,c;
cin >> a >> b >> c;
edge[a].push_back(P(b,c));
edge[b].push_back(P(a,c));
l = min(min(l,a),b);
r = max(max(r,a),b);
}
int ans = INF;
int pos = l;
for(int i=l;i<=r;i++){
int tmp = dijkstre(i);
if(ans > tmp){
pos = i;
ans = tmp;
}
}
cout << pos << " " << ans << endl;
}
}
| 0
| 30,472,889
|
#include <iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
int n,m;
cin>>n>>m;
vector<int>l(m);
vector<int>r(m);
rep(i,m)cin>>l[i]>>r[i];
sort(l.begin(),l.end());
sort(r.begin(),r.end());
int pass;
if(r[0]<l[m-1])pass=0;
else pass =r[0]-l[m-1]+1;
cout<<pass<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vector<ll> > vvl;
typedef vector<vector<P> > vvp;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
cin >> n >> k;
if(k>(n-1)*(n-2)/2){
cout << -1 << endl;
return 0;
}
vector<P>vec;
rep(i,n-1){
vec.push_back(P(i+1,n));
}
k=(n-1)*(n-2)/2-k;
int a=1,b=2;
rep(i,k){
vec.push_back(P(a,b));
b++;
if(b==n){
a++;
b=a+1;
}
}
cout << vec.size() << endl;
for(auto p:vec){
cout << p.first << " " << p.second << endl;
}
return 0;
}
| 0
| 43,673,849
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define REV(v) reverse(v.begin(), v.end())
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define SZ(v) (int)v.size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> a(N), b(N);
ll sum_a = 0, sum_b = 0;
REP(i, N) {
cin >> a[i];
sum_a += a[i];
}
REP(i, N) {
cin >> b[i];
sum_b += b[i];
}
ll cnt = 0;
REP(i, N) {
if (a[i] < b[i]) { cnt += (b[i] - a[i] + 1) / 2; }
}
cout << (cnt <= sum_b - sum_a ? "Yes" : "No") << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;
}
for (int i = 3; i * i < MAX_N; i += 2){
for (int j = i + i; j < MAX_N; j += i){
is_prime[j] = false;
}
}
sum[0] = 0;
for (int i = 0; i < MAX_N; i++){
sum[i + 1] = sum[i] + is_prime[i];
}
while (cin >> n){
cout << sum[n + 1] << endl;
}
}
| 0
| 45,236,461
|
#include <bits/stdc++.h>
using namespace std;
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...);
}
#ifndef ONLINE_JUDGE
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif
#define mst(x, a) memset(x, a, sizeof(x))
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 998244353;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
ll mul(ll a, ll b) { return a * b % MOD; }
ll add(ll a, ll b) { return (a + b) % MOD; }
ll sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll my_pow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1) r = mul(r, a);
a = mul(a, a);
b >>= 1;
}
return r;
}
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> cnt(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
cnt[a[i]]++;
}
ll ans = 1;
if (a[0] != 0 || cnt[0] != 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i < N; i++) {
dbg(i, cnt[i]);
ans = mul(ans, my_pow(cnt[i-1], cnt[i]));
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, p;
cin>>n>>p;
string s;
cin>>s;
if(10%p == 0){
long long ans = 0;
for(int i = 0; i < (int)s.length(); i++ ){
if((s[i]-'0')%p == 0) ans+=(i+1);
}
cout<<ans;
return 0;
}
map<int,int> mp;
mp[0] = 1;
int pp = 1;
int t = 0;
long long ans = 0;
for(int i = n-1; i>=0 ; i--){
t = (t+(s[i] - '0')*pp)%p;
ans += mp[t];
mp[t]++;
pp = pp*10%p;
}
cout<<ans;
}
| 0
| 54,945,391
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
class ARatedForMe {
public:
void solve(std::istream &in, std::ostream &out) {
int r;
in >> r;
if (r < 1200) {
out << "ABC" << endl;
} else if (r < 2800) {
out << "ARC" << endl;
} else {
out << "AGC" << endl;
}
}
};
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
ARatedForMe solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pii;
int main()
{
ll mx, my;
scanf("%lld%lld", &mx, &my);
vector<pii>vec;
for (int i = 0; i < mx; i++)
{
ll z;
scanf("%lld", &z);
vec.push_back(make_pair(z, 0));
}
for (int i = 0; i < my; i++)
{
ll z;
scanf("%lld", &z);
vec.push_back(make_pair(z, 1));
}
sort(vec.begin(), vec.end());
ll ans = 0;
ll nx = mx + 1, ny = my + 1;
for (int i = 0; i < vec.size(); i++)
{
if (vec[i].second == 0)
{
ans += ny*vec[i].first;
nx--;
}
else
{
ans += nx*vec[i].first;
ny--;
}
}
printf("%lld\n", ans);
}
| 0
| 31,156,103
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
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; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
ll n,m;
cin>>n>>m;
if(n>m){
swap(n,m);
}
ll ans=0;
if(n==1&&m==1){
ans = 1;
}else if(n==1){
ans = m-2;
}else{
ans = (n-2)*(m-2);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
int main(void) {
int n, i;
ll a[200003] = {};
map<ll, ll> m;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i <= n; i++) {
a[i] += a[i - 1];
}
for (i = 0; i <= n; i++) {
m[a[i]]++;
}
map <ll, ll>::iterator ite;
ll ans = 0;
for (ite = m.begin(); ite != m.end(); ite++) {
ans += ite->second * (ite->second - 1) / 2;
}
cout << ans << endl;
return 0;
}
| 0
| 51,965,712
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std ;
int main()
{
FASTIO
int r , d , x ;
cin >> r >> d >> x ;
for ( int i = 0 ; i < 10 ; i++ )
{
x = r*x - d ;
cout << x << "\n" ;
}
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, l, r) for (int i=(l); i<(r); ++i)
#define RREP(i, r, l) for (int i=(r); i>(l); --i)
#define CASET int _T; cin >> _T; REP(caset, 0, _T)
#define print(x) cout << to_string(x) << '\n'
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vvi vector<vi>
#define vvb vector<vb>
#define pii pair<int,int>
#define t3i tuple<int,int,int>
#define mii map<int,int>
#define vpii vector<pii>
#define vt3i vector<t3i>
#define sq(x) (x)*(x)
#define inv(x) powa(x, MOD-2)
long long INF = 1LL<<60;
long long MOD = 1e9+7;
string to_string(char &c) {string x(1, c); return x;}
string to_string(const char s[]) {return (string)s;}
string to_string(string &s) {return s;}
string to_string(vb &v) {string res; for (const bool &x : v) res += to_string(x) + ' '; return res;}
template <class C> string to_string(C &v) {string res; for (auto &x : v) res += to_string(x) + ' '; return res;}
template <typename A, typename B> istream &operator>>(istream &is, pair<A, B> &pr) {is >> pr.first >> pr.second; return is;}
template <typename A> istream &operator>>(istream &is, vector<A> &v) {for (auto &x : v) is >> x; return is;}
ostream &operator<<(ostream &os, char &c) {os << (char)c; return os;}
ostream &operator<<(ostream &os, const char s[]) {os << (string)s; return os;}
ostream &operator<<(ostream &os, string &s) {for (char &c : s) os << (char)c; return os;}
template <typename A, typename B> ostream &operator<<(ostream &os, pair<A, B> pr) {os << '(' << pr.first << ", " << pr.second << ')'; return os;}
ostream &operator<<(ostream &os, vb &v) {
bool first = true;
os << '[';
for (const bool &x : v) {
if (!first) os << ", ";
first = false;
os << x;
}
os << ']';
return os;
}
template <class C> ostream &operator<<(ostream &os, C &v) {
bool first = true;
os << '[';
for (auto &x : v) {
if (!first) os << ", ";
first = false;
os << x;
}
os << ']';
return os;
}
string bin_string(int x) {
const int d = 32;
string res(d, ' ');
REP(i, 0, d) res[d-1-i] = '0'+(x>>i & 1LL);
return res;
}
int powa(int base, int exp) {
int res = 1;
while (exp) {
if (exp&1) res = res*base % MOD;
base = base*base % MOD;
exp >>= 1;
}
return res;
}
main() {
ios::sync_with_stdio(0), cin.tie(0);
int n,m,v,p;
cin >> n >> m >> v >> p;
vi a(n);
cin >> a;
sort(a.begin(), a.end());
vi pref = a;
REP(i, 1, n) pref[i] += pref[i-1];
v -= p-1;
int k = -1;
for (int b=n; b>=1; b/=2) {
while (k+b<n-p) {
int chk = k+b;
int ev = v - (chk+1);
ev = max(0LL, ev);
if (m >= a[n-p]-a[chk]) {
int sm = pref[n-p] - pref[chk];
if (sm + m*ev <= (m+a[chk])*(n-p-chk)) break;
}
k += b;
}
}
++k;
int res = 0;
REP(i, 0, n) if (a[i] >= a[k]) ++res;
print(res);
}
| 0
| 20,066,545
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using ll = long long;
using namespace std;
int main(){
int n,m,i;
ll tmp,ans = 0;
cin >> n >> m;
priority_queue<ll> q;
for(i=0;i<n;++i){
cin >> tmp;
q.push(tmp);
}
for(i=0;i<m;++i){
q.push(q.top()/2);
q.pop();
}
while(!q.empty()){
ans += q.top();
q.pop();
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
int N, M;
vector<vector<int>> graph;
vector<bool> seen;
int cnt = 0;
void dfs(int v)
{
if (seen[v]) return;
seen[v] = 1;
for (int nv : graph[v]) {
if (seen[nv]) continue;
dfs(nv);
}
bool flag = 1;
for (int i = 0; i < N; ++i) {
flag &= seen[i];
}
if (flag) {
++cnt;
}
seen[v] = 0;
}
int main()
{
cin >> N >> M;
graph.resize(N);
seen.resize(N, 0);
for (int i = 0; i < M; ++i) {
int from, to; cin >> from >> to; --from; --to;
graph[from].push_back(to);
graph[to].push_back(from);
}
dfs(0);
cout << cnt << endl;
}
| 0
| 70,336,294
|
#include <iostream>
#include <string>
using std::string;
int main()
{
string ring;
string target;
std::cin >> ring >> target;
string ringring = ring.append(ring);
size_t idx = ringring.find(target, 0);
if (idx != string::npos) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(){
int h = 0, w = 0;
while (1){
cin >> h >> w;
if (h == 0 && w == 0){ break; }
for (int i = 0; i < h;i++){
for (int s = 0; s < w; s++){
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
}
| 0
| 80,374,236
|
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define BACK(x) prev((x).end())
#define HASK(x, y) ((x).find(y) != (x).end())
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ithBit(m, i) ((m) >> (i) & 1)
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
const int maxN = 1 << 19;
const long long INF = 1000000000000ll;
const long double E = 1e-11;
int T[maxN], lck[maxN];
void solve()
{
long long a, b, k;
scanf ("%lld%lld%lld", &a, &b, &k);
long long dx = min(a, k);
a -= dx, k -= dx;
dx = min(b, k);
b -= dx, k -= dx;
printf("%lld %lld\n", a, b);
}
int main()
{
int t = 1;
FOR(tid, 1, t+1)
{
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD=1e9+7;
const ll LINF=1e18;
const int INF=0x3f3f3f3f;
const int MAXN=100050;
void solve(int T){
ll s,x1,x2,y1,y2;
scanf("%lld",&s);
if(s<=1e9){
printf("0 0 1 0 0 %lld\n",s);
return;
}
if(s==1e18){
printf("0 0 0 1000000000 1000000000 0\n");
return;
}
x1=1000000000;
y2=s/1000000000+1;
ll sy=s-s/1000000000*1000000000;
x2=1000000000-sy;
y1=1;
printf("0 0 %lld %lld %lld %lld\n",x1,y1,x2,y2);
}
signed main(){
int t=1;
for(int i=1;i<=t;i++){
solve(i);
}
}
| 0
| 45,284,589
|
#include<iostream>
#include<algorithm>
#include<iomanip>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <new>
#include <cmath>
#include<fstream>
using namespace std;
const long long MAXN = 200, mod = 1000000007, inff = 1000000007;
long long n, m, x1, yy, x2, y2, x, y , d, z , mini, dist[MAXN], di[MAXN][MAXN], edg[MAXN][MAXN], inf = 1000000000000000000;
pair <long long, pair<long long, long long> > edge[100000];
bool is[MAXN][MAXN];
bool iscycle()
{
for (int i = 0; i < n; i++)
{
dist[i] = inf;
}
dist[0] = 0;
long long mmm = m + n + 1;
while (mmm--)
{
for (int i = 0; i < m; i++)
{
x = edge[i].second.first;
y = edge[i].second.second;
d = edge[i].first;
if (dist[x] != inf)
dist[y] = min(dist[y], dist[x] + d);
}
}
for (int i = 0; i < m; i++)
{
x = edge[i].second.first;
y = edge[i].second.second;
d = edge[i].first;
if (dist[x] != inf && dist[y] > dist[x] + d)
{
return true;
}
}
return false;
}
int main()
{
cin >> n >> m;
for (int i = 0; i < m; i++)
{
cin >> x >> y >> d;
edg[x][y] = d;
edge[i].first = d;
edge[i].second.first = x;
edge[i].second.second = y;
is[x][y] = true;
}
if (iscycle())
{
cout << "NEGATIVE CYCLE" << endl;
}
else
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i == j) di[i][j] = 0;
else if (is[i][j]) di[i][j] = edg[i][j];
else di[i][j] = inf;
}
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (di[i][k] != inf && di[k][j] != inf)
di[i][j] = min(di[i][j], di[i][k] + di[k][j]);
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (di[i][j] == inf) cout << "INF";
else cout << di[i][j];
if (j != n-1)cout << " ";
}
cout << endl;
}
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
cin >> a;
char x=a[0];
char y=a[1];
char z=a[2];
if (x=='R' && y=='R' && z=='R'){
cout << 3;
}
else if (x=='R' && y=='R' && z!='R'){
cout << 2;
}
else if (x!='R' && y=='R' && z=='R'){
cout << 2;
}
else if (x!='R' && y!='R' && z!='R'){
cout << 0;
}
else{
cout << 1;
}
return 0;
}
| 0
| 13,500,449
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
vector<int> s;
cin>>n;
while(n!=0){
s.resize(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
sort(s.begin(),s.end());
s.erase(s.begin());
s.erase(s.end()-1);
int ans = 0;
for(int i=0;i<n-2;i++){
ans += s[i];
}
cout<<ans/(n-2)<<endl;
cin>>n;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int m, f, r;
char student[300];
int count = 0;
while (true)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
{
break;
}
int total = m + f;
if (m == -1 || f == -1 || total < 30)
{
student[count] = 'F';
}
else if (total >= 80)
{
student[count] = 'A';
}
else if (total >= 65)
{
student[count] = 'B';
}
else if (total >= 50)
{
student[count] = 'C';
}
else if (total >= 30)
{
student[count] = 'D';
if (r >= 50)
{
student[count] = 'C';
}
}
count++;
}
for (int i = 0; i < count; i++) {
cout << student[i] << endl;
}
return 0;
}
| 0
| 4,935,706
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll a,b,x; cin>>a>>b>>x;
if(2*x<=a*a*b) {cout<<fixed<<setprecision(15)<<atan((double)(a*b*b)/(2*x))*180/pi<<endl; return 0;}
x=a*a*b-x;
cout<<fixed<<setprecision(15)<<atan((double)(2*x)/(a*a*a))*180/pi<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> r(N + 1), g(N + 1), b(N + 1);
for (int i = 1; i < N + 1; i++) {
r[i] += r[i - 1] + (S[i - 1] == 'R');
g[i] += g[i - 1] + (S[i - 1] == 'G');
b[i] += b[i - 1] + (S[i - 1] == 'B');
}
ll ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (S[i] == S[j]) continue;
if ((S[i] == 'R' && S[j] == 'G') || (S[j] == 'R' && S[i] == 'G')) {
ans += b[N] - b[j + 1];
if (2 * j - i < N && S[2 * j - i] == 'B') ans--;
}
if ((S[i] == 'G' && S[j] == 'B') || (S[j] == 'G' && S[i] == 'B')) {
ans += r[N] - r[j + 1];
if (2 * j - i < N && S[2 * j - i] == 'R') ans--;
}
if ((S[i] == 'B' && S[j] == 'R') || (S[j] == 'B' && S[i] == 'R')) {
ans += g[N] - g[j + 1];
if (2 * j - i < N && S[2 * j - i] == 'G') ans--;
}
}
}
cout << ans << endl;
}
| 0
| 96,622,384
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int N;
int main(){
cin>>N;
LL ans = 0;
for (int i=1; i<=N; i++) ans += 1LL*i*(N-i+1);
for (int i=1; i<=N-1; i++){
int u,v; cin>>u>>v;
if (u>v) swap(u,v);
ans -= 1LL*u*(N-v+1);
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
const ll INF = 1LL << 60;
const ll MM = 1000000000; const ll MOD = MM + 7; const ll MMM=9223372036854775807;
#define ADD(a,b) a = (a + ll(b)) % MOD
#define MUL(a,b) a = (a * ll(b)) % MOD
ll GCD(ll x, ll y){ if(y == 0) return x; else return GCD(y, x % y);}
ll LCM(ll x, ll y){ return x / GCD(x, y) * y;}
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 A, size_t N, typename T> void FILL(A (&array)[N], const T &val){ fill( (T*)array, (T*)(array+N), val );}
using Graph = vector<vector<ll>>;
ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
ll ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
ll n, r = 0, g = 0;
cin >> n;
string s;
cin >> s;
rep(i, n){
if(s[i] == 'R') r++;
else if(s[i] == 'G') g++;
}
ll ans = r * g * (n - r - g);
rep(i, n-2){
Rep(j, i+1, n-1){
if(s[i] != s[j] && (2*j-i) <= (n-1) && s[i] != s[2*j-i] && s[j] != s[2*j-i]) ans--;
}
}
cout << ans << endl;
}
| 0
| 72,200,443
|
#pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
#pragma endregion
void solve() {
int N;
cin >> N;
vi64 A(N);
cin >> A;
i64 xor_sum = 0;
{
rep(i, N) xor_sum ^= A[i];
rep(i, N) A[i] &= ~xor_sum;
}
int p = 0;
rrep(i, 60) {
bool f = false;
repi(j, p, N) if ((A[j] >> i) & 1) {
swap(A[p], A[j]);
f = true;
break;
}
if (!f) {
continue;
}
rep(j, N) {
if (j == p) continue;
if ((A[j] >> i) & 1) A[j] ^= A[p];
}
p++;
}
A.resize(60);
i64 acc = 0;
rep(i, 60) acc ^= A[i];
i64 ans = acc * 2 + xor_sum;
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
bool primeNumber(ll n){
if(n < 2) return false;
else{
for(ll i = 2; i * i <= n; i++){
if(n % i == 0) return false;
}
return true;
}
}
int main(){
ll a,b,c;
cin>>a>>b>>c;
if (c >= a && b >= c)puts("Yes");
else puts("No");
return 0;
}
| 0
| 91,810,603
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for (int i = k; i < p; i++) {
if (num[i] == 0) break;
ans += num[i];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
int gcd(int m,int n)
{
if(m<n)
{
int t=m;
m=n;
n=t;
}
for(;;)
{
if(n==0)
return m;
int t=m%n;
m=n;
n=t;
}
}
int main()
{
int A,B,K;
std::cin>>A>>B>>K;
int g=gcd(A,B);
int count=0;
for(int i=g;i!=0;i--)
{
if(g%i==0)
{
count++;
if(count==K)
{
std::cout<<i<<std::endl;
break;
}
}
}
return 0;
}
| 0
| 48,110,321
|
#include <iostream>
#include <vector>
using namespace std;
vector<string> c;
int cntB(int bh, int bw) {
int cnt = 0;
for (int i = 0; i < c.size(); ++i) {
if (bh & (1 << i)) continue;
for (int j = 0; j < c[i].size(); ++j) {
if (bw & (1 << j)) continue;
if (c[i][j] == '#') cnt++;
}
}
return cnt;
}
int main(){
int h, w, k;
cin >> h >> w >> k;
c.resize(h);
for (int i = 0; i < h; ++i) {
cin >> c[i];
}
int ans = 0;
for (int b1 = 0; b1 < (1 << h); ++b1) {
for (int b2 = 0; b2 < (1 << w); ++b2) {
if (cntB(b1, b2) == k) ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint operator*(mint y) const {
return mint(long(value) * y.value);
}
mint operator*=(mint a) {
return *this = *this * a;
}
mint operator-() const {
return *this * mint(-1);
}
mint operator-(mint y) const {
return *this + (-y);
}
mint operator-=(mint a) {
return *this = *this - a;
}
operator int() {
return value;
}
static mint pow(mint a, int n) {
if (n <= 0) {
return 1;
}
else if (n == 1) {
return a;
}
mint half = pow(a, n / 2);
return n % 2 ? half * half * a : half * half;
}
};
int main() {
int N, K;
cin >> N >> K;
vector<mint> part(K + 1, 0);
for (int X = K; X >= 1; X--) {
int c = floor(K / X);
part[X] = mint::pow(c, N);
for (int j = 2; j <= c; j++) {
part[X] -= part[X * j];
}
}
mint ans = 0;
for (long i = 1; i <= K; i++) {
ans += i * part[i];
}
cout << ans << endl;
}
| 0
| 25,996,337
|
#include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const unsigned int M = 1e9 + 7;
int32_t main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int ans = 0;
if(k > n) k = n;
for(int i = 0; i < n - k; ++i) ans += a[i];
cout << ans;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int a,b,i,j,m=0,c[100][100];
cin>>a>>b;
char s[100][100];
for(i=0;i<a;i++){
for(j=0;j<b;j++){
cin>>s[i][j];
}
}
for(i=0;i<a;i++){
for(j=0;j<b;j++){
c[i][j]=0;
}
}
for(i=0;i<a;i++){
m=0;
for(j=0;j<b;j++){
if(s[i][j]!='.'){
m=1;
break;
}
}
if(m==0){
for(j=0;j<b;j++){
c[i][j]=1;
}
}
}
for(i=0;i<b;i++){
m=0;
for(j=0;j<a;j++){
if(s[j][i]!='.'){
m=1;
break;
}
}
if(m==0){
for(j=0;j<a;j++){
c[j][i]=1;
}
}
}
m=0;
for(i=0;i<a;i++){
m=0;
for(j=0;j<b;j++){
if(c[i][j]!=1){
m=1;
cout<<s[i][j];
}
}
if(m==1){
cout<<endl;
}
}
}
| 0
| 88,562,090
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
bool ok = (c >= a);
ok &= (c <= b);
printf("%s\n", ok ? "Yes" : "No");
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long calc(vector<long long>& List, int K) {
int N = List.size();
vector<long long> LSum(N);
LSum[0] = List[0];
for (int i = 1; i < N; i++) LSum[i] = LSum[i - 1] + List[i];
int NK = K;
if (K > N) K = N;
long long MAX = -pow(10ll, 10);
for (int i = 0; i < K; i++) MAX = max(MAX, LSum[i] + max(0ll, LSum[N - 1] * ((NK - (i + 1)) / K)));
for (int i = 1; i < N; i++) {
for (int j = i; j < i + K; j++) {
int nj = j % N;
if (i <= nj) MAX = max(MAX, LSum[nj] - LSum[i - 1] + max(0ll, LSum[N - 1] * ((NK - (j - i + 1)) / K)));
else MAX = max(MAX, LSum[N - 1] - LSum[i - 1] + LSum[nj] + max(0ll, LSum[N - 1] * ((NK - (j - i + 1)) / K)));
}
}
return MAX;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N);
vector<long long>C(N);
for (int i = 0; i < N; i++) {
cin >> P[i];
P[i]--;
}
for (int i = 0; i < N; i++) cin >> C[i];
vector<int> Used(N, 0);
long long ans = -pow(10ll, 10);
for (int st = 0; st < N;) {
Used[st] = 1;
vector<long long> List;
List.push_back(C[st]);
int now = P[st];
while (now != st) {
List.push_back(C[now]);
Used[now] = 1;
now = P[now];
}
ans = max(calc(List, K), ans);
while (st < N && Used[st]) st++;
}
cout << ans << endl;
}
| 0
| 38,813,162
|
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<typename T> auto compare = [](T x, T y) -> bool{return (x < y);};
const int MOD = 1000000007;
ll N, K;
ll A[200010], acc[200010];
map<ll, ll> mp;
signed main(){
cin >> N >> K;
REP(i, N) cin >> A[i];
ll ans = 0;
acc[0] = (A[0] - 1) % K;
REP(i, N - 1){
acc[i + 1] = (acc[i] + A[i + 1] - 1) % K;
}
REP(i, min(N, K - 1)) mp[acc[i]]++;
ans += mp[0];
mp[acc[0]]--;
int j = K - 2;
FOR(i, 1, N){
if(j < N - 1){
j++;
mp[acc[j]]++;
}
if(i <= j) ans += mp[acc[i - 1]];
mp[acc[i]]--;
}
PRINT(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
for(int i=0; i<min(s.size(),t.size()); i++){
if(s[i]>t[i]){
cout << "No" << endl;
return 0;
}
else if(s[i]<t[i]){
cout << "Yes" << endl;
return 0;
}
}
if(s.size() < t.size()) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 41,951,065
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll = long long;
const ll mod = 1e9 + 7;
int main(){
ll n, k;
cin >> n >> k;
ll ans = 0;
for(ll i=0; i <= n-k+1; i++){
ll s = (i*(n-i+1)+1)%mod;
ans = (ans + s) %mod;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
string data[10]={
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main(){
int t;
cin>>t;
while(t>0){
t--;
string str;
cin>>str;
string ans;
int counts=0;
for(int i=0;i<str.size();i++){
if(str[i]=='0'){
if(counts)ans+=data[str[i-1]-'0'][(counts-1)%data[str[i-1]-'0'].size()];
counts=0;
}
else counts++;
}
cout<<ans<<endl;
}
}
| 0
| 94,497,968
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
string ans = "No";
if (N[0] == N[1] && N[1] == N[2]) {
ans = "Yes";
}
if (N[1] == N[2] && N[2] == N[3]) {
ans = "Yes";
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <math.h>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rep3(var, min, max) for (ll (var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll (var) = (max) - 1; (var) + 1 > (min); --(var))
#define Mp(a,b) make_pair((a),(b))
#define F first
#define S second
#define CIN(s) int (s);cin>>(s);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF =1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
V vec(n);
rep(i,n)cin>>vec[i];
reverse(all(vec));
ll k_max=2;
ll k_min=2;
if(vec[0]!=2){
cout<<-1<<endl;
return 0;
}
rep3(i,0,n-1){
k_max+=vec[i]-1;
k_max=(k_max/vec[i+1])*vec[i+1];
if(k_min%vec[i+1]!=0){
k_min=((k_min/vec[i+1])+1)*vec[i+1];
if(k_min>k_max){
cout<<-1<<endl;
return 0;
}
}
}
k_max+=vec[n-1]-1;
cout<<k_min<<" "<<k_max<<endl;
}
| 0
| 16,868,245
|
#include <iostream>
#include <cctype>
#include <stdio.h>
#include <string>
int main()
{
char ch;
std::string str;
while (1)
{
scanf("%c", &ch);
if (ch == '\n')
{
break;
}
if (islower(ch))
{
str += (char)toupper(ch);
}
else if (isupper(ch))
{
str += (char)tolower(ch);
}
else
{
str += ch;
}
}
printf("%s\n", str.c_str());
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 524288
vector<int> vertexs[200000];
long long timing[200000] = {};
int bad = 0;
long long solve(int now, int back) {
if (vertexs[now].size() == 1&&back != -1) return timing[now];
vector<long long> gogo;
REP(i, vertexs[now].size()) {
if (vertexs[now][i] != back) {
long long geko = solve(vertexs[now][i], now);
gogo.push_back(geko);
if (geko < 0) bad = 1;
}
}
long long required_loop = 0;
REP(i, gogo.size()) {
required_loop += gogo[i];
}
required_loop -= timing[now];
if (required_loop < 0) bad = 1;
long long backe = 0;
sort(gogo.begin(), gogo.end());
REP(i, gogo.size()-1) {
backe += gogo[i];
}
if (required_loop > backe) bad = 1;
if (bad == 1) {
return 11000000000000000LL;
}
else {
return timing[now] - required_loop;
}
}
int main() {
#define int long long
int n;
cin >> n;
REP(i, n) {
cin >> timing[i];
}
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
vertexs[a].push_back(b);
vertexs[b].push_back(a);
}
REP(i, n) {
if (vertexs[i].size() == 1) {
if (solve(i, -1) == timing[i]&&bad == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
}
}
}
| 0
| 83,763,416
|
#include <iostream>
using namespace std;
void replace(string &str, int a, int b, string p) {
for (int i = 0; i <= (b - a); i++) {
str[i + a] = p[i];
}
}
void reverse(string &str, int a, int b) {
string newStr = str;
for (int i = a, j = b; i <= b; i++, j--) {
newStr[i] = str[j];
}
str = newStr;
}
void print(string str, int a, int b) {
for (int i = a; i <= b; i++) {
cout << str[i];
}
cout << "\n";
}
int main() {
string str;
cin >> str;
int n;
cin >> n;
string order;
int a, b;
for (int i = 0; i < n; i++) {
cin >> order;
cin >> a >> b;
if (order == "print") {
print(str, a, b);
} else if (order == "reverse") {
reverse(str, a, b);
} else if (order == "replace") {
string p;
cin >> p;
replace(str, a, b, p);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n];
rep(i,0,n){
cin>>a[i];
}
int b[n];
if(n%2==0){
rep(i,0,n/2){
b[n/2+i]=a[2*i];
}
rep(i,0,n/2){
b[n/2-1-i]=a[2*i+1];
}
}
else{
rep(i,0,n/2+1){
b[n/2-i]=a[2*i];
}
rep(i,0,n/2){
b[n/2+1+i]=a[2*i+1];
}
}
rep(i,0,n) cout<<b[i]<<endl;
}
| 0
| 3,283,081
|
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < m; i++) {
int x; cin >> x;
mp[x] = 1;
}
vector<long long> fibo(2);
fibo[0] = 0;
fibo[1] = 1;
long long md = 1e9 + 7;
for (int i = 1; i <= n; i++) {
long long x = fibo[0] + fibo[1];
fibo[0] = fibo[1];
if (mp.count(i)) {
x = 0;
}
fibo[1] = x % md;
}
cout << fibo[1] << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,n) cin >> a.at(i);
rep(i,n) cin>> b.at(i);
vector<int> c;
long long point=0;
int ans=0;
rep(i,n){
if(b.at(i)>a.at(i)){
point+=b.at(i)-a.at(i);
ans++;
}
else c.push_back(a.at(i)-b.at(i));
}
sort(c.begin(),c.end(),greater<>());
if(point>0){
for(int i=0; i<c.size(); i++){
point-=c.at(i);
ans++;
if(point<=0) break;
}
}
if(point<=0) cout << ans << endl;
else cout << -1 << endl;
return 0;
}
| 0
| 95,529,553
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
char c = s.at(k-1);
for (int i = 0; i < n; i++) {
if (s.at(i) == c)cout << c;
else cout << "*";
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define MAXN 105
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORR(j, i, n) for (int i = j; i < n; i++)
#define FORD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOBIR(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define endl '\n'
#define DUEHOANG \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define JaydenXia(in, out) \
freopen(in, "r", stdin); \
freopen(out, "w", stdout);
#define ll long long
typedef set<int> si;
typedef vector<int> vi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef priority_queue<int> pqi;
typedef stack<int> sti;
typedef queue<int> qi;
typedef deque<int> di;
typedef map<int, int> mii;
#define f first
#define s second
#define EPS 1e-9
int n;
pii psum[MAXN];
pii a[MAXN];
bool ang(pii p, pii q)
{
return atan2(p.f, p.s) < atan2(q.f, q.s);
}
int main()
{
cin >> n;
FOR(i, n)
{
cin >> a[i].f >> a[i].s;
}
sort(a, a+n, ang);
ll ans = 0;
FOR(i, n)
{
ll x = 0;
ll y = 0;
FOR(j, n)
{
x += a[(i+j)%n].f;
y += a[(i+j)%n].s;
ans = max(ans, x*x+y*y);
}
}
cout << setprecision(25) << fixed << sqrt(ans) << endl;
}
| 0
| 97,155,926
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
vector<int> a(3);
rep(i, 3) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
cout << a[0] * 10 + a[1] + a[2] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)
template<typename T> bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
LL ex_gcd(LL a, LL b, LL & x, LL & y) {
LL d = a;
if(b != 0) {
d = ex_gcd(b, a % b, y, x);
y -= (a / b) * x;
} else { x = 1; y = 0; }
return d;
}
LL divmod(LL x, LL y, LL MOD) {
LL inv, m;
ex_gcd(y, MOD, inv, m);
if(inv < 0) { inv += MOD; }
return x * inv % MOD;
}
LL n, a[100001], b[100001], v, MOD = 1e9 + 7;
LL memo[2][100002];
bool flag[2][100002];
LL comb(LL x, LL y) {
if(! inII(y, 0, x)) { return 0; }
LL z = (x == n - 1);
if(flag[z][y]) { return memo[z][y]; }
flag[z][y] = true;
if(y == 0) { return memo[z][y] = 1; }
LL r = divmod(comb(x, y - 1) * (x - (y - 1)) % MOD, y, MOD);
return memo[z][y] = r;
}
int main() {
cin >> n;
inc(i, n + 1) { cin >> a[i]; }
inc(i, n + 1) { b[i] = -1; }
inc(i, n + 1) {
if(b[ a[i] ] != -1) {
v = n + 1 - (abs(b[ a[i] ] - i) + 1);
break;
}
b[ a[i] ] = i;
}
inc1(k, n + 1) {
LL ans = (comb(n - 1, k) + comb(n - 1, k - 2) + 2 * comb(n - 1, k - 1) + (MOD - comb(v, k - 1))) % MOD;
cout << ans << "\n";
}
return 0;
}
| 0
| 97,464,346
|
#include <iostream>
using namespace std;
int main()
{
int P[1000000] = {};
int c = 0, j, k;
for (k = 2; k < 1000000; ++k){
if (P[k] == 0){
++c;
for (j = 2; j * k < 1000000; ++j)
P[j * k] = -1;
}
P[k] = c;
}
while (cin >> k)
cout << P[k] << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n, m;
char c[256];
char a,b;
while( cin >> n && n ){
for( int i=0;i<256;i++ )
c[i] = '.';
while( n-- ){
cin >> a >> b;
c[(int)a] = b;
}
cin >> m;
while( m-- ){
cin >> a;
if( c[(int)a]!='.' ){
cout << c[(int)a];
}else{
cout << a;
}
}
cout << endl;
}
return 0;
}
| 0
| 34,760,699
|
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int a[n];
int b[n]={};
for (int i=0;i<n;i++)
{
scanf("%d",&a[i]);
if (i)
b[i]=a[i]+b[i-1];
else
b[i]=a[i];
}
int sum1=0;
for (int i=1;i<n;i++)
{
sum1=sum1+(a[i]*b[i-1]);
}
printf("%d\n",sum1);
return 0;
}
|
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
using namespace std;
template <class T> using V = vector<T>;
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;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using bl = bool;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using vbl = V<bl>;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rFOR(i,a,b) for(ll i=(a);i>(b);i--)
#define oFOR(i,a,b) for(ll i=(a);i<(b);i+=2)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn,(a).en)
#define REV(a) reverse((a).bgn,(a).en)
#define M(a,b) max(a,b)
#define rM(a,b) min(a,b)
#define fi first
#define se second
#define sz size()
#define gcd(a,b) __gcd(a,b)
#define co(a) cout<<a<<endl;
#define ci(a) cin>>a;
ll sum(ll n) {
ll m=0;
FOR(i,0,20){
m+=n%10;
n/=10;
if(n==0){
break;
}
}
return m;
}
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void Comuse() {
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;
}
}
#define comuse Comuse()
ll combi(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;
}
ll lcm(ll a,ll b){
ll n;
n=a/gcd(a,b)*b;
return n;
}
signed main() {
ll n;
ci(n);
ll h,w;
ci(h>>w);
ll ans=0;
FOR(i,0,n){
ll a,b;
ci(a>>b);
if(h<=a&&w<=b){
ans++;
}
}
co(ans)
}
| 0
| 4,899,317
|
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<pair<ll, ll>> p(n);
for (int i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
p[i] = {a, b};
}
sort(p.begin(), p.end(), [](pair<ll, ll> p1, pair<ll, ll> p2) {
return p1.first + p1.second > p2.first + p2.second;
});
ll result = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
result += p[i].first;
} else {
result -= p[i].second;
}
}
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(26, 0);
int len = s.size();
sort(s.begin(), s.end());
for(int i = 0; i < len; i++){
v[s[i] - 'a']++;
}
for(int i = 0; i < 26; i++){
if(v[i] == 0){
char ch = v[i] + 'a' + i;
cout << ch << endl;
return 0;
}
}
cout << "None" << endl;
return 0;
}
| 0
| 18,553,274
|
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
string a, b;
cin >> a >> b;
a += a;
if (a.find(b) != string::npos) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int MOD = 1e9 + 7;
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
if(s[0] != 'B' || s[2 * n - 1] != 'B'){
cout << 0 << endl;
return 0;
}
string res = "";
res += 'L';
repn(i, 1, 2 * n){
if(s[i] == s[i - 1]){
if(res[res.size() - 1] == 'L') res += 'R';
else res += 'L';
}
else{
res += res[res.size() - 1];
}
}
ll ans = 1LL;
ll l1 = 0, r1 = 0;
rep(i, 2 * n){
if(res[i] == 'L') l1++;
else (ans *= l1 - r1) %= MOD, l1--;
}
if(l1){
cout << 0 << endl;
return 0;
}
repn(i, 1, n + 1) (ans *= i) %= MOD;
cout << ans << endl;
return 0;
}
| 0
| 61,626,656
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
int f(int n){
int sum =0;
while(n>0){
sum +=n%10;
n/=10;
}
return sum;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
int k=0;
rep(i,n+1){
int sum =f(i);
if(a <=sum && sum <=b){
k+=i;
}
}
cout << k << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <numeric>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define input(...) __VA_ARGS__; in(__VA_ARGS__)
#if __has_include("debugger.cpp")
#include "debugger.cpp"
#else
void print() {
std::cout << std::endl;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) > 0) cout << " ";
print(std::forward<Tail>(tail)...);
}
# endif
void in() { }
template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
cin >> head;
in(std::forward<Tail>(tail)...);
}
int main() {
ll input(n);
vector<ll> a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
ll cnt = 0;
REP(i, n) {
if (a[i] > b[i]) cnt += b[i];
else {
cnt += a[i];
ll diff = b[i] - a[i];
cnt += diff;
a[i + 1] -= diff;
if (a[i + 1] < 0) {
cnt += a[i + 1];
a[i + 1] = 0;
}
}
}
print(cnt);
}
| 0
| 71,335,381
|
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.rbegin(), a.rend());
int aa = -1, b = -1;
int cnt = 0;
for (int i = 0; i < n-1; i++) {
if (a[i] != a[i+1]) {
cnt = 0;
continue;
}
if (a[i] == a[i+1]) {
if (aa == -1) {
aa = a[i];
i++;
}
else {
b = a[i];
break;
}
}
}
if (aa == -1 || b == -1) cout << 0 << endl;
else cout << (Int)aa * b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long int li;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<ll> a(n,0);
for (int i=0; i<n; i++) cin >> a[i];
vector<ll> s(n+1, 0);
map<ll, ll> nums;
for (int i=0; i<n; i++) s[i+1] = s[i] + a[i];
for (int i=0; i<n+1; i++) nums[s[i]]++;
ll res = 0;
for (auto it : nums) {
ll num = it.second;
res += num * (num-1) / 2;
}
cout << res << "\n";
return 0;
}
| 0
| 32,346,429
|
#include <bits/stdc++.h>
#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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll ans = a - b;
if (k & 1) ans = -ans;
cout << ans << endl;
}
|
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define double long double
using namespace std;
const double PI = acos(-1);
const double eps = 0.0000000001;
const int INF = 0x3fffffffffffffff;
int n, ans, be[10005], ed[10005], now, has[2][2];
string s[10005];
const int g[2][2] = {
{4, 1},
{3, 2}};
signed main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i)
{
cin >> s[i];
while ((now = s[i].find("AB")) < s[i].length())
{
++ans;
s[i][now] = s[i][now + 1] = 'G';
}
if (s[i].front() == 'B')
{
be[i] = 1;
}
if (s[i].back() == 'A')
{
ed[i] = 1;
}
++has[be[i]][ed[i]];
}
while (has[0][1] || has[1][1])
{
if (has[0][1])
{
--has[0][1];
while (has[1][1])
{
++ans;
--has[1][1];
}
if (has[1][0])
{
++ans;
--has[1][0];
}
}
if (has[1][1])
{
--has[1][1];
while (has[1][1])
{
++ans;
--has[1][1];
}
if (has[1][0])
{
++ans;
--has[1][0];
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 33,191,531
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> P;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main() {
ll x, y; cin >> x >> y;
ll now = x;
int ans = 0;
while (now <= y) {
ans++;
now *= 2;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int num;
int main()
{
int a;
int temp;
vector<int> cost(1e5+1,0);
vector<int> dp(1e5+1,0);
while(cin>>a){
fill(cost.begin(),cost.end(),0);
fill(dp.begin(),dp.end(),0);
for(int i=0;i<a;i++){
cin>>cost[i];
}
temp=0;
dp[0]=0;
dp[1]=abs(cost[1]-cost[0]);
for(int i=2;i<a;i++){
dp[i]=min(dp[i-1]+abs(cost[i-1]-cost[i]),dp[i-2]+abs(cost[i-2]-cost[i]));
}
cout<<dp[a-1]<<endl;
}
}
| 0
| 59,971,966
|
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (lower_bound(ALL(c),x)-upper_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}
struct edge { int to, cost; };
template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}
const int INF = 1e18;
const int MOD_N = 1e9+7;
class UnionFind
{
private:
vector<int> par, myrank;
public:
UnionFind(int n) {
par.resize(n);
myrank.resize(n, 0);
for (int i = 0; i < n; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (myrank[x] < myrank[y]) {
par[x] = y;
} else {
par[y] = x;
if(myrank[x] == myrank[y]) myrank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
};
signed main()
{
int n, q; cin >> n >> q;
V<int> c(q), x(q), y(q);
REP(i, q) {
cin >> c[i] >> x[i] >> y[i];
}
UnionFind uf(n);
REP(i, q) {
if (c[i] == 0) {
uf.unite(x[i], y[i]);
} else {
cout << (uf.same(x[i], y[i]) ? 1 : 0) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <fstream>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <math.h>
#include <iomanip>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0);
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define gcd __gcd
#define digits(n) (int)(log10(n) + 1)
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <long long> vl;
typedef vector <pll> vll;
typedef vector <pii> vii;
const int INF = 0x3f3f3f3f;
const int LINF = 0x3f3f3f3f3f3f3f3f;
template <typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template <typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
const int DIM = 100;
main()
{
IOS
int a, b;
cin >> a >> b;
a--;
b--;
cout << DIM << ' ' << DIM << '\n';
for(int h = 0; h < DIM / 2; h++)
{
for(int w = 0; w < DIM; w++)
{
if(a > 0 && h % 2 == 0 && w % 2 == 0)
{
cout << '.';
a--;
}
else
{
cout << '#';
}
}
cout << '\n';
}
for(int w = 0; w < DIM; w++)
cout << '.';
cout << '\n';
for(int h = DIM / 2 + 1; h < DIM; h++)
{
for(int w = 0; w < DIM; w++)
{
if(b > 0 && h % 2 == 0 && w % 2 == 0)
{
cout << '#';
b--;
}
else
{
cout << '.';
}
}
cout << '\n';
}
}
| 0
| 65,072,443
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <cmath>
#include <limits>
#include <utility>
#include <map>
#include <iomanip>
#define rep(p,q) for(int i = p;i < q;i++)
#define ll long long
using namespace std;
const int cons = 1e9 + 7;
int n;
vector<double> v;
vector<double> l;
vector<double> r;
double speed(double t) {
double ret = 100;
rep(0, n + 2) {
double reti = 0;
if (t <= l[i]) reti = v[i] + l[i] - t;
else if (r[i] <= t) reti = v[i] + t - r[i];
else reti = v[i];
ret = min(ret, reti);
}
return ret;
}
int main(void) {
cin >> n;
v = vector<double>(n + 2);
l = vector<double>(n + 2);
r = vector<double>(n + 2);
v[0] = 0; l[0] = 0; r[0] = 0;
v[n + 1] = 0;
int T = 0;
rep(1, n + 1) {
int ti = 0;
cin >> ti;
r[i] = r[i - 1] + ti;
l[i] = r[i - 1];
T += ti;
}
l[n] = r[n - 1];
rep(1, n + 1) {
cin >> v[i];
}
l[n + 1] = T; r[n + 1] = T;
double ans = 0;
for (double i = 0; i < T; i += 0.5) {
double s1 = speed(i);
double s2 = speed(i + 0.5);
ans += 0.25*(s1 + s2);
}
cout << fixed << setprecision(3) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
int n;
vector<int> ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
int sum=0,i=1;
while(sum<n) {
sum+=i;i++;
}
if(sum==n) {
FOR(j,1,i) cout<<j<<endl;
}
else {
int tmp=sum-n;
FOR(j,1,i) if(j!=tmp) cout<<j<<endl;
}
return 0;
}
| 0
| 62,510,379
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
map<char, int> dictS, dictT;
for (int i=0; i<S.size(); i++) {
if (dictS.count(S[i])) dictS[S[i]]++;
else dictS[S[i]] = 1;
}
for (int i=0; i<T.size(); i++) {
if (dictT.count(T[i])) dictT[T[i]]++;
else dictT[T[i]] = 1;
}
vector<int> memoS, memoT;
for (auto p: dictS) {
auto value = p.second;
memoS.push_back(value);
}
for (auto p: dictT) {
auto value = p.second;
memoT.push_back(value);
}
sort(memoS.begin(), memoS.end());
sort(memoT.begin(), memoT.end());
if (memoS==memoT) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#define rep(i,N) for(int i=0;i<N;i++)
long long INF=1000000000000000000;
long long mod=1000000007;
using namespace std;
int N;
void show_ans(int ans[]){
for(int i=1;i<=N;i++){
if(ans[i]==0){
cout<<'S';}
else{
cout<<'W';}
}
return;
}
int main(){
cin>>N;
string s;
cin>>s;
int head[2]={0,1};
int next[2]={0,1};
rep(i,2)rep(k,2){
int ans[N+2];
ans[1]=head[i];
ans[2]=next[k];
for(int l=2;l<N;l++){
if(s[l-1]=='o' && ans[l]==0){
ans[l+1]=ans[l-1];
}
else if(s[l-1]=='o' && ans[l]==1){
ans[l+1]=1-ans[l-1];
}
if(s[l-1]=='x' && ans[l]==0){
ans[l+1]=1-ans[l-1];
}
else if(s[l-1]=='x' && ans[l]==1){
ans[l+1]=ans[l-1];
}
}
ans[N+1]=ans[1];
ans[0]=ans[N];
bool cor=true;
for(int l=1;l<=N;l++){
if(s[l-1]=='o'){
if(ans[l]==0){
if(ans[l+1]!=ans[l-1])cor=false;
}
if(ans[l]==1){
if(ans[l-1]==ans[l+1])cor=false;
}
}
else if(s[l-1]=='x'){
if(ans[l]==1){
if(ans[l-1]!=ans[l+1])cor=false;
}
if(ans[l]==0){
if(ans[l-1]==ans[l+1])cor=false;
}
}
}
if(cor){
show_ans(ans);
return 0;
}
}
cout<<"-1"<<endl;
return 0;
}
| 0
| 7,341,587
|
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
double N, K;
cin >> N >> K;
double ans = 0.0;
for(int i = 0;i < N;i++){
double score = i + 1;
double prob = 1 / N;
while(score < K){
prob /= 2;
score *= 2;
}
ans += prob;
}
cout << fixed << setprecision(10);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define PB(x) push_back(x)
#define MP(x, y) make_pair(x, y)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
ll h, w; cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<ll>> d(h, vector<ll>(w, INF));
if(s[0][0] == '.') d[0][0] = 0;
else d[0][0] = 1;
queue<P> q;
q.push(MP(0, 0));
while(!q.empty()) {
ll x = q.front().first, y = q.front().second;
q.pop();
if(x+1 < h) {
if(s[x][y] == '.' && s[x+1][y] == '#') {
if(d[x+1][y] > d[x][y] + 1) {
d[x+1][y] = d[x][y] + 1;
q.push(MP(x+1, y));
}
}
else {
if(d[x+1][y] > d[x][y]) {
d[x+1][y] = d[x][y];
q.push(MP(x+1, y));
}
}
}
if(y+1 < w) {
if(s[x][y] == '.' && s[x][y+1] == '#') {
if(d[x][y+1] > d[x][y] + 1) {
d[x][y+1] = d[x][y] + 1;
q.push(MP(x, y+1));
}
}
else {
if(d[x][y+1] > d[x][y]) {
d[x][y+1] = d[x][y];
q.push(MP(x, y+1));
}
}
}
}
cout << d[h-1][w-1] << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
| 0
| 96,233,343
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, a = 0;
std::cin >> n >> a;
const int t = n % 500;
if (t <= a)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> vector_plus(vector<int> &arr1,vector<int> &arr2,int &m){
vector<int> result(m+1);
for(int i=0;i<m+1;i++){
result.at(i) = arr1.at(i) + arr2.at(i);
}
return result;
}
bool x_check(vector<int> arr,int x,int m){
bool flag = true;
for(int i=1;i<m+1;i++){
if(arr.at(i) < x){
flag = false;
break;
}
}
return flag;
}
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> array(n,vector<int>(m+1));
for(int i=0;i<n;i++){
for(int j=0;j<m+1;j++){
cin >> array.at(i).at(j);
}
}
vector<int> money(0);
for(int tmp = 0; tmp < ( 1 << 12); tmp++){
bitset<12> s(tmp);
vector<int> arr(m+1);
for(int i=0;i<n;i++){
if(s.test(i)){
arr = vector_plus(arr,array.at(i),m);
}
}
if(x_check(arr,x,m)){
money.push_back(arr.at(0));
}
}
if(money.size() < 1){
cout << -1 << endl;
}else{
int min = 2147483647 ;
for(int i=0;i<money.size();i++){
if(min > money.at(i)){
min = money.at(i);
}
}
cout << min << endl;
}
}
| 0
| 21,700,241
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
#define CONTAINS_SET(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
signed main()
{
int a, b, x;
cin >> a >> b >> x;
YESNO(a <= x && x <= a + b);
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
# define ll long long int
const int md = 1e9+7;
ll Parent[200005];
ll sze[200005];
void Build(int n)
{ for(ll i=1;i<=n;i++)
{ Parent[i]=i;
sze[i]=1;
}
}
ll find(ll u)
{
if(Parent[u]==u) return u;
else
{
return Parent[u]=find(Parent[u]);
}
}
void Union(ll a, ll b)
{
ll P_a= find(a);
ll P_b= find(b);
if(P_a!=P_b)
{
sze[P_b]+=sze[P_a];
Parent[P_a]=Parent[P_b];
}
}
int main()
{
ll n,m;
cin>>n>>m;
Build(n);
for(int i=0;i<m;i++)
{
ll x,y;
cin>>x>>y;
Union(x,y);
}
unordered_map<int,int> mp;
ll mx=0;
for(int i=1;i<=n;i++)
{
int p=find(i);
if(mp.find(p)==mp.end())
{
mp[p]=1;
mx= max(mx,sze[p]);
}
}
cout<<mx<<endl;
}
| 0
| 14,831,077
|
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;
struct UnionFind {
vector<int> parent;
UnionFind(int N) : parent(N) {
for (int i = 0; i < N; i++) {
parent[i] = -1;
}
}
int root(int i) {
if (parent[i] < 0) {
return i;
}
return (parent[i] = root(parent[i]));
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx != ry) {
parent[ry] += parent[rx];
parent[rx] = ry;
return true;
}
else {
return false;
}
}
bool same(int x, int y) {
return root(x) == root(y);
}
int treeSize(int x) {
return -parent[root(x)];
}
};
long long int modpow(long long int base, long long int pow, long long int mod) {
if (pow == 1) {
return base;
}
else if (pow == 0) {
return 1;
}
if (pow % 2 == 0) {
auto temp = modpow(base, pow / 2, mod);
return (temp * temp) % mod;
}
else {
return base * modpow(base, pow - 1, mod) % mod;
}
}
long long int moddiv(long long int X, long long int Y, long long int mod) {
auto fermatDiv = modpow(Y, mod - 2, mod);
return (X * fermatDiv) % mod;
}
long long modCombination(long long left, long long right, long long int mod) {
long long answer = 1;
for (long long i = 0; i < right; i++) {
answer = (answer * (left - i)) % mod;
answer = moddiv(answer, (i + 1), mod);
}
return answer;
}
bool IsPrime(long long N) {
if (N == 1) {
return false;
}
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({ a, ex });
}
if (N != 1) res.push_back({ N, 1 });
return res;
}
long long euclid(long long a, long long b) {
if (a > b) {
long long temp = b;
b = a;
a = temp;
}
if (b % a == 0) {
return a;
}
else {
return euclid(a, b - a);
}
}
int main() {
long long N;
cin >> N;
cout << N * (N + 1) / 2 - N << endl;
return 0;
}
|
#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 200000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<long, long>;
long long int digit(string s, int K){
long long int dp[110][2][110] = {0};
int n = s.size();
dp[0][0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < 2; j++){
for(int k = 0; k <= n; k++){
int lim;
if(j == 1){
lim = 9;
}else{
lim = s[i] - '0';
}
for(int d = 0; d < lim+1; d++){
dp[i+1][j || d < lim][k + (d != 0)] += dp[i][j][k];
}
}
}
}
return dp[n][0][K] + dp[n][1][K];
}
int main(){
string n;
int k;
cin >> n >> k;
long long int ans = digit(n, k);
cout << ans << endl;
}
| 0
| 54,467,786
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
#define MAX 2100000
int main(){
int N,K;
cin>>N>>K;
vector<ll> x(N),y(N);
for(int i=0;i<N;i++){
cin>>x.at(i)>>y.at(i);
}
ll ans=4000000000000000000;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
ll left=x.at(i);
ll right=x.at(j);
if(right<left){
continue;
}
for(int k=0;k<N;k++){
for(int l=0;l<N;l++){
ll top=y.at(k);
ll bottom=y.at(l);
if(top<bottom){
continue;
}
int count=0;
for(int m=0;m<N;m++){
if(left<=x.at(m)&&x.at(m)<=right&&bottom<=y.at(m)&&y.at(m)<=top){
count++;
}
}
if(count>=K){
ans=min(ans,(right-left)*(top-bottom));
}
}
}
}
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
for (int i=0; i<2; i++) {
int nx, ny;
int xd = x2 - x1;
int yd = y2 - y1;
nx = x2 - yd;
ny = y2 + xd;
cout << nx << " " << ny;
if (i == 1) cout << endl;
else cout << " ";
x1 = x2; x2 = nx;
y1 = y2; y2 = ny;
}
}
| 0
| 77,112,700
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <random>
#include <map>
using namespace std;
int fibArray[50];
void makeFibArray() {
for (int i = 2; i <= 46; i++) {
fibArray[i] = fibArray[i - 1] + fibArray[i - 2];
}
}
int main() {
int n; scanf("%d", &n);
fibArray[0] = 1;
fibArray[1] = 1;
makeFibArray();
printf("%d\n", fibArray[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll= long long;
using ld= long double;
using vl= vector<ll>;
using vd= vector<ld>;
using vs= vector<string>;
using vb= vector<bool>;
using vvl= vector<vector<ll>>;
using vvd= vector<vector<ld>>;
using vvs= vector<vector<string>>;
using vvb= vector<vector<bool>>;
using pll= pair<ll, ll>;
constexpr ll mod= 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for(ll(i)= 0; (i) < (n); (i)++)
#define REPS(i, n) for(ll(i)= 1; (i) <= (n); (i)++)
#define RREP(i, n) for(ll(i)= (n - 1); (i) >= 0; (i)--)
#define RREPS(i, n) for(ll(i)= (n); (i) > 0; (i)--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
template <class T>
inline void chmin(T &a, T b) {
if(a > b) { a= b; }
}
template <class T>
inline void chmax(T &a, T b) {
if(a < b) { a= b; }
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll N,Q;
cin >> N >> Q;
dsu d(N);
vl A(Q);
vl U(Q);
vl V(Q);
REP(i,Q)cin >> A[i] >> U[i] >> V[i];
REP(i,Q){
if(A[i] == 0){
d.merge(U[i],V[i]);
}else{
cout << (d.same(U[i],V[i])?1:0) << "\n";
}
}
}
| 0
| 57,878,516
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc111_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18+100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
string S;
cin >> S;
int N = S.size();
rep(i, N) {
if (S[i] == '1')
S[i] = '9';
else
S[i] = '1';
}
cout << S << endl;
}
|
# include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
ll m, v, p;
vector<ll> a;
bool bin(int i) {
ll sm = 0;
ll k = a[i] + m;
if (k < a[p - 1]) {
return false;
}
sm += (p - 1) * m + (n - i) * m;
for (int x = p - 1; x < i; x++) {
sm += max(ll(0), k - a[x]);
}
return sm >= m * v;
}
int main() {
cin >> n >> m >> v >> p;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int l = p - 1;
int r = n;
while (r - l > 1) {
int mid = (l + r) / 2;
if (bin(mid)) {
l = mid;
} else {
r = mid;
}
}
cout << l + 1 << endl;
return 0;
}
| 0
| 68,763,654
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
ll mod = 1000000007;
ll n, m;
cin >> n >> m;
ll a[n];
fill(a, a + n, 0);
rep(i, m){
ll b;
cin >> b;
a[b] = 1;
}
ll dp[n+1];
dp[0] = 1;
if(a[1] == 1){
dp[1] = 0;
}else{
dp[1] = 1;
}
for (ll i = 2; i <= n; i++){
if(a[i] == 1) dp[i] = 0;
else {
dp[i] = dp[i-1] + dp[i-2];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
#define A_MAX 1000000
#define A_MAX_HALF 500000
using namespace std;
int min_factor[A_MAX + 1];
int q[A_MAX + 1];
int a[A_MAX + 1];
int main() {
vector<int> primes{ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997 };
for (int i = 2; i <= A_MAX_HALF; ++i) {
if (!min_factor[i]) {
min_factor[i] = i;
}
int min_factor_i = min_factor[i];
for (int p : primes) {
int n = i * p;
if (n > A_MAX) {
break;
}
min_factor[n] = p;
if (p == min_factor_i) {
q[n] = q[i];
break;
} else {
q[n] = i;
}
}
}
int N = 0;
char c = getchar_unlocked();
do {
N = 10 * N + c - '0';
} while ((c = getchar_unlocked()) >= '0');
for (int i = 0; i < N; ++i) {
int A = 0;
c = getchar_unlocked();
do {
A = 10 * A + c - '0';
} while ((c = getchar_unlocked()) >= '0');
++a[A];
}
int is_pairwise_coprime = 1;
for (int n = A_MAX; n > 1; --n) {
int an = a[n];
if (an) {
if (an > 1) {
if (an == N) {
printf("not coprime\n");
return 0;
}
is_pairwise_coprime = 0;
}
a[min_factor[n]] += an;
a[q[n]] += an;
}
}
if (is_pairwise_coprime) {
printf("pairwise coprime\n");
} else {
printf("setwise coprime\n");
}
return 0;
}
| 0
| 90,297,640
|
#include <bits/stdc++.h>
using namespace std;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
int main ()
{
int x , y ;
int baba ;
cin >> x >> y ;
if (y % 2 ==0)
{
baba = x + (y / 2) ;
cout << baba ;
}
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
rep(i, N) cin >> P[i], P[i]--;
rep(i, N) cin >> C[i];
ll ans = -INF;
rep(i, N) {
int v = i;
ll cycle_sum = 0;
int cycle_cnt = 0;
while (true) {
cycle_cnt++;
cycle_sum += C[v];
v = P[v];
if (v == i) break;
}
ll path = 0;
int cnt = 0;
while (true) {
cnt++;
path += C[v];
if (cnt > K) break;
int num = (K - cnt) / cycle_cnt;
ll score = path + max(0LL, cycle_sum) * num;
ans = max(ans, score);
v = P[v];
if (v == i) break;
}
}
cout << ans << endl;
}
| 0
| 48,726,117
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b;
int main() {
cin >> a >> b;
if (a <= 8 && b <= 8)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
rep(i, h) {
rep(ii, w) {
string s;
cin >> s;
if (s == "snuke") {
cout << (char)(ii + 'A') << i + 1 << endl;
}
}
}
return 0;
}
| 0
| 75,019,035
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.