code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
char before[70], after[70];
int n, m;
int search(char c) {
before[n] = c;
int i = 0;
while (before[i] != c) i++;
return i;
}
int main() {
char buf;
int ans;
while (1){
cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++) {
cin >> before[i] >> after[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> buf;
if ((ans = search(buf)) == n){
printf("%c", buf);
} else {
printf("%c", after[ans]);
}
}
printf("\n");
}
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long a;
double b;
cin>>a>>b;
b=b*(100+0.1);
a*=(int)b;
cout<<a/100<<endl;
return 0;
}
| 0
| 74,959,658
|
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int a , b , c , dif ;
cin >> a >> b >> c ;
dif = a - b ;
c -= dif ;
if (c < 0){
cout << 0 ;
}
else {
cout << c ;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long double func(long long n,long long x){
if(n == 1){return x;}
else{return func(n-1,x*n);}
}
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> a(n+1,vector<int>(0,0));
for(int i=0;i < m;i++){
int x, y;
cin >> x >> y;
a.at(x).push_back(y);
a.at(y).push_back(x);
}
vector<int> b(n-1);
for(int i=0;i <n-1;i++){
b.at(i) = i+2;
}
long double x = func(n-1,1);
long double sum = 0;
for(int i=0;i < x;i++){
next_permutation(b.begin(),b.end());
int check = 0;
for(int l=0;l < (int)a.at(1).size();l++){
if(a.at(1).at(l) == b.at(0)){check = 1;}
}
if(check == 1){
int buf = 1;
for(int j=1;j < n-1;j++){
int check_2 = 0;
for(int l=0;l < (int)a.at(b.at(j-1)).size();l++){
if(a.at(b.at(j-1)).at(l) == b.at(j)){check_2 = 1;}
}
if(check_2 == 1){buf++;}
}
if(buf == n-1){sum++;}
}
}
cout << sum << endl;
}
| 0
| 73,005,527
|
#include<iostream>
using namespace std;
int main() {
int i, n, node[252];
cin >> n;
for (i = 1; i <= n; i++) cin >> node[i];
for (i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << node[i];
if (i != 1)cout << ", parent key = " << node[i / 2];
if (2 * i <= n)cout << ", left key = " << node[2 * i];
if (2 * i + 1 <= n)cout << ", right key = " << node[2 * i + 1];
cout << ", \n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
bool good(string sleft, string sright, ll left, ll right) {
if((left - right) % 2) return sleft == sright;
else return sleft != sright;
}
int main(void) {
ll N;
ll l = 0, r;
string L, R;
cin >> N;
r = N - 1;
cout << l << endl;
cin >> L;
if(L == "Vacant") return 0;
cout << r << endl;
cin >> R;
if(R == "Vacant") return 0;
if(!good(L, R, l, r)) swap(L, R), l = r, r = N;
while(true) {
string temp;
ll mid = (l + r) / 2;
cout << mid << endl;
cin >> temp;
if(temp == "Vacant") break;
if(good(L, temp, l, mid)) R = temp, r = mid;
else L = temp, l = mid;
}
return 0;
}
| 0
| 41,353,063
|
#include <iostream>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
int main(){
int d;
while(cin >> d){
int ret = 0;
for (int i = 1; i * d < 600; ++i) ret += i*d * i*d * d;
cout << ret << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define str string
#define vs vector<str>
#define vb vector<bool>
#define slli set<lli>
#define mii map<int, int>
#define mlli map<int, lli>
#define msi map<str, int>
#define mp make_pair
#define pii pair<int, int>
#define pll pair<lli, lli>
#define vpii vector<pii >
#define vpll vector<pll >
#define pb push_back
#define loop(i, s, l, j) for(int i = s; i < l; i += j)
#define rloop(i, s, l, j) for(int i = s; i >= l; i -= j)
#define rep(i, n) loop(i,0,n,1)
#define rrep(i, n) rloop(i,n-1,0,1)
#define fastio() ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ft first
#define sd second
#define mit mii::iterator
#define vit vi::iterator
#define all(a) a.begin(),a.end()
#define min3(a, b, c) min(a, min(b, c))
#define mod 1000000007
#define inf 1000000000
#define limit 200001
int dx4[4] = {0, -1, 0, 1};
int dy4[4] = {1, 0, -1, 0};
int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int Power(int base,int exp){int ans=1; while(exp > 0){if(exp&1)ans=(1LL*ans*base)%mod; exp=exp>>1; base=(1LL*base*base)%mod;} return ans;}
void input()
{
int n;
cin >> n;
vlli div(n+1, 1);
loop(p,2,n+1,1)
{
if(div[p] != 1)
continue;
loop(j,p,n+1,p)
{
int x = j, e = 0;
while(x%p == 0)
e++, x=x/p;
div[j] = div[j] * (1 + e);
}
}
lli ans = 0;
rep(i,n+1)
ans += i * div[i];
cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio();
int q = 1;
while(q--)
input();
}
| 0
| 32,923,633
|
#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<utility>
using namespace std;
int main(){
pair<int,int> a[110];
pair<int,int> b[110];
int n,ans=0,i,j,min=(1<<29),k=-1;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d %d\n",&a[i].first,&a[i].second);
}
for(i=0;i<n;i++){
scanf("%d %d\n",&b[i].first,&b[i].second);
}
sort(a,a+n,greater<pair<int,int> >() );
sort(b,b+n);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[i].first<b[j].first && a[i].second<b[j].second && b[j].second<min){
min=b[j].second,k=j;
}
}
if(k!=-1){
ans++,b[k].first=0,b[k].second=0;
}
k=-1,min=(1<<29);
}
printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define N 100001
#define ll long long
using namespace std;
int main() {
vector<int> A;
A.push_back(1);
for(int i = 1; pow(6, i) <= 1000000; i++) {
A.push_back(pow(6, i));
}
for(int i = 1; pow(9, i) <= 1000000; i++) {
A.push_back(pow(9, i));
}
int n;
cin>>n;
sort(A.begin(),A.end());
ll dp[n+1];
dp[0]=0;
dp[1]=1;
for (ll i=2; i<=n; i++){
auto it = lower_bound(A.begin(), A.end(), i+1);
ll index = it - A.begin() - 1;
if (i>=A[index]){
dp[i]=min(dp[i-A[index]]+1,dp[i-1]+1);
dp[i]=min(dp[i],dp[i-A[index-1]]+1);
}
}
cout<<dp[n]<<endl;
}
| 0
| 73,345,215
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define foreps(i, m, n) for(int i = m;i < n;i++)
# define ALL(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void cookieClickerA(ll &A, ll &K) {
if (A == 0 || K == 0) return;
if (A < K || A == K) {
K -= A; A = 0;
return;
} else if (K < A) {
A -= K; K = 0;
return;
}
}
void cookieClickerB(ll &B, ll &K) {
if (B == 0 || K == 0) return;
if (B < K || B == K) {
K -= B; B = 0;
return;
} else if (K < B) {
B -= K; K = 0;
return;
}
}
int main() {
ll A, B, K; cin >> A >> B >> K;
cookieClickerA(A, K);
cookieClickerB(B, K);
cout << A << " " << B << endl;
}
|
#include <bits/stdc++.h>
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(x) sort(all(x), greater<int>())
#define REV(x) reverse(all(x))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define LOWitr(x, n) lower_bound(all(x), n)
#define UPRitr(x, n) upper_bound(all(x), n)
#define cii(x) int x;cin >> x
#define cill(x) LL x;cin >> x
#define cis(x) string x;cin >> x
#define co(x) cout << x << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define truecheck assert
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef long long int64;
template<class T,class U>bool chmax(T &a, const U &b) { if (a<b) { a=b; return true; } return false; }
template<class T,class U>bool chmin(T &a, const U &b) { if (b<a) { a=b; return true; } return false; }
const int INF = 1e9, MOD = 1e9 + 7;
const LL LLINF = 1e16;
int main() {
fastcin();
cout << fixed << setprecision(10);
cii(n);
cii(k);
auto ans = (n % k == 0)
?0
:1;
co(ans);
return 0;
}
| 0
| 75,675,361
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const int dx[4] = {1, 0,-1, 0};
const int dy[4] = {0, 1, 0,-1};
int main(){
int n, x, t;
cin >> n >> x >> t;
if(n % x == 0){
cout << (n / x) * t << endl;
}
else{
cout << (n / x + 1) * t << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define MOD (long long)(1e9+7)
using namespace std;
int n,y;
int main()
{
cin >> n >> y;
int ok=0;
if(y%1000)
{
cout << -1 << ' ' << -1 << ' ' << -1;
return 0;
}
else y/=1000;
for(int i=0; !ok&&i<=y/10; i++)
for(int j=0; j<=y/5; j++)
if((y-i*10-j*5)>=0 && (y-i*10-j*5)+i+j == n)
{
cout << i << ' ' << j << ' ' << (y-i*10-j*5);
ok=1;
break;
}
if(!ok) cout << -1 << ' ' << -1 << ' ' << -1;
return 0;
}
| 0
| 10,687,062
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int N, M;
void func()
{
cin>>N;
int A[N];
rep(i, 0, N) {
cin>>A[i];
}
sort(&A[0], &A[N]);
int old=0;
while (old!=A[0]) {
old=A[0];
rep(i, 1, N) {
int tmp=A[i]%A[0];
if (tmp) {
A[i]=tmp;
}
}
sort(&A[0], &A[N]);
}
cout<<A[0]<<endl;
}
int main()
{
func();
}
|
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#define rep(i, a, b) for ( int i = (a); i < (b); i++ )
#define per(i, a, b) for ( int i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
template<typename T>
struct Edge {
int u, v;
T cost;
Edge(int u, int v, T c) : u(u), v(v), cost(c) {}
bool operator< (const Edge &e) const {return cost < e.cost;}
};
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18+99);
static const int INF = 1e9+99;
int main(void) {
int N, M;
cin >> N >> M;
if (N%2==1) rep(i, 1, M+1) printf("%d %d\n", i, N-i+1);
else {
int x = (((N-2)/2+1)/2);
rep(i, 1, M+1) {
if (i<=x) printf("%d %d\n", i, N-i+1);
else printf("%d %d\n", i, N-i);
}
}
return 0;
}
| 0
| 58,459,325
|
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int N;
cin>>N;
vector<long long> A(1<<N);
long long B = 1000000;
for(int i=0;i<(1<<N);i++){
scanf("%lld",&A[i]);
A[i]*=B;
A[i]+=i;
}
vector<vector<pair<long long,long long>>> dp((1<<N),vector<pair<long long,long long>> (N+1));
for(int i=0;i<=N;i++){
for(int j=0;j<(1<<N);j++){
if(i==0){
dp[j][i] = make_pair(0,A[j]);
}
else{
vector<long long> V;
V.push_back(dp[j][i-1].first);
V.push_back(dp[j][i-1].second);
if((j>>(i-1))&1){
V.push_back(dp[j&(~(1<<(i-1)))][i-1].first);
V.push_back(dp[j&(~(1<<(i-1)))][i-1].second);
}
sort(V.rbegin(),V.rend());
V.erase(unique(V.begin(),V.end()),V.end());
dp[j][i].first = V[0];
dp[j][i].second = V[1];
}
}
}
vector<long long> ans(1<<N);
for(int i=0;i<(1<<N);i++){
ans[i] = dp[i][N].first/B + dp[i][N].second/B;
if(i!=0)ans[i] = max(ans[i],ans[i-1]);
}
for(int i=1;i<(1<<N);i++){
printf("%lld\n",ans[i]);
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
int gcd(int a,int b){
if(a%b==0){
return b;
}
else{
return gcd(b,a%b);
}
}
int main(){
char a,b;
int c,d;
cin>>a>>b;
string s="ABCDEF";
for(int i=0;i<6;i++){
if(s[i]==a){
c=i;
}
if(s[i]==b){
d=i;
}
}
if(c>d){
cout<<">"<<endl;
}
else if(c<d){
cout<<"<"<<endl;
}
else{
cout<<"="<<endl;
}
return 0;
}
| 0
| 1,539,400
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n, m;
cin >> n >> m;
vector<pair<ll, ll> > a, b;
for(int i=0; i<n; ++i){
int x, y;
cin >> x >> y;
a.push_back({x, y});
}
for(int i=0; i<m; ++i){
int x, y;
cin >> x >> y;
b.push_back({x, y});
}
for(ll i=0; i<n; ++i){
pair<ll, ll> ans = {INT_MAX, 0};
for(ll j=0; j<m; ++j){
ans = min(ans, {abs(a[i].first-b[j].first) + abs(a[i].second-b[j].second), j});
}
cout << ans.second+1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef map<int,int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI;
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REPR(i,n) FORR(i,0,n)
#define BREP(bit,N) for(int bit = 0; bit < (1<<N); ++bit)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/2;
const LL LINF = LLONG_MAX/2;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define COUT(x) cout << (x) << endl
#define COUT2(x,y) cout << (x) << " " << (y) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)
void cYes(){ COUT("Yes");exit(0); }
void cNo(){ COUT("No");exit(0); }
void cYES(){ COUT("YES");exit(0); }
void cNO(){ COUT("NO");exit(0); }
void cyes(){ COUT("yes");exit(0); }
void cno(){ COUT("no");exit(0); }
VI dx = {1,0,-1,0,1,1,-1,-1};
VI dy = {0,1,0,-1,1,-1,1,-1};
VC dc = {'R','D','L','U'};
VS ds = {"R","D","L","U","RD","RU","LD","LU"};
LL Gcd(LL a, LL b) {return __gcd(a,b);}
LL Lcm(LL a, LL b) {return a/Gcd(a,b)*b;}
LL ModPow(LL A, LL N, LL M){
LL res = 1;
while(N>0){
if(N&1) res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
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 % M;
inv[i] = M - inv[M%i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
void VCout(auto &v){
int N = SZ(v);
REP(i,N){
cout << v.at(i);
if(i == N-1) cout << endl;
else cout << " ";
}
return;
}
void Press(auto &v){v.erase(unique(ALL(v)),v.end());}
int Vcount(auto &v, auto x){
auto a = UB(ALL(v),x);
auto b = LB(ALL(v),x);
return a-b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N;
string s;
cin >> N >> s;
VVI a(4,VI(N+2,0));
REP(i,4){
if(i & 1){
a.at(i).at(0) = 1;
}
if(i>>1 & 1){
a.at(i).at(1) = 1;
}
}
REP(i,4){
REP(j,N){
if((s.at(j) == 'o') != (a.at(i).at(j+1) == 1)){
a.at(i).at(j+2) = a.at(i).at(j);
}else{
a.at(i).at(j+2) = a.at(i).at(j) ^ 1;
}
}
}
string ans;
int k=5;
REP(i,4){
if(a.at(i).at(0) == a.at(i).at(N) && a.at(i).at(1) == a.at(i).at(N+1)){
k = i;
break;
}
}
if(k == 5){
COUT(-1);
return 0;
}
REP(i,N){
if(a.at(k).at(i+1)==0){
ans += 'S';
}
else ans += 'W';
}
COUT(ans);
return 0;
}
| 0
| 65,968,275
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n, m; cin >> n >> m;
vector<pair<int, int>> res;
if (n % 2 == 1) {
for (int l = 1, r = n - 1; l < r; ++l, --r) {
res.push_back(make_pair(l, r));
}
} else {
bool over = false;
for (int l = 1, r = n - 1; l < r; ++l, --r) {
if (!over && r - l <= n / 2) {
++l;
over = true;
}
res.push_back(make_pair(l, r));
}
}
for (int i = 0; i < m; ++i) {
cout << res[i].first << ' ' << res[i].second << endl;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int dp[1010][1010];
char maze[1010][1010];
const int mod = 1e9+7;
int main(){
int h,w;
cin >> h >> w;
rep(i,h) rep(j,w) cin >> maze[i][j];
dp[0][0] = 1;
rep(i,h) rep(j,w){
if (maze[i][j] == '#') continue;
if (maze[i+1][j] == '.'){
dp[i+1][j] += dp[i][j];
dp[i+1][j]%=mod;
}
if (maze[i][j+1] == '.'){
dp[i][j+1] += dp[i][j];
dp[i][j+1]%=mod;
}
}
cout << dp[h-1][w-1] << endl;
return 0;
}
| 0
| 21,309,358
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
const int mod = 1000000007;
int n;
cin >> n;
string s;
cin >> s;
vector<ll> counter(26, 0);
rep(i, n) {
counter[s[i] - 'a']++;
}
ll ans = 1;
rep(i, 26) {
(ans *= counter[i] + 1) %= mod;
}
ans--;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef KACTL
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
#endif
#define all(x) begin(x), end(x)
using ll = int64_t;
using ld = long double;
using pii = pair<int32_t, int32_t>;
using vi = vector<int32_t>;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<string> res(h, string(w, '0'));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
res[i][j] ^= (i < b) ^ (j < a);
}
}
for (auto& row : res)
cout << row << '\n';
return 0;
}
| 0
| 19,487,890
|
#include <bits/stdc++.h>
using namespace std;
int n,x,a[150],d,sum,k,s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>d>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
sum=0;
sum+=(j*a[i]+1);
if(sum<=d)k++;
}}
s+=k;
s+=n;
s+=x;
cout<<s;
return 0;}
|
#include<iostream>
using namespace std;
static const int N=100;
int M[N+1][N+1];
int main(){
int n,u,k,v;
cin>>n;
for(int i=1;i<=n;i++){
cin>>u>>k;
for(int j=1;j<=k;j++){
cin>>v;
M[u][v]=1;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
cout<<(j>1?" ":"")<<M[i][j];
cout<<"\n";
}
return 0;
}
| 0
| 15,828,298
|
#include <iostream>
using namespace std;
int main() {
int a, b;
string op;
cin >> a >> op >> b;
if (op == "+") {
cout << a + b << endl;
}
else {
cout << a - b << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 101
bool find(vector<int> v, int j){
bool e = false;
for(vector<int>::iterator it = v.begin(); it!=v.end(); ++it){
if (*it == j) e = true;
}
return e;
}
int main(){
vector<int> adj[MAXN];
int n; cin >> n;
for(int i=1; i<=n; ++i){
int l, m; cin >> l >> m;
for(int j=0; j<m; ++j){
int k; cin >> k;
adj[l].push_back(k);
}
}
for(int i=1; i<=n; ++i){
for(int j=1; j<n; ++j){
cout << (find(adj[i], j) ? 1 : 0 ) << " ";
}
cout << (find(adj[i], n) ? 1:0) << endl;
}
}
| 0
| 45,395,280
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr = new type[n]
#define w(x) int x; cin>>x; while(x--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
bool isPrime(int n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6)
{
if (n % i == 0 || n % (i + 2) == 0)
return false;
}
return true;
}
vector<int> Sieve(int n)
{
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int i = 2; i * i <= n; i++)
{
if (prime[i])
{
for (int j = i * i; j <= n; j += i)
{
prime[j] = false;
}
}
}
vector<int> primes;
for (int i = 2; i <= n; i++)
{
if (prime[i])
primes.pb(i);
}
return primes;
}
map<int, int> primeFactors(int n)
{
mii factors;
while (n % 2 == 0)
{
n /= 2;
factors[2]++;
}
for (int i = 3; i <= sqrt(n); i += 2)
{
while (n % i == 0)
{
factors[i]++;
n /= i;
}
}
if (n > 2)
factors[n]++;
return factors;
}
int32_t main()
{
FIO;
int h, n, sum = 0;
cin >> h >> n;
int num;
for (int i = 0; i < n; i++)
{
cin >> num;
sum += num;
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, m;
cin >> num >> m;
vector<long long> vec(m);
vector<long long> vec2(m);
vector<vector<long long>> data(num);
for (int i = 0; i < m; i++) {
cin >> vec.at(i) >> vec2.at(i);
vec.at(i)--;
}
for (int i = 0; i < m; i++) { data.at(vec.at(i)).push_back(vec2.at(i)); }
for (int i = 0; i < num; i++) {
sort(data.at(i).begin(), data.at(i).end());
data.at(i).erase(unique(data.at(i).begin(), data.at(i).end()), data.at(i).end());
}
for (int i = 0; i < m; i++) {
int j = vec.at(i);
long long id = lower_bound(data.at(j).begin(), data.at(j).end(), vec2.at(i)) - data.at(j).begin();
cout << setfill('0') << right << setw(6) << vec.at(i)+1;
cout << setfill('0') << right << setw(6) << id+1 << endl;
}
}
| 0
| 19,776,132
|
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A){
long double acc = 0;
for(long long i = 0; i < N; i++){
acc += (1.0l/A[i]);
}
cout << (1.0/acc) << endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
|
#include <iostream>
#include <utility>
#include <vector>
#include<algorithm>
using namespace std;
int N, M;
bool cmp1(pair<int, int>a, pair<int, int>b)
{
return a.second < b.second;
}
int main() {
while (cin >> N >> M && N) {
int d, p;
int E = 0;
int P = 0;
vector< pair<int, int> >vec;
vec.clear();
for (int i = 0; i < N; ++i) {
cin >> d >> p;
E += d;
vec.push_back({ d , p });
}
E -= M;
sort(vec.begin(), vec.end(), cmp1);
for (int i = 0; E > 0 && i< vec.size(); i++) {
int d = vec[i].first;
int p = vec[i].second;
if (E > d) {
E -= d;
P += d * p;
}
else {
P += E * p;
E = 0;
}
}
cout << P << endl;
}
return 0;
}
| 0
| 56,100,575
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < 4; i++) {
m[s[i]]++;
}
bool isConsist = true;
for (auto it = m.begin(); it != m.end(); it++) {
if (it->second != 2) {
isConsist = false;
break;
}
}
if (isConsist) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int m, k;
cin >> m >> k;
if (k >= (1 << m))
{
cout << -1;
return 0;
}
if (m == 1)
{
if (k == 0) cout << "0 0 1 1 ";
else cout << -1;
return 0;
}
vector<int> all(1 << m);
iota(ALL(all), 0);
swap(all[k], all.back());
for(auto i: all) cout << i << ' ';
all.pop_back();
reverse(ALL(all));
for(auto i: all) cout << i << ' ';
cout << k << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| 0
| 36,803,646
|
#include<iostream>
#include<string>
using namespace std;
int main(){
for (;;){
string first;
cin >> first;
if (first == "-"){ break; }
int m;
cin >> m;
for (; m > 0; m--)
{
int h;
cin >> h;
string a = first.substr(0, h);
first.erase(first.begin(), first.begin()+h);
first += a;
}
cout << first<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = 1e9;
const ll INF = 1e18;
const ld EPS = 1e-10;
int main(){
int N, K;
cin >> N >> K;
ll H[N];
rep(i, N) cin >> H[i];
map<ll, int> mp;
mp[0]++;
rep(i, N) mp[H[i]]++;
int n = 0;
for(auto &e: mp){
e.second = n;
n++;
}
ll h[n];
h[0] = 0;
rep(i, N) h[mp[H[i]]] = H[i];
ll dp[N+1][K+1][n];
rep(i, N+1) rep(j, K+1) rep(k, n) dp[i][j][k] = INF;
dp[0][0][0] = 0;
rep(i, N){
rep(j, K+1){
rep(k, n){
if(dp[i][j][k] == INF) continue;
int l = mp[H[i]];
dp[i+1][j][l] = min(dp[i+1][j][l], dp[i][j][k]+max(0LL, h[l]-h[k]));
if(j == K) continue;
dp[i+1][j+1][k] = min(dp[i+1][j+1][k], dp[i][j][k]);
}
}
}
ll ans = INF;
rep(j, K+1) rep(k, n) ans = min(ans, dp[N][j][k]);
cout << ans << endl;
}
| 0
| 15,474,222
|
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define ff first
#define ss second
#define int long long
#define rep(i,x,m) for(int i=x;i<m;i++)
#define MOD 1000000007
#define endl "\n"
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define vi vector<int>
#define pi pair<int,int>
#define sz(x) (int)x.size()
#define pq priority_queue<int>
#define fix(y) fixed<<setprecision(y)
#define print(v) for(int i=0;i<v.size();i++) cout<<v[i]<<" ";cout<<endl
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int power(int n,int m)
{int p=1;if(m==0)return 1;p=(power(n,m/2)%MOD);p=(p%MOD*p%MOD)%MOD;
return(m&1?((p%MOD*n%MOD)%MOD):(p%MOD));}
void solve()
{
int n;
cin>>n;
int a[n+1],b[n];
rep(i,0, n+1)cin>>a[i];
rep(i,0,n)cin>>b[i];
int sum=0;
rep(i,0,n)
{
sum+=min(a[i],b[i]);
b[i]-=min(a[i],b[i]);
sum+=min(b[i],a[i+1]);
a[i+1]-=min(b[i],a[i+1]);
}
cout<<sum<<endl;
}
signed main()
{
FIO
int t=1;
while(t--)
solve();
cerr<<(float)clock()/CLOCKS_PER_SEC*1000<<" ms"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n), b(n);
REP(i, n) cin >> a[i] >> b[i];
REP_REV(i, n) {
a[i] += ans;
if(a[i] % b[i] == 0) continue;
else ans += b[i] - a[i] % b[i];
}
cout << ans << endl;
return 0;
}
| 0
| 88,717,145
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, a[100005];
int BS_low(int x)
{
int l = 1, r = n, mid, save = -1;
while (l <= r)
{
mid = (l + r) / 2;
if (a[mid] <= x)
{
l = mid + 1;
save = mid;
}
else r = mid - 1;
}
return a[save];
}
int BS_high(int x)
{
int l = 1, r = n, mid, save = -1;
while (l <= r)
{
mid = (l + r) / 2;
if (a[mid] >= x)
{
r = mid - 1;
save = mid;
}
else l = mid + 1;
}
return a[save];
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
int low = 0, high = 0, mid = (a[n] + 1) / 2;
low = BS_low(mid);
high = BS_high(mid);
if (mid - low <= high - mid) printf("%d %d", a[n], low); else printf("%d %d", a[n], high);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){fastio
string s;cin>>s;
ll maxi=0;
ll now=0;
rep(i,0,s.size()-1){
if(s[i]=='R'){
now++;
}else{
now=0;
}
maxi=max(maxi,now);
}
cout<<maxi<<endl;
return 0;
}
| 0
| 41,318,303
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
string a;
cin >> a;
sort(all(a));
if(a=="abc") cout << "Yes" <<endl;
else cout << "No" <<endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
long long po(long a, long b){
if(b==0){
return 1;
}
long long z = po(a,b/2);
z = mod(z*z);
if(b%2!=0){
z = mod(a*z);
}
return z;
}
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=std::sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
std::swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
int main(){
using namespace std;
int n, k;
cin>>n>>k;
int a[n];
REP(i, n) cin>>a[i];
int ans[n];
REP(i, n) ans[i] = a[i];
if(k >= 41){
REP(i, n) cout << n << ' ';
cout << endl;
return 0;
}
REP(_, k){
vector<int> temp(n, 0);
REP(i, n){
int l = max(0, i - ans[i]);
int r = min(n - 1, i + ans[i]);
temp[l]++;
if(r + 1 < n) temp[r + 1]--;
}
REPP(i, n - 1) temp[i] += temp[i - 1];
REP(i, n) ans[i] = temp[i];
}
REP(i, n) cout << ans[i] << ' ';
cout << endl;
return 0;
}
| 0
| 72,519,319
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> D ={ "dream", "dreamer", "erase", "eraser" };
int index = S.size();
bool ok = true;
int word_size = 0;
while (ok && index > 1) {
ok = false;
for (int i = 0; i <D.size(); i++) {
word_size = D.at(i).size();
if (index - word_size < 0) {
continue;
}
if (S.substr(index - word_size, word_size) == D.at(i)) {
ok = true;
index -= word_size;
break;
}
}
}
if (index == 0) {
cout << "YES" <<endl;
}
else {
cout << "NO" <<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define watch4(x,y,z,q) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<" and "<<(#q)<<" is "<<(q)<<"\n"
#define MOD 1000000007
#define INF 1000000007;
#define F first
#define S second
#define pb(x) push_back(x);
#define ll long long
#define all(c) (c).begin(),(c).end()
#define endl "\n"
typedef vector<int> vl;
typedef vector< vl > vvl;
typedef pair< int, int> pll;
typedef map< int, int> mll;
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void c_p_c()
{
#ifndef ONLINE_JUDGE
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void parray(int a[], int n) {
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
int no = 1, n1;
int recu(int n, int k, int val) {
if (n == n1) {
return min(val * 2, val + k);
}
return min( recu(n + 1, k, 2 * val), recu(n + 1, k, val + k) );
}
int digit(int n) {
int temp = 0;
while (n) {
n = n / 10;
temp++;
}
return temp;
}
bool check(int a[], int n) {
for (int i = 0; i < n; ++i)
{
if (a[i] % 2)
return false;
}
return true;
}
bool ispalin(int n) {
string str = to_string(n);
for (int i = 0; i < str.size() / 2; ++i)
{
if (str[i] != str[str.size() - i - 1]) {
return false;
}
}
return true;
}
bool is_palindrome(string s) {
int n = s.size();
for (int i = 0; i < n / 2; ++i)
{
if (s[i] != s[n - i - 1])
return false;
}
return true;
}
int check(string s,string t){
int sum=0;
for (int i = 0; i < s.size(); ++i)
{
if(s[i]==t[i])
sum++;
}
return sum;
}
int main() {
int i, n, m, k;
ll sum = 0;
c_p_c();
string s,t;
cin>>s>>t;
int maxa=0;
for (int i = 0; i < s.size()-t.size()+1; ++i)
{
string str= s.substr(i,t.size());
maxa=max(maxa,check(str,t));
}
cout<<t.size()-maxa<<endl;
return 0;
}
| 0
| 93,461,049
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
using namespace std;
class c_doubly
{
private:
public:
c_doubly();
void f_input();
};
c_doubly::c_doubly()
{
}
void c_doubly::f_input()
{
int n;
int n_key;
int i;
string s;
list<int>d_doubly;
cin >> n;
for (i = 0; i < n; ++i){
cin >> s;
if (s == "insert"){
cin >> n_key;
d_doubly.push_front(n_key);
}else if(s == "delete"){
cin >> n_key;
list<int>::iterator it = d_doubly.begin();
while( it != d_doubly.end() )
{
if( *it == n_key )
{
d_doubly.erase(it);
break;
}
++it;
}
}else if(s == "deleteFirst"){
d_doubly.pop_front();
}else if(s == "deleteLast"){
d_doubly.pop_back();
}
}
n = d_doubly.size();
list<int>::iterator it = d_doubly.begin();
for ( i = 0; i < n; ++i){
if (i == n-1){
cout << *it << endl;
}else{
cout << *it << " ";
}
++it;
}
}
int main(){
c_doubly doubly01;
doubly01.f_input();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n[4];
for (int i = 0; i < 4; i++){
n[i] = 0;
}
for (int i = 0; i < 3; i++){
int a, b;
cin >> a >> b;
n[a - 1] += 1;
n[b - 1] += 1;
}
bool A = true;
for (int i = 0; i < 4; i++){
if (n[i] >= 3){
A = false;
}
}
if (A == true){
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 0
| 84,504,531
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long ll;
using namespace std;
const int INF = 1<<29;
struct Edge
{
int to;
ll cost;
};
using Graph = vector<vector<Edge>>;
set<pair<int, int>> isUsed;
void dijkstra(const Graph &G, int s)
{
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
vector<ll> d((int)G.size(), INF);
vector<vector<int>> path((int)G.size());
q.push({0, s});
d[s] = 0;
while (!q.empty())
{
auto cur = q.top();q.pop();
ll cur_dist = cur.first;
int v = cur.second;
if (cur_dist > d[v]) continue;
for (auto e : G[v])
{
if (d[e.to] > d[v] + e.cost)
{
d[e.to] = d[v] + e.cost;
q.push({d[v] + e.cost, e.to});
path[e.to].clear();
path[e.to].pb(v);
}
else if (d[e.to] == d[v] + e.cost)
{
path[e.to].pb(v);
}
}
}
rep(v, (int)G.size())
{
for (auto u : path[v])
{
isUsed.insert(mp(min(u, v), max(u, v)));
}
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
Graph G(n);
rep(i, m)
{
int a, b;
ll c;
cin >> a >> b >> c;
a--, b--;
G[a].pb(Edge{b, c});
G[b].pb(Edge{a, c});
}
rep(i, n)
{
dijkstra(G, i);
}
cout << m - (int)isUsed.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
int m1 = 0, i1 = 0;
rep(i,n) {
cin >> a[i];
if (max(m1,a[i]) != m1) {
i1 = i;
m1 = a[i];
}
}
a[i1] = 0;
int m2 = 0;
rep(i,n) {
m2 = max(m2,a[i]);
}
rep(i,n) {
if (i == i1) cout << m2 << endl;
else cout << m1 << endl;
}
return 0;
}
| 0
| 49,746,030
|
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
int p[n];
for(int i=0;i<n;i++) cin >> p[i];
sort(p,p+n);
int dif,ma=10000000;
for(int i=0;i<n-1;i++){
dif=p[i+1]-p[i];
ma=min(dif,ma);
}
cout << ma <<endl;
}
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 1005
#define MOD 1000000007
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi 3.14159265358979323846
#define Q ll _; cin >> _; while(_--)
#define endl "\n"
#define flush fflush(stdout);
int main(){
fast
ll i,n;
cin >> n;
ll a[n+1];
for(i=1;i<=n;i++){
cin >> a[i];
}
ll dp[n+1];
dp[1] = 0;
dp[2] = abs(a[2]-a[1]);
for(i=3;i<=n;i++){
dp[i] = min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+abs(a[i]-a[i-2]));
}
cout << dp[n] << endl;
}
| 0
| 89,270,757
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
int to;
T cost;
edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
int R, S, P;
cin >> R >> S >> P;
string T;
cin >> T;
auto dp = make_vec(N + 1, 3, 0LL);
for(int i = 0; i < N; i++) {
for(int j = 0; j < 3; j++) {
for(int k = 0; k < 3; k++) {
if(i - K >= 0 && k == j)
continue;
int point = 0;
if(k == 0) {
if(T[i] == 's')
point = R;
} else if(k == 1) {
if(T[i] == 'r')
point = P;
} else if(k == 2) {
if(T[i] == 'p')
point = S;
}
dp[i][k] =
max(dp[i][k], (i - K >= 0 ? dp[i - K][j] : 0) + point);
}
}
}
ll res = 0;
for(int i = N - 1; i >= N - K; i--) {
ll tmp = 0;
for(int j = 0; j < 3; j++) {
tmp = max(tmp, dp[i][j]);
}
res += tmp;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
long long inf = pow(10, 9);
int n, a[81];
long long dp[81];
int main(){
cin >> n;
rep(i, n) cin >> a[i];
dp[0] = 1000;
rep(i, n){
rep(j, i){
dp[i] = max(dp[i], dp[j]);
dp[i] = max(dp[i], (dp[j] / a[j]) * a[i] + dp[j] % a[j]);
}
}
cout << dp[n - 1] << endl;
}
| 0
| 92,352,105
|
#include <bits/stdc++.h>
using namespace std;
int h, w;
long long ans[10] = {};
map<int, map<int, bool> > mp;
int nineSearch(int x, int y){
int ans = 0;
for(int p = -1;p < 2;p++){
for(int q = -1;q < 2;q++){
if(x+p < 0 || x+p >= w || y+q < 0 || y+q >= h) return 10;
if(mp[x+p][y+q]) ans++;
}
}
return ans;
}
int main(){
int n;
cin >> h >> w >> n;
ans[0] = (long long)(h-2) * (long long)(w-2);
int x, y;
for(int i = 0;i < n;i++){
cin >> y >> x;
y--; x--;
for(int p = -1;p < 2;p++){
for(int q = -1;q < 2;q++){
int tmp = nineSearch(x+p,y+q);
if(tmp < 9){
ans[tmp]--;
ans[tmp+1]++;
}
}
}
mp[x][y] = true;
}
for(int i = 0;i < 10;i++){
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
bool f1 = false;
bool f2 = false;
bool f3 = false;
for (auto iter = begin(s); iter != end(s); iter++) {
if (!f1) {
if (*iter - '0' == i) {
f1 = true;
}
continue;
}
if (!f2) {
if (*iter - '0' == j) {
f2 = true;
}
continue;
}
if (!f3) {
if (*iter - '0' == k) {
f3 = true;
}
}
}
if (f1 && f2 && f3) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 49,812,366
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string A, B;
cin >> A >> B;
if (A < B){
cout << "<" << endl;
}
else if (A > B)
{
cout << ">" << endl;
}
else
{
cout << "=" << endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#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;
int main() {
ll n, k;
cin >> n >> k;
vl a(n);
vl rui(n+1);
rep(i, n) {
cin >> a[i];
a[i]--;
rui[i+1] = (rui[i] + a[i])%k;
}
map<ll, ll> mp;
queue<ll> Q;
ll ans = 0;
rep(i, n+1) {
Q.push(rui[i]);
if(Q.size() > k) {
mp[Q.front()]--;
Q.pop();
}
mp[rui[i]]++;
ans += mp[rui[i]] - 1;
}
out(ans);
re0;
}
| 0
| 77,577,448
|
#include <iostream>
#include <vector>
using namespace std;
void transform(vector<vector<int>>& graph, vector<vector<int>>& tree, int parent, int current) {
for (int child : graph[current]) {
if (child != parent) {
tree[current].push_back(child);
transform(graph, tree, current, child);
}
}
}
void add(vector<vector<int>>& tree, vector<int>& counter, int parent_sum, int current) {
counter[current] += parent_sum;
for (int child : tree[current]) {
add(tree, counter, counter[current], child);
}
}
int main() {
int N, Q; cin >> N >> Q;
vector<vector<int>> graph(N);
for (int i = 0; i < N - 1; i++) {
int a, b; cin >> a >> b;
graph[a - 1].push_back(b - 1);
graph[b - 1].push_back(a - 1);
}
int p[Q];
int x[Q];
for (int j = 0; j < Q; j++) {
cin >> p[j] >> x[j];
p[j]--;
}
vector<vector<int>> tree(N);
transform(graph, tree, -1, 0);
vector<int> counter;
counter.assign(N, 0);
for (int i = 0; i < Q; i++) {
counter[p[i]] += x[i];
}
add(tree, counter, 0, 0);
for (int i = 0; i < N; i++) {
cout << counter[i];
if (i < N - 1) cout << " ";
}
cout << endl;
}
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int A, B, C;
cin >> A >> B >> C;
bool isYes = false;
rep(i, 1000) {
rep(j, 1000) {
if ((A * i) - (B * j) == C)
isYes = true;
}
}
string ans = isYes ? "YES" : "NO";
cout << ans << endl;
return 0;
}
| 0
| 26,162,763
|
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> void write(T a)
{
if(a<0)
{
a=-a;
putchar('-');
}
if(a>9)
{
write(a/10);
}
putchar(a%10+'0');
}
template <typename T> void writeln(T a)
{
write(a);
puts("");
}
}
long long n,k,ans,t;
int main()
{
cin>>n>>k;
ans=n/k;
ans=ans*ans*ans;
if(!(k&1))
{
t=(n+k/2)/k;
t=t*t*t;
}
cout<<ans+t;
}
|
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(i,x,y) for(int i = (x) ; i <= (y) ; i++)
#define repD(i,x,y) for(int i = (x) ; i >= (y) ; i--)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define setval(a,val) memset(a,val,sizeof(a))
#define Randomize mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define trav(x , a) for(auto &x : a)
#define sz(a) ((int)a.size())
typedef long long ll ;
#define int ll
using namespace std;
const int N = 3e5 + 5 ;
const int mod = 1e9 + 7 ;
const ll inf = 1e18 ;
const int SZ = 101 ;
const long double eps = 1e-9 ;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ;
typedef pair<int, int> pii;
typedef pair<int , pii> ipii ;
typedef pair<pii , int> piii ;
typedef unsigned long long ull ;
typedef long double ld;
ll po(ll x,ll y,ll p = mod) {ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
void solve()
{
int n ;
cin >> n ;
int a[n] , su = 0 , cur = 0 , ans = inf ;
rep(i , n) cin >> a[i] , su += a[i] ;
rep(i , n){
if(i + 1 < n) cur += a[i];
ans = min(ans , abs(su - 2 * cur));
}
cout << ans ;
}
int32_t main(int32_t argc, char *argv[])
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int TC = 1, t = 0;
while(t++ < TC)
{
solve();
cout << "\n" ;
}
return 0;
}
| 0
| 82,493,833
|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main() {
double x1, y1, x2, y2, dist;
cin >> x1 >> y1 >> x2 >> y2;
printf("%lf\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
using namespace std;
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
bool abc[26];
rep(i, 0, 26) abc[i] = 0;
string s; cin >> s;
rep(i, 0, s.size()){
abc[s[i]-'a'] = true;
}
if(s.size() < 26){
rep(i, 0, 26){
if(abc[i]) continue;
else{
cout << s << char('a'+i) << endl;
return 0;
}
}
}
if(s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
string t = s;
next_permutation(ALL(s));
rep(i, 0, 26){
if(s[i]==t[i]) cout << s[i];
else{
cout << s[i] << endl;
return 0;
}
}
return 0;
}
| 0
| 60,682,533
|
#include <cstdio>
#include <algorithm>
#include <string>
#include <iostream>
#define inf 1001001001
using namespace std;
int n, c;
size_t s, t, dp[1001][1001];
string a, b;
int main() {
cin >> a >> b;
s = a.length(), t = b.length();
for (size_t i = 1; i <= s; ++i) dp[i][0] = i;
for (size_t i = 1; i <= t; ++i) dp[0][i] = i;
for (size_t i = 0; i < s; ++i) {
for (size_t j = 0; j < t; ++j) {
if (a[i]==b[j]) c = 0; else c = 1;
dp[i+1][j+1] = min(dp[i][j+1]+1, dp[i+1][j]+1);
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j]+c);
}
}
printf("%ld\n", dp[s][t]);
}
|
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const int INF=1000000001;
const double PI=3.141592653589;
const ll LMAX=1000000000000001;
ll gcd(ll a,ll b){if(a<b)swap(a,b);while((a%b)!=0){a=b;b=a%b;}return b;}
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
int main(){
int h,w; cin>>h>>w;
ll ans=LMAX;
ll S=(ll)h*(ll)w;
for(int i=1;i<w;i++){
ll s1=(ll)i*(ll)h;
ll s2=(ll)(w-i)*(ll)(h/2);
ll s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
s2=(ll)(w-i)/2*(ll)h;
s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
}
for(int i=1;i<h;i++){
ll s1=(ll)i*(ll)w;
ll s2=(ll)(h-i)*(ll)(w/2);
ll s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
s2=(ll)(h-i)/2*(ll)w;
s3=S-s1-s2;
ans=min(max({s1,s2,s3})-min({s1,s2,s3}),ans);
}
cout<<ans<<endl;
return 0;
}
| 0
| 5,222,139
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int s;
cin >> s;
set<int> st;
int x = s;
while(st.count(x) == 0) {
st.insert(x);
if(x % 2 == 0) {
x /= 2;
}
else {
x = 3 * x + 1;
}
}
cout << st.size() + 1 << endl;
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;
int main(){
int n,k;
cin >> n >> k;
vector<int> l(n);
rep(i,n){
cin >> l[i];
}
sort(l.begin(),l.end(),greater<int>());
int sum = 0;
rep(i,k){
sum+=l[i];
}
cout << sum << endl;
return 0;
}
| 0
| 69,954,896
|
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define ALL(vec) vec.begin(),vec.end()
#define PRINT(vec) printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");
#define SCAN(vec) for(auto &i:vec)scanf("%ld",&i)
#define fi first
#define se second
const int MOD = 1e9+7;
const ll INF = 1e18;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
int n;
scanf("%d", &n);
char s[n+1];
scanf("%s", s);
ll alp[26] = {};
REP(i, 0, n) alp[s[i]-'a']++;
ll ans = 1;
REP(i, 0, 26){
ans *= alp[i] + 1;
ans %= MOD;
}
printf("%ld\n", ans-1);
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
int main(){
string A, B;
cin >> A >> B;
ll ans = 0;
if(A.size() > B.size()){
ans = -1;
}else if(A.size() < B.size()){
ans = 1;
}else{
rep(i, A.size()){
if(A[i] > B[i]){
ans = -1;
break;
}else if(A[i] < B[i]){
ans = 1;
break;
}
}
}
if(ans == -1){
cout << "GREATER" << endl;
}else if(ans == 0){
cout << "EQUAL" << endl;
}else{
cout << "LESS" << endl;
}
return 0;
}
| 0
| 18,983,448
|
#include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << 8 - (n - 400) / 200 << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;
const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};
LL fac[SIZE], finv[SIZE], inv[SIZE];
void combInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for( int i = 2; i < SIZE; ++i ) {
fac[i] = (fac[i - 1] * i) % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = (finv[i - 1] * inv[i]) % MOD;
}
}
LL comb(int n, int k) {
if( n < k ) return 0;
if( n < 0 || k < 0 ) return 0;
return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;
}
vector< int > Div( int n ) {
vector< int > ret;
for( int i = 1; i * i <= n; ++i ) {
if( n % i == 0 ) {
ret.pb( i );
if( i * i != n ) ret.pb( n / i );
}
}
sort( all( ret ) );
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector< P > v;
for( int i = 0; i < n; ++i ) {
int t, d;
cin >> t >> d;
v.pb(MP(d, t));
}
sort(all(v), greater< P >());
map< int, int > mp;
priority_queue< P > pq;
vector< P > vv;
priority_queue< P, vector< P >, greater< P > > sel;
LL fin = 0;
LL res = 0;
for( int i = 0; i < n; ++i ) {
if( mp[v[i].S] != 0 || sel.size() == k ) {
pq.push(v[i]);
} else {
++fin;
res += v[i].F;
sel.push(v[i]);
mp[v[i].S]++;
}
}
if( sel.size() < k ) {
while( !pq.empty() && sel.size() < k ) {
P p = pq.top(); pq.pop();
sel.push(p);
mp[p.S]++;
res += p.F;
}
while( !pq.empty() ) {
P p = pq.top(); pq.pop();
P sel_min = sel.top(); sel.pop();
if( mp[sel_min.S] > 1 ) break;
LL tmp = res - sel_min.F;
tmp += p.F;
if( res + fin * fin < (fin - 1) * (fin - 1) + tmp ) {
--fin;
res = tmp;
mp[p.S]++;
mp[sel_min.S]--;
sel.push(p);
} else {
break;
}
}
} else {
while( !pq.empty() ) {
P p = pq.top(); pq.pop();
P sel_min = sel.top(); sel.pop();
if( mp[p.S] == 0 ) {
sel.push(sel_min);
continue;
}
LL tmp = res - sel_min.F;
tmp += p.F;
if( mp[sel_min.S] == 1 ) {
if( res + fin * fin < (fin - 1) * (fin - 1) + tmp ) {
mp[sel_min.S]--;
mp[p.S]++;
res = tmp;
--fin;
sel.push(p);
} else {
sel.push(sel_min);
}
} else {
sel.push(sel_min);
}
}
}
cout << fin * fin + res << endl;
return 0;
}
| 0
| 59,329,208
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
using ll = long long;
ll solve(ll h,ll w) {
ll b1,b2,b3,res=1001001001;
ll sum=h*w;
for (int i=1; i<h; i++) {
b1 = i*w;
b2 = (h-i)*(w/2);
b3 = sum-b2-b1;
if (b2>0 && b3>0) res = min(res, max(b1,max(b2,b3)) - min(b1,min(b2,b3)));
b2 = ((h-i)/2)*w;
b3 = sum-b2-b1;
if (b2>0 && b3>0) res = min(res, max(b1,max(b2,b3)) - min(b1,min(b2,b3)));
}
return res;
}
int main() {
ll h,w; cin >> h >> w;
ll ans = min(solve(h,w),solve(w,h));
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int dp[maxn][21] , a[maxn] , n , L;
void solve ()
{
for (int i = 1 ; i <= n ; i++) {
int l = 1 , r = n , mid;
while (l <= r){
mid = l + r >> 1;
if (a[mid] <= a[i] + L) l = mid + 1;
else r = mid - 1;
}
dp[i][0] = r;
}
for (int i = 1 ; i <= 20 ; i++)
for (int j = 1 ; j <= n; j++)
dp[j][i] = dp[dp[j][i - 1]][i - 1];
}
int ask (int x , int y)
{
if (x == y) return 0;
int ans = 0;
for (int i = 20 ; i >= 0 ; i--)
if (dp[x][i] < y) x = dp[x][i] , ans += (1 << i);
ans++;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1 ; i <= n ; i++) cin >> a[i];
cin >> L;
solve ();
int q;cin >> q;
while (q--){
int x , y; cin >> x >> y;
if (x > y) swap(x , y);
cout << ask(x , y) << endl;
}
return 0;
}
| 0
| 72,950,350
|
#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){
string s;
cin>>s;
for(int i = s.size() - 1 ; i >= 0 ; i --)
cout<<s[i];
cout<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
bool search();
int ans[100009];
int n;
string s;
int main(){
cin>>n>>s;
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
memset(ans,0,sizeof(ans));
ans[0]=i;
ans[1]=j;
if(search()){
for(int k=0;k<n;k++){
if(ans[k]==0){
cout<<'S';
}
else{
cout<<'W';
}
}
cout<<endl;
return(0);
}
}
}
cout<<-1<<endl;
return(0);
}
bool search(){
for(int i=2;i<n;i++){
if(ans[i-1]==0){
if(s[i-1]=='o'){
ans[i]=ans[i-2];
}
else{
ans[i]=!ans[i-2];
}
}
else{
if(s[i-1]=='o'){
ans[i]=!ans[i-2];
}
else{
ans[i]=ans[i-2];
}
}
}
int cnt=0;
if(ans[0]==0){
if(s[0]=='o'&&ans[n-1]==ans[1])cnt++;
else if(s[0]=='x'&&ans[n-1]!=ans[1])cnt++;
}
else{
if(s[0]=='o'&&ans[n-1]!=ans[1])cnt++;
else if(s[0]=='x'&&ans[n-1]==ans[1])cnt++;
}
if(ans[n-1]==0){
if(s[n-1]=='o'&&ans[n-2]==ans[0])cnt++;
else if(s[n-1]=='x'&&ans[n-2]!=ans[0])cnt++;
}
else{
if(s[n-1]=='o'&&ans[n-2]!=ans[0])cnt++;
else if(s[n-1]=='x'&&ans[n-2]==ans[0])cnt++;
}
if(cnt==2)return true;
else return false;
}
| 0
| 45,894,346
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int ,int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int main()
{
_FastIO;
string s;
string t;
cin >> s;
cin >> t;
int n = t.size();
while(n){
if(t == s){
cout << "Yes" << endl;
return 0;
}
t += t[0];
t.erase(t.begin());
n--;
}
if(t == s){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
int n;
cin >> n;
int m;
cin >> m;
vector<int> A(m);
vector<int> B(m);
vector<int> C(m);
const long long INF = 1LL << 50;
vector<vector<long long>> dis(n, vector<long long>(n, INF));
for (int i = 0; i < m; ++i) {
cin >> A[i] >> B[i] >> C[i];
--A[i], --B[i];
dis[A[i]][B[i]] = C[i];
dis[B[i]][A[i]] = C[i];
}
for (int i = 0; i < n; ++i) {
dis[i][i] = 0;
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
int res = 0;
for (int i = 0; i < m; ++i) {
int u = A[i], v = B[i];
bool ok = false;
ok = dis[u][v] == C[i];
if (!ok) {
++res;
}
}
cout << res << '\n';
return 0;
}
| 0
| 30,500,973
|
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
int main()
{
int b=0,f=0,k=0,l;
string a;
char n='0',s='1',z;
cin>>a;
l=a.size();
while (l>b)
{
if (a[b]==n)
f++;
else
k++;
b++;
z=s;
s=n;
n=z;
}
if (f<=k)
cout<<f;
else
cout<<k;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int a[4];
int main(){
for(int i = 0; 6 > i; i++){
int tmp;cin>>tmp;tmp--;
a[tmp]++;
}
vector<int> z;
for(int i = 0; 4 > i; i++){
z.push_back(a[i]);
}
sort(z.begin(),z.end());
for(int i = 0; 4 > i; i++){
if(i < 2){
if(z[i] != 1){
cout << "NO" << endl;
return 0;
}
}else{
if(z[i] != 2){
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
}
| 0
| 20,962,194
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >> s;
if(s[0]!='A'){
cout << "WA" <<endl;
return 0;
}
int cnt = 0;
for(int i = 2;i<s.size()-1;++i){
if(s[i]=='C')
cnt++;
}
if(cnt !=1) {
cout << "WA" <<endl;
return 0;
}
int mini = 0;
for(int i = 1;i<s.size();++i){
for(char x = 'a';x<='z' ;++x){
if(s[i]==x) mini++;
}
}
if(mini!=s.size()-2) {
cout << "WA" <<endl;
return 0;
}
cout << "AC" <<endl;
}
|
#include <stdio.h>
#include <string.h>
int main() {
int a,b;
char s[15];
int counter = 0;
scanf ("%d %d", &a, &b);
scanf ("%s", &s);
for (int i=0; s[i] != '\0'; i++){
if (s[a] != '-') {
printf ("No\n");
return 0;
}
if (s[i] >= '0' && s[i] <= '9'){
counter++;
}
}
if (counter == a+b) {
printf ("Yes\n");
}
else{
printf ("No\n");
}
return 0;
}
| 0
| 41,648,324
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<assert.h>
#include<random>
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 10000
#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 N , K;
cin>>N>>K;
int res = K;
for (int i = 0; i < N - 1; i++)
{
res *= K -1;
}
cout<<res<<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;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
vector<int> x(n + 1), dp(n + 1, 1e9), tmp(1 << 26, 1e9);
rep(i, 0, n) {
x[i + 1] = x[i] ^ (1 << (s[i] - 'a'));
}
tmp[0] = 0;
rep(i, 0, n) {
dp[i + 1] = tmp[x[i + 1]] + 1;
rep(j, 0, 26) {
dp[i + 1] = min(dp[i + 1], tmp[x[i + 1] ^ (1 << j)] + 1);
}
tmp[x[i + 1]] = min(tmp[x[i + 1]], dp[i + 1]);
}
cout << dp[n] << endl;
return 0;
}
| 0
| 49,333,212
|
#include <bits/stdc++.h>
using namespace std;
#define IOS std::cin.tie(0);std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
#define vvp vector<vector<pair<int,int>>>
using Graph = vector<vector<int>>;
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define output_s(s) printf("%s\n",(s).c_str())
#define END cout<<"\n"
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define RepS(i,n,m) for(int i=(int)(n);i<=(int)(m);i++)
#define RRepS(i,n,m) for(int i=(int)(n);i>=(int)(m);i--)
#define SRepS(i,n,m) for(int i=(int)(n);i*i<=(int)(m);i++)
#define RepA(x) for(auto &item:(x))
void CINT(){}
template<class Head,class... Tail> void CINT(Head&& head,Tail&&... tail){cin>>head; CINT(move(tail)...);}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
#define VCIN(x) for(auto &item:x) cin>>item
void OUT(){}
template<class Head,class...Tail> void OUT(Head&& head,Tail&&...tail){cout<<head<<(sizeof...(tail)?" ":"\n"); OUT(move(tail)...);}
#define COUT(...) OUT(__VA_ARGS__)
template<typename TypeInt>TypeInt GCD(TypeInt a,TypeInt b){return a%b==0?b:GCD(b,a%b);}
template<typename TypeInt>TypeInt LCM(TypeInt a,TypeInt b){return a*b/GCD(a,b);}
template<class T>inline bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
template<class T>bool comp(T a,T b){return abs(a)<abs(b);}
void YES(bool f){printf(f?"YES\n":"NO\n");}
void Yes(bool f){printf(f?"Yes\n":"No\n");}
void Possible(bool f){printf(f?"Possible\n":"Impossible\n");}
void POSSIBLE(bool f){printf(f?"POSSIBLE\n":"IMPOSSIBLE\n");}
void PrimeFactorize(long long num,vector<long long> &ret){
vector<long long> prime(num+1,0);
vector<long long>::iterator it;
while(num%2==0){
num /= 2;
prime[2]++;
}
for(int i=3;i<=num;i++){
while(num%i==0){
num /= i;
prime[i]++;
}
}
copy(prime.begin(),prime.end(),back_inserter(ret));
}
bool IsPrime(int x){
if(x<2) return false;
else if(x==2) return true;
else if(x%2==0) return false;
for(int i=3;i*i<=x;i+=2){
if(x%i==0)return false;
}
return true;
}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const int NMAX = 55;
const int INF = 1e9;
const long long LINF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9+7;
bool flag = false;
signed main(){
SCIN(s);
int n=s.size();
vi a(n+1,0);
rep(i,n){
if(s[i]=='<')chmax(a[i+1],a[i]+1);
}
RRepS(i,n-1,0){
if(s[i]=='>')chmax(a[i],a[i+1]+1);
}
ll ans=0;
rep(i,n+1)ans+=a[i];
COUT(ans);
return 0;
}
|
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define ss s.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define pii pair<int,int>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mpp make_pair
#define Okay 0
static ll int inf = 1e18;
using namespace std;
void solve(){
int n;
cin>>n;
ll int ar[n+5];
for(int i = 0; i<n; i++){
cin>>ar[i];
}
ll int ans = 1000;
for(int i=1; i<n; i++){
if(ar[i-1] < ar[i]){
ans = (ans/ar[i-1])*ar[i] + (ans%ar[i-1]);
}
}
cout<<ans<<endl;
}
int main(){
Fast;
solve();
return Okay ;
}
| 0
| 6,434,530
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int n;
scanf("%d", &n);
vector<string> w(n);
rep(i, n) cin >> w[i];
bool ans = true;
rep(i, n - 1)
{
int l = w[i].size();
if (w[i][l - 1] != w[i + 1][0])
{
ans = false;
break;
}
}
sort(w.begin(), w.end());
rep(i, n) {
for(int j = i + 1; j < n; j++) {
if(w[i] == w[j]) ans = false;
break;
}
}
if (ans)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#define ALL(x) (x).begin(), (x).end()
#define rt return
#define dll(x) scanf("%I64d",&x)
#define xll(x) printf("%I64d\n",x)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define gg(x) getInt(&x)
#define db(x) cout<<"== [ "<<x<<" ] =="<<endl;
using namespace std;
typedef long long ll;
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 powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
inline void getInt(int* p);
const int maxn=1000010;
const int inf=0x3f3f3f3f;
ll a[maxn];
ll sum[maxn];
int n;
ll ans=1e18;
int main()
{
gbtb;
cin>>n;
repd(i,1,n)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
repd(i,1,n-1)
{
ans=min(ans,abs(sum[i]-(sum[n]-sum[i])));
}
cout<<ans<<endl;
return 0;
}
inline void getInt(int* p) {
char ch;
do {
ch = getchar();
} while (ch == ' ' || ch == '\n');
if (ch == '-') {
*p = -(getchar() - '0');
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 - ch + '0';
}
}
else {
*p = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 + ch - '0';
}
}
}
| 0
| 31,728,806
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<tuple<double, ll, ll>> en;
for (int i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
if (x == 0 && y == 0) continue;
else en.emplace_back(atan2(y, x), x, y);
}
if (en.empty()) {
cout << 0 << endl;
return 0;
}
sort(en.begin(), en.end());
N = (int)en.size();
vector<ll> xsum(N+1, 0), ysum(N+1, 0);
for (int i = 0; i < N; i++) {
xsum[i+1] = xsum[i] + get<1>(en[i]);
ysum[i+1] = ysum[i] + get<2>(en[i]);
}
double ans = 0;
for (int i = 0; i <= N; i++) {
for (int j = i+1; j <= N; j++) {
double s, t, u, v;
s = (xsum[j]-xsum[i]);
t = (ysum[j]-ysum[i]);
u = xsum[N]-s;
v = ysum[N]-t;
double cand = max(sqrt(s*s+t*t), sqrt(u*u+v*v));
ans = max(ans, cand);
}
}
printf("%.20lf\n", ans);
return 0;
}
|
#pragma region template
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
constexpr bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T>
constexpr bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
cout << a;
return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
void Pr(bool f){
cout << (f ? "Yes" : "No") << "\n";
exit(0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n, q;
cin >> n >> q;
dsu uf(n);
while(q--){
int t, u, v;
cin >> t >> u >> v;
if(t == 0){
uf.merge(u, v);
}else{
print(uf.same(u, v));
}
}
}
| 0
| 4,759,023
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll n;
cin >>n;
vector<ll> PF(101);
rep2(i,n){
ll N=i;
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;
}
PF[a]+=ex;
}
if (N != 1) PF[N]++;;
}
vector<ll> CNT(5);
rep(i,101){
if(PF[i]>=74){
CNT[4]++;
}
if(PF[i]>=24){
CNT[3]++;
}
if(PF[i]>=14){
CNT[2]++;
}
if(PF[i]>=4){
CNT[1]++;
}
if(PF[i]>=2){
CNT[0]++;
}
}
ll ans = 0;
ans += CNT[4] + CNT[3]*(CNT[0]-1) + CNT[2]*(CNT[1]-1);
ans += CNT[1]*(CNT[1]-1)*(CNT[0]-2)/2;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define reps(i,s,n) for(int i=s, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
const char sp = ' ';
using namespace std;
int main(void){
ll N, left=1,right;
ll status[100000];
cin>>N;
right=N+1;
MEMSET(status, 0);
cout<<0<<endl<<flush;
string s;
cin>>s;
if(s=="Vacant") return 0;
if(s=="Male") status[1]=1;
else status[1]=2;
status[N+1]=status[1];
while(true){
ll next=(right-left)/2;
if(right-left<=1){
cout<<right-1<<endl<<flush;
cin>>s;
if(s=="Vacant") return 0;
cout<<left-1<<endl<<flush;
cin>>s;
if(s=="Vacant") return 0;
}
cout<<left+next-1<<endl<<flush;
cin>>s;
if(s=="Vacant") return 0;
if(s=="Male") status[left+next]=1;
else status[left+next]=2;
if(next%2==0){
if(status[left+next]==status[left])
left+=next;
else right=left+next;
}
else{
if(status[left+next]==status[left])
right=left+next;
else left+=next;
}
}
return 0;
}
| 0
| 26,503,556
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int s,w;
cin>>w>>s;
if(s < w)
{
cout<<"safe";
}
else
{
cout<<"unsafe";
}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> niz(n);
int max = INT_MIN, max_idx = -1;
int max2 = INT_MIN, max2_idx = -1;
for (int i = 0; i < n; i++)
{
cin >> niz[i];
if (niz[i] > max)
{
max = niz[i];
max_idx = i;
}
}
for (int i = 0; i < n; i++)
{
if (niz[i] > max2 && i != max_idx)
{
max2 = niz[i];
max2_idx = i;
}
}
for (int i = 0; i < n; i++)
{
if (i != max_idx)
cout << niz[max_idx] << endl;
else cout << niz[max2_idx] << endl;
}
}
| 0
| 2,399,747
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;
const double PI = acos(-1);
int main() {
string a, b, c; cin >> a >> b >> c;
char s1 = toupper(a.front());
char s2 = toupper(b.front());
char s3 = toupper(c.front());
cout << s1 << s2 << s3 << endl;
return 0;
}
|
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long LL;
const int N = 1e5+100, M = 2*N,mod = 1e9+7;
LL dp[N][2];
int n;
int h[N],e[M],ne[M],idx;
void add(int a,int b){
e[idx] = b, ne[idx] = h[a],h[a] = idx++;
}
void dfs(int u,int fa = 0){
dp[u][0] = dp[u][1] = 1;
for(int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if(fa == j) continue;
dfs(j,u);
dp[u][0] = (dp[u][0] * dp[j][1])%mod;
dp[u][1] = (dp[u][1] * (dp[j][0] + dp[j][1]))%mod;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
memset(h,-1,sizeof h);
for(int i = 0; i<n-1; i++){
int a,b;
cin>>a>>b;
add(a,b);
add(b,a);
}
dfs(1);
LL ans = (dp[1][0] + dp[1][1])%mod;
cout<<ans;
return 0;
}
| 0
| 35,418,140
|
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<vector>
using namespace std;
vector<int>p[100010];
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int main()
{
int n=read(),k=ceil(sqrt(2*n));
if(k*(k-1)!=2*n)printf("No\n");
else
{
printf("Yes\n");
printf("%d\n",k);
int now=0;
for(int i=1;i<k;i++)
{
for(int j=i+1;j<=k;j++){now++;p[i].push_back(now),p[j].push_back(now);}
}
for(int i=1;i<=k;i++)
{
printf("%d ",k-1);
for(int j=0;j<k-1;j++)printf("%d ",p[i][j]);
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> v(N);
vector<vector<int64_t>> a(1e+5+1,vector<int64_t>(2,0)),b(1e+5+1,vector<int64_t>(2,0));
for ( int64_t i = 0; i < N; ++i){
cin >> v[i];
if ( i % 2 == 0 ){
a[v[i]][0] = a[v[i]][0] + 1;
a[v[i]][1] = v[i];
} else {
b[v[i]][0] = b[v[i]][0] + 1;
b[v[i]][1] = v[i];
}
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
int64_t amaxnum = a[0][0], amax = a[0][1];
int64_t amaxnum2 = a[1][0];
int64_t bmaxnum = b[0][0], bmax = b[0][1];
int64_t bmaxnum2 = b[1][0];
int64_t ans = 0;
if ( amax != bmax ){
ans = N - amaxnum - bmaxnum;
} else {
ans = min(N - amaxnum2 - bmaxnum, N - amaxnum - bmaxnum2);
}
cout << ans << endl;
return 0;
}
| 0
| 92,908,987
|
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <map>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,b) FOR(i,0,b)
#define PB push_back
#define MP make_pair
int n,s,ans;
void rec(int a,int b,int sum){
if(sum==s&&b==0){
ans++;
return;
}
if(a>=10||b<=0)return;
rec(a+1,b,sum);
rec(a+1,b-1,sum+a);
}
int main(){
while(cin>>n>>s){
if(n==0&&s==0)break;
ans=0;
rec(0,n,0);
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
if (K == N) {
puts("0");
return 0;
}
vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, LINF));
dp[0][0] = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
ll res = LINF;
int a = H[j - 1];
rep(k, j) {
int b = (k > 0)? H[k - 1] : 0;
int x = max(0, a - b);
res = min(res, dp[i - 1][k] + x);
}
dp[i][j] = res;
}
}
ll ans = LINF;
for (int i = 1; i <= N; ++i) {
ans = min(ans, dp[N - K][i]);
}
cout << ans << endl;
}
| 0
| 88,148,607
|
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
int main() {
int A, B;
std::cin >> A >> B;
int cnt = 0;
for (int num = A; num <= B; ++num) {
std::stringstream ss;
ss << num;
std::string s = ss.str();
std::string re = s;
std::reverse(re.begin(), re.end());
if (s == re) ++cnt;
}
std::cout << cnt << std::endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
int main()
{
int N,A,B;
cin >> N >> A >> B;
vi P(N);
in(N,P);
vi a(3,0);
rep(i,N){
if(P[i] <= A) a[0]++;
else if(P[i] <= B) a[1]++;
else a[2]++;
}
sort(all(a));
cout << a[0] << endl;
return 0;
}
| 0
| 29,878,293
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli k, n,m=0;
cin >> k >> n;
vi a(n);
rep(i,n){
cin >> a[i];
}
sort(all(a));
for (lli i = 1; i < n;i++){
m = max(m, a[i] - a[i - 1]);
}
m = max(m, a[0] + k - a[n - 1]);
out(k - m);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e13;
const int MAX = 510000;
bool graph[nmax][nmax];
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
struct SegmentTree
{
private:
ll n;
vector<ll> node;
public:
SegmentTree(vector<ll> v)
{
ll sz = v.size();
n = 1;
while (n < sz)
{
n *= 2;
}
node.resize(2 * n - 1, INF);
for (ll i = 0; i < sz; i++)
{
node[i + n - 1] = v[i];
}
for (ll i = n - 2; i >= 0; i--)
{
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(ll x, ll val)
{
x += (n - 1);
node[x] = val;
while (x > 0)
{
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1)
{
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
void warshall_floyd(ll n)
{
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < n; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind
{
public:
vector<ll> Parent;
UnionFind(ll N)
{
Parent = vector<ll>(N, -1);
}
ll find(ll A)
{
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A)
{
return -Parent[find(A)];
}
bool Union(ll A, ll B)
{
A = find(A);
B = find(B);
if (A == B)
{
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b)
{
return (((a % MOD) * (b % MOD)) % MOD);
}
ll powMod(ll a, ll p)
{
if (p == 0)
{
return 1;
}
else if (p % 2 == 0)
{
ll half = powMod(a, p / 2);
return mulMod(half, half);
}
else
{
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b)
{
return (a + b - 1) / b;
}
vector<ll> tsort(Graph G)
{
ll N = G.size();
vector<ll> in(N);
for (auto &&edges : G)
{
for (auto &&edge : edges)
{
in[edge]++;
}
}
queue<int> que;
for (int i = 0; i < N; i++)
{
if (in[i] == 0)
{
que.push(i);
}
}
int cnt = 0;
vector<ll> ans;
while (!que.empty())
{
int v = que.front();
que.pop();
ans.push_back(v);
for (auto &&next : G[v])
{
in[next]--;
if (in[next] == 0)
{
que.push(next);
}
}
}
return ans;
}
void solve(long long N, std::vector<long long> A)
{
vector<pair<ll,ll>> leafs(N+1,make_pair(0,0));
leafs[N] = make_pair(A[N],A[N]);
for (int i = N-1; i >= 0; i--)
{
ll minimum = ceil(leafs[i+1].first,2) + A[i];
ll maximum = leafs[i+1].second + A[i];
leafs[i] = make_pair(minimum,maximum);
}
if(leafs[0].first <= 1 && 1 <= leafs[0].second){
vector<ll> tops(N+1,0);
tops[0] = 1;
ll ans = 1;
for (int i = 1; i < N+1; i++)
{
tops[i] = min(tops[i-1]*2,leafs[i].second)-A[i];
ans += tops[i] + A[i];
}
cout << ans << endl;
}else{
cout << -1 << endl;
}
}
int main()
{
long long N;
scanf("%lld", &N);
std::vector<long long> A(N - 0 + 1);
for (int i = 0; i < N - 0 + 1; i++)
{
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| 0
| 98,350,363
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
ll a,b;
cin>>n>>a>>b;
if(a==0 && b==0)
{
cout<<"0";
return;
}
ll x=n/(a+b);
ll y=n%(a+b);
ll ans=x*a +min(a,y);
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int i,j,k;
int t;
std::cout.precision(10);
t=1;
while(t--)
{
solve();
cout<<"\n";
}
}
|
#include<iostream>
#include<algorithm>
#include<climits>
using namespace std;
void quick_sort(long long s[], long long left, long long right){
long long p, l, r, t;
l = left, r = right;
p = s[(l+r)/2];
while(1){
while(s[l] < p)
l++;
while(s[r] > p)
r--;
if(l >= r) break;
t = s[r];
s[r] = s[l];
s[l] = t;
l++;r--;
}
if(left < l-1)
quick_sort(s, left, l-1);
if(right > r+1)
quick_sort(s, r+1, right);
}
int comb(long n, long r){
if(n == 0) return 1;
else if(r == 0) return 1;
else if(r == n) return 1;
else return comb(n-1, r) + comb(n-1, r-1);
}
int main(){
long long n, t, l, count = 0;
cin >> n;
long long a[n], s[n+2];
for(int i = 0; i < n; i++){
cin >> t;
a[i] = t;
}
s[0] = 0;
for(int i = 1; i < n+1; i++){
s[i] = a[i-1] + s[i-1];
}
quick_sort(s, 0, n);
l = 0;s[n+1] = 1000000000000000LL;
for(int i = 0; i <= n+1; i++){
if(s[i]!=s[l]){
count += (i-l)*(i-l-1)/2;
l = i;
}
}
cout << count << endl;
}
| 0
| 12,420,810
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define SCANF(i) int i;scanf("%d",&i)
typedef long long ll;
using namespace std;
using P = pair<int,int>;
const long long INF = 1LL << 60;
const int IINF=100000000;
const int MOD = (int)1e9 + 7;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
return ret;
}
vector<int> dx={1,0,-1,0};vector<int> dy={0,-1,0,1};
signed main () {
string s,t;cin >> s >> t;
int slen = s.length();int tlen = t.length();
vector<vector<int>> lcm(slen+1,vector<int>(tlen+1,0));
REP(i,slen)lcm[i+1][0]+=lcm[i][0]+1;
REP(i,tlen)lcm[0][i+1]+=lcm[0][i]+1;
REP(i,slen)REP(j,tlen){
if(s[i]==t[j]){
lcm[i+1][j+1]=min({lcm[i][j],lcm[i+1][j]+1,lcm[i][j+1]+1});
}else{
lcm[i+1][j+1]=min({lcm[i][j]+1,lcm[i+1][j]+1,lcm[i][j+1]+1});
}
}
cout << lcm[slen][tlen] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> s(n);
rep (i, n)
cin >> s[i].first >> s[i].second;
ll ans = 0;
int index = 0, cnt = 0;
sort(s.begin(), s.end());
rep (i, m)
{
++cnt;
if (cnt > s[index].second)
{
index++;
cnt = 1;
}
ans += s[index].first;
}
cout << ans << endl;
return 0;
}
| 0
| 64,561,544
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return 1;}return 0;}
template<class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return 1;}return 0;}
int main() {
ll r,d,x;
cin >> r >> d >> x;
rep(i,10) {
x = r * x - d;
cout << x << endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
int ans = 0;
int idx1 = 0;
int idx2 = S.length() - 1;
while(idx1 < idx2) {
if (S[idx1] == S[idx2]) {
idx1++;
idx2--;
}
else if(S[idx1] == 'x' && S[idx2] != 'x') {
idx1++;
ans++;
}
else if (S[idx1] != 'x' && S[idx2] == 'x') {
idx2--;
ans++;
}
else {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 31,124,866
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int N; Int M; cin >> N >> M;
vector<Int> A(100010), sum(100010, 0);
map<Int, Int> rem_count; rem_count[0]++;
rep1(i, N){
cin >> A[i];
sum[i] = sum[i-1] + A[i]; sum[i] %= M;
rem_count[sum[i]]++;
}
Int ans = 0;
for(pair<Int,Int> p : rem_count){
ans += p.second * (p.second-1) / 2;
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
char c[55][55];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
rep(i,h)rep(j,w) cin >> c[i+1][j+1];
rep(i,h)rep(j,w){
if(c[i+1][j+1] == '#'){
if(c[i][j+1] == '#') continue;
if(c[i+1][j] == '#') continue;
if(c[i+1][j+2] == '#') continue;
if(c[i+2][j+1] == '#') continue;
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 72,776,752
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define invrep(i,n) for(int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
int k;
cin >> k;
string n;
cin >> n;
if (n.size() > k) {
string ans = "";
rep (i, n.size()) {
if (i < k) ans += n[i];
else {
ans += "...";
break;
}
}
cout << ans << endl;
return 0;
}
cout << n << endl;
return 0;
}
|
#include <iostream>
#include <string>
#define MAX_TURN (1000)
#define MAX_LEN (100)
using namespace std;
int is_only_lower(string str);
int main()
{
int n;
int T_score = 0, H_score = 0;
do {
cin >> n;
} while (n > MAX_TURN);
string* Taro = new string[n];
string* Hanako = new string[n];
for (int i = 0; i < n; i++) {
do {
cin >> Taro[i] >> Hanako[i];
} while (Taro[i].length() > MAX_LEN || Hanako[i].length() > MAX_LEN ||
is_only_lower(Taro[i]) == 0 || is_only_lower(Hanako[i]) == 0);
if (Taro[i] > Hanako[i]) {
T_score += 3;
} else if (Taro[i] == Hanako[i]) {
T_score += 1;
H_score += 1;
} else {
H_score += 3;
}
}
cout << T_score << " " << H_score << endl;
delete[] Taro;
delete[] Hanako;
return (0);
}
int is_only_lower(string str)
{
int i;
for (i = 0; str[i] != '\0'; i++) {
if (str[i] < 'a' || str[i] > 'z') {
break;
}
}
if (str[i] == '\0') {
return (1);
} else {
return (0);
}
}
| 0
| 37,823,977
|
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
long long int h,w;
cin >> h >> w;
if(h==1 || w ==1){
cout << 1 << endl;
}
else{
cout << h*w -(h*w/2) << endl;
}
}
|
#include <iostream>
int main()
{
int X, Y;
std::cin >> X >> Y;
if (X <= 8 && Y <= 8)
{
std::cout << "Yay!";
}
else
{
if (X <= Y)
{
if (4 * Y - 2 * X <= 16)
{
std::cout << "Yay!";
}
else
{
std::cout << ":(";
}
}
else if (Y <= X)
{
if (4 * X - 2 * Y <= 16)
{
std::cout << "Yay!";
}
else
{
std::cout << ":(";
}
}
else
{
std::cout << ":(";
}
}
return 0;
}
| 0
| 74,990,898
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
int n;
cin >> n;
vector<long long> dp(n + 2, 0);
dp[0] = 2;
dp[1] = 1;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2];
}
cout << dp[n] << '\n';
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <bitset>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll mod = 1000000007 ;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
template<typename T> void print_vec(vector<T> a) {int n = a.size();REP(i, n) {cout >> a[i]; if(i!=n-1) cout << " "; else cout << endl;}}
ll power(ll base, ll exponent){ if(exponent % 2){ return power(base, exponent - 1) * base % mod; }else if(exponent){ ll root_ans = power(base, exponent / 2); return root_ans * root_ans % mod; }else{ return 1; }}
ll inverse(ll x){ return power(x, mod - 2);}
ll gcd(ll a, ll b) {if(a < b) gcd(b, a);ll r;while(r=a%b) {a=b;b=r;}return b;}
template<typename T> ll sum(T begin, T end) {return accumulate(begin, end, 0ll);}
struct combination{ vector<ll> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } ll C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
using Pair = pair<ll, ll>;
signed main() {
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
vector<ll> h(n+1);
REP(i, n) cin >> h[i+1];
vector<vector<ll>> dp(n+1, vector<ll>(n+1, inf));
dp[0][0] = 0;
REP(i, n+1) {
REP(j ,n) {
REP_FROM(k, i+1, n+1) {
dp[k][j+1] = min(dp[k][j+1], dp[i][j] + max(0ll, h[k] - h[i]));
}
}
}
ll ans = inf;
REP(i, n+1) ans = min(ans, dp[i][n-K]);
cout << ans << endl;
return 0;
}
| 0
| 20,934,758
|
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define int long long
#define INF 1000000000000000000
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int, int> Pii;
#define ANS(f) if(f) cout << "YES" << endl; else cout << "NO" << endl;
template<typename T>
void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readi(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }
signed main(){
string s; cin >> s;
cout << s.substr(0, 4) << " " << s.substr(4, 8) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
bool a[10];
int n, s;
int sum;
int count;
int ans;
void bfs(int i);
int main() {
while (1) {
cin >> n >> s;
if (!n && !s) break;
for (int i=0; i<10; i++) a[i] = false;
sum = 0;
ans = 0;
count = 0;
bfs(0);
cout << ans << endl;
}
}
void bfs(int i) {
if (sum+i < s && count < n-1 && i<9) {
a[i] = true;
sum += i;
++count;
bfs(i+1);
a[i] = false;
sum -= i;
--count;
} else if (sum+i == s && count == n-1) {
ans++;
} else if (sum+i > s) {
return;
}
if (i<9) {
bfs(i+1);
}
return;
}
| 0
| 89,999,571
|
#include <iostream>
using namespace std;
int main(){
long N1, N2, N3, N4;
char ans;
cin >> N1 >>N2 >>N3 >>N4;
int c;
c=0;
if(N1 == 1 || N2 == 1 || N3 == 1 || N4 == 1){
c++;
}
if(N1 == 9|| N2 == 9 || N3 == 9 || N4 == 9){
c++;
}
if(N1 == 7 || N2 == 7 || N3 == 7 || N4 == 7){
c++;
}
if(N1 == 4 || N2 == 4 || N3 == 4 || N4 == 4){
c++;
}
if(c==4){
cout <<"YES";
}
else
{
cout << "NO";
}
return 0;
}
|
#include<iostream>
#include<set>
using namespace std;
int main() {
int n;
cin >> n;
set<string> st;
for (int i = 0; i < n; ++i) {
string command, str;
cin >> command >> str;
if (command[0] == 'i') {
st.insert(str);
} else {
if (st.find(str) != st.end()) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
}
}
return 0;
}
| 0
| 60,302,124
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
int ans = 1;
while(ans*2 <= N){
ans *= 2;
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int a,b,c,k,j;
cin>>a>>b>>c;
k=a;
j=0;
while(1){
if(c%k==0){
j += 1;
}
if(k==b)break;
k+=1;
}
cout<<j<<endl;
return 0;
}
| 0
| 54,810,615
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<pair<int, int>> op;
if (A[0] <= 0) {
int pos = N-2;
while (A[pos] > 0) {
op.push_back({A[0], A[pos]});
A[0] -= A[pos];
pos--;
}
for (int i = pos; i >= 0; i--) {
op.push_back({A[N-1], A[i]});
A[N-1] -= A[i];
}
cout << A[N-1] << endl;
for (pair<int, int> p : op) printf("%d %d\n", p.first, p.second);
}
else {
for (int i = 1; i <= N-2; i++) {
op.push_back({A[0], A[i]});
A[0] -= A[i];
}
op.push_back({A[N-1], A[0]});
A[N-1] -= A[0];
cout << A[N-1] << endl;
for (pair<int, int> p : op) printf("%d %d\n", p.first, p.second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, k;
cin >> a >> b >> k;
if( k <= a ) {
a -= k;
}
else if(k <= a+b) {
b -= (k-a);
a = 0;
}
else {
a = 0;
b = 0;
}
cout << a << " " << b << endl;
}
| 0
| 57,097,911
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(),a.end()),a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int,vector<int>,greater<int>>
#define PriP priority_queue<P<int,int>,vector<P<int,int>>,greater<P<int,int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(),(a).end()
#define elif else if
signed main(){
int n;
cin>>n;
V<int> a(n);
fo(i,n){
cin>>a[i];
}
Sort(a);
rev(a);
V<int> g=a;
uni(g);
V<P<int,int>> d(g.sz);
int j=0;
for(int i=0; i<n; i=i){
int b=a[i];
int c=0;
d[j].fi=b;
while(i<n){
if(a[i]==b)
c++;
else
break;
i++;
}
d[j].se=c;
j++;
}
int e=0,f=0;
fo(i,g.sz){
if(d[i].se>=2&&e==0){
d[i].se-=2;
e=d[i].fi;
}
if(d[i].se>=2&&e>0){
f=d[i].fi;
break;
}
}
cout<<e*f<<endl;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(){
ll n;
cin>>n;
vector<ll> a(2*n);
for(ll i=0;i<2*n;++i){
cin>>a[i];
}
sort(a.begin(), a.end());
ll ans=0;
for(ll i=0;i<2*n;++i){
if(i%2==1){
continue;
}
ans+=a[i];
}
cout<<ans<<endl;
return 0;
}
| 0
| 33,313,098
|
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll A,B;
cin >> A >> B;
ll x=(A/4+1)*4;
ll y = B/4*4-1;
if(x>y){
ll ans=A;
FOR(i,A+1,B+1){
ans^=i;
}
cout << ans << endl;
}else{
ll ans = A;
FOR(i,A+1,x){
ans^=i;
}
FOR(i,y+1,B+1){
ans^=i;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<ull> a(N);
ull Z = 0;
rep(i,N){
cin >> a[i];
Z ^= a[i];
}
rep(i,N){
a[i] &= ~Z;
}
ll pivot = 0;
for (ull bit=(((ull)1) << 63); bit > 0; bit = bit>>1) {
ll t = -1;
for (ll i=pivot; i<N; i++) {
if ((a[i] & bit) != 0) {
t = i;
break;
}
}
if (t == -1)
continue;
swap(a[pivot], a[t]);
rep(i,N) {
if (i == pivot)
continue;
if ((a[i] & bit) != 0) {
a[i] ^= a[pivot];
}
}
pivot++;
}
ull X = 0;
rep(i,N) {
X ^= a[i];
}
cout << 2*X + Z << endl;
return 0;
}
| 0
| 36,514,934
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
int main(){
int sum = 0;
char num;
while(true){
scanf("%c",&num);
if(num == '0') break;
while(num != '\n'){
sum += atoi(&num);
scanf("%c",&num);
}
cout << sum << "\n";
sum = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
getline(cin,a);
cin >>b;
a=a+a;
if(a.find(b)==-1)
{cout <<"No"<<endl;}
else{cout <<"Yes"<<endl;}
return 0;
}
| 0
| 54,435,389
|
#include<cstdio>
using namespace std;
const int MAXN = 110;
int a[MAXN], c[MAXN];
int main(){
int N, d = 0;
scanf("%d", &N);
for (int i = 1; i <= N; ++i){
scanf("%d", &a[i]), ++c[a[i]];
if (a[i] > d)
d = a[i];
}
bool flag = 0;
if (d & 1){
if (c[d + 1 >> 1] != 2)
flag = 1;
for (int i = d + 1 >> 1; i <= d; ++i)
if (c[i] < 2){
flag = 1;
break;
}
for (int i = d >> 1; i >= 1; --i)
if (c[i]){
flag = 1;
break;
}
}
else {
if (c[d >> 1] != 1)
flag = 1;
for (int i = (d >> 1) + 1; i <= d; ++i)
if (c[i] < 2){
flag = 1;
break;
}
for (int i = (d >> 1) - 1; i >= 1; --i)
if (c[i]){
flag = 1;
break;
}
}
if (flag)
printf("Impossible");
else
printf("Possible");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
string board[6];
int h, w, k;
int check (int H, int W) {
int cnt = 0;
rep(i, h) rep(j, w) {
if ((H >> i) & 1 || (W >> j) & 1 || board[i][j] != '#') continue;
cnt++;
}
return cnt;
}
void solve() {
cin >> h >> w >> k;
rep(i, h) cin >> board[i];
int ans = 0;
rep(H, 1 << h) rep(W, 1 << w) {
if (check(H, W) == k) ans++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| 0
| 15,160,645
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
if(s.size()>t.size()) cout << "GREATER" << endl;
else if(t.size()>s.size()) cout << "LESS" << endl;
else {
for(int i=0; i<s.size(); i++) {
if(s[i]>t[i]) {
cout << "GREATER" << endl;
break;
}
else if(s[i]<t[i]) {
cout << "LESS" << endl;
break;
}
if(i==s.size()-1) cout << "EQUAL" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
void solve(){
ll n,k;
cin >> n >> k;
ll num=1;
rp(i,n){
if(num<=k) num*=2;
else num+=k;
}
print(num);
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
}
| 0
| 54,180,178
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define mp make_pair
#define ll long long int
#define pb push_back
#define F first
#define S second
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string str;
cin>>str;
set<char> s;
for(int i = 0; i < str.size(); i++)
{
char a = str[i];
s.insert(a);
}
vector<int> v;
for(auto itr = s.begin(); itr != s.end(); itr++)
{
int a = count(v.begin(), v.end(), *itr);
v.pb(a);
}
if(v.size() == 2 && v[0] == v[1])
{
cout<<"Yes";
}
else cout<<"No";
return 0;
}
|
#include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int tc=1;
while(tc--)
{
ll int n,x;
cin>>n>>x;
if(500*n>=x)
cout<<"Yes";else
cout<<"No";
}
}
| 0
| 1,511,576
|
#define FOR(i, min, max) for(int (i) = (min); (i) < (max); (i)++)
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define SWAP(a,b) { int r = a; a = b; b = r; }
#include <utility>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
int stable(string c[], string z[], int n)
{
bool order = true;
FOR(i, 0, n - 1)
{
cout << c[i] << " ";
}
cout << c[n - 1] << endl;
FOR(i, 1, n)
{
if (c[i][1] == c[i - 1][1])
{
bool ch = false;
FOR(j, 0, n)
{
if (c[i] == z[j])
ch = true;
if (z[j] == c[i - 1])
{
if (ch)
order = false;
else
break;
}
}
if(!order)
break;
}
}
if (order)
cout << "Stable" << endl;
else
cout << "Not stable" << endl;
return 0;
}
int main()
{
int n;
string a[100], c[100], z[100];
cin >> n;
FOR(i, 0, n)
{
string s;
cin >> s;
a[i] = s;
c[i] = s;
z[i] = s;
}
FOR(i, 0, n)
{
for (int j = n - 1; j > i; j--)
{
if (a[j][1] < a[j - 1][1])
{
string str = a[j];
a[j] = a[j - 1];
a[j - 1] = str;
}
}
}
stable(a, z, n);
FOR(i, 0, n)
{
int minj = i;
FOR(j, i, n)
{
if (c[j][1] < c[minj][1])
minj = j;
}
if (c[i][1] != c[minj][1])
{
string str = c[i];
c[i] = c[minj];
c[minj] = str;
}
}
stable(c, z, n);
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
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;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);
int main(){
{rep1(i,61) pw2[i]=2*pw2[i-1];}
{rep1(i,18) pw10[i]=10*pw10[i-1];}
ll N; cin>>N;
ll ans=0;
string x; cin>>x;
string s="i";
s+=x;
ll Bcnt=0;
rep1(i,N){
if(s[i]=='B') Bcnt++;
}
rep1(R,N)rep1(G,N){
if(s[R]=='R' && s[G]=='G'){
ll ans1,ans2,ans3,tmp=Bcnt;
if(abs(R-G)%2==0){
ans1=(R+G)/2;
if(s[ans1]=='B') tmp--;
}
ans2=2*R-G;
if(1<=ans2 && ans2<=N && s[ans2]=='B') tmp--;
ans3=2*G-R;
if(1<=ans3 && ans3<=N && s[ans3]=='B') tmp--;
ans+=tmp;
}
}
cout<<ans<<endl;
}
| 0
| 47,855,339
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,saidai=0;
cin >> n;
vector<int> a(n),b;
for (int i=0;i<n;i++){
cin>>a.at(i);
}
b=a;
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
saidai=b.at(0);
for(int i=0;i<n;i++){
if(saidai==a.at(i)){
cout<<b.at(1)<<endl;
}else{
cout<<b.at(0)<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
#include <algorithm>
#include <vector>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main(){
string s;
cin>>s;
int N=s.size();
bool ok=true;
for(int i=0;i<N;i++){
if(s[i]!=s[N-1-i]){ok=false;}
}
for(int i=0;i<(N-1)/2;i++){
if(s[i]!=s[(N-1)/2-1-i]){ok=false;}
}
for(int i=(N+3)/2-1;i<N;i++){
if(s[i]!=s[N-1-i]){ok=false;}
}
if(ok){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;
}
| 0
| 62,124,337
|
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int main(void){
long long N;
cin >> N;
long f = log10(N)+1;
for(long i=1; i*i<=N; i++){
if(N%i==0){
if(log10(N/i)+1<f)f=log10(N/i)+1;
}
}
cout << f << endl;
}
|
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
struct UnionFind
{
vector<int> data;
UnionFind() {}
UnionFind(int size) : data(size, -1) {}
void unite_set(int x, int y){
x = root(x);
y = root(y);
bool is_unite = (x != y);
if (is_unite){
if (data[y] < data[x]){
swap(x, y);
}
data[x] += data[y];
data[y] = x;
}
}
bool is_same(int x, int y){
return root(x) == root(y);
}
int root(int x){
return (data[x] < 0) ? x : data[x] = root(data[x]);
}
int size(int x){
return -data[root(x)];
}
};
int main()
{
int n, q;
int c, a, b;
cin >> n >> q;
struct UnionFind d(n);
vector<int> data;
data.resize(n);
for (int i=0; i<n; ++i){
data[i] = i;
}
for (int i=0; i<q; ++i){
cin >> c >> a >> b;
if(c == 1){
cout << d.is_same(a, b) << endl;
}
else {
d.unite_set(a, b);
}
}
}
| 0
| 34,315,544
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int x = max(a*c, b*c), y=max(a*d, b*d);
cout<<max(x, y);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = 1e9;
const ll INF = 1e18;
const ld EPS = 1e-10;
int main(){
int N;
cin >> N;
ll A[N];
rep(i, N) cin >> A[i];
ll ans = 0, sub = 0;
rep(i, 60){
int cnt = 0;
rep(j, N) if(A[j] & (1LL<<i)) cnt++;
if(cnt&1){
ans |= (1LL<<i);
rep(j, N) if(A[j] & (1LL<<i)) A[j] ^= (1LL<<i);
}
}
rep3(i, 59, 0){
int k = -1;
rep(j, N){
if(A[j] < (1LL<<(i+1)) && (A[j] & (1LL<<i))) k = j;
}
if(k == -1) continue;
rep(j, N){
if((A[j] & (1LL<<i)) && j != k) A[j] ^= A[k];
}
}
rep(i, N) sub ^= A[i];
cout << ans+(sub<<1) << endl;
}
| 0
| 31,068,130
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
set<int> s;
for (int i = 0; i < k; i++) {
int d;
cin >> d;
for (int j = 0; j < d; j++) {
int a;
cin >> a;
a--;
s.insert(a);
}
}
cout << n - s.size() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n; cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<ll> s(n + 1, 0);
map<ll, ll> mp;
mp[0]++;
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + a[i];
mp[s[i + 1]]++;
}
ll ans = 0;
for (auto p : mp) {
if (p.second >= 2) {
ans += (p.second) * (p.second - 1) / 2;
}
}
cout << ans << endl;
}
| 0
| 87,936,503
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll mod= 1e9 + 7;
int main(){
int a,b;
cin >> a >>b;
if(a<=8 && b<=8){cout << "Yay!" << endl;}else{cout << ":(" << endl;}
}
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#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 rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
void solve(int n, vector<string> s) {
bool l = false, r = false;
bool pre = false;
int cnt = 0;
rep (i, s.size()) {
if (s[i][0] == 'l') l = !l;
else r = !r;
if (l == r) {
if (l != pre) {
cnt++;
pre = !pre;
}
}
}
cout << cnt << endl;
}
signed main() {
while (true) {
int n;
cin >> n;
if (n == 0) return 0;
vector<string> s(n);
rep (i, n) cin >> s[i];
solve(n, s);
}
}
| 0
| 58,949,564
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1000000000+5;
const int N=2e5+5;
const ll oo=1e18+5;
const ll mod=1e9+7;
void add_self(int& a,int b){
a+=b;
if(a>=mod) a-=mod;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
vector<int> dp(n+5);
dp[0]=1;
for(int sum=3;sum<=n;++sum){
for(int num=3;num<=sum;++num){
if(sum-num>=0) add_self(dp[sum],dp[sum-num]);
}
}
cout<<dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
string s;
cin>>s;
int n=s.size();
ll ans=0;
ll id=n-1;
for(ll i=n-1;i>=0;i--){
if(s[i]=='B'){
ans+=id-i;
id--;
}
}
cout<<ans<<endl;
}
| 0
| 41,968,967
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if (a == "H" && b == "H") cout << "H" << endl;
else if (a == "D" && b == "D") cout << "H" << endl;
else cout << "D" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long n,m,r,ans=10000000000;
vector<long> x(8),a(100000),b(100000),c(100000);
vector<vector<long>> w(200,vector<long>(200,10000000000));
void saiki(vector<long> v,set<long> vv) {
if(v.size()==r) {
long aaa=0;
for(long i=0;i<r-1;i++) {
aaa+=w[v[i]-1][v[i+1]-1];
}
ans=min(aaa,ans);
} else {
for(long i=0;i<r;i++) {
if(vv.find(x[i])==vv.end()) {
vector<long> nv=v;
nv.push_back(x[i]);
set<long> nvv=vv;
nvv.insert(x[i]);
saiki(nv,nvv);
}
}
}
return;
}
int main() {
cin >> n >> m >> r;
for(long i=0;i<r;i++) cin >> x[i];
for(long i=0;i<m;i++) cin >> a[i] >> b[i] >> c[i];
for(long i=0;i<m;i++) {
w[a[i]-1][b[i]-1]=c[i];
w[b[i]-1][a[i]-1]=c[i];
}
for(long i=0;i<n;i++) w[i][i]=0;
for(long k=0;k<n;k++) {
for(long i=0;i<n;i++) {
for(long j=0;j<n;j++) w[i][j]=min(w[i][j],w[i][k]+w[k][j]);
}
}
saiki({},{});
cout << ans << endl;
}
| 0
| 64,070,558
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int a[100010], b[100010];
int main() {
int n, h;
cin >> n >> h;
rep(i,n) cin >> a[i] >> b[i];
sort(b,b+n,greater<int>());
int ma = *max_element(a,a+n);
int k = -1;
rep(i,n) {
if (b[i] <= ma) {
k = i;
break;
}
}
int ans = 0;
if (k == -1) {
rep(i,n) {
h -= b[i];
ans++;
if (h <= 0) {
cout << ans << endl;
return 0;
}
}
ans += (h+ma-1) / ma;
}
else {
rep(i,k) {
h -= b[i];
ans++;
if (h <= 0) {
cout << ans << endl;
return 0;
}
}
ans += (h+ma-1) / ma;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
const int mod = 1e9+7;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int,int> ii;
typedef map<string,int> msi;
typedef vector<ii> vii;
typedef priority_queue< ii, vector<ii>, greater<ii> > pq;
vector<ii>::iterator iter;
#define print_list(x) for(it = (x).begin(); it != (x).end(); it++) {cout << *it << " ";}
#define print_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++) {cout << *it2 << " ";}
#define search_list(x) for(it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) for(it2 = (x).begin(); it2 != (x).end(); it2++);
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
int main(int argc, char* argv[])
{ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b;
cin >> a >> b;
cout << a + (b / 2) << endl;
return 0;
}
| 0
| 87,018,995
|
#include <iostream>
using namespace std;
int extgcd(int a, int b, int& x, int &y) {
if (b == 0) { x = 1; y = 0; return a; }
else {
int g = extgcd(b, a%b, y, x);
y -= a / b * x;
return g;
}
}
int mod_inv(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return x;
}
long long fact[100002], facti[100002];
const int M = 1000000007;
int ch(int n, int k) {
if (n < 0 || k < 0 || k > n) return 0;
return fact[n] * facti[k] % M * facti[n-k] % M;
}
int main() {
int n; cin >> n;
int L, R;
int a[n+1];
fill(a, a+n+1, -1);
for (int i = 0; i <= n; i++) {
int x; cin >> x;
if (a[x] >= 0) { L = a[x]; R = n-i; } else a[x] = i;
}
fact[0] = 1; facti[0] = 1;
for (int i = 1; i <= n+1; i++) {
fact[i] = (fact[i-1] * i) % M;
facti[i] = mod_inv(fact[i], M);
}
for (int k = 1; k <= n+1; k++)
cout << ((ch(n+1, k) - ch(L+R, k-1)) % M + M) % M << endl;
}
|
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <string>
long long pow_mod(long long x, long long n, long long mod_num) {
long long res = 1;
while (n > 0) {
if (n & 1) { res = (res * x) % mod_num; }
x = (x * x) % mod_num;
n = (n >> 1);
}
return res;
}
const int MAX_N = 100050;
const int POW_MAX = 18;
int N, L, Q;
int x[MAX_N], a[MAX_N], b[MAX_N];
const int MOD = 1000000007;
int can_go[POW_MAX][MAX_N];
int calc(int na, int nb) {
if (nb <= can_go[0][na]) {
return 1;
} else {
for (int p = 0; p < POW_MAX; p++) {
if (can_go[p][na] < nb && nb <= can_go[p+1][na]) {
return pow_mod(2, p, MOD) + calc(can_go[p][na], nb);
}
}
}
}
int main(int argc, char **argv) {
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> x[i];
}
std::cin >> L;
std::cin >> Q;
for (int i = 1; i <= Q; i++) {
std::cin >> a[i] >> b[i];
}
for (int i = 1; i <= N; i++) {
if (x[N] - x[i] <= L) {
can_go[0][i] = N;
} else {
int lb = i + 1;
int ub = N;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (x[mid] - x[i] <= L) {
lb = mid;
} else {
ub = mid;
}
}
can_go[0][i] = lb;
}
}
for (int p = 1; p < POW_MAX; p++) {
for (int i = 1; i <= N; i++) {
can_go[p][i] = can_go[p-1][can_go[p-1][i]];
}
}
for (int i = 1; i <= Q; i++) {
std::cout << calc(std::min(a[i], b[i]), std::max(a[i], b[i])) << std::endl;
}
return 0;
}
| 0
| 29,070,827
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
ll r(ll x, ll y) {
if (y == 0) return 1;
else if (y % 2 == 0) return r(x, y/2) * r(x, y/2) % mod;
else return x * r(x, (y-1)/2) % mod * r(x, (y-1)/2) % mod;
}
ll s(ll x) {
if (x==0) {
return 1;
}
else {
return 2 * s(x-1) + 3;
}
}
ll f(ll x, ll y) {
if (x == 0) {
return 1;
}
else if (y == 1) {
return 0;
}
else if (y <= s(x-1)+1){
return f(x-1, y-1);
}
else if (y == s(x-1) + 2) {
return f(x-1, s(x-1)) + 1;
}
else if (y == s(x)) {
return 2 * f(x-1, s(x-1)) + 1;
}
else {
return f(x-1, s(x-1)) + 1 + f(x-1, y - s(x-1) -2);
}
}
int main() {
ll n, p;
cin >> n >> p;
printf("%lld\n", f(n, p));
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
int N, A, B;
cin >> N >> A >> B;
int turn = 1;
while (1) {
if (turn) {
if (++A == B) {
cout << "Borys" << endl;
return 0;
}
}
else {
if (--B == A) {
cout << "Alice" << endl;
return 0;
}
}
turn = (turn + 1) % 2;
}
return 0;
}
| 0
| 36,579,753
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
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 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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int N; cin >> N;
map<ll, int, greater<ll>> m;
rep(i, N){
ll a; cin >> a;
m[a]++;
}
ll res1=0, res2=0;
for(auto a: m){
if(a.second >= 4){
if(res1 == 0){
res1 = a.first;
res2 = a.first;
break;
}
else{
res2 = a.first;
break;
}
}else if(a.second >= 2){
if(res1 == 0) res1 = a.first;
else{
res2 = a.first;
break;
}
}
}
cout << res1 * res2 << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
int main() {
int V, E;
cin>>V>>E;
ll D[V][V];
for(int i=0;i<V;++i){
for(int j=0;j<V;++j){
if(i!=j) D[i][j] = big;
else D[i][j] = 0;
}
}
int s, t;
ll d;
for(int i=0;i<E;++i){
cin>>s>>t>>d;
D[s][t] = d;
}
bool negative = false;
for(int k=0;k<V;++k){
for(int i=0;i<V;++i){
for(int j=0;j<V;++j){
if((D[i][k]==big) | (D[k][j]==big)) continue;
D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
if(i==j){
if(D[i][j]<0) negative = true;
}
}
}
}
if(negative) cout<<"NEGATIVE CYCLE"<<endl;
else{
for(int i=0;i<V;++i){
for(int j=0;j<V;++j){
if(D[i][j]==big) cout<<"INF";
else cout<<D[i][j];
if(j<V-1)cout<<' ';
}
cout<<endl;
}
}
}
| 0
| 33,985,177
|
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int score = 0;
for(int i = 1; i <= N; i++){
score += i;
if(score >= N){
for(int j = 1; j <= i; j++){
if(score != N + j){
cout << j << endl;
}
}
return 0;
}
}
}
|
#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;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll NumR=0,NumG=0,NumB=0;
int n; cin >> n;
string s; cin >> s;
rep(i,n)
{
switch (s[i]){
case 'R': NumR++; break;
case 'G': NumG++; break;
case 'B': NumB++; break;
}
}
ll ans = NumR*NumG*NumB;
for (int i = 0; i < n; i++){
for (int j = 0; i+2*j+2 < n; j++)
{
char si=s[i], sj=s[i+j+1], sk=s[i+2*j+2];
if (si!=sj&&si!=sk&&sj!=sk){
ans--;
}
}
}
cout << ans << endl;
}
| 0
| 46,987,320
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)a[i]+=a[i-1];
vector<int> v;
for(int i=0;i<=n;i++){
for(int j=i+1;j<=n;j++){
v.push_back(a[j]-a[i]);
}
}
int res=0;
for(int b=60;b>=0;b--){
int cnt=0;
int now=(1ll<<b);
for(auto it:v)if(it&now)cnt++;
if(cnt>=k){
res+=now;
vector<int> vv;
for(auto it:v){
if(it&now){
vv.push_back(it);
}
}
v=vv;
}
}
cout<<res<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
typedef long long ll;
typedef pair<ll,ll> pl;
typedef vector<int> VI;
typedef vector<pair<ll,ll>> VP;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef unordered_map<ll, ll> UMP;
#define FOR(i,b,init) for(i=init;i<b;i++)
#define pb push_back
#define fi first
#define se second
#define mp make_pair
ll MOD = 1e9+7;
ll gmx = 1e6+7;
VL fact(gmx, 1);
ll powp(ll val, ll deg)
{
if (!deg)
return 1;
if (deg & 1)
return (powp(val, deg - 1) * val) % MOD;
ll res = powp(val, deg >> 1);
return (res * res) % MOD;
}
ll mx=2*1e5+7;
vector<VL> adj;
VL sub;
ll n;
void dfs(ll r, ll parent){
sub[r]=1;
for(auto k: adj[r]){
if(k==parent){continue;}
dfs(k, r);
sub[r]+=sub[k];
}
return;
}
ll gcd(ll a, ll b){
if(a>b){swap(a,b);}
if(a==0){return b;}
return gcd(a, b%a);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#endif
ll n,m,i,j;
cin>>n;
VL l(n);
FOR(i, n, 0){
cin>>l[i];
}
ll mx = 1e6+7;
VL spf(mx);
FOR(i, mx,0){
spf[i]=i;
}
FOR(i, mx, 2){
if(spf[i]==i){
for(j=i*i; j<mx;j+=i){
spf[j] = min(spf[j], i);
}
}
}
VL seen(mx, 0);
bool flag=true;
FOR(i,n,0){
if(!flag){
break;
}
ll tmp = l[i];
while(tmp!=1){
if(seen[spf[tmp]]==1){
flag=false;
break;
}
seen[spf[tmp]]=1;
ll ori = spf[tmp];
while(tmp%ori==0){
tmp = tmp/ori;
}
}
}
if(flag){
cout<<"pairwise coprime";
}
else{
ll gc = l[0];
FOR(i,n,0){
gc = gcd(l[i], gc);
}
if(gc==1){
cout<<"setwise coprime";
}
else{
cout<<"not coprime";
}
}
}
| 0
| 24,760,557
|
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = 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;}
const ll MOD = 1000000007;
const int INF = 1<<30;
int main(){
int n = 5;
vector<int> que(n);
rep(i, n) cin >> que[i];
vector<int> index(n);
rep(i, n) index[i] = i;
int ans = INF;
do{
int time = 0;
rep(i, n){
time += que[index[i]];
if (time % 10 != 0 && i != n - 1) time = (time / 10 + 1) * 10;
}
ans = min(ans, time);
}while (next_permutation(index.begin(), index.end()));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i,m) cin >> l.at(i) >> r.at(i);
vector<int> a(n+1);
rep(i,m){
a.at(0)++;
a.at(l.at(i)-1)--;
a.at(r.at(i))++;
a.at(n)--;
}
vector<int> b(n+1);
int sum=0;
rep(i,n){
sum+=a.at(i);
b.at(i)=sum;
}
int ans=0;
rep(i,n){
if(b.at(i)==0)ans++;
}
cout << ans << endl;
}
| 0
| 19,497,146
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2,62);
int keta(int x){
for(int j = 0; ; j++){
int a = pow(10, j);int b = pow(10, j+1);
if(a <= x && x < b){
return j + 1;
break;
}else{
continue;
}
}
}
int main(){
ll n;cin >> n;
ll ans = 0;
for(int i = 1;i <= n;i++){
ll oo = keta(i);
if(oo % 2 == 1){
ans++;
}
}
cout << ans << endl;
}
|
#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 <cmath>
#include <limits>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mod 1000000007
#define fst first
#define pb push_back
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main()
{
ll n;
cin >> n;
ll cnt = 0;
cout << (n - 1) / 2 << endl;
}
| 0
| 57,292,544
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
int main(void) {
int A;
string op;
int B;
cin >> A;
cin >> op;
cin >> B;
if ( op == "+" ) {
cout << A + B << endl;
}
else if ( op == "-" ) {
cout << A - B << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int MAX_V = 100;
constexpr int MAX_D = 2e7;
constexpr int INF = MAX_D * MAX_V + 7;
int V;
int dp[MAX_V][MAX_V];
void initialize() {
fill_n(&dp[0][0], MAX_V * MAX_V, INF);
for (int i{}; i < MAX_V; ++i) dp[i][i] = 0;
}
bool warshall_floyd() {
for (int k{}; k < V; ++k) {
for (int i{}; i < V; ++i) {
for (int j{}; j < V; ++j) {
if (dp[i][k] != INF && dp[k][j] != INF) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
if (dp[i][i] < 0) {
return false;
}
}
}
return true;
}
int main() {
initialize();
int E;
cin >> V >> E;
for (int i{}; i < E; ++i) {
int s, t, d;
cin >> s >> t >> d;
dp[s][t] = d;
#ifdef UNDIRECTED
dp[t][s] = d;
#endif
}
if (!warshall_floyd()) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
for (int i{}; i < V; ++i) {
for (int j{}; j < V; ++j) {
cout << (j > 0 ? " " : "") << (dp[i][j] < INF ? to_string(dp[i][j]) : "INF");
}
cout << endl;
}
return 0;
}
| 0
| 18,543,324
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int a = 0;
int b = 0;
int mina = 0;
int maxb = 0;
rep(i, n){
if(s.at(i) == '('){
a++;
b++;
}else{
a--;
b--;
}
if(b < 0) b = 0;
if(mina > a) mina = a;
if(maxb < b) maxb = b;
}
rep(i, -mina) s = '(' + s;
rep(i, b) s += ')';
cout << s << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main(){
string s,t;
int flag=1;
long long sz,k,cnt=0;
cin >>s >> k;
sz = s.size();
long long l[sz],a=1;l[0]=1;
for (int i = 1; i < sz; ++i)
{
if (s[i] == s[i-1])
{
l[i]=l[i-1]+1;
}
else {
cnt+=l[i-1]/2;
l[i]=1;
flag = 0;
}
if (flag)
{
a++;
}
}
if (flag)
{
cnt = sz*k/2;
cout << cnt;
}
else{
if (s[0]==s[sz-1])
{
cnt=cnt-a/2;
cnt *=k;
cnt=cnt+a/2+l[sz-1]/2 + (a+l[sz-1])/2*(k-1);
}
else{
cnt+=l[sz-1]/2;
cnt = cnt*k;
}
cout << cnt;
}
return 0;
}
| 0
| 82,671,231
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main()
{
int n, k; cin>>n>>k;
ll h[303];
h[0]=0;
for(int i=1; i<=n; i++){
cin>>h[i];
}
ll dp[303][303][303];
const ll INF=1e18;
for(int i=0; i<=n; i++) for(int j=0; j<=k; j++) for(int l=0; l<=i; l++) dp[i][j][l]=INF;
dp[0][0][0]=0;
for(int i=0; i<n; i++){
for(int j=0; j<=k; j++){
for(int l=0; l<=i; l++){
dp[i+1][j][i+1]=min(dp[i+1][j][i+1], dp[i][j][l]+max(0ll, h[i+1]-h[l]));
if(j+1<=k) dp[i+1][j+1][l]=min(dp[i+1][j+1][l], dp[i][j][l]);
}
}
}
ll ans=INF;
for(int i=0; i<=k; i++){
for(int j=0; j<=n; j++){
ans=min(ans, dp[n][i][j]);
}
}
cout<<ans<<endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MAX/2;
#define PI 3.14159265358979323846264338327950L;
const int INF2 = 1001001001;
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
ll mod = 1e9 + 7;
const ll LINF = 1e18 + 100;
using namespace std;
using Graph = vector<vector<int>>;
int cnt_digit(ll N)
{
int digit = 0;
while (N > 0)
{
N /= 10;
digit++;
}
return digit;
}
ll gcd(ll a, ll b)
{
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
struct union_find
{
vector<int> par, r;
union_find(int n)
{
par.resize(n);
r.resize(n);
init(n);
}
void init(int n)
{
for (int i = 0; i < n; i++) par[i] = i;
for (int i = 0; i < n; i++) r[i] = 0;
}
int find(int x)
{
if (par[x] == x)return x;
else return find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (r[x] < r[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (r[x] == r[y])
{
r[x]++;
}
}
}
};
const int MAX_N = 110000;
int memo[MAX_N];
int rec(int n) {
if (n == 0)return 0;
if (memo[n] != -1)return memo[n];
int res = n;
for (int pow6 = 1; pow6 <= n; pow6 *= 6)res = min(res, rec(n - pow6) + 1);
for (int pow9 = 1; pow9 <= n; pow9 *= 9)res = min(res, rec(n - pow9) + 1);
return memo[n] = res;
}
int calc(int x) {
int ret = 0;
while (x % 2 == 0) {
x /= 2;
ret++;
}
return ret;
}
int a[12][12];
int D;
ll G;
vector<ll> P, C;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> data(n);
rep(i, 0, n) {
cin >> data[i];
}
bool ans = true;
rep(i, 0, n - 1) {
if (data[i].back() != data[i + 1].front()) {
ans = false;
}
}
sort(data.begin(), data.end());
rep(i, 0, n - 1) {
if (data[i] == data[i + 1]) {
ans = false;
}
}
if (ans)cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 27,950,179
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <bitset>
constexpr long long MOD = 1000000007;
int dx[] = { 0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int solve(int K)
{
if(K < 10)
{
std::cout << K << std::endl;
return 0;
}
std::vector<std::vector<long long>> prev(10);
for(int i = 0; i < prev.size(); ++i)
prev[i].push_back(i);
int cnt = 9;
long long pow = 10;
while(true)
{
std::vector<std::vector<long long>> nexts(10);
{
std::vector<long long> next;
next.reserve(prev[0].size() + prev[1].size());
for(auto val: prev[0])
next.push_back(val);
for(auto val: prev[1])
next.push_back(val);
nexts[0] = std::move(next);
}
for(int i = 1; i < 9; ++i)
{
std::vector<long long> next;
next.reserve(prev[i - 1].size() + prev[i].size() + prev[i + 1].size());
for(auto val: prev[i - 1])
{
next.push_back(pow * i + val);
++cnt;
if(cnt == K)
{
std::cout << next.back() << std::endl;
return 0;
}
}
for(auto val: prev[i])
{
next.push_back(pow * i + val);
++cnt;
if(cnt == K)
{
std::cout << next.back() << std::endl;
return 0;
}
}
for(auto val: prev[i + 1])
{
next.push_back(pow * i + val);
++cnt;
if(cnt == K)
{
std::cout << next.back() << std::endl;
return 0;
}
}
nexts[i] = std::move(next);
}
{
std::vector<long long> next;
next.reserve(prev[8].size() + prev[9].size());
for(auto& val: prev[8])
{
next.push_back(pow * 9 + val);
++cnt;
if(cnt == K)
{
std::cout << next.back() << std::endl;
return 0;
}
}
for(auto& val: prev[9])
{
next.push_back(pow * 9 + val);
++cnt;
if(cnt == K)
{
std::cout << next.back() << std::endl;
return 0;
}
}
nexts.back() = std::move(next);
}
prev.swap(nexts);
pow *= 10;
}
return 0;
}
int main()
{
int K;
std::cin >> K;
solve(K);
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<map>
#define int long long
using namespace std;
signed main() {
int a;
while (cin >> a, a) {
vector<vector<int>>b(a);
int n = 0;
for (int c = 0; c < a; c++) {
vector<int>d(3);
cin >> d[0] >> d[1] >> d[2];
if (d[1] > n)n = d[1];
if (d[0] > n)n = d[0];
b[c] = d;
}
n++;
vector<vector<int>>miti(n, vector<int>(n, 1000000));
for (int e = 0; e < a; e++) {
miti[b[e][0]][b[e][1]] = miti[b[e][1]][b[e][0]] = b[e][2];
}
for (int f = 0; f < n; f++) {
for (int g = 0; g < n; g++) {
for (int h = 0; h < n; h++) {
if (g == h)miti[g][h] = 0;
else miti[g][h] = (miti[g][h]<miti[g][f] + miti[f][h]) ? (miti[g][h]) : (miti[g][f] + miti[f][h]);
}
}
}
map<int, int>l;
int o = 0;
for (auto n : miti) {
int s = 0;
for (int m : n)s += m;
l.insert(pair<int, int>(s, o));
o++;
}
auto t = l.begin();
cout << t->second << " " << t->first << endl;
}
}
| 0
| 28,097,635
|
#include <iostream>
#include <vector>
int main()
{
int N;
std::cin >> N;
std::vector<int> a(N);
for(int i = 0; i < N; i++)
{
std::cin >> a[i];
}
int ans = 0;
for(int usa = 0; usa < N; usa++)
{
int aiteUsa = a[usa];
if(a[aiteUsa - 1] <= -1) continue;
if(a[aiteUsa - 1] == usa + 1)
{
ans++;
a[aiteUsa - 1] = -1;
}
}
std::cout << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000000;
double PI = 3.1415926535;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
ll GCD(ll a,ll b){
if(a < b)return GCD(b,a);
ll r = INF;
while(r){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
int N,K = 0,A;
cin >> N;
map<int,int> mp;
for(int i = 0;i < N;i++){
cin >> A;
if(mp[A] == 0){
K++;
}
mp[A]++;
}
if(K % 2 == 1){
cout << K << endl;
}else{
cout << K - 1 << endl;
}
}
| 0
| 43,653,067
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int W, H, x, y, r;
scanf("%d %d %d %d %d", &W, &H, &x, &y, &r);
if ((W >= x + r && 0 <= x - r) && (H >= y + r && 0 <= y - r)){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
using namespace std;
long long INF=1000000000000000000;
long long mod=1000000007;
using namespace std;
int main(){
int N;
cin>>N;
vector<long long> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
sort(A.begin(),A.end());
bool both=false;
if(A[0]<0 && A[N-1]>=0)both=true;
vector<pair<long long,long long>>ans(N-1);
if(both){
for(int i=1;i<N-1;i++){
if(A[i]<0){
ans[i-1]=make_pair(A[N-1],A[i]);
A[N-1]-=A[i];
}
else if(A[i]>=0){
ans[i-1]=make_pair(A[0],A[i]);
A[0]-=A[i];
}
}
ans[N-2]=make_pair(A[N-1],A[0]);
cout<<A[N-1]-A[0]<<endl;
for(int i=0;i<N-1;i++){
cout<<ans[i].first<<" "<<ans[i].second<<endl;
}
}
else if(A[0]>=0){
for(int i=1;i<N-1;i++){
ans[i-1]=make_pair(A[0],A[i]);
A[0]-=A[i];
}
ans[N-2]=make_pair(A[N-1],A[0]);
cout<<A[N-1]-A[0]<<endl;
for(int i=0;i<N-1;i++){
cout<<ans[i].first<<" "<<ans[i].second<<endl;
}
}
else if(A[0]<0){
for(int i=N-2;i>=0;i--){
ans[N-2-i]=make_pair(A[N-1],A[i]);
A[N-1]-=A[i];
}
cout<<A[N-1]<<endl;
for(int i=0;i<N-1;i++){
cout<<ans[i].first<<" "<<ans[i].second<<endl;
}
}
return 0;
}
| 0
| 17,031,873
|
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
struct GamePoints {
int points;
};
int main() {
GamePoints Taro, Hanako;
int n;
while( cin >> n) {
string card_1, card_2;
Taro.points = 0;
Hanako.points = 0;
for(int i=0;i<n;i++) {
cin >> card_1 >> card_2;
if(card_1 == card_2 )
Taro.points++, Hanako.points++;
else if(card_1 > card_2 )
Taro.points += 3;
else
Hanako.points += 3;
}
cout << Taro.points << " " << Hanako.points << "\n";
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li h, w, d;
cin >> h >> w >> d;
if (d % 2 == 1) {
for (int r = 0; r < h; ++r) {
for (int c = 0; c < w; ++c) {
if ((r + c) % 2 == 1) {
cout << 'R';
} else {
cout << 'B';
}
}
cout << endl;
}
} else {
string cs = "RGBY";
const li dd = d / 2;
for (int r = 0; r < h; ++r) {
for (int c = 0; c < w; ++c) {
const li rr = r - ((r + c) % 2 + 2) % 2;
const li cc = c;
const li p = (rr + cc + 2000) / 2;
const li q = (rr - cc + 2000) / 2;
const li ind = (p / dd) % 2 + ((q / dd) % 2) * 2;
cout << cs[ind];
}
cout << endl;
}
}
return 0;
}
| 0
| 10,080,967
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
for (int i = s.size() - 2; i >= 2; i -= 2) {
if (s.substr(0, i / 2) == s.substr(i / 2, i / 2)) {
cout << i << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin >> n >> m;
vector<ll> a(n);
ll l=1;
bool jud=false;
for(int i = 0; i < n; i++) {
cin >> a[i];
a[i]/=2;
ll prevl=l;
l=l/__gcd(l,a[i])*a[i];
if(l/prevl != a[i]/__gcd(prevl,a[i])) jud=true;
}
for(int i = 0; i < n; i++) if((l/a[i])%2==0) jud=true;
ll ans=(m/l+1)/2;
if(jud) ans=0;
cout << ans << "\n";
return 0;
}
| 0
| 73,771,134
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
string s;
cin >> s;
vector<ll>wh;
for(ll i=0;i<s.size();i++){
if(s[i]=='W'){
wh.push_back(i);
}
}
ll ans=0,ju=0;
for(ll i=0;i<wh.size();i++){
ans+=wh[i]-ju;
ju++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N,A,B,C;
int l[8];
vector<int>sentaku[4];
int ans = 10020201010;
signed dfs(int n) {
if(n == N) {
if(sentaku[0].size() > 0 && sentaku[1].size() > 0 && sentaku[2].size() > 0) {
int cnt1 = 0;
int cnt2 = 0;
int cnt3 = 0;
for(int i = 0; i < sentaku[0].size(); i++) {
cnt1+=sentaku[0][i];
}
for(int i = 0; i < sentaku[1].size(); i++) {
cnt2+=sentaku[1][i];
}
for(int i = 0; i < sentaku[2].size(); i++) {
cnt3+=sentaku[2][i];
}
int Z = N-sentaku[3].size();
ans = min(ans,abs(A-cnt1)+abs(B-cnt2)+abs(C-cnt3)+(Z-3)*10);
return 0;
}
else {
return 0;
}
}
else {
sentaku[0].push_back(l[n]);
dfs(n+1);
sentaku[0].pop_back();
sentaku[1].push_back(l[n]);
dfs(n+1);
sentaku[1].pop_back();
sentaku[2].push_back(l[n]);
dfs(n+1);
sentaku[2].pop_back();
sentaku[3].push_back(l[n]);
dfs(n+1);
sentaku[3].pop_back();
}
return 0;
}
signed main() {
cin >> N >> A >> B >> C;
for (int i = 0; i < N; i++) {
cin >> l[i];
}
dfs(0);
cout << ans << endl;
}
| 0
| 8,895,369
|
#include<bits/stdc++.h>
#define ssg set<long long int , greater<long long int>>
using namespace std;
int main()
{
long long int a, b, c, d, e, f, max1, max2, max3, max4;
cin>>a>>b>>c>>d;
e=a;
f=c;
max1=e*f;
e=b;
f=c;
max2=e*f;
e=a;
f=d;
max3=e*f;
e=b;
f=d;
max4=e*f;
ssg set1;
set1.insert(max1);
set1.insert(max2);
set1.insert(max3);
set1.insert(max4);
set<int > :: iterator it;
cout<<*set1.begin()<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
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 (const char c){
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
int main() {
string N;
cin >> N;
ll ans = 0;
REP(k,N.length()){
ll num = ctoi(N[k]);
ans += num;
}
if (ans % 9 == 0) puts("Yes");
else puts("No");
}
| 0
| 42,436,597
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
int counts = 0;
int countsA = 0;
for(int i = 1; i <= n; i++){
counts = 0;
if(i%2 == 0) continue;
else{
for(int j = 1; j <=n; j++){
if(i%j == 0) counts++;
}
if(counts == 8) countsA++;
}
}
cout << countsA << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1ll << 60;
bool warshall_floyd(vector<vector<ll>> &adj) {
int n = adj.size();
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
}
}
}
for (int i = 0; i < n; i++) {
if (adj[i][i] < 0) return false;
}
return true;
}
void AOJ_GRL_1_C() {
int V, E;
cin >> V >> E;
vector<vector<ll>> adj(V, vector<ll>(V, INF));
for (int i = 0; i < V; i++) adj[i][i] = 0;
for (int i = 0; i < E; i++) {
int s, t; ll d;
cin >> s >> t >> d;
adj[s][t] = d;
}
bool negative_loop = warshall_floyd(adj);
if (!negative_loop) {
cout << "NEGATIVE CYCLE" << '\n';
return;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (j) cout << ' ';
if (adj[i][j] == INF) cout << "INF";
else cout << adj[i][j];
}
cout << '\n';
}
}
#include <algorithm>
void AtCoder_2017_9_9_D() {
int n, m, R, a, b, c;
cin >> n >> m >> R;
vector<int> r(R);
for (int i = 0; i < R; i++) { cin >> r[i]; r[i]--; }
sort(r.begin(), r.end());
vector<vector<ll>> adj(n, vector<ll>(n, INF));
for (int i = 0; i < n; i++) adj[i][i] = 0;
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
a--; b--;
if (c < adj[a][b]) adj[a][b] = adj[b][a] = c;
}
warshall_floyd(adj);
int ans = 0;
for (int i = 1; i < R; i++) ans += adj[r[i - 1]][r[i]];
while (next_permutation(r.begin(), r.end())) {
int tmp = 0;
for (int i = 1; i < R; i++) tmp += adj[r[i - 1]][r[i]];
ans = min(ans, tmp);
}
cout << ans << endl;
}
int main() {
AtCoder_2017_9_9_D();
return 0;
}
| 0
| 1,671,424
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
for(int i=0; i<n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<int> dp(3);
dp[0] = a[0], dp[1] = b[0], dp[2] = c[0];
for(int i=1; i<n; i++) {
vector<int> ndp(3);
ndp[0] = a[i] + max(dp[1], dp[2]);
ndp[1] = b[i] + max(dp[0], dp[2]);
ndp[2] = c[i] + max(dp[0], dp[1]);
dp = ndp;
}
cout << max(dp[0], max(dp[1], dp[2]));
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
void map_p(map<int,int>& d){cout<<"map: ";for(auto a : d){cout<<"{"<<a.first<<":"<<a.second<<"}";}cout<<endl;}
void set_p(set<int>& d){cout<<"set: ";for(int a : d){cout<<a<<" ";}cout<<endl;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
double a,b,x,t,ans;
cin>>a>>b>>x;
if(x/a<=a*b/2){
t=2*x/(a*b);
ans=atan(b/t)*180/M_PI;
}else{
t=(2*b*a*a-2*x)/(a*a);
ans=atan(t/a)*180/M_PI;
}
cout<<ans<<endl;
return 0;
}
| 0
| 61,620,931
|
#include <iostream>
using namespace std;
int main(){
int a,b,c;
int h;
cin>>a>>b>>c;
if(a>b){
h=a;
a=b;
b=h;
}
if(b>c){
h=b;
b=c;
c=h;
}
if(a>c){
h=a;
a=c;
c=h;
}
if(a>b){
h=a;
a=b;
b=h;
}
cout<<a<<' '<<b<<' '<<c<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int k[m],s[m][10];
for(int i=0;i<m;i++){
cin>>k[i];
for(int j=0;j<k[i];j++){
cin>>s[i][j];
s[i][j]--;
}
}
int p[m];
for(int i=0;i<m;i++) cin>>p[i];
int ans=0;
for(int bit=0;bit<(1<<n);bit++){
int a=0;
for(int i=0;i<m;i++){
int count=0;
for(int j=0;j<k[i];j++){
if(bit&(1<<s[i][j])) count++;
}
if(count%2==p[i]) a++;
}
if(a==m) ans++;
}
cout<<ans<<endl;
return 0;
}
| 0
| 69,218,348
|
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vi v;
for (int i = 111; i <= 999; i += 111) {
v.push_back(i);
}
rep(i, 0, v.size()) {
if (v[i] >= n) {
cout << v[i];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
const int N = 7777;
int n, k, s;
int inf = 1e9;
map <string, int> mp;
int pref[N];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
string s;
int k;
cin >> s >> k;
mp[s] = i;
pref[i] = pref[i - 1] + k;
}
string s;
cin >> s;
int k = mp[s];
cout << pref[n] - pref[k] << endl;
return 0;
}
| 0
| 37,858,740
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
using Graph = vector<vector<ll>>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << setprecision(15) << fixed;
chrono::system_clock::time_point start,end;
start = chrono::system_clock::now();
ll n, h;
cin >> n >> h;
vector<ll> a(n);
vector<ll> b(n);
ll ans = 0;
rep(i,n) {
cin >> a[i] >> b[i];
}
sort(All(a));
sort(All(b));
ll A = a[n-1];
for (ll i = n-1; i >= 0; --i) {
if (A < b[i]) {
h -= b[i];
++ans;
}
else {
break;
}
if (h <= 0) {
cout << ans << '\n';
return 0;
}
}
ans += (h+A-1)/A;
cout << ans << '\n';
end = chrono::system_clock::now();
auto elapsed = chrono::duration_cast< chrono::milliseconds >(end - start).count();
cerr << elapsed << "ms" << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf (ll)(1e18)
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
int n,k;
cin>>n>>k;
bool snuke[n+1]={0};
for( int i=0 ; i<k ; i++ )
{
int d;
cin>>d;
for( int j=0 ; j<d ; j++ )
{
int a;
cin>>a;
snuke[a]=1;
}
}
int ans=0;
for( int i=1 ; i<=n ; i++ )
{
if(!snuke[i])
ans++;
}
cout<<ans;
}
return 0;
}
| 0
| 8,854,151
|
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
inline ll read(){
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n;
ll ans,tot;
int main(){
n=read();
ans=-1;
for(int i=1;i<=n;++i){
ll d=read(),c=read();
tot+=d*c;
ans+=c;
}
ans+=(tot-1)/9;
printf("%lld\n",ans);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ii> P;
typedef unsigned long long int ull;
const int MOD=1e9+7;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e9;
int main(){
int n;cin>>n;
int dp[n+1];
for(int i=0;i<=n;i++) dp[i]=INF;
dp[0]=0;
for(int i=0;i<=n;i++){
for(int j=1;i+j<=n;j*=6){
dp[i+j]=min(dp[i+j],dp[i]+1);
}
for(int j=1;i+j<=n;j*=9){
dp[i+j]=min(dp[i+j],dp[i]+1);
}
}
cout<<dp[n]<<endl;
return 0;
}
| 0
| 71,708,131
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.