solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n, d, x, sum=0;
cin >> n >> d >> x;
for (int i=0; i<n; i++) {
int a;
cin >> a;
sum+=(d+a-1)/a;
}
cout << x+sum;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, q1[505], q2[505];
bool cmp(int x, int y) {
if (x == 2 * n + 1 || y == 2 * n + 1) return 0;
printf("? %d %d\n", x, y);
fflush(stdout);
char s[10];
scanf("%s", s + 1);
return s[1] == '<';
}
void solve() {
scanf("%d", &n);
int v1 = (n + 1) / 2, v2 = n + 1 - v1;
*q1 = 0;
*q2 = 0;
for (int i = (int)(1); i <= (int)(v1); i++) q1[++*q1] = i;
for (int i = (int)(1); i <= (int)(v2); i++) q2[++*q2] = i + v1;
for (int i = (int)(1); i <= (int)(v1); i++)
for (int j = (int)(i + 1); j <= (int)(v1); j++)
if (cmp(q1[j], q1[i])) swap(q1[i], q1[j]);
for (int i = (int)(1); i <= (int)(v2); i++)
for (int j = (int)(i + 1); j <= (int)(v2); j++)
if (cmp(q2[j], q2[i])) swap(q2[i], q2[j]);
for (int i = (int)(n + 2); i <= (int)(2 * n + 1); i++)
if (cmp(q1[1], q2[1])) {
q1[1] = i;
for (int j = (int)(1); j <= (int)(v1 - 1); j++)
if (cmp(q1[j + 1], q1[j]))
swap(q1[j + 1], q1[j]);
else
break;
} else {
q2[1] = i;
for (int j = (int)(1); j <= (int)(v2 - 1); j++)
if (cmp(q2[j + 1], q2[j]))
swap(q2[j + 1], q2[j]);
else
break;
}
puts("!");
fflush(stdout);
}
int main() {
int T;
scanf("%d", &T);
while (T--) solve();
}
| 15 | CPP |
n=int(input());a=[0];b=[0];s=0
for i in input():t=i=='.';b+=[b[-1]+1-t*2];s+=t
print(min([i+s for i in b])) | 0 | PYTHON3 |
import sys
sys.setrecursionlimit(10**6)
n = int(input())
p = list(map(int, input().split()))
c = [[] for _ in range(n)]
is_leaf = [True for _ in range(n)]
for i in range(n):
p[i] -= 1
c[p[i]].append(i)
is_leaf[p[i]] = False
if sum(is_leaf) == 0:
if n%2 == 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
sys.exit()
for i in range(n):
if is_leaf[i]:
cur = i
break
visited_set = {cur}
visited_list = [cur]
while p[cur] not in visited_set:
visited_list.append(p[cur])
visited_set.add(p[cur])
cur = p[cur]
root = p[cur]
grundy = [-1 for _ in range(n)]
g_set = [set() for _ in range(n)]
def dfs(x):
res = 0
for v in c[x]:
dfs(v)
g_set[x].add(grundy[v])
while res in g_set[x]:
res += 1
grundy[x] = res
return res
loop = [False for _ in range(n)]
loop[root] = True
ind = len(visited_list)-1
while visited_list[ind] != root:
loop[visited_list[ind]] = True
ind -= 1
#print(loop)
for i in range(n):
if loop[i]:
for x in c[i]:
if not loop[x]:
dfs(x)
g_set[i].add(grundy[x])
cand = []
num = 0
while num in g_set[root]:
num += 1
cand.append(num)
num += 1
while num in g_set[root]:
num += 1
cand.append(num)
for x in cand:
cur = root
grundy[root] = x
while True:
num = 0
while num in g_set[p[cur]] or num == grundy[cur]:
num += 1
grundy[p[cur]] = num
if p[cur] == root:
break
cur = p[cur]
if grundy[root] == x:
#print(grundy)
print("POSSIBLE")
sys.exit()
print("IMPOSSIBLE") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int T, N, rt, rrt, size[int(1e6 + 5)], fa[int(1e6 + 5)], F[int(1e6 + 5)];
int tot, hd[int(1e6 + 5)], ver[int(1e6 + 5)], nt[int(1e6 + 5)];
inline void addedge(int x, int y) {
++tot;
nt[tot] = hd[x];
ver[tot] = y;
hd[x] = tot;
}
inline void read(int &x) {
x = 0;
bool f = 0;
char ch = getchar();
for (; !(ch >= '0' && ch <= '9'); ch = getchar()) f |= ch == '-';
for (; (ch >= '0' && ch <= '9'); ch = getchar())
x = (x << 3) + (x << 1) + (ch ^ 48);
x = f ? -x : x;
}
inline void dfs(int x) {
size[x] = 1;
for (int i = hd[x]; i; i = nt[i]) {
int y = ver[i];
if (y == fa[x]) continue;
fa[y] = x;
dfs(y);
size[x] += size[y];
F[x] = ((F[x]) > (size[y]) ? (F[x]) : (size[y]));
}
F[x] = ((F[x]) > (N - size[x]) ? (F[x]) : (N - size[x]));
if (F[x] < F[rt])
rt = x, rrt = 0;
else if (F[x] == F[rt])
rrt = x;
}
int DFS(int x) {
for (int i = hd[x]; i; i = nt[i]) {
if (ver[i] == fa[x]) continue;
return DFS(ver[i]);
}
return x;
}
int main() {
read(T);
F[0] = 1e9;
while (T--) {
read(N);
rt = rrt = 0;
for (int i = 1; i <= tot; ++i) hd[i] = nt[i] = ver[i] = 0;
tot = 0;
for (int i = 1; i <= N; ++i) fa[i] = 0, F[i] = 0;
for (int i = 1; i < N; ++i) {
int x, y;
read(x);
read(y);
addedge(x, y);
addedge(y, x);
}
int x, y;
dfs(1);
if (rrt == 0) {
for (int i = hd[rt]; i; i = nt[i]) {
x = ver[i];
}
printf("%d %d\n", rt, x);
printf("%d %d\n", x, rt);
continue;
}
if (fa[rt] == rrt) swap(rt, rrt);
for (int i = hd[rrt]; i; i = nt[i]) {
if (ver[i] != rt) {
x = ver[i];
break;
}
}
printf("%d %d\n", rrt, x);
x = DFS(x);
printf("%d %d\n", rt, x);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool flag[100000005];
int main() {
long long n, m, sum, b, t_sqrt, t, b_sq;
while (cin >> n >> m) {
sum = 0;
memset(flag, 0, sizeof(flag));
for (b = 1; b <= n; b++) {
sum += min(m * 2, b * b * 2);
b_sq = b * b;
for (t_sqrt = b - 1; t_sqrt >= 0; t_sqrt--) {
t = t_sqrt * t_sqrt;
if (b_sq - t > m) break;
if (flag[b - t_sqrt]) sum--;
flag[b - t_sqrt] = true;
if (flag[b + t_sqrt]) sum--;
flag[b + t_sqrt] = true;
}
}
cout << sum << endl;
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 11) + 2;
int height[N];
int light[N];
int tmp[N];
int main() {
int n;
cin >> n;
for (int i = 2; i <= (1 << (n + 1)) - 1; ++i) {
cin >> light[i];
}
for (int i = (1 << (n + 1)) - 1; i >= 2; --i) {
height[i / 2] = max(height[i / 2], height[i] + light[i]);
}
long long ans = 0;
for (int i = 1; i <= (1 << n) - 1; ++i) {
int left = 2 * i;
int right = 2 * i + 1;
int rem_left = height[1] - height[left] - light[left] - tmp[i];
tmp[left] = light[left] + tmp[i] + rem_left;
int rem_right = height[1] - height[right] - light[right] - tmp[i];
tmp[right] = light[right] + tmp[i] + rem_right;
ans += rem_left + rem_right;
}
cout << ans << endl;
}
| 8 | CPP |
n = int(input())
a,b = 1,n
while a*a<=n:
if n%a == 0:
b=n//a
a+=1
print(n//b, b)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int n, x, c, ans, now, dlt;
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
dlt = 0;
scanf("%d", &x);
c = (int)log2(x);
if(x != (1 << c)) dlt = 1;
if(now < c) ans += c - now, now = c;
if(now > c) now = c, dlt = 0;
if(dlt) ++ans, ++now;
}
printf("%d\n", ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1e5 + 5;
long long read() {
long long s = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
s = s * 10 + c - '0';
c = getchar();
}
return s * f;
}
long long n, X, tot, cnt1, cnt2, num[N], p1[N], p2[N];
long long Multi(long long x, long long y, long long mod) {
return ((unsigned long long)x * y -
(unsigned long long)((long double)x / mod * y) * mod + mod) %
mod;
}
long long Pow(long long x, long long y, long long mod) {
long long ans = 1;
x %= mod;
while (y) {
if (y & 1) ans = Multi(ans, x, mod);
x = Multi(x, x, mod);
y >>= 1;
}
return ans;
}
void Divide(long long n) {
for (long long i = 1; i * i <= n; i++)
if (n % i == 0) {
num[++tot] = i;
if (i * i != n) num[++tot] = n / i;
};
sort(num + 1, num + tot + 1);
}
void GetPrime(long long n, long long p[], long long &tot) {
for (long long i = 2; i * i <= n; i++)
if (n % i == 0) {
p[++tot] = i;
while (n % i == 0) n /= i;
}
if (n != 1) p[++tot] = n;
}
long long Phi(long long n) {
long long phi = n;
for (int i = 1; i <= cnt1; i++)
if (n % p1[i] == 0) phi = phi / p1[i] * (p1[i] - 1);
return phi;
}
long long Solve(long long n) {
long long phi = Phi(n), ans = 0;
if (phi != 1) GetPrime(phi, p2, cnt2);
for (int i = 1; i <= tot; i++) {
long long F = Phi(num[i]), L = F;
for (int j = 1; j <= cnt2; j++) {
while (L % p2[j] == 0 && Pow(X, L / p2[j], num[i]) == 1) L /= p2[j];
}
ans += F / L;
}
return ans;
}
int main() {
n = read();
X = read();
Divide(n);
GetPrime(n, p1, cnt1);
printf("%lld", Solve(n));
return 0;
}
| 13 | CPP |
A, B, C = map(int, input().split())
K = int(input())
for i in range(K):
if A >= B:
B *= 2
elif B >= C:
C *= 2
print('Yes' if A<B<C else 'No') | 0 | PYTHON3 |
a,b,c,d=0,0,0,0
n=int(input())
s1,s2=input(),input()
for i in range(n):
a+=s1[i]=='0' and s2[i]=='1'
b+=s1[i]=='0' and s2[i]=='0'
c+=s1[i]=='1' and s2[i]=='1'
d+=s1[i]=='1' and s2[i]=='0'
print(a*d+b*c+b*d)
| 8 | PYTHON3 |
n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for i in range(m)]
for i in range(10**n):
ans = str(i)
if len(ans) != n:
continue
if all([ans[s-1] == str(c) for s, c in sc]):
print(ans)
exit()
print(-1) | 0 | PYTHON3 |
n=int(input())
A=set()
for i in range(n):
x,y=input().split()
if x == 'insert':
A.add(y)
else:
print('yes'*(y in A)or'no')
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
pair<int, int> t[N * 4];
void upd(int v, int l, int r, int pos, int val) {
if (l == r) {
t[v] = make_pair(val, l);
return;
}
int mid = (l + r) / 2;
if (pos <= mid)
upd(v * 2, l, mid, pos, val);
else
upd(v * 2 + 1, mid + 1, r, pos, val);
t[v] = max(t[v * 2], t[v * 2 + 1]);
}
pair<int, int> get(int v, int l, int r, int L, int R) {
if (l > r || L > r || l > R) return make_pair(0, 0);
if (L <= l && r <= R) return t[v];
int mid = (l + r) / 2;
return max(get(v * 2, l, mid, L, R), get(v * 2 + 1, mid + 1, r, L, R));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
pair<pair<int, int>, int> p[n + 4];
for (int i = 1; i <= n; ++i) {
int l, r;
cin >> l >> r;
p[i].first.first = r, p[i].first.second = l;
p[i].second = i;
}
sort(p + 1, p + 1 + n);
set<int> s;
for (int i = 1; i <= n; ++i) s.insert(i);
int a[n + 4], pos[n + 4];
vector<pair<int, int> > L[n + 4];
for (int i = 1; i <= n; ++i) {
int id = p[i].second;
int l = p[i].first.second, r = p[i].first.first;
a[id] = *s.lower_bound(l);
s.erase(a[id]);
L[l].push_back(make_pair(a[id], r));
pos[a[id]] = i;
}
int x = -1, y = -1;
int last = 0;
for (int i = 1; i <= n; ++i) {
int id = p[pos[i]].second;
int l = p[pos[i]].first.second, r = p[pos[i]].first.first;
for (auto it : L[i]) upd(1, 1, n, it.first, it.second);
pair<int, int> rr = get(1, 1, n, l, r);
if (a[id] <= rr.first && rr.second != a[id]) {
x = a[id], y = rr.second;
}
}
if (x != -1 && y != -1) {
cout << "NO\n";
for (int i = 1; i <= n; ++i) cout << a[i] << ' ';
cout << "\n";
for (int i = 1; i <= n; ++i) {
if (a[i] == x)
cout << y << ' ';
else if (a[i] == y)
cout << x << ' ';
else
cout << a[i] << ' ';
}
} else {
cout << "YES\n";
for (int i = 1; i <= n; ++i) cout << a[i] << ' ';
}
return 0;
}
| 12 | CPP |
a = str(input())
list1 = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
list2 = []
c = 0
for i in a:
if i in list1 and i not in list2:
list2 = list2 + [i]
c += 1
if i in list1 and i not in list2:
c += 1
print(c)
| 7 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
A = [int(x) for x in input().split()]
A.sort()
if max((A[i]-A[i-1] for i in range(1, n)), default=0) < 2:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
c=0
for i in range(1,d+1):
if(i%k==0 or i%l==0 or i%m==0 or i%n==0):
continue
else:
c+=1
print(d-c) | 7 | PYTHON3 |
input()
a = enumerate([int(x) for x in input().split()])
a = sorted(a, reverse=True, key=lambda x: x[1])
s = 0
for i, (k, v) in enumerate(a):
s += v * i + 1
print(s)
print(' '.join([str(x[0] + 1) for x in a]))
| 8 | PYTHON3 |
from collections import*
a=deque([1,2,3,4,5,6,7,8,9])
k=int(input())
for _ in range(k):
i=a.popleft()
if i%10>0:a.append(10*i+i%10-1)
a.append(10*i+i%10)
if i%10<9:a.append(10*i+i%10+1)
print(i) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int S = 500;
vector<int> v[300001];
vector<pair<int, int> > V[300001];
int T, n, q, k, x, po[300001], p[300001];
void solve() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= q; i++) {
scanf("%d", &k);
v[i].clear();
for (int j = 0; j < k; j++) scanf("%d", &x), v[i].push_back(x);
}
for (int i = 1; i <= q; i++)
if (v[i].size() >= S) {
int k = v[i].size();
for (int j = 0; j < k; j++) po[v[i][j]] = j + 1;
for (int j = 1, siz, l; j <= q; j++)
if (i != j) {
int mi = (po[v[j][0]] ? po[v[j][0]] : (1e9));
for (l = 1, siz = v[j].size(); l < siz; l++)
if (po[v[j][l]]) {
if (mi < po[v[j][l]] && !po[v[j][l - 1]] ||
po[v[j][l - 1]] && po[v[j][l - 1]] < po[v[j][l]] - 1) {
for (int j = 0; j < k; j++) po[v[i][j]] = 0;
puts("Human");
return;
}
mi = (mi > po[v[j][l]] ? po[v[j][l]] : mi);
}
}
for (int j = 0; j < k; j++) po[v[i][j]] = 0;
}
for (int i = 1; i <= n; i++) V[i].clear();
for (int i = 1, siz, j; i <= q; i++)
if (v[i].size() < S)
for (j = 0, siz = v[i].size(); j < siz; j++)
V[v[i][j]].push_back(make_pair(i, j));
for (int i = 1, siz, j; i <= n; i++) {
for (j = 0, siz = V[i].size(); j < siz; j++) {
int p1 = V[i][j].first, p2 = V[i][j].second, s = v[p1].size();
for (int k = p2 + 1, K; k < s; k++) {
K = v[p1][k];
if (!po[K])
po[K] = p1, p[K] = k;
else if (v[po[K]][p[K] - 1] != v[p1][k - 1]) {
for (j = 0, siz = V[i].size(); j < siz; j++) {
int p1 = V[i][j].first, p2 = V[i][j].second, s = v[p1].size();
for (int k = p2 + 1; k < s; k++) po[v[p1][k]] = 0;
}
puts("Human");
return;
}
}
}
for (j = 0, siz = V[i].size(); j < siz; j++) {
int p1 = V[i][j].first, p2 = V[i][j].second, s = v[p1].size();
for (int k = p2 + 1; k < s; k++) po[v[p1][k]] = 0;
}
}
puts("Robot");
}
int main() {
scanf("%d", &T);
memset(po, 0, sizeof(po));
while (T--) solve();
return 0;
}
| 14 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,i,j,k=1;string s;cin>>x;
while(k*(k+1)/2<x) k++;
for(j=0;j<2;j++) for(i=0;i<k;i++) s+=')'-j;
for(i=0;i<k*(k+1)/2-x;i++) swap(s[k-i-1],s[k-i]);
cout << s << endl;
return 0;
} | 0 | CPP |
def inp(type):
return type(input())
def minput(type):
return map(type, input().split())
def linput(type):
return list(minput(type))
def check(map, elem):
if not map.__contains__(elem):
map[elem] = set()
for t in range(inp(int)):
even1 = odd1 = 0
even2 = odd2 = 0
input()
for i in linput(int):
if i % 2 == 0:
even1 += 1
else:
odd1 += 1
input()
for i in linput(int):
if i % 2 == 0:
even2 += 1
else:
odd2 += 1
print(even1 * even2 + odd1 * odd2) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
m = min(a)
if a.count(m) == 1:
print(a.index(m) + 1)
else:
print('Still Rozdil')
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<string,string> P;
string s[1001];
bool b[1001];
vector<P>v;
vector<string>a;
int n,m;
int main(){
cin>>n>>m;
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<n;i++)if(!b[i]){
reverse(s[i].begin(),s[i].end());
for(int j=i+1;j<n;j++)if(!b[j]&&s[j]==s[i]){
reverse(s[j].begin(),s[j].end());
v.push_back(P(s[i],s[j]));
b[j]=b[i]=1;
break;
}
}
for(int i=0;i<n;i++)if(!b[i]){
string t=s[i];
reverse(s[i].begin(),s[i].end());
if(s[i]==t)a.push_back(t);
}
for(int i=0;i<v.size();i++)
if(v[i].second<v[i].first)swap(v[i].first,v[i].second);
sort(a.begin(),a.end());
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)cout<<v[i].first;
if(a.size())cout<<a[0];
for(int i=v.size()-1;i>=0;i--)cout<<v[i].second;
cout<<endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using db = long double;
using ll = long long;
using vi = vector <int>;
#define op operator
#define pb push_back
struct poi {
db x, y;
void r() { cin >> x >> y; }
poi op -(poi p) {
return {x - p.x, y - p.y};
}
db cross(poi p) {
return x * p.y - y * p.x;
}
};
db xmul(poi a, poi b, poi c) {
return (b - a).cross(c - a);
}
db li(poi a, poi b, poi c, poi d) {
if(xmul(a, b, c) * xmul(a, b, d) > 0) return 2;
return (c - a).cross(d - c) / (b - a).cross(d - c);
}
int main() {
cout << fixed << setprecision(9);
ios :: sync_with_stdio(0);
int t; cin >> t;
while(t --) {
poi a, b; a.r(); b.r();
int n; cin >> n;
vector <pair <db, int>> v;
while(n --) {
poi p, q; p.r(); q.r();
int o, l; cin >> o >> l;
db t = li(a, b, p, q);
if(t > 0 && t < 1)
v.pb({t, o ^ l});
}
sort(v.begin(), v.end());
int ans = 0;
for(int i = 1; i < v.size(); i ++)
if(v[i].second != v[i - 1].second)
ans ++;
cout << ans << '\n';
}
return 0;
} | 0 | CPP |
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def ec(x,y):
return x*y/gcd(x,y)
for _ in range(int(input())):
a,b,q = map(int,input().split())
for __ in range(q):
l,r = map(int,input().split())
tem = int(ec(a,b))
if r >= b:
l = max(l,b)
res = r-l+1
n = r//tem-(l-1)//tem
res -= n*max(a,b)
res += max(a,b)-r%tem-1 if r%tem < max(a,b) else 0
res -= max(a,b)-l%tem if l%tem < max(a,b) and l % tem != 0 else 0
print(res)
else:
print(0) | 9 | PYTHON3 |
n,m=map(int,input().split())
minn=10**100
for i in range(n):
a,b=map(int,input().split())
if a/b<minn:
minn=a/b
print(m*minn) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
int n, a[maxN];
long double res[3];
bool check(long double x) {
int i;
for (i = 0; i < n; i++)
if (a[i] > 2 * x + a[0]) break;
res[0] = a[0] + x;
int last = i;
for (i; i < n; i++)
if (a[i] > 2 * x + a[last]) break;
res[1] = a[last] + x;
last = i;
for (i; i < n; i++)
if (a[i] > 2 * x + a[last]) break;
res[2] = a[last] + x;
return (i >= n);
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
if (n < 4)
return cout << 0 << '\n' << a[0] << " " << a[1] << " " << a[2] << '\n', 0;
long double l = 0, r = 1e14;
for (int i = 0; i < 200; i++) {
long double mid = (l + r) / 2;
if (check(mid))
r = mid;
else
l = mid;
}
cout << fixed << setprecision(10);
if (check(double(r - 0.5)))
cout << (double)r - 0.5 << '\n'
<< res[0] << " " << res[1] << " " << res[2] << '\n';
else {
check(r);
cout << r << '\n' << res[0] << " " << res[1] << " " << res[2] << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
namespace SuffixArray {
template <class T>
void induce(int n, const T s[], bool ls[], int sa[], int l_basm[], int B) {
int buf[B + 10];
copy_n(l_basm, B + 1, buf);
for (int i = 0; i <= n; i++) {
if (sa[i] >= 1 && !ls[sa[i] - 1]) {
int bc = s[sa[i] - 1];
sa[buf[bc]++] = sa[i] - 1;
}
}
copy_n(l_basm, B + 1, buf);
for (int i = n; i > 0; i--) {
if (sa[i] >= 1 && ls[sa[i] - 1]) {
int bc = s[sa[i] - 1];
sa[--buf[bc + 1]] = sa[i] - 1;
}
}
}
template <class T>
void SA(int n, const T s[], int sa[], int B = 200) {
bool ls[n + 1];
int l_ba[B + 1], s_ba[B + 1];
fill_n(l_ba, B + 1, 0);
fill_n(s_ba, B + 1, 0);
ls[n] = true;
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1 || s[i] > s[i + 1]) {
ls[i] = false;
} else if (s[i] < s[i + 1]) {
ls[i] = true;
} else {
ls[i] = ls[i + 1];
}
if (!ls[i]) {
l_ba[(int)s[i]]++;
} else {
s_ba[(int)s[i]]++;
}
}
vector<int> v;
int lms[n + 1];
fill_n(lms, n + 1, -1);
int c = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[i] = c++;
v.push_back(i);
}
}
int l_basm[B + 1], s_basm[B + 1];
l_basm[0] = 1;
s_basm[0] = 1 + l_ba[0];
for (int i = 1; i <= B; i++) {
l_basm[i] = s_basm[i - 1] + s_ba[i - 1];
s_basm[i] = l_basm[i] + l_ba[i];
}
if (v.size()) {
vector<int> v2 = v;
int buf[B + 1];
copy_n(s_basm, B + 1, buf);
fill_n(sa, n + 1, -1);
sa[0] = n;
for (int i = 0; i < (int)v.size(); i++) {
int c = s[v[i]];
sa[buf[c]++] = v[i];
}
induce(n, s, ls, sa, l_basm, B);
int c = 0;
for (int i = 1; i <= n; i++) {
if (lms[sa[i]] == -1) continue;
v[c++] = sa[i];
}
int s2[v.size()];
int sa2[v.size() + 1];
c = 0;
s2[lms[v[0]]] = 0;
for (int i = 1; i < (int)v.size(); i++) {
int l = v[i - 1], r = v[i];
while (true) {
if (s[l] != s[r]) {
c++;
break;
}
l++;
r++;
if (lms[l] != -1 || lms[r] != -1) {
if (lms[l] == -1 || lms[r] == -1) {
c++;
}
break;
}
}
s2[lms[v[i]]] = c;
}
SA(v.size(), s2, sa2, c);
for (int i = 1; i <= (int)v.size(); i++) {
v[i - 1] = v2[sa2[i]];
}
}
int buf[B + 1];
copy_n(s_basm, B + 1, buf);
fill_n(sa, n + 1, -1);
sa[0] = n;
for (int i = 0; i < (int)v.size(); i++) {
int c = s[v[i]];
sa[buf[c]++] = v[i];
}
induce(n, s, ls, sa, l_basm, B);
}
template <class T>
void LCP(int n, const T s[], const int sa[], int lcp[]) {
int rsa[n + 1];
for (int i = 0; i <= n; i++) {
rsa[sa[i]] = i;
}
int h = 0;
for (int i = 0; i < n; i++) {
int j = sa[rsa[i] - 1];
if (h > 0) h--;
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rsa[i] - 1] = h;
}
}
} // namespace SuffixArray
const int MN = 2200;
int mt(string s, string t) {
int n = min((int)s.size(), (int)t.size());
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) return i;
}
return n;
}
int main() {
string s, sr;
cin >> s;
sr = s;
reverse(sr.begin(), sr.end());
int n = (int)s.size();
static int ssa[MN], srsa[MN];
SuffixArray::SA(n, s.c_str(), ssa);
SuffixArray::SA(n, sr.c_str(), srsa);
string t;
cin >> t;
int m = (int)t.size();
vector<P> res;
int p = 0;
while (p < m) {
int mi = 0;
P mp;
int nm;
P np;
int l = 0, r = n + 1;
while (r - l > 1) {
int md = (l + r) / 2;
if (s.substr(ssa[md]) < t.substr(p)) {
l = md;
} else {
r = md;
}
}
nm = mt(s.substr(ssa[l]), t.substr(p));
np = P(ssa[l] + 1, ssa[l] + nm);
if (mi < nm) {
mi = nm;
mp = np;
}
if (r < n + 1) {
nm = mt(s.substr(ssa[r]), t.substr(p));
np = P(ssa[r] + 1, ssa[r] + nm);
if (mi < nm) {
mi = nm;
mp = np;
}
}
l = 0, r = n + 1;
while (r - l > 1) {
int md = (l + r) / 2;
if (sr.substr(srsa[md]) < t.substr(p)) {
l = md;
} else {
r = md;
}
}
nm = mt(sr.substr(srsa[l]), t.substr(p));
np = P(srsa[l], srsa[l] + nm);
np = P(n - np.first, n + 1 - np.second);
if (mi < nm) {
mi = nm;
mp = np;
}
if (r < n + 1) {
nm = mt(sr.substr(srsa[r]), t.substr(p));
np = P(srsa[r], srsa[r] + nm);
np = P(n - np.first, n + 1 - np.second);
if (mi < nm) {
mi = nm;
mp = np;
}
}
if (mi == 0) {
cout << -1 << endl;
return 0;
}
p += mi;
res.push_back(mp);
}
cout << res.size() << endl;
for (P p : res) {
cout << p.first << " " << p.second << endl;
}
return 0;
}
| 9 | CPP |
x=0
for i in range(int(input())):
a=input()
x-=a.count("--")
x+=a.count("++")
print(x) | 7 | PYTHON3 |
l,r=map(int,input().split())
if l%2==0 and l+2<=r:
print(l,l+1,l+2)
elif l%2==1 and l+3<=r:
print(l+1,l+2,l+3)
else:
print(-1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
int t;
cin>>t;
while(t--) {
int c1, c2, c3, a1, a2, a3, a4, a5;
cin>>c1>>c2>>c3>>a1>>a2>>a3>>a4>>a5;
c1 -= a1;
c2 -= a2;
c3 -= a3;
if(c1 > 0) a4 -= c1;
if(a4 > 0) c3 -= a4;
if(c2 > 0) a5 -= c2;
if(a5 > 0) c3 -= a5;
if(c1 < 0 or c2 < 0 or c3 < 0) cout<<"NO\n";
else cout<<"YES\n";
}
} | 21 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int idx = 0;
int to = 1;
int maxi = INT_MIN;
int sz = 1;
while (idx < n) {
while (idx < n && a[idx] > to + sz - 1) {
idx++;
sz++;
}
if (idx < n && a[idx] <= to + sz - 1) {
to += sz;
sz = 0;
}
idx++;
sz = 1;
}
cout << to << "\n";
}
}
| 8 | CPP |
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
grid = [list(map(int,list(input().strip('\n')))) for i in range(n)]
ans = True
for i in range(n):
for j in range(n):
if grid[i][j]:
if i+1>=n: a = True
else: a = grid[i+1][j]
if j+1>=n: b = True
else: b = grid[i][j+1]
if not(a or b): ans = False
if ans: print('YES')
else: print('NO')
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int64_t N, K;
char R[100010];
int main() {
scanf("%lld%lld", &N, &K);
++K;
scanf("%s", R);
int count = 0;
int l = 0, r = 0;
for (int i = 0; i < N; ++i) {
R[i] = '1' - R[i];
if (R[i]) {
if (count == 0) {
l = i;
}
++count;
if (count == K) {
r = i;
}
}
}
int ml = (r + l) / 2;
int mr = (r + l + 1) / 2;
int midl = ml;
int midr = mr;
while (midl >= 0 && !R[midl]) --midl;
while (midr < N && !R[midr]) ++midr;
int best = min(r - midl, midr - l);
for (int i = 0; i < count - K; ++i) {
int newl = l + 1, newr = r + 1;
while (!R[newl]) ++newl;
while (!R[newr]) ++newr;
int nml = (newr + newl) / 2;
int nmr = (newr + newl + 1) / 2;
int nmidl = nml;
int nmidr = nmr;
if (nmidl >= midr) {
while (nmidl > midr && !R[nmidl]) --nmidl;
} else {
nmidl = midl;
}
if (nmidr > midr) {
while (nmidr < N && !R[nmidr]) ++nmidr;
} else {
nmidr = midr;
}
l = newl;
r = newr;
ml = nml;
mr = nmr;
midl = nmidl;
midr = nmidr;
int score = min(r - midl, midr - l);
best = min(best, score);
}
printf("%d\n", best);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int inf = pow(10, 9) + 7, n;
vector<vector<long long int>> v, v1;
map<long long int, long long int> level;
vector<long long int> ans;
vector<bool> vis;
long long int bfs(long long int r, vector<vector<long long int>> &a,
long long int cnt) {
queue<long long int> q;
q.push(r);
vis[r] = true;
level[r] = 0;
while (!q.empty()) {
long long int p = q.front();
q.pop();
for (long long int i = 0; i < a[p].size(); ++i) {
if (vis[a[p][i]] == false) {
q.push(a[p][i]);
level[a[p][i]] = level[p] + 1;
vis[a[p][i]] = true;
}
}
}
if (level.find(n) == level.end()) return -1;
return level[n];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int m;
cin >> n >> m;
set<pair<long long int, long long int>> se;
for (long long int i = 1; i <= n - 1; ++i) {
for (long long int j = i + 1; j <= n; ++j) se.insert({i, j});
}
v.resize(n + 1);
v1.resize(n + 1);
vis.resize(n + 1, false);
for (long long int i = 0; i < m; ++i) {
long long int x, y;
cin >> x >> y;
if (y < x) swap(x, y);
se.erase(se.find({x, y}));
v[x].push_back(y);
v[y].push_back(x);
}
for (auto i = se.begin(); i != se.end(); ++i) {
v1[i->first].push_back(i->second);
v1[i->second].push_back(i->first);
}
cout << (se.find({1, n}) != se.end() ? bfs(1, v, 0) : bfs(1, v1, 0));
return 0;
}
| 9 | CPP |
from itertools import groupby
nb_elements = int(input())
elements = [int(x) for x in input().split()]
maxs = max(elements)
ele_Group = groupby(elements)
max_len = 0
for k, g in ele_Group:
if k == maxs:
max_len = max(max_len, len(list(g)))
print(max_len) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int Pow[25];
int all[300005];
bool have[25] = {0};
int how[25];
int Next[300005][25];
int main() {
int N, M, i, j, k, a, b, ok, t;
Pow[0] = 1;
for (i = 1; i <= 20; i++) Pow[i] = Pow[i - 1] * 2;
scanf("%d %d", &N, &M);
for (i = 0; i < N; i++) {
scanf("%d", &all[i]);
for (j = 0; j < 20; j++) Next[i][j] = 1000000000;
}
for (i = 0; i < 20; i++) how[i] = 1000000000;
for (i = N - 1; i >= 0; i--) {
for (j = 0; j < 20; j++) {
if (all[i] & Pow[j])
Next[i][j] = i;
else
for (k = 0; k < 20; k++)
if (all[i] & Pow[k] && how[k] != 1000000000)
Next[i][j] = min(Next[i][j], Next[how[k]][j]);
}
for (j = 0; j < 20; j++)
if ((all[i] & Pow[j])) how[j] = i;
}
while (M--) {
scanf("%d %d", &a, &b);
a--;
b--;
ok = 0;
for (i = 0; i < 20; i++)
if (Next[a][i] <= b && (all[b] & Pow[i])) ok = 1;
if (ok)
printf("Shi\n");
else
printf("Fou\n");
}
return 0;
}
| 11 | CPP |
for _ in range(int(input())):
n = int(input())
l = list(map(int,input().split()))
s = sorted(l)
if s==l:
print(0)
else:
if s[0]==l[0] or s[-1]==l[-1]:
print(1)
elif s[0]==l[-1] and s[-1]==l[0]:
print(3)
else:
print(2) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100 + 5, Mod = 1e9 + 7;
int t, n, ai, ps[Maxn], l, r;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> ai;
ps[i] = ps[i - 1] + ai;
}
bool ok = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
if ((ps[j] - ps[i - 1]) % 2 == 0) {
ok = 1;
l = i, r = j;
}
}
}
if (ok) {
cout << (r - l + 1) << '\n';
for (int i = l; i <= r; i++) {
cout << i << ' ';
}
cout << '\n';
} else
cout << "-1\n";
}
return 0;
}
| 7 | CPP |
answer = 0
mod = 10**9 + 7
a,b = (int(n) for n in input().split(" "))
if abs(a-b) <= 1:
temp1 = 1
for i in range(1,a+1):
temp1 = (temp1 * i) % mod
temp2 = 1
for i in range(1,b+1):
temp2 = (temp2 * i) % mod
answer += (temp1 * temp2) % mod
if (a + b) % 2 == 0:
answer = (answer * 2) % mod
print(answer)
else:
print(0)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
int i, j, cont = 0;
for (i = 0; i <= 30; i++) {
for (j = 0; j <= 30; j++) {
long long int ans;
ans = pow(2, i) * pow(3, j);
if (ans >= a && ans <= b) cont++;
if (ans >= b) {
break;
}
}
}
cout << cont << endl;
}
| 7 | CPP |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,m,k,a;cin>>n>>m;
int ans=0;
vector<int> se(m,0);
for(int i=0;i<n;++i){
cin>>k;
for(int j=0;j<k;++j){
cin>> a;
++se[a-1];
}
}
for(int u:se) if(u==n)++ans;
cout<<ans<<endl;
return 0;
} | 0 | CPP |
n,k=map(int,input().split())
a=list(map(int,input().split()))
s=set(a)
ans=0
for i in s:
if i!=0 and i>=a[k-1]:
ans+=a.count(i)
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int P = 8, prime[P] = {2, 3, 5, 7, 11, 13, 17, 19};
int n, lim, p, sp1, sp2, sp3;
vector<int> v[1 << P];
void dfs(int x, int b, int i) {
if (i == p) {
v[b].push_back(x);
return;
}
dfs(x, b, i + 1);
b |= 1 << i;
for (x *= prime[i]; x <= lim; x *= prime[i]) dfs(x, b, i + 1);
}
bool dfs3(int a, int b, int c, int i) {
if (a >= lim || b >= lim || c >= lim) return false;
if (i == p) {
if (a == b || b == c || c == a) return false;
sp1 = a;
sp2 = b;
sp3 = c;
return true;
}
int pp = prime[i];
if (dfs3(a * pp, b * pp, c, i + 1)) return true;
if (dfs3(a * pp, b, c * pp, i + 1)) return true;
if (dfs3(a, b * pp, c * pp, i + 1)) return true;
return false;
}
int main() {
scanf("%d", &n);
lim = n * n * 2;
for (p = 3; p <= P; p++) {
for (int i = 0; i < (1 << p); i++) v[i].clear();
dfs(1, 0, 0);
vector<int> ans;
if (n % 2 == 1) {
dfs3(1, 1, 1, 0);
ans.push_back(sp1);
ans.push_back(sp2);
ans.push_back(sp3);
}
for (int i = 0; i < (1 << p); i++) {
vector<int> &v1 = v[i], &v2 = v[i ^ ((1 << p) - 1)];
while (!v1.empty() && !v2.empty()) {
int a1 = v1.back(), a2 = v2.back();
if (a1 == sp1 || a1 == sp2 || a1 == sp3) {
v1.pop_back();
continue;
}
if (a2 == sp1 || a2 == sp2 || a2 == sp3) {
v2.pop_back();
continue;
}
ans.push_back(a1);
ans.push_back(a2);
v1.pop_back();
v2.pop_back();
if (ans.size() == n) {
for (int a : ans) printf("%d ", a);
return 0;
}
}
}
}
}
| 9 | CPP |
n = int(input())
vs = [int(x) for x in input().split()]
ts = [int(x) for x in input().split()]
from heapq import *
q = []
heapify(q)
sts = ts[:]
for i in range(1, n):
sts[i] += sts[i-1]
res = []
for i in range(n):
v = vs[i]
t = ts[i]
v += sts[i] - ts[i]
heappush(q, v)
minv = heappop(q)
count = 0
while minv <= sts[i]:
count += minv - sts[i] + ts[i]
if not q: break
minv = heappop(q)
else:
heappush(q, minv)
res.append(count + len(q) * t)
print(" ".join(map(str, res)))
| 8 | PYTHON3 |
T=int(input())
for i in range(T):
a,b=input().split()
a,b=int(a),int(b)
if(a%b!=0):
print(b-(a%b))
else:
print("0") | 10 | PYTHON3 |
n, m, z = map(int, input().split())
print(sum(1 for t in range(1, z + 1) if t % n == 0 and t % m == 0))
| 7 | PYTHON3 |
//besmellah
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair <string, string> pii;
map <pii, int> M;
int32_t main() {
int n;
cin >> n;
string s;
cin >> s;
for (int mask = 0; mask < (1 << n); mask++) {
string t = "";
string q = "";
for (int i = 0; i < n; i++){
if (mask & (1 << i))
t += s[i];
else
q += s[i];
}
M[pii(t, q)] ++;
}
int ans = 0;
for (int mask = 0; mask < (1 << n); mask++) {
string t = "", q = "";
for (int i = n - 1; i >= 0; i --) {
if (mask & (1 << i))
t += s[i + n];
else
q += s[i + n];
}
ans += M[pii(t, q)];
}
cout << ans;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, c;
cin >> n >> k >> c;
set<int> holidays = set<int>();
for (int i = (0); i < (c); i++) {
int val;
cin >> val;
holidays.insert(val);
}
int count = 0, acc = 1;
for (int i = (1); i < (n + 1); i++) {
if (acc == k || holidays.find(i) != holidays.end()) {
count++;
acc = 0;
}
acc++;
}
cout << count << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
for (int j = 0; j < i / 2; j++) {
swap(s[j], s[i - 1 - j]);
}
}
}
cout << s << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 998244353;
const int MAXN = 600005;
const int INF = 0x3f3f3f3f;
inline int read() {
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return x * f;
}
long double fac[MAXN];
inline long double C(int x, int y) { return fac[x] - fac[y] - fac[x - y]; }
inline void Init(int n) {
for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] + log(1.0 * i);
}
int main() {
int n = read(), m = read(), k = read();
Init(m);
long double ans = 0;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++) {
int t = (i + j) * n - i * j;
if (k - t >= 0) {
long double p = C(n, i) + C(n, j) + C(m - t, k - t) - C(m, k);
ans = min((long double)1e99, ans + exp(p));
}
}
printf("%.10lf\n", (double)ans);
return 0;
}
| 10 | CPP |
r,d,x=map(int,input().split())
for i in range(10):
s=r*x-d
x=s
print(x) | 0 | PYTHON3 |
#include <iostream>
using namespace std;
int main(int argc, char const* argv[])
{
int pm,pe,pj,n;
while( cin >> n && n != 0 ){
for( int i = 0;i < n;i++ ){
cin >> pm >> pe >> pj;
if( pm == 100 || pe == 100 || pj == 100 || ( pm + pe ) / 2 >= 90 || (pm + pe + pj) / 3 >= 80 ) cout << 'A' << endl;
else if( ( pm + pe + pj ) / 3 >= 70 || (( pm + pe + pj ) /3 >= 50 && (pm >= 80 || pe >= 80)) ) cout << 'B' << endl;
else cout << 'C' << endl;
}
}
return 0;
} | 0 | CPP |
a = str(input()).lower()
b = str(input()).lower()
if a < b:
print(-1)
elif a > b:
print(1)
elif a==b:
print(0)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
char tictac[MAXN][MAXN];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int answer[3] = {0};
for (int i = 0; i < n; i++) {
scanf("%s", tictac[i]);
}
for (int st = 0; st < 3; st++) {
for (int i = 0; i < n; i++) {
for (int j = (st + i) % 3; j < n; j += 3) {
if (tictac[i][j] == 'X') answer[st] += 1;
}
}
}
int best = 0;
for (int i = 1; i < 3; i++) {
if (answer[i] < answer[best]) {
best = i;
}
}
for (int i = 0; i < n; i++) {
for (int j = (best + i) % 3; j < n; j += 3) {
if (tictac[i][j] == 'X') tictac[i][j] = 'O';
}
}
for (int i = 0; i < n; i++) {
printf("%s\n", tictac[i]);
}
}
return 0;
} | 9 | CPP |
#include <bits/stdc++.h>
std::string s, current;
int numbers[10], resp = 0;
int t;
int pot(int base, int exp) {
if (exp == 0) return 1;
if (exp == 1) return base;
return base * pot(base, exp - 1);
}
int main() {
std::cin >> t;
while (t) {
std::cin >> s;
memset(numbers, 0, sizeof(numbers));
for (int i = 0; i < s.size(); ++i) {
if (s[i] != '0') {
resp++;
numbers[i] = ((int)(s[i]) - 48) * pot(10, s.size() - i - 1);
}
}
std::cout << resp << "\n";
for (int i = 0; i < s.size(); ++i) {
if (numbers[i] != 0) std::cout << numbers[i] << " ";
}
resp = 0;
std::cout << "\n";
--t;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> v[N];
int n, color[N];
bool vis[N];
bool dfs(int x, int cnt = 0) {
vis[x] = true;
bool ok = true;
for (int i = 0; i < v[x].size(); i++) {
int to = v[x][i];
if (!vis[to]) {
if (cnt > 0) {
ok &= (color[x] == color[to]);
}
ok &= dfs(to, cnt + 1);
}
}
return ok;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
pair<int, int> x[N];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
x[i].first = a;
x[i].second = b;
v[a].push_back(b);
v[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
cin >> color[i];
}
pair<int, int> tst = make_pair(-1, -1);
for (int i = 0; i < n - 1; i++) {
if (color[x[i].first] != color[x[i].second]) {
tst.first = x[i].first;
tst.second = x[i].second;
}
}
if (tst.first == -1) {
cout << "YES\n1";
return 0;
}
if (dfs(tst.first)) {
cout << "YES" << endl << tst.first;
return 0;
}
memset(vis, false, sizeof vis);
if (dfs(tst.second)) {
cout << "YES" << endl << tst.second;
return 0;
}
cout << "NO";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 100005;
int N, M, W[MAXM];
int main() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
int t;
scanf("%d%d", &t, &W[i]);
}
sort(W, W + M);
int k = 0;
for (int i = 1; i <= M; i += 2)
if (i * (i - 1) / 2 + 1 <= N)
k = max(k, i);
else
break;
for (int i = 2; i <= M; i += 2)
if (i * (i - 1) / 2 + i / 2 - 1 + 1 <= N)
k = max(k, i);
else
break;
int ans = 0;
for (int i = M - 1; i >= M - k; i--) ans += W[i];
printf("%d\n", ans);
return 0;
}
| 11 | CPP |
n = int(input())
for i in range (n):
a,b = input().split()
if(a!=b): print('Happy Alex') ; exit(0)
print('Poor Alex') | 7 | PYTHON3 |
import sys
lines = sys.stdin.readlines()
n = int(lines[0].strip())
edges = {}
for i in range(1,n):
(u, v) = map(int, lines[i].strip().split(" "))
if u not in edges: edges[u] = []
if v not in edges: edges[v] = []
edges[u].append(v)
edges[v].append(u)
leaves = []
parLeave = {}
for u in edges.keys():
if len(edges[u]) == 1:
leaves.append(u)
parLeave[u] = edges[u][0]
maxF = n - (len(leaves) - len(set(parLeave.values()))) - 1
parity = {leaves[0]: 0}
stack = [leaves[0]]
seen = set(stack)
while stack:
node = stack.pop()
for adj in edges[node]:
if adj not in seen:
parity[adj] = 1- parity[node]
stack.append(adj)
seen.add(adj)
parityOfLeaves = list(map(lambda x: parity[x], leaves))
if min(parityOfLeaves) == max(parityOfLeaves): minF = 1
else: minF = 3
print("{} {}".format(minF, maxF)) | 10 | PYTHON3 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace std;
int main(){
int h,r;cin>>h>>r;
if(h<-r){
cout<<-1<<endl;
}else if(-r==h){
cout<<0<<endl;
}else{
cout<<1<<endl;
}
}
| 0 | CPP |
s = input()
t = s[1:len(s)]
t = s[0].upper()+t
print(t)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500100;
int a[N];
int b[N];
int c[N];
bool vis[N];
int mabs(int x) { return x >= 0 ? x : -x; }
int main() {
int n;
int cnt = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != 0) cnt++;
}
if (cnt == 0) {
printf("%d ", n * (n + 1) / 2);
for (int i = 1; i < n; i++) printf("0 ");
} else {
for (int i = 0; i < n; i++) {
if (a[i] == 0) continue;
int tmp = mabs(a[i]);
for (int j = 2; j * j <= tmp; j++) {
int t = j * j;
while (a[i] % t == 0) {
a[i] /= t;
}
}
}
for (int i = 0; i < n; i++) c[i] = a[i];
sort(c, c + n);
int js = unique(c, c + n) - c;
for (int i = 0; i < n; i++) {
if (a[i] == 0) continue;
int p = lower_bound(c, c + js, a[i]) - c + 1;
a[i] = p;
}
for (int i = 0; i < n; i++) {
memset(vis, 0, sizeof(vis));
int num = 0;
for (int j = i; j < n; j++) {
if (!vis[a[j]] && a[j] != 0) {
num++;
vis[a[j]] = 1;
}
int tt = max(num, 1);
b[tt]++;
}
}
for (int i = 1; i <= n; i++) {
printf("%d ", b[i]);
}
}
return 0;
}
| 10 | CPP |
try:
t = int(input())
while t:
n = int(input())
#repeating digit
temp1 = n%10
#no. of digits
temp2 = 0
while n!=0:
n = n//10
temp2+=1
#no. of digits getting pressed
temp3 = 0
temp3 = temp1*10
if temp2 == 1:
temp3-=9
elif temp2 == 2:
temp3-=7
elif temp2 == 3:
temp3-=4
#final answer
print(temp3)
t-=1
except:
pass | 7 | PYTHON3 |
for _ in range(int(input())):
x1,y1,z1 = map(int,list(input().split()))
x2,y2,z2 = map(int,list(input().split()))
s = 0
temp = min(x1,z2)
x1 -= temp
z2 -= temp
temp = min(y1,x2)
y1 -= temp
x2 -= temp
temp = min(z1,y2)
z1 -= temp
y2 -= temp
s += 2*temp
s -= 2*min(y1,z2)
print(s) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(6);
for (int i = 0; i < 6; i++) {
scanf("%d", &a[i]);
}
int fcnt, flag = 0;
for (int i = 0; i < 6; i++) {
if (count(a.begin(), a.end(), a[i]) >= 4) {
fcnt = a[i];
flag = 1;
break;
}
}
if (!flag)
cout << "Alien\n";
else {
for (int i = 0; i < a.size(); i++) {
if (a.size() == 2) break;
if (a[i] == fcnt) {
a.erase(a.begin() + i);
i--;
}
}
if (a.size() == 2) {
if (a[0] == a[1])
cout << "Elephant\n";
else
cout << "Bear\n";
} else
cout << "Alien\n";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAX_N = 1e5 + 10;
long long t, n, a[MAX_N], sum1[MAX_N], sum2[MAX_N];
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
bool flag = 1;
for (int i = 0; i + 2 < n; i++) {
if (a[i] < a[i + 1] && a[i + 1] > a[i + 2]) {
printf("YES\n%d %d %d\n", i + 1, i + 2, i + 3);
flag = 0;
break;
}
}
if (flag) printf("NO\n");
}
return 0;
}
| 7 | CPP |
# https://codeforces.com/contest/630/problem/A
import sys
import math
def main():
# sys.stdin = open('E:\\Sublime\\in.txt', 'r')
# sys.stdout = open('E:\\Sublime\\out.txt', 'w')
# sys.stderr = open('E:\\Sublime\\err.txt', 'w')
n = int(sys.stdin.readline().strip())
# a, b = map(int, sys.stdin.readline().strip().split()[:2])
print(25)
if __name__ == '__main__':
main()
# hajj
# γγγγγγ οΌΏοΌΏ
# γγγγγοΌοΌγγγ
# γγγγγ| γ_γ _ l
# γ γγγοΌ` γοΌΏxγ
# γγ γ /γγγ γ |
# γγγ /γ γ½γγ οΎ
# γ γ βγγ|γ|γ|
# γοΌοΏ£|γγ |γ|γ|
# γ| (οΏ£γ½οΌΏ_γ½_)__)
# γοΌΌδΊγ€
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, q, k, a[3005][3005], b[3005], c[3005], L[3005], R[3005];
vector<int> val[3005];
int main() {
scanf("%d%d%d%d", &n, &m, &q, &k);
for (int i = 1; i <= q; i++) {
int x, y;
scanf("%d%d", &x, &y);
a[x][y]++;
val[x].push_back(y);
}
long long ans = 0;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= m; j++) b[j] += a[i][j];
int las = 0;
for (int j = 1; j <= m; j++) {
c[j] = b[j];
if (c[j]) {
L[j] = las;
R[las] = j;
las = j;
}
}
R[las] = m + 1;
L[m + 1] = las;
c[0] = c[m + 1] = 1e9;
for (int j = n; j >= i; j--) {
int sz = val[j].size();
for (int l = 0; l < sz; l++) {
int v = val[j][l];
int nw = v, ct = c[v];
while (nw && ct < k) {
nw = L[nw];
ct += c[nw];
}
for (int r = v; r <= m; ct += c[R[r]], r = R[r]) {
while (nw <= v && ct > k) {
ct -= c[nw];
nw = R[nw];
}
if (nw > v) break;
if (ct == k) ans += 1ll * (nw - L[nw]) * (R[r] - r) * (n - j + 1);
}
c[v]--;
if (!c[v]) {
L[R[v]] = L[v];
R[L[v]] = R[v];
}
}
}
}
printf("%lld\n", ans);
return 0;
}
| 11 | CPP |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main(){
for(int n, m; cin >> n >> m, n;){
vll A(n);
ll ans = -1;
for(int i = 0; i < n; i++)cin >> A[i];
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(A[i] + A[j] <= m)ans = max(ans, A[i]+A[j]);
}
}
if(ans < 0)cout <<"NONE"<<endl;
else cout << ans << endl;
}
return 0;
}
| 0 | CPP |
# coding=utf-8
if __name__ == '__main__':
line = str(input())
pos = 0
tar = 'hello'
for c in line:
if pos == len(tar):
break
if c == tar[pos]:
pos += 1
if pos == len(tar):
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
typedef long long ll;
using namespace std;
/*
class LightSwitchingPuzzle
{
public:
int minFlips(string s)
{
}
}
*/
int main()
{
int W, Q;
while (cin >> W >> Q)
{
if (W == 0 && Q == 0) break;
vector<bool> wall(W, true);
map<int, pair<int, int> > cat;
for (int i=0; i<Q; i++)
{
char t;
int id, w;
cin >> t;
if (t == 's')
{
cin >> id >> w;
bool can_sleep = false;
for (int j=0; j<=W-w; j++)
{
bool found = true;
for (int k=0; k<w; k++)
{
if (!wall[j+k])
{
found = false;
break;
}
}
if (found)
{
for (int k=0; k<w; k++)
{
wall[j+k] = false;
}
cat[id] = make_pair(j, j+w);
cout << j << endl;
can_sleep = true;
break;
}
}
if (!can_sleep)
{
cout << "impossible" << endl;
}
} else {
cin >> id;
int from = cat[id].first;
int to = cat[id].second;
for (int j=from; j<to; j++)
{
wall[j] = true;
}
}
}
cout << "END" << endl;
}
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> c(n,0);
for(int x=1;x*x<=n*2;x++)
for(int y=1;(x+y)*(x+y)<=n*2;y++)
for(int z=1;(x+y+z)*(x+y+z)<=n*2;z++)
if(x*x+y*y+z*z+x*y+y*z+z*x<=n)
c.at(x*x+y*y+z*z+x*y+y*z+z*x-1)++;
for(int i=0;i<n;i++)
cout<<c.at(i)<<endl;
} | 0 | CPP |
mod = 10**9 + 7
def power(x,e):
res = 1
while e:
if e&1:
res = res * x % mod
x = (x*x) % mod
e >>= 1
return res
for _ in range(int(input())):
n,m = map(int,input().split())
cnt = 0
for _ in range(n):
cnt += input().count('#')
r = 1 if cnt==m*n else 0
res = power(2,cnt) - r % mod
print(res)
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105, mo = 1e9 + 7;
int gi() {
char ch = getchar();
int x = 0, q = 0;
while (ch < '0' || ch > '9') (ch == '-' ? q = 1 : 0), ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return q ? (-x) : x;
}
int fap(int a, int b) {
int s = 1;
while (b) {
if (b & 1) s = 1ll * s * a % mo;
b >>= 1, a = 1ll * a * a % mo;
}
return s;
}
int len[N], f[N][N][N], p[N];
char s[N];
int main() {
int n, x;
cin >> n >> x;
len[0] = len[1] = 1, p[0] = p[1] = 2;
for (int i = 2; i <= x; ++i)
len[i] = (len[i - 1] + len[i - 2]) % (mo - 1), p[i] = fap(2, len[i]);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
if (s[i] == '1')
f[1][i][i] = 1;
else
f[0][i][i] = 1;
for (int t = 2; t <= x; ++t) {
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j) {
if (j == n)
((f[t][i][j] += 1ll * f[t - 1][i][j] * p[t - 2] % mo) %= mo);
else
((f[t][i][j] += f[t - 1][i][j]) %= mo);
if (i == 1)
((f[t][i][j] += 1ll * f[t - 2][i][j] * p[t - 1] % mo) %= mo);
else
((f[t][i][j] += f[t - 2][i][j]) %= mo);
}
for (int i = 1; i < n; ++i)
for (int j = i; j < n; ++j)
for (int k = j + 1; k <= n; ++k)
((f[t][i][k] += 1ll * f[t - 1][i][j] * f[t - 2][j + 1][k] % mo) %=
mo);
}
cout << f[x][1][n];
return 0;
}
| 12 | CPP |
import math
def main():
s = input()
k = int(input())
ns = len(s)
if ns % k != 0:
print('NO')
return
k = int(ns/k)
while len(s)>0:
crt = s[:k]
crt1 = crt[::-1]
s = s[k:]
if crt != crt1:
print('NO')
return
print('YES')
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0081
//????§£?????????
//?????????????????????
#include<iostream>
#include<complex>
#include<cstdio>
using namespace std;
typedef complex<double> xy_t;
double x[3], y[3];
double pro(xy_t a, xy_t b) {
return (conj(a)*b).real();
}
int main()
{
xy_t p[3], a, b, c, d;
char n;
while (cin >> x[0] >> n >> y[0] >> n >> x[1] >> n >> y[1]
>> n >> x[2] >> n >> y[2])
{
p[0] = xy_t(x[0], y[0]);
p[1] = xy_t(x[1], y[1]);
p[2] = xy_t(x[2], y[2]);
a = p[2] - p[0];
b = p[1] - p[0];
c = b*pro(a, b) / norm(b) + p[0];
d = c + c - p[2];
printf("%.6f %.6f\n", real(d), imag(d));
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, t, k;
vector<long long> a(1000000);
int main() {
string s, t;
cin >> n;
cin >> s >> t;
if (count((s).begin(), (s).end(), '0') !=
count((t).begin(), (t).end(), '0')) {
cout << -1 << endl;
exit(0);
}
for (long long i = 0; i < n; i++)
if (s[i] == t[i]) s[i] = 'x';
stack<int> vals[2];
for (long long i = 0; i < n; i++) {
if (s[i] != 'x') {
int v = s[i] - '0';
if (vals[1 - v].empty())
vals[v].push(i);
else {
vals[v].push(vals[1 - v].top());
vals[1 - v].pop();
}
}
}
cout << vals[0].size() + vals[1].size() << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int wX[500];
int wY[500];
int oX[500];
int oY[500];
int oC[500];
int main(int argc, char* argv[]) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
wX[i] = a + a + b + b;
wY[i] = c;
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
oX[i] = b;
oY[i] = a;
oC[i] = c;
}
int sum = 0;
for (int i = 0; i < n; i++) {
int minCost = INT_MAX;
for (int j = 0; j < m; j++) {
int nX = oY[j] / wY[i];
if (nX == 0) continue;
int n = (wX[i] + nX * oX[j] - 1) / (nX * oX[j]);
int c = n * oC[j];
minCost = min(minCost, c);
}
sum += minCost;
}
cout << sum;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 9;
pair<long long, long long> a[MAX];
long long sum[MAX], res[MAX], n, cf, cm, m, A;
pair<long long, pair<long long, long long>> ans;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> A >> cf >> cm >> m;
for (int i = 1; i <= n; i++) cin >> a[i].first, a[i].second = i;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i].first;
long long p = n;
for (long long i = 0; i <= n; i++) {
long long d = m - i * A + sum[n] - sum[n - i];
if (d < 0) break;
p = min(p, n - i);
while (p > 1 && d < p * a[p].first - sum[p]) p--;
d -= p * a[p].first - sum[p];
long long k = min(A, i == n ? A : (a[p].first + d / p));
ans = max(ans, {i * cf + k * cm, {i, k}});
}
cout << ans.first << '\n';
for (int i = 0; i < ans.second.first; i++) a[n - i].first = A;
for (int i = 1; i <= n; i++)
a[i].first = max(a[i].first, ans.second.second),
res[a[i].second] = a[i].first;
for (int i = 1; i <= n; i++) cout << res[i] << " ";
return 0;
}
| 10 | CPP |
r=int(input())
if r<1200:
print('ABC')
elif r<2800:
print("ARC")
else:
print('AGC') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int pr[1000000 + 1], x, y, z;
long long s;
int main() {
cin >> x >> y >> z;
for (int i = 1; i <= (x * y * z); ++i) {
for (int j = i; j <= (x * y * z); j += i) ++pr[j];
}
for (int i = 1; i <= x; ++i) {
for (int j = 1; j <= y; ++j) {
for (int k = 1; k <= z; ++k) s += pr[i * j * k];
}
}
cout << s % 1073741824 << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int M = 1000000;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double Pi = 2 * acos(0.0);
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
inline int bit(int x) { return 1 << x; }
inline double dabs(double x) { return x > 0 ? x : (-x); }
inline int abs(int x) { return x > 0 ? x : (-x); }
inline int lowbit(int x) { return x & (-x); }
int cnt[5];
vector<int> v;
int main() {
int k, t;
ios::sync_with_stdio(0);
cin >> k;
while (k--) {
cin >> t;
if (t == 0)
cnt[0] = 1;
else if (t == 100)
cnt[4] = 1;
else if (t % 10 == 0)
cnt[3] = t;
else if (t > 10)
cnt[2] = t;
else
cnt[1] = t;
}
if (cnt[0]) v.push_back(0);
if (cnt[4]) v.push_back(100);
if (cnt[1] || cnt[3]) {
if (cnt[1]) v.push_back(cnt[1]);
if (cnt[3]) v.push_back(cnt[3]);
} else if (cnt[2])
v.push_back(cnt[2]);
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] << ' ';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 34;
const int maxlog = 20;
const int mod = 1e9 + 7;
const int sq = 720;
const int inf = 1e9;
vector<int> adj[maxn];
long double prob[maxn];
int cnt[maxn];
void dfs(int v) {
cnt[v] = 1;
for (auto u : adj[v]) {
dfs(u);
cnt[v] += cnt[u];
}
}
void dfs2(int v) {
for (auto u : adj[v])
prob[u] = prob[v] + (long double)(cnt[v] - 1 - cnt[u]) / 2 + 1;
for (auto u : adj[v]) dfs2(u);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout.precision(20);
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int p;
cin >> p;
adj[p].push_back(i);
}
prob[1] = 1;
dfs(1);
dfs2(1);
for (int i = 1; i <= n; i++) cout << prob[i] << " ";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:200777216")
using namespace std;
int ans[1100000];
int main() {
int n;
cin >> n;
int a[110000];
int x, y;
for (int i = 0; i < n; ++i) cin >> a[i];
cin >> x >> y;
ans[0] = 0;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
if ((i == 0) || (a[i] != a[i - 1])) {
int st = y / a[i];
st *= a[i];
while (st <= x) {
if (st - a[i] >= y) {
if (ans[st - 1 - y] < a[i] - 1) ans[st - 1 - y] = a[i] - 1;
}
st += a[i];
}
}
}
ans[x - y] = 1;
for (int i = 0; i < n; ++i) {
if (ans[x - y] < x % a[i])
if (x % a[i] <= x - y) ans[x - y] = x % a[i];
}
for (int i = 1; i <= x - y; ++i)
if (ans[i] < 1) ans[i] = 1;
for (int i = x - y - 1; i > 1; i--) {
if (ans[i] < ans[i + 1] - 1) ans[i] = ans[i + 1] - 1;
}
int pp = 0;
int cur = x - y;
while (cur > 0) {
++pp;
cur -= ans[cur];
}
cout << pp << endl;
return 0;
}
| 9 | CPP |
T=int(input())
for i in range(T):
n,x=map(int,input().split(' '))
print(x*2) | 7 | PYTHON3 |
#19:32
n = int(input())
raw = []
eo = []
h = 30
for _ in range(n):
x,y = map(int,input().split())
raw.append([x,y])
eo.append((x+y)%2)
if sum(eo) == 0:
print(h+2)
d = [2**(h-i) for i in range(h+1)]
d.append(1)
print(' '.join(map(str,d)))
elif sum(eo) == n:
print(h+1)
d = [2**(h-i) for i in range(h+1)]
print(' '.join(map(str,d)))
else:
print(-1)
exit()
for xy in raw:
x,y = xy
scale = 2 ** h
ans = ''
while scale != 0:
tmp = [[0,0,'U'],[0,1,'D'],[0,2,'R'],[0,3,'L']]
tmp[0][0] = x ** 2 + (y-1) ** 2
tmp[1][0] = x ** 2 + (y+1) ** 2
tmp[2][0] = (x-1) ** 2 + y ** 2
tmp[3][0] = (x+1) ** 2 + y ** 2
d,dr = min(tmp)[1],min(tmp)[2]
ans += dr
if d == 0:
y -= scale
elif d == 1:
y += scale
elif d == 2:
x -= scale
else:
x += scale
scale //= 2
if x+y != 0:
if y == 1:
ans += 'U'
elif y == -1:
ans += 'D'
elif x == 1:
ans += 'R'
else:
ans += 'L'
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long dp[40][40][2];
int k;
const int MOD = 7 + (int)1e9;
long long dfs(int i, int n, bool e) {
if (i < 0) return 1;
long long& res = dp[i][n][e];
if (res >= 0) return res;
res = 0;
int limit = (bool)(k & (1 << i));
if (e || limit) (res += dfs(i - 1, n + 1, e)) %= MOD;
if (n == 0)
(res += dfs(i - 1, n, e | limit)) %= MOD;
else {
if (limit || e) (res += dfs(i - 1, n, e) * (1 << (n - 1))) %= MOD;
(res += dfs(i - 1, n, e | limit) * (1 << (n - 1))) %= MOD;
}
return res;
}
int main() {
cin >> k;
memset(dp, -1, sizeof dp);
cout << dfs(31, 0, 0) << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
vector<long long> arr(4);
for (int i = 0; i < 4; i++) cin >> arr[i];
int counter = 0;
for (int i = 0; i < 4; i++) counter += arr[i] % 2;
if (counter == 0 || counter == 1 || counter == 4) {
cout << "Yes\n";
return;
} else if (counter == 3) {
if (arr[0] != 0 && arr[1] != 0 && arr[2] != 0)
cout << "Yes\n";
else
cout << "No\n";
} else
cout << "No\n";
return;
}
int main() {
int t;
cin >> t;
while (t--) solve();
}
| 7 | CPP |
a = int(input().strip())
v = set()
h = set()
for i in range(a):
cnt = [int(x) for x in input().strip().split(' ')]
v.add(cnt[0])
h.add(cnt[1])
print(min(len(v), len(h))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int maxn = 2e5 + 5;
int n;
char s[maxn];
int f[15];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= 9; i++) scanf("%d", &f[i]);
bool start = false;
for (int i = 1; s[i]; i++) {
int a = s[i] - '0';
if (f[a] > a) {
s[i] += f[a] - a;
start = true;
} else if (f[a] < a) {
if (start) break;
}
}
puts(s + 1);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int x[1000], y[1000];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
double ans = 0;
for (int i = 0; i < n - 1; i++) {
ans += sqrt((double)((x[i] - x[i + 1]) * (x[i] - x[i + 1]) +
(y[i] - y[i + 1]) * (y[i] - y[i + 1])));
}
ans = (ans * (double)k) / 50;
cout << fixed << setprecision(9) << ans << endl;
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,q;
cin>>n>>q;
string s;
cin>>s;
ll dp[n],i;
dp[0]=s[i]-'a'+1;
for(i=1;i<n;i++)
{
ll temp=s[i]-'a'+1;
dp[i]=temp+dp[i-1];
}
while(q--)
{
ll l,r;
cin>>l>>r;
ll ans;
if(l==1)
{
cout<<dp[r-1]<<endl;
}
else
{
cout<<dp[r-1]-dp[l-2]<<endl;
}
}
return 0;
} | 8 | CPP |
if __name__ == '__main__':
x = int(input())
print(x % 2)
| 7 | PYTHON3 |
Q = int(input())
for q in range(Q):
n = int(input())
L = list(map(int, input().split()))
L.sort()
y = 0
for i in range(1, n):
if L[i] - L[i-1] == 1:
y = 1
if y == 1: print(2)
else:
print(1) | 7 | PYTHON3 |
def f(a):
if a==1:
return 1
else:
return a*f(a-1)
l=list(map(int,input().split()))
print(f(min(l[0],l[1]))) | 7 | PYTHON3 |
for _ in range(int(input())):
n,k=map(int,input().split())
z=input()
s=[]
for i in z:
s.append(i)
lis=[-1 for i in range(k)]
f1=0
for i in range(n):
if s[i]=="?":pass
elif s[i]=="0":
v1=i%k
if lis[v1]==-1 or lis[v1]=="0":lis[v1]="0"
else:
f1=1
break
elif s[i]=="1":
v1=i%k
if lis[v1]==-1 or lis[v1]=="1":lis[v1]="1"
else:
f1=1
break
if f1==1:
print("NO")
else:
for i in range(n):
v1=i%k
if lis[v1]!=-1:s[i]=lis[v1]
v2=k//2
ze,on=0,0
for i in range(k):
if s[i]=="0":
ze+=1
elif s[i]=="1":
on+=1
for i in range(0,n-k,1):
if ze>v2 or on>v2:
f1=1
break
else:
if s[i]=="0"and ze>0:ze-=1
elif s[i]=="1" and on>0:on-=1
if s[i+k]=="0":ze+=1
elif s[i+k]=="1":on+=1
if f1==1 or on>v2 or ze>v2:
print("NO")
else:
print("YES")
| 9 | PYTHON3 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<(a-c)*(b-d);
return 0;}
| 0 | CPP |
Subsets and Splits