solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
def myfn(strp):
x=len(strp)
bool=True
l=[strp[i] for i in range(len(strp))]
for i in range(int(x/2)+1):
if l[i]!=l[x-1-i]:
bool=False
break
elif l[i]!=l[0]:
temp=l[0]
l[0]=l[i]
l[i]=temp
bool=False
break
if bool==False:
print(''.join(str(i) for i in l))
else:
print("-1")
for t in range(int(input())):
st=input()
myfn(st) | 8 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
if s == 0:
print("NO")
else:
a.sort(reverse=s>0)
print("YES")
print(*a, sep=" ")
| 7 | PYTHON3 |
n, L, a = map(int, input().split())
if n:
last = 0
ans = 0
for i in range(n):
t, l = map(int, input().split())
ans += (t-last)//a
last = t+l
print(ans+(L-last)//a)
else:
print(L//a)
| 7 | PYTHON3 |
m,n = [int(i) for i in input().split(' ')]
print((m*n)//2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 16) + 5;
int n, du[N], s[N];
vector<pair<int, int> > ans;
int main() {
scanf("%d", &n);
queue<int> Q;
for (int i = 0; i < n; i++) {
scanf("%d%d", &du[i], &s[i]);
if (du[i] == 1) Q.push(i);
}
while (!Q.empty()) {
int u = Q.front();
Q.pop();
if (du[u] != 1) continue;
ans.push_back(make_pair(u, s[u]));
s[s[u]] ^= u;
du[s[u]]--;
if (du[s[u]] == 1) Q.push(s[u]);
}
int tot = ans.size();
printf("%d\n", tot);
for (int i = 0; i < tot; i++) printf("%d %d\n", ans[i].first, ans[i].second);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string a, b;
cin >> a >> b;
vector<long long> v;
for (long long i = 0; i < n; i++) {
if (a[0] == b[n - i - 1]) {
v.push_back(1);
if (a[0] == '0')
a[0] = '1';
else
a[0] = '0';
}
v.push_back(n - i);
string s = "";
for (long long j = 0; j < n - i; j++) {
if (a[j] == '0')
s += '1';
else
s += '0';
}
reverse(s.begin(), s.end());
for (long long j = 0; j < s.length(); j++) a[j] = s[j];
}
cout << v.size() << " ";
for (auto x : v) cout << x << " ";
cout << '\n';
}
}
| 7 | CPP |
#!/usr/bin/env python3.4
n = int(input())
ans = {'polycarp':1}
for i in range(n):
repost, _, reposted = input().lower().split()
ans[repost] = ans[reposted] + 1
print(max(ans.values()))
| 7 | PYTHON3 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
s=sorted((l[i],i+1)for i in range(n))
s1=False
l1=[]
for i,j in s:
if k-i>=0:
(l1.append(j))
k=k-i
s1=True
if s1==False:
print(0)
else:
print(len(l1))
print(*l1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[n];
for (int x = 0; x < n; x++) {
cin >> b[x];
a[x] = b[x];
}
int currentans = 0, currentlikes = 0;
int ans = 0, likes = 0;
int poss = 1;
sort(a, a + n);
for (int x = 0; x < n; x++) {
currentans = a[x];
currentlikes = 0;
for (int y = x; y < n; y++) {
if (a[y] == a[x]) {
currentlikes++;
} else {
break;
}
}
if (likes < currentlikes) {
ans = currentans;
likes = currentlikes;
poss = 1;
} else if (likes == currentlikes) {
poss++;
}
}
int possibleans[poss], zzz = 0;
if (poss == 1) {
cout << ans;
} else {
for (int x = 0; x < n; x++) {
currentans = a[x];
currentlikes = 0;
for (int y = x; y < n; y++) {
if (a[y] == a[x]) {
currentlikes++;
} else {
break;
}
}
if (currentlikes == likes) {
poss--;
possibleans[zzz] = a[x];
zzz++;
if (poss == 0) {
break;
}
}
}
int abc = zzz;
for (int x = n - 1; x >= 0; x--) {
for (int y = 0; y <= zzz; y++) {
if (b[x] == possibleans[y]) {
abc--;
if (abc == 0) {
cout << possibleans[y];
break;
} else {
possibleans[y] = -1;
}
break;
}
}
if (abc == 0) {
break;
}
}
}
}
| 7 | CPP |
import math
t=int(input())
for tt in range(t):
n=int(input())
xxxx='8'*int((math.ceil(n/4)))
yyyy='9'*(n-int((math.ceil(n/4))))
print(yyyy+xxxx)
| 8 | PYTHON3 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
map<string, int> c; c["A"] = c["B"] = c["AB"] = c["O"] =0;
int i; char k; string s;
while (cin >> i >> k >> s) c[s]++;
cout << c["A"] << endl << c["B"] << endl << c["AB"] << endl << c["O"] << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool home = 1;
signed realMain();
mt19937 rng_home(0);
mt19937 rng_oj((long long)(new char));
int rng() {
if (home) {
return rng_home();
} else {
return rng_oj();
}
}
unsigned long long rng_ull() {
return (unsigned long long)rng() * rng() ^
((unsigned long long)rng() * rng());
}
int rng_range(int l, int r) { return l + abs(rng()) % (r - l + 1); }
signed main() {
home = 0;
if (home) {
freopen("tony_stark", "r", stdin);
} else {
ios::sync_with_stdio(0);
cin.tie(0);
}
realMain();
}
const int N = (int)3e5 + 7;
const int INF = (int)1e9;
const int K = 20;
int sz;
struct T {
int l;
int r;
} cop[N];
T operator+(T a, T b) { return {min(a.l, b.l), max(a.r, b.r)}; }
T rep(T a) {
if (a.l < 1) a.l = 1;
if (a.r > sz) a.r = sz;
return a;
}
struct segt {
T t[4 * N];
void build(int v, int tl, int tr) {
if (tl == tr) {
t[v] = cop[tl];
} else {
int tm = (tl + tr) / 2;
build(2 * v, tl, tm);
build(2 * v + 1, tm + 1, tr);
t[v] = t[2 * v] + t[2 * v + 1];
}
}
T get(int v, int tl, int tr, int l, int r) {
if (tr < l || r < tl) {
cout << l << " " << r << "\n";
cout << " : " << tl << " " << tr << "\n";
assert(0);
}
if (l <= tl && tr <= r) return t[v];
int tm = (tl + tr) / 2;
if (r <= tm) return get(2 * v, tl, tm, l, r);
if (tm + 1 <= l) return get(2 * v + 1, tm + 1, tr, l, r);
return get(2 * v, tl, tm, l, r) + get(2 * v + 1, tm + 1, tr, l, r);
}
T get(int l, int r) { return get(1, 1, sz, l, r); }
void build(T a[N]) {
for (int i = 1; i <= sz; i++) cop[i] = a[i];
build(1, 1, sz);
}
};
int n, respect[N];
T tab[K][N];
segt seg[K];
signed realMain() {
cin >> n;
if (n == 1) {
cout << "0\n";
return 0;
}
sz = 3 * n;
for (int i = 1; i <= n; i++) {
cin >> respect[i];
respect[i + n] = respect[i + 2 * n] = respect[i];
}
for (int i = 1; i <= sz; i++) {
tab[0][i] = {i - respect[i], i + respect[i]};
tab[0][i] = rep(tab[0][i]);
}
seg[0].build(tab[0]);
int last_k = 0;
for (int k = 1; (1 << k) <= sz; k++) {
last_k = k;
for (int i = 1; i <= sz; i++) {
int l = tab[k - 1][i].l, r = tab[k - 1][i].r;
T it = seg[k - 1].get(l, r);
tab[k][i] = it;
}
seg[k].build(tab[k]);
}
for (int i = n + 1; i <= 2 * n; i++) {
T it = {i, i};
int cur = 0;
for (int k = last_k; k >= 0; k--) {
int step = (1 << k);
T pot = seg[k].get(it.l, it.r);
if (pot.r - pot.l + 1 < n) {
it = pot;
cur += step;
}
}
cout << cur + 1 << " ";
}
cout << "\n";
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int a[n];
int s = m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
priority_queue<int> ds(a, a + n);
priority_queue<int, vector<int>, greater<int>> as(a, a + n);
int max_ans = 0, min_ans = 0;
while (m--) {
long long temp = ds.top();
max_ans += temp;
ds.pop();
temp--;
ds.push(temp);
}
while (s--) {
long long tem = as.top();
min_ans += tem;
as.pop();
tem--;
if (tem != 0) {
as.push(tem);
}
}
cout << max_ans << " " << min_ans << endl;
return 0;
}
| 8 | CPP |
from collections import deque
t=int(input())
for i in range(t):
w=input()
p=deque()
for i in range(len(w)):
if len(p) is 0:
p.append(w[i])
else:
if p[-1]=="A" and w[i]=="B":
p.pop()
elif p[-1]=="B" and w[i]=="B":
p.pop()
else:
p.append(w[i])
print(len(p))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, Cnt[2], Sum[300000 + 5], V[300000 + 5];
long long x, ans;
inline int Get(long long x) {
int res = 0;
for (; x; x >>= 1) res += (x & 1);
return res;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &x);
V[i] = Get(x);
Sum[i] = (Sum[i - 1] ^ V[i]) & 1;
for (int j = 0, sum = 0, Max = 0; j < i && j < 100; j++) {
sum += V[i - j], Max = max(Max, V[i - j]);
if ((sum & 1) == 0 && sum >= 2 * Max) ans++;
}
if (i > 100) Cnt[Sum[i - 100 - 1]]++;
ans += Cnt[Sum[i]];
}
printf("%lld\n", ans);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, a[1000100], b[1000100], r[1000100];
long double p = 1, s;
priority_queue<int> q;
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i] *= 100;
}
for (i = 1; i <= n; i++) scanf("%d", &b[i]);
for (i = n; i > 0; i--) {
q.push(a[i]);
bool was = false;
while (!q.empty() && q.top() > b[i]) {
was = true;
q.pop();
}
if (was) q.push(b[i]);
r[i] = q.top();
}
sort(r + 1, r + n + 1);
reverse(r + 1, r + n + 1);
p *= m;
p /= n;
s = p * r[n];
for (i = n - 1; i >= m; i--) {
p /= i;
p *= i - m + 1;
s += p * r[i];
}
printf("%.10lf\n", double(s));
return 0;
}
| 11 | CPP |
n=list(input())
s=set(['a','e','i','o','y','u','A','E','I','O','U','Y'])
for x in n:
if x in s:
continue
else :
print('.',x.lower(),sep='',end='')
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
minv, maxv = a[0], a[0]
count = 0
for i in a:
if i > maxv:
maxv = i
count += 1
elif i < minv:
minv = i
count += 1
print(count) | 7 | PYTHON3 |
import math
def Paint_The_Array(a, n):
even = [a[i] for i in range(0,n,2)]
odd = [a[i] for i in range(1,n,2)]
gcd_odd = odd[0]
gcd_even = even[0]
for e in even:
gcd_even = math.gcd(gcd_even, e)
poss = True
for o in odd:
if o % gcd_even == 0 and o != 1:
poss = False
break
if poss and gcd_even != 1:
return gcd_even
for o in odd:
gcd_odd = math.gcd(gcd_odd, o)
poss = True
for e in even:
if e % gcd_odd == 0 and e != 1:
poss = False
break
if poss and gcd_odd != 1 :
return gcd_odd
return 0
t = int(input())
for _ in range(t):
n =int(input())
a = list(map(int, input().split()))
print(Paint_The_Array(a, n)) | 9 | PYTHON3 |
inp = input()
vowel = set(['a','e','i','o','u','A','E','I','O','U','Y','y'])
oup = ''
for i in inp:
if i not in vowel:
if i.isupper():
letter = i.lower()
oup = oup + "." + letter
else:
oup = oup + "." + i
print(oup)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
int64_t Mul(int64_t a, int64_t b, int64_t mod) { return (a * b) % mod; }
int64_t Sum(int64_t a, int64_t b, int64_t mod) { return (a + b) % mod; }
int64_t Can(int64_t a, int64_t mod) { return ((a % mod) + mod) % mod; }
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int tc;
cin >> tc;
while (tc--) {
int64_t a, b, p, q;
cin >> a >> b >> p >> q;
int64_t mod = 2 * q;
int64_t bs = sqrt(b - a + 1);
vector<pair<int64_t, int64_t>> vec;
set<int64_t> seen;
for (int x = a; x < bs + a; ++x) {
int64_t key = Can(2 * p * x, mod);
if (seen.count(key) == 0) {
vec.emplace_back(key, x);
seen.insert(key);
}
}
sort(begin(vec), end(vec));
pair<int64_t, int64_t> best = {mod + 1, 0};
int bi = 0;
for (; a + (bi + 1) * bs <= b; ++bi) {
int64_t target = Can(q - bi * bs * 2 * p, mod);
pair<int64_t, int64_t> to_find = {target, -1};
int pos = lower_bound(begin(vec), end(vec), to_find) - begin(vec);
for (int s = 0; s <= 1; ++s) {
int j = Can(pos - s, vec.size());
int64_t dist = abs(target - vec[j].first);
if (dist > q) {
dist = mod - dist;
}
pair<int64_t, int64_t> cur = {dist, vec[j].second + bi * bs};
best = min(best, cur);
}
}
for (int64_t x = a + bi * bs; x <= b; ++x) {
int64_t dist = abs(q - Can(2 * p * x, mod));
if (dist > q) {
dist = mod - dist;
}
pair<int64_t, int64_t> cur = {dist, x};
best = min(best, cur);
}
cout << best.second << '\n';
}
return 0;
}
| 12 | CPP |
n = int(input())
t = str(input())
a=''
i=0
inc =1
while(i<n):
i+=inc
a =a+ t[i-1]
inc+=1
print(a) | 7 | PYTHON3 |
x = input()
if int(x) >= 30:
print("Yes")
else:
print("No") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
long long int pos = 0;
for (int i = 0; i < n; i++) {
if (arr[i] > 0) {
pos += arr[i];
} else {
pos -= min(pos, abs(arr[i]));
arr[i] += pos;
}
}
cout << pos << endl;
}
}
| 8 | CPP |
// AOL Q.0061
// YAMADA Terushige 2013.4.3.
#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int num,point;
char c;
set<int,greater<int> > s;
set<int,greater<int> >::iterator is;
map<int,int> table;
vector<int> data(100);
while(cin >> num >> c >> point){
if (num == 0 && point ==0) break;
data[num]=point;
s.insert(point);
}
int i = 0;
for(is = s.begin();is != s.end();is++){
table[*is] = ++i;
}
while(cin >> num){
cout << table[ data[num] ] << endl;
}
return 0;
}
| 0 | CPP |
# paulopacitti
# RA 185447
from functools import reduce
n = int(input())
commands = list(input())
left_edge = 0
right_edge = 0
for c in commands:
if c == 'L':
left_edge = left_edge + 1
else:
right_edge = right_edge + 1
# all posible positions are between left_edge and right_edge added of the position 0 (in case all inputs failed)
print(left_edge + right_edge + 1)
| 7 | PYTHON3 |
a=int(input())
print(1+a*(a+1)*3) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int n, m, i, j;
long long int arr[102][102];
vector<pair<long long int, long long int>> ans;
void solve() { cin >> n >> m; }
void input() {
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
char c;
cin >> c;
if (c == '0')
arr[i][j] = 0;
else
arr[i][j] = 1;
}
}
}
void final_ans() {
long long int Size = ans.size();
cout << (Size / 3) << endl;
long long int Cnt = 0;
for (auto v : ans) {
if (Cnt % 3 == 0 && Cnt != 0) cout << endl;
cout << v.first + 1 << " " << v.second + 1 << " ";
Cnt++;
}
cout << endl;
}
void get() {
for (i = 0; i < n - 1; i++) {
for (j = 0; j < m - 1; j++) {
vector<long long int> A(4);
A[0] = arr[i][j], A[1] = arr[i][j + 1], A[2] = arr[i + 1][j],
A[3] = arr[i + 1][j + 1];
long long int Temp = A[0] + A[1] + A[2] + A[3];
map<long long int, pair<long long int, long long int>> X;
X[0] = {i, j};
X[1] = {i, j + 1};
X[2] = {i + 1, j};
X[3] = {i + 1, j + 1};
vector<long long int> ch1({1, 0, 0, 0}), ch2({0, 1, 0, 0}),
ch3({0, 0, 1, 0}), ch4({0, 0, 0, 1});
if (Temp == 0)
continue;
else if (A == ch1) {
ans.push_back(X[0]);
ans.push_back(X[1]);
ans.push_back(X[2]);
ans.push_back(X[0]);
ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[0]);
ans.push_back(X[1]);
ans.push_back(X[3]);
} else if (A == ch2) {
ans.push_back(X[1]);
ans.push_back(X[0]);
ans.push_back(X[2]);
ans.push_back(X[1]);
ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[0]);
ans.push_back(X[1]);
ans.push_back(X[3]);
} else if (A == ch3) {
ans.push_back(X[2]);
ans.push_back(X[1]);
ans.push_back(X[0]);
ans.push_back(X[0]);
ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[2]);
ans.push_back(X[1]);
ans.push_back(X[3]);
} else if (A == ch4) {
ans.push_back(X[3]);
ans.push_back(X[0]);
ans.push_back(X[1]);
ans.push_back(X[0]);
ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[1]);
ans.push_back(X[2]);
ans.push_back(X[3]);
} else if (Temp == 3) {
for (long long int k = 0; k < 4; k++) {
if (A[k] == 1) {
ans.push_back(X[k]);
}
}
} else if (Temp == 4) {
ans.push_back(X[0]), ans.push_back(X[1]), ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[0]);
ans.push_back(X[1]);
ans.push_back(X[0]);
ans.push_back(X[2]);
ans.push_back(X[3]);
ans.push_back(X[1]);
ans.push_back(X[2]);
ans.push_back(X[3]);
} else {
long long int x = 0;
vector<long long int> ind;
for (long long int k = 0; k < 4; k++) {
if (A[k] == 0) {
ans.push_back(X[k]);
arr[X[k].first][X[k].second] = 1;
ind.push_back(k);
x++;
}
}
for (long long int k = 0; k < 4; k++) {
if (A[k] == 1) {
ans.push_back(X[k]);
arr[X[k].first][X[k].second] = 0;
ind.push_back(k);
x++;
break;
}
}
for (auto v : ind) {
A[v] = 1 - A[v];
}
for (long long int k = 0; k < 4; k++) {
if (A[k] == 1) {
ans.push_back(X[k]);
x++;
}
}
}
arr[i][j] = 0;
arr[i][j + 1] = 0;
arr[i + 1][j] = 0;
arr[i + 1][j + 1] = 0;
}
}
}
void solve1() {
get();
final_ans();
}
int32_t main() {
long long int t;
cin >> t;
while (t--) {
ans.clear();
solve();
input();
solve1();
}
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string c;
cin>>c;
int a= count(c.begin(), c.end(), 'R');
if(a==0)
cout<<0;
else{
int count=a;
for(int i=0; i<count; i++){
if(c[i]=='R')
a--;
}
cout<<a;
}
return 0;
} | 0 | CPP |
import math
for i in range(int(input())):
n = int(input())
if n == 1:
print(1)
else:
print(n)
| 7 | PYTHON3 |
import sys
input=sys.stdin.readline
from collections import defaultdict as dc
from collections import Counter
from bisect import bisect_right, bisect_left
import math
from operator import itemgetter
from heapq import heapify, heappop, heappush
n,k=map(int,input().split())
x=dc(int)
for _ in range(n):
x[int(input())]+=1
c=0
for i in x:
if x[i]%2:
c+=x[i]-1
else:
c+=x[i]
c+=math.ceil((n-c)/2)
print(c) | 7 | PYTHON3 |
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f
int max(int x,int y)
{
return x>y?x:y;
}
int min(int x,int y)
{
return x<y?x:y;
}
int d[110][110];
void floyd(int n)
{
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
d[i][j]=min(d[i][j],(d[i][k]+d[k][j]));
}
}
}
}
void into(int n)
{
memset(d,INF,sizeof(d));
for(int i=0;i<n;i++)
d[i][i]=0;
}
int main()
{
int n,m;
int a,b,k;
while(~scanf("%d",&n),n)
{
into(12);
m=0;
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&a,&b,&k);
d[a][b]=d[b][a]=k;
m=max(max(a,b),m);
}
floyd(m+1);
int minn=INF;
int kase;
for(int i=0;i<=m;i++)
{
int ans=0;
for(int j=0;j<=m;j++)
{
ans+=d[i][j];
}
if(ans<minn)
{
minn=ans;
kase=i;
}
}
printf("%d %d\n",kase,minn);
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r,D,Xo;cin>>r>>D>>Xo;
int X=Xo;
for(int i=1;i<=10;i++){
X=r*X-D;
cout<<X<<endl;
}
}
| 0 | CPP |
s=input('')
x=(s.count('144'))
y=(s.count('14'))
z=(s.count('1'))
if x+y+z==len(s):
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, a, b;
long long ans;
scanf("%lf %lf %lf", &n, &a, &b);
int count = 0, i;
for (i = 0; i <= n; i++) {
x = (n - (i * a)) / b;
if (x < 0) continue;
ans = (long long)x;
if (ans == x) {
count = 1;
break;
}
}
if (count == 0)
cout << "NO" << endl;
else {
cout << "YES" << endl;
cout << (long long)i << " " << (long long)x << endl;
}
return 0;
}
| 8 | CPP |
#include<iostream>
int main(){int H,W,h,w;std::cin>>H>>W>>h>>w;std::cout<<(H-h)*(W-w);} | 0 | CPP |
print('NYOE S'[any(i in 'HQ9' for i in input())::2]) | 7 | PYTHON3 |
n=int(input())
a = 2*(n//7)
b = n%7
print(a+(b==6),a+min(2,b)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
const int SN = 2e5 + 10;
struct SAM {
int trans[SN][26];
int mxl[SN], link[SN], pre, scnt, siz[2][SN];
SAM() { pre = scnt = 1; };
void init() {
for (int j = 1; j <= scnt; j++) {
link[j] = 0;
mxl[j] = 0;
memset(trans[j], 0, sizeof(trans[j]));
}
scnt = pre = 1;
};
void update(int id, int c) {
int cur = ++scnt;
mxl[cur] = mxl[pre] + 1;
int u;
siz[c][cur] = 1;
for (u = pre; u && !trans[u][id]; u = link[u]) trans[u][id] = cur;
pre = cur;
if (!u)
link[cur] = 1;
else {
int x = trans[u][id];
if (mxl[x] == mxl[u] + 1)
link[cur] = x;
else {
int nc = ++scnt;
link[nc] = link[x];
mxl[nc] = mxl[u] + 1;
memcpy(trans[nc], trans[x], sizeof(trans[x]));
link[cur] = link[x] = nc;
for (; u && trans[u][id] == x; u = link[u]) trans[u][id] = nc;
}
}
}
} sam;
char s[SN];
vector<int> g[SN];
void dfs(int x) {
for (int to : g[x]) {
dfs(to);
sam.siz[0][x] += sam.siz[0][to];
sam.siz[1][x] += sam.siz[1][to];
}
}
int main() {
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++) sam.update(s[i] - 'a', 0);
scanf("%s", s);
len = strlen(s);
sam.pre = 1;
for (int i = 0; i < len; i++) sam.update(s[i] - 'a', 1);
int ans = N;
for (int j = 2; j <= sam.scnt; j++) g[sam.link[j]].push_back(j);
dfs(1);
for (int j = 2; j <= sam.scnt; j++)
if (sam.siz[1][j] == 1 && sam.siz[0][j] == 1)
ans = min(ans, sam.mxl[sam.link[j]] + 1);
printf("%d\n", ans == N ? -1 : ans);
}
| 10 | CPP |
#include <iostream>
#include <complex>
#include <math.h>
#include <vector>
#include <stdio.h>
/* #include <complex>
complex p(0.0, 0.0); // 初期化
// 演算 p + q, p - q, p * 2.0
// リテラル complex(1.0, 1.0)
// リテラル(極座標) polar(r, a) 長さr, x軸となす角a
// なす角 angle(p) pとx軸のなす角
// なす角 angle(p / q) pとqのなす角
p.real() = 2.0;
p.imag() = 1.0; // x, y座標
// 長さ abs(p), norm(p)
// ベクトル回転 p * polar(1.0, M_PI / 2)
*/
using namespace std;
typedef complex<double> Point; // 座標型
// 座標ソート
bool xycomp(const Point &a, const Point &b){
if(a.real() != b.real())
return a.real() < b.real();
return a.imag() < b.imag();
}
// 偏角と長さでソート
bool argcomp(const Point &a, const Point &b){
double aa = arg(a) < 0.0 ? 2 * M_PI - arg(a) : arg(a);
double bb = arg(b) < 0.0 ? 2 * M_PI - arg(b) : arg(b);
if(aa != bb)
return aa < bb;
return abs(a) < abs(b);
}
double dot(Point a, Point b){ // 内積
return real(conj(a) * b);
}
double cross(Point a, Point b){ // 外積 |a||b|sinθ
return imag(conj(a) * b);
}
// 三角形の面積 ||v||u|sinθ/ 2| = abs(cross(v, u) / 2)
// 多角形の面積
double area(vector<Point> poly){ //poly[] 多角形の頂点
int n = poly.size();
double a = 0.0;
for(int i = 0; i < n; i++){
a += cross(poly[i], poly[(i + 1)%n]) / 2;
}
return abs(a);
}
/* // 多角形の外接円
Point circumcircle(Point poly[]){
Point c = Point(0.0, 0.0);
double ratio = 0.5;
for(int k = 0; k = 100; k++){
for(int i = 0; i < 100; i++){
Point p = ;// 一番離れている点
c += (p - c) * ratio;
}
ratio *= 0.5;
}
return c;
}
*/
int main(){
while(1){
int m;
cin >> m;
if(m == 0)
break;
vector<int> v1(m);
for(int i = 0; i < m-1; i++)
cin >> v1[i];
int n;
cin >> n;
vector<int> v2(n);
for(int i = 0; i < n-1; i++)
cin >> v2[i];
vector<Point> p1(m);
p1[0] = Point(1.0, 0);
for(int i = 1, j =0; i < m; i++){
j += v1[i - 1];
p1[i] = polar(1.0, j * M_PI / 180);
}
double s1 = area(p1);
vector<Point> p2(n);
p2[0] = Point(1.0, 0);
for(int i = 1, j =0; i < n; i++){
j += v2[i - 1];
p2[i] = polar(1.0, j * M_PI / 180);
}
double s2 = area(p2);
if(s1 == s2)
puts("0");
else if(s1 > s2)
puts("1");
else
puts("2");
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m, d, m1, t, t1;
vector<int> v;
cin >> n >> m;
int a[n], b[n], c[n];
m1 = m - 1;
for (i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i];
for (i = 0; i < n; i++) {
t1 = 0;
if (b[i] == a[i])
v.push_back(c[i]);
else {
d = 0;
if (b[i] < a[i]) {
t = a[i] - b[i];
d = d + m - a[i] + m - 1;
if ((c[i] - d) > (2 * m1)) d = d + 2 * m1 * ((c[i] - d) / (2 * m1));
while (c[i] > d) d = d + 2 * m1;
v.push_back(d + t);
} else {
t = b[i] - a[i];
d = d + a[i] - 1;
if ((c[i] - d) > (2 * m1)) d = d + 2 * m1 * ((c[i] - d) / (2 * m1));
while (c[i] > d) d = d + 2 * m1;
v.push_back(d + t);
}
}
}
for (i = 0; i < v.size(); i++) cout << v[i] << endl;
return 0;
}
| 7 | CPP |
input()
a,b=[[*map(int,input().split())]for _ in(0,0)]
x=int((a[1]*a[2]/b[2])**.5)
print(x,*(y//x for y in a[1:])) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> v(n - 1);
for (long long i = 0; i < n - 1; i++) cin >> v[i];
long long a, b;
cin >> a >> b;
a--;
b--;
long long sum = 0;
for (long long i = a; i < b; i++) {
sum += v[i];
}
cout << sum;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int MAX = numeric_limits<int>::max();
int main() {
int n;
scanf("%d", &n);
vector<int> v(3, 0);
for (int i = 0; i < n; ++i) {
int t;
scanf("%d", &t);
++v[t - 1];
}
int m = 0;
for (int i = 0; i < 3; ++i) {
if (v[i] > m) m = v[i];
}
printf("%d\n", v[0] + v[1] + v[2] - m);
}
| 7 | CPP |
x = input()
ans = 0
for ch in x:
if ch in "aeiou13579":
ans += 1
print(ans) | 7 | PYTHON3 |
def maxheight(start, end):
start_day, start_height = start
end_day, end_height = end
ddays = end_day - start_day
dheight = end_height - start_height
xdays = ddays - abs(dheight)
if xdays < 0:
return -1
else:
return xdays // 2 + max(start_height, end_height)
import sys
data = sys.stdin
days = int(data.readline().split()[0])
entries = []
for l in data.read().splitlines():
entries.append(tuple(map(int, l.split(' '))))
entries.sort()
maxheights = []
for e in entries:
maxheights.append(e[1])
for i in range(len(entries) - 1):
h = maxheight(entries[i], entries[i+1])
if h < 0:
print("IMPOSSIBLE")
break
else:
maxheights.append(h)
else:
first = entries[0]
maxheights.append(first[0] - 1 + first[1])
last = entries[-1]
maxheights.append(days - last[0] + last[1])
print(str(max(maxheights))) | 9 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
l=-1
r=-1
for i in range(n-1):
if(a[i]>a[i+1]):
l=i
break
for j in range(l,n-1):
if(a[j]<a[j+1]):
r=j
break
if(r==-1):
r=n-1
if(l==-1):
l=0
ans=a[:l]+a[l:r+1][::-1]+a[r+1:]
#print(ans)
a.sort()
if(ans==a):
print("yes")
print(l+1,r+1)
else:
print("no")
| 8 | PYTHON3 |
#include<iostream>
using namespace std;
int main()
{
char str[20]={0};
cin>>str;
for(int i=19;i>=0;i--){
if(str[i]!=0) cout<<str[i];
}
cout<<endl;
} | 0 | CPP |
import sys
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))
def find(x):
while x!=p[x]:
x=p[x]
return x
def union(a,b):
x=find(a)
y=find(b)
if x!=y:
p[y]=p[x]=min(x,y)
r[min(x,y)]+=r[max(x,y)]
t,=I()
for _ in range(t):
n,=I()
a=input().strip()
b=input().strip()
p=[i for i in range(20)]
r=[1]*20
pos=1
for i in range(n):
if a[i]<b[i]:
union(ord(a[i])-97,ord(b[i])-97)
elif a[i]!=b[i]:
pos=0
break
if pos:
an=0
for i in range(20):
if p[i]==i:
an+=r[i]-1
print(an)
else:
print(-1) | 9 | PYTHON3 |
input()
if input().find('1') == -1:
print('EASY')
else:
print('HARD') | 7 | PYTHON3 |
from bisect import bisect_left
n, k = map(int, input().split())
arr = list(map(int,input().split()))
sort_arr = sorted(arr)
ans = [0] * n
for i in range(k):
x, y = map(int, input().split())
x -= 1
y -= 1
if arr[x] > arr[y]:
ans[x] -= 1
if arr[y] > arr[x]:
ans[y] -= 1
for i in range(n):
t = bisect_left(sort_arr, arr[i])
ans[i] += t
print(ans[i], end=' ') | 12 | PYTHON3 |
n=int(input())
a=[False]*n;b=[False]*n
for i in range(n*n):
h,v=map(int,input().split())
h-=1;v-=1
if(not a[h] and not b[v]):
a[h]=b[v]=True
print(i+1,end=' ') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct tree {
int n;
long long mn_const;
long long n1_const;
long long n2_const;
long long sx;
long long total;
vector<int> g[100500];
int sum[100500];
long long s[100500];
int parent[100500];
vector<pair<int, pair<int, int> > > e;
multimap<long long, int> pc[100500];
map<pair<int, int>, long long> ans;
void consts(long long a, long long b, long long c) {
mn_const = a;
n1_const = b;
n2_const = c;
}
void init();
void calc_sum(int x, int from);
int get_sum(int x, int y);
void make_edge_list();
void make_steps();
long long get_min(int x, int from);
void calc_s(int x, int from);
long long get_vertex_price(int x);
} t[3];
long long INF;
void tree::init() {
for (int i = 0; i < n - 1; ++i) {
int x, y;
scanf("%i %i", &x, &y);
g[x].push_back(y);
g[y].push_back(x);
}
calc_sum(1, -1);
parent[1] = 0;
make_edge_list();
make_steps();
calc_s(1, -1);
sx = 0;
for (int i = 1; i <= n; ++i) {
total += s[i];
sx = max(sx, s[i]);
}
total /= 2;
}
void tree::calc_sum(int x, int from) {
parent[x] = from;
sum[x] = 1;
for (int i = 0; i < g[x].size(); ++i)
if (g[x][i] != from) {
calc_sum(g[x][i], x);
sum[x] += sum[g[x][i]];
s[x] += s[g[x][i]] + sum[g[x][i]];
}
}
void tree::calc_s(int x, int from) {
for (int i = 0; i < g[x].size(); ++i) {
int y = g[x][i];
if (y == from) continue;
s[y] = s[x] - get_sum(x, y) + get_sum(y, x);
calc_s(y, x);
}
}
int tree::get_sum(int x, int y) {
if (parent[y] == x) return sum[y];
return n - sum[x];
}
void tree::make_edge_list() {
for (int i = 1; i <= n; ++i)
for (int j = 0; j < g[i].size(); ++j) {
int y = g[i][j];
int z = get_sum(i, y);
e.push_back(make_pair(z, make_pair(i, y)));
}
sort(e.begin(), e.end());
}
void tree::make_steps() {
for (int i = 0; i < e.size(); ++i) {
int x = e[i].second.first;
int y = e[i].second.second;
long long value;
value = mn_const + (get_sum(y, x) - get_sum(x, y)) * n2_const;
value += get_min(y, x);
pc[x].insert(make_pair(-value, y));
ans[make_pair(x, y)] = value;
}
}
long long tree::get_min(int x, int from) {
if (pc[x].size() == 0) return 0;
long long res = 0;
pair<long long, int> q = *pc[x].begin();
if (q.second == from) {
pc[x].erase(pc[x].begin());
if (pc[x].size() > 0) {
pair<long long, int> w = *pc[x].begin();
res = min(w.first, res);
}
pc[x].insert(q);
} else {
res = min(q.first, res);
}
return -res;
}
long long tree::get_vertex_price(int x) {
if (n == 1) return 0;
long long res = s[x] * n1_const + s[x] * n2_const;
pair<long long, int> q = *pc[x].begin();
res += -q.first;
return res;
}
long long tryit(tree &t1, tree &t2, tree &t3) {
long long ans = t1.total + t2.total + t3.total;
ans += t1.n * (t2.n + t3.n) + t2.n * (t1.n + t3.n);
ans += t1.sx * (t2.n + t3.n) + t2.sx * (t1.n + t3.n);
long long tmp = INF;
for (int i = 1; i <= t3.n; ++i) {
long long tmp2 = t3.get_vertex_price(i);
tmp = max(tmp, tmp2);
}
ans += tmp;
return ans;
}
int main() {
long long ans = 0;
INF = 1000000000;
INF = -INF * INF;
scanf("%i %i %i", &t[0].n, &t[1].n, &t[2].n);
t[0].consts((long long)t[1].n * (long long)t[2].n, t[1].n, t[2].n);
t[1].consts((long long)t[0].n * (long long)t[2].n, t[0].n, t[2].n);
t[2].consts((long long)t[0].n * (long long)t[1].n, t[0].n, t[1].n);
for (int i = 0; i < 3; ++i) t[i].init();
ans = max(ans, tryit(t[0], t[1], t[2]));
ans = max(ans, tryit(t[0], t[2], t[1]));
ans = max(ans, tryit(t[1], t[2], t[0]));
cout << ans << endl;
}
| 11 | CPP |
n = int(input())
x = list()
d = list()
count = False
for i in range(n):
s, t = map(int, input().split())
x.append(s)
d.append(t)
for i in range(n):
for j in range(n):
if i != j:
if x[i]+d[i] == x[j] and x[j]+d[j] == x[i]:
count = True
if count == True:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void _dbg(char const *s, const T &t) {
cout << s << "=" << t << endl;
}
template <typename T, typename... TA>
void _dbg(char const *s, const T &t, const TA &...ta) {
while (*s != ',') cout << *s++;
cout << "=" << t << ",";
_dbg(s + 1, ta...);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << "{" << p.first << "," << p.second << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ",";
os << *it;
}
return os << "}";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
os << "{";
for (auto it = mp.begin(); it != mp.end(); ++it) {
if (it != mp.begin()) os << ",";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &s) {
os << "{";
for (auto it = s.begin(); it != s.end(); ++it) {
if (it != s.begin()) os << ",";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &s) {
os << "{";
for (auto it = s.begin(); it != s.end(); ++it) {
if (it != s.begin()) os << ",";
os << *it;
}
return os << "}";
}
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
enum Op { AND, OR, XOR, NOT, IN };
const int N = 1e6 + 10;
Op op[N];
int l[N];
int r[N];
int val[N];
void dfs1(int v) {
if (v == 0 || op[v] == IN) return;
dfs1(l[v]);
dfs1(r[v]);
if (op[v] == AND) val[v] = val[l[v]] & val[r[v]];
if (op[v] == OR) val[v] = val[l[v]] | val[r[v]];
if (op[v] == XOR) val[v] = val[l[v]] ^ val[r[v]];
if (op[v] == NOT) val[v] = !val[l[v]];
}
int ans[N];
void paint(int v, int res) {
if (v == 0) return;
ans[v] = res;
paint(l[v], res);
paint(r[v], res);
}
void dfs2(int v, int type) {
if (op[v] == IN) {
if (type == 0)
ans[v] = !val[v];
else
ans[v] = val[v];
} else if (op[v] == AND) {
if (val[l[v]] == 0)
paint(r[v], type);
else
dfs2(r[v], type);
if (val[r[v]] == 0)
paint(l[v], type);
else
dfs2(l[v], type);
} else if (op[v] == NOT)
dfs2(l[v], type ^ 1);
else if (op[v] == OR) {
if (val[l[v]] == 1)
paint(r[v], type ^ 1);
else
dfs2(r[v], type);
if (val[r[v]] == 1)
paint(l[v], type ^ 1);
else
dfs2(l[v], type);
} else if (op[v] == XOR) {
dfs2(r[v], type ^ val[l[v]]);
dfs2(l[v], type ^ val[r[v]]);
}
}
void solve() {
int n;
scanf("%d", &n);
char buf[10];
for (int i = 1; i <= n; ++i) {
scanf("%s", buf);
if (strcmp(buf, "AND") == 0) {
op[i] = AND;
scanf("%d %d", &l[i], &r[i]);
} else if (strcmp(buf, "OR") == 0) {
op[i] = OR;
scanf("%d %d", &l[i], &r[i]);
} else if (strcmp(buf, "XOR") == 0) {
op[i] = XOR;
scanf("%d %d", &l[i], &r[i]);
} else if (strcmp(buf, "NOT") == 0) {
op[i] = NOT;
scanf("%d", &l[i]);
} else if (strcmp(buf, "IN") == 0) {
op[i] = IN;
scanf("%d", &val[i]);
} else
throw;
}
dfs1(1);
for (int v = 1; v <= n; ++v) {
;
}
dfs2(1, 0);
for (int i = 1; i <= n; ++i) {
if (op[i] == IN) printf("%d", ans[i]);
}
puts("");
}
int main() {
solve();
return 0;
}
| 10 | CPP |
n, a, b, c, d = map(int, input().split())
mis = min(a+b,b+d,c+d,c+a)
mas = max(a+b,b+d,c+d,c+a)
dif = mas-mis
res = 0
for x3 in range(1, n+1):
res += n-dif
print(max(res,0)) | 8 | PYTHON3 |
import math
t=int(input())
for i in range(t):
n,m,k=map(int,input().split())
per=n//k
if per>m:
print(m)
else:
if k==2:
win=2*per-m
else:
win=per-math.ceil((m-per)/(k-1))
print(win) | 7 | PYTHON3 |
from collections import defaultdict
import math
x=int(input())
a=list(map(int,input().split()))
a.sort()
ans=0
curr=1
pos=0
while(pos<x):
# print(pos,curr)
if(a[pos]>=curr):
ans+=1
curr+=1
pos+=1
print(ans)
| 8 | PYTHON3 |
p = [2, 3, 5, 7, 11, 13, 17, 23, 29, 31]
b = int(input())
N = [[1]*11 for i in range(b+1)]
for j in range(10):
N[1][j] = 1
for i in range(2, b+1):
for j in range(1, 11):
m = None
for k in range(i):
f = i%(k+1)
if f == 0:
if j>1:
t = N[i//(k+1)][j-1] * p[j-1]**k
else:
t = p[j-1]**(i-1)
if m is None or t < m:
m = t
N[i][j] = m
print(N[b][10])
| 11 | PYTHON3 |
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
typedef set<vector<int>> sv;
int main(){
int n;
while(cin>>n,n){
sv prev; prev.insert(vector<int>(1,1));
rep(i,n-1){
sv next;
for(auto v:prev){
rep(i,v.size()){
if(i==0||v[i-1]>v[i]){
v[i]++;
next.insert(v);
v[i]--;
}
}
v.push_back(1);
next.insert(v);
}
prev=next;
}
for(auto v=prev.rbegin(); v!=prev.rend(); ++v){
rep(i,v->size()-1) cout<<(*v)[i]<<" ";
cout<<v->back()<<endl;
}
}
} | 0 | CPP |
a = input()
b = input()
c = []
res = 0
for x, y in zip(a, b):
if x == y:
c.append(x)
else:
if res == 0:
c.append(x)
else:
c.append(y)
res ^= 1
if res:
print('impossible')
else:
print(''.join(c))
| 8 | PYTHON3 |
a = int(input())
trees = []
for i in range(a):
trees.append([int(x) for x in input().split()])
trees.append([1000000000000, 1])
left = -10000000000
c = 0
for i in range(a):
if trees[i][0] - trees[i][1] > left:
left = trees[i][0]
c += 1
elif trees[i][0] + trees[i][1] < trees[i + 1][0]:
left = trees[i][0] + trees[i][1]
c += 1
else:
left = trees[i][0]
print(c) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1E-9;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double PI = 2 * acos(.0);
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int m = 0;
if (n % 2 == 0) {
m = (n / 2) * n;
cout << m / 2 << endl;
for (int i = 0; i < (int)(n / 2); i++) {
cout << 1 << " " << (i + 2) << endl;
}
for (int i = 2; i < (int)(n / 2 + 2); i++) {
for (int j = 0; j < (int)(n / 2 - 1); j++) {
cout << i << " " << (j + (n / 2) + 2) << endl;
}
}
} else {
m = (n / 2) + (n / 2) * (n);
cout << m / 2 << endl;
for (int i = 0; i < (int)(n / 2); i++) {
cout << 1 << " " << (i + 2) << endl;
}
for (int i = 2; i < (int)(n / 2 + 2); i++) {
for (int j = 0; j < (int)(n / 2 - 1); j++) {
cout << i << " " << (j + (n / 2) + 2) << endl;
}
}
if (n != 1) cout << n << " " << 1 << endl;
for (int i = 0; i < (int)(n / 2 - 1); i++) {
cout << n << " " << (i + (n / 2) + 2) << endl;
}
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long ans[200010][2];
int a[200010], mark[2] = {1, -1}, T;
bool visit[200010][2];
long long dfs(int m, int n) {
if (visit[m][n] == true) return ans[m][n];
visit[m][n] = true;
int next = mark[n] * a[m] + m;
if (next > T || next <= 0)
ans[m][n] = a[m];
else {
long long temp = dfs(next, 1 ^ n);
if (temp == -1)
ans[m][n] = -1;
else
ans[m][n] = (long long)a[m] + temp;
}
return ans[m][n];
}
int main() {
scanf("%d", &T);
for (int i = 2; i <= T; i++) scanf("%d", &a[i]);
memset(ans, -1, sizeof(ans));
memset(visit, false, sizeof(visit));
visit[1][0] = true;
for (int i = 2; i <= T; i++) {
if (!visit[i][1]) dfs(i, 1);
if (ans[i][1] == -1)
printf("-1\n");
else
printf("%I64d\n", i - 1 + ans[i][1]);
}
}
| 8 | CPP |
a = input().replace("4",'0').replace("7",'1')
sumA = 0
for x in range(len(a)) : sumA += 2**x
print((int(a,2)+sumA))
| 8 | PYTHON3 |
import math
n, b = map(int, input().split())
t = b
dic = {}
while True:
if t%2 == 0:
dic[2] = 0
while t%2 == 0:
t = t//2
dic[2] += 1
for i in range(3, int(math.sqrt(b)) + 1, 2):
if t%i == 0:
dic[i] = 0
while t%i == 0:
dic[i] += 1
t = t//i
if t != 1:
dic[t] = 1
break
dic2 = {i:0 for i in dic.keys()}
m = float('inf')
for i in dic.keys():
c = 1
while n//pow(i, c) > 0:
dic2[i] += n//pow(i, c)
c += 1
m = min(m, dic2[i]//dic[i])
print(m)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
struct node {
int x, y;
};
int dx[8] = {1, 1, -1, -1, 2, 2, -2, -2};
int dy[8] = {2, -2, -2, 2, 1, -1, -1, 1};
queue<node> q;
long long mp[3000][3000], k, n, ans[610];
void bfs(int x, int y) {
q.push({x, y});
mp[x][y] = 1;
while (!q.empty()) {
node u = q.front();
q.pop();
ans[mp[u.x][u.y]]++;
if (mp[u.x][u.y] > 500) break;
for (int i = 0; i < 8; i++) {
int nx = u.x + dx[i], ny = u.y + dy[i];
if (mp[nx][ny]) continue;
mp[nx][ny] = mp[u.x][u.y] + 1;
q.push({nx, ny});
}
}
}
int main() {
cin >> k >> n;
for (int i = 1, x, y; i <= n; i++) {
cin >> x >> y;
x += 1001, y += 1001;
mp[x][y] = 1;
}
bfs(1001, 1001);
long long Ans = 0;
if (k < 500) {
for (int i = 1; i <= k + 1; i++) Ans = (Ans + ans[i]) % Mod;
} else {
long long del = ans[500] - ans[499];
k = (k - 498) % Mod;
for (int i = 0; i <= 499; i++) Ans = (Ans + ans[i]) % Mod;
Ans = (((k * ans[500] % Mod + Ans) % Mod +
(k * (k - 1) >> 1) % Mod * del % Mod) %
Mod +
Mod) %
Mod;
}
cout << Ans << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG = 20;
int n, m, k, u, v, x, y, t, a, b;
int stt[MAXN], fnt[MAXN], timer = 1;
int par[MAXN][LOG];
int h[MAXN];
int ans[MAXN];
int seg[MAXN << 2];
int lazy[MAXN << 2];
vector<int> G[MAXN];
vector<pair<int, pair<int, int> > > query[MAXN];
void add_lazy(int id, int val) {
seg[id] += val;
lazy[id] += val;
}
void shift(int id) {
add_lazy(id << 1, lazy[id]);
add_lazy(id << 1 | 1, lazy[id]);
lazy[id] = 0;
}
void Add(int id, int tl, int tr, int l, int r, int val) {
if (r <= tl || tr <= l) return;
if (l <= tl && tr <= r) {
add_lazy(id, val);
return;
}
shift(id);
int mid = (tl + tr) >> 1;
Add(id << 1, tl, mid, l, r, val);
Add(id << 1 | 1, mid, tr, l, r, val);
seg[id] = max(seg[id << 1], seg[id << 1 | 1]);
}
int Get(int id, int tl, int tr, int l, int r) {
if (r <= tl || tr <= l) return 0;
if (l <= tl && tr <= r) return seg[id];
shift(id);
int mid = (tl + tr) >> 1;
return max(Get(id << 1, tl, mid, l, r), Get(id << 1 | 1, mid, tr, l, r));
}
void dfs(int node) {
for (int i = 1; i < LOG; i++) par[node][i] = par[par[node][i - 1]][i - 1];
h[node] = h[par[node][0]] + 1;
stt[node] = timer++;
for (int v : G[node])
if (v != par[node][0]) {
par[v][0] = node;
dfs(v);
}
fnt[node] = timer;
}
int LCA(int x, int y) {
if (h[x] > h[y]) swap(x, y);
for (int i = 0; i < LOG; i++)
if ((h[y] - h[x]) & (1 << i)) y = par[y][i];
if (x == y) return x;
for (int i = LOG - 1; i >= 0; i--)
if (par[x][i] != par[y][i]) x = par[x][i], y = par[y][i];
return par[x][0];
}
int dist(int x, int y) { return h[x] + h[y] - 2 * h[LCA(x, y)]; }
void dfs2(int node) {
for (auto p : query[node])
ans[p.first] =
max(ans[p.first], Get(1, 1, n + 1, p.second.first, p.second.second));
for (int v : G[node])
if (v != par[node][0]) {
Add(1, 1, n + 1, stt[1], fnt[1], +1);
Add(1, 1, n + 1, stt[v], fnt[v], -2);
dfs2(v);
Add(1, 1, n + 1, stt[1], fnt[1], -1);
Add(1, 1, n + 1, stt[v], fnt[v], +2);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i < n; i++) {
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
par[1][0] = 1;
dfs(1);
for (int i = 2; i <= n; i++) Add(1, 1, n + 1, stt[i], fnt[i], +1);
cin >> m;
for (int i = 1; i <= m; i++) {
cin >> u >> v;
int dis = (dist(u, v) - 1) / 2;
if (h[u] < h[v]) swap(u, v);
int tmp = u;
for (int j = 0; j < LOG; j++)
if (dis & (1 << j)) tmp = par[tmp][j];
query[u].push_back({i, {stt[tmp], fnt[tmp]}});
query[v].push_back({i, {stt[1], stt[tmp]}});
query[v].push_back({i, {fnt[tmp], fnt[1]}});
}
dfs2(1);
for (int i = 1; i <= m; i++) cout << ans[i] << '\n';
return 0;
}
| 10 | CPP |
N,K = input().split()
N = int(N)
K = int(K)
if((1<=N<=50)and(1<=K<=50)and(N>=K)):
l_m = input()
s_m = l_m.split()
s1_m = []
for each in s_m:
s1_m.append(int(each))
lowest = int(s1_m[K - 1])
count = 0
for each in s1_m:
if((each==0)):
count = count + 0
elif((each >= lowest)):
count = count + 1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100, P = 350;
deque<int> d[P];
int num[P][N], lastans;
int findans(int l, int r, int k) {
int ans = 0;
while (l % P != 0 && l < r) {
if (d[l / P][l % P] == k) ans++;
l++;
}
r--;
while (r % P != P - 1 && r > l) {
if (d[r / P][r % P] == k) ans++;
r--;
}
if (r == l && l % P == 0)
if (d[l / P][l % P] == k) ans++;
for (int i = l; i < r; i += P) ans += num[i / P][k];
return ans;
}
void upd(int l, int r) {
int il = l / P, ir = r / P, b = l % P, e = r % P;
int t = d[ir][e];
if (il == ir) {
for (int i = e; i > b; i--) d[il][i] = d[il][i - 1];
d[il][b] = t;
} else {
for (int i = il; i < ir; i++) {
int tmp = d[i].back();
d[i + 1].push_front(tmp);
num[i + 1][tmp]++;
num[i][tmp]--;
d[i].pop_back();
}
d[il].push_back(0);
for (int i = e + 1; i > 0; i--) d[ir][i] = d[ir][i - 1];
for (int i = (int)d[il].size() - 1; i > b; i--) d[il][i] = d[il][i - 1];
num[ir][t]--;
num[il][t]++;
d[ir].pop_front();
d[il][b] = t;
}
return;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m, x, l, r, k, tp;
cin >> n;
for (int i = 0; i < n; i++) {
int t = i / P;
cin >> x;
d[t].push_back(x);
num[t][x]++;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> tp >> l >> r;
l = (l + lastans - 1) % n + 1, r = (r + lastans - 1) % n + 1;
if (l > r) swap(l, r);
l--;
if (tp == 2) {
cin >> k;
k = (lastans + k - 1) % n + 1;
lastans = findans(l, r, k);
cout << lastans << endl;
} else
upd(l, r - 1);
}
return 0;
}
| 10 | CPP |
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool is_valid(uint64_t val) {
bool valid = true;
string num = to_string(val);
for (uint32_t i = 0; i < num.size() - 1; i++) {
if (num[i + 1] - num[i] != 1) {
valid = false;
}
}
return valid;
}
int32_t main() {
uint32_t N;
cin >> N;
vector<int64_t> arr;
for (uint32_t i = 0; i < N; i++) {
int64_t val;
cin >> val;
arr.push_back(val);
}
int64_t max_val = -1;
for (uint32_t i = 0; i < N; i++) {
for (uint32_t j = i + 1; j < N; j++) {
if (is_valid(arr[i] * arr[j])) {
max_val = max(max_val, arr[i] * arr[j]);
}
}
}
cout << max_val << endl;
return 0;
} | 0 | CPP |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll N, S{}, S2{}, A;
cin >> N;
while(cin >> A) {
S = (S + A)%(MOD*2);
S2 = (S2 + A * A)%(MOD*2);
}
ll ans = ((S*S) - S2)%(MOD*2)/2;
cout << ans << endl;
}
| 0 | CPP |
from math import ceil
n = int(input())
print(ceil(n / 5)) if n > 5 else print(1) | 7 | PYTHON3 |
n,t = list(map(int,input().split()))
arr = list(map(int,input().split()))
ans = 0
temp = 0
i,j=0,0
while i<n:
if arr[i]+temp<=t:
temp+=arr[i]
i+=1
ans = max(i-j,ans)
else:
temp-=arr[j]
j+=1
print(ans) | 8 | PYTHON3 |
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <cstdio>
using namespace std;
#define INF 1LL<<60
typedef long long Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) :
src(src), dst(dst), weight(weight) { }
};
bool operator < (const Edge &e, const Edge &f) {
return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void shortestPath(const Graph &g, int s,
vector<Weight> &dist, vector<int> &prev) {
int n = g.size();
dist.assign(n, INF); dist[s] = 0;
prev.assign(n, -1);
priority_queue<Edge> Q; // "e < f" <=> "e.weight > f.weight"
for (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {
Edge e = Q.top(); Q.pop();
if (prev[e.dst] != -1) continue;
prev[e.dst] = e.src;
for(auto &f:g[e.dst]) {
if (dist[f.dst] > e.weight+f.weight) {
dist[f.dst] = e.weight+f.weight;
Q.push(Edge(f.src, f.dst, e.weight+f.weight));
}
}
}
}
int main(){
int N,M,K,S,P,Q;
scanf("%d%d%d%d%d%d",&N,&M,&K,&S,&P,&Q);
unordered_map<int,int>depth;
queue<int>q;
for(int i=0;i<K;i++){
int a;
scanf("%d",&a);a--;
depth[a]=0;
q.push(a);
}
Graph g(N);
for(int i=0;i<M;i++){
int a,b;
scanf("%d%d",&a,&b);a--,b--;
g[a].push_back(Edge(a,b,b==N-1?0:depth.find(b)==depth.end()?P:INF));
g[b].push_back(Edge(b,a,a==N-1?0:depth.find(a)==depth.end()?P:INF));
}
for(;!q.empty();){
int cur=q.front();q.pop();
if(depth[cur]==S)continue;
for(auto &e:g[cur]){
if(depth.find(e.dst)==depth.end()){
depth[e.dst]=depth[cur]+1;
q.push(e.dst);
}
}
}
for(int i=0;i<N;i++)for(auto &&e:g[i]){
if(depth.find(e.dst)!=depth.end()&&e.weight==P)e.weight=Q;
}
vector<Weight>dist;
vector<int>prev;
shortestPath(g,0,dist,prev);
printf("%lld\n",dist[N-1]);
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ar[101], mx = 0;
cin >> a >> b;
for (int x = 0; x < a; x++) {
cin >> ar[x];
}
for (int x = 0; x < a - 1; x++) {
mx = max(mx, ar[x] - ar[x + 1] - b);
}
cout << mx;
return 0;
}
| 7 | CPP |
N, M, K = map(int, input().split())
print((K//N)*M) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class t>
t mag(t a) {
return a > 0 ? a : -a;
}
template <class T, class U>
T cdiv(T num, U den) {
return (num / den) + ((num % den) > 0);
}
std::ifstream term("/dev/tty");
std::string tempstring;
using ll = int_fast64_t;
using ii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
const int &sij = 400010;
const ll &mod = 1000000007ll;
int n, pre[200], nx[200], fre[200], vis[200], cyc;
string prt;
vector<string> vec;
void fail() {
cout << "NO";
exit(0);
}
int esc(int tcase) {
cin >> n;
vec.resize(n);
memset(pre, -1, sizeof(pre));
memset(nx, -1, sizeof(nx));
for (auto &e : vec) cin >> e;
for (auto &e : vec) {
if (e.size() > 26) {
fail();
}
fre[e[0]] = 1;
for (auto i = 0; i != e.size() - 1; i++) {
fre[e[i]] = fre[e[i + 1]] = 1;
if (nx[e[i]] == -1) {
nx[e[i]] = e[i + 1];
} else if (nx[e[i]] != e[i + 1]) {
fail();
}
if (pre[e[i + 1]] == -1) {
pre[e[i + 1]] = e[i];
} else if (pre[e[i + 1]] != e[i]) {
fail();
}
}
}
function<void(char)> dfs;
dfs = [&](int x) {
vis[x] = 1;
if (nx[x] != -1) {
if (vis[nx[x]] == 1) {
fail();
}
if (vis[nx[x]] == 0) dfs(nx[x]);
}
vis[x] = 2;
};
for (auto i = 'a'; i <= 'z'; i++) {
if (vis[i] == 0) dfs(i);
}
for (auto i = 'a'; i <= 'z'; i++) {
if (pre[i] == -1 and fre[i]) {
char cr = i;
prt += cr;
while (nx[cr] != -1) {
prt += char(nx[cr]);
cr = nx[cr];
}
}
}
cout << prt << '\n';
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
for (int i = 1; i <= tc; i++) esc(i);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
long long ev[5005][5005];
int main() {
cin >> s;
int n = s.length();
for (int i = 0; i < n; i += 2) ev[i][i] = s[i] - '0';
for (int size = 2; size <= (n + 1) / 2; ++size) {
for (int i = 0; i + 2 * (size - 1) < n; i += 2) {
long long tmp = s[i] - '0';
int k = i + 1;
int j = i + 2 * (size - 1);
while (k < j && s[k] == '*') {
tmp *= (s[k + 1] - '0');
k += 2;
}
ev[i][j] = tmp;
if (k < j) ev[i][j] += ev[k + 1][j];
}
}
long long res = 0;
for (int i = 0; i < n; i += 2) {
for (int j = i; j < n; j += 2) {
long long tmp = ev[i][j];
int i1 = i - 1;
while (i1 >= 0 && s[i1] == '*') {
tmp *= (s[i1 - 1] - '0');
i1 -= 2;
}
int j1 = j + 1;
while (j1 < n && s[j1] == '*') {
tmp *= (s[j1 + 1] - '0');
j1 += 2;
}
long long tmpRes = tmp;
if (i1 > 0) tmpRes += ev[0][i1 - 1];
if (j1 < n) tmpRes += ev[j1 + 1][n - 1];
res = max(res, tmpRes);
}
}
cout << res << endl;
return 0;
}
| 11 | CPP |
from collections import Counter
for t in range(int(input())):
s = input()
f = Counter(s)
r, g = 0, 0
for c in f:
if f[c] == 1:
if r <= g:
r+= 1
else:
g+= 1
else:
r+=1
g+=1
print(min(r, g)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int a;
scanf("%d", &a);
if (a) {
s.insert(a);
}
}
printf("%d\n", (int)s.size());
}
| 7 | CPP |
c = ans = 0
for s in input():
if s == 'B':
c += 1
else:
ans += c
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1, 1, 1, -1, -1};
int dy[] = {-1, 1, 0, 0, 1, -1, 1, -1};
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
long long k, n, s, p, m, u, ans;
cin >> k >> n >> s >> p;
m = ceil(n / (s * 1.0));
u = m * k;
ans = ceil(u / (p * 1.0));
cout << ans;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int even = 0, odd = 0, indexi = 0, indexj = 0;
int i = 0;
while (i < n) {
cin >> a[i];
if (a[i] % 2 == 0) {
indexi = i;
even++;
} else {
indexj = i;
odd++;
}
i++;
}
if (odd == 1)
cout << indexj + 1;
else
cout << indexi + 1;
}
| 7 | CPP |
while True:
try:
n = int(input())
for i in range(n):
x = input()
y = input()
y = y.replace('0','')
y = y.replace('2','')
y = y.replace('4','')
y = y.replace('6','')
y = y.replace('8','')
if len(y)<2:
print('-1')
else:
print(y[:2])
except EOFError:
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#define N 2025
#define ll long long
using namespace std;
ll n,k,num2[N];
int main()
{
cin >> n >> k;
const ll MOD=1e9+7;
int tmp,num[N];
ll ans=0;
for(int i=1;i<=n;++i){
cin >> num[i];
for(int j=i-1;j>0;--j){
if(num[i]<num[j])
++ans;
}
++num2[num[i]];
}
ans=(ans*k)%MOD;
// cout << ans << endl;
for(int i=1;i<=n;++i){
for(int j=num[i]+1;j<N;++j){
ans=(ans+(num2[j]*((k*(k-1)/2)%MOD))%MOD)%MOD;
}
}
cout << ans << endl;
return 0;
}
| 0 | CPP |
no_of_stds, atleast_participation = map(int, input().split())
std_participation = list(map(int, input().split()))
print(len([std for std in std_participation if std <= (5 - atleast_participation)]) // 3)
| 7 | PYTHON3 |
m=int(input())
print("NO" if m%2!=0 or m==2 else "YES") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[51];
cin >> s;
int l = strlen(s);
int i, j, count = 0, temp = 0;
for (i = 0, j = l - 1; i < l / 2; i++, j--) {
if (s[i] == s[j])
count++;
else
break;
}
if (count != l / 2) {
cout << l << endl;
return 0;
} else {
for (i = 0; i < l - 1; i++) {
if (s[i] != s[i + 1]) {
temp = 1;
break;
}
}
if (temp == 0) {
cout << "0" << endl;
return 0;
} else
cout << l - 1 << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 35;
const int K = 205;
int a[N];
int n, k;
int tmp = 0;
long double dp[N][N][K];
void pre() {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
dp[i][j][0] = 1;
}
}
}
void solver(int m) {
for (int l = 0; l < n; l++) {
for (int r = l; r < n; r++) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int x, y;
if (i < l || i > r) {
x = i;
} else {
x = r - i + l;
}
if (j < l || j > r) {
y = j;
} else {
y = r - j + l;
}
if (x < y) {
dp[i][j][m] += dp[x][y][m - 1] / tmp;
} else {
swap(x, y);
dp[i][j][m] += (1 - dp[x][y][m - 1]) / tmp;
}
}
}
}
}
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
pre();
tmp = (n * (n + 1));
tmp = tmp / 2;
for (int i = 1; i <= k; i++) {
solver(i);
}
double ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
ans += dp[i][j][k];
} else {
ans += 1 - dp[i][j][k];
}
}
}
cout << setprecision(20) << fixed << ans << endl;
}
| 13 | CPP |
#include <cstring>
#include <iostream>
using i64 = long long;
const i64 MOD = 1000000007;
const int N = 1000000 + 7;
int n;
i64 p[N][4], g[N][4];
i64 fac[N], ifc[N];
i64 pow(i64 a, i64 k) {
i64 t = 1;
for (; k; a = a * a % MOD, k >>= 1) if (k & 1) t = t * a % MOD;
return t;
}
i64 bin(i64 n, i64 m) {
return n < m || m < 0 ? 0 : fac[n] * ifc[m] % MOD * ifc[n - m] % MOD;
}
int main() {
// freopen("code.in", "r", stdin);
// freopen("code.out", "w", stdout);
scanf("%d", &n);
for (int i = fac[0] = 1; i <= n; ++i) fac[i] = fac[i - 1] * i % MOD;
ifc[n] = pow(fac[n], MOD - 2);
for (int i = n - 1; ~i; --i) ifc[i] = ifc[i + 1] * (i + 1) % MOD;
p[0][0] = 1;
for (int i = 1; i <= n; ++i) for (int j = 0; j < 3; ++j)
( p[i][j] = p[i - 1][0] + p[i - 1][1] + p[i - 1][2] - p[i - 1][j] ) %= MOD;
i64 ans = 0;
for (int k = 1; k <= n; ++k)
( ans += pow(k, MOD - 2) * bin(n, k) % MOD * p[k][1] ) %= MOD;
ans = ans * pow(pow(3, n) * n % MOD, MOD - 2) % MOD;
printf("%lld", ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int NM_MAX = 1002;
int n, m;
int ma[NM_MAX][NM_MAX];
int ans[NM_MAX][NM_MAX];
int aux[NM_MAX][NM_MAX];
void mirror() {
swap(n, m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) aux[i][j] = ma[j][i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) ma[i][j] = aux[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) aux[i][j] = ans[j][i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) ans[i][j] = aux[i][j];
}
bool solve() {
for (int a = 1; a <= 4; a++)
for (int b = a + 1; b <= 4; b++)
for (int c = 1; c <= 4; c++)
for (int d = c + 1; d <= 4; d++)
if (a != c && b != c && a != d && b != d) {
bool ok1 = true;
for (int i = 1; i <= n; i++) {
bool ok = true;
for (int j = 1; j <= m; j++) {
if (i % 2 == 0 && j % 2 == 0) ans[i][j] = a;
if (i % 2 == 0 && j % 2 == 1) ans[i][j] = b;
if (i % 2 == 1 && j % 2 == 0) ans[i][j] = c;
if (i % 2 == 1 && j % 2 == 1) ans[i][j] = d;
if (ma[i][j] != 0 && ans[i][j] != ma[i][j]) {
ok = false;
break;
}
}
if (ok == true) continue;
ok = true;
for (int j = 1; j <= m; j++) {
if (i % 2 == 0 && j % 2 == 0) ans[i][j] = b;
if (i % 2 == 0 && j % 2 == 1) ans[i][j] = a;
if (i % 2 == 1 && j % 2 == 0) ans[i][j] = d;
if (i % 2 == 1 && j % 2 == 1) ans[i][j] = c;
if (ma[i][j] != 0 && ans[i][j] != ma[i][j]) {
ok = false;
break;
}
}
if (ok == true) continue;
ok1 = false;
break;
}
if (ok1 == true) return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
for (int j = 1; j <= m; j++) ma[i][j] = s[j - 1] - '0';
}
if (solve() == true) {
for (int i = 1; i <= n; i++, cout << "\n")
for (int j = 1; j <= m; j++) cout << ans[i][j];
return 0;
}
mirror();
if (solve() == true) {
mirror();
for (int i = 1; i <= n; i++, cout << "\n")
for (int j = 1; j <= m; j++) cout << ans[i][j];
return 0;
}
cout << "0\n";
return 0;
}
| 11 | CPP |
def S(n, k):
x=n//2+n%2
if k>x: #Parte par
return 2*(k-x)
else: return 2*k-1
n,k = (int(k) for k in input().split(' '))
print(S(n,k))
| 7 | PYTHON3 |
//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod = 1e9+7;
//My i/o stream
struct fastio
{
char s[100000];
int it, len;
fastio() {it=len=0;}
inline char get()
{
if (it<len) return s[it++]; it=0;
len=fread(s, 1, 100000, stdin);
if (len==0) return EOF; else return s[it++];
}
bool notend()
{
char c=get();
while (c==' '||c=='\n') c=get();
if (it>0) it--;
return c!=EOF;
}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
ll r=0; bool ng=0; char c; c=_buff.get();
while (c!='-'&&(c<'0'||c>'9')) c=_buff.get();
if (c=='-') ng=1, c=_buff.get();
while (c>='0'&&c<='9') r=r*10+c-'0', c=_buff.get();
return ng?-r:r;
}
template <class T> inline void putnum(T x)
{
if (x<0) putchar('-'), x=-x;
register short a[20]={}, sz=0;
while (x) a[sz++]=x%10, x/=10;
if(sz==0) putchar('0');
for (int i=sz-1; i>=0; i--) putchar('0'+a[i]);
}
inline char getreal() {char c=_buff.get(); while (c<=32) c=_buff.get(); return c;}
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
const int maxn = 100111;
const double mn = 1e20;
int n;
double a[maxn], dp[maxn];
struct data
{
double prod, sum;
data(double A=0, double B=0) : prod(A), sum(B) {}
data operator + (const data &t) const
{
return data(prod*t.prod, t.sum+sum*t.prod);
}
}D[maxn][20];
data query_data(int l, int r)
{
data ret(1, 0);
for (int i=19; i>=0; i--)
{
if (r-(1<<i)>=l-1)
{
ret = D[r][i]+ret;
r -= 1<<i;
}
}
return ret;
}
int get_point(int x, int y)
{
// cerr<<"get_point:"<<x<<","<<y<<endl;
data dx = query_data(x+1, y), dy(1, 0);
int pt = y;
for (int i=19; i>=0; i--)
{
if (pt+(1<<i)<=n)
{
data ndx = dx+D[pt+(1<<i)][i];
data ndy = dy+D[pt+(1<<i)][i];
if (dp[x]+ndx.sum<dp[y]+ndy.sum)
{
pt += 1<<i;
dx = ndx;
dy = ndy;
}
}
}
return pt+1;
}
void solve()
{
vector<int> v, pt;
v.PB(0);
int it = 0;
for (int i=1; i<=n; i++)
{
while (it+1<v.size()&&i>=pt[it]) it++;
// for (auto x : v) cerr<<x<<" "; cerr<<endl;
// for (auto x : pt) cerr<<x<<" "; cerr<<endl;
// cerr<<v[it]<<"->"<<i<<endl;
dp[i] = dp[v[it]]+query_data(v[it]+1, i).sum+1;
while (pt.size()>0&&get_point(v.back(), i)<=pt.back()) v.pop_back(), pt.pop_back();
it = min(it, int(v.size())-1);
pt.PB(get_point(v.back(), i));
v.PB(i);
}
}
int main()
{
while (true)
{
scanf("%d", &n);
if (n==0) break;
for (int i=1; i<=n; i++) scanf("%lf", &a[i]), a[i] = 1.0/a[i];
for (int i=1; i<=n; i++)
{
D[i][0] = data(a[i], a[i]);
for (int j=1; j<20; j++)
{
if (i>=(1<<j)) D[i][j] = D[i-(1<<j-1)][j-1]+D[i][j-1];
}
}
/*
for (int i=1; i<=n; i++)
{
dp[i] = 1e9;
for (int j=i; j>=1; j--)
{
dp[i] = min(dp[i], dp[j-1]+query_data(j, i).sum+1);
}
}*/
solve();
printf("%.10lf\n", dp[n]-1);
}
return 0;
}
| 0 | CPP |
#include <cstring>
#include <cstdio>
#define MOD 924844033
int dp[2005][2005][2];
int main()
{
// freopen("AGC005-D.in", "r", stdin);
int n, k, cur = 0;
scanf("%d%d", &n, &k);
dp[0][0][0] = 1;
for (int i = 0; i < k << 1; i++)
{
for (int j = i; j < n; j += k << 1)
{
int nxt = cur ^ 1;
memset(dp[nxt], 0, sizeof(dp[nxt]));
dp[nxt][0][0] = 1;
for (int x = 1; x <= n; x++)
{
dp[nxt][x][0] = (dp[cur][x][0] + dp[cur][x][1]) % MOD;
if (j >= k)
(dp[nxt][x][0] += dp[cur][x - 1][0]) %= MOD;
if (j + 2 * k < n)
{
(dp[nxt][x][1] += dp[cur][x - 1][0]) %= MOD;
(dp[nxt][x][1] += dp[cur][x - 1][1]) %= MOD;
}
else if (j + k < n)
{
(dp[nxt][x][0] += dp[cur][x - 1][0]) %= MOD;
(dp[nxt][x][0] += dp[cur][x - 1][1]) %= MOD;
}
}
cur ^= 1;
}
}
int ans = 0;
for (int i = 0; i <= n; i++)
{
int res = dp[cur][i][0];
for (int j = 1; j <= n - i; j++)
res = (long long)res * j % MOD;
(ans += (i & 1 ? -1 : 1) * res) %= MOD;
}
printf("%d\n", (ans + MOD) % MOD);
return 0;
}
| 0 | CPP |
n = int(input().strip())
lst = list(map(int, input().strip().split()))
lst.append(lst[0])
diff_lst = []
for i in range(n):
diff = abs(lst[i+1] - lst[i])
diff_lst.append(diff)
#print(diff_lst)
min_index = diff_lst.index(min(diff_lst))
print(min_index + 1, (min_index+1) % n + 1) | 7 | PYTHON3 |
n = int(input())
lst = [[1] for i in range(n)]
lst[0] = [1 for i in range(n)]
for j in range(1, n):
for i in range(1, n):
lst[j].append(lst[j][i - 1] + lst[j - 1][i])
print(max(lst[-1])) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long mod_exp(long long x, long long y, long long mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int arr[n + 1];
memset(arr, 0, sizeof(arr));
for (int i = 1; i < n; i++) {
int v, u;
cin >> v >> u;
arr[v]++;
arr[u]++;
}
for (int i = 1; i <= n; i++) {
if (arr[i] == 2) {
cout << "NO";
return 0;
}
}
cout << "YES"
<< "\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int m, n, c;
char a[10][10];
int search(int i, int j) {
if (i - 1 >= 0 && a[i - 1][j] == 'P') {
c++;
a[i - 1][j] = '.';
return 0;
}
if (i + 1 < n && a[i + 1][j] == 'P') {
c++;
a[i + 1][j] = '.';
return 0;
}
if (j - 1 >= 0 && a[i][j - 1] == 'P') {
c++;
a[i][j - 1] = '.';
return 0;
}
if (j + 1 < m && a[i][j + 1] == 'P') {
c++;
a[i][j + 1] = '.';
return 0;
}
}
int main() {
ios_base::sync_with_stdio(0);
int i, j;
int x[1000], y[1000];
int h = 0;
int t = 1;
while (t--) {
c = 0;
cin >> n >> m;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
if (a[i][j] == 'W') {
x[h] = i;
y[h] = j;
h++;
}
}
}
for (i = 0; i < h; i++) {
search(x[i], y[i]);
}
cout << c;
}
}
| 8 | CPP |
# import sys
# sys.stdin=open("input1.in","r")
# sys.stdout=open("output2.out","w")
N=int(input())
L=list(input())
def CHECKVOWEL(str):
if str=='a' or str=='e' or str=='o' or str=='u' or str=='i' or str=='y':
return True
for i in range(N-1):
if CHECKVOWEL(L[i])==True and CHECKVOWEL(L[i+1])==True:
# L[i]=0;
L[i+1]=L[i]
L[i]=0
for j in L:
if j!=0:
print(j,end='')
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.