code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << x << "\n"
constexpr int mod = 1000000007;
using namespace std;
int n, k, a[123456], ans;
int f1(int a, int p) {
if (p == 1)return a;
if (p % 2)return f1(a, p - 1) * a % mod;
else return f1(a * a % mod, p / 2) % mod;
}
signed main() {
cin >> n >> k;
for1(i, k) a[i] = ((i == 1 || k / i != k / (i - 1)) ? f1(k / i, n) : a[i - 1]);
for (int i = k; i >= 2; i--)for1(j, sqrt(i)) if (i%j == 0) {
a[j] -= a[i]; if (a[j] < 0)a[j] += mod;
if (j > 1 && j*j != i) { a[i / j] -= a[i]; if (a[i / j] < 0)a[i / j] += mod; }
}
for1(i, k) { ans += a[i] * i; ans %= mod; }
puts(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll dp[100005];
ll fast_pow(ll val, ll pw){
if(pw == 0)
return 1;
ll tmp = fast_pow(val, pw/2), ans;
ans = (tmp*tmp)%mod;
if(pw%2==1)
ans = (ans*val)%mod;
return ans;
}
ll num_div(int n, int maxi, int pw){
ll prod;
int tmp = maxi/n;
prod = fast_pow(tmp, pw);
return prod;
}
int main(){
int n, k;
ll sum = 0;
cin>>n>>k;
memset(dp, 0, sizeof dp);
for(int x=k;x>=1;x--){
dp[x] = num_div(x, k, n)%mod;
for(int div=2;div*x<=k;div++){
dp[x] = (dp[x]-dp[x*div])%mod;
while(dp[x] < 0){
dp[x] += mod;
}
}
sum = (sum+(x*dp[x])%mod)%mod;
}
cout<<sum<<"\n";
return 0;
}
| 1 | 57,726,916 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int f(int x)
{
int res = 0;
while (x) {
x /= 10;
++res;
}
return res;
}
signed main()
{
cout << fixed << setprecision(10);
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; ++i) if (f(i) & 1) ++ans;
cout << ans << endl;
return (0);
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 4 * MAX5;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
vll adj[MAXN]; ll visit[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
ll t = 1;
ll n, x, k, q, m, y, r, l, c, a;
string s;
void MAIN() {
cin >> s;
ll val, diff = 0, sum = 0;
string S;
val = (s.size() + 1)/2;
if(s.size() & 1) {
S = "";
for(ll i=0;i<s.size();i++) S+='9';
diff = stoull(S) - stoull(s);
}
S = "";
for(ll i = 0;i<val;i++) {
S += "09";
}
sum = stoull(S);
cout<<sum - diff ;
}
int main() {
fastio; randomINT;
while (t--) {
MAIN();
}
return 0;
}
| 1 | 9,365,165 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
string s;
cin >> s;
set<char> c1, c2;
string s1 = s.substr(0, 3);
string s2 = s.substr(1, 3);
for (auto c : s1) c1.insert(c);
for (auto c : s2) c2.insert(c);
cout << ((c1.size() == 1 || c2.size() == 1) ? "Yes" : "No") << endl;
}
int main() {
setIO();
while (tt--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if ((n[0] == n[1]) && (n[1] == n[2])) {
cout << "Yes" << endl;
}
else if ((n[1] == n[2]) && (n[2] == n[3])) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 1 | 68,603,214 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
ans = i;
}
return ans;
}
ll power(ll a,ll b,ll m)
{
if(b==0)
return 1;
if(b==1)
return a%m;
ll temp=power(a,b/2,m);
if(b%2==0)
return ((temp%m)*(temp%m))%m;
else
return ((((temp%m)*(temp%m))%m)*a%m)%m;
}
ll c(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1]%MOD +
C[i - 1][j])%MOD;
}
}
return C[n][k]%MOD;
}
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll func(ll n)
{
ll ans=0;
for(ll i=2;i*i<=n;i++)
{
if(n%i==0)
{
if(i/10==0)
ans+=1+func(i)*func(n/i);
else
ans+=func(i)*func(n/i);
}
}
return ans;
}
ll dp[205][205][205];
ll check(ll red[],ll gre[],ll blu[],ll r,ll g,ll b,ll i,ll j,ll k)
{
if(dp[i][j][k]!=-1)
return dp[i][j][k];
if(i<r&&j<g&&k<b)
{
return dp[i][j][k]=max(red[i]*gre[j]+check(red,gre,blu,r,g,b,i+1,j+1,k),max(gre[j]*blu[k]+check(red,gre,blu,r,g,b,i,j+1,k+1),blu[k]*red[i]+check(red,gre,blu,r,g,b,i+1,j,k+1)));
}
else if(i<r&&j<g)
{
return dp[i][j][k]=red[i]*gre[j]+check(red,gre,blu,r,g,b,i+1,j+1,k);
}
else if(j<g&&k<b)
{
return dp[i][j][k]=gre[j]*blu[k]+check(red,gre,blu,r,g,b,i,j+1,k+1);
}
else if(i<r&&k<b)
{
return dp[i][j][k]=red[i]*blu[k]+check(red,gre,blu,r,g,b,i+1,j,k+1);
}
else
{
return 0;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
t=1;
while(t--)
{
ll n,k;
cin>>n>>k;
ll a[n+1];
a[0]=0;
for(ll i=1;i<=n;i++)
{
a[i]=a[i-1]+i;
}
ll ans=0;
ll m=1000000007;
for(ll i=k;i<=n+1;i++)
{
ll mn=a[i-1];
ll mx;
if(i==n+1)
mx=a[n];
else
mx=a[n]-a[n-i];
ll p=mx-mn+1;
ans+=p;
}
cout<<ans%m;
}
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K; cin >> N >> K;
vector<long long>sum(N + 2);
sum.at(0) = 0;
for (long long i = 0; i <= N; i++) {
sum.at(i + 1) = sum.at(i) + i;
}
long long ans = 0;
for (long long j = K; j <= N + 1; j++) {
ans += sum.at(N + 1) - sum.at(N + 1 - j) - sum.at(j) + 1;
}
cout << ans % (1000000007) << endl;
}
| 1 | 58,184,911 |
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
# include <deque>
# include <functional>
# include <iomanip>
# include <sstream>
# include <fstream>
# include <complex>
# include <numeric>
# include <immintrin.h>
# include <cassert>
# include <array>
# include <tuple>
# include <unordered_map>
# include <unordered_set>
# include <thread>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using ui32 = unsigned int;
constexpr ll INFLL = 1e18;
#define CHECK_IMPL1(cond) \
if (!(cond)) { \
DEBUG("expected cond: " << #cond); \
assert(cond); \
}
#define CHECK_IMPL2(cond, message) \
if (!(cond)) { \
DEBUG("expected cond: " << #cond << " failed with message: " << message); \
assert(cond); \
}
#define CHECK_IMPL(_1, _2, NAME, ...) NAME
#define CHECK(...) CHECK_IMPL(__VA_ARGS__, CHECK_IMPL2, CHECK_IMPL1, CHECK_IMPL0)(__VA_ARGS__)
#ifdef __APPLE__
#define DEBUG(message) std::cerr << message << "\n";
#else
#define DEBUG(message)
#endif
void solve() {
int n;
cin >> n;
vector<int> a(n);
ll s = 0;
multiset<int> diffs;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
for (int i = 0; i < n; i++) {
diffs.insert(a[(i + 1) % n] - a[i]);
}
if (s % (n * (n + 1LL) / 2LL) != 0) {
cout << "NO\n";
return;
}
ll count = s / (n * (n + 1LL) / 2LL);
ll target = count;
for (auto x : diffs) {
if (x == target) {
continue;
}
if (x > target) {
cout << "NO\n";
return;
}
if ((target - x) % n != 0) {
cout << "NO\n";
return;
}
count -= (target - x) / n;
}
if (count == 0) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef __APPLE__
freopen("input.txt", "r", stdin);
#endif
int t = 1;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,sum=0;
cin>>n;
vector<long long> v(n), l(n);
for(long long &i:v)cin>>i,sum+=i;
long long g=n*(n+1)/2;
if(sum%g){
cout<<"NO";
return 0;
}
long long op=sum/g;
long long lds=0;
for(int i=0; i<n; i++){
l[i]=v[i]-v[i?i-1:n-1];
}
long long o2=0;
for(int i=0; i<n; i++){
if(op-l[i]<0 || (op-l[i])%n){
cout<<"NO";
return 0;
}
o2+=(op-l[i])/n;
}
cout<<(o2==op?"YES":"NO");
return 0;
}
| 1 | 33,969,611 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int m,h,len;
while(1){
char s[210],t[210]="";
scanf("%s",s);
if(strcmp(s,"-")==0) break;
len=strlen(s);
scanf("%d",&m);
rep(i,0,m){
scanf("%d",&h);
rep(j,0,h){
t[j+len-h]=s[j];
}
rep(j,h,len){
t[j-h]=s[j];
}
sprintf(s,"%s",t);
}
printf("%s\n",s);
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int number;
string str;
while (1) {
cin >> str;
if (str == "-") break;
cin >> number;
for (int i = 0; i < number; i++) {
int move;
string strC;
cin >> move;
strC = str.substr(move, str.length());
str.erase(move, str.length());
str.insert(0, strC);
}
cout << str << endl;
}
return 0;
}
| 1 | 28,831,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int s;
cin >> s;
if(s == 25){
cout << "Christmas" << endl;
}else if(s == 24){
cout << "Christmas Eve" << endl;
}else if(s == 23){
cout << "Christmas Eve Eve" << endl;
}else{
cout << "Christmas Eve Eve Eve" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string xmaseve (string xmas, int n) {
if (n==25)
return xmas;
else if (n<25) {
return (xmaseve(xmas, n+1) + " Eve");
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
cout << xmaseve("Christmas", n);
}
| 1 | 22,835,047 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
while(true){
cin >> s;
if(s=="-") break;
int m,h;
cin >> m;
for(int i=0;i<m;i++){
cin >> h;
s = s.substr(h, s.size()-h) + s.substr(0,h);
}
cout << s << endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
while(1) {
char s[210];
int n, a;
scanf("%s", s);
if(s[0] == '-' && s[1] == '\0') break;
cin >> n;
string s1 = s;
rep(i,n) {
cin >> a;
string s2 = s1.substr(0, a);
string s3 = s1.substr(a);
s1 = s3 + s2;
}
cout << s1 << endl;
}
return 0;
}
| 1 | 50,780,819 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y)
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) printf("%.10f\n", x)
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << "\n";
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define endl "\n"
#define Case(x) printf("Case #%d: ", x);
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<int>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<vector<vector<PI>>> vvvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<vector<vector<PLL>>> vvvpl;
int POWINT(int x, int n) {
int ret = 1;
while (n > 0) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
};
ll POWLL(ll x, int n) {
ll ret = 1;
while (n > 0) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
};
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;
};
void print() {
cout << endl;
}
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
}
template <class T>
void print(vector<T> &vec, ll k){
ll n = vec.size();
k = min(k, n);
rep(i, 0, k-1) cout << vec[i] << " ";
cout << vec[k-1] << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
}
template<class T, class U>
void print(pair<T,U> &p){
cout << p.first << " " << p.second << "\n";
}
const ll LINF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll H, W; cin >> H >> W;
if (H % 3 == 0 || W % 3 == 0) {
cout << 0 << endl;
} else {
ll ans = LINF;
{
for (ll i = 1; i <= W; i++) {
ll a = i * H;
ll b, c;
{
if ((W-i) % 2 == 0) {
b = c = H * ((W-i)/2);
} else {
b = H * ((W-i)/2);
c = H * ((W-i)/2+1);
}
ll ma = max<ll>({a, b, c});
ll mi = min<ll>({a, b, c});
chmin(ans, ma-mi);
}
{
if (H%2 == 0) {
b = c = (H/2) * (W-i);
} else {
b = (W-i) * (H/2);
c = (W-i) * ((H/2)+1);
}
ll ma = max<ll>({a, b, c});
ll mi = min<ll>({a, b, c});
chmin(ans, ma-mi);
}
}
}
swap(H, W);
{
for (ll i = 1; i <= W; i++) {
ll a = i * H;
ll b, c;
{
if ((W-i) % 2 == 0) {
b = c = H * ((W-i)/2);
} else {
b = H * ((W-i)/2);
c = H * ((W-i)/2+1);
}
ll ma = max<ll>({a, b, c});
ll mi = min<ll>({a, b, c});
chmin(ans, ma-mi);
}
{
if (H%2 == 0) {
b = c = (H/2) * (W-i);
} else {
b = (W-i) * (H/2);
c = (W-i) * ((H/2)+1);
}
ll ma = max<ll>({a, b, c});
ll mi = min<ll>({a, b, c});
chmin(ans, ma-mi);
}
}
}
cout << ans << endl;
}
return 0;
};
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
#define DEBUG 0
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int,int> pint;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
ll h,w;
cin >> h >> w;
ll hw = h * w;
ll w2 = w / 2;
ll h2 = h / 2;
ll a,b,c;
ll smax,smin;
ll res = INF;
for(ll i = 1; i <= h-2; ++i)
{
a = w * i;
ll zan = h - i;
ll zan2 = zan / 2;
b = w * zan2;
c = w * (zan - zan2);
smax = max(a,max(b,c));
smin = min(a,min(b,c));
res = min(res, smax - smin);
}
for(ll i = 1; i <= w-2; ++i)
{
a = h * i;
ll zan = w - i;
ll zan2 = zan / 2;
b = h * zan2;
c = h * (zan - zan2);
smax = max(a,max(b,c));
smin = min(a,min(b,c));
res = min(res, smax - smin);
}
for(ll i = 1; i <= h-1; ++i)
{
a = w * i;
b = (h-i) * w2;
c = (h-i) * (w - w2);
smax = max(a,max(b,c));
smin = min(a,min(b,c));
res = min(res, smax - smin);
}
for(ll i = 1; i <= w-1; ++i)
{
a = h * i;
b = (w-i) * h2;
c = (w-i) * (h - h2);
smax = max(a,max(b,c));
smin = min(a,min(b,c));
res = min(res, smax - smin);
}
cout << res << endl;
return 0;
}
| 1 | 50,350,589 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define MODA 1000000007
#define rep(i,n) for (long long i = 0; i < (n); ++i)
std::map<long long, long long> prime_factor(long long n) {
std::map<long long, long long> ret;
for(long long i = 2; i * i <= n; ++i) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
int main() {
ll N;
cin >> N;
map<ll, ll> primes;
for (ll i=1; i<=N; ++i) {
map<ll, ll> p_i = prime_factor(i);
for (const auto p : p_i) {
primes[p.first] += p.second;
}
}
ll five_count = 0;
ll three_count = 0;
ll fifteen_count = 0;
ll twentyfive_count = 0;
ll seventyfive_count = 0;
for (const auto p : primes) {
if (p.second >= 4) {
five_count++;
}
if (p.second >= 2) {
three_count++;
}
if (p.second >=14 ) {
fifteen_count++;
}
if (p.second >=24 ) {
twentyfive_count++;
}
if (p.second >=74 ) {
seventyfive_count++;
}
}
ll ans = 0;
if (five_count < 2 || three_count < 3) {
cout << ans << endl;
return 0;
}
ll five_five_three = 0;
five_five_three = five_count * (five_count-1) / 2;
five_five_three *= three_count -2;
ans += five_five_three;
ll fifteen_five = fifteen_count * (five_count-1);
ans += fifteen_five;
ll twentyfive_three = twentyfive_count * (three_count-1);
ans += twentyfive_three;
ll seventyfive = seventyfive_count;
ans += seventyfive;
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
template<typename T>
vector<T> read_vec(size_t n){
vector<T> tmp(n);
for(size_t i = 0; i < n; i++){
cin >> tmp[i];
}
return tmp;
}
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
void prime_factor(int n, map<int, int>& mp){
for(int i = 2; i * i <= n; i++){
int k = 0;
while(n % i == 0) n /= i, k++;
if(k > 0) mp[i] += k;
}
if(n > 1) mp[n]++;
}
int main(){
Stream io;
int N;
io.read(N);
map<int, int> mp;
for(int i = 2; i <= N; i++){
prime_factor(i, mp);
}
vector<vector<int>> dp(mp.size() + 1, vector<int>(76, 0));
dp[0][1] = 1;
int i = 1;
for(auto& x : mp){
for(int j = 1; j <= 75; j++){
for(int k = 0; k <= x.second; k++){
if((k + 1) * j <= 75) {
dp[i][(k + 1) * j] += dp[i - 1][j];
}
}
}
i++;
}
cout << dp[mp.size()][75];
return 0;
}
| 1 | 42,598,651 |
#include <iostream>
using namespace std;
void ABC70(void);
void ABC71(void);
void ABC72(void);
void ABC73(void);
void ABC75(void);
void ABC77(void);
void ABC78(void);
void ABC79(void);
int main(void){
ABC75();
}
void ABC75(void){
int a,b,c;
cin>>a>>b>>c;
if(a==b)cout<<c<<endl;
if(a==c)cout<<b<<endl;
if(b==c)cout<<a<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%.12f\n",obj);};
template < typename T > std::string to_string( const T& n )
{
std::ostringstream stm ;
stm << n ;
return stm.str() ;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int A,B,C;
cin >> A >> B >> C;
if( A==B ) cout << C << endl;
else if( A==C) cout << B<< endl;
else cout << A << endl;
}
| 1 | 3,017,058 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
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; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int a,b;
cin>>a>>b;
if((a+b)%3==0||a%3==0||b%3==0)cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
const int inf=1e9;
int main(){
int a,b;cin>>a>>b;
if(a%3==0||b%3==0||(a+b)%3==0)cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
return 0;
}
| 1 | 12,024,853 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
bool isok1(ll x, vector<int> &A) {
int K = A.size();
for (int i = 0; i < K && x >= 2; ++i)
x -= x % A[i];
return x >= 2;
}
ll misearch(vector<int> &A) {
ll ok = 1e15, ng = 1;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
(isok1(mid, A) ? ok : ng) = mid;
}
return ok;
}
bool isok2(ll x, vector<int> &A) {
int K = A.size();
for (int i = 0; i < K && x > 2; ++i)
x -= x % A[i];
return x <= 2;
}
ll masearch(vector<int> &A) {
ll ok = 1, ng = 1e15;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
(isok2(mid, A) ? ok : ng) = mid;
}
return ok;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
ll mi = misearch(A);
ll ma = masearch(A);
if (mi > ma)
cout << -1 << endl;
else
cout << mi << " " << ma << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
ll K;
ll ans_max = -1;
ll ans_min = INF;
int main(){
cin >> K;
vector<ll> A;
rep(i,K) {
ll a;
cin >> a;
A.push_back(a);
}
reverse(A.begin(),A.end());
vector<ll> Bmin,Bmax;
Bmin.push_back(2);
Bmax.push_back(2);
bool t = true;
rep(i,K-1) {
ll bmax = Bmax[i]+A[i]-1;
ll bmin = Bmin[i];
if (bmax%A[i+1]!=0) {
bmax -= bmax%A[i+1];
}
if (bmin%A[i+1]!=0) {
bmin += A[i+1] - bmin%A[i+1];
}
if ((bmin>Bmax[i]+A[i]-1) || (bmax<Bmin[i])) {
t = false;
break;
}
Bmax.push_back(bmax);
Bmin.push_back(bmin);
}
if (t && A[0]==2) {
cout << Bmin.back() << " " << Bmax.back()+A[K-1]-1 << endl;
}
else {
cout << -1 << endl;
}
}
| 1 | 35,138,981 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int main()
{
int x, a;
cin >> x >> a;
if(x < a)
cout << 0 << '\n';
else
cout << 10 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.141592653589793238462643383279;
ll getDigit(ll x) {
return x == 0 ? 1 : log10(x) + 1;
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) {
cout << i << ":" << v[i] << " ";
}
cout << endl;
#else
(void)v;
#endif
}
signed main() {
ll N, A;
cin >> N >> A;
if (N < A) {
COUT(0);
} else {
COUT(10);
}
return 0;
}
| 1 | 14,492,365 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, k;
cin>>n>>k;
if(k&1){
cout<<(n/k)*1LL*(n/k)*(n/k)<<endl;
}else{
ll ans = (n/k)*1LL*(n/k)*(n/k);
ll tmp = n/(k/2) - n/k;
ans += tmp*tmp*tmp;
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, x, y, ans=0;
cin >> n >> k;
if(k%2==0) {
x=n/k;
y=(n+k/2)/k;
ans+=x*x*x;
ans+=y*y*y;
}
else {
x=n/k;
ans=x*x*x;
}
cout << ans;
}
| 1 | 93,652,002 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int k;
cin >> s >> k;
for(int i =0; i<(int)s.length();i++){
if(s[i]=='1' && k==i+1) {cout << 1; return 0;}
if(s[i]!='1') {cout << s[i]; return 0;}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
string s;
cin >> s;
ll k;
cin >> k;
int ans = 1;
for(ll i=0LL; i<k; i++){
if((s[i]-'0'!=1)){
ans = s[i]-'0';
break;
}
}
cout << ans << endl;
return 0;
}
| 1 | 70,293,084 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
vector<int>arr(n);
for(int i=1; i<n; i++)
cin>>arr[i];
for(int i=2; i<n-1; i++)
{
if(arr[i]>arr[i-1] && arr[i]>arr[i+1])
arr[i]=max(arr[i-1],arr[i+1]);
}
vector<int>ans(n+1);
ans[1]=arr[1];
int sum=arr[1];
for(int i=2; i<n; i++){
ans[i]=min(arr[i-1],arr[i]);
sum+=ans[i];
}
ans[n]=arr[n-1];
sum+=ans[n];
cout<<sum;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
int main(){
int n,ans=0;
cin>>n;
vector<int> b(n);
REP(i,n){cin>>b[i];}
ans+=(b[0]+b[n-2]);
REP(i,n-1){
ans+=min(b[i],b[i+1]);
}
cout<<ans<<endl;
return 0;
}
| 1 | 24,475,746 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9+7;
constexpr lint mod2 = 998244353;
int main() {
int n, k, t = 0, u = 0, a = 0;
scanf("%d %d", &n, &k);
string s;
cin >> s;
v1i p;
rep(i, n+1){
if(i == n){
if(s[i-1] == '1') p.push_back(u);
else{
p.push_back(t);
p.push_back(0);
}
break;
}
if(s[i] == '1'){
if(t > 0 || i == 0) p.push_back(t);
t = 0;
++u;
}
else{
if(u > 0) p.push_back(u);
u = 0;
++t;
}
}
vector<pii> v; t = 0;
rep(i, p.size()/2){
if(i == 0 && p[0] > 0) v.push_back({0, 0});
v.push_back({t+p[i*2], t+p[i*2]+p[i*2+1]});
t += p[i*2]+p[i*2+1];
}
k = min(k, (int)v.size()-1);
rep(i, v.size()-k) a = max(a, v[k+i].se-v[i].fi);
printf("%d\n", a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<ll> one;
if(s[0]=='0'){
one.push_back(0);
}
char b = 'n';
ll num = 0;
rep(i,n){
if(s[i]==b){
num++;
}else if(b=='1'){
one.push_back(num);
num=1;
}else if(b=='0'){
zero.push_back(num);
num=1;
}else{
num = 1;
}
b = s[i];
}
if(s[n-1]=='0'){
one.push_back(0);
zero.push_back(num);
}else{
one.push_back(num);
}
ll ans = 0;
if(k >= zero.size()){
rep(i,zero.size()){
ans += one[i];
ans += zero[i];
}
ans += one[one.size()-1];
cout << ans << endl;
}else{
ll res;
rep(i,k){
ans += one[i];
ans += zero[i];
}
ans += one[k];
res = ans;
rep(i,zero.size()-k){
res -= one[i];
res -= zero[i];
res += one[k+i+1];
res += zero[k+i];
ans = max(res,ans);
}
cout << ans << endl;
}
return 0;
}
| 1 | 67,904,326 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, n) for (int i = a; i <= (n); ++i)
int main() {
int A, B, C, D; cin >> A >> B >> C >> D;
if (A > D || B < C) {
cout << 0 << endl;
return 0;
}
cout << min(B, D) - max(A, C)<< endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int A, B, C, D;
cin >> A >> B >> C >> D;
if (B < C || D < A) cout << 0 << endl;
else cout << min(B, D) - max(A, C) << endl;
}
| 1 | 80,762,302 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, ans;
cin >> N;
vector<ll> T(N);
for(ll i = 0; i < N; i++) {
cin >> T.at(i);
if(i == 0) ans = T.at(0);
else ans = lcm(ans, T.at(i));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main() {
int n;
cin >> n;
vector<ll>b(n);
set<ll>a;
cin >> b[0];
ll g = b[0],ans=b[0];
rep(i, 1, n){
ll c = a.size();
cin >> b[i];
a.insert(b[i]);
if(a.size()>c){
g = gcd(ans,b[i]);
ans = ans*(b[i]/g);
}
}
cout << ans << endl;
}
| 1 | 18,809,802 |
#include<iostream>
#include<sstream>
using namespace std;
int toNumber(string s){
int n=0,m=1;
for(int i=0;i<s.length();i++){
int k=1;
switch(s.at(i)){
case 'm':
k*=10;
case 'c':
k*=10;
case 'x':
k*=10;
case 'i':
n+=k*m;
m=1;
break;
default:
if('0'<=s.at(i)&&s.at(i)<='9'){
m=s.at(i)-'0';
}
break;
}
}
return n;
}
string d="mcxi";
string fromNumber(int n){
ostringstream s;
for(int i=0;i<d.length();i++){
int m=1;
for(int j=0;j<d.length()-i-1;j++)m*=10;
if(n/m>0){
if(n/m>1){
char c=n/m+'0';
s << c;
}
s << d.at(i);
n=n%m;
}
}
return s.str();
}
int main(){
ostringstream out;
int n;
string a,b;
cin >> n;
for(int i=0;i<n;i++){
cin >> a >> b;
int na,nb;
na=toNumber(a);
nb=toNumber(b);
out << fromNumber(na+nb) << endl;
}
cout << out.str();
return 0;
}
|
#include<iostream>
using namespace std;
char c[4] = {'m','c','x','i'};
int hun[4] = {1000,100,10,1};
int getsum(string a, string b){
int ina = 0, inb = 0;
int status = 1, kake = 0;
for(int i = 0; i < a.length(); i++){
if(a[i] >= '0' && a[i] <= '9') status = a[i]-'0';
else{
if(a[i] == 'm') kake = 1000;
if(a[i] == 'c') kake = 100;
if(a[i] == 'x') kake = 10;
if(a[i] == 'i') kake = 1;
ina += status * kake;
status = 1;
}
}
for(int i = 0; i < b.length(); i++){
if(b[i] >= '0' && b[i] <= '9') status = b[i]-'0';
else{
if(b[i] == 'm') kake = 1000;
if(b[i] == 'c') kake = 100;
if(b[i] == 'x') kake = 10;
if(b[i] == 'i') kake = 1;
inb += status * kake;
status = 1;
}
}
return ina+inb;
}
string conv(int in){
string out = "";
int sum[4] = {0,0,0,0};
for(int i = 0; i < 4; i++){
sum[i] = in/hun[i];
in %= hun[i];
}
for(int i = 0; i < 4; i++){
if(sum[i]){
if(sum[i] > 1)out += sum[i]+'0';
out += c[i];
}
}
return out;
}
int main(){
int num;
cin >> num;
for(int i = 0; i < num; i++){
string a,b;
cin >> a >> b;
cout << conv(getsum(a,b)) << endl;
}
return 0;
}
| 1 | 91,002,729 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main()
{
ll X;
cin >> X;
for (ll i = 0; i < X; ++i)
{
if (100 * i <= X && X <= 105 * i)
{
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
}
|
#include <iostream>
#include <vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int x;
cin >> x;
int s = x/100;
int t = x % 100;
if(t > s*5) {
cout << 0 << endl;
return 0;
}
while(s > 0) {
t -= 5;
--s;
}
if(t > 0) {
cout << 0 << endl;
return 0;
}
cout << 1 << endl;
return 0;
}
| 1 | 94,693,391 |
#include <iostream>
#include <cmath>
using namespace std;
bool check(int in){
for (int i = 3; i<=sqrt(in); i+=2){
if (i != 5 && i % 5 == 0) continue;
if (in % i == 0)
return false;
}
return true;
}
int PrimeNumber(int in, int start){
int count = 0;
if (in >= 2 && start==3) count++;
for (int i = start; i <=in; i+=2){
if (check(i)) count++;
}
return count;
}
int main(){
int in;
int count250000 = PrimeNumber(250000, 3);
int count500000 = count250000 + PrimeNumber(500000, 250001);
int count750000 = count500000 + PrimeNumber(750000, 500001);
while (cin >> in, !cin.eof()){
if (in <= 250000)
cout << PrimeNumber(in, 3) << endl;
else if (in <= 500000)
cout << count250000 + PrimeNumber(in, 250001) << endl;
else if (in <= 750000)
cout << count500000 + PrimeNumber(in, 500001) << endl;
else
cout << count750000 + PrimeNumber(in, 750001) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long long ll;
int N;
const int MAX_N = 1e6;
vector<int> fprime()
{
deque<bool> is_prime(MAX_N,true);
vector<int> res;
FOR(i,2,MAX_N) if(is_prime [i]){
res.push_back(i);
for(int j = i * 2;j < MAX_N;j += i){
is_prime [j] = false;
}
}
return res;
}
int main()
{
vector<int> primes = fprime();
while(~scanf("%d",&N)){
int ans = upper_bound(ALL(primes),N) - primes.begin();
printf("%d\n",ans);
}
return 0;
}
| 1 | 7,751,010 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return(b);
} else {
return(gcd(b, a % b));
}
}
int main() {
int N, K;
cin >> N >> K;
int a0;
cin >> a0;
int val = a0;
int MAX = val;
for (int ii = 1; ii < N; ++ii){
int a;
cin >> a;
MAX = max(MAX, a);
val = gcd(val, a);
}
if ((K % val == 0) && (K <= MAX)){
cout << "POSSIBLE" << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break;
else gcdmax%=gcdmin;
swap(gcdmin,gcdmax);
}
return gcdmin;
}
ll powerup(ll N,ll P,ll M){
if(P==0)return 1;
else if(P%2==0){
ll t=powerup(N,P/2,M);
return t*t%M;
}
else return N*powerup(N,P-1,M)%M;
}
int main()
{
ll N,K,G,A;
bool mx=false;
cin>>N>>K;
rep(i,N){
if(i==0){
cin>>G;
if(G>=K)mx=true;
}
else{
cin>>A;
G=gcd(A,G);
if(A>=K)mx=true;
}
}
if(K%G==0&&mx)cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
}
| 1 | 81,887,111 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
set<int>S;
S.insert(a);
S.insert(b);
S.insert(c);
int ans=S.size();
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c; cin >> a >> b >> c;
int cnt = 0;
if(a != b)cnt++;
if(a != c)cnt++;
if(b != c)cnt++;
if(cnt != 0)cout << cnt;
else cout << 1;
}
| 1 | 91,528,598 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
int n; cin >> n;
vector<ll> a(n);
for(int i=0;i<n;++i) {
cin >> a[i];
}
ll cnt = 0;
while(1) {
ll su = 0;
for(int i=0;i<n;++i) {
su += a[i]/n;
}
vector<ll> div(n);
for(int i=0;i<n;++i) {
div[i] = a[i]/n;
}
for(int i=0;i<n;++i) {
cnt += div[i];
a[i] -= div[i]*n;
a[i] += su - div[i];
}
bool ok = true;
for(int i=0;i<n;++i) {
if(a[i] > n-1) {
ok = false;
break;
}
}
if(ok) break;
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
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 FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
#define pb(s) push_back(s)
#define SZ(x) ((int)(x).size())
void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void vprint(vector<ll> A){
ll L = A.size();
FOR(i, 0, L){
if(i) cout << ' ';
cout << A[i];
}
cout << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
VI A(N);
rep(i, N){
cin >> A.at(i);
}
ll cnt = 0;
ll LOOP = 1000000;
while(LOOP--){
rep(i, N){
if(A[i]>=N){
ll num = A[i]/N;
A[i] %= N;
cnt += num;
rep(j, N){
if(i!=j){
A[j] += num;
}
}
}
}
}
p(cnt);
return 0;
}
| 1 | 68,010,476 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int> > VVI;
typedef vector< vector<ll> > VVL;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
ll modpow(ll a,ll n,ll mod){
ll res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
int main(){
ll N,K;
cin>>N>>K;
VL X(K+1);
ll mod=1e9+7;
rep(i,K) X[i+1]=modpow(K/(i+1),N,mod);
rep(i,K) rep(j,K/(K-i)-1) (X[K-i]+=mod-X[(K-i)*(j+2)])%=mod;
ll ans=0;
rep(i,K) (ans+=X[i+1]*(i+1)%mod)%=mod;
cout<<ans<<endl;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <math.h>
#include <unordered_map>
#include <cstring>
#include <algorithm>
#include <set>
#include <climits>
#include <numeric>
using namespace std;
typedef long long int64;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
template<typename T>
bool chmax(T& source, const T& compare_to) {
if(source < compare_to) {
source = compare_to;
return true;
}
return false;
}
int modpow(int64 base, int n) {
int64 ret = 1;
while(n) {
if(n & 1) ret = ret * base % mod;
base = base * base % mod;
n >>= 1;
}
return ret;
}
class Solution {
private:
public:
int64 solve(int n, int k) {
vector<int64> dp(k + 1);
for(int i = k; i; --i) {
auto& cur = dp[i];
cur = modpow(k / i, n);
for(int j = 2; i * j <= k; ++j) {
cur = (cur + mod - dp[i * j]) % mod;
}
}
int64 ret = 0;
for(int i = 1; i <= k; ++i) {
ret = (ret + i * dp[i]) % mod;
}
return ret;
}
};
int main() {
int n, k;
cin >> n >> k;
Solution sol;
auto ret = sol.solve(n, k);
cout << ret << endl;
}
| 1 | 5,435,740 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ab = abs(a - b);
int bc = abs(b - c);
int ca = abs(c - a);
if (ca <= d) cout << "Yes" << endl;
else if (ab <= d && bc <= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 100005;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
bool ok = false;
if (abs(a-c) <= d) ok = true;
else if (abs(b-a) <= d && abs(c-b) <= d) ok = true;
printf(ok?"Yes\n":"No\n");
}
| 1 | 84,981,710 |
#include <iostream>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int w, h, x, y;
cin >> w >> h >> x >> y;
int p;
if ((double)x == w/2.0 && (double)y == h/2.0) p = 1;
else p = 0;
cout << (double)w * (double)h / 2.0 << ' ' << p << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll W, H, x, y;
cin >> W >> H >> x >> y;
double S = H * W / 2.0;
cout << setprecision(12) << S << endl;
if(x*2==W && y*2==H) PR(1);
else PR(0);
return 0;
}
| 1 | 91,615,963 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
string S;
int cnt_0, cnt_1;
int main(){
cin >> S;
rep(i, S.size()){
if (S[i]=='0') cnt_0++;
else cnt_1++;
}
cout << 2 * min(cnt_0, cnt_1) << endl;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string S;
int main(void) {
cin >> S;
int cnt_0 = count(S.begin(), S.end(), '0');
int cnt_1 = S.length() - cnt_0;
int cnt = min(cnt_0, cnt_1);
cout << cnt * 2 << '\n';
return 0;
}
| 1 | 15,992,808 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
cin>>s>>t;
int n=s.size(),m=t.size();
string ans="UNRESTORABLE";
rep(i,n-m+1){
string u=s;
bool flag=true;
rep(j,m){
if(u[i+j]=='?') u[i+j]=t[j];
if(u[i+j]!=t[j]) flag=false;
}
if(!flag) continue;
rep(j,n) if(u[j]=='?') u[j]='a';
ans=u;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
string ans;
for (int i = 0; i < n; i++) {
if (i + m - 1 >= n) break;
bool pass = false;
string tmp = s;
for (int j = 0; j < m; j++) {
if (s[i + j] != '?' && s[i + j] != t[j]) {
pass = true;
break;
} else {
if (s[i + j] == '?') {
tmp[i + j] = t[j];
}
}
}
if (pass) continue;
for (int i = 0; i < n; i++) {
if (tmp[i] == '?') tmp[i] = 'a';
}
if (ans.empty()) ans = tmp;
ans = min(ans, tmp);
}
if (ans.empty()) cout << "UNRESTORABLE" << '\n', exit(0);
cout << ans << '\n';
return 0;
}
| 1 | 37,869,490 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;
bool solve(){
int n;
cin>> n;
if(!n) return false;
char a[2][1<<10];
for(int i=0;i<n;i++){
cin>> a[0][i]>> a[1][i];
}
int m;
cin>>m;
for(int i=0;i<m;i++){
char in;
cin>> in;
for(int j=0;j<n;j++){
if(in==a[0][j]){
in=a[1][j];
break;
}
}
cout<< in;
}
cout<<endl;
return true;
}
int main(){
cout.setf(ios::fixed);
cout.precision(10);
while(solve()){};
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<map>
using namespace std ;
int main(){
int n;
char a,b;
for(;;){
map<char,char> a2b;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> a >> b;
a2b[a]=b;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a2b.count(a)==0){
cout<<a;
}
else cout<<a2b[a];
}
cout<<endl;
}
return 0;
}
| 1 | 9,952,217 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, a, b, val;
cin >> n >> a >> b;
vector<int> ans(3, 0);
for(int i = 0; i < n; i++) {
cin >> val;
if (val <= a)
ans[0] += 1;
else if (val <= b)
ans[1] += 1;
else
ans[2] += 1;
}
cout << *min_element(ans.begin(), ans.end()) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int>P(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
vector<int>stock(3, 0);
for (int i = 0; i < N; ++i) {
if(P[i] <= A) {
stock[0]++;
} else if(P[i] > B){
stock[2]++;
} else{
stock[1]++;
}
}
sort(stock.begin(), stock.end());
cout << stock[0];
return 0;
}
| 1 | 38,661,489 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
map<ll,ll> m;
rep(i,4) {
ll buf;
cin >> buf;
m[buf]++;
}
if(m[1] == 1 && m[9] == 1 && m[7] == 1 && m[4] == 1)
{
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p)
{
ll ans = 1;
for(long long i = k; i <= n; i++)
{
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long,long long>> prime_factorize(long long p)
{
vector<pair<long long,long long>> ret;
for(long long x = 2; x * x <= p; ++x) {
if(p % x != 0) continue;
long long num = 0;
while(p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x,num));
}
if(p != 1) ret.push_back(make_pair(p, 1));
return ret;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(4);
for(int i=0;i<4;i++) {
cin >> n.at(i);
}
sort(n.begin(), n.end());
vector<int> ans={1,4,7,9};
bool flag=true;
for(int i=0;i<4;i++) {
if(ans.at(i)!=n.at(i)) {
flag=false;
break;
}
}
if(flag) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| 1 | 58,822,078 |
#include<stdio.h>
int main()
{
int i, j;
int H, W;
scanf("%d%d", &H, &W);
while (H != 0 || W != 0) {
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
if(i==0||i==H-1||j==0||j==W-1)
printf("#");
else printf(".");
}printf("\n");
}
printf("\n");
scanf("%d%d", &H, &W);
}
}
|
#include<iostream>
#include<vector>
int main()
{
int H, W;
while (1) {
std::cin >> H >> W;
if (H == 0 && W == 0)break;
for (auto i = 0; i < H; i++) {
for (auto j = 0; j < W; j++) {
if (i == 0 || i == H - 1 || j == 0 || j == W - 1)
std::cout << '#';
else
std::cout << '.';
}
std::cout << std::endl;
}
std::cout << std::endl;
}
}
| 1 | 8,433,144 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vec;
typedef vector<P> pvec;
typedef vector<vector<int>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<int> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<int,vector<int>,greater<int>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> DX = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> DY = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
const ll INF = (1LL << 60);
const double PI = (3.141592653589794);
const double EPS = (0.0000000001);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }
int nmax=200000;
vvec G(nmax);
struct UnionFind {
private:
vector<int> child,tree;
vector<vector<int>> list;
public:
UnionFind(int v) {
tree.resize(v);
list.resize(v);
REP(i,v) tree[i] = i, list[i].push_back(i);
}
int root(int i){
if(i == tree[i]){
REP(j,child.size()) tree[child[j]] = i;
child.clear();
return i;
}
else{
child.push_back(i);
return i = root(tree[i]);
}
}
int size(int i){
return list[root(i)].size();
}
vector<int> nodes(int no){
return list[root(no)];
}
bool unit(int x, int y){
x = root(x);
y = root(y);
if(x==y) return false;
if(list[x].size() < list[y].size()) swap(x,y);
for(int no:list[y]) list[x].emplace_back(no);
tree[y] = x;
return true;
}
bool isUnit(int x, int y){
return root(x) == root(y);
}
};
void solve4ts()
{
int n;
cin>>n;
int q;
cin>>q;
UnionFind uf(n+1);
rep(i,q){
int t,a,b;
cin>>t>>a>>b;
if(t==0) uf.unit(a,b);
else{
if(uf.isUnit(a,b)){
cout<<1<<endl;
}
else{
cout<<0<<endl;
}
}
}
}
signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
int repeat = 1;
while(repeat--) solve4ts();
}
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
int main(){
int N, Q, com, u, v;
cin >> N >> Q;
dsu uf(N);
rep(_,Q){
cin >> com >> u >> v;
if(com == 0)uf.merge(u, v);
else cout << uf.same(u, v) << endl;
}
return 0;
}
| 1 | 29,797,767 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 1000000000000
#define MOD 1000000007
int main(){
ll h1,h2,m1,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
ll total = (h2 - h1)*60;
total += m2 - m1 - k;
cout << total << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#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 double pi = acos(-1);
int main() {
ll h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
ll x = 60*h1 + m1;
ll y = 60*h2 + m2;
out(max(0LL, y - x - k));
re0;
}
| 1 | 14,838,644 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N,K;
cin >> N >> K;
cout << !(N % K == 0) << endl;
}
|
#include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef int64_t intl;
int main(){
int N,K;
cin >> N>>K;
if ( N%K ==0){cout << 0;}
else {cout <<1;}
}
| 1 | 84,932,547 |
#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()
{
string s;
cin >> s;
int n = s.size();
bool ok = true;
rep (i, n / 2)
if (s[i] != s[n - 1 - i])
ok = false;
rep (i, (n - 1) / 2 / 2)
if (s[i] != s[(n - 1) / 2 - 1 - i])
ok = false;
for (int i = (n + 3) / 2 - 1, cnt = 0; i < n; i++, cnt++)
if (s[i] != s[n - 1 - cnt])
ok = false;
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
string s; cin>>s;
int n=s.size();
string t=s;
reverse(all(t));
if(s!=t){
cout<<"No"<<endl;
return 0;
}
int a=(n-1)/2;
int b=(n+3)/2-1;
string k,l;
rep(i,0,a){
k.push_back(s[i]);
}
rep(i,b,n){
l.push_back(s[i]);
}
if(k==l)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| 1 | 21,216,629 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<iomanip>
using namespace std;
typedef long long ll;
int main() {
int a, b, c; cin >> a >> b >> c;
cout << (c - (a - b) >= 0 ? c - (a - b) : 0) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int left=c-(a-b);
if(left<0){
left=0;
}
cout<<left;
return 0;
}
| 1 | 85,054,739 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; ++i) cin >> a[i];
sort(a.begin(), a.end());
if (a.back() == a[0]) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#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 ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C && C == A ? "Yes" : "No") << endl;
return 0;
}
| 1 | 25,570,521 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
stack<char> q;
for(int i=0;i<s.length();i++)
{
if(s[i]=='0' || s[i]=='1')
q.push(s[i]);
else if(!q.empty() && s[i]=='B')
q.pop();
}string k;
while (!q.empty())
{
k+=q.top();
q.pop();
}
reverse(k.begin(),k.end());
cout<<k;
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(){
char s[11];
scanf("%s", &s);
int len = strlen(s);
for(int i=0; i<len; i++){
int detectB = 0;
if(s[i]=='B' && i!=0){
int j=i;
int k = 1;
while(s[j]=='B'){
s[i-k] = 'B';
k++;
j++;
}
detectB++;
}
}
for(int i=0; i<len; i++){
if(s[i] != 'B'){
printf("%c", s[i]);
}
}
return 0;
}
| 1 | 87,724,272 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int N, A, B;
int p, ans;
int one = 0;
int two = 0;
int three = 0;
cin >> N;
cin >> A >> B;
for (int i = 0; i < N; i++) {
cin >> p;
if (p <= A) {
one++;
} else if (p >= A+1 && p <= B) {
two++;
} else {
three++;
}
}
ans = min({one, two, three});
cout << ans << endl;
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP1(i,a,b) for(int i=(a);i<=(b);i++)
#define em emplace_back
#define ALL(x) (x).begin(),(x).end()
#define F first
#define S second
#define mkp make_pair
#define pii pair<int,int>
#define oi ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pll pair<ll,ll>
int main(){
int n,x[3]={},a,b,y;
cin>>n>>a>>b;
while(n--){
cin>>y;
if(y<=a) x[0]++;
else if(y>a&&y<=b) x[1]++;
else x[2]++;
}
cout<<min(x[0],min(x[1],x[2]))<<"\n";
return 0;
}
| 1 | 70,621,855 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bitComb(a,n,k) for(int a##x,a##y,a=(1<<k)-1;a<(1<<n);a##x=a&-a,a##y=a+a##x,a=(((a&~a##y)/a##x)>>1)|a##y)
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end())
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)
typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 1e5;
int n;
V<int> e[N];
int dfs(int a, int p){
int r = 0;
for(int b:e[a]) if(b!=p) r ^= dfs(b, a)+1;
return r;
}
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
FOR(i, 1, n){
int x, y;
cin >> x >> y;
x--; y--;
e[x].pb(y);
e[y].pb(x);
}
cout << (dfs(0, -1) ? "Alice" : "Bob") << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<vector<Int> > G(n);
for(Int i=1;i<n;i++){
Int x,y;
cin>>x>>y;
x--;y--;
G[x].emplace_back(y);
G[y].emplace_back(x);
}
function<Int(Int, Int) > dfs=
[&](Int v,Int p)->Int{
Int res=0;
for(Int u:G[v])
if(u!=p) res^=dfs(u,v)+1;
return res;
};
cout<<(dfs(0,-1)?"Alice":"Bob")<<endl;
return 0;
}
| 1 | 2,114,827 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REPN(i,a,b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> PL;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<int,pair<int,int> > pii;
typedef pair<double,double> pdd;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
typedef tree<pi,null_type,less<pi>,rb_tree_tag,tree_order_statistics_node_update> indexed_set_pair;
ll power(ll a,ll b) {
ll res=1;
while(b){
if(b%2==1) res=(res*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return res;
}
ll gcdll(ll a,ll b) {
if (b==0) return a;
return gcdll(b,a%b);
}
int gcd(int a,int b) {
if (b==0) return a;
return gcd(b,a%b);
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const int N = (int)2e5+5;
const int M = (int)1e3+5;
const int Q = 102;
const int logN = 19;
const double pie = acos(-1);
void solve() {
int n,l;
cin>>n>>l;
vector<string> s(n);
REP(i,0,n-1) {
cin>>s[i];
}
sort(all(s));
REP(i,0,n-1) {
cout<<s[i];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
REP(TC,1,T) {
solve();
cout<<"\n";
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n, l; cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string ans="";
rep(i, n){
ans.append(s[i]);
}
cout << ans << endl;
return 0;
}
| 1 | 68,003,672 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long counter=0;
long long n;
cin>>n;
long long b[n]={};
long long a[n]={};
for(long long i=0; i<n; i++){
cin>>a[i]>>b[i];}
for(long long i=n-1; i>=0; i--){
if((a[i]+counter)%b[i]==0){
continue;}
else{
counter+=b[i]-(a[i]+counter)%b[i];}}
cout<<counter<<endl;}
|
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<ll> a, b;
rep(i, n){
ll x, y;
cin >> x >> y;
a.push_back(x);
b.push_back(y);
}
ll res=0;
rep(i, n){
if((res+a[n-1-i])%b[n-1-i]){
res += b[n - 1 - i] - ((res + a[n - 1 - i]) % b[n - 1 - i]);
}
}
cout << res << endl;
return 0;
}
| 1 | 9,343,730 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
int main() {
string s; cin >> s;
ll n = s.size();
ll k; cin >> k;
ll tail = 0;
ll ans = 0;
ll count = 0;
ll front = 0;
ll tc = 0;
ll cw = 0;
char prev,cur;
if(s[0] == s[n-1]){
count = 2;
front = 1;
tc = 1;
tail = n-2;
while(front < n && s[front] == s[0]){
front ++;
count ++;
}
while(tail > 0 && s[tail] == s[0]){
tail --;
tc ++;
count ++;
}
if(count >= n) count = n;
}
cw = count;
if(count == n){
cout << n*k/2;
}else if(count == 0){
rep(i,s.size()){
cur = s[i];
if(i == 0) {
count ++;
prev = s[i];
}
else{
if(cur == prev) count ++;
else{
ans += count/2;
count = 1;
prev = cur;
}
}
}
ans += count/2;
ans *= k;
cout << ans;
}else{
count = 0;
for(int i = front; i <= tail; i ++){
cur = s[i];
if(i == front) {
count ++;
prev = s[i];
}
else{
if(cur == prev) count ++;
else{
ans += count/2;
count = 1;
prev = cur;
}
}
}
ans += count/2;
ans *= k;
ans += front/2;
ans += tc/2;
ans += (k-1)*(cw/2);
cout << ans;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 998244353;
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, -1, 1, 1, -1 };
namespace {
template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
struct inp {
std::size_t szi, szj;
inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
template <typename T> operator T () const { T a; std::cin >> a; return a; }
template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
template <typename T> operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
}
};
inp inp1;
}
int main() {
string s = inp1;
ll k = inp1;
int n = s.length();
if (n == 1) {
Cout(k / 2);
return 0;
}
vector<pair<char, ll>> vec;
for (auto c : s) {
if (vec.empty() || vec.back().first != c) vec.emplace_back(c, 1);
else ++vec.back().second;
}
if (vec.size() == 1) {
Cout((vec.front().second * k) / 2);
return 0;
}
ll ans = 0LL;
bool same = s.front() == s.back();
if (same) {
ans = vec.front().second / 2 + vec.back().second / 2 +
(vec.back().second + vec.front().second) / 2 * (k - 1);
}
size_t start = (same) ? 1 : 0;
size_t end = (same) ? vec.size() - 1 : vec.size();
for (size_t i = start; i < end; ++i) {
ans += vec[i].second / 2 * k;
}
Cout(ans);
return 0;
}
| 1 | 81,265,086 |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int alpha[n]['z' - 'a' + 1];
for (int x = 'a'; x <= 'z'; x++)
{
for (int j = 0; j < n; j++)
{
alpha[j][x - 'a'] = 0;
}
}
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
for (int x = 0; x < s.size(); x++)
{
for (int j = 'a'; j <= 'z'; j++)
{
if (s[x] == (char)j)
{
alpha[i][j - (int)'a'] += 1;
}
}
}
}
for (int i = 'a'; i <= 'z'; i++)
{
int min = 50;
for (int j = 0; j < n; j++)
{
if (alpha[j][i - 'a'] < min)
{
min = alpha[j][i - 'a'];
}
}
for (int j = 0; j < min; j++)
{
cout << (char)i;
}
}
cout << endl;
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
llfor;
int main(){
ll n;sc(n);
vector<string>s;
string t;
rep(i,0,n){
sc(t);
push(s,t);
}
ll len;
ll cnt[100][100];
rep(i,0,100){
rep(j,0,100){
cnt[i][j]=0;
}
}
rep(i,0,n){
t=s[i];
len=t.length();
rep(j,0,len){
cnt[i][t[j]-'a']++;
}
}
ll k;bool flag=false;
string ans;
char b;
rep(i,0,26){
ll tmp=0;
flag=false;
while(!flag){
tmp++;
rep(j,0,n){
if(cnt[j][i]<tmp){
flag=true;break;
}
}
if(!flag){
b='a'+i;
ans+=b;
}
}
}
sort(ans);
pr(ans);
return 0;}
| 1 | 21,602,016 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
ll h,w;
cin >> h >> w;
ll ans = h * w;
for(ll i=0;i<2;i++){
for(ll j=1;j<h;j++){
ll s1,s2,s3;
s1 = w * j;
s2 = w * ((h-j)/2);
s3 = w*h - s1 - s2;
ans = min(ans,max({s1,s2,s3}) - min({s1,s2,s3}));
s1 = w * j;
s2 = (h-j) * (w/2);
s3 = w*h - s1 - s2;
ans = min(ans,max({s1,s2,s3}) - min({s1,s2,s3}));
}
swap(h,w);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll H, W;
void solve()
{
if(H%3==0 || W%3==0) cout << 0 << '\n';
else{
ll ans = 1e18;
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));
ans=min(ans, mx-mi);
a2 = H*((W-w)/2), a3 = H*W-a1-a2;
mx = max(a1,max(a2,a3));
mi = min(a1,min(a2,a3));
ans = min(ans, mx-mi);
}
swap(H,W);
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));
ans=min(ans, mx-mi);
a2 = H*((W-w)/2), a3 = H*W-a1-a2;
mx = max(a1,max(a2,a3));
mi = min(a1,min(a2,a3));
ans = min(ans, mx-mi);
}
cout << ans << '\n';
}
}
int main()
{
cin >> H >> W;
solve();
return 0;
}
| 1 | 35,419,419 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> vc;
int n;
while(cin >> n){
if(n != 0){
vc.push_back(n);
}
else{
cout << vc.back() << endl;
vc.pop_back();
}
}
return 0;
}
|
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int a[10] = {0}, i = -1, n;
while(cin >> n) {
if(n == 0) {
cout << a[i--] <<endl;
} else{
i++;
a[i] = n;
}
}
return 0;
}
| 1 | 40,714,954 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed << setprecision(10);
int n, m, d; cin >> n >> m >> d;
double ans = 0.0;
double e = 0.0;
if (d == 0) {
e = double(1.0) / n;
} else {
e = double(2.0);
ll n2 = ll(n) * n;
e *= (n-d);
e /= n2;
}
cout << e * (m-1) << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define INF bit(60)
#define pb push_back
#define mod 1000000007
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
#define FACSIZE 200002
ll invfac[FACSIZE];
ll fac[FACSIZE];
template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);
ll gcd(ll, ll);
ll powLL(ll x, ll y);
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
ll comb(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void fact_init();
int main(void)
{
ll n, m, d;
cin >> n >> m >> d;
double add;
if (d == 0)
{
cout << setprecision(20) << (double)(m - 1) * ((double)n / double(n) / double(n)) << endl;
return 0;
}
add = 2 * (n - d);
cout << setprecision(20) << (double)(m - 1) * (add / double(n) / double(n)) << endl;
return 0;
}
ll mod_pow(ll x, ll r)
{
if (r == 0)
return 1;
else if (r == 1)
return x % mod;
else if (r % 2 == 0)
{
ll t = mod_pow(x, r / 2) % mod;
return mod_mul(t, t);
}
else
{
ll t = mod_pow(x, r / 2) % mod;
ll k = mod_mul(t, t);
return (k % mod) * (x % mod);
}
}
ll mod_add(ll a, ll b)
{
return ((a % mod) + (b % mod)) % mod;
}
ll mod_mul(ll a, ll b)
{
return ((a % mod) * (b % mod)) % mod;
}
ll mod_div(ll a, ll b)
{
return mod_mul(a, mod_pow(b, mod - 2));
}
void fact_init()
{
make_fact(FACSIZE - 1);
make_invfact(FACSIZE);
}
void make_fact(ll n)
{
fac[0] = 1;
rep(i, n)
{
fac[i + 1] = mod_mul(fac[i], i + 1);
}
}
void make_invfact(ll n)
{
invfac[n] = mod_pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
{
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
}
ll comb(ll n, ll r)
{
return mod_mul(mod_mul(fac[n], invfac[r]), invfac[n - r]);
}
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 qp(ll a, ll b)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * mod_mul(ans, a) % mod;
a = 1LL * mod_mul(a, a) % mod;
} while (b >>= 1LL);
return ans;
}
ll qp(ll a, ll b, ll mo)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * (ans % mo) * (a % mo);
a = 1LL * (a % mo) * (a % mo);
} while (b >>= 1LL);
return ans;
}
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll powLL(ll x, ll y)
{
ll ans = 1LL;
for (ll i = 0LL; i < y; i++)
ans *= x;
return ans;
}
| 1 | 1,759,526 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int64_t i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
#define PI 3.14159265358979
const int INF = 1 << 29;
using namespace std;
int main(){
string S;
cin >> S;
int64_t count_d = 0, count_u = 0, ans = 0;
int64_t cor = 0;
bool way = false;
rep(i, 0, S.size()){
char x = S.at(i);
if(x == '<'){
way = true;
count_u++;
}
if(x == '>'){
if(way){
ans += max(cor, count_d);
ans += ((count_u) * (count_u - 1) + (count_d) * (count_d - 1)) / 2;
cor = count_u;
count_u = 0;
count_d = 0;
way = false;
}
count_d++;
}
}
ans += max(cor, count_d);
ans += ((count_u) * (count_u + 1) + (count_d) * (count_d - 1)) / 2;
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;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s; cin >> s;
int n = s.size();
vector<ll> l(n, 0);
REP(i, n) if (s[i] == '<') l[i] = 1;
REP(i, n - 1)
if (l[i + 1] != 0 && l[i] != 0)
l[i + 1] += l[i];
vector<ll> r(n, 0);
for (int i = n - 1; i >=0; i--)
if (s[i] == '>') r[i] = 1;
for (int i = n - 1; i >0; i--)
if (r[i - 1] != 0 && r[i] != 0)
r[i - 1] += r[i];
vector<ll> tmp(n, 0);
REP(i, n)
if (l[i] != 0) tmp[i] = l[i];
else tmp[i] = r[i];
vector<ll> res;
REP(i, n - 1) {
if (s[i] == '<' && s[i + 1] == '>') {
res.push_back(max(tmp[i], tmp[i + 1]));
i++;
} else res.push_back(tmp[i]);
if (s[i] == '>' && s[i + 1] == '<')
res.push_back(0);
}
if (!(s[n - 2] == '<' && s[n - 1] == '>'))
res.push_back(tmp[n - 1]);
ll ans = accumulate(res.begin(), res.end(), 0LL);
cout << ans << '\n';
return 0;
}
| 1 | 72,563,901 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
vector<int> A, B;
int calc(int b) {
int ret = 0;
for (int i = 1; i <= N; i++) {
ret += abs(A[i-1] - (b + i));
}
return ret;
}
signed main() {
cin >> N;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
B[i] = A[i] - (i + 1);
}
sort(B.begin(), B.end());
cout << calc(B[N/2]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n+1);
for(int i=1; i<=n; i++) {
int t;
cin >> t;
a[i] = t-i;
}
sort(a.begin()+1,a.end());
ll ans = 0;
if(n%2){
for(int i=1; i<=n; i++){
ans += abs(a[i]-a[n/2+1]);
}
}
else{
for(int i=1; i<=n; i++){
ans += abs(a[i]-a[n/2]);
}
}
cout << ans << endl;
return 0;
}
| 1 | 43,952,717 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
vector<long long> divisors(long long a){
vector<long long> res;
for(long long i=1;i*i<=a;i++) if(a%i==0) {
res.emplace_back(i);
if(i*i<a) res.emplace_back(a/i);
}
sort(res.begin(),res.end());
return res;
}
int main(){
lint n; scanf("%lld",&n);
lint ans=0;
for(lint d:divisors(n)){
lint m=d-1;
if(n/d<m) ans+=m;
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
long long ans = 0;
set<long long> st;
for( long long n = 1; n * n < N; n++ ) {
long long mul = N - n;
if( mul % n == 0 ) {
long long m = mul / n;
if( st.count( m ) == 0 && N / m == N % m ) {
ans += m;
st.insert( m );
}
}
}
cout << ans << endl;
}
| 1 | 79,772,381 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007;
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
#pragma GCC optimize("Ofast")
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli a, b, c, h, n, m, w, ans = 0, count = 0;
string s, t;
vector<pair<lli, lli>> pr;
vector<pair<lli, lli>> pr2;
cin >> n >> m;
vvli d(n);
rep(i, 0, m)
{
cin >> a >> b;
a--;
b--;
d[a].pb(b);
d[b].pb(a);
}
rep(j, 0, d[0].size())
{
c = d[0][j];
rep(k, 0, d[c].size())
{
if (d[c][k] == n - 1)
{
cout << "POSSIBLE" << endl;
return 0;
}
}
}
cout << "IMPOSSIBLE" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long m,n,i,j,x,y,z,a[300000],k=0,cnt=0,b[300000];
cin>>n>>m;
memset(a,0,sizeof(a));
for(i=0;i<m;i++)
{
cin>>x>>y;
a[x]=y;
if(x==1)
{
b[k]=y;
k++;
}
}
for(i=0;i<k;i++)
{
if(a[b[i]]==n)
{
cnt=1;
break;
}
}
if(cnt==1)
cout<<"POSSIBLE"<<endl;
else
cout<<"IMPOSSIBLE"<<endl;
}
| 1 | 63,900,481 |
#include<bits/stdc++.h>
using namespace std;
int s[101];
int main(){
int n;
while(cin>>n,n){
int sum=0;
for(int i=0;i<n;++i) cin>>s[i];
sort(s,s+n);
for(int i=1;i<n-1;++i) sum+=s[i];
cout<<sum/(n-2)<<endl;
}
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<stdlib.h>
#include<set>
#include<string>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#define INF 99999999
using namespace std;
int main(){
int n;
cin >> n;
do{
int point[110];
int sum = 0;
for (int i = 0; i < n;i++){
cin >> point[i];
}
sort(point, point+n);
for (int i = 1;i < n - 1;i++){
sum += point[i];
}
cout << sum / (n - 2) << endl;
cin >> n;
} while (n != 0);
return 0;
}
| 1 | 16,979,832 |
#include<bits/stdc++.h>
using namespace std;
const long long N=2e3+10;
const long long MOD=1e9+7;
long long a[N];
long long s,ans;
int main(){
scanf("%lld",&s);
a[3]=1;
for(int i=4;i<=s;i++)
a[i]=(a[i-1]%MOD+a[i-3]%MOD)%MOD;
printf("%lld",a[s]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define deb(x) cerr << "\n" \
<< #x << "=" << x << "\n";
#define deb2(x, y) cerr << "\n" \
<< #x << "=" << x << "\n" \
<< #y << "=" << y << "\n";
#define w(x) \
int x; \
cin >> x; \
while (x--)
const int N = 2001;
int dp[N];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
dp[n] = 1;
for(int i = n; i >= 3; --i) {
for(int j = 3; j <= i; j++)
dp[i - j] = (dp[i - j] + dp[i]) % mod;
}
int ans = 0;
for(int i = 3; i <= n; ++i)
ans = (ans % mod + dp[i] % mod) % mod;
cout << ans;
return 0;
}
| 1 | 27,640,491 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if(A.at(0) == '7') {
cout << "Yes" << endl;
}
else if(A.at(1) == '7') {
cout << "Yes" << endl;
}
else if(A.at(2) == '7') {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include<stdio.h>
int main(){
int r,n,cnt=0;
scanf("%d",&n);
while(n>0){
r=n%10;
if(r==7){
printf("Yes");
cnt++;
break;
}
n=n/10;
}
if(cnt==0){
printf("No");
}
return 0;
}
| 1 | 77,903,492 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template < typename T > string tost( const T& n ) { ostringstream stm; stm << n; return stm.str();}
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 const INF = 1001001001;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,i; cin >> n >> i;
cout << n+1-i << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 10e10;
const ll MINF = -10e10;
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef priority_queue<P, vector<P>, greater<P> > PQ_ASK;
const int mod = 1000000007;
int main() {
int n, i;
cin >> n >> i;
cout << n - i + 1 << endl;
}
| 1 | 48,503,415 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(x) cout << x << endl;
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
int sum = 0;
rep(i, m) sum += a[i];
if (sum > n) {
put(-1)
}
else {
put(n - sum);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int val,n;
cin>>val>>n;
int ans=0;
while(n--)
{int x;
cin>>x;
ans+=x;
}
if(ans>val)
{
cout<<-1<<endl;
}
else
{
cout<<val-ans<<endl;
}
return 0;
}
| 1 | 4,671,039 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
bool ok = false;
for(int i = 0; i < s.size(); i++){
if(s[i] == '7'){
ok = true;
break;
}
}
if(ok){
cout << "Yes\n";
}else{
cout << "No\n";
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()
#define P pair<int,int>
#define mod 1000000007
#define PB push_back
#define F first
#define S second
int main() {
int n;
cin >> n;
string ans = "No";
rep(i, 3) {
if (n % 10 == 7) {
ans = "Yes";
break;
} else {
n /= 10;
}
}
COUT(ans);
return 0;
}
| 1 | 27,487,938 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int R, S, P;
int func(char w){
int val;
if(w == 'r') val = R;
if(w == 's') val = S;
if(w == 'p') val = P;
return val;
}
int main(){
int N, K;
cin >> N >> K;
cin >> R >> S >> P;
string T;
string S;
cin >> T;
rep(i, N){
if(T[i] == 'r') S.push_back('p');
if(T[i] == 's') S.push_back('r');
if(T[i] == 'p') S.push_back('s');
}
ll ans = 0;
rep(i, N){
if(i < K) ans += func(S[i]);
else{
if(S[i] == S[i-K]){
S[i] = 'F';
}else{
ans += func(S[i]);
}
}
}
cout << ans << 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;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;
ll score = 0;
vector<bool> ok(n, true);
for(int i=0; i<n; i++){
if(i-k >= 0){
if(t[i] == t[i-k] && ok[i-k] == false) continue;
}
ok[i] = false;
if(t[i] == 'r') score += p;
else if(t[i] == 's') score += r;
else score += s;
}
cout << score << endl;
}
| 1 | 74,225,201 |
#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 sl(n) scanf("%lld", &n);
#define si(n) scanf("%d", &n);
#define RepAll(a) for(auto x: a)
#define cout(ans) cout << ans << endl;
typedef long long ll;
const int mod = 1e9+7;
using namespace std;
#define N 100010
ll x[N], y[N];
ll xx, yy, maxy;
int main(){
int n, m;
cin >> n >> m;
REP(i, 0, n){
cin >> x[i];
}
REP(i, 0, m){
cin >> y[i];
}
for(int i = 0, j = m-1; j > i; j--, i++){
yy = (yy +abs (y[i] - y[j]) * (j - i)) % mod;
}
for(int i = 0, j = n-1; i < j; j--, i++)
{ xx = (xx + abs(x[i] - x[j]) * (j - i)) % mod;
}
cout << xx*yy%mod << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1e9+7;
int main(){
int n,m;
cin>>n>>m;
vector<ll> x(n),y(m);
for(int i=0;i<n;i++) cin>>x[i];
for(int i=0;i<m;i++) cin>>y[i];
auto calc=[](vector<ll> v){
int n=v.size();
ll res=0;
for(int i=0;i+1<n;i++){
res+=ll(i+1)*(n-1-i)%MOD*(v[i+1]-v[i])%MOD;
}
return res%MOD;
};
cout<<(calc(x)*calc(y))%MOD<<endl;
return 0;
}
| 1 | 89,599,121 |
#include <iostream>
using namespace std;
int main(void){
long long h,w;
cin>>h>>w;
if (h==1 |w==1){
cout<<1;
}
else{
cout<<((h*w+1)/2);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll H,W;
cin >> H >> W;
if (H == 1 || W == 1) cout << 1 << endl;
else{
if ((H * W) % 2 == 0) cout << (H * W) / 2 << endl;
else cout << (H * W + 1) / 2 << endl;
}
}
| 1 | 2,737,361 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
for(int x=1 ; x<=100000 ; x++)
{
if((b*x+c)%a==0) {fl=1 ; break ;}
}
if(fl) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
}
|
#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y)
{
int ret=1;
for(int i=2;i<=min(x,y);i++)if(x%i==0&&y%i==0)ret=i;
return ret;
}
int main()
{
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
int g=gcd(A,B);
if(C%g==0)printf("YES\n");
else printf("NO\n");
return 0;
}
| 1 | 48,478,634 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using pii = pair<int,int>;
int n,m,vis[100001],dist[100001];
vector<pii> adj[100001];
bool solve(int s) {
queue<int> que;
que.push(s);
vis[s]=1;
while(!que.empty()) {
int cur=que.front();que.pop();
for(auto &it:adj[cur]) {
if(!vis[it.se]) {
dist[it.se]=dist[cur]+it.fi;
vis[it.se]=1;
que.push(it.se);
} else if(dist[it.se]!=dist[cur]+it.fi) return false;
}
}
return true;
}
int main() {
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++) {
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
adj[u].push_back(pii(c,v));
adj[v].push_back(pii(-c,u));
}
for(int i=1;i<=n;i++) if(!vis[i]) {
if(!solve(i)) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int> > graph[100010];
bool visited[100010] = {};
int dist[100010];
int n, m;
bool dfs(int i, int cost){
if(visited[i]){
return dist[i] == cost;
}
visited[i] = true;
dist[i] = cost;
for(int j = 0;j < graph[i].size();j++){
if(!dfs(graph[i][j].first, cost + graph[i][j].second)){
return false;
}
}
return true;
}
signed main(){
cin >> n >> m;
int l, r, d;
for(int i = 0;i < m;i++){
cin >> l >> r >> d;
l--;
r--;
graph[l].push_back(make_pair(r, d));
graph[r].push_back(make_pair(l, -d));
}
for(int i = 0;i < n;i++){
if(!visited[i]){
if(!dfs(i, 0)){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| 1 | 80,530,960 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool kaibun(int i)
{
int a, b, c, d, e;
e = i % 10;
i = (i - e) / 10;
d = i % 10;
i = (i - d) / 10;
c = i % 10;
i = (i - c) / 10;
b = i % 10;
i = (i - b) / 10;
a = i % 10;
if ((a == e) && (b == d)) {
return true;
}
return false;
}
int main()
{
int A, B, ans = 0;
std::cin >> A >> B;
for (int i = A; i <= B; i++) {
if (kaibun(i) == true) {
ans++;
}
}
std::cout << ans << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
const int MOD = 1e9 + 7;
int main()
{
int a, b;
cin >> a >> b;
string s = "";
int ans = 0, tmp;
rep2(i, a, b + 1)
{
tmp = i;
s = "";
while (tmp)
{
s += tmp % 10 + '0';
tmp /= 10;
}
string t = s;
reverse(all(s));
if (s == t)
{
ans++;
}
}
cout << ans << endl;
return (0);
}
| 1 | 35,015,638 |
#include<iostream>
using namespace std;
int main()
{
int H = 0, W = 0, count = 0, a[10000] = { 0 };
while (1){
cin >> H >> W;
if (H == 0 && W == 0) break;
a[count] = H, a[++count] = W;
count++;
}
int i = 0;
while (i < count){
for (int j = 0; j < a[i]; j++){
for (int k = 0; k < a[i + 1]; k++){
cout << "#";
}
cout << endl;
}
cout << endl;
i += 2;
}
return 0;
}
|
#include <iostream>
int main(int argc, char const* argv[])
{
int h, w;
do {
std::cin >> h >> w;
for (size_t i = 0; i < h; i++)
{
for (size_t j = 0; j < w; j++)
std::cout << "#";
std::cout << std::endl;
}
if(h != 0 && w != 0)
std::cout << std::endl;
} while(h != 0 && w != 0);
return 0;
}
| 1 | 32,615,465 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
long n;
cin >> n;
queue<long> num;
long ans[n+1];
rep(i,n+1)ans[i] = 0;
num.push(0);
ans[0] = 0;
while(num.size()){
long now = num.front();
num.pop();
if(now==n)break;
if(ans[now+1]==0){
num.push(now + 1);
ans[now+1] = ans[now] + 1;
}
rep(i,6){
long tmp = now + pow(6,i+1);
if(tmp > n || ans[tmp] != 0)continue;
num.push(tmp);
ans[tmp] = ans[now] + 1;
}
rep(i,5){
long tmp = now + pow(9,i+1);
if(tmp > n || ans[tmp] != 0)continue;
num.push(tmp);
ans[tmp] = ans[now] + 1;
}
}
cout << ans[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> dp(n + 1, 100000000);
dp[0] = 0;
vector<ll> cost;
cost.push_back(1);
ll tmp;
tmp = 6;
while (tmp <= n) {
cost.push_back(tmp);
tmp *= 6;
}
tmp = 9;
while (tmp <= n) {
cost.push_back(tmp);
tmp *= 9;
}
sort(cost.begin(), cost.end());
for (ll i = 1; i <= n; i++) {
for (int j = 0; j < cost.size(); j++) {
if (i < cost[j]) continue;
dp[i] = min(dp[i], dp[i - cost[j]] + 1);
}
}
cout << dp[n] << endl;
return 0;
}
| 1 | 4,420,274 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
if ((long long) A * B < N){
cout << -1 << endl;
} else if (A + B - 1 > N){
cout << -1 << endl;
} else {
vector<int> cnt(B, 1);
cnt[0] = A;
int M = N - A - B + 1;
for (int i = 1; i < B; i++){
if (M % (B - 1) >= i){
cnt[i] += M / (B - 1) + 1;
} else {
cnt[i] += M / (B - 1);
}
}
vector<int> ans;
for (int i = 0; i < B; i++){
for (int j = N - cnt[i] + 1; j <= N; j++){
ans.push_back(j);
}
N -= cnt[i];
}
N = ans.size();
for (int i = 0; i < N; i++){
cout << ans[i];
if (i < N - 1){
cout << ' ' ;
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
using ll=long long;
ll n,a,b;
int main()
{
cin>>n>>a>>b;
if (n<=a+b-2 || n>a*b)
{
cout<<-1<<endl;
return 0;
}
vector <ll> res;
for (ll i=b-1;i>=0;--i) res.push_back(i);
if (a!=1)
{
ll rem=n-b,p=rem/(a-1),r=rem%(a-1);
ll b=r,c=a-1-r;
for (int i=0;i<b;++i)
{
int t=sz(res);
for (int j=0;j<p+1;++j)
{
res.push_back(t+p-j);
}
}
for (int i=0;i<c;++i)
{
int t=sz(res);
for (int j=0;j<p;++j)
{
res.push_back(t+p-1-j);
}
}
}
for (int i=0;i<sz(res);++i)
{
cout<<res[i]+1;
if (i!=sz(res)-1) cout<<" ";
}
cout<<endl;
return 0;
}
| 1 | 92,069,565 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
string s,t; cin>>s>>t;
int n=s.length();
bool ok=false;
rep(i,n){
bool che=true;
rep(j,n){
if(s[(i+j)%n]!=t[j]){
che=false;
}
}
if(che) ok=true;
}
cout<<(ok?"Yes": "No")<<endl;
}
|
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
string s,t;
cin>>s;
cin>>t;
bool f=false;
f(i,0,s.size()){
s=s[s.size()-1]+s;
s.erase(s.size()-1);
if(s==t){
f=true;
}
}
if(f){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
| 1 | 69,392,930 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
#define MP(a,b) make_pair((a),(b))
#define MT(...) make_tuple(__VA_ARGS__)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl;
#define DCOUT(x,n) cout << fixed << setprecision(n) << (x) << endl;
#define sz(x) (int)(x).size()
#define HOGE cout << "hoge" << endl;
using P = pair<ll,ll>;
template<typename T>inline istream& operator>>(istream&i,vector<T>&v)
{REP(j,sz(v))i>>v[j];return i;}
const int INF = 1e9;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
if(s<t) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
string s, t;
cin >> s >> t;
sort(ALL(s));
sort(ALL(t), greater<>());
if (t > s) print("Yes");
else print("No");
}
| 1 | 21,507,877 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,j,n) for(int i = j; i < n; i++)
#define RFOR(i,j,n) for(int i = j-1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) REP(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) printf(a?"Yes\n":"No\n")
#define _LIBCPP_DEBUG 0
using namespace std;
int64_t MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
if(ans < 0) ans = 0;
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int x,y,a,s,m;
cin>>x>>y>>a;
s=y+a;
if(s>x){cout<<s-x<<endl;}
else{cout<<"0"<<endl;}
}
| 1 | 79,418,347 |
#include<iostream>
using namespace std;
int main(void){
int A, B, C;
cin >> A >> B >> C;
for ( int i = 0; i < 10; i++ ){
cout << A * C - B << endl;
C = A * C - B;
}
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int r, D, X; cin >> r >> D >> X;
int ans = X;
rep(i, 10) {
ans = r * ans - D;
cout << ans << endl;
}
}
| 1 | 70,640,022 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if(max((y + r), H) > H || max((x + r), W) > W || x < 0 || y < 0){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
if (x - r < 0 || x + r > w) cout << "No" << endl;
else if (y - r < 0 || y + r > h) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
}
| 1 | 56,441,705 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int r;
cin>>r;
if(r!=0&&r<=100){
cout<<(3.14*r*r/3.14);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v.end()
#define forn(i, n) for(ll i=0;i<(ll)n;i++)
#define fi first
#define se second
int main() {
int r;
cin >> r;
cout << r * r << endl;
return 0;
}
| 1 | 80,644,505 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1;
int dy = y2 - y1;
int x3 = x2 - dy;
int y3 = y2 + dx;
int x4 = x3 - dx;
int y4 = y3 - dy;
cout << x3 << " " << y3 << " " << x4 << " " << y4 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+5;
void solve(){
int x,xx,y,yy;
cin>>x>>y>>xx>>yy;
int dx = xx-x;
int dy = yy-y;
cout<<xx-dy<<" "<<yy+dx<<" "<<x-dy<<" "<<y+dx<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
while(t--){
solve();
}
return 0;
}
| 1 | 1,412,423 |
const long long MOD = 1e9 + 7;
const int N = 203010;
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(N);
__ufact.resize(N);
__rev.resize(N);
__rev[1] = 1;
for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int n, m, v, p;
int a[N];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> v >> p;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int L = -1, R = n - p;
while (L + 1 < R)
{
int M = (L + R) / 2;
int le = M;
int ri = p - 1;
int t = 0;
dbg(M);
dbg(le + ri + 1);
{
int V = v - (le + ri + 1);
int WE = a[M] + m;
vector<int> maxvote;
for (int i = M + 1; i <= n - p; i++)
{
maxvote.push_back(WE - a[i]);
}
if (maxvote.back() < 0)
{
t = 0;
}
else
{
ll si = 0;
for (int i = 0; i < maxvote.size(); i++) si += maxvote[i];
if (si >= V * m) t = 1;
}
}
if (t) R = M;
else L = M;
}
cout << n - R;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
ll n, m, v, p; cin >> n >> m >> v >> p;
vector<ll> a(n), s(n + 1);
rep(i, 0, n) cin >> a[i];
sort(a.rbegin(), a.rend());
rep(i, 0, n) s[i + 1] = s[i] + a[i];
ll ans = p;
rep(i, p, n) {
if (a[i] + m < a[p - 1]) continue;
ll mx = a[i] + m;
ll sm = mx * (i - p + 1) - (s[i] - s[p - 1]);
sm += (p - 1) * m + (n - i) * m;
if (m * v <= sm) ++ans;
}
cout << ans;
return 0;
}
| 1 | 54,146,385 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(i, s, e) for (int i = (s); i <= (e); i++)
#define rep(i, n) REP(i, 0, n)
#define repi(i, n) REPI(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define dump(x) (cout << #x << " = " << x << endl)
#define dump2(x, y) (cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl)
typedef long long ll;
typedef pair<int, int> pii;
int main(void)
{
string ms[] = { "",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz" };
int n;
cin >> n;
rep(TTT, n) {
string str;
cin >> str;
vector<pii> ks;
int prev = 0;
int cnt = 0;
rep(k, str.size()) {
int i = str[k]-'0';
if (prev != i) {
if (prev != 0)
putchar(ms[prev][cnt]);
prev = i;
cnt = 0;
} else {
if (prev != 0)
cnt = (cnt+1)%ms[prev].size();
}
}
if (prev != 0)
putchar(ms[prev][cnt]);
putchar('\n');
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int main()
{
string bs[10]={
"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz",
};
int tc; scanf("%d",&tc);
while(tc--){
char s[1025]; scanf("%s",s);
int n=strlen(s);
for(int i=0,j;i<n;i=j+1){
string& b=bs[s[i]-'0'];
for(j=i;j<n && s[j]>'0';j++);
if(j==i) continue;
putchar(b[(j-1-i)%b.size()]);
}
puts("");
}
return 0;
}
| 1 | 53,201,298 |
#include <stdio.h>
#include <string.h>
int main(){
char A[15], B[15], C[15];
scanf("%s %s %s", &A, &B, &C);
int lastCharA = strlen(A) - 1;
int lastCharB = strlen(B) - 1;
if(A[lastCharA] == B[0] && B[lastCharB] == C[0]){
puts("YES");
}
else{
puts("NO");
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
char a[11], b[11], c[11];
scanf("%s %s %s", a, b, c);
int l1 = strlen(a);
int l2 = strlen(b);
if(a[l1 - 1] == b[0] && b[l2 - 1] == c[0]) {
puts("YES");
}
else puts("NO");
return 0;
}
| 1 | 98,572,416 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x[i];
}
vector<int> right(n);
for(int i=0; i<n-1; i++){
right[i] = x[i+1] - x[i];
}
right[n-1] = -1;
int klim = log2(n) + 1;
vector<vector<int>> kright(klim, vector<int>(n, -1));
for(int i=0; i<n; i++){
kright[0][i] = right[i];
}
for(int k=1; k<klim; k++){
for(int i=0; i<n; i++){
if(i + (1<<k) < n){
kright[k][i] = kright[k-1][i] + kright[k-1][i+(1<<(k-1))];
}
else{
kright[k][i] = -1;
}
}
}
vector<int> next_hotel(n);
auto n_hotel = [&](int s, int l) -> int{
for(int k=klim-1; k>=0; k--){
if(kright[k][s] != -1){
if(l >= kright[k][s]){
l -= kright[k][s];
s += (1<<k);
}
}
}
return s;
};
int l, q;
cin >> l >> q;
for(int i=0; i<n-1; i++){
next_hotel[i] = n_hotel(i, l);
}
next_hotel[n-1] = -1;
vector<vector<int>> m_days_right(klim, vector<int>(n, -1));
for(int i=0; i<n; i++){
m_days_right[0][i] = next_hotel[i];
}
for(int k=1; k<klim; k++){
for(int i=0; i<n; i++){
if(m_days_right[k-1][i] != -1){
m_days_right[k][i] = m_days_right[k-1][m_days_right[k-1][i]];
}
}
}
auto min_days = [&](int a, int b, int l) -> int{
int now = a;
int days = 0;
for(int k=klim-1; k>=0; k--){
if(m_days_right[k][a] != -1 && b > m_days_right[k][a]){
a = m_days_right[k][a];
days += (1<<k);
}
}
return days + 1;
};
vector<int> ans(q);
for(int qq=0; qq<q; qq++){
int a, b;
cin >> a >> b;
a--;
b--;
if(a > b) swap(a, b);
ans[qq] = min_days(a, b, l);
}
for(int i=0; i<q; i++){
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll mod=1000000007;
const ll INF=1e15;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end())
#define pb push_back
#define mp make_pair
#define MODP(A,B) A=(A+B)%mod
typedef pair<ll,ll> P;
vec dx={1,0,-1,0};
vec dy={0,1,0,-1};
const ll MAXN=100001;
ll d[MAXN][20];
int main(){
ll N; cin>>N;
vec x(N);
rep(i,N) cin>>x.at(i);
ll Le; cin>>Le;
rep(i,MAXN) rep(j,20) d[i][j]=INF;
rep(i,N) d[i][0]=(upper_bound(ALL(x),x.at(i)+Le)-x.begin())-1;
rep(k,19){
if(d[0][k]==N-1) break;
rep(i,N) {
if(d[i][k]>=N-1) break;
d[i][k+1]=d[d[i][k]][k];
}
}
ll Q; cin>>Q;
vec ans;
rep(i,Q){
ll L,R; cin>>L>>R;
L--; R--;
if(L>R) swap(L,R);
ll A=0;
while(true){
if(d[L][0]>R) {A++; break;}
ll* x=upper_bound(d[L],d[L]+20,R);
ll X=(ll)(x-d[L])-1;
A+=(1<<X);
L=d[L][X];
if(L==R) break;
}
ans.pb(A);
}
rep(i,Q) cout<<ans.at(i)<<endl;
}
| 1 | 43,900,589 |
#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> pii;
typedef pair<int,pii> P;
typedef long long ll;
typedef pair<ll,ll> pll;
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;
const ll MOD=1e9+7;
struct edge{
int to;
int cost;
};
int main(){
int N,M;cin>>N>>M;
vector<int> A(M),B(M),C(M);
vector<vector<ll> > d(N,vector<ll>(N,INF));
for(int i=0;i<N;++i) d[i][i]=0;
for(int i=0;i<M;++i){
cin>>A[i]>>B[i]>>C[i];
A[i]--;B[i]--;
d[A[i]][B[i]]=d[B[i]][A[i]]=C[i];
}
for(int k=0;k<N;++k){
for(int i=0;i<N;++i){
for(int j=0;j<N;++j){
if(d[i][k]==INF||d[k][j]==INF) continue;
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
int ans=0;
for(int k=0;k<M;++k){
bool ok=true;
for(int i=0;i<N;++i){
for(int j=0;j<N;++j){
if(i==j) continue;
if(d[i][A[k]]+C[k]+d[B[k]][j]==d[i][j]){
ok=false;
}
}
}
if(ok) ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
#define rep(i,m,n) for(int i=m;i<n;i++)
int main(){
int n,m;
cin>>n>>m;
vector<P> edge[n];
rep(i,0,m){
int a,b,c;
cin>>a>>b>>c;
edge[a-1].push_back(P(b-1,c));
edge[b-1].push_back(P(a-1,c));
}
set<P> st;
rep(i,0,n){
int d[n];
rep(j,0,n) d[j]=1e5;
d[i]=0;
priority_queue<P,vector<P>,greater<P>> q;
q.push(P(0,i));
int prev[n];
rep(j,0,n) prev[j]=-1;
while(q.size()){
P p=q.top();
q.pop();
int v=p.second;
if(d[v]<p.first) continue;
for(P s:edge[v]){
if(d[s.first]>d[v]+s.second){
d[s.first]=d[v]+s.second;
q.push(P(d[s.first],s.first));
prev[s.first]=v;
}
}
}
rep(j,0,n){
if(j==i) continue;
int t=j;
for(;t!=i;t=prev[t]){
st.insert(P(t,prev[t]));
st.insert(P(prev[t],t));
}
}
}
cout<<m-st.size()/2<<endl;
}
| 1 | 11,013,187 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
const int N = 300005;
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
void cs(int &x)
{
cout << "Case #" << x << ": ";
}
bool cmp(string a, string b)
{
return a + b < b + a;
}
int32_t main()
{
fastIO;
int k,a,b;cin>>k>>a>>b;
int r=a%k;
if(r==0 || b%k==0)
cout<<"OK"<<endl;
else
{
if(a/k<b/k)
cout<<"OK"<<endl;
else
cout<<"NG"<<endl;
}
return 0;
}
|
#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 k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
}
| 1 | 93,587,188 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){int h,w; cin>>h>>w; char a[h][w]; int dp[h][w]; rep(i,h)rep(j,w) cin>>a[i][j],dp[i][j]=0; dp[0][0]=1; rep(i,h)rep(j,w){if(i>0) dp[i][j]+=dp[i-1][j];if(j>0) dp[i][j]+=dp[i][j-1];dp[i][j] %= 1000000007;if(a[i][j]=='#') dp[i][j]=0;} cout<<dp[h-1][w-1];}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl '\n'
#define pb push_back
const int N=1e5+1;
const int INF=1e9+7;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
char A[n][m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>A[i][j];
}
}
int dp[n][m];
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(A[i][j]=='.')
{
if(i==0 && j>0){dp[i][j]=(dp[i][j-1])%INF;}
else if(j==0 && i>0){dp[i][j]=(dp[i-1][j])%INF;}
else if(i>0 && j>0){dp[i][j]=(dp[i-1][j]+dp[i][j-1])%INF;}
}
}
}
cout<<dp[n-1][m-1];
}
| 1 | 23,758,183 |
#include<bits/stdc++.h>
using namespace std;
vector<long long>adj[100005];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
multiset<long long>mst,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
scanf("%lld %lld",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&a,&b);
adj[a].push_back(b);
}
for(i=1;i<=m;i++)
{
sz=adj[i].size();
for(j=0;j<sz;j++)
{
fr=adj[i][j]; mst.insert(fr);
}
if(!mst.empty())
{
d=*mst.rbegin(); ans=ans+d; mst.erase(mst.lower_bound(d));
}
}
printf("%lld\n",ans);
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
const int SIZE = 1e6+10;
VI d[SIZE];
int main(){
priority_queue<int>AA;
int N,M;
R(N,M);
FOR(i,1,N){
int x,y;
R(x,y);
d[x].PB(y);
}
LL an=0;
FOR(i,1,M){
for(int x:d[i])AA.push(x);
if(!AA.empty()){
an+=AA.top();
AA.pop();
}
}
W(an);
return 0;
}
| 1 | 40,168,547 |
#include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define mod 1000000007
#define pi 2*acos(0)
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
using namespace std;
int main()
{
io;
double d, t, s; cin >> d >> t >> s;
if (d / s <= t)cout << "Yes";
else cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
if (s * t >= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 1 | 79,647,476 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
const int INF = 1e6;
int main(void){
int n;
int cost[10][10];
while(cin>>n){
if(n==0) break;
REP(i,10)REP(j,10) cost[i][j] = INF;
REP(i,n){
int a,b,c;
cin>>a>>b>>c;
cost[a][b] = cost[b][a] = c;
}
REP(k,10)REP(i,10)REP(j,10)cost[i][j] = min(cost[i][j],cost[i][k]+cost[k][j]);
int ans = INF;
int ansi;
REP(i,10){
int tmp=0;
REP(j,10)tmp+=(cost[i][j]!=INF&&i!=j)?cost[i][j]:0;
if(tmp!=0&&ans>tmp){
ans = tmp;
ansi = i;
}
}
cout<<ansi<<" "<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef vector<P> vec;
typedef vector<vec> mat;
int main() {
int N;
while (cin >> N, N) {
mat m(10);
vector<vector<int> > dp(10, vector<int>(10, 1 << 28));
for (int i = 0; i < N; i++) {
int a, b, c;
cin >> a >> b >> c;
dp[a][b] = dp[b][a] = c;
dp[a][a] = 0;
dp[b][b] = 0;
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
dp[j][k] = min(dp[j][k], dp[j][i] + dp[i][k]);
}
}
}
int ans = 999999999;
int p;
for (int i = 0; i < 10; i++) {
if (dp[i][i] == 1 << 28) continue;
int sum = 0;
for (int j = 0; j < 10; j++) {
if (dp[i][j] != 1 << 28) sum += dp[i][j];
}
if (ans > sum) {
ans = sum;
p = i;
}
}
cout << p << " " << ans << endl;
}
return 0;
}
| 1 | 9,065,252 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define nl '\n'
int main()
{
optimize();
int n,l;
cin>>n>>l;
vector<string>v(n);
for(int i=0;i<n;i++)
{
string s;
cin>>s;
v.push_back(s);
}
sort(v.begin(),v.end());
for(auto u:v){
cout<<u;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> vec;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
vec.push_back(s);
}
sort(vec.begin(), vec.end());
string res;
for (string s : vec) {
res += s;
}
cout << res << endl;
return 0;
}
| 1 | 20,251,907 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int a[n];
M mp;
rep(i, n) {
cin >> a[i];
mp[a[i]]++;
mp[a[i] - 1]++;
mp[a[i] + 1]++;
}
int ans = 0;
rep(i, 1000005) ans = max(ans, mp[i]);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) (x).rbegin(), (x).rend()
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
map<int,int>val;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
val[x]++;
val[x-1]++;
val[x+1]++;
}
int ans=0;
for(auto t=val.begin();t!=val.end();t++){
ans=max(ans,t->second);
}
cout<<ans<<endl;
}
| 1 | 68,607,199 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i <= (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int k, s;
cin >> k>> s;
int count = 0;
rep(i, k){
rep(j, k){
int l = s - (i + j);
if (l >= 0 && l <= k){
++count;
}
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int K, S;
cin >> K >> S;
int cont = 0;
for (int X = 0; X <= K; X++)
{
for (int Y = 0; Y <= K; Y++)
{
int Z = S - X - Y;
if (Z >= 0 && Z <= K)
cont++;
}
}
cout << cont;
return 0;
}
| 1 | 28,318,032 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,m;
cin >> n >> m;
vector<pair<pair<ll,ll>, ll>> x(m);
for (ll i = 0; i < m; i++){
cin >> x[i].first.first >> x[i].first.second;
x[i].second = i;
}
sort(x.begin(), x.end());
ll c = 1;
x[0].first.second = 1;
for (ll i = 1; i < m; i++){
if (x[i].first.first == x[i-1].first.first){
c++;
}
else{
c = 1;
}
x[i].first.second = c;
}
vector<pair<ll,string>> y(m);
for (ll i = 0; i < m; i++){
y[i].first = x[i].second;
string s = to_string(x[i].first.first);
rep(j,(6-s.size())){
y[i].second.push_back('0');
}
rep(j,s.size()){
y[i].second.push_back(s[j]);
}
string t = to_string(x[i].first.second);
rep(j,(6-t.size())){
y[i].second.push_back('0');
}
rep(j,t.size()){
y[i].second.push_back(t[j]);
}
}
sort(y.begin(), y.end());
for (ll i = 0; i < m; i++){
cout << y[i].second << endl;
}
}
|
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#define INF 100000000000000
using namespace std;
typedef long long llong;
int main(){
llong N,M;
llong P,Y;
llong index=0;
llong rank;
cin >> N >> M;
vector<priority_queue<llong> > PQ_TABLE(N);
vector<pair<llong, llong> > ANS_TABLE(M);
map<llong, pair<llong, llong> > dict;
for(int i=0; i<M; i++){
cin >> P >> Y;
PQ_TABLE[P-1].push(Y);
dict[Y].first = P;
dict[Y].second = i;
}
for(int i=0; i<N; i++){
while(!PQ_TABLE[i].empty()){
rank = PQ_TABLE[i].size();
Y = PQ_TABLE[i].top();
PQ_TABLE[i].pop();
P = dict[Y].first;
ANS_TABLE[dict[Y].second].first = P;
ANS_TABLE[dict[Y].second].second = rank;
}
}
for(int i=0; i<M; i++){
printf("%06lld%06lld\n", ANS_TABLE[i].first, ANS_TABLE[i].second);
}
return 0;
}
| 1 | 90,034,555 |
#include<stdio.h>
int main(){for(int i=9;i<90;i++)printf("%dx%d=%d\n",i/9,i%9+1,i/9*(i%9+1));}
|
#include <iostream>
using namespace std;
int main(void){
int x,y,z;
for(x = 1; x < 10; x++){
for(y = 1; y < 10; y++){
z = x*y;
std::cout << x << "x"<< y << "=" <<z<< std::endl;
}
}
}
| 1 | 86,459,920 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
class Heap{
public:
Heap(){
array = new long long[2000000];
n = 0;
}
void insert(long long data){
array[n] = data;
int tmp = n;
while(tmp != 0 && array[tmp] > array[(tmp-1)/2]){
std::swap(array[tmp], array[(tmp-1)/2]);
tmp = (tmp-1)/2;
}
n++;
}
long long extract(){
int ret = array[0];
n--;
std::swap(array[0],array[n]);
int tmp = 0;
while(2*tmp+1 <= n-1){
if(2*tmp+2 <= n-1){
if(array[2*tmp+2] > array[tmp] && array[2*tmp+2] >= array[2*tmp+1]){
std::swap(array[2*tmp+2],array[tmp]);
tmp = 2*tmp+2;
}else if(array[2*tmp+1] > array[tmp] && array[2*tmp+1] >= array[2*tmp+2]){
std::swap(array[2*tmp+1],array[tmp]);
tmp = 2*tmp+1;
}else{
break;
}
}else{
if(array[tmp] < array[2*tmp+1]){
std::swap(array[tmp],array[2*tmp+1]);
tmp = 2*tmp+1;
}else{
break;
}
}
}
return ret;
}
private:
long long* array;
int n;
};
int main(){
long long insert_data;
char buf[22];
Heap heap;
while(true){
fgets(buf,22,stdin);
if(buf[2] == 'd') break;
if(buf[0] == 'i'){
insert_data = 0;
for(int i = 0; buf[i] != '\0';i++){
if(buf[i] >= '0' && buf[i] <= '9'){
insert_data = 10*insert_data + (buf[i] - '0');
}
}
heap.insert(insert_data);
}else{
printf("%lld\n",heap.extract());
}
}
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <ctime>
#include <cassert>
#include <random>
#include <cstring>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;
int main(){
int n;
string s;
priority_queue<int> pq;
while(1){
cin >> s;
if(s == "end") {
break;
} else if(s == "extract"){
cout << pq.top() << endl;
pq.pop();
} else if(s == "insert"){
cin >> n;
pq.push(n);
}
}
return 0;
}
| 1 | 8,947,748 |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
using P = pair<double, double>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mkp(a, b) make_pair(a, b)
ll mod = 1000000007LL;
int main() {
int n, k;
cin >> n >> k;
vector<int> vs(n);
rep(i, n) {
cin >> vs[i];
}
int ans = 0;
int max_l = min(k, n + 1);
rep(l, max_l + 1) {
vector<int> vrs;
int cur_k_l = k - l;
rep(i,l) {
vrs.push_back(vs[i]);
}
int max_r = min(cur_k_l, n - l);
rep(r, max_r + 1) {
int cur_k_r = cur_k_l - r;
vector<int> vrls = vrs;
rep(i, r) {
vrls.push_back(vs[vs.size() - i - 1]);
}
sort(vrls.begin(), vrls.end());
int total = 0;
rep(i, vrls.size()) {
if (cur_k_r > 0 && vrls[i] < 0) {
cur_k_r--;
continue;
}
total += vrls[i];
}
ans = max(total, ans);
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector v(n,0L);
for (int i=0; i<n; i++) cin >> v[i];
long ans = 0;
for (int i=0; i<=k; i++) {
for (int j=0; j<=k; j++) {
if (i+j>n || i+j>k) continue;
long sum = 0;
priority_queue<long, vector<long>, greater<>> pq;
for (int l=0; l<i; l++) {
sum += v[l];
pq.emplace(v[l]);
}
for (int l=0; l<j; l++) {
sum += v[n-1-l];
pq.emplace(v[n-1-l]);
}
ans = max(ans, sum);
for (int l=k; l>i+j; l--) {
if (pq.empty()) break;
sum -= pq.top(); pq.pop();
ans = max(ans, sum);
}
}
}
cout << ans << endl;
}
| 1 | 9,875,890 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void){
int n=0, ph=0, pt=0;
string ct, ch;
cin >> n;
for(int i=0;i<n;i++) {
cin >> ct >> ch;
if(ct == ch) {
pt++;
ph++;
continue;
}
for(int j=0;j<fmin(ct.size(), ch.size());j++) {
if(ct[j] < ch[j]) {
ph += 3;
break;
} else if (ct[j] > ch[j]) {
pt += 3;
break;
}
if(j == fmin(ct.size(), ch.size()) - 1) {
if(ct.size() < ch.size()) {
ph += 3;
} else {
pt += 3;
}
}
}
}
cout << pt << " " << ph << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
string taro, hanako;
int x1 = 0, x2 = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> taro >> hanako;
if(taro == hanako){
x1++;
x2++;
}
else if(taro < hanako) x2 += 3;
else x1 += 3;
}
cout << x1 << " " << x2 << endl;
return 0;
}
| 1 | 98,575,271 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = 1e9+7;
const double EPS = 1e-9;
int main() {
ll H, W; cin >> H >> W;
ll ans = 1e10;
rep(tmp,(1<<3)) {
bitset<3> s(tmp);
vl area(3);
ll Hs = H, Ws = W;
if (s.test(0)) {
area[0] = (H/3 + s[1]) * W;
Hs -= H/3 + s[1];
} else {
area[0] = (W/3 + s[1]) * H;
Ws -= W/3 + s[1];
}
if (s.test(2)) {
area[1] = (Hs/2) * Ws;
} else {
area[1] = (Ws/2) * Hs;
}
area[2] = H*W - area[0] - area[1];
sort(all(area));
ans = min(ans, area[2]-area[0]);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define FOR(i,n) for (int i=0;i < n ; i++)
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
ll INF=1e9+7;
int main(){
ll h , w,a,b,c;
cin >> h >> w;
ll ans=INF;
for(ll i=1; i <h; i++){
a=i*w;
b=(w/2) *(h-i);
c=w*h-a-b;
ll x=min(min(a,b),c);
ll y=max(max(a,b),c);
ans=min(ans,y-x);
b=(h-i)/2 * w;
c=w*h-a-b;
x=min(min(a,b),c);
y=max(max(a,b),c);
ans=min(ans,y-x);
}
for(ll j=1; j <w;j++){
a=j*h;
b=(h/2) *(w-j);
c=w*h-a-b;
ll x=min(min(a,b),c);
ll y=max(max(a,b),c);
ans=min(ans,y-x);
ans=min(ans,w*h-3*h*(w/3));
b=(w-j)/2 * h;
c=w*h-a-b;
x=min(min(a,b),c);
y=max(max(a,b),c);
ans=min(ans,y-x);
}
if(h%3==0 || w%3==0) ans=0;
cout << ans;
return 0;
}
| 1 | 44,160,126 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin>>k;
long a,b,c;
a=k/50+50;
b=k%50;
c=a-b-1;
int x[55]={0};
int xx=0;
cout<<50<<endl;
for(int i=0;i<50;i++)
{
if(i<b)
{
if(i==0)
cout<<a;
else
cout<<" "<<a;
x[xx]=a;
}
else
{
if(i==0)
cout<<c;
else
cout<<" "<<c;
x[xx]=c;
}
xx++;
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define fi first
#define se second
#define int long long
signed main(){
int K;cin>>K;
if(K<1000){
Cout(2);
int a=K/2+1,b=K/2+1;
if(K%2){a++;b--;}
cout<<a<<" "<<b<<endl;
}
else{
Cout(50);
std::vector<int> v(50,K/50);
for(int i=0;i<50;i++)v[i]+=i;
for(int i=0;i<K%50;i++){
for(int j=0;j<50;j++){
if(j==i)v[j]+=50;
else v[j]--;
}
}
for(int i=0;i<50;i++){
if(i)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
}
| 1 | 44,202,932 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
for (int i = 0; i < b; i++) {
for (int j = 0; j < a; j++) {
cout << "0";
}
for (int j = 0; j < w - a; j++) {
cout << "1";
}
cout << endl;
}
for (int i = 0; i < h - b; i++) {
for (int j = 0; j < a; j++) {
cout << "1";
}
for (int j = 0; j < w - a; j++) {
cout << "0";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<ll>> ans(H, vector<ll>(W, 1));
for (ll i = 0; i < B; ++i) {
for (ll j = 0; j < W; ++j) {
ans.at(i).at(j) = (ans.at(i).at(j) + 1) % 2;
}
}
for (ll i = 0; i < H; ++i) {
for (ll j = 0; j < A; ++j) {
ans.at(i).at(j) = (ans.at(i).at(j) + 1) % 2;
}
}
for (ll i = 0; i < H; ++i) {
for (ll j = 0; j < W; ++j) {
cout << ans.at(i).at(j);
}
cout << endl;
}
}
| 1 | 63,986,113 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int H,W;
cin >> H >> W;
vector<string> C(H);
REP(i,H)cin >> C[i];
REP(i,H){
cout << C[i] << "\n";
cout << C[i] << "\n";
}
}
|
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
bool is_integer( float x ){
return floor(x)==x;
}
int main() {
char ch[101][101];
int h,w;
cin >> h >> w;
for(int i = 0; i < h; i ++){
for(int j = 0; j < w; j ++){
cin >> ch[i][j];
}
}
for(int i = 0; i < h; i ++){
for(int k = 0; k < 2; k ++) {
for (int j = 0; j < w; j++) {
cout << ch[i][j];
}
cout << endl;
}
}
return 0;
}
| 1 | 64,527,154 |
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int A, P; cin >> A >> P;
cout << (A * 3 + P) / 2;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n,m;cin>>n>>m;
cout<<(n*3+m)/2<<endl;
}
| 1 | 53,316,862 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.