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 all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
if((abs(a-b)<=d&&abs(b-c)<=d)||abs(a-c)<=d) cout<<"Yes";
else cout<<"No";
re 0;
} | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
ll Q, A, B;
void solve() {
cin >> Q;
while(Q--) {
cin >> A >> B;
if(A > B) swap(A, B);
if(B - A <= 1) cout << 2 * A - 2 << "\n";
else {
ll C = ll(sqrt(A * B) - eps);
if(C * (C + 1) >= A * B) cout << 2 * C - 2 << "\n";
else cout << 2 * C - 1 << "\n";
}
}
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
} | 0 | 2,241,011 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll w, h;
cin >> w >> h;
vector<ll> lp(w), lq(h);
for (ll &p: lp) cin >> p;
for (ll &q: lq) cin >> q;
sort(lp.begin(), lp.end());
sort(lq.begin(), lq.end());
lp.push_back(1e10);
lq.push_back(1e10);
int ip = 0, iq = 0;
ll ans = 0;
while (ip < w || iq < h) {
if (lp[ip] <= lq[iq]) {
ans += (h-iq+1)*lp[ip];
++ip;
}
else {
ans += (w-ip+1)*lq[iq];
++iq;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int set=0;
int max=10;
vector<int> a(5);
for(int i=0;i<5;i++){
cin >> a[i];
if(max>a[i]%10 && a[i]%10!=0){
max=a[i]%10;
set=i;
}
}
int ans=0;
for(int i=0;i<5;i++){
if(i!=set && a[i]%10) a[i]=a[i]/10*10+10;
ans+=a[i];
}
cout << ans << endl;
} | 0 | 100,127,014 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n, m, p, total, ans;
while(true){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){
break;
}
vector<int> x(n, 0);
for(int i = 0; i < n; i++){
cin >> x[i];
}
total = 0;
for(int i = 0; i < n; i++){
total = total + x[i];
}
total = total * 100;
if(x[m - 1] == 0){
cout << 0 << endl;
continue;
}
int rem = (total * (100 - p)) / 100;
cout << rem / x[m-1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
const int INFTY =2147483647;
int main(){
ll n,k,s=0,m=0,ans=0;
cin>>n>>k;
FOR(i,1,k){
s+=i-1;
m+=n-i+1;
}
FOR(i,k,n+2){
s+=i-1;
m+=n-i+1;
ans=(ans+(m-s)+1)%MOD;
}
cout<<ans<<endl;
} | 0 | 30,084,591 |
#include<iostream>
#include<cstdio>
using namespace std;
int main () {
int N;
int A[100];
double ans=0;
cin >> N;
for (int i=0; i<N; i++) {
cin >> A[i];
ans+=(double)1.0/A[i];
}
printf("%.10lf\n", 1.0/ans);
} | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
if (s[0] == 'W' || s[n * 2 - 1] == 'H') {
cout << 0 << endl;
return 0;
}
bool left_right[n * 2] = {};
left_right[0] = true;
repd(i, 1, 2 * n) {
if (s[i] == s[i - 1]) {
left_right[i] = !left_right[i - 1];
} else {
left_right[i] = left_right[i - 1];
}
}
ll count = 0;
rep(i, 2 * n) {
if (left_right[i]) {
count++;
} else {
count--;
}
}
if (count != 0) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
rep(i, 2 * n) {
if (left_right[i]) {
count++;
} else {
ans *= count;
count--;
ans %= mod;
}
}
ll base = 1;
repd(i, 1, n + 1) {
base *= i;
base %= mod;
}
ans *= base;
ans %= mod;
cout << ans << endl;
return 0;
} | 0 | 40,185,420 |
#include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s, t;
std::cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if (s < t) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
while (cin >> n,n) {
int Sum = 0;
int Max = -1;
int Min = 1001;
for (int i = 0; i < n; i++) {
int a; cin >> a;
Sum += a; Max = max(Max, a); Min = min(Min, a);
}
Sum -= Max + Min;
cout << Sum / (n - 2) << endl;
}
} | 0 | 81,427,682 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
int MAX=0, pre_MAX=0;
int max_ids=0, pre_ids=0;
for(int i=0;i<n;i++){
cin >> a[i];
if(a[i]>MAX){
pre_MAX = MAX; pre_ids = max_ids;
MAX = a[i]; max_ids = i;
}else if(a[i]==MAX){
pre_MAX = MAX; pre_ids = i;
}else if(a[i] > pre_MAX){
pre_MAX = a[i]; pre_ids = i;
}
}
for(int i=0; i<n; i++){
if(i == max_ids)
cout << pre_MAX << endl;
else
cout << MAX << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, k; cin >> n >> k;
int r, s, p; cin >> r >> s >> p;
string t; cin >> t;
ll ans = 0;
V<char> memo(n);
for(int i = 0; i < n; i++){
if(t[i] == 'r'){
if(i - k < 0 || (0 <= i - k && memo[i - k] != 'p')){
ans += p;
memo[i] = 'p';
}else if(n <= i + k || (i + k < n && t[i + k] != 's')){
memo[i] = 'r';
}else{
memo[i] = 's';
}
}
if(t[i] == 's'){
if(i - k < 0 || (0 <= i - k && memo[i - k] != 'r')){
ans += r;
memo[i] = 'r';
}else if(n <= i + k || (i + k < n && t[i + k] != 'p')){
memo[i] = 's';
}else{
memo[i] = 'p';
}
}
if(t[i] == 'p'){
if(i - k < 0 || (0 <= i - k && memo[i - k] != 's')){
ans += s;
memo[i] = 's';
}else if(n <= i + k || (i + k < n && t[i + k] != 'r')){
memo[i] = 'p';
}else{
memo[i] = 'r';
}
}
}
cout << ans << endl;
return 0;
} | 0 | 40,892,925 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
#define MODSIZE 1000000007
ll reppow(ll x,ll n){
ll rep = 1;
while(n > 0){
if(n & 1) rep = (rep*x) % MODSIZE;
x = x*x % MODSIZE;
n >>= 1;
}
return rep;
}
int main(){
int x;
int y;
int n;
ll a,b;
scanf("%d %d", &x, &y);
if((x + y) % 3 != 0){
printf("0\n");
return 0;
}
n = (x + y)/3;
x -= n;
y -= n;
if(x < 0 || y < 0){
printf("0\n");
return 0;
}
a = 1; b = 1;
int i;
for(i = 0;i < x;i++){
a = (a*(x + y - i)) % MODSIZE;
b = (b*(i + 1)) % MODSIZE;
}
b = reppow(b,MODSIZE - 2);
ll ans;
ans = (a*b) % MODSIZE;
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
void Main();
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
Main();
#ifdef LOCAL
cout << "\nTime: " << (int)ceil((double)1000 * clock() / CLOCKS_PER_SEC) << " ms";
#endif
}
const int MOD = (int)1e9 + 7;
int n;
vector<int> p2(60), cnt_one(60, 0), cnt_zero(60, 0);
int ans = 0;
inline int mult(int a, int b) {
return 1ll * a * b % MOD;
}
inline int add(int a, int b) {
a += b;
if (a >= MOD) {
a -= MOD;
}
return a;
}
void Main() {
p2[0] = 1;
for (int i = 1; i < 60; i++) {
p2[i] = mult(p2[i - 1], 2);
}
cin >> n;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
for (ll bit = 0; bit < 60; bit++) {
if (a & (1ll << bit)) {
ans = add(ans, mult(cnt_zero[bit], p2[bit]));
cnt_one[bit]++;
} else {
ans = add(ans, mult(cnt_one[bit], p2[bit]));
cnt_zero[bit]++;
}
}
}
cout << ans << '\n';
} | 0 | 10,154,788 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int ans=s.size(),n=s.size();
rep(i,2){
int cnt=0;
rep(j,n){
if(j%2==0&&s[j]!=(char)(i+'0'))cnt++;
if(j%2==1&&s[j]==(char)(i+'0'))cnt++;
}
ans=min(ans,cnt);
}
cout<<ans<<endl;
} | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(1, 1E8); \
auto rnd = bind(__dis, __gen)
const int INF = 1E18;
const int mod = 1E9 + 7;
const int maxn = 100 + 5;
int32_t main() {
fastIO();
int n, gcd = 0, lst, now;
cin >> n >> lst;
while (n--) cin >> now, gcd = __gcd(gcd, abs(lst - now)), lst = now;
cout << gcd << "\n";
return 0;
} | 0 | 65,270,972 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int main(){
vector<bool> c(1000001,0) ;
int s ;
cin >> s ;
int ans = 1 ;
c.at(s) = 1 ;
while (1)
{
if (s % 2 == 0)
{
s /= 2 ;
}else
{
s = 3*s + 1 ;
}
ans ++ ;
if (c.at(s) == 1)
{
break ;
}else
{
c.at(s) = 1 ;
}
}
cout << ans << endl ;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
string s; cin >> s;
ll n = s.size();
ll sum = 0;
rep(i,n){
ll a = s[i] - '0';
sum += a;
}
if(sum % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 | 50,192,161 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll S;
cin >> S;
ll x1 = 0, y1 = 0;
ll x2 = 1e9, y2 = 1;
ll x3, y3;
if (S==1e18) x3 = 0, y3 = 1e9;
else {
y3 = S / (int)1e9 + 1;
x3 = 1e9 - S % (int)1e9;
}
cout << x1 << " " << y1 << " ";
cout << x2 << " " << y2 << " ";
cout << x3 << " " << y3 << "\n";
} | #include <iostream>
using namespace std;
int main(){
int g[1001][1001]={{0}};
int n,a,b,c;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a >> b ;
for (int i = 0; i < b; ++i)
{
cin >> c;
g[a-1][c-1]=1;
}
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (j==n-1)
{
cout << g[i][j] << endl;
}else{
cout << g[i][j] <<" ";
}
}
}
} | 0 | 99,217,394 |
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
#define MAX_N 1000005
const int INF = 0x3f3f3f3f;
int prime[1000000];
int c[MAX_N];
void Prime_creat()
{
int i,j;
for(i=2; i<=1000000; i++)
{
if(prime[i])
{
c[i] = c[i - 1] + 1;
for(j=i+i; j<=1000000; j+=i)
prime[j]=0;
}
else
{
c[i] = c[i - 1];
}
}
}
int main()
{
memset(prime, 1, sizeof(prime));
Prime_creat();
int n;
while(~scanf("%d", &n))
{
printf("%d\n", c[n]);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
bool search();
int ans[100009];
int n;
string s;
int main(){
cin>>n>>s;
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
memset(ans,0,sizeof(ans));
ans[0]=i;
ans[1]=j;
if(search()){
for(int k=0;k<n;k++){
if(ans[k]==0){
cout<<'S';
}
else{
cout<<'W';
}
}
cout<<endl;
return(0);
}
}
}
cout<<-1<<endl;
return(0);
}
bool search(){
for(int i=2;i<n;i++){
if(ans[i-1]==0){
if(s[i-1]=='o'){
ans[i]=ans[i-2];
}
else{
ans[i]=!ans[i-2];
}
}
else{
if(s[i-1]=='o'){
ans[i]=!ans[i-2];
}
else{
ans[i]=ans[i-2];
}
}
}
int cnt=0;
if(ans[0]==0){
if(s[0]=='o'&&ans[n-1]==ans[1])cnt++;
else if(s[0]=='x'&&ans[n-1]!=ans[1])cnt++;
}
else{
if(s[0]=='o'&&ans[n-1]!=ans[1])cnt++;
else if(s[0]=='x'&&ans[n-1]==ans[1])cnt++;
}
if(ans[n-1]==0){
if(s[n-1]=='o'&&ans[n-2]==ans[0])cnt++;
else if(s[n-1]=='x'&&ans[n-2]!=ans[0])cnt++;
}
else{
if(s[n-1]=='o'&&ans[n-2]!=ans[0])cnt++;
else if(s[n-1]=='x'&&ans[n-2]==ans[0])cnt++;
}
if(cnt==2)return true;
else return false;
} | 0 | 37,957,974 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long long N;
vector<long long> P;
vector<long long> Q;
int main(){
cin >> N;
rep(i, N) {
long long tmp;
cin >> tmp;
P.push_back(tmp);
}
rep(i, N) {
long long tmp;
cin >> tmp;
Q.push_back(tmp);
}
vector<long long> arr;
rep(i, N) {
arr.push_back(i+1);
}
long long idx = 0;
long long pidx = -1;
long long qidx = -1;
do {
bool pok = true;
rep(i, N) {
if(arr[i] != P[i]) {
pok = false;
}
}
if(pidx == -1 && pok) {
pidx = idx;
}
bool qok = true;
rep(i, N) {
if(arr[i] != Q[i]) {
qok = false;
}
}
if(qidx == -1 && qok) {
qidx = idx;
}
idx++;
} while (std::next_permutation(arr.begin(), arr.end()));
cout << abs(pidx - qidx) << endl;
} | #include <iostream>
#include <algorithm>
using namespace std;
double check(double x1, double y1, double x2, double y2, double x3, double y3){
double ab = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
double bc = sqrt((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3));
double ca = sqrt((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));
double s = (ab + bc + ca) * 0.5;
double S = sqrt(s * (s - ab) * (s - bc) * (s - ca));
return S;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
double x1, y1, x2, y2, x3, y3, xp, yp;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
double abc = check(x1, y1, x2, y2, x3, y3);
double abp = check(x1, y1, x2, y2, xp, yp);
double bcp = check(x2, y2, x3, y3, xp, yp);
double cap = check(x3, y3, x1, y1, xp, yp);
double var = abc - (abp + bcp + cap);
if(var <= 0.001 && var >= -0.001){
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
return 0;
} | 0 | 7,628,965 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <random>
#include <time.h>
#include <fstream>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define all(c) begin(c),end(c)
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
void print(vec v){for(auto e:v)cout<<e<<" ";cout<<endl;}
void print(vecll v){for(auto e:v)cout<<e<<" ";cout<<endl;}
void print(map<int,int> mp){for(auto e:mp)cout<<e.first<<" "<<e.second<<endl;cout<<endl;}
#define INF 1e9+7
#define LLINF 1e18+7
#define N 250000
const ll MOD=998244353;
main(){
int n=in(),k=in();
vecll a;
rep(i,n){
a.pb(in());
}
ll ans=0;
vecll l,r;
l.pb(0);
rep(i,n){
l.pb(l.back()+max(0ll,a[i]));
}
r.pb(0);
rep3(i,n-1,0)r.pb(r.back()+max(0ll,a[i]));
reverse(all(r));
ll tmp=0;
rep(i,k)tmp+=a[i];
rep(i,n-k+1){
ans=max(ans,max(0ll,tmp)+l[i]+r[i+k]);
tmp-=a[i];
tmp+=a[i+k];
}
cout<<ans;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
int main()
{
int n;
cin >> n;
vector<int> p(n);
rep(i, n)
{
cin >> p[i];
p[i]--;
}
vector<int> a(n), b(n);
rep(i, n)
{
a[i] = i * n + 1;
b[i] = n * n - i * n + 1;
}
rep(i, n)
{
a[p[i]] += i;
}
rep(i, n)
{
cout << a[i] << " ";
}
cout << endl;
rep(i, n)
{
cout << b[i] << " ";
}
cout << endl;
return 0;
} | 0 | 77,568,234 |
#include<iostream>
#include<algorithm>
#define ll long long int
using namespace std;
const int maxn=300005;
int N,A,B;
int res[maxn];
int main()
{
int con;
bool flag=true,change=false;
cin>>N>>A>>B;
if (B>N-A+1||(ll)A*(ll)B<(ll)N)cout<<-1<<endl;
else
{
for (int i=N-A+1;i<=N;i++)cout<<i<<" ";
while (1)
{
N-=A;
B--;
if (!N&&!B)break;
A=N%B==0?N/B:N/B+1;
for (int i=N-A+1;i<=N;i++)cout<<i<<" ";
}
cout<<endl;
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long int n;
cin>>n;
vector<long long int >v(n);
for(long long int i=0;i<n;i++){
cin>>v[i];
}
long long int result=0;
for(long long int i=0;i<n;i++)
{
v[i]=v[i]-i-1;
}
sort(v.begin(),v.end());
long long int f=v[n/2];
if(n%2==0){
f=(v[n/2]+v[n/2-1])/2;
}
long long int finalresult=0;
for(long long int i=0;i<n;i++)
{
finalresult+=abs(v[i]-f);
}
cout<<finalresult;
} | 0 | 42,200,537 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define sfi1(v) scanf("%d",&v)
#define sfi2(v1, v2) scanf("%d %d",&v1,&v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d",&v1,&v2,&v3)
#define sfll1(v) scanf("%I64d",&v);
#define sfll2(v1, v2) scanf("%I64d %I64d",&v1,&v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
#define endl '\n'
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
ll arr[N];
int n;
bool valid(ll step) {
if (step < 0)return 0;
ll extra = 0;
loop(i, n) {
ll val = arr[i] + step - (n - 1);
if (val > 0) {
ll d = n + 1;
extra += (val + d - 1) / d;
}
}
return extra <= step;
}
ll bs(ll st, ll ed) {
while (st < ed) {
ll mid = st + (ed - st) / 2;
bool flag = false;
loop(i, n + 1)flag |= valid(mid - i);
if (flag)
ed = mid;
else
st = mid + 1;
}
return st;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
loop(i, n)cin >> arr[i];
cout << bs(0, 1e18) << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <utility>
#include <string>
using namespace std;
int main() {
int n, k; cin >> n >> k;
string s;
cin >> s;
int i = 0, c0 = 0;
vector<pair<int, int> > v;
if (s[0] == '0')
v.push_back(pair<int,int>(1, 0));
while (i < n) {
int start = i;
while (i+1 < n && s[i] == s[i+1])
i++;
if (s[start] == '0')
c0++;
v.push_back(pair<int,int>(s[start], i-start+1));
i++;
}
if (s[n-1] == '0')
v.push_back(pair<int,int>(1, 0));
k = min(k, c0);
vector<int> sum(2*c0+2, 0);
for (int i = 0; i < 2*c0+1; i++) {
sum[i+1] = sum[i] + v[i].second;
}
int ans = 0;
for (int i = 2*k+1; i <= 2*c0+1; i += 2) {
ans = max(ans, sum[i]-sum[i-2*k-1]);
}
cout << ans << endl;
return 0;
} | 0 | 49,626,228 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char c[1200];
fgets(c,1200,stdin);
for (int i = 0;i<1200;i++){
if (c[i] == '\n') break;
if (islower(c[i])) c[i] = toupper(c[i]);
else if (isupper(c[i])) c[i] = tolower(c[i]);
printf("%c",c[i]);
}
printf("\n");
return 0;
} | #include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(#x".in", "r", stdin),freopen(#x".out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef queue <pii> qii ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
template <class T> void chmin(T &a, T b) { if (a > b) a = b ; }
template <class T> void chmax(T &a, T b) { if (a < b) a = b ; }
template <class T> void upd(T &a, T b) { (a += b) %= MOD ; }
template <class T> void mul(T &a, T b) { a = (ll) a * b % MOD ; }
signed main(){
int a, b, c ; scanf("%d%d%d", &a, &b, &c) ;
if (a == b && b == c) PRINT("Yes") ;
else PRINT("No") ;
return 0 ;
} | 0 | 52,124,625 |
#include<iostream>
using namespace std;
int main(){
int A[3][3],N,bingo[3][3];
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
cin >> A[i][j];
bingo[i][j]=0;
}
}
cin >> N;
for (int k = 0; k < N; k++){
int b;
cin >> b;
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
if(A[i][j]==b){
bingo[i][j]=1;
}
}
}
}
int flg=0;
for (int i = 0; i < 3; i++){
if(bingo[i][0]==1 && bingo[i][1]==1 && bingo[i][2] == 1){
flg=1;
}
if(bingo[0][i]==1 && bingo[1][i]==1 && bingo[2][i] == 1){
flg=1;
}
}
if(bingo[0][0]==1 && bingo[1][1]==1 && bingo[2][2] == 1){
flg=1;
}
if(bingo[0][2]==1 && bingo[1][1]==1 && bingo[2][0] == 1){
flg=1;
}
if(flg==1){
printf("Yes\n");
}else{
printf("No\n");
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
using namespace std;
#define i64 long long
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807
#define MOD 1000000007
void solve()
{
int N,K;
cin>>N>>K;
vector<int> data(N+1,0);
for (int i = 0; i < N; i++)
{
cin>>data[i+1];
}
vector<vector<int> > DP(N+1,vector<int>(N+1,I64_MAX/4));
DP[0][0] = 0;
for (int i = 0; i < N+1; i++)
{
DP[i][0] = 0;
}
for(int i=1;i<=N;++i){
DP[i][1]=data[i];
}
for (int i = 1; i <= N; i++)
{
for (int j = 2; j <= N; j++)
{
for (int x = 1; x < i; x++)
{
DP[i][j] = min(DP[i][j],DP[x][j-1] + max((int)0,data[i]-data[x]));
}
}
}
int ANS = I64_MAX;
for (int i = 0; i <=N; i++)
{
ANS = min(ANS,DP[i][N-K]);
}
cout<<ANS<<endl;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} | 0 | 83,007,763 |
#include<stdio.h>
long long int abs_1(long long int i){
if(i<0) return -i;
else return i;
}
int main()
{
int N,i,j;
long long int sum1=0,sum=0;
scanf("%d",&N);
long long int a[200000]={0},x,min=2e+9;
for(i=0;i<N;i++)
{
scanf("%lld",&a[i]);
sum+=a[i];
}
for(i=0;i<N-1;i++)
{
sum1+=a[i];
x=abs_1(2*sum1-sum);
if(x<=min)
{
min=x;
}
}
printf("%lld",min);
return 0;
} | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
const int N = (int)3e5;
ll mpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
if(kaijo_memo.size() > n) return kaijo_memo[n];
if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
return gyaku_kaijo_memo[n];
}
ll nCr(ll n, ll r){
if(n == r) return 1;
if(n < r || r < 0) return 0;
ll ret = 1;
ret *= kaijo(n); ret %= MOD;
ret *= gyaku_kaijo(r); ret %= MOD;
ret *= gyaku_kaijo(n-r); ret %= MOD;
return ret;
}
int main(void){
fast_io
int n,k;cin>>n>>k;
ll a[n];
rep(i,n){
cin>>a[i];
}
vector<ll> b;
rep(i,n){
ll sum = 0;
rep(j,n){
if(j<i) continue;
sum += a[j];
b.push_back(sum);
}
}
ll ans = 0;
REP(bit, 50){
ans = ans<<1;
ll count = 0;
vector<ll> b2;
rep(i,b.size()){
if((b[i]>>bit)&1){
count++;
b2.push_back(b[i]);
}
}
if(count >= k){
b = b2;
ans += 1;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 78,768,356 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, m, v, p, a[maxn];
ll sum[maxn];
int check(int x)
{
if (a[x] + m < a[p]) return 0;
return (ll)(a[x] + m) * (x - p) - (sum[x - 1] - sum[p - 1]) >= (ll)m * (v - (p - 1) - (n - x + 1));
}
int main()
{
scanf("%d%d%d%d", &n, &m, &v, &p);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sort(a + 1, a + n + 1, greater<int>());
for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + a[i];
int l = p, r = n, mid;
while (l < r) {
mid = (l + r + 1) >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
printf("%d\n", l);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
ll l=1000000007;
string alphabet="abcdefghijklmnopqrstuvwxyz";
int main() {
string s; cin>>s;
if(s.size()!=26){
cout<<s;
rep(i,26){
if(count(s.begin(),s.end(),alphabet[i])==0){
cout<<alphabet[i]; break;
}
}
}
else{
if(s=="zyxwvutsrqponmlkjihgfedcba"){cout<<-1;}
else{
rep(i,25){
if(s[25-i]>s[24-i]){
rep(j,24-i){cout<<s[j];}
for(int j=25; j>=25-i; j--){
if(s[j]>s[24-i]){cout<<s[j]; break;}
}
break;
}
}
}
}
} | 0 | 22,557,226 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0;i<n;i++) cin >> a.at(i);
for(int i=0;i<m;i++) cin >> b.at(i);
int ans=0;
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
int k=1;
for(int y=0;y<m;y++){
for(int x=0;x<m;x++){
k*=(a.at(y+i).at(x+j)==b.at(y).at(x));
}
}
ans+=k;
}
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
vector<ll> a, p;
ll dfs(ll n, ll x) {
if (n == 0)
return x <= 0 ? 0 : 1;
else if (x <= a[n - 1] + 1)
return dfs(n - 1, x - 1);
else
return p[n - 1] + 1 + dfs(n - 1, x - 2 - a[n - 1]);
}
int main() {
ll n, x;
cin >> n >> x;
a.push_back(1), p.push_back(1);
rep(i, n) {
a.push_back(a[i] * 2 + 3);
p.push_back(p[i] * 2 + 1);
}
cout << dfs(n, x) << endl;
return 0;
} | 0 | 21,247,973 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n,len;
char c[100000];
char ans[100000];
while (cin >> n, n) {
for (int i = 0; i < 2 * n; i += 2) {
cin >> c[i] >> c[i + 1];
}
cin >> len;
for (int i = 0; i < len; i++) {
cin >> ans[i];
for (int j = 0; j < 2 * n; j += 2) {
if (ans[i] == c[j]) {
ans[i] = c[j + 1];
break;
}
}
}
for (int i = 0; i < len; i++) {
cout << ans[i];
}
cout << endl;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
constexpr ll MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
#define rep(i, N) for(ll i=0; i<(N); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b) { a = b; return 1; } else { return 0; }}
template<class T> inline bool chmin(T& a, T b) { if(a > b) { a = b; return 1; } else { return 0; }}
ll max(ll a, ll b) {return a < b ? b : a; }
ll min(ll a, ll b) {return a > b ? b : a; }
double maxf(double a, double b) { return a < b ? b : a; }
template<typename T> inline string toString(const T &a) {
ostringstream oss; oss << a; return oss.str();
}
ll gcd(ll x, ll y) { return x % y ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll repeatSquaring(ll n, ll p, ll mod) {
if(p == 0) return 1;
if(p % 2 == 0) {
ll t = repeatSquaring(n, p / 2, mod);
return t * t % mod;
} else {
return (n * repeatSquaring(n, p - 1, mod)) % mod;
}
}
ll comb(ll n, ll k, ll mod) {
ll res = 1;
rep(i, k) res = res * (n - i) % mod;
ll bunbo = 1;
rep(i, k) bunbo = bunbo * (k - i) % mod;
res = (res * repeatSquaring(bunbo, mod - 2, mod)) % mod;
return res;
}
int main() {
ll N, K;
cin >> N >> K;
int ma = (N-1)*(N-2) / 2;
if(ma < K) cout << -1 << endl;
else {
vector<pair<ll, ll>> edges;
for(int i = 1; i <= N - 1; ++i) {
edges.push_back(make_pair(i, N));
}
int rem = ma - K;
int ci = 1, cj = 2;
for(int _ = 0; _ < rem; ++_) {
edges.push_back(make_pair(ci, cj));
++cj;
if(cj == N) {
++ci;
cj = ci + 1;
}
}
cout << edges.size() << endl;
for(auto edge : edges) {
cout << (edge.first) << " " << (edge.second) << endl;
}
}
} | 0 | 32,405,140 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll k,a,b;
cin >> k >> a >> b;
if(k <= a || a >= b - 1)cout << k + 1<< endl;
else{
ll res = 0;
res = a;
k -= a - 1;
res += (k / 2) * (b - a);
if(k % 2 == 1)res++;
cout << res << endl;
}
} | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define mx 1003
char S[mx],T[mx];
int main(){
scanf("%s",S);
scanf("%s",T);
int ns=strlen(S);
int nt=strlen(T);
int ans=1e9;
for(int i=0;i<=ns-nt;i++){
int del=0;
for(int j=0;j<nt;j++){
if(S[i+j]!=T[j]) del++;
}
ans=min(ans,del);
}
printf("%d\n",ans);
} | 0 | 82,134,723 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int n, taro = 0, hanako = 0;
cin >> n;
for(int i = 0; i < n; i++){
string t, h;
cin >> t >> h;
if(t > h) taro += 3;
else if(t < h) hanako += 3;
else {taro += 1; hanako += 1;}
}
cout << taro << " " << hanako << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int H,N,A;
cin >> H >> N;
for(int i=0;i<N;i++){
cin >> A;
H -= A;
if(H <= 0){
cout << "Yes" <<endl;
return 0;
}
}
cout << "No" <<endl;
} | 0 | 9,240,628 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
const int INFTY =2147483647;
int main(){
int s,w;
cin>>s>>w;
string ans ="safe";
if(s<=w) ans="unsafe";
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i=0; i<M; ++i)
{
int a, b;
cin >> a >> b;
G[a-1].push_back(b-1);
G[b-1].push_back(a-1);
}
vector<int> dist(N, -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty())
{
int v = que.front();
que.pop();
for (int nv : G[v])
{
if (dist[nv]!=-1) continue;
dist[nv] = v;
que.push(nv);
}
}
cout << "Yes" << endl;
for (int v = 1; v < N; v++) cout << dist[v]+1 << endl;
} | 0 | 28,026,239 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(),x.end()
#define fi first
#define se second
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;cin>>n>>k;
vec s(n+1);
rep(i,k){
int d;
cin>>d;
rep(j,d){
int a;
cin>>a;
s[a]++;
}
}
int cnt=0;
rep1(i,n){
if(s[i]==0){
cnt++;
}
}
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
long long a[NMAX], sol, b[NMAX];
int n;
int main()
{
cin >> n;
for(int i = 1; i <= n + 1; i++) {
cin >> b[i];
}
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= n; i++) {
long long minim = min(a[i], b[i]);
sol += minim;
a[i] -= minim;
b[i] -= minim;
minim = min(a[i], b[i + 1]);
sol += minim;
a[i] -= minim;
b[i + 1] -= minim;
}
cout << sol;
return 0;
} | 0 | 85,449,398 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, h[100100], cost[100200]={0}, k, i;
cin >> n >> k;
for(i=0;i<n;i++){
cin >> h[i];
}
for(i=1;i<n;i++){
cost[i]=cost[i-1]+abs(h[i-1]-h[i]);
for(int j=2;j<=k;j++){
if(i-j<0) break;
cost[i]=min(cost[i], cost[i-j]+abs(h[i-j]-h[i]));
}
}
cout << cost[n-1] <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string s;
cin>>s;
for (int i=0; i<8; i++) {
bool i0 = (i >> 2) & 1;
bool i1 = (i >> 1) & 1;
bool i2 = i & 1;
if (i1) {
if (s[1] == 'o') {
if (i0 != i2) {
continue;
}
} else {
if (i0 == i2) {
continue;
}
}
} else {
if (s[1] == 'o') {
if (i0 == i2) {
continue;
}
} else {
if (i0 != i2) {
continue;
}
}
}
vector<bool> is_sheep(n);
is_sheep[0] = i0;
is_sheep[1] = i1;
is_sheep[2] = i2;
for (int j=3; j<n; j++) {
if (is_sheep[j-1]) {
if (s[j-1] == 'o') {
is_sheep[j] = is_sheep[j-2];
} else {
is_sheep[j] = !is_sheep[j-2];
}
} else {
if (s[j-1] == 'o') {
is_sheep[j] = !is_sheep[j-2];
} else {
is_sheep[j] = is_sheep[j-2];
}
}
}
if (is_sheep[n-1]) {
if (s[n-1] == 'o' && is_sheep[n-2] != is_sheep[0]) {
continue;
} else if (s[n-1] == 'x' && is_sheep[n-2] == is_sheep[0]) {
continue;
}
} else {
if (s[n-1] == 'o' && is_sheep[n-2] == is_sheep[0]) {
continue;
} else if (s[n-1] == 'x' && is_sheep[n-2] != is_sheep[0]) {
continue;
}
}
if (is_sheep[0]) {
if (s[0] == 'o' && is_sheep[n-1] != is_sheep[1]) {
continue;
} else if (s[0] == 'x' && is_sheep[n-1] == is_sheep[1]) {
continue;
}
} else {
if (s[0] == 'o' && is_sheep[n-1] == is_sheep[1]) {
continue;
} else if (s[0] == 'x' && is_sheep[n-1] != is_sheep[1]) {
continue;
}
}
for (int j=0; j<n; j++) {
if (is_sheep[j]) {
cout<<"S";
} else {
cout<<"W";
}
}
cout<<endl;
return 0;
}
cout<<-1<<endl;
} | 0 | 95,493,816 |
#include <bits/stdc++.h>
#define load ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
#define ll long long
#define ull unsigned long long
#define fori(i,n) for (int i=0; i<int(n);i++)
#define srt(v) sort(v.begin(), v.end())
#define MOD 1000000007
const int INF = 1e9;
const double PI = 3.14159265358979323846;
ll gcd(ll a, ll b) {
return b != 0 ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a, b);
}
ll spow(ll base, ll exp){
ll ans = 1;
for(ll i=0;i<exp;i++) ans = ans * base % MOD;
return ans;
}
ll divide(ll a, ll b){
return a * spow(b, MOD-2) % MOD;
}
template<typename T> void print(const T &x){cout<<x<<endl;}
template<typename T=int> vector<T> read(size_t n){
vector<T> arr(n);
for(size_t i=0;i<n;i++) cin>>arr[i];
return arr;
}
void solve(){
}
int main(){
int n;
cin >> n;
auto v = read(n);
int result = v[0];
int maxNum = v[0];
for(int x : v){
result = __gcd(result, x);
maxNum = max(maxNum, x);
}
if (result != 1){
print("not coprime\n");
return 0;
}
vector<int> prime(maxNum + 1, 0);
for(int i=2; i<=maxNum; i++){
if(prime[i]) continue;
for(int j=i; j<=maxNum; j+=i){
prime[j] = i;
}
}
unordered_map<int, int> m;
for(int x : v){
int temp = x;
while(temp != 1){
int p = prime[temp];
while(temp%p == 0){
temp /= p;
}
m[p]++;
}
}
for(auto x : m){
if (x.second > 1){
print("setwise coprime\n");
return 0;
}
}
print("pairwise coprime\n");
} | #include <iostream>
using namespace std;
int main() {
int v[4] = {0,0,0,0};
for(int i=0;i<3;++i){
int a,b;cin>>a>>b;
++v[a-1];
++v[b-1];
}
int cnt1 = 2;
int cnt2 = 2;
for(int i=0;i<4;++i){
if(v[i]==1) --cnt1;
if(v[i]==2) --cnt2;
}
if(cnt1==0&&cnt2==0){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | 0 | 60,737,731 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define pp pair<int,int>
#define ll long long
#define ld long double
int inf=100000000;
ll INF=4000000000000000000;
ll MOD=1000000007;
int main() {
int n,m;
cin >> n >> m;
vector<ll> x(n),y(m);
rep(i,n) cin >> x.at(i);
rep(i,m) cin >> y.at(i);
sort(x.begin(),x.end());
sort(y.begin(),y.end());
vector<ll> a(n-1),b(m-1);
rep(i,n-1){
a.at(i)=x.at(i+1)-x.at(i);
}
rep(i,m-1){
b.at(i)=y.at(i+1)-y.at(i);
}
ll xx=0,yy=0;
rep(i,n-1){
xx=(xx+a.at(i)*(i+1)*(n-1-i))%MOD;
}
rep(i,m-1){
yy=(yy+b.at(i)*(i+1)*(m-1-i))%MOD;
}
cout << xx*yy%MOD << endl;
} | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
template <typename T>
T id(T b) {return b;};
template <class It>
bool all(It f,It l){return std::all_of(f,l,id<bool>);}
template <class It>
bool any(It f,It l){return std::any_of(f,l,id<bool>);}
const int MAX_N = 200000;
int n;
int a[MAX_N];
bool f(int k)
{
map<int,int> m;
for (int i = 1; i < n; i++) {
if (a[i] <= a[i-1]) {
while (!m.empty() && m.rbegin()->first > a[i]) {
m.erase(m.rbegin()->first);
}
m[a[i]]++;
int j = a[i];
while (j > 1 && m[j] == k) {
m.erase(j);
m[--j]++;
}
if (j == 1 && m[1] == k)
return false;
}
}
return true;
}
int main()
{
bool inc = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > 0) inc &= a[i] > a[i-1];
}
if (inc) {
cout << 1 << endl;
return 0;
}
int l = 1, r = n+1;
while (r - l > 1) {
int m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
cout << r << endl;
return 0;
} | 0 | 19,116,055 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[105],cost=4000005;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
for(int i=-100; i<=100; i++)
{
int sum=0;
for(int j=0; j<n; j++)
{
int t = (i-a[j])*(i-a[j]);
sum+=t;
}
if(sum<cost)
cost=sum;
}
printf("%d\n",cost);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> mode_a(1e6);
vector<int> mode_b(1e6);
rep (i, n) {
int x;
cin >> x;
if (i % 2 == 0) {
mode_a[x]++;
} else {
mode_b[x]++;
}
}
int max_a = max_element(mode_a.begin(), mode_a.end()) - mode_a.begin();
int max_b = max_element(mode_b.begin(), mode_b.end()) - mode_b.begin();
ll ans = n;
if (max_a == max_b) {
sort(mode_a.rbegin(), mode_a.rend());
sort(mode_b.rbegin(), mode_b.rend());
ans -= max(mode_a[0] + mode_b[1], mode_b[0] + mode_a[1]);
} else {
ans -= (mode_a[max_a] + mode_b[max_b]);
}
cout << ans << endl;
return 0;
} | 0 | 32,565,350 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
if(a % b == 0)
return b;
return gcd(b, a % b);
}
int main()
{
ll a, b;
cin >> a >> b;
ll res = (a * b) / gcd(a, b);
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
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;}
int const INF = 1e9;
int const MAX_N = 105;
using P = pair<int,int>;
vector<P> G[MAX_N];
int main()
{
int n,m;
cin >> n >> m;
vector<vector<int>> dist(n,vector<int>(n,INF));
rep(i,n) dist[i][i] = 0;
rep(i,m) {
int a,b,c;
cin >> a >> b >> c;
a--; b--;
dist[a][b] = c;
dist[b][a] = c;
G[a].emplace_back(b,c);
G[b].emplace_back(a,c);
}
rep(k,n) {
rep(i,n) {
rep(j,n) {
chmin(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
int res = 0;
rep(i,n) {
for(auto e : G[i]) {
int j = e.first;
int d = e.second;
bool ok = false;
for(int x = 0; x < n; ++x) {
for(int y = x+1; y < n; ++y) {
if(dist[x][y] == dist[x][i] + d + dist[j][y]
|| dist[x][y] == dist[x][j] + d + dist[i][y]) {
ok = true;
}
}
}
if(!ok) res++;
}
}
cout << res/2 << endl;
return 0;
} | 0 | 10,905,792 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<string> &o) {
string a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
vector<bool> v(200000, false);
v[0] = true;
rep(i, 100500) {
if (!v[i]) continue;
rep(j, 6) v[i + (100 + j)] = true;
}
int x;
cin >> x;
bool b = v[x];
cout << (b ? 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin>>n;
if(n==0){
cout <<0 << endl;
return 0;
}
long long int count=0;
if(n%2==1){
cout <<0 << endl;
return 0;
}
else{
n/=10;
count+=n;
while(n>0){
n/=5;
count+=n;
}
}
cout << count << endl;
return 0;
} | 0 | 95,514,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, L, R;
cin >> A >> B >> C >> D;
if(!((L=A+B)-(R=C+D)))
cout << "Balanced" << endl;
else if(L>R)
cout << "Left" << endl;
else
cout << "Right" << endl;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N,M,X; cin >>N >>M >>X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
rep(i,0,N) {
cin >>C[i];
rep(j,0,M) {
cin >>A[i][j];
}
}
int ans=INT_MAX;
int all=1<<N;
rep(mask,0,all) {
vector<int> level(M);
int cost=0;
rep(i,0,N) {
if (mask>>i&1) {
cost+=C[i];
rep(j,0,M) {
level[j]+=A[i][j];
}
}
}
bool flag=true;
rep(j,0,M) {
if (level[j]<X) {
flag=false;
}
}
if (flag) {
ans=min(ans,cost);
}
}
if (ans==INT_MAX) {
cout <<-1 <<endl;
} else {
cout <<ans <<endl;
}
return 0;
} | 0 | 81,213,032 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 == 0)continue;
int kosuu = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0)kosuu++;
}
if (kosuu == 8)sum++;
}
cout << sum << endl;
return 0;
} | #include <stdio.h>
int main(){
int n,a[5000],top;
while(1){
scanf("%d",&n);
if(n==0)return 0;
scanf("%d",&a[0]);
top=a[0];
for(int i=1;i<n;i++){
scanf("%d",&a[i]);
if(a[i-1]>0)a[i]+=a[i-1];
if(a[i]>top)top=a[i];
}
printf("%d\n",top);
}
} | 0 | 61,847,166 |
#include<cstdio>
#include<iostream>
using namespace std;
const int N = 99999;
int n, m, d, q;
int X[N], Y[N], f[N];
int Mabs(int x)
{
return x<0?-x:x;
}
int main()
{
scanf("%d%d%d", &n, &m, &d);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
int x;
scanf("%d", &x);
X[x] = i;
Y[x] = j;
}
for(int i = d + 1; i <= n*m; i++)
f[i] = f[i-d] + Mabs(X[i]-X[i-d]) + Mabs(Y[i]-Y[i-d]);
scanf("%d", &q);
for(int i = 1; i <= q; i++)
{
int x, y;
scanf("%d%d", &x, &y);
printf("%d\n", f[y] - f[x]);
}
return 0;
} | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#define forr(i,a) for(int i = a; i >= 0; i--)
#define fori(i,m) for(auto i = m.begin(); i != m.end(); i++)
#define sz(s) int(s.size())
#define cls(a,car) memset(a,car,sizeof (a))
using namespace std;
typedef long long ll;
const int N = 1 * 1e5 + 5;
const ll mod = 1e9 + 7;
const int INF = INT_MAX;
const ll INFCAD = ll(INT_MAX) * 2 + 1;
int toInt(const string &s){
if(s[0] == '-')
return -(s[1] - '0');
return (s[0] - '0');
}
int main(){
ll n,m;
cin >> n >> m;
if(n >= m)
cout << m / 2 << '\n';
else{
ll ans = 0;
ll aux = min(n,m / 2);
ans += aux;
m -= aux * 2;
if(m > 0)
ans += m / 4;
cout << ans << '\n';
}
return 0;
} | 0 | 41,752,077 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int d[100010];
int par[100010];
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
a--; b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
priority_queue<pii, vector<pii>, greater<pii>> que;
fill(d, d+n, INF);
d[0] = 0;
par[0] = 0;
que.push(pii(0, 0));
while(!que.empty()){
pii p = que.top();
que.pop();
int nv = p.second;
if(d[nv] < p.first) continue;
for (int i = 0; i < G[nv].size(); ++i) {
int to = G[nv][i];
if(d[to] > d[nv] + 1){
d[to] = d[nv] + 1;
par[to] = nv;
que.push(pii(d[to], to));
}
}
}
cout << "Yes" << endl;
for (int i = 1; i < n; ++i) {
cout << par[i] + 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
void _main() {
int n, m; cin >> n >> m;
vector<int> a(n); cin >> a;
sort(all(a));
priority_queue<int> pq(all(a));
while (m--) {
int x = pq.top(); pq.pop();
pq.emplace(x / 2);
}
ll ans = 0;
while (pq.size()) {
ans += pq.top();
pq.pop();
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
} | 0 | 32,186,027 |
#include <iostream>
#define int long long
using namespace std;
int powmod(int a, int n, int mod) {
if (n == 0) return 1;
if (n % 2 == 0) return powmod((a * a) % mod, n / 2, mod);
return (a * powmod(a, n - 1, mod)) % mod;
}
int mod = 1000000007;
int x, y;
int fact[2000001];
int finv[2000001];
int comb(int n, int k) {
return fact[n] * finv[k] % mod * finv[n - k] % mod;
}
signed main() {
cin >> x >> y;
int i;
fact[0] = 1;
finv[0] = 1;
for (i = 1; i <= 2000000; i++) {
fact[i] = i * fact[i - 1] % mod;
finv[i] = powmod(fact[i], mod - 2, mod);
}
if ((x + y) % 3 != 0) { cout << 0 << endl; return 0; }
int k = (x + y) / 3;
x -= k;
y -= k;
if (x < 0 || y < 0) { cout << 0 << endl; return 0; }
cout << comb(k, x) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
int to_seconds(vector<string> t) {
int h = atoi(t[0].c_str()) * 3600;
int m = atoi(t[1].c_str()) * 60;
int s = atoi(t[2].c_str());
return h + m + s;
}
const int MAX_M = 24 * 60 * 60;
int sum[MAX_M];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0) return 0;
rep(i, MAX_M) sum[i] = 0;
rep(i, n) {
string a, b;
cin >> a >> b;
int dep = to_seconds(split(a, ':'));
int arr = to_seconds(split(b, ':'));
sum[dep]++;
if (arr < MAX_M) sum[arr]--;
}
rep(i, MAX_M - 1) sum[i + 1] += sum[i];
int ans = 0;
rep(i, MAX_M) ans = max(ans, sum[i]);
cout << ans << endl;
}
return 0;
} | 0 | 51,242,967 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
signed main(){
int n,a,b,c;
cin>>a>>b>>c;
cin>>n;
int ans=0;
rep(i,0,n+1){
rep(j,0,n+1){
int k=i*a+j*b;
if(n-k>=0 && (n-k)%c==0)ans++;
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int a, p; std::cin >> a >> p;
p += a * 3;
std::cout << p / 2 << "\n";
} | 0 | 3,099,051 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
struct tree {
vector<int> children;
int depth;
int parent;
string type;
};
tree trees[100000];
int calc_depth(int n) {
for (vector<int>::iterator i = trees[n].children.begin(); i < trees[n].children.end(); i++) {
trees[*i].depth = trees[n].depth + 1;
calc_depth(*i);
}
}
int main(void) {
int num;
cin >> num;
for (int i = 0; i < num; i++) {
trees[i].parent = -1;
trees[i].depth = 0;
}
for (int i = 0; i < num; i++) {
int node, children;
cin >> node >> children;
for (int j = 0; j < children; j++) {
int child;
cin >> child;
trees[node].children.push_back(child);
trees[child].parent = node;
}
}
for (int i = 0; i < num; i++) {
if (trees[i].parent == -1) {
calc_depth(i);
}
}
for (int i = 0; i < num; i++) {
if (trees[i].parent == -1) {
trees[i].type = "root";
} else if (trees[i].children.size() == 0) {
trees[i].type = "leaf";
} else {
trees[i].type = "internal node";
}
}
for (int i = 0; i < num; i++) {
cout << "node " << i << ": parent = " << trees[i].parent;
cout << ", depth = " << trees[i].depth << ", " << trees[i].type;
cout << ", [";
for (int j = 0; j < trees[i].children.size(); j++) {
cout << trees[i].children[j];
if (j != trees[i].children.size() - 1) {
cout << ", ";
}
}
cout << "]" << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
map<ll, ll> ma;
rep(i, N) { cin >> A[i]; }
sort(all(A));
int cnt = 1;
ll prev = 0;
bool judge = 0;
rep(i, N) {
if (i != 0) {
if (prev * 2 >= A[i])
cnt++;
else
cnt = 1;
}
prev += A[i];
}
cout << cnt << endl;
} | 0 | 12,660,035 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string N;
cin >> N;
if(N[0] == '7' || N[1] == '7' || N[2] == '7')
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
void print_number(int a[], int N){
if(N==1){
cout << a[0] <<endl;
return;
}
for(int i=0; i<N-1; i++){
cout << a[i] << " ";
}
cout << a[N-1] << endl;
}
int main() {
int N, count=0;
const int MAX_N = 100;
int a[MAX_N];
cin >> N;
for(int i=0; i<N; i++){
cin >> a[i];
}
int tmp, mini;
for(int i=0; i<N; i++){
mini = i;
for(int j=i; j<N; j++){
if(a[mini] > a[j]){
mini = j;
}
}
if(mini != i){
tmp = a[mini];
a[mini] = a[i];
a[i] = tmp;
count++;
}
}
print_number(a, N);
cout << count << endl;
} | 0 | 98,315,823 |
#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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, n;
cin >> h >> n;
vector<int> a(n), b(n);
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
vector<int> dp(h+1, numeric_limits<int>::max());
dp[0] = 0;
for(int k=0; k<=h; k++){
for(int j=0; j<n; j++){
int target = max(k - a[j], 0);
dp[k] = min(dp[k], dp[target] + b[j]);
}
}
cout << dp[h] << "\n";
return 0;
} | 0 | 22,643,138 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
const int INF = 1<<30;
const ll INFll = 1ll<<62;
const ld EPS = 1e-10;
const int MOD = int(1e9)+7;
template<typename T> inline bool chmin(T& a, T b) {if(a>b) {a=b; return true;} return false;}
template<typename T> inline bool chmax(T& a, T b) {if(a<b) {a=b; return true;} return false;}
int main() {
ll n, m; cin >> n >> m;
Vll S(n+1);
rep(i, n) {
int a; cin >> a;
S[i+1] = (S[i] + a) % m;
};
map<int, int> cnt;
ll ans = 0;
rep(i, n+1) {
ans += cnt[S[i]];
++cnt[S[i]];
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
ll N,M;
cin >>N>>M;
map<ll,ll>m;
rep2(i,N){
ll p;
cin>>p;
m[p]=i;
}
UnionFind tree(N+1);
rep(i,M){
ll x,y;
cin>>x>>y;
tree.unite(x, y);
}
ll ans = 0;
rep2(i,N){
if(tree.same(i,m[i])){
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 57,741,031 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class T> inline bool chmin(T &a,T b){
if (a>b){
a=b;
return true;
}
return false;
}
template<class T> inline bool chmax(T &a,T b){
if (a<b){
a=b;
return true;
}
return false;
}
int main(){
int N;
cin >> N;
vector<int> cnt(N,0);
int M=0;
rep(i,N){
int a;
cin >> a;
++cnt[a],chmax(M,a);
}
bool ans=true;
rep(i,M+1){
if (i<(M+1)/2&&cnt[i]>0) ans=false;
if (i==(M+1)/2){
if (M%2==0&&cnt[i]!=1) ans=false;
if (M%2==1&&cnt[i]!=2) ans=false;
continue;
}
if (i>(M+1)/2&&cnt[i]<2){
ans=false;
}
}
if (ans) cout << "Possible" << endl;
else cout << "Impossible" << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define rep(i,n)for(int i=0; i<(int)(n); i++)
#define bitrep(tmp, N)for (int tmp=0; tmp < (1<<N);tmp++)
#define all(v) v.begin(), end.bigin()
using P = pair<int,int>;
int main(){
int N;
cin >>N;
vector<P> red(N);
rep(i, N){
int a, b;
cin >> a >> b;
red[i] = make_pair(a,b);
}
sort(red.begin(), red.end());
vector<P> blue(N);
rep(i, N){
int c, d;
cin >> c >> d;
blue[i] = make_pair(c,d);
}
sort(blue.begin(), blue.end());
int cnt = 0;
vector<int> removed;
rep(i,N){
int m=-1;
int pos=-1;
rep(j,N){
if(red[j].first<=blue[i].first && red[j].second<=blue[i].second && (!count(removed.begin(),removed.end(), j))){
if(m<red[j].second){
m = red[j].second;
pos = j;
}
}
}
if(pos!=-1){
cnt++;
removed.push_back(pos);
}
}
cout << cnt <<endl;
} | 0 | 47,758,940 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>>c(w,vector<char>(h));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c.at(j).at(i);
}
}
for(int i=0;i<h;i++){
for(int j=0;j<2;j++){
for(int k=0;k<w;k++){
cout<<c.at(k).at(i);
}
cout<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define for0(n) for(i=0; i<(n); i++)
#define for1(n) for(i=1; i<=(n); i++)
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll _,i,j,n,a,b,e,k,u,t,x=1,m,y,q,f=1,c=0,d=0,l,p,z,o,r,g;
string ss,s;
cin>>x>>n;
set<ll> st;
for0(n)
{
cin>>a;
st.insert(a);
}
y=st.size();
a=b=x;
while(1)
{
st.insert(a);
if(y<st.size())
{
cout<<a<<endl;
break;
}
st.insert(b);
if(y<st.size())
{
cout<<b<<endl;
break;
}
a--;b++;
}
} | 0 | 99,541,830 |
#include<iostream>
using namespace std;
const int N=1e5+5;
int a[N];
int main(){
int n;
scanf("%d",&n);
int ai;
while(n--){
scanf("%d",&ai);
a[ai]++;
a[ai-1]++;
a[ai+1]++;
}
int max=0;
for(int i=0;i<N-1;i++){
if(max<a[i])
max=a[i];
}
printf("%d\n",max);
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string o, b;
cin >> o >> b;
int n = min(o.size(), b.size());
repi(i, n, 0)
{
cout << o[i] << b[i];
}
if (o.size() - n)
{
cout << o[n];
}
else if (b.size() - n)
{
cout << b[n];
}
cout << endl;
return 0;
} | 0 | 69,879,878 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
while (N--) {
string s;
vector<string> v;
v.push_back(".,!? ");
v.push_back("abc");
v.push_back("def");
v.push_back("ghi");
v.push_back("jkl");
v.push_back("mno");
v.push_back("pqrs");
v.push_back("tuv");
v.push_back("wxyz");
while (cin >> s) {
string p;
char buf = 0;
int c = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
if (buf > 0)
p += v[buf - '0' - 1][(c - 1) % v[buf - '0' - 1].size()];
buf = 0;
c = 0;
} else {
buf = s[i];
c++;
}
}
cout << p << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int ll
#define PI 3.1415926535897932384626433832795
#define pb push_back
#define rep0 for(int i=0;i<n;i++)
#define rep1 for(int i=1;i<=n;i++)
#define inputar0(ar) for(int i=0;i<n;i++)cin>>ar[i]
#define inputar1(ar) for(int i=1;i<=n;i++)cin>>ar[i]
#define hell freopen("input.txt","r", stdin);freopen("output.txt", "w", stdout);freopen("error.txt", "w",stderr);
#define fastasF_boi() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
int mod=1000000007;
int maxn=200001;
int binpow(int a,int b,int mod){int res=1;while(b>0){if(b%2){res=(res*a)%mod;b--;}a=(a*a)%mod;b/=2;}return res%mod;}
int binpow(int a,int b){int res=1;while(b>0){if(b%2){res=(res*a);b--;}a=(a*a);b/=2;}return res;}
bool isPrime(int n){if(n==1)return false;for(int i=2;i*i<=n;i++){if(n%i==0)return false;}return true;}
int mulmod(int a,int b){return ((a%mod)*(b%mod))%mod;}
int addmod(int a,int b){return (((a%mod)+(b%mod))+mod)%mod;}
void solve();
signed main(){
fastasF_boi();
int t=1;
for(int tt=1;tt<=t;tt++){
solve();
}
}
void solve(){
int a,b,c;
cin>>a>>b>>c;
int k;cin>>k;
while(a>=b){
b*=2;
k--;
}
while(b>=c){
c*=2;
k--;
}
if(k<0) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | 0 | 80,944,526 |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include<cstring>
using namespace std;
typedef long long int lli;
#define all(arr) arr.begin(),arr.end()
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define pq priority_queue
#define inf 0x3f3f3f3f
#define test cout<<"abcd\n";
#define pi pair<int,int>
#define pii pair<int,pi>
#define pb push_back
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define MOD 1000000007
#define space ' '
#define kick(t) cout << "Case #" << t << ":" << endl;
#define add(x, y) (x%MOD+y%MOD)%MOD
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
template <typename T>
void input(vector<T> &arr,lli n) {
T temp;
for(lli i=0;i<n;i++) cin>>temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
for(auto x:arr) cout<<x<<" ";
cout<<endl;
}
template <typename T>
void input_set(set<T> &arr,lli n) {
T temp;
for(lli i=0;i<n;i++) cin>>temp, arr.insert(temp);
}
lli mul(lli a, lli b) {
return (a%MOD*b%MOD)%MOD;
}
lli power(lli a,lli b) {
lli ans = 1;
while(b > 0) {
if(b&1)
ans = mul(ans, a);
a = mul(a,a);;
b >>= 1;
}
return ans;
}
void solve() {
lli n;
cin >> n;
vector<lli> dp(n+1, 0);
dp[3]=1;
dp[0]=1;
for(int i=4; i<=n; i++) {
dp[i]=1;
for(int j=3; j<=i-3; j++) {
dp[i]=add(dp[i], dp[i-j]);
}
}
cout << dp[n] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli testcases;
testcases=1;
while(testcases--) {
solve();
}
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF (int)1e09
using std::cin;
using std::cout;
using std::endl;
using std::setprecision;
using std::fixed;
using std::pair;
using std::make_pair;
using std::min;
using std::max;
using std::string;
using std::vector;
using std::list;
using std::map;
using std::set;
using std::queue;
using std::priority_queue;
using std::stack;
template <typename T> using Vec = vector<T>;
typedef pair<int, int> PII;
typedef pair<int, pair<int, int> > PIII;
int main(void) {
int h;
int w;
cin >> h >> w;
string s;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> s;
if (s == "snuke") {
cout << (char)(j + 'A') << i + 1 << endl;
}
}
}
return 0;
} | 0 | 84,263,867 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
void Rect(int h, int w){
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << '#';
if (j==w-1) cout << endl;
}
}
}
int main(){
int H,W;
while(true){
cin >> H >> W;
if(H==0&&W==0) break;
Rect(H,W);
cout << endl;
}
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
int n;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
st_Coordinate st_start, st_end;
st_start.x = 0; st_start.y = 0;
st_end.x = 100; st_end.y = 0;
scanf("%d", &n);
if( n > 0 )
{
Koch_curve(st_start, st_end, 0);
printf("%lf %lf\n", st_end.x, st_end.y);
}
else
{
printf("%lf %lf\n", st_start.x, st_start.y);
printf("%lf %lf\n", st_end.x, st_end.y);
}
return 0;
}
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int count)
{
double split_x, split_y;
st_Coordinate s, t, u;
if( count == n )
{
return;
}
count++;
split_x = ( p2.x - p1.x ) / 3.0;
split_y = ( p2.y - p1.y ) / 3.0;
s.x = p1.x + split_x;
s.y = p1.y + split_y;
t.x = p2.x - split_x;
t.y = p2.y - split_y;
u.x = ( cos( M_PI / 3.0 ) * ( t.x - s.x ) )
+ ( ( -1 ) * sin( M_PI / 3.0 ) * ( t.y - s.y ) ) + s.x;
u.y = ( sin( M_PI / 3.0 ) * ( t.x - s.x ) )
+ ( cos( M_PI / 3.0 ) * ( t.y - s.y ) ) + s.y;
if( count < n )
{
Koch_curve(p1, s, count);
Koch_curve(s, u, count);
Koch_curve(u, t, count);
Koch_curve(t, p2, count);
}
else
{
printf("%lf %lf\n", p1.x, p1.y);
printf("%lf %lf\n", s.x, s.y);
printf("%lf %lf\n", u.x, u.y);
printf("%lf %lf\n", t.x, t.y);
}
return;
} | 0 | 65,729,997 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<ll> ans;
void dfs(int d, ll now){
ans.push_back(now);
if(d==10) return;
for(int j = -1; j<=1; j++){
int add = (now % 10) + j;
if(add>=0 && add <= 9) dfs(d+1, now*10+add);
}
}
int main(){
for(int i=1; i<=9; i++){
dfs(1,(ll)i);
}
sort(ans.begin(),ans.end());
int k; cin>>k;
cout<<ans[k-1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
if(v.size() >= 100) {
return "Too big container";
}
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;cin>>N>>M;
vector<int> A(N), B(N), C(M), D(M);
rep(i, N) cin >> A[i] >> B[i];
rep(i, M) cin >> C[i] >> D[i];
rep(i, N) {
int minDis = INT_MAX;
int ans;
rep(j, M) {
int dis = abs(A[i] - C[j]) + abs(B[i] - D[j]);
if(minDis > dis) {
minDis = dis;
ans = j;
}
}
print(ans + 1);
}
} | 0 | 48,789,691 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n,m;
vector<string> A(50),B(50);
bool isok(ll i, ll j) {
ll x,y;
for(x=0;x<m;x++) {
for(y=0;y<m;y++) {
if (A[i+x][j+y] != B[x][y] ) return false;
}
}
return true;
}
int main() {
ll a,b,c,h,i,j,k,l,x,y;
ll ans = 0;
string s;
cin >> n >> m;
for(i=0;i<n;i++) cin >> A[i];
for(i=0;i<m;i++) cin >> B[i];
bool ok;
for(i=0;i<=(n-m);i++) {
for(j=0;j<=(n-m);j++) {
ok = isok(i,j);
if (ok) break;
}
if (ok) break;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
main(){
ll int k;
cin>>k;
ll int kk=k;
int n=50;
ll int a[50]={};
rep(i,50){
a[i]=kk/50;
k-=kk/50;
}
rep(i,50){
if(k>0){
a[i]++;
k--;
}
}
cout<<50<<endl;
rep(i,50){
a[i]=(ll)51*a[i]-kk+(ll)49;
cout<<a[i]<<" ";
}
return 0;
} | 0 | 35,893,426 |
#include <iostream>
#include <vector>
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int mx = 0, s = 0;
rep(i, 1, n) {
if(v[i] <= v[i-1]) {
s++;
} else {
if(mx < s) mx = s;
s = 0;
}
}
if(mx < s) mx = s;
cout << mx << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
int cnt[26] = {0};
cin >> s;
for (int i=0; i<s.size(); i++){
if (cnt[s[i]-'a'] == 1){
cout << "no" << endl;
return 0;
} else{
cnt[s[i]-'a'] = 1;
}
}
cout << "yes" << endl;
return 0;
} | 0 | 31,089,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
const ll mod = 1000000007;
int main(){
cin >> N;
vector<ll> A(N);
for ( int i = 0; i < N; i++ ){
cin >> A[i];
}
ll result = 0;
for ( ll b = 0; b < 60; b++ ){
ll bb = (ll)1 << b;
vector<int> bitacc(N+1);
int acc = 0;
for ( int i = 0; i < N; i++ ){
bitacc[i] = acc;
if ( A[i] & bb )
acc++;
}
bitacc[N] = acc;
ll sum = 0;
for ( int i = 0; i < N-1; i++ ){
if ( A[i] & bb ){
sum += (N-1-i) - (bitacc[N] - bitacc[i+1]);
}
else {
sum += bitacc[N] - bitacc[i+1];
}
}
result += (bb%mod) * (sum%mod);
result %= mod;
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
int x, y, z, k; cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> ab;
rep(i, x) rep(j, y) ab.push_back(a[i] + b[j]);
sort(rALL(ab));
ab.resize(k);
vector<ll> abc;
rep(i, k) rep(j, z) abc.push_back(ab[i] + c[j]);
sort(rALL(abc));
rep(i, k) cout << abc[i] << endl;
} | 0 | 5,760,214 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define forn(i,n) for(int i=0;i<(int) n;i++)
#define Forn(i,n) for(int i=1;i<=(int) n;i++)
#define M 100005
lli gcd(lli a,lli b)
{
if(a%b==0) return b;
return gcd(b,a%b);
}
int main()
{
lli n,i;
cin>>n;
lli a[n];
for(i=0;i<n;i++) cin>>a[i];
lli g=a[0];
for(i=1;i<n;i++)
{
g=__gcd(a[i],g);
}
cout<<g;
} | #include <iostream>
#include <map>
#define ll long long
using namespace std;
map <ll, int> freq;
ll arr[200005];
ll prefsum[200005];
int main()
{
int n;
cin >> n;
prefsum[0] = 0;
for (int i = 1; i <= n; i++){
cin >> arr[i];
prefsum[i] = prefsum[i-1] + arr[i];
}
freq[0] = 1;
ll ans = 0;
for (int i = 1; i <= n; i++){
ll g = prefsum[i];
ll f = freq[g];
if (f > 0){
ans = ans + f;
}
freq[g]++;
}
cout << ans << endl;
return 0;
} | 0 | 18,031,147 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k, min = 0;
cin >> n >> k;
vector<int> p;
for (size_t i = 0; i < n; i++)
{
int x;
cin >> x;
p.push_back(x);
}
sort(p.begin(), p.end());
for (size_t i = 0; i < k; i++)
{
min += p[i];
}
cout << min;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n;
cin >> n;
vector<int> A(n+2);
A[0] = 0;
for(int i=1; i<=n; i++){
cin >> A[i];
}
A[n+1] = 0;
int total = 0;
for(int i=1; i<=n+1; i++){
total += abs(A[i] - A[i-1]);
}
for(int i=1; i<=n; i++){
int ans = total - abs(A[i+1] - A[i]) - abs(A[i] - A[i-1]);
ans += abs(A[i+1] - A[i-1]);
cout << ans << endl;
}
return 0;
} | 0 | 18,440,852 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define eps 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, a[maxN], pre[maxN][2][2] = {0};
int t[2][maxN<<2];
inline void pushup(int *tree, int rt) { tree[rt] = max(tree[lsn], tree[rsn]); }
void update(int *tree, int rt, int l, int r, int qx, int val)
{
if(l == r) { tree[rt] = val; return; }
int mid = HalF;
if(qx <= mid) update(tree, Lson, qx, val);
else update(tree, Rson, qx, val);
pushup(tree, rt);
}
inline int query(int *tree, int rt, int l, int r, int ql, int qr)
{
if(ql <= l && qr >= r) return tree[rt];
int mid = HalF;
if(qr <= mid) return query(tree, QL);
else if(ql > mid) return query(tree, QR);
else return max(query(tree, QL), query(tree, QR));
}
ll ans = 0;
inline void solve(int id)
{
int l = 1, r = id - 1, mid = 0, ith = 0;
while(l <= r)
{
mid = (l + r)>>1;
if(query(t[0], 1, 1, N, mid, id - 1) > a[id])
{
l = mid + 1;
ith = mid;
}
else r = mid - 1;
}
if(ith == 0) return;
pre[id][0][0] = ith;
l = 1; r = ith - 1; ith = 0;
int nex_id = r;
while(l <= r)
{
mid = (l + r)>>1;
if(query(t[0], 1, 1, N, mid, nex_id) > a[id])
{
l = mid + 1;
ith = mid;
}
else r = mid - 1;
}
if(ith == 0) return;
pre[id][0][1] = ith;
}
inline void finsh(int id)
{
int l = id + 1, r = N, mid = 0, ith = 0;
while(l <= r)
{
mid = (l + r)>>1;
if(query(t[1], 1, 1, N, id + 1, mid) > a[id])
{
r = mid - 1;
ith = mid;
}
else l = mid + 1;
}
if(ith == 0) return;
pre[id][1][0] = ith;
l = ith + 1; r = N; ith = 0;
int nex_id = l;
while(l <= r)
{
mid = (l + r)>>1;
if(query(t[1], 1, 1, N, nex_id, mid) > a[id])
{
r = mid - 1;
ith = mid;
}
else l = mid + 1;
}
if(ith == 0) return;
pre[id][1][1] = ith;
}
int main()
{
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d", &a[i]);
for(int i=1; i<=N; i++) pre[i][1][1] = pre[i][1][0] = N + 1;
update(t[0], 1, 1, N, 1, a[1]);
for(int i=2; i<=N; i++)
{
solve(i);
update(t[0], 1, 1, N, i, a[i]);
}
update(t[1], 1, 1, N, N, a[N]);
for(int i=N-1; i>=1; i--)
{
finsh(i);
update(t[1], 1, 1, N, i, a[i]);
}
for(int i=1; i<=N; i++)
{
ans += 1LL * (pre[i][0][0] - pre[i][0][1]) * (pre[i][1][0] - i) * a[i];
ans += 1LL * (i - pre[i][0][0]) * (pre[i][1][1] - pre[i][1][0]) * a[i];
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n, ans=0;
cin >> n;
vector<ll> a(n+1), b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
rep(i,n){
if(a[i] >= b[i]) ans += b[i];
else{
ans += min(b[i], a[i]+a[i+1]);
a[i+1] = max(0LL, a[i+1]-b[i]+a[i]);
}
}
cout << ans << endl;
return 0;
} | 0 | 50,255,033 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template<class T> inline bool chmin(T& a,T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if (a < b) {a = b; return true;} return false;}
const ll MOD = 1000000007;
const int INF = 1<<30;
int main(){
int N, K; cin >> N >> K;
string S; cin >> S;
vector<int> que;
int n_zero = 0, n_one = 0;
if (S[0] != '1') que.push_back(0);
rep(i, N){
if (S[i] == '0'){
if (n_one != 0) que.push_back(n_one);
n_zero++;
n_one = 0;
}
else{
if (n_zero != 0) que.push_back(n_zero);
n_one++;
n_zero = 0;
}
if (i == N - 1){
if (S[i] == '0') que.push_back(n_zero);
else que.push_back(n_one);
}
}
vector<int> s((int)que.size() + 1, 0);
rep(i, (int)que.size()) s[i + 1] = s[i] + que[i];
int ans = 0;
for (int left = 0; left < s.size(); left += 2){
int right = left + K * 2 + 1;
if (right >= s.size()) right = (int)s.size() - 1;
ans = max(ans, s[right] - s[left]);
}
cout << ans << endl;
} | #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
ll func(ll n, ll k)
{
ll L = 1, M = (1LL<<(n+1))-1, R = (1LL<<(n+2))-3;
ll P = (1LL<<n)-1;
if(n > 0) {
if(k == L) return 0;
else if(L < k && k < M) return func(n-1, k-1);
else if(k == M) return P + 1;
else if(M < k && k < R) return func(n-1, k-M) + P + 1;
else if(k == R) return P * 2 + 1;
else return 0;
}
else return 1;
}
int main()
{
ll N, X;
cin >> N >> X;
ll ans = func(N, X);
PR(ans);
return 0;
} | 0 | 79,116,016 |
#include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main () {
int n ;
cin >> n ;
vector<string> s (n) ;
rep(i, n){
cin >> s[i] ;
}
rep(i, n){
sort(s[i].begin(), s[i].end()) ;
}
sort(s.begin(), s.end()) ;
string first = s[0] ;
ll num = 0 ;
ll ans = 0 ;
rep(i, n){
if(first == s[i]){
num++ ;
}
else if(i != n -1) {
first = s[i] ;
ans += num*(num-1)/2 ;
num = 1 ;
}
if(i == n -1) {
ans += num*(num-1)/2 ;
}
}
cout << ans << endl ;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int N, M;
cin >> N >> M;
for (int ii = 0; ii < M; ii++) {
int A;
cin >> A;
N = N - A;
if (N < 0) {
cout << -1 << endl;
return 0;
}
}
cout << N << endl;
} | 0 | 61,036,482 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
string s;
getline(cin, s);
for(int i=0; i<s.size(); i++){
if( s[i]-'A' >= 0 && s[i]-'A' < 26 ) s[i] += 32;
else if( s[i]-'a' >= 0 && s[i]-'a' < 26 ) s[i] -= 32;
cout << s[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin>>A;
if(A=="RRR"){
cout<<3;
}
else if(A=="SSS"){
cout<<0;
}
else if(A=="SRR"||A=="RRS"){
cout<<2;
}
else if(A=="SRS"||A=="RSS"||A=="SSR"||A=="RSR"){
cout<<1;
}
return 0;
} | 0 | 52,985,438 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h) {
rep(j,w) {
bool flag=(i<b)^(j<a);
if (flag) cout << '0';
else cout << '1';
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
#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 INF 1000000000000
#define MOD 10000007
#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 Vec(K, L, N, S) vector<L> K(N, S)
#define rt sqrt
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vs = vector<string>;
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;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
lli b, c, d, x, h, k, n, w, ans = 0, count = 0;
string s, t;
cin >> n;
cin >> d >> x;
vi a(n);
rep(i, 0, n)
{
cin >> a[i];
}
for (lli i = 0; i < n; i++)
{
for (lli j = 1; j <= d; j += a[i])
{
count++;
}
}
cout << x + count << endl;
} | 0 | 39,037,472 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n, k;
cin >> n >> k;
ll cur = 1;
for (int i = 0; i < n; i++) {
if (cur * 2 < cur + k) {
cur *= 2;
} else {
cur += k;
}
}
cout << cur << '\n';
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
int main()
{
ll a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw"<<endl;
}
else if(b==1)
{
cout<<"Bob"<<endl;
}
else if(a==1)
{
cout<<"Alice"<< endl;
}
else{
if(a>b)
{
cout<<"Alice"<<endl;
}
else{
cout<<"Bob"<<endl;
}
}
} | 0 | 78,135,252 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
#include<iomanip>
#include<numeric>
#define rep(i,n) for(int i=0;i<n;++i)
#define mod 1000000007
using namespace std;
int main(){
vector<pair<int,int> > map;
while(true){
int H,W; cin>>H>>W;
if(H==0&&W==0)break;
map.push_back(make_pair(H,W));
}
rep(i,map.size()){
rep(j,map[i].first){
rep(k,map[i].second){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
}
} | #include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n;
cin>>n;
cout<< n*n;
return 0;
} | 0 | 41,803,912 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for(long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = LLONG_MAX / 2;
const ll MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll N, K;
cin >> N >> K;
ll A[N];
for(int i = 0; i < N; i++) {
cin >> A[i];
}
if(K == 1) {
cout << 0 << endl;
return 0;
}
for(int i = 0; i < N; i++) {
A[i]--;
A[i] %= K;
}
ll ans = 0;
map<ll, ll> cnt;
cnt[0] = 1;
ll sum[N + 1] = {};
for(int i = 0; i < N; i++) {
sum[i + 1] = (sum[i] + A[i]) % K;
ans += cnt[sum[i + 1]]++;
if(i + 2 - K >= 0) {
cnt[sum[i + 2 - K]]--;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
auto g = atcoder::dsu(n);
for (int i = 0; i < q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t) {
cout << (g.same(u, v) ? 1 : 0) << endl;
} else {
g.merge(u, v);
}
}
} | 0 | 95,001,552 |
#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++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main(void){
while(true){
int n; cin >> n;
if(n == 0) return 0;
else{
vector<int> score(n);
REP(i, n) cin >> score[i];
whole(sort, score);
int ans = INF;
REP(i, n - 1) ans = min(ans, score[i + 1] - score[i]);
cout << ans << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, D, X;
cin >> N >> D >> X;
vector<int> A(N);
REP(i, N) cin >> A[i];
int ans = 0;
for (int day = 1; day <= D; day++) {
REP(i, N) {
int j = 0;
while (j * A[i] < 101) {
if (1 + j * A[i] == day) {
ans++;
break;
}
j++;
}
}
}
ans += X;
cout << ans << endl;
} | 0 | 58,916,131 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const ll INF=1000000000000000000;
signed main(){
int a,b,c;
cin>>a>>b>>c;
cout<<((c>=a&&c<=b)?"Yes":"No");
} | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
#define INF 1<<30
int dp[1<<26];
int main(){
fill_n(dp, 1<<26, INF);
string s;
cin >> s;
int N = s.size();
int bt = 0;
for(int i=0; i<N; i++){
int x = s[i] - 'a';
bt ^= 1<<x;
if(__builtin_popcount(bt)<=1){
dp[bt] = 1;
continue;
}
for(int j=0; j<26; j++)
dp[bt] = min(dp[bt], dp[bt ^ (1<<j)] + 1);
}
cout << dp[bt] << endl;
return 0;
} | 0 | 69,473,331 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int>d;
d[N] = 1;
int b_a = N;
int num = 2;
while (true) {
int ans;
if (b_a % 2 == 0) {
ans = b_a /2;
} else {
ans = (3 * b_a) + 1;
}
if (d.count(ans) > 0) {
break;
} else {
d[ans] = num;
}
b_a = ans;
num++;
}
cout << num << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define reprev(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define bitrep(bit,A) for(int bit=A; ;bit=(bit-1)&A)
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) (ll)((a).size())
#define c_max(a, b) (((ll)a)>((ll)b)?(a):(b))
#define c_min(a,b) (((ll)a)<((ll)b)?(a):(b))
#define chmax(x,a) x=c_max(x,a)
#define chmin(x,a) x=c_min(x,a)
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define SORT(c) stable_sort(ALL(c))
#define $(x) {cout<<#x<<" = " <<(x)<<endl;}
#define fi first
#define se second
#define MAX 100100
#define MAX2 200100
#define MAX_6 1001001
#define MAX_7 10010010
#define SENTINEL 2000000000
#define NIL -1
const int MOD = 1000000007;
#define INF 1<<30
#define INFTY 1LL<<61
#define MAX_INT INT_MAX
#define Endl '\n'
#define greater greater<int>()
inline ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
inline ll lcm(ll a,ll b){return a*b/GCD(a,b);}
using Edge=pair<int,ll>;
using Graph=vector<vector<ll> >;
using Edge=pair<int,ll>;
int dp[1010][10010];
int main(){
ll h,n;cin>>h>>n;
int a[MAX],b[MAX];
rep(i,n)cin>>a[i]>>b[i];
rep(i,1010)rep(j,10010)dp[i][j]=INF;
dp[0][0]=0;
for(int i=0;i<n;i++){
for(int j=0;j<=h;j++){
dp[i+1][j]=min(dp[i+1][j],dp[i][j]);
chmin(dp[i+1][min(j+a[i],(int)h)],dp[i+1][j]+b[i]);
}
}
cout<<dp[n][h]<<endl;
} | 0 | 73,981,017 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n , c,k;
cin>>n>>c>>k;
ll t[n];
for(int i=0;i<n;i++)
{
cin>>t[i];
}
sort( t , t+n);
int index =0;
ll ans =0;
while( index < n)
{
ll curr = t[index];
ll cap =1;
while( curr + k >= t[index] && cap <= c && index<n )
{
index++;
cap++;
}
ans++;
}
cout<<ans;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#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(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
int main()
{
string s;
cin >> s;
ll k;
cin >> k;
rep(i,k){
if(s[i] != '1'){
cout << s[i] << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
} | 0 | 62,009,528 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
string s;
cin>>s;
int one=0;
int zero=0;
for(char c : s)
{
if(c=='0') zero++;
else one++;
}
cout<<min(zero,one)*2<<endl;
return 0;
} | #include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef long long LL;
#define d(x) cout<<#x<<" = "<<(x)<<endl;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define REACH(i,c) for(typeof((c).rbegin()) i=(c).rbegin(); i!=(c).rend(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c,n) sort(c,c+n)
#define VSORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define DFOR(i,b,a) for(int i=(b)-1;i>=(a);--i)
#define DREP(i,n) DFOR(i,n,0)
#define INF 2000000000
const double EPS = 1e-10;
const double PI = acos(-1.0);
int a[100][100];
int main()
{
int n;cin>>n;
REP(i,n)
{
int m;cin>>m;
int k;cin>>k;
REP(j,k)
{
int l;cin>>l;
a[m-1][l-1]=1;
}
}
REP(i,n)
{
REP(j,n)
{
if(j)cout<<" ";
cout<<a[i][j];
}
cout<<endl;
}
return 0;
} | 0 | 29,767,215 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b) for(long long i=a; i<b; i++)
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
double PI = 4*atan(1);
int main()
{
optimize();
int x1, x2, y1, y2;
cin>> x1>> y1>> x2>> y2;
int dx= x2-x1, dy= y1- y2;
cout << x2+ dy <<' ' << y2 + dx<< ' ' << x1+ dy<< ' '<< y1+ dx;
nl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s.at(i);
}
FOR(h, 0, H) {
FOR(w, 0, W) {
if (s.at(h).at(w) == '.') { continue; }
if ((0 <= h - 1) && (s.at(h - 1).at(w) == '#')) {
continue;
} else if ((0 <= w - 1) && (s.at(h).at(w - 1) == '#')) {
continue;
} else if ((w + 1 < W) && (s.at(h).at(w + 1) == '#')) {
continue;
} else if ((h + 1 < H) && (s.at(h + 1).at(w) == '#')) {
continue;
} else {
cout << "No" << endl;
exit(0);
}
}
}
cout << "Yes" << endl;
} | 0 | 51,069,280 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int w,h,x,y,r;
x = 1;
while(cin >> w){
if(w == 0) break;
cout << "Case " << x << ": " << w << endl;
x++;
}
} | #include <cstdint>
#include <iostream>
#include <string>
#include <algorithm>
constexpr int32_t kMaxNumberOfMatrices = 100;
constexpr int32_t kMaxNumberOfRowsAndCols = 100;
void CallMatrixChainMultiplication(std::istream &input_stream);
struct Matrix {
int32_t number_of_rows{0};
int32_t number_of_columns{0};
};
struct LookUp {
bool calculated{false};
int32_t mcm{INT32_MAX};
};
class MatrixChainMultiplication {
public:
MatrixChainMultiplication() noexcept;
~MatrixChainMultiplication() noexcept;
void AddMatrix(const int32_t number_of_rows, const int32_t number_of_columns);
int32_t CalculateMinMultiplyCount();
static int32_t GetMultiplyCount(const Matrix &a, const Matrix &b);
static Matrix GetMultipliedMatrix(const Matrix &a, const Matrix &b);
static Matrix GenerateMatrix(const int32_t number_of_rows, const int32_t number_of_columns);
private:
int32_t CalculateMcmRecursively(const int32_t start, const int32_t end);
bool IsInvalidIndex(const int32_t index) const noexcept;
bool IsInvalidArg(const int32_t start, const int32_t end) const noexcept;
bool IsAlreadyCalculated(const int32_t start, const int32_t end) const;
int32_t GetCalculatedResult(const int32_t start, const int32_t end) const;
void StoreCalculatedResult(const int32_t start, const int32_t end, const int32_t mcm);
MatrixChainMultiplication(const MatrixChainMultiplication &obj) = delete;
MatrixChainMultiplication &operator=(const MatrixChainMultiplication &obj) = delete;
MatrixChainMultiplication(MatrixChainMultiplication &&obj) = delete;
MatrixChainMultiplication &operator=(MatrixChainMultiplication &&obj) = delete;
private:
int32_t number_of_matrices_;
Matrix matrices_[kMaxNumberOfMatrices];
LookUp look_up_table_[kMaxNumberOfMatrices][kMaxNumberOfMatrices];
};
void CallMatrixChainMultiplication(std::istream &input_stream) {
input_stream.tie(0);
std::ios::sync_with_stdio(false);
MatrixChainMultiplication *matrix_chain_multiplication = new MatrixChainMultiplication();
try {
int32_t number_of_matrices;
input_stream >> number_of_matrices;
for (int32_t i = 0; i < number_of_matrices; ++i) {
int32_t number_of_rows, number_of_columns;
input_stream >> number_of_rows >> number_of_columns;
matrix_chain_multiplication->AddMatrix(number_of_rows, number_of_columns);
}
const int32_t multiply_count = matrix_chain_multiplication->CalculateMinMultiplyCount();
std::cout << multiply_count << std::endl;
} catch (...) {
std::cerr << "ERROR: CallMatrixChainMultiplication()" << std::endl;
throw;
}
delete matrix_chain_multiplication;
}
MatrixChainMultiplication::MatrixChainMultiplication() noexcept : number_of_matrices_(0) {}
MatrixChainMultiplication::~MatrixChainMultiplication() noexcept {}
void MatrixChainMultiplication::AddMatrix(const int32_t number_of_rows, const int32_t number_of_columns) {
if (number_of_matrices_ >= kMaxNumberOfMatrices) {
std::cerr << "ERROR: AddMatrix(): Number of matricis size exceeded a limit = " << kMaxNumberOfMatrices << std::endl;
throw 1;
}
const int32_t store_index = number_of_matrices_;
++number_of_matrices_;
matrices_[store_index] = GenerateMatrix(number_of_rows, number_of_columns);
}
int32_t MatrixChainMultiplication::CalculateMinMultiplyCount() {
const int32_t count = CalculateMcmRecursively(0, number_of_matrices_ - 1);
return count;
}
int32_t MatrixChainMultiplication::CalculateMcmRecursively(const int32_t start, const int32_t end) {
int32_t mcm;
if (start == end) {
mcm = 0;
} else if (IsInvalidArg(start, end)) {
std::cerr << "ERROR: CalculateMcmRecursively(): Invalid arg start = " << start << ", end = " << end << std::endl;
throw 1;
} else {
try {
if (IsAlreadyCalculated(start, end)) {
mcm = GetCalculatedResult(start, end);
} else {
mcm = INT32_MAX;
for (int32_t i = start; i <= end - 1; ++i) {
const int32_t temp_mcm =
matrices_[start].number_of_rows * matrices_[i].number_of_columns * matrices_[end].number_of_columns +
CalculateMcmRecursively(start, i) + CalculateMcmRecursively(i + 1, end);
mcm = std::min(mcm, temp_mcm);
}
StoreCalculatedResult(start, end, mcm);
}
} catch (...) {
std::cerr << "ERROR: CalculateMcmRecursively()" << std::endl;
throw;
}
}
return mcm;
}
bool MatrixChainMultiplication::IsInvalidIndex(const int32_t index) const noexcept {
return ((index < 0) || (index > number_of_matrices_));
}
bool MatrixChainMultiplication::IsInvalidArg(const int32_t start, const int32_t end) const noexcept {
const bool is_invalid_start = IsInvalidIndex(start);
const bool is_invalid_end = IsInvalidIndex(end);
const bool is_invalid_order = (start > end);
return is_invalid_start || is_invalid_end || is_invalid_order;
}
bool MatrixChainMultiplication::IsAlreadyCalculated(const int32_t start, const int32_t end) const {
if (IsInvalidArg(start, end)) {
std::cerr << "ERROR: IsAlreadyCalculated(): start = " << start << ", end = " << end << std::endl;
throw 1;
}
return look_up_table_[start][end].calculated;
}
int32_t MatrixChainMultiplication::GetCalculatedResult(const int32_t start, const int32_t end) const {
if (IsInvalidArg(start, end)) {
std::cerr << "ERROR: GetCalculatedResult(): start = " << start << ", end = " << end << std::endl;
throw 1;
}
return look_up_table_[start][end].mcm;
}
void MatrixChainMultiplication::StoreCalculatedResult(const int32_t start, const int32_t end, const int32_t mcm) {
if (IsInvalidArg(start, end)) {
std::cerr << "ERROR: GetCalculatedResult(): start = " << start << ", end = " << end << std::endl;
throw 1;
}
look_up_table_[start][end].mcm = mcm;
look_up_table_[start][end].calculated = true;
}
int32_t MatrixChainMultiplication::GetMultiplyCount(const Matrix &a, const Matrix &b) {
if (a.number_of_columns != b.number_of_rows) {
std::cerr << "ERROR: GetMultiplyCount(): Invalid a.number_of_columns = " << a.number_of_columns
<< ", b.number_of_rows = " << b.number_of_rows << std::endl;
throw 1;
}
return a.number_of_rows * a.number_of_columns * b.number_of_columns;
}
Matrix MatrixChainMultiplication::GetMultipliedMatrix(const Matrix &a, const Matrix &b) {
if (a.number_of_columns != b.number_of_rows) {
std::cerr << "ERROR: GetMultipliedMatrix(): Invalid a.number_of_columns = " << a.number_of_columns
<< ", b.number_of_rows = " << b.number_of_rows << std::endl;
throw 1;
}
const Matrix result = GenerateMatrix(a.number_of_rows, b.number_of_columns);
return result;
}
Matrix MatrixChainMultiplication::GenerateMatrix(const int32_t number_of_rows, const int32_t number_of_columns) {
Matrix mat;
mat.number_of_rows = number_of_rows;
mat.number_of_columns = number_of_columns;
return mat;
}
int main(int argc, char *argv[]) {
try {
CallMatrixChainMultiplication(std::cin);
} catch (...) {
std::cerr << "ERROR: main()" << std::endl;
}
return 0;
} | 0 | 80,085,667 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
long long a[200005] = {0}, i, n, m, ans= 99000000000;
int main()
{
scanf("%lld", &n);
for (i = 1; i <= n; i++)
{
scanf("%lld", &m);
a[i] = a[i - 1] + m;
}
for (i = 1; i<n; i++)ans = min(abs(a[i] * 2 - a[n]), ans);
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
type __VA_ARGS__; \
MACRO_VAR_Scan(__VA_ARGS__);
template <typename T>
void MACRO_VAR_Scan(T &t)
{
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &... rest)
{
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...) \
std::vector<type> __VA_ARGS__; \
MACRO_VEC_ROW_Init(n, __VA_ARGS__); \
for (int w_ = 0; w_ < n; ++w_) \
{ \
MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T &t)
{
t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &... rest)
{
first.resize(n);
MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &... rest)
{
std::cin >> first[p];
MACRO_VEC_ROW_Scan(p, rest...);
}
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define MAT(type, c, m, n) \
std::vector<std::vector<type>> c(m, std::vector<type>(n)); \
for (auto &R : c) \
for (auto &w : R) \
std::cin >> w;
template <typename T>
void MACRO_OUT(const T t) { std::cout << t; }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define yes() printf("yes\n")
#define no() printf("no\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ' << b << endl;
}
template <typename T>
T square(T x) { return x * x; }
template <class T>
T GCD(T a, T b)
{
T r;
while (a)
r = b, b = a, a = r % a;
return b;
}
template <class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repe(i, n) for (ll i = 0; i <= (n); i++)
#define repd(i, n) for (ll i = n; i > 0; i--)
#define repde(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define FORE(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.end(), x.begin()
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<ll> vl;
#define ERASE(x) x.erase(unique(ALL(x)), x.end());
bool yes = 0;
bool boo = 0;
int mx = -100000, mn = 100000;
int sum = 0;
int ans = 0;
int co = 0;
int main()
{
VAR(string, S);
while (S.length() != 0) {
S.pop_back();
int b = S.length() % 2;
int a = S.length() / 2;
if (b == 0) {
if (S.substr(0, a) == S.substr(a, a)) {
cout << S.length() << endl;
return 0;
}
}
}
cout << 0 << endl;
return 0;
} | 0 | 64,797,634 |
#include<stdio.h>
int main(){
int a;
int b;
scanf("%d %d",&a,&b);
int c;
c = a + b;
if(c==3){
printf("3");
}
if(c==4){
printf("2");
}
if(c==5){
printf("1");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
ll gcd(ll a,ll b){
if(b==0) return a;
return gcd(b,a%b);
}
void solve(){
ll n;
cin>>n;
if(n%2==1){
cout<<0;
}
else{
ll ans=0;
for(ll i=10;i<=n;i*=5)
ans += n/i;
cout<<ans;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
} | 0 | 8,910,040 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n;
cin>>n;
map<pair<ll,ll>,ll> path;
vector<vector<ll>> connect(n);
for (int i = 0; i < n-1; ++i)
{
ll a,b,c;
cin>>a>>b>>c;
a--;b--;
path[make_pair(a,b)]=c;
path[make_pair(b,a)]=c;
connect[a].push_back(b);
connect[b].push_back(a);
}
ll q,k;
cin>>q>>k;
k--;
vector<ll> dist(n);
dist[k]=0;
vector<bool> seen(n,false);
seen[k]=true;
queue<ll> next;
next.push(k);
while(!next.empty())
{
ll now=next.front();
next.pop();
for(const auto& e: connect[now])
{
if(seen[e]) continue;
dist[e]=dist[now]+path[make_pair(now,e)];
seen[e]=true;
next.push(e);
}
}
for (int i = 0; i < q; ++i)
{
ll x,y;
cin>>x>>y;
x--;y--;
cout<<dist[x]+dist[y]<<endl;
}
} | #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 repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
using namespace std;
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define pp pair<ll, pair<ll, ll>>
#define fi first
#define se second
void print(Vl vec){
rep(i, 0, sz(vec)){
if(i) cout << " ";
cout << vec[i];
}
coel;
}
ll n, a, b, c;
ll ans = INF;
Vl l;
ll sum = 0;
void saiki(ll x, ll y, ll z, ll w, ll cost){
if(w == n){
if(x==0 || y==0 || z==0) return;
cost += abs(a-x)+abs(b-y)+abs(c-z);
chmin(ans, cost);
}else{
saiki(x+l[w], y, z, w+1, x ? cost+10 : cost);
saiki(x, y+l[w], z, w+1, y ? cost+10 : cost);
saiki(x, y, z+l[w], w+1, z ? cost+10 : cost);
saiki(x, y, z, w+1, cost);
}
}
int main() {
cin >> n >> a >> b >> c;
l.resize(n);
rep(i, 0, n) cin >> l[i];
rep(i, 0, n) sum += l[i];
saiki(0, 0, 0, 0, 0);
co(ans);
return 0;
} | 0 | 91,638,923 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}
const char newl = '\n';
int main() {
int n,m;
cin >> n >> m;
vector<int> dist(n,0);
vector<vector<int>> edges(n);
for (int i = 0;i < m;++i) {
int u,v;
scanf("%d%d",&u,&v);
u--;v--;
edges[u].push_back(v);
edges[v].push_back(u);
}
ll a = 0,b = 0,c = 0,ans = 0;
for (int i = 0;i < n;++i) if (dist[i] == 0) {
if (edges[i].size() == 0) {
c++;
continue;
}
queue<int> que;
que.push(i);
bool nibu = true;
while (!que.empty()) {
int t = que.front();que.pop();
for (int j : edges[t]) {
if (dist[j]) {
if (dist[j]%2 == dist[t]%2) nibu = false;
} else {
dist[j] = dist[t]+1;
que.push(j);
}
}
}
if (nibu) {
ans += 2;
a++;
} else {
ans += 1;
b++;
}
}
ans += a*(a-1)*2+b*(b-1)+b*a*2+(2*n*c-c*c);
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main(){
int n;
int x[4][3][10] = { { {} } };
cin >> n;
for (int i = 0; i < n; i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
x[a - 1][b - 1][c - 1] += d;
if (x[a - 1][b - 1][c - 1] > 9){
x[a - 1][b - 1][c - 1] = 9;
}
if (x[a - 1][b - 1][c - 1] < 0){
x[a - 1][b - 1][c - 1] = 0;
}
}
for (int i = 0; i < 4; i++){
for (int j = 0; j < 3; j++){
for (int k = 0; k < 10; k++){
cout << " " << x[i][j][k];
}
cout << endl;
}
if (i == 0 || i == 1 || i == 2){
cout << "####################" << endl;
}
}
return 0;
} | 0 | 73,744,732 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
int N; cin >> N;
map<string, int> mp;
vector<string> W(N);
rep(i,N){
cin >> W[i];
mp[W[i]]++;
}
rep2(i,1,N){
if(W[i][0] != W[i-1][W[i-1].size()-1]) {cout << "No" << endl; return 0;}
}
for (auto itr : mp){
if(itr.second > 1) {cout << "No" << endl; return 0;}
}
cout << "Yes" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,K;cin>>H>>W>>K;
char A[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++) cin>>A[i][j];
}
int ans=0;
for(int s=0;s<(1<<H);s++){
for(int t=0;t<(1<<W);t++){
int black=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if((s & 1<<i)==0 && (t & 1<<j)==0 && A[i][j]=='#') black++;
}
}
if(black==K) ans++;
}
}
cout<<ans<<endl;
} | 0 | 27,158,845 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main(){
char a,b;
cin >> a>>b;
if(a=='H'&&b=='H') cout << 'H' <<endl;
else if(a=='H'&&b=='D') cout << 'D' <<endl;
else if(a=='D'&&b=='H') cout << 'D' <<endl;
else cout << 'H' << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define lb lower_bound
#define ub upper_bound
#define fact(n) rep(i, 1, n+1)ft.pb((ft[i-1]*i)%mod);
#define mod_in(a) exp(a, mod-2)
#define ncr(n, r) ((ft[n]*mod_in((ft[r]*ft[(n)-(r)])%mod))%mod)
#define deb(x) cout << #x << " " << x << endl;
#define flash ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
ll prime[100002];
ll exp(ll a,ll b);
void sieve(ll n);
ll gcd(ll a ,ll b);
ll countdigit(ll n);
void solve(){
string s; cin >> s;
ll ans=0,c=0;
rep(i,0,s.size()){
if(s[i]=='R'){
c++;
ans=max(ans,c);
}
else {
ans=max(ans,c);
c=0;
}
}
if(s[2]=='R')ans=max(ans,c);
cout<<ans<<endl;
}
int main()
{
ll t=1;
while(t--) {
solve();
}
}
ll exp(ll a, ll b) {
int res=1;
while(b) {
if(b&1)
res=(res*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return res;
}
ll gcd(ll a,ll b){
if(a==0)return b;
return gcd(b%a,a);
}
void sieve(ll n) {
for(ll i=0;i<=n;i++) {
prime[i]=1;
}
prime[0]=0;prime[1]=0;
for(ll i=2;i<=n;i++) {
if(prime[i]==1) {
for(ll j=2;i*j<=n;j++) {
prime[i*j]=0;
}
}
}
}
ll countdigit(ll n)
{
return floor(log10(n) + 1);
} | 0 | 16,147,395 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a-1; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define rALL(x) x.rbegin(), x.rend()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main(){
ll n; cin >> n;
vector<ll> v(n);
vector<pair<ll, ll>> res;
rep(i, n) cin >> v[i];
sort(ALL(v));
FOR(i, 1, n-1){
if(0<v[i]){
res.emplace_back(v[0], v[i]);
v[0] -= v[i];
}else{
res.emplace_back(v[n-1], v[i]);
v[n-1] -= v[i];
}
}
res.emplace_back(v[n-1], v[0]);
cout << v[n-1] - v[0] << endl;
for(auto x: res) cout << x.first << ' ' << x.second << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50 + 5, mod = 1e9 + 7;
int n, k;
int a[N], dp[N][N][102];
int solve(int l, int r, int left)
{
if (l > r)
return 0;
if (dp[l][r][left] != -1)
return dp[l][r][left];
int ans = 0;
if (a[l] < 0)
{
if (left > 0)
ans = max(ans, solve(l + 1, r, left - 1) + a[l]);
if (left > 1)
ans = max(ans, solve(l + 1, r, left - 2));
}
if (a[l] >= 0 && left > 0)
ans = max(ans, solve(l + 1, r, left - 1) + a[l]);
if (a[r] < 0)
{
if (left > 0)
ans = max(ans, solve(l, r - 1, left - 1) + a[r]);
if (left > 1)
ans = max(ans, solve(l, r - 1, left - 2));
}
if (a[r] >= 0 && left > 0)
ans = max(ans, solve(l, r - 1, left - 1) + a[r]);
return dp[l][r][left] = ans;
}
int main()
{
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
cout << solve(0, n - 1, k);
return 0;
} | 0 | 52,326,286 |
ll ten_ruijo_amari = 1;
ll cur = 0;
val[cur]++;
REP(i, n) {
cur = (cur + (s[n - 1 - i] - '0') * ten_ruijo_amari) % p;
ten_ruijo_amari = (ten_ruijo_amari * 10) % p;
val[cur]++;
}
ll ans = 0;
REP(i, p) ans += val[i] * (val[i] - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
const ll MOD = (ll)pow(10,9)+7;
int main(){
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
ll T1 = 0;
rep(i,n){
for(int j=i+1;j<n;j++){
if(a[i]>a[j]) T1 ++;
}
}
ll T2 = 0;
rep(i,n){
rep(j,n){
if(a[i]>a[j]) T2 ++;
}
}
ll ans = 0;
ans += T1*k;
ans %= MOD;
if(k%2 == 0) ans += (T2*k/2)%MOD*(k-1);
if(k%2 == 1) ans += (T2*(k-1)/2)%MOD*k;
ans %= MOD;
cout << ans << endl;
} | 0 | 44,262,482 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define M 1000000007
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, i, j, wt, m;
cin >> n >> m;
vector<string> v(n);
vector<vector<int>> dp(n, vector<int> (m));
for(i = 0; i < n; i++)
{
cin >> v[i];
}
dp[0][0] = 1;
for(i = 0; i < n; i++)
{
for(j = 0; j < m; j++)
{
if(i == 0 && j == 0)
continue;
if(i == 0)
{
if(v[i][j] == '#')
dp[i][j] = 0;
else
dp[i][j] = dp[i][j-1] ;
}
else if(j == 0)
{
if(v[i][j] == '#')
dp[i][j] = 0;
else
dp[i][j] = dp[i-1][j] ;
}
}
}
for(i = 1; i < n; i++)
{
for(j = 1; j < m; j++)
{
if(v[i][j] == '#')
dp[i][j] = 0;
else
dp[i][j] = (dp[i][j-1] + dp[i-1][j]) % M;
}
}
cout << dp[n-1][m-1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
vector<int> dijkstra(int s, Graph<pii> &G) {
int N = G.size();
vector<int> dist(N, 1e9);
dist[s] = 0;
priority_queue<pii, vector<pii>, greater<pii>> que;
que.push({0, s});
while (!que.empty()) {
pii p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first)
continue;
for (auto np : G[v]) {
int nv = np.first, cost = np.second;
if (dist[v] + cost < dist[nv]) {
dist[nv] = dist[v] + cost;
que.push({dist[nv], nv});
}
}
}
return dist;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
Graph<pii> G(N);
Graph<int> dist;
for (int i = 0; i < M; ++i) {
int a, b, c;
cin >> a >> b >> c;
a--, b--;
G[a].push_back({b, c});
G[b].push_back({a, c});
}
for (int i = 0; i < N; ++i)
dist.push_back(dijkstra(i, G));
int ans = 0;
for (int i = 0; i < N; ++i) {
for (auto p : G[i]) {
if (i >= p.first)
continue;
if (dist[i][p.first] < p.second)
ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 53,599,667 |
#include<iostream>
using namespace std;
int main() {
int a[101];
for(int i = 0; i < 101; i ++) {
a[i] = 0;
}
int x;
int max = 0;
while(cin >> x) {
a[x]++;
if(a[x] > max) {
max = a[x];
}
}
for(int i = 1; i < 101; i++) {
if(a[i] == max) {
cout << i << endl;
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
int n;ll l;
cin >> n >> l;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
vector<ll> sum(n+1);
sum[0] = 0;
rep(i,n){
sum[i+1] = sum[i] + a[i];
}
rep(i,n-1){
if(sum[i+2]-sum[i]>=l){
cout << "Possible" << "\n";
for(int j=1;j<=i;++j){
cout << j << "\n";
}
for(int j=n-1;j>=i+2;--j){
cout << j << "\n";
}
cout << i+1 << "\n";
return 0;
}
}
cout << "Impossible" << "\n";
return 0;
} | 0 | 71,170,070 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
string s;
cin >> s;
int n = s.size();
bool res = false;
for (int i = 0; i <= 7; i++) {
int j = 7 - i;
string pre = s.substr(0, i);
string suf = s.substr(n-j, j);
string cp = pre + suf;
if (cp == "keyence") res = true;
}
if (res) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
char n='0';
int cnt=0,ans=0;
for(int i=0;i<s.size();i++){
if(cnt==0){
n=s.at(i);
cnt++;
}else{
if(n==s.at(i)){
cnt++;
}else{
cnt--;
ans+=2;
}
}
}
cout << ans << endl;
return 0;
} | 0 | 89,361,514 |
#include<bits/stdc++.h>
#define int long long
#define double long double
#define pb emplace_back
#define pf emplace_front
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define x first
#define y second
#define endl '\n'
#define hell 998244353
#define PI 3.141592653589
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAX 2000000000000000000
#define M 1000000007
using namespace std;
signed main()
{
tezz
vi v(3);
mi m;
for(int &x:v){
cin>>x;
m[x]++;
}
for(int x:v){
if(m[x] == 1) {cout<<x; break;}
}
} | #include <iostream>
#include <vector>
using namespace std;
#define max 2000001
#define vmax 10000
int main(){
int c[vmax+1];
int n,i,j;
cin >> n;
unsigned short *A, *B;
A = new unsigned short[n + 1];
B = new unsigned short[n + 1];
for (i = 0; i<vmax;i++){
c[i]=0;
}
for (i = 1;i<=n; i++){
cin >> A[i];
c[A[i]]++;
}
for (i = 1;i<=vmax;i++){
c[i] = c[i -1] + c[i];
}
for (j = 0; j<=n;j++){
B[c[A[j]]] = A[j];
c[A[j]]--;
}
for (i = 1; i<=n ;i++){
if (i>1) cout << " ";
cout << B[i];
}
cout<< endl;
return 0;
} | 0 | 21,562,779 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template<typename T>
void fin (T a){
cout<<a<<endl;
exit(0);
}
template<typename S>
void print(S a){
cout<<a<<endl;
}
template<typename U>
void pprint(U a){
cout<<a<<" ";
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin >> s>>t;
int ans = t.size();
for (int i = 0; i <= s.size() - t.size(); i++) {
int diff = 0;
rep(k,t.size()){
if(s[i+k] != t[k]){
diff++;
}
}
ans = min(diff,ans);
}
fin(ans);
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "{";
for (int i = 0; i < v.size(); ++i) {
if(i) os << ", ";
os << v[i];
}
return os << "}";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "{" << p.first << ", " << p.second << "}";
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (auto &&i : v) scanf("%d", &i), i--;
vector<int> c(n);
for (auto &&i : c) scanf("%d", &i);
ll ans = -INF<int>;
vector<int> visited(n);
for (int i = 0; i < n; ++i) {
if(visited[i]) continue;
vector<int> a;
a.emplace_back(i);
a.emplace_back(v[i]);
visited[i] = 1;
visited[v[i]] = 1;
while(a.back() != i){
a.emplace_back(v[a.back()]);
visited[a.back()] = 1;
}
a.pop_back();
vector<ll> aa{0};
ll S = 0;
for (auto &&j : a) aa.emplace_back(aa.back()+c[j]), S += c[j];
for (auto &&j : a) aa.emplace_back(aa.back()+c[j]);
for (int j = 0; j < a.size(); ++j) {
for (int l = 1; l <= min<int>(a.size(),k); ++l) {
ans = max(ans, aa[j+l]-aa[j]);
}
}
if(k/a.size()){
for (int j = 0; j < a.size(); ++j) {
for (int l = 0; l <= a.size(); ++l) {
ans = max(ans, aa[j+l]-aa[j]+(k-l)/(int)a.size()*S);
}
}
}
}
cout << ans << "\n";
return 0;
} | 0 | 40,439,124 |
#include <iostream>
#include <queue>
#include <vector>
#include <climits>
using namespace std;
#define NODE_NUM 101
#define INF INT_MAX
int weight[NODE_NUM][NODE_NUM];
int WarshallFloyd(int n){
for(int k=0; k < n; k++) {
for(int i=0; i < n; i++) {
for(int j=0; j < n; j++) {
if(weight[i][k] != INF && weight[k][j] != INF)
weight[i][j] = min(weight[i][j], weight[i][k] + weight[k][j]);
}
}
}
for(int v = 0; v < n; v++){
if(weight[v][v] < 0) return -1;
}
return 1;
}
int main( ){
int i, V, E, u, v, c;
int rtn;
cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j =0; j < V; j++) {
if(i == j) weight[i][j] = 0;
else weight[i][j] = INF;
}
}
for (i = 0; i < E; i++) {
cin >> u >> v >> c;
weight[u][v] = c;
}
rtn = WarshallFloyd(V);
if (rtn == -1) {
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if(weight[i][j] == INF){
cout << "INF";
}else{
cout << weight[i][j];
}
if (j < V-1) {
cout << " ";
}
else{
cout << endl;
}
}
}
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;
#include <bits/stdc++.h>
#define ll long long
using namespace std;
bool comp(pair<ll, ll> a, pair<ll , ll> b) {
if(a.first != b.first){
return a.first < b.first;
}
if(a.second != b.second){
return a.second < b.second;
}else{
return true;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
ll k;
ll g,e;
ll q;
cin>>n>>m;
vector<P> p(m);
vector<P> ps(m);
rep(i,m){
cin>>a>>b;
p[i]=P(a,b);
ps[i]=P(a,b);
}
sort(all(p),comp);
map<P,ll> mp;
ll si=p[0].first;
ll ctr=1;
rep(i,m){
if(si!=p[i].first){
ctr=1;
si=p[i].first;
}
mp[p[i]]=ctr;
ctr++;
}
rep(i,m){
cout<<setfill('0')<<right<<setw(6)<<ps[i].first;
cout<<setfill('0')<<right<<setw(6)<<mp[ps[i]]<<endl;
}
return 0;
} | 0 | 58,293,485 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct edge {
ll to;
ll cost;
};
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') return 0;
if (c == '1') return 1;
if (c == '2') return 2;
if (c == '3') return 3;
if (c == '4') return 4;
if (c == '5') return 5;
if (c == '6') return 6;
if (c == '7') return 7;
if (c == '8') return 8;
if (c == '9') return 9;
return -1;
}
char to_char(int i){
if (i == 0) return '0';
if (i == 1) return '1';
if (i == 2) return '2';
if (i == 3) return '3';
if (i == 4) return '4';
if (i == 5) return '5';
if (i == 6) return '6';
if (i == 7) return '7';
if (i == 8) return '8';
if (i == 9) return '9';
return ' ';
}
ll BS(vector<ll> V, ll Q) {
sort(V.begin(), V.end());
int L = -1;
int R = V.size();
while (R - L > 1) {
int M = (L + R) / 2;
if (V.at(M) < Q) L = M;
else R = M;
}
if (R == int(V.size())) return INF;
return V.at(R);
}
bool PN(int x) {
if (x <= 1) return false;
if (x == 2) return true;
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0) return false;
}
return true;
}
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1) ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
int main() {
cout << fixed << setprecision(16);
string A, B;
cin >> A >> B;
if (A.size() > B.size()) {
cout << "GREATER" << endl;
}
else if (B.size() > A.size()) {
cout << "LESS" << endl;
}
else {
for (int i = 0; i < int(A.size()); i++) {
if (ctoi(A.at(i)) > ctoi(B.at(i))) {
cout << "GREATER" << endl;
break;
}
else if (ctoi(A.at(i)) < ctoi(B.at(i))) {
cout << "LESS" << endl;
break;
}
if (i == int(A.size() - 1)) {
cout << "EQUAL" << endl;
break;
}
}
}
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int long long
void solve() {
int n, k;
cin >> n >> k;
vector<int> h(n + 1);
h[0] = 0;
rep(i, n) {
cin >> h[i + 1];
}
ll dp[330][330];
rep(i, 330) rep(j, 330) dp[i][j] = 1e+14;
dp[0][0] = 0;
rep(x, n + 1) {
rep(y, x + 1) {
for(int i = x + 1; i <= n; ++i) {
chmin(dp[i][y + i - 1 - x], dp[x][y] + max(0LL, h[i] - h[x]));
}
}
}
ll res = INF;
for(int i = n; i >= n - k; i--) {
for(int j = 0; j <= k - (n - i); ++j) {
chmin(res, dp[i][j]);
}
}
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 86,804,018 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0; i<(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
int main(){
ll n,k; cin >> n >> k;
if(k>=n){
cout << n;
return 0;
}
string s; cin >> s;
queue<ll> q;
q.push(0);
char prev='1';
ll num_1=0;
ll num_0=0;
vector<ll> v;
rep(i,n){
char cur = s[i];
if(i>0&&prev!=cur&&cur=='1'){
q.push(num_1+num_0);
num_1=0;
num_0=0;
}
if(prev!=cur&&cur=='0'){
v.push_back(i);
}
if(cur=='1'){
num_1++;
}else{
num_0++;
}
prev=cur;
}
q.push(num_1+num_0);
v.push_back(n);
if(v.size()<=k){
cout << n;
return 0;
}
ll ans=0;
ll ruiseki=0;
for(ll i=k; i<v.size(); i++){
ruiseki+=q.front();
q.pop();
ans=max(ans,v[i]-ruiseki);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
template<class T> inline void read(T &x){
x=0;
T f=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-'){
f=-1;
}
ch=getchar();
}
while(ch<='9' && ch>='0'){
x=x*10+(ch-'0');
ch=getchar();
}
x*=f;
}
int n,m;
int main(){
read(n),read(m);
dsu d(n);
int x,y,z;
for(int i=1;i<=m;i++){
read(x),read(y),read(z);
if(x==1){
if(d.same(y,z)){
printf("1\n");
}
else{
printf("0\n");
}
}
if(x==0){
d.merge(y,z);
}
}
return 0;
} | 0 | 89,150,665 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
#define chmax(x,y) (x = max(x, y))
template<class T1, class T2>
T1 intpow(const T1& a, const T2 n) {
if (n == 0) return 1;
auto t = intpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
int main() {
int n, k; cin >> n >> k;
cout << k * intpow(k-1, n-1) << endl;
return 0;
} | #include <iostream>
#include <vector>
int main(){
using namespace std;
int n,x,i,j,k,l,ans;
vector<int> vn;
vector<int> vx;
while(1){
cin >> n >> x;
if(n==0&&x==0){
break;
}
vn.push_back(n);
vx.push_back(x);
}
int size = vn.size();
for(i=0;i<size;i++){
ans = 0;
for(j=1;j<=(vx[i]/3);j++){
for(k=j+1;k<=vn[i];k++){
for(l=(vx[i]/3)+1;l<=vn[i];l++){
if(j+k+l==vx[i]&&j<k&&k<l){
ans++;
}
}
}
}
cout << ans << endl;
}
return 0;
} | 0 | 56,034,457 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b >> c >> d;
ans = a * c;
ans = max(ans, a * d);
ans = max(ans, b * c);
ans = max(ans, b * d);
Cout(ans);
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
int main()
{
ll m,n;
cin>>m>>n;
ll ans;
if( m == 1 && n == 1){
ans = 1;
}else if( m == 1 || n == 1){
ll l = min(m,n);
ll k = max(m,n);
ans = k - 2;
}else if( m > 1 && n > 1){
ans = m*n - 2*(m + n - 2);
}
cout<<ans<<endl;
return 0;
} | 0 | 88,644,137 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#include <cstring>
#pragma region header
using namespace std;
using ll = long long;
using lint = long long;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
using ui = unsigned int;
using qul = queue<ll>;
using pql = priority_queue<ll>;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
#pragma region header
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i <= n; i++)
#define INF (ll)10000000000000000
#define mod (ll)1000000007
#define P pair<lint,lint>
#pragma endregion
#pragma endregion
int main(void) {
lint n, m; cin >> n >> m;
vl k(m);
vector<vector<lint>> s(m);
set<pair<lint, lint>> t;
for (int i = 0; i < m; i++) {
cin >> k[i];
s[i].resize(k[i]);
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
t.insert({ i,s[i][j] - 1 });
}
}
vector<bool> r(n);
lint ans = 0;
vector<short> p(m);
for (int i = 0; i < m; i++) cin >> p[i];
for (int a = 0; a < (1 << n); a++) {
for (int i = 0; i < n; i++) {
if ((a >> i) & 1) r[i] = true;
else r[i] = false;
}
for (int i = 0; i < m; i++) {
lint cnt = 0;
for (int j = 0; j < n; j++) {
if (r[j]) {
if (t.count({ i,j })) cnt++;
}
}
if (cnt % 2 != p[i]) goto kaage;
}
ans++;
kaage:;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
const int INFTY =2147483647;
int main(){
bool A[105];
REP(i,105) A[i]=true;
int n,k,d,ans,a;
cin>>n>>k;
ans=n;
REP(i,k){
cin>>d;
REP(j,d){
cin>>a;
if(A[a]==true){
ans--;
A[a]=false;
}
}
}
cout<<ans<<endl;
} | 0 | 49,476,588 |
#include<bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
typedef pair<ll, ll> P;
int dy[] = {1, 0, 0, -1};
int dx[] = {0, 1, -1, 0};
int main() {
int n; cin >> n;
int ans = 800 * n;
ans -= (n/15)*200;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Vc vector<char>
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
using namespace std;
signed main(){
int N,X,M;
cin >> N >> X >> M;
map<int,int> A,B;
A[1] = X;
int now = X;
int start,end,last;
int cnt = 1;
int sum = 0;
bool loop = false;
rep(i,0,N){
if(B[now]!=0){
start = B[now];
end = i+0;
loop = 1;
break;
}
B[now] = i+1;
now = now*now%M;
}
repeq(i,2,200000){
A[i] = A[i-1] * A[i-1] % M;
}
int ans = 0;
if (loop){
repeq(i,1,start - 1){
ans += A[i];
}
repeq(i,start,end){
sum += A[i];
}
cnt = (N - (start - 1))/(end - (start - 1));
ans += sum * cnt;
last = start + (end - (start - 1)) * cnt;
repeq(i,last,N){
ans += A[i- (last - start)];
}
} else {
repeq(i,1,N){
ans += A[i];
}
}
cout << ans;
} | 0 | 100,895,658 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> s;
void solve(){
int a,b;
cin>>a>>b;
if(a+b==15)cout<<"+"<<endl;
else if(a*b==15)cout<<"*"<<endl;
else cout<<"x"<<endl;
}
int main(){
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
typedef long long ll ;
const ll MOD = 1000000007;
ll dp[2100][2100];
ll sum[2100][2100];
int main() {
int N,M;
cin >> N >> M;
vector< int > S(N+3),T(M+3);
REP(i,N) cin >> S[i];
REP(i,M) cin >> T[i];
dp[0][0] = 1;
sum[0][0] = 1;
for(int i=0; i<N+1; ++i) {
for(int j=0; j<M+1; ++j) {
if ( i!=0 && j!=0 ) {
if (S[i-1] == T[j-1]) dp[i][j] = sum[i-1][j-1];
sum[i][j] = (sum[i-1][j] + sum[i][j-1]) % MOD;
sum[i][j] = (sum[i][j] + dp[i][j]) % MOD;
sum[i][j] -= sum[i-1][j-1];
if ( sum[i][j] < 0 ) {
sum[i][j] += MOD;
}
} else {
sum[i][j] = 1;
}
}
}
cout << sum[N][M] << endl;
} | 0 | 71,692,623 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
priority_queue<int>que;
int ans = 0;
ll sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
ans++;
sum += B[i] - A[i];
} else {
que.push(A[i]-B[i]);
}
}
if (sum == 0) {
cout << 0 << endl;
return 0;
}
while (!que.empty()) {
int x = que.top();
que.pop();
sum -= x;
ans++;
if (sum <= 0) {
break;
}
}
if (sum > 0) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n;
int m;
int p;
int sum = 0;
int k;
scanf("%d%d%d", &n, &m, &p);
if (n == 0 && m == 0 && p == 0) return 0;
for (int i=0; i<n; i++) {
int x;
scanf("%d", &x);
if (i == m-1) k = x;
sum += x;
}
if (k == 0) puts("0");
else printf("%d\n", sum*(100-p)/k);
}
} | 0 | 84,695,159 |
#include <bits/stdc++.h>
using namespace std;
const int INF=999999999;
char a[10][10];
int main() {
string S;
cin>>S;
string T[4]={"dream", "dreamer", "erase", "eraser"};
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){reverse(T[i].begin(),T[i].end());}
bool can=true;
for(int i=0;i<S.size();){
bool canT=false;
for(int j=0;j<4;j++){
string d=T[j];
if(S.substr(i,d.size())==T[j]){
canT=true;
i+=d.size();
}
}
if(canT==false){can=false;break;}
}
if(can){cout<<"YES"<<endl;}
else{cout<<"NO"<<endl;}
return 0;} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=1e9+7;
int main(){
int X,Y; cin>>X>>Y;
if((2*Y-X)%3||(2*X-Y)%3||X*2<Y||Y*2<X){
cout<<0<<endl;
}else{
int a=(2*Y-X)/3;
int b=(2*X-Y)/3;
if(a<b) swap(a,b);
ll nx=a+1,dx=1,n=1,d=1;
while(b>0){
n=n*nx%mod;
d=d*dx%mod;
nx++,dx++,b--;
}
ll e=mod-2;
dx=d,d=1;
while(e>0){
if(e&1){
d=d*dx%mod;
}
dx=dx*dx%mod;
e>>=1;
}
cout<<n*d%mod<<endl;
}
} | 0 | 27,220,117 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int K;
cin >> K;
vector<ll> A(K,0);
for(int i=0;i<K;i++){
cin >> A[K-1-i];
}
ll U=2,L=2;
for(int i=0;i<K;i++){
ll S = U/A[i];
if(S*A[i]<U){
S ++;
}
ll T = L/A[i];
if(T<S){
cout << -1 << endl;
return 0;
}else{
U = S*A[i];
L = (T+1)*A[i] -1;
}
}
cout << U << " " << L << endl;
} | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,y) for(long long x=0;x<y;x++)
#define makevec(x,y,n) vector <x> y(n); for(ll i=0;i<n;i++) cin>>y[i]
#define M (ll)1000000007
#define MM (ll) 1e8
#define INF (ll) 1e18
# define IOS ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
template <typename T>
T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
bool sortbysec(const pair <ll,ll> &a,const pair <ll,ll> &b){
return a.second<b.second;
}
struct cmp {
bool operator() (const pair<int, int> &a, const pair<int, int> &b) const {
int lena = a.second - a.first + 1;
int lenb = b.second - b.first + 1;
if (lena == lenb) return a.first < b.first;
return lena > lenb;
}
};
struct c_h {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
ll calcpow(ll x, ll y)
{
ll temp;
if(y == 0)
return 1;
temp = calcpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
{
if(y > 0)
return x * temp * temp;
else
return (temp * temp) / x;
}
}
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b,a%b);
}
ll egcd(ll a, ll b, ll &x,ll &y){
if(b==0){
x=1;
y=0;
return a;
}
ll x1;
ll y1;
ll g=egcd(b,a%b,x1,y1);
x=y1;
y=x1-y1*(a/b);
return g;
}
bool isprime(ll a){
bool flag=1;
for(ll i=2;i*i<=a;i++){
if(a%i==0) {flag=0; break;}
}
return flag;
}
ll dx8[8]={1,0,-1,0,1,-1,1,-1};
ll dy8[8]={0,1,0,-1,1,-1,-1,1};
ll dx4[4]={0,0,1,-1};
ll dy4[4]={1,-1,0,0};
ll N=1e5+5;
int main(){
IOS;
make2(ll,n,y);
bool f=0; y/=1000;
for(ll c=0;c<=n;c++){
if((5*(n+c)-y)%4==0 && (y-n-9*c)%4==0 && y-n-9*c>=0 && 5*(n+c)-y>=0) {
cout<<c<<" "<<(y-n-9*c)/4<<" "<<(5*(n+c)-y)/4<<endl; f=1; break;
}
}
if(!f) cout<<"-1 -1 -1 \n";
return 0;
} | 0 | 78,308,388 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<pii,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf=sizeof(Def)==sizeof(long long)?9e18:1e9;
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};
int main(){
int t=-1;
vi in(15);
in[0]=1;
rep(i,14)in[i+1]=in[i]*10;
rep(i,10){
cout<<"? "<<in[i+1]<<endl;
char a;cin>>a;
if(a!='Y'){
t=i+1;
break;
}
}
if(t==-1){
rep(i,11){
cout<<"? "<<2*in[i]<<endl;
char a;cin>>a;
if(a=='Y'){
t=i+1;
break;
}
}
cout<<"! "<<in[t-1]<<endl;
return 0;
}
ll l=in[t-1],r=in[t]-1;
while(r-l>1){
ll h=(l+r)/2;
cout<<"? "<<10*h<<endl;
char a;cin>>a;
if(a=='Y')r=h;
else l=h;
}
cout<<"! "<<r<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll mat[105][105],mark[105][105];
int n,m;
int main()
{
FastRead
cin>>n>>m;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
mat[i][j]=1e9;
for(int i=0; i<m; i++)
{
int u,v,c;
cin>>u>>v>>c;
mat[u][v]=c;
mat[v][u]=c;
mark[u][v]=c;
mark[v][u]=c;
}
int ans=0;
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(mat[i][j]>mat[i][k]+mat[k][j])
{
mat[i][j]=mat[i][k]+mat[k][j];
if(mark[i][j])
{
ans++;
mark[i][j]=0;
mark[j][i]=0;
}
}
}
cout<<ans<<endl;
return 0;
} | 0 | 55,957,553 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
ll sum=0;
for(ll i=0;i<s.length();i++)
{
sum+=s[i]-'0';
}
if(sum%9==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
ll binomialCoeff(ll n, ll k)
{
ll C[k+1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (ll i = 1; i <= n; i++)
{
for (ll j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j-1];
}
return C[k];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=nxt(),k2=nxt();
vector <pair<int,int> > v1(n),v2(n);
unsigned long long int test=4e18;
for(int i=0;i<n;i++)
{
cin>>v1[i].first>>v1[i].second;
v2[i]={v1[i].second,v1[i].first};
}
sort(all(v1));
sort(all(v2));
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=0;k<n;k++)
for(int m=k+1;m<n;m++)
{
int x1=v1[i].first,x2=v1[j].first,y1=v2[k].first,y2=v2[m].first;
int c=0;
for(auto i:v1)
{
if(i.first>=x1&&i.first<=x2&&i.second>=y1&&i.second<=y2)
c++;
}
if(c>=k2)
{
unsigned long long int temp=x2-x1;
temp*=(y2-y1);
if(temp<test)
test=temp;
}
}
cout<<test<<endl;
return 0;
} | 0 | 97,659,107 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string sample[4] = {"dream","dreamer","erase","eraser"};
string s; cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < 4; i++) reverse(sample[i].begin(), sample[i].end());
bool count1 = true;
for (int i = 0; i < s.size(); ){
bool count2 = false;
for (int j = 0; j < 4; j++){
string xxx = sample[j];
if (s.substr(i, xxx.size()) == xxx){
count2 = true;
i += xxx.size();
}
}
if (!count2){
count1 = false;
break;
}
}
if (count1) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll S[2005];
ll T[2005];
ll dp[2005][2005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
REP(i, N) {
cin >> S[i];
}
REP(i, M) {
cin >> T[i];
}
memset(dp, 0, sizeof(dp));
REP(i, M + 1) {
dp[0][i] = 1;
}
REP(i, N) {
dp[i + 1][0] = 1;
REP(j, M) {
dp[i + 1][j + 1] = dp[i + 1][j] + dp[i][j + 1];
if (S[i] != T[j])
dp[i + 1][j + 1] -= dp[i][j];
dp[i + 1][j + 1] = (dp[i + 1][j + 1] + MOD) % MOD;
}
}
cout << dp[N][M] << endl;
return 0;
} | 0 | 15,056,479 |
#include <stdio.h>
using namespace std;
int main(void){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<b&&b<c){
printf("Yes\n");
}else{
printf("No\n");
}
} | #include <stdio.h>
#include <math.h>
int calc_max_sum(long a, long b){
long long inte = sqrt(a * b);
if((inte + 1) * inte < a * b){
return inte * 2 + 1;
}else if(inte * inte <= a * b){
return inte * 2;
}
}
bool is_square_number(long s){
long inte = long(sqrt(s));
if(inte * inte == s){
return true;
}else{
return false;
}
}
void answer(long long a, long long b){
long long ans = calc_max_sum(a, b) - 1;
ans -= 1;
if(is_square_number(a * b)){
ans -= 1;
if (a == b){
ans = (a - 1) * 2;
}
}
printf("%lld\n", ans);
}
int main(void){
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
long long a, b;
scanf("%lld", &a);
scanf("%lld", &b);
answer(a, b);
}
} | 0 | 84,284,126 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string>
#define rp(i,a,b) for(int (i)=(int)(a);i<(int)(b);++i)
typedef long long ll;
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a/b<<endl;
cout<<a%b<<endl;
cout<< fixed << setprecision(6) << double(a)/double(b) << endl;
return 0;
}; | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(1, 1E8); \
auto rnd = bind(__dis, __gen)
const int INF = 1E18;
const int mod = 1E9 + 7;
const int maxn = 1E6 + 5;
vector<int> cnt(maxn, 0);
int32_t main() {
fastIO();
int n, tok = 1;
cin >> n;
while (!cnt[n]) ++tok, cnt[n] = 1, n = (n&1 ? 3*n + 1 : n/2);
cout << tok << "\n";
return 0;
} | 0 | 91,707,597 |
#include<stdio.h>
int main()
{
char a,a1;
scanf("%c",&a);
a1=a+1;
printf("%c",a1);
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void testcase(){
string s,t;
cin >> s >> t;
int ns=s.length();
int nt=t.length();
int mx=0;
for(int i=0;i<ns-nt+1;i++){
int c=0;
for(int j=0;j<nt;j++){
if(s[i+j]==t[j])
c++;
}
mx=max(mx,c);
}
cout << nt-mx;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int q=1;
while(q--){
testcase();
}
return 0;
} | 0 | 52,139,151 |
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define repr(i, from) for (ll i = from - 1; i >= 0; --i)
#define all(vec) vec.begin(), vec.end()
#define unless(cond) if (!(cond))
#define fi first
#define se second
using namespace std;
typedef long long ll;
template <typename T>
using V = vector<T>;
using VL = V<ll>;
using VVL = V<VL>;
template <typename T, typename U>
using P = pair<T, U>;
using PL = P<ll, ll>;
using VPL = V<PL>;
template <typename T>
inline bool chmax(T& a, T b);
template <typename T>
inline bool chmin(T& a, T b);
void print_ints(vector<ll> v);
template <typename T>
void drop(T a);
const ll INF = 1e18;
void solve() {
ll N, M, D;
cin >> N >> M >> D;
double pair_res = D == 0 ? 1.0 / N : 2 * (N - D) / pow(N, 2);
double res = (M - 1) * pair_res;
cout << fixed << setprecision(10) << res << endl;
}
struct exit_exception : public std::exception {
const char* what() const throw() { return "Exited"; }
};
#ifndef TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
try {
solve();
} catch (exit_exception& e) {
}
return 0;
}
#endif
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print_ints(vector<ll> v) {
rep(i, v.size()) {
if (i > 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
template <typename T>
void drop(T res) {
cout << res << endl;
throw exit_exception();
} | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define reps(i,s,n) for(int i=s;i<n;i++)
#define rep_bit(n) for (int bit = 0; bit < (1<<n); ++bit)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ll long long
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
using namespace std;
typedef vector<vector<int> > Graph;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
int main(){
ll n;
cin >> n;
vl dif(n);
vl a(n),b(n);
rep(n) cin >> a.at(i);
rep(n) cin >> b.at(i);
rep(n) dif.at(i) = a.at(i)-b.at(i);
sort(all(dif));
ll sum = 0;
rep(n) sum += dif.at(i);
ll sum_mi = 0;
ll cnt = 0;
if(sum<0) cout << -1 << endl;
else{
ll time = 0;
while(dif.at(time) < 0){
sum_mi += dif.at(time);
cnt++;
time++;
}
ll now = n-1;
while(sum_mi < 0){
sum_mi += dif.at(now);
now--;
cnt++;
}
cout << cnt << endl;
}
return 0;
} | 0 | 37,922,604 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
cout << (char)toupper(s1[0]) << (char)toupper(s2[0]) << (char)toupper(s3[0]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
const int MAXN = 1e5 + 4;
int main() {
int n;
string s;
cin >> n;
cin >> s;
s[n] = s[0], s[n + 1] = s[1];
bitset<100005> a;
REP(i, 4) {
a[0] = i & 1, a[1] = (i >> 1) & 1;
FOR(j, 2, n + 2) a[j] = (s[j - 1] == 'x') ^ a[j - 1] ^ a[j - 2];
if (a[0] == a[n] && a[1] == a[n + 1]) {
REP(j, n) { cout << (a[j] ? "W" : "S"); }
cout << "\n";
return 0;
}
}
cout << "-1\n";
return 0;
} | 0 | 18,028,922 |