solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int a,b; scanf("%d%d",&a,&b);
for(int i=1; i<=max(a,b); i++) printf("%d",min(a,b));
return 0;
} | 0 | CPP |
def solve(x, y, z):
a, b, c = 0, 0, 0
if x == y:
a = x
if z <= a:
b = z
c = 1
elif y == z:
c = y
if x <= c:
a = x
b = 1
elif x == z:
b = x
if y <= b:
c = y
a = 1
if a == 0 or b == 0 or c == 0:
print('NO')
else:
print('YES')
print(a, b, c)
t = int(input())
for i in range(t):
x, y, z = [int(j) for j in input().split()]
solve(x, y, z)
| 7 | PYTHON3 |
inp = input().strip()
hpos = inp.find('h')
if hpos!=-1:
epos = inp.find('e', hpos+1)
if epos!=-1:
l1pos = inp.find('l', epos+1)
if l1pos!=-1:
l2pos = inp.find('l', l1pos+1)
if l2pos!=-1:
opos = inp.find('o', l2pos+1)
if opos!=-1: print("YES")
else: print("NO")
else: print("NO")
else: print("NO")
else: print("NO")
else: print("NO") | 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort()
mid = (n-1)//2
i,j=mid,mid+1
ans=[]
while i>=0 and j<n:
ans.append(a[i])
ans.append(a[j])
i-=1
j+=1
while i>=0:
ans.append(a[i])
i-=1
while j<n:
ans.append(a[j])
j+=1
print(*ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int setb(int n, int pos) { return n = n | (1 << pos); }
int resb(int n, int pos) { return n = n & ~(1 << pos); }
bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); }
long long n, k;
char f0[] =
"What are you doing at the end of the world? Are you busy? Will you save "
"us?";
char f1[] =
"What are you doing while sending +f1+? Are you busy? Will you send +f1+?";
char a[] = "What are you doing while sending +";
char b[] = "+? Are you busy? Will you send +";
char c[] = "+?";
long long ara[200005];
long long aa, bb, cc;
void prework() {
ara[0] = strlen(f0);
aa = strlen(a);
bb = strlen(b);
cc = strlen(c);
long long i;
for (i = 1; i <= 200000; i++) {
long long ret = (long long)1e18;
ara[i] = min(ret, aa + ara[i - 1] + bb + ara[i - 1] + cc);
}
}
char F(long long cur, long long baki) {
if (ara[cur] < baki) return '.';
if (cur == 0) return f0[baki - 1];
if (baki <= aa) return a[baki - 1];
if (baki <= aa + ara[cur - 1]) return F(cur - 1, baki - aa);
if (baki <= aa + ara[cur - 1] + bb) return b[baki - aa - ara[cur - 1] - 1];
if (baki <= aa + ara[cur - 1] + bb + ara[cur - 1])
return F(cur - 1, baki - aa - ara[cur - 1] - bb);
if (baki <= aa + ara[cur - 1] + bb + ara[cur - 1] + cc)
return c[baki - aa - ara[cur - 1] - bb - ara[cur - 1] - 1];
}
int main() {
long long t, T;
prework();
scanf("%lld", &T);
for (t = 1; t <= T; t++) {
scanf("%lld %lld", &n, &k);
char c = F(n, k);
if (c == '+') c = '\"';
printf("%c", c);
}
printf("\n");
return 0;
}
| 9 | CPP |
#include<iostream>
int main(){int X,t;std::cin>>X>>t;printf("%d",std::max(X-t,0));} | 0 | CPP |
n,m=map(int,input().split())
k=0
for i in range(n):
a=[int(i) for i in input().split()]
for i in range(0,2*m,2):
if(a[i]==1 or a[i+1]==1):
k+=1
print(k) | 7 | PYTHON3 |
R = lambda: map(int, input().split())
n = int(input())
s = input()
L = []
for i in range(n):
L.append(list(R()))
f = [0]*5001
for i in range(n):
c = int(s[i])
for j in range(L[i][1]):
f[j] += c
c ^= 1
for j in range(L[i][1],5001,L[i][0]):
for k in range(j,min(5001,j+L[i][0])):
f[k] += c
c ^= 1
#print(f)
#print(f)
print(max(f)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, f, t, temp;
long long int val = -99999999999;
cin >> n >> k;
while (n--) {
cin >> f >> t;
if (k >= t) {
if (val < f) val = f;
} else {
temp = f - t + k;
if (val < temp) val = temp;
}
}
cout << val << endl;
return 0;
}
| 7 | CPP |
a = list(map(int, input().split()))
moves = input()
s = 0
for ch in moves:
s += a[int(ch) - 1]
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b, k;
cin >> n >> a >> b >> k;
string s;
cin >> s;
vector<pair<int, int>> c;
int cur = 0;
int poss = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cur++;
else {
if (cur >= b) {
c.push_back({cur / b, i + 1});
poss += cur / b;
}
cur = 0;
}
}
if (cur >= b) {
c.push_back({cur / b, n + 1});
poss += cur / b;
cur = 0;
}
cout << poss - a + 1 << '\n';
for (int i = 0; i < c.size(); i++) {
for (int j = 1; j <= c[i].first; j++) {
if (poss < a) break;
cout << c[i].second - j * b << ' ';
poss--;
}
if (poss < a) break;
}
cout << '\n';
return 0;
}
| 8 | CPP |
citizens = int(input())
welfare = list(map(int, input().split()))
spending = 0
maximum = max(welfare)
length = len(welfare)
for i in range(length):
if welfare[i] < maximum:
spending += maximum - welfare[i]
print(spending) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char a[2020][2020];
int vis[2020];
int lamp[2020];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> a[i][j];
}
for (int j = 0; j < m; j++) {
int cnt = 0;
int I;
for (int i = 0; i < n; i++) {
if (a[i][j] == '1') {
cnt++;
I = i;
}
}
if (cnt == 1) vis[I] = 1;
}
for (int i = 0; i < n; i++) {
if (vis[i] == 0) {
memset(lamp, 0, sizeof(lamp));
for (int x = 0; x < n; x++) {
if (x != i) {
for (int y = 0; y < m; y++) {
if (a[x][y] == '1') {
lamp[y] = 1;
}
}
}
}
int p = 0;
for (int j = 0; j < m; j++) {
if (lamp[j] == 1) p++;
}
if (p == m) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 * 1000 + 10, INF = 1e8;
int n, m;
int dis[5][MAXN][MAXN];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
char a[MAXN][MAXN];
bool is_true(int x, int y) { return (x >= 0 && y >= 0 && x < n && y < m); }
void bfs(int c) {
queue<int> q;
for (int i = 0; i < (n); i++)
for (int j = 0; j < (m); j++) {
if (a[i][j] == (char)('0' + c)) {
dis[c][i][j] = 0;
q.push(i);
q.push(j);
} else
dis[c][i][j] = INF;
}
while (!q.empty()) {
int x = q.front();
q.pop();
int y = q.front();
q.pop();
for (int i = 0; i < 4; i++) {
int cx = x + dx[i], cy = y + dy[i], w = 1;
if (is_true(cx, cy) && isalnum(a[x][y]) && a[x][y] == a[cx][cy]) w = 0;
if (is_true(cx, cy) && a[cx][cy] != '#' &&
dis[c][cx][cy] > dis[c][x][y] + w) {
dis[c][cx][cy] = dis[c][x][y] + w;
q.push(cx);
q.push(cy);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 1; i < 4; i++) bfs(i);
int ans = INF;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
ans = min(ans, dis[1][i][j] + dis[2][i][j] + dis[3][i][j] - 2);
cout << (ans > ((MAXN) * (MAXN)) ? -1 : ans) << endl;
return 0;
}
| 9 | CPP |
import sys
import math
import bisect
from sys import stdin,stdout
from math import gcd,floor,sqrt,log
from collections import defaultdict as dd
from bisect import bisect_left as bl,bisect_right as br
sys.setrecursionlimit(100000000)
ii =lambda: int(input())
si =lambda: input()
jn =lambda x,l: x.join(map(str,l))
sl =lambda: list(map(str,input().strip()))
mi =lambda: map(int,input().split())
mif =lambda: map(float,input().split())
lii =lambda: list(map(int,input().split()))
ceil =lambda x: int(x) if(x==int(x)) else int(x)+1
ceildiv=lambda x,d: x//d if(x%d==0) else x//d+1
flush =lambda: stdout.flush()
stdstr =lambda: stdin.readline()
stdint =lambda: int(stdin.readline())
stdpr =lambda x: stdout.write(str(x))
mod=1000000007
#main code
n=ii()
for _ in range(n):
a,b=mi()
if a%b==0:
print(0)
else:
print(b-(a%b))
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
int dfn[MAXN], n, m, tot, head[MAXN << 1];
int cnt[MAXN], ans[MAXN], dfstime, rk[MAXN];
int bl[MAXN], S, sum[MAXN], c[MAXN], siz[MAXN];
pair<int, int> Rem[MAXN];
struct edge {
int nxt, to;
} e[MAXN << 1];
inline void add(int x, int y) {
e[++tot].to = y;
e[tot].nxt = head[x];
head[x] = tot;
}
void dfs(int x, int pre) {
rk[dfn[x] = ++dfstime] = x;
Rem[x].first = dfstime;
siz[x] = 1;
for (int i = head[x]; i; i = e[i].nxt) {
int j = e[i].to;
if (pre == j) continue;
dfs(j, x);
siz[x] += siz[j];
}
Rem[x].second = dfstime;
}
struct Q {
int l, r, k, id;
bool operator<(const Q& B) const {
if (bl[l] == bl[B.l]) return r < B.r;
return bl[l] < bl[B.l];
}
} q[MAXN];
inline void inr(int x) { ++cnt[c[rk[x]]], ++sum[cnt[c[rk[x]]]]; }
inline void del(int x) { --sum[cnt[c[rk[x]]]], --cnt[c[rk[x]]]; }
int main() {
scanf("%d%d", &n, &m);
S = sqrt(n);
for (int i = 1; i <= n; ++i) scanf("%d", &c[i]), bl[i] = (i - 1) / S + 1;
for (int i = 1; i < n; ++i) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
dfs(1, 0);
for (int i = 1, v; i <= m; ++i) {
scanf("%d%d", &v, &q[i].k);
q[i].id = i;
q[i].l = dfn[v];
q[i].r = dfn[v] + siz[v] - 1;
}
sort(q + 1, q + m + 1);
int l = 1, r = 0;
for (int i = 1; i <= m; ++i) {
int ql = q[i].l, qr = q[i].r;
while (l < ql) del(l++);
while (l > ql) inr(--l);
while (r < qr) inr(++r);
while (r > qr) del(r--);
ans[q[i].id] = sum[q[i].k];
}
for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,k;
cin>>a>>b>>k;
if(k>=a+b)
cout<<0<<" "<<0;
else if(k>=a&&k<a+b)
cout<<0<<" "<<a+b-k;
else
cout<<a-k<<" "<<b;
}
| 0 | CPP |
def solvea():
n = int(input())
d = int(input())
e = 5 * int(input())
best = 0
for enr in range(n // e + 1):
curr = e * enr
curr += d * ((n - curr) // d)
if curr <= n and curr > best:
best = curr
print(n - best)
def solveb():
a = int(input())
b = int(input())
n = int(input())
ans = 0
for i in range(a + 1):
for j in range(b + 1):
if i + j == n:
ans += 1
print(ans)
def solvec():
n = int(input())
curr_bal = 0
min_bal = 0
for e in input():
if e == '(':
curr_bal += 1
else:
curr_bal -= 1
if curr_bal < min_bal:
min_bal = curr_bal
if min_bal >= -1 and curr_bal == 0:
print('Yes')
else:
print('No')
def solved():
n, m = (int(x) for x in input().split())
field = [input() for _ in range(n)]
cell___is_possible = [[0 for j in range(m)] for i in range(n)]
cell___is_possible[-1][-1] = True
for j in reversed(range(m - 1)):
cell___is_possible[-1][j] = cell___is_possible[-1][j + 1] and (field[-1][j] == '.')
for i in reversed(range(n - 1)):
cell___is_possible[i][-1] = cell___is_possible[i + 1][-1] and (field[i][-1] == '.')
for i in reversed(range(n - 1)):
for j in reversed(range(m - 1)):
cell___is_possible[i][j] = (field[i][j] == '.') and \
(cell___is_possible[i + 1][j] or cell___is_possible[i][j + 1])
cell___is_reachable = [[0 for j in range(m)] for i in range(n)]
cell___is_reachable[0][0] = True
for j in range(1, m):
cell___is_reachable[0][j] = cell___is_reachable[0][j - 1] and (field[0][j] == '.')
for i in range(1, n):
cell___is_reachable[i][0] = cell___is_reachable[i - 1][0] and (field[i][0] == '.')
for i in range(1, n):
for j in range(1, m):
cell___is_reachable[i][j] = (field[i][j] == '.') and \
(cell___is_reachable[i - 1][j] or cell___is_reachable[i][j - 1])
dist___possibles_nr = [0] * (n + m - 1)
for i in range(n):
for j in range(m):
dist___possibles_nr[i + j] += cell___is_possible[i][j] and cell___is_reachable[i][j]
ans = min(dist___possibles_nr[1:-1])
print(ans)
def solvee():
n = int(input())
dists = sorted([(int(x), 2 * i + 2) for i, x in enumerate(input().split())], reverse=True, key=lambda x: x[0])
idx___node_id = [dists[i][1] for i in range(n)]
edges = []
for i in range(len(dists) - 1):
edges.append((dists[i][1], dists[i + 1][1]))
for sorted_idx, (dist, even_id) in enumerate(dists):
odd_id = even_id - 1
assert (len(idx___node_id) - sorted_idx >= dist)
if len(idx___node_id) - sorted_idx == dist:
edges.append((idx___node_id[-1], odd_id))
idx___node_id.append(odd_id)
elif sorted_idx + dist < len(idx___node_id):
edges.append((idx___node_id[sorted_idx + dist - 1], odd_id))
for edge in edges:
print(*edge)
if __name__ == '__main__':
solvee()
| 11 | PYTHON3 |
dp = [0 for i in range(500001)]
idx = 1
for i in range(3, 500001, 2):
dp[i] = dp[i - 2] + idx * 8 * idx
idx += 1
t = int(input())
for i in range(t):
n = int(input())
print(dp[n])
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> v[10000000];
stack<long long> st;
int main() {
int t;
cin >> t;
for (long long i = 1; i <= t; i++) {
cin >> v[i].first;
v[i].second = i;
}
sort(v + 1, v + t + 1);
string s;
cin >> s;
int pos = 1;
for (long long i = 0; i < 2 * t; i++) {
if (s[i] == '0') {
cout << v[pos].second << " ";
st.push(v[pos].second);
pos++;
} else {
cout << st.top() << " ";
st.pop();
}
}
return 0;
}
| 8 | CPP |
n=int(input())
for i in range(n):
c,d=map(int,input().split())
a,b=map(int,input().split())
count=0
if(c==0 and d==0):
print(0)
elif((c>=0 and d>=0) or (d<0 and c<0)):
c,d=abs(c),abs(d)
x=min(c,d)
y=max(c,d)
if(b<2*a):
diff=y-x
count=count+a*diff
diff1=x
count=count+b*diff1
print(count)
else:
count=count+a*x
count=count+a*y
print(count)
elif((c<=0 and d>=0) or (d<=0 and c>=0 )):
x=min(c,d)
y=max(c,d)
diff=abs(x)
count=count+a*diff
count=count+a*y
print(count)
| 7 | PYTHON3 |
n = int(input())
a = [int(v) for v in input().split()]
ans = 0
for i in range(n-2):
if a[i] and not a[i+1] and a[i+2]:
ans += 1
if a[i+2]:
a[i+2] = False
else:
a[i] = False
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fast_IO_file() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast_IO_file();
long long int n, q;
cin >> n >> q;
long long int a[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
long long int pre[n];
pre[0] = a[0];
for (long long int i = 1; i < n; i++) {
pre[i] = a[i] + pre[i - 1];
}
vector<long long int> v(pre, pre + n);
long long int d = 0;
long long int x[q];
for (long long int i = 0; i < q; i++) {
cin >> x[i];
}
for (long long int i = 0; i < q; i++) {
d = d + x[i];
long long int upper = upper_bound(v.begin(), v.end(), d) - v.begin();
if (upper == 0) {
cout << n << endl;
continue;
} else if (upper == n) {
cout << n << endl;
d = 0;
} else {
cout << n - upper << endl;
}
}
return 0;
}
| 9 | CPP |
#!/usr/bin/env python3
k = int(input())
n = list(input())
n.sort()
sum=0
for i in n:
sum+=int(i)
m=0
if k>sum:
j=0
while sum<k:
sum+=9-int(n[j])
j+=1
m+=1
print(m)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, pre = 0;
struct Yukari {
int tot;
string ans[210];
} an;
string ch, pr;
map<string, Yukari> mmp;
map<string, Yukari>::iterator it;
int main() {
int T;
scanf("%d", &T);
while (T--) {
cin >> ch;
if (!mmp.count(ch)) {
pre++;
mmp[ch].tot = 0;
}
scanf("%d", &n);
int che = 0;
for (int i = 1; i <= n; i++) {
cin >> pr;
che = 0;
a = pr.length();
for (int j = 1; j <= mmp[ch].tot; j++)
if (!che) {
b = mmp[ch].ans[j].length();
if (a > b) {
int check = 0;
for (int k = 0; k < b; k++) {
if (pr[a - b + k] != mmp[ch].ans[j][k]) {
check = 1;
break;
}
}
if (!check) {
mmp[ch].ans[j] = pr;
che = 1;
}
} else {
int check = 0;
for (int k = 0; k < a; k++) {
if (pr[k] != mmp[ch].ans[j][b - a + k]) {
check = 1;
break;
}
}
if (!check) {
che = 1;
break;
}
}
}
if (!che) mmp[ch].ans[++mmp[ch].tot] = pr;
}
}
printf("%d\n", pre);
for (it = mmp.begin(); it != mmp.end(); it++) {
an = it->second;
cout << it->first;
printf(" %d ", an.tot);
for (int i = 1; i <= an.tot; i++) cout << an.ans[i] << " ";
puts("");
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int min(int a, int b) { return a > b ? b : a; }
inline int max(int a, int b) { return a > b ? a : b; }
inline int abs(int a) { return a >= 0 ? a : -a; }
int maxArr(vector<int>& a) {
if (a.size() == 0) return -1;
int ind = 0;
for (long long i = 0; i < a.size(); i++) {
if (a[i] > a[ind]) {
ind = i;
}
}
return a[ind];
}
int minArr(vector<int>& a) {
if (a.size() == 0) return -1;
int ind = 0;
for (long long i = 0; i < a.size(); i++) {
if (a[i] < a[ind]) {
ind = i;
}
}
return a[ind];
}
long long sumArr(vector<int>& a) {
long long sum = 0;
for (long long i = 0; i < a.size(); i++) {
sum += a[i];
}
return sum;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> a = vector<int>();
if (k > n) {
cout << "NO\n";
return 0;
}
while (n != 0) {
a.push_back(n % 2);
n /= 2;
}
if (k < sumArr(a)) {
cout << "NO\n";
return 0;
}
int s = sumArr(a);
for (int i = a.size() - 1; i >= 1; i--) {
if (s == k) break;
if (s + a[i] > k) {
a[i - 1] += 2 * (k - s);
a[i] -= (k - s);
s = k;
} else {
s += a[i];
a[i - 1] += a[i] * 2;
a[i] = 0;
}
}
cout << "YES" << endl;
for (long long i = 0; i < a.size(); i++) {
for (long long j = 0; j < a[i]; j++) {
cout << (1 << i) << " ";
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
long long int t, n, m, j, ans, k, a, b, c, d, e, f, sum, i, sz, row, col;
string s, s2, s3, s4;
vector<int> v;
vector<int> graph[(int)(1e6 + 10)];
int ar[(int)(1e6 + 10)], ar2[(int)(1e6 + 10)];
int level[(int)(1e6 + 10)];
void brainfuck();
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
brainfuck();
return 0;
}
void brainfuck() {
cin >> n;
m = (n * (n + 1)) / 2;
a = m;
if (m & 1)
m = m / 2 + 1;
else
m /= 2;
v.push_back(n);
m -= n;
n--;
while (m > 0) {
if (m - n >= 0) {
m -= n;
v.push_back(n);
n--;
} else
n--;
}
for (i = 0; i < v.size(); i++) {
ans += v[i];
}
a -= ans;
cout << abs(a - ans) << "\n";
cout << v.size();
for (i = 0; i < v.size(); i++) cout << " " << v[i];
}
| 9 | CPP |
gestures = {
'rock': 1,
'scissors': 2,
'paper': 3
}
rules = {
(1, 1): 0,
(1, 2): 1,
(1, 3): 0,
(2, 1): 0,
(2, 2): 0,
(2, 3): 1,
(3, 1): 1,
(3, 2): 0,
(3, 3): 0
}
def get_input():
f = input()
m = input()
s = input()
return {
'F': gestures[f],
'M': gestures[m],
'S': gestures[s]
}
def play(gestures: dict) -> str:
result = dict()
for k in gestures:
result[k] = 0
for i in gestures:
for j in gestures:
pair = (gestures[i], gestures[j])
result[i] += rules[pair]
for k in result:
if result[k] == 2:
return k
return '?'
if __name__ == "__main__":
gstrs = get_input()
r = play(gstrs)
print(r) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
m = int(input())
books = [int(i) for i in input().split()]
ans=0
kol=0
s=books.index(1)
for i in range(s+1,m):
if books[i]==1:
ans+=kol
kol=0
elif books[i]==0:
kol+=1
print(ans)
| 8 | PYTHON3 |
straights = ["A","E","F","H","I","K","L","M","N","T","V","W","X","Y","Z"]
circs = ["B","C","D","G","J","O","P","Q","R","S","U"]
def isAcuurate(n):
k = n[0] in straights
for el in n:
if(k and el in circs):
return "NO"
elif(not k and el in straights):
return "NO"
return "YES"
n = str(input())
print(isAcuurate(n))
| 12 | PYTHON3 |
def f(x,y):
if(y==0):
return 1
r=f(x,y//2)
r*=r
if(y%2):
r*=x
return r
def main():
s=input()
s=s.split()
n=int(s[0])
nn=n
m=int(s[1])
ans=0
arr = []
while(n):
o=0
z=0
s=input()
arr.append(s)
s=s.split()
for i in s:
if(i=='1'):
o+=1
else:
z+=1
ans+=(f(2,o)-1)
ans+=(f(2,z)-1)
n-=1
ccc=0
nnn=nn
while (m):
o = 0
z = 0
cc = 0
nn=nnn
while (nn):
s = arr[cc][ccc]
if (s == '1'):
o += 1
else:
z += 1
nn -= 1
cc += 1
if(o>0):
ans += (f(2, o) - 1)
ans-=o
if(z>0):
ans += (f(2, z) - 1)
ans-=z
m -= 1
ccc += 2
print(ans)
if __name__ == '__main__':main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> h[13000010];
long long l1[110], r1[110], l2[110], r2[110], n, m, tt;
inline long long rd() {
long long x = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
;
for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return x;
}
inline void modify(long long l, long long len, long long flag) {
h[++tt] = pair<long long, long long>(l, flag);
h[++tt] = pair<long long, long long>(l + len, -flag);
}
inline void gao(long long n, long long m, long long flag) {
n++;
m++;
long long now = 0;
for (int i = 60; ~i; i--) {
long long h1 = (n & ((1LL << i) - 1)), h2 = (m & ((1LL << i) - 1));
if ((n >> i) & 1) modify(now ^ (m & (1LL << i)), 1LL << i, flag * h2);
if ((m >> i) & 1) modify(now ^ (n & (1LL << i)), 1LL << i, flag * h1);
if ((n >> i) & (m >> i) & 1) modify(now, 1LL << i, flag << i);
now ^= (n & (1LL << i)) ^ (m & (1LL << i));
}
}
inline long long calc(long long l, long long r) {
long long h1 = l + r, h2 = r - l + 1;
if (h1 & 1) return h1 % 998244353LL * ((h2 >> 1) % 998244353LL) % 998244353LL;
return (h1 >> 1) % 998244353LL * (h2 % 998244353LL) % 998244353LL;
}
int main() {
srand(time(NULL));
n = rd();
for (int i = 1; i <= n; i++) l1[i] = rd(), r1[i] = rd();
m = rd();
for (int i = 1; i <= m; i++) l2[i] = rd(), r2[i] = rd();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
gao(r1[i], r2[j], 1);
gao(r1[i], l2[j] - 1, -1);
gao(l1[i] - 1, r2[j], -1);
gao(l1[i] - 1, l2[j] - 1, 1);
}
sort(h + 1, h + tt + 1);
long long now = 0, ans = 0;
long long mod1 = (long long)rand() + 1000000000;
for (int i = 1; i < tt; i++) {
now = (now + h[i].second) % mod1;
if (now) ans += calc(h[i].first, h[i + 1].first - 1);
}
printf("%lld\n", ans % 998244353LL);
return 0;
}
| 12 | CPP |
def get_str(str) :
low_count = 0
up_count = 0
for ch in str :
if (ch.islower()) :
low_count += 1
if (ch.isupper()) :
up_count += 1
if low_count >= up_count :
str = str.lower()
elif up_count > low_count :
str = str.upper()
return str
str = input()
print(get_str(str))
| 7 | PYTHON3 |
A,B,C,D = map(int,input().split())
L = A + B
R = C + D
print('Left' if L > R else 'Balanced' if L ==R else 'Right')
| 0 | PYTHON3 |
t=int(input())
for _ in range(t):
s=input()
n=len(s)
left=0
right=n-1
while(left<right):
if s[left]==s[right]:
left+=1
right-=1
else:
break
s1=s[left:right+1]
max_len=0
ans=''
for i in range(len(s1)):
c=s1[i:]
if c==c[::-1] and len(c)>max_len:
ans=c
max_len=len(c)
for i in range(len(s1),-1,-1):
c=s1[:i]
if c==c[::-1] and len(c)>max_len:
ans=c
max_len=len(c)
print(s[:left]+ans+s[right+1:])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353, N = 200010;
long long cnt[N];
long long F[N];
int n;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
cin >> n;
F[0] = 1;
for (int i = 1; i <= n; ++i) F[i] = F[i - 1] * i % mod;
for (int i = 0; i < 2 * (n - 1); ++i) {
int u;
cin >> u;
++cnt[--u];
}
long long res = n;
for (int i = 0; i < n; ++i) res = res * F[cnt[i]] % mod;
cout << res << endl;
}
| 8 | CPP |
#include<iostream>
using namespace std;
#include<cstdio>
#include<complex>
typedef double type_n;
typedef complex<type_n> point;
int main()
{
point a, b, c, z, h;
int i, q;
type_n a1, a2, b1, b2, z1, z2;
scanf("%lf %lf %lf %lf", &a1, &a2, &b1, &b2);
a.real(a1), a.imag(a2), b.real(b1), b.imag(b2);
c = b - a;
scanf("%d", &q);
for(i = 0; i < q; i++){
scanf("%lf %lf", &z1, &z2);
z.real(z1), z.imag(z2);
h = a + c * (((z - a) / c).real());
printf("%.12f %.12f\n", h.real(), h.imag());
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
int main(void) {
long long int n, i, j, maxGlobal, temp;
scanf("%lld", &n);
long long int m[n], max[n];
long long int ans;
for (i = 0; i < n; i++) {
scanf("%lld", &m[i]);
for (j = 0, max[i] = 0; j < m[i]; j++) {
scanf("%lld", &temp);
if (temp > max[i]) max[i] = temp;
}
}
for (i = 0, maxGlobal = 0; i < n; i++) {
if (maxGlobal < max[i]) {
maxGlobal = max[i];
}
}
for (i = 0, ans = 0; i < n; i++) {
ans += (maxGlobal - max[i]) * m[i];
}
printf("%lld\n", ans);
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n;i++)
#define fr(i,k,n) for(int i=k;i>=n;i--)
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define dbg(x) cout << (#x) << " is " << (x) << '\n'
#define F first
#define S second
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mems(x) memset(x,0,sizeof(x))
#define all(a) a.begin(),a.end()
/*---------------------------------------------------------------------------------------------------*/
void solve()
{
int m, n, k;
cin >> n >> k;
int a[n];
int r = 0;
int pref[n];
int j = n - 1;
int mn = LLONG_MAX;
f (i, n)
{
cin >> a[i];
r += a[i];
pref[i] = r;
int ai = a[i];
int iter = 0;
while(ai%k == 0)
{
iter+=1;
ai = ai/k;
}
if(mn > iter)
{
j = i;
mn = iter;
}
}
cout << (mn + 1) * pref[n - 1] + ((j > 0) ? pref[j - 1] : 0) << endl;
// int L = -1;
// f (i, j + ((j == n - 1) ? 1 : 2))
// {
// int curr = 0;
// int ai = a[i];
// while ((ai % k == 0))
// {
// ai = ai / k;
// curr++;
// }
// if (mn > curr)
// {
// mn = curr;
// L = i;
// }
// }
// dbg (mn);
// // dbg(L);
}
signed main()
{
FAST
int T = 1;
cin >> T;
while (T--) solve();
return 0;
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,m; cin>>n>>m;
vector<int>a(n);
double sum{};
for(int i=0; i<n; i++) {
cin>>a.at(i);
sum+=a.at(i);
}
sort(a.rbegin(),a.rend());
if(a.at(m-1)>=sum/4/m) cout <<"Yes"<<endl;
else cout << "No" <<endl;
} | 0 | CPP |
for _ in range(int(input())):
a,m = map(int,input().split())
print(a*(len(str(m))-1+(len(str(m))==str(m).count('9')))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxx = 4e5 + 20, mxsg = 4 * maxx + 10, inf = 1e12 + 8,
mxlg = 20;
long long n, q, a[maxx], b[maxx], st1[mxsg], st2[mxsg];
long long mn1[maxx][mxlg], mx1[maxx][mxlg], mn2[maxx][mxlg], mx2[maxx][mxlg],
t[maxx];
long long ans1(long long x, long long y) {
y = min(y, n);
y--;
long long fas = y - x + 1;
return max(mx1[x][t[fas]], mx2[y][t[fas]]);
}
long long ans2(long long x, long long y) {
y = min(y, n);
y--;
long long fas = y - x + 1;
return min(mn1[x][t[fas]], mn2[y][t[fas]]);
}
void f() {
long long g = 0;
for (long long i = 1; i <= n; i++) {
if ((1 << (g + 1)) == (i)) g++;
t[i] = g;
}
}
void sar() {
for (long long i = 0; i < mxlg; i++) {
for (long long j = 0; j < n; j++) {
if (!i) {
mn1[j][0] = b[j];
mx1[j][0] = a[j];
continue;
}
long long g = (1 << (i - 1)) + j;
if (g + (1 << (i - 1)) <= n)
mn1[j][i] = min(mn1[j][i - 1], mn1[g][i - 1]),
mx1[j][i] = max(mx1[j][i - 1], mx1[g][i - 1]);
}
}
}
void tah() {
for (long long i = 0; i < mxlg; i++) {
for (long long j = 0; j < n; j++) {
if (!i) {
mn2[j][0] = b[j];
mx2[j][0] = a[j];
continue;
}
long long g = j - (1 << (i - 1));
if (g - (1 << (i - 1)) >= -1)
mn2[j][i] = min(mn2[j][i - 1], mn2[g][i - 1]),
mx2[j][i] = max(mx2[j][i - 1], mx2[g][i - 1]);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < n; i++) cin >> b[i];
sar();
tah();
f();
long long tt = 0;
for (long long i = 0; i < n; i++) {
long long l = i - 1, r = n, m1, m2;
while (l + 1 != r) {
long long mid = (l + r) / 2, x1 = ans1(i, mid + 1), x2 = ans2(i, mid + 1);
if ((x1 - x2) < 0)
l = mid;
else
r = mid;
}
m1 = r;
l = i - 1, r = n;
while (l + 1 != r) {
long long mid = (l + r) / 2, x1 = ans1(i, mid + 1), x2 = ans2(i, mid + 1);
if ((x1 - x2) <= 0)
l = mid;
else
r = mid;
}
m2 = r;
tt += (m2 - m1);
}
cout << tt << endl;
return 0;
}
| 10 | CPP |
w, h=[int(i) for i in input().split()]
u1, d1=[int(i) for i in input().split()]
u2, d2=[int(i) for i in input().split()]
for i in range(h, 0, -1):
w+=i
if i==d1:
w-=u1
if w<0:
w=0
elif i==d2:
w-=u2
if w<0:
w=0
print(w) | 7 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def main():
n,k = LI()
t = n - k
r = list(range(1,t)) + list(range(n,t-1,-1))
return JA(r, ' ')
print(main())
| 7 | PYTHON3 |
#l,r = map(int, input().strip().split(' '))
#lst = list(map(int, input().strip().split(' ')))
s=input()
s=list(s)
n=len(s)
i=n-1
p=[]
m='a'
while(i>=0):
if s[i]>=m:
p.append(s[i])
m=s[i]
i-=1
j=len(p)-1
while(j>=0):
print(p[j],end="")
j-=1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n; cin >> n;
vector<int> x(n), y(n);
REP(i, n) cin >> x[i] >> y[i];
int maxi = 0;
map<pair<int, int>, int> cnt;
REP(i, n) REP(j, n) {
if (i == j) continue ;
int dx = x[i] - x[j];
int dy = y[i] - y[j];
maxi = max(maxi, ++cnt[make_pair(dx, dy)]);
}
cout << n - maxi << '\n';
return 0;
} | 0 | CPP |
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
b = []
for i in range(n):
st = set()
for j in range(a[i][0], a[i][1] + 1):
st.add(j)
b.append(st)
# print(b)
was = [0] * n
for i in range(1, n + 1):
minl = 1e9
ind = 0
for j in range(len(b)):
if i in b[j] and len(b[j]) <= minl and not was[j]:
minl = len(b[j])
ind = j
print(*a[ind], i)
was[ind] = 1
for j in range(len(b)):
if i in b[j]:
b[j].remove(i)
print()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
const double eps = 1e-8;
const int N = 111111;
const int mod = 1000000;
const double pi = acos(-1.0);
const long long INF = 0x7f7f7f7f;
const double inf = 1e50;
template <class T>
inline T minx(T a, T b) {
return (a == -1 || b < a) ? b : a;
}
template <class T>
inline T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <class T>
inline T lcm(T a, T b) {
return a * (b / gcd(a, b));
}
template <class T>
inline T getbit(T n) {
return n ? (1 + getbit(n & (n - 1))) : 0;
}
template <class T>
inline T lowbit(T n) {
return n & (-n);
}
using namespace std;
double Y1, Y2, Yw, Xb, Xw, r, Yb;
double cal(double y) {
double t1, t2;
t1 = Yw - y;
t2 = Yw - Yb;
return t1 * Xb / (t1 + t2);
}
int main() {
scanf("%lf%lf%lf%lf%lf%lf", &Y1, &Y2, &Yw, &Xb, &Yb, &r);
Yw -= r;
double t = cal(Y1 + r);
double s = (Xb - t) / (Yw - Yb);
double sinA = s / sqrt(s * s + 1);
double d = (Y2 - Y1 - r) * sinA;
if (d <= r) {
puts("-1");
} else {
printf("%.10f\n", t);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, x = 1, y = 1;
cin >> n;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
x = i;
break;
}
}
for (int i = n; i >= 1; i--) {
if (a[i] < a[i - 1]) {
y = i;
break;
}
}
reverse(a + x, a + y + 1);
int flag = 0;
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
flag = 1;
break;
}
}
if (flag)
cout << "no" << endl;
else {
cout << "yes" << endl << x << " " << y << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct data {
long long F, S, T;
};
data a[4010];
int n;
bool f[4010];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i].F >> a[i].S >> a[i].T;
memset(f, 1, sizeof(f));
for (int i = 1; i <= n; i++)
if (f[i]) {
long long u = a[i].F;
long long v = 0;
for (int j = i + 1; j <= n; j++)
if (f[j]) {
a[j].T -= (u + v);
if (a[j].T < 0) {
v += a[j].S;
f[j] = 0;
}
if (u > 0) u--;
}
}
int t = 0;
for (int i = 1; i <= n; i++)
if (f[i]) t++;
cout << t << endl;
for (int i = 1; i <= n; i++)
if (f[i]) cout << i << " ";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 102;
int a[N][N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int x1, y1, x2, y2;
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
for (int j = x1; j <= x2; ++j) {
for (int k = y1; k <= y2; ++k) {
++a[j][k];
}
}
}
int sum = 0;
for (int i = 1; i <= 100; ++i) {
for (int j = 1; j <= 100; ++j) {
sum += a[i][j];
}
}
printf("%d", sum);
}
| 7 | CPP |
tests = int(input())
for i in range(tests):
numbers = input().split(" ")
n = int(numbers[0])
k = int(numbers[1])
text_a = input().split(" ")
text_b = input().split(" ")
a = []
b = []
for j in range(n):
a.append(int(text_a[j]))
b.append(int(text_b[j]))
a.sort(reverse=True)
b.sort(reverse=True)
s = 0
swap = 0
step = 0
a_counter = 0
b_counter = 0
while step < n:
step += 1
if swap < k:
if a[a_counter] < b[b_counter]:
s += b[b_counter]
swap += 1
b_counter += 1
else:
s += a[a_counter]
a_counter += 1
else:
s += a[a_counter]
a_counter += 1
print(s)
| 8 | PYTHON3 |
#include <stdio.h>
using namespace std;
int main(void){
int W,H,x,y,r;
scanf("%d %d %d %d %d",&W,&H,&x,&y,&r);
if(x+r<=W&&x-r>=0&&y+r<=H&&y-r>=0){
printf("Yes\n");
}else {
printf("No\n");
}
}
| 0 | CPP |
n = int(input())
arr = list(map(int,input().split(" ")))
print(sum(arr)/n) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
using ull = unsigned long long;
const long N = 3e5 + 10;
ll aarray[N];
ll magic[510][510];
vector<ll> primes;
bool check[1000001];
ll vis[N];
map<ll, ll> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string str, ans;
ll i, j, n, m, k, t;
cin >> str;
k = 0;
for (char c = 'z'; c >= 'a'; c--) {
for (j = k; j < str.length(); j++) {
if (str[j] == c) {
ans += c;
k = j;
}
}
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
z=list(map(int,input().split()))
count=0
status=True
while z[0]>0 and z[1]>0 and status :
if z[0]<z[1]:
if z[1]-2>0 :
while z[1]-2>0 :
z[0]+=1
z[1]-=2
count+=1
else:
status=False
else :
if z[0]-2>0 :
while z[0]-2>0:
z[1]+=1
z[0]-=2
count+=1
else :
status=False
##print(z[0],z[1])
if (z[0]==2 and z[1]==1) :
print(count+1)
elif (z[0]==2 and z[1]==2) :
print(count+1)
elif (z[0]==1 and z[1]==2) :
print(count+1)
else :
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
vector<long long int> v;
long long int elem;
for (long long int i = 0; i < n; ++i) {
cin >> elem;
v.emplace_back(elem);
}
for (long long int i = 0; i < n; ++i) {
for (long long int j = i + 1; j < n; ++j) {
auto x = find(v.begin(), v.end(), v.at(i) + v.at(j));
if (x != v.end()) {
cout << x - v.begin() + 1 << " " << i + 1 << " " << j + 1 << "\n";
return 0;
}
}
}
cout << "-1\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long type[100005], n;
long long add[100005], _size[100005], rep[100005], two[100005];
long long prune(long long a) {
long long ans = 0, L = 1, R = n;
while (L <= R) {
long long mid = (L + R) / 2;
if (_size[mid] < a)
L = mid + 1;
else
ans = mid, R = mid - 1;
}
if (type[ans] == 1) return add[ans];
if ((a - _size[ans - 1]) % two[ans] == 0) return prune(two[ans]);
return prune((a - _size[ans - 1]) % two[ans]);
}
int main() {
long long m;
cin >> n;
for (long long i = 1; i <= n; i++) {
long long a, b;
cin >> type[i];
if (type[i] == 1)
cin >> add[i], _size[i] = _size[i - 1] + 1, rep[i] = 0;
else
cin >> a >> b, _size[i] = _size[i - 1] + a * b, rep[i] = b, two[i] = a;
}
cin >> m;
for (long long i = 0; i < m; i++) {
long long a;
cin >> a;
cout << prune(a) << " ";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0;
int count[6] = {0};
for (int i = 0; i < 3; i++) {
cin >> s;
if (s == "A>B" || s == "B<A") {
++count[0];
sum = sum + 0;
} else if (s == "A<B" || s == "B>A") {
++count[1];
sum += 5;
} else if (s == "C<B" || s == "B>C") {
++count[2];
sum = sum + 14;
} else if (s == "C>B" || s == "B<C") {
++count[3];
sum = sum + 34;
} else if (s == "A>C" || s == "C<A") {
++count[4];
sum = sum + 80;
} else if (s == "C>A" || s == "A<C") {
++count[5];
sum = sum + 200;
}
}
for (int i = 0; i < 6; i++) {
if (count[i] > 1) {
cout << "Impossible";
return 0;
}
}
if (sum == 94) {
cout << "CBA";
} else if (sum == 114) {
cout << "BCA";
} else if (sum == 234) {
cout << "BAC";
} else if (sum == 239) {
cout << "ABC";
} else if (sum == 219) {
cout << "ACB";
} else if (sum == 99) {
cout << "CAB";
} else {
cout << "Impossible";
}
}
| 8 | CPP |
n,m,k=map(int,input().split(" "))
l=list()
total=0
for i in range(0,m+1):
l.append(int(input()))
for i in range(0,m):
a=l[i]^l[m]
if bin(a).count("1")<=k:
total=total+1
print(total)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 100;
const int fix = 20;
int main() {
int t = 1;
while (t--) {
string a;
cin >> a;
int n = a.size();
vector<int> dis(n);
for (long long i = 0; i < n; i++)
if (a[i] == '0') dis[i] = (i ? dis[i - 1] : 0) + 1;
vector<int> dp(n + 2), nxt(n + 2, n);
auto check = [&](int x) { return nxt[x] < n ? dp[nxt[x]] : 0; };
for (int i = n - 1; i >= 0; i--) {
dp[i] = ((dis[i] <= dis.back()) + check(0) + check(dis[i] + 1)) % mod;
nxt[dis[i]] = i;
}
int res = n;
if (nxt[0] < n) res = ((long long)check(0) * (nxt[0] + 1)) % mod;
cout << res << endl;
}
return 0;
}
| 11 | CPP |
from bisect import *
INF=10**18
n=int(input())
a=[int(input()) for i in range(n)]
dp=[INF]*(n+1)
dp[0]=-1
for i in range(n):
b=bisect_left(dp,a[i])
dp[b]=a[i]
ans=-1
for i in range(n+1):
if dp[i]==INF:
break
ans=i
print(ans)
| 0 | PYTHON3 |
#!/usr/bin/env python
# coding: utf-8
# In[10]:
a,b,n=map(int,input().split())
def gcd(x,y):
while y>0:
x,y=y,x%y
return x
i=0
temp=0
while n>temp:
n=n-temp
if i==0:
temp=gcd(a,n)
i=1
else:
temp=gcd(b,n)
i=0
if i==1:
print(0)
else:
print(1)
# In[ ]:
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1001000;
long long a[N], b[N], c[N], sum[N];
struct Node {
long long l, r, num;
};
Node tree[4 * N];
map<int, int> m1, m2;
void build(long long l, long long r, long long o) {
tree[o].l = l, tree[o].r = r;
tree[o].num = 0;
if (l == r) return;
long long mid = (l + r) >> 1;
build(l, mid, o << 1);
build(mid + 1, r, o + o + 1);
}
void update(long long t, long long o) {
if (tree[o].l == tree[o].r && tree[o].l == t) {
tree[o].num++;
return;
}
long long mid = (tree[o].l + tree[o].r) >> 1;
if (t > mid)
update(t, o + o + 1);
else
update(t, o + o);
tree[o].num = tree[o + o].num + tree[o + o + 1].num;
}
long long query(long long l, long long r, long long o) {
if (tree[o].l == l && tree[o].r == r) {
return tree[o].num;
}
long long mid = (tree[o].l + tree[o].r) >> 1;
if (r <= mid)
return query(l, r, o + o);
else if (l > mid)
return query(l, r, o + o + 1);
else
return query(l, mid, o * 2) + query(mid + 1, r, o * 2 + 1);
}
int main() {
long long n;
while (~scanf("%lld", &n)) {
for (long long i = 0; i < n; i++) scanf("%lld", &a[i]);
long long cnt = 1;
for (long long i = 0; i < n; i++) {
if (!m1[a[i]]) m1[a[i]] = cnt++;
a[i] = m1[a[i]];
}
cnt = 0;
memset(sum, 0, sizeof(sum));
for (long long i = 0; i < n; i++) {
sum[a[i]]++;
b[i] = sum[a[i]];
cnt = max(cnt, b[i]);
}
memset(sum, 0, sizeof(sum));
for (long long i = n - 1; i >= 0; i--) {
sum[a[i]]++;
c[i] = sum[a[i]];
}
build(1, cnt, 1);
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (c[i] < cnt) ans += query(c[i] + 1, cnt, 1);
update(b[i], 1);
}
printf("%lld\n", ans);
m1.clear();
m2.clear();
}
return 0;
}
| 10 | CPP |
class Joke:
def __init__(self, str1, str2, str3):
str1 = sorted(str1)
str2 = sorted(str2)
str3 = sorted(str3)
str4 = str1 + str2
str4 = sorted(str4)
if str3 == str4:
print("YES")
else:
print("NO")
if __name__ == "__main__":
str1 = input()
str2 = input()
str3 = input()
str1 = str(str1)
str2 = str(str2)
str2 = str(str2)
j = Joke(str1, str2, str3)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const ld pi = acos(0) * 2;
template <typename T>
inline void read(T &x) {
char c;
bool nega = 0;
while ((!isdigit(c = getchar())) && (c != '-'))
;
if (c == '-') {
nega = 1;
c = getchar();
}
x = c - 48;
while (isdigit(c = getchar())) x = x * 10 + c - 48;
if (nega) x = -x;
}
template <typename T>
inline void writep(T x) {
if (x > 9) writep(x / 10);
putchar(x % 10 + 48);
}
template <typename T>
inline void write(T x) {
if (x < 0) {
putchar('-');
x = -x;
}
writep(x);
}
template <typename T>
inline void writeln(T x) {
write(x);
putchar('\n');
}
template <typename CT, typename T>
inline void reset_container(CT &c, int sz, T v) {
c.resize(sz);
for (auto &x : c) x = v;
}
int n, m;
int c[1000001];
vector<int> a;
int first[501];
int last[501];
int Kafuu_Chino[2001];
int mi[2001][2001];
bool done[2001][2001];
ll f[2001][2001];
const ll base = 998244353;
ll F(int u, int v) {
if (u > v) return 1;
if (done[u][v]) return f[u][v];
done[u][v] = 1;
if (u == v) return f[u][v] = 1;
int val = mi[u][v];
ll left = 0, right = 0, mid = 1;
{
int x = first[val];
while (x != last[val]) {
mid = (mid * F(x + 1, Kafuu_Chino[x] - 1)) % base;
x = Kafuu_Chino[x];
}
}
{
int near = 0;
for (int i = (last[val]); i <= (v); i++) {
near = max(near, last[a[i]]);
if (i == near)
right = (right + (F(last[val] + 1, i) * F(i + 1, v)) % base) % base;
}
}
{
int near = m + 1;
for (int i = (first[val]); i >= (u); i--) {
near = min(near, first[a[i]]);
if (i == near)
left = (left + (F(i, first[val] - 1) * F(u, i - 1)) % base) % base;
}
}
return f[u][v] = (mid * ((left * right) % base)) % base;
}
int main() {
read(n);
read(m);
for (int i = (1); i <= (m); i++) read(c[i]);
a.push_back(0);
for (int i = (1); i <= (m); i++)
if (c[i] != a.back()) a.push_back(c[i]);
m = a.size() - 1;
for (int i = (1); i <= (m); i++)
if (first[a[i]] == 0) first[a[i]] = i;
for (int i = (m); i >= (1); i--)
if (last[a[i]] == 0) last[a[i]] = i;
for (int i = (1); i <= (n); i++) {
for (int j = (first[i]); j <= (last[i]); j++) {
if (a[j] < i) {
writeln(0);
return 0;
}
}
}
for (int i = (1); i <= (m); i++) mi[i][i] = a[i];
for (int len = (2); len <= (m); len++) {
for (int i = (1); i <= (m); i++) {
int j = i + len - 1;
if (j > m) break;
mi[i][j] = min(mi[i][j - 1], mi[i + 1][j]);
}
}
for (int i = (1); i <= (m); i++)
for (int j = (i + 1); j <= (m); j++)
if (a[i] == a[j]) {
Kafuu_Chino[i] = j;
break;
}
writeln(F(1, m));
}
| 12 | CPP |
n,a,b=map(int,input().split())
s=str(input())
if s[a-1]==s[b-1]:
print(0)
else:
print(abs(int(s[a-1])-int(s[b-1]))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[5010], d[5010], r;
int c[5010];
void nhap() {
double z;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i] >> z;
}
void update(int x, int gt) {
while (x <= n) {
c[x] = max(c[x], gt);
x += (x & -x);
}
}
int tinh(int x) {
int sl = 0;
while (x) {
sl = max(sl, c[x]);
x -= (x & -x);
}
return sl;
}
void xuli() {
for (int i = 1; i <= n; i++) {
d[i] = tinh(a[i]) + 1;
update(a[i], d[i]);
r = max(r, d[i]);
}
cout << n - r;
}
int main() {
nhap();
xuli();
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 12505;
const int M = 1000005;
int n, m, w[N], a[N], b[M], eu[M], ev[M];
bool vis[M * 2];
vector<pair<int, int> > G[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].emplace_back(v, i);
G[v].emplace_back(u, i);
b[i] = 1;
eu[i] = u, ev[i] = v;
}
for (int i = 1; i <= n; i++) w[i] = (int)G[i].size(), a[i] = 0;
for (int u = 1; u <= n; u++) {
int sz = 0;
for (auto &e : G[u]) {
int v = e.first, id = e.second;
if (v > u) continue;
sz++;
if (a[v]) {
a[v]--;
b[id]++;
w[u]++;
}
}
int x;
for (x = w[u] - sz; x <= w[u]; x++) vis[x] = 0;
for (auto &e : G[u]) {
int v = e.first;
if (v > u) continue;
vis[w[v]] = 1;
}
for (x = w[u] - sz; x <= w[u]; x++)
if (!vis[x]) break;
x = w[u] - x;
for (auto &e : G[u]) {
if (!x) break;
int v = e.first, id = e.second;
if (v > u) continue;
x--;
a[v]++;
b[id]--;
w[u]--;
}
}
int cc = 0;
for (int i = 1; i <= n; i++)
if (a[i]) cc++;
printf("%d\n", cc);
for (int i = 1; i <= n; i++)
if (a[i]) printf("%d\n", i);
for (int i = 1; i <= m; i++) printf("%d %d %d\n", eu[i], ev[i], b[i]);
return 0;
}
| 21 | CPP |
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import random
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')):
#------------------Sublime--------------------------------------#
sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
def I():return (int(input()))
def In():return(map(int,input().split()))
else:
#------------------PYPY FAst I/o--------------------------------#
def I():return (int(stdin.readline()))
def In():return(map(int,stdin.readline().split()))
#sys.setrecursionlimit(1500)
def dict(a):
d={}
for x in a:
if d.get(x,-1)!=-1:
d[x]+=1
else:
d[x]=1
return d
def find_gt(a, x):
'Find leftmost value greater than x'
i = bi.bisect_left(a, x)
if i != len(a):
return i
else:
return -1
def main():
try:
n,c=In()
l=[]
for x in range(n):
l.append(list(In()))
ans=0
for i in range(n//2):
for j in range(c//2):
su=[l[i][j],l[n-i-1][j],l[i][c-j-1],l[n-i-1][c-j-1]]
su.sort()
su1=(su[1]+su[2])//2
#print(su)
ans+=abs(su1-l[i][j])
ans+=abs(su1-l[n-i-1][j])
ans+=abs(su1-l[i][c-j-1])
ans+=abs(su1-l[n-i-1][c-j-1])
if n&1==1:
temp=(n//2)
su=0
for i in range(c//2):
t=l[temp][i]+l[temp][c-i-1]
t//=2
ans+=abs(t-l[temp][i])
ans+=abs(t-l[temp][c-i-1])
if c&1==1:
temp=(c//2)
for i in range(n//2):
t=l[i][temp]+l[n-i-1][temp]
t//=2
ans+=abs(t-l[i][temp])
ans+=abs(t-l[n-i-1][temp])
print(ans)
except:
pass
M = 998244353
P = 1000000007
if __name__ == '__main__':
for _ in range(I()):main()
#for _ in range(1):main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int const N = 500000, B = 19;
int fr[N + 1], n, sp[N + 1][B], lg[N + 1], inv[N + 1];
long long sm[N + 1];
vector<int> mp;
int gtmx(int l, int r) {
int g = lg[r - l + 1];
return max(sp[l][g], sp[r - (1 << g) + 1][g]);
}
pair<int, int> gt2mx(int l, int r) {
r = min(r, N);
int an = gtmx(l, r);
if (an == -1 || fr[an] > 1) return make_pair(an, an);
int t = mp[inv[an] - 1];
if (t < l) t = -1;
return make_pair(an, t);
}
void up(pair<int, int> &x, int l, int r, int y) {
pair<int, int> z = gt2mx(l, r);
z.first %= y;
z.second %= y;
if (z.first > x.first) {
x.second = x.first;
x.first = z.first;
if (z.second > x.second) x.second = z.second;
} else if (z.first > x.second)
x.second = z.first;
}
long long go(int y) {
long long an = 0, ty = 0;
pair<int, int> mx(-1, -1);
for (int i = y; i <= N; i += y)
ty += (long long)(i / y) * (sm[min(N, i + y - 1)] - sm[i - 1]);
for (int i = N / y * y; i >= 0; i -= y) {
up(mx, i, i + y - 1, y);
if (mx.first == -1) continue;
int x = i + mx.first >> 1;
int nty = min((long long)x, ty - i / y);
if (nty > 1) an = max(an, (long long)y * nty);
if (mx.second == -1) continue;
if (sm[i + mx.first - 1] < n - 1) {
x = i + mx.first;
nty = min((long long)x, ty - 2 * (i / y) - 1);
if (nty > 1) an = max(an, (long long)y * nty);
}
x = i + mx.second;
nty = min((long long)x, ty - 2 * (i / y));
if (nty > 1) an = max(an, (long long)y * nty);
}
return an;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < (int)(n); ++i) {
int t;
scanf("%d", &t);
++fr[t];
}
for (int i = 1; i < (int)(N + 1); ++i) sm[i] = sm[i - 1] + fr[i];
mp.push_back(-1);
for (int i = 1; i < (int)(N + 1); ++i)
if (fr[i]) mp.push_back(i), inv[i] = mp.size() - 1;
lg[1] = 0;
for (int i = 2; i < (int)(N + 1); ++i) lg[i] = lg[i - 1] + (i == (i & -i));
for (int i = 0; i < (int)(N + 1); ++i) sp[i][0] = fr[i] > 0 ? i : -1;
for (int i = N; i >= 0; --i) {
int k = 1;
while (i + (1 << k) - 1 <= N)
sp[i][k] = max(sp[i][k - 1], sp[i + (1 << k - 1)][k - 1]), ++k;
}
long long an = 0;
for (int y = 2; y < (int)(N + 1); ++y) an = max(an, go(y));
printf("%lld\n", an);
}
| 11 | CPP |
# Aizu Problem 0046: Differential
#
import sys, math, os
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
heights = [float(line) for line in sys.stdin]
diff = max(heights) - min(heights)
print(diff) | 0 | PYTHON3 |
I = lambda: list(map(int, input().split()))
n, s = I()
A, B = I(), I()
if A[0] and (A[s-1] or B[s-1] and any(A[i]*B[i] for i in range(s, n))):
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
MAXN = int(2e18)
def check(n, x, y, p, q):
np, nq = n * p, n * q
# print(x, y, np, nq)
if nq < y:
return False
diff = nq - y
return x <= np <= x + diff
def solve():
x, y, p, q = map(int, input().split())
l, r = 1, int(MAXN)
while l != r:
m = (l + r) // 2
if not check(m, x, y, p, q):
l = m + 1
else:
r = m
if r == MAXN:
print(-1)
else:
print(l * q - y)
t = int(input())
for _ in range(t):
solve()
| 9 | PYTHON3 |
import sys
for _ in range(int(sys.stdin.readline().rstrip())):
n = int(sys.stdin.readline().rstrip())
num = list(map(int, sys.stdin.readline().rstrip().split()))
num.sort()
re = num[::-1]
for i in re:
print(i, end=' ')
print('')
| 8 | PYTHON3 |
n=int(input())
t=[[]for i in range(n)]
for i in range(n):
c=input()
for j in range(n):
if c[j]=="1":
t[i].append(j)
def f(x):
a=[-1]*n
a[x],q=1,[[x,1]]
while q:
b,c=q.pop(0)
for i in t[b]:
if a[i]!=-1:
if abs(a[i]-c)!=1:
return -1
break
else:
a[i]=c+1
q.append([i,c+1])
return max(a)
print(max([f(i)for i in range(n)])) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char s[1000005];
int main() {
scanf("%s", s);
int n = strlen(s);
int mn = 28;
for (int i = 0; i < n; i++) {
if (s[i] - 'a' > mn)
printf("Ann\n");
else
printf("Mike\n");
mn = min(mn, s[i] - 'a');
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:33554432")
const int MOD = 1e9 + 7;
int N, K, A[100005], par[100005];
int D[100005][2];
vector<int> con[100005];
int inv(int n) {
int ret = 1, v = n;
for (int i = 0; i < 30; i++, v = (long long)v * v % MOD)
if (((MOD - 2) >> i) & 1) {
ret = (long long)ret * v % MOD;
}
return ret;
}
void dfs(int n) {
int i, k;
D[n][0] = 1;
for (i = ((int)(con[n]).size()); i--;) {
k = con[n][i];
dfs(k);
D[n][0] = (long long)D[n][0] * D[k][0] % MOD;
}
if (A[n])
D[n][1] = D[n][0];
else {
for (i = ((int)(con[n]).size()); i--;) {
k = con[n][i];
int d = (long long)D[n][0] * inv(D[k][0]) % MOD;
D[n][1] = (D[n][1] + (long long)D[k][1] * d % MOD) % MOD;
}
D[n][0] = (D[n][0] + (D[n][1])) % (MOD);
}
}
int main() {
int i, j, k;
scanf("%d", &N);
for (i = 2; i <= N; i++)
scanf("%d", par + i), ++par[i], con[par[i]].push_back(i);
for (i = 1; i <= N; i++) scanf("%d", A + i), K += A[i];
dfs(1);
printf("%d\n", D[1][1]);
}
| 8 | CPP |
n=int(input())
while(n):
k=input()
d=list(k)
f=len(d)
if(f>10):
f=f-2
h=str(f)
print(d[0]+h+d[-1])
else:
print(k)
n=n-1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
template <typename T>
T POW(T B, T P) {
if (P == 0) return 1;
if (P & 1)
return B * POW(B, P - 1);
else
return (POW(B, P / 2)) * (POW(B, P / 2));
}
long long powmod(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a % 100000007;
a = a * a % 100000007;
b >>= 1;
}
return ans;
}
int main() {
fastio();
int n;
cin >> n;
int arr[n];
vector<int> v, divisors;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i]) v.push_back(i + 1);
}
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.push_back(i);
divisors.push_back(n / i);
}
}
for (int i = 0; i < divisors.size(); i++) {
int k = divisors[i];
for (int j = 0; j < n; j++) {
bool flag = true;
if (arr[j] == 0) continue;
int cnt = 0;
for (int p = j; p < n; p += k) {
if (arr[p] != 1) {
flag = false;
break;
} else
cnt++;
}
if (cnt == n / k && cnt > 2)
flag = true;
else
flag = false;
if (flag) return cout << "YES" << '\n', 0;
}
}
cout << "NO" << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T abs(T a) {
return a < 0 ? -a : a;
}
template <typename T>
T sqr(T a) {
return a * a;
}
const int INF = (int)1e9;
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
const int N = 15;
const int M = 500100;
char buf[100];
int n;
string s[N];
int m;
int sza;
string a[M];
int __NEXT__[N][M];
int z[N * N][(1 << N) + 1];
int solve(int inv, int mask) {
if (mask == 0) {
return inv == 0 ? 0 : sza + 1;
}
if (z[inv][mask] == -1) {
z[inv][mask] = sza + 1;
int cinv[15];
cinv[0] = 0;
int cur = 0;
for (int i = 0; i < n; ++i) {
if (mask & (1 << i))
cinv[i] = cur;
else
cur++;
}
for (int i = n - 1; i >= 0; --i) {
if (mask & (1 << i) && cinv[i] <= inv) {
int cur = __NEXT__[i][solve(inv - cinv[i], mask ^ (1 << i))] + 1;
z[inv][mask] = min(z[inv][mask], cur);
}
}
}
return z[inv][mask];
}
int main() {
cin >> n;
for (int i = 0; i < int(n); ++i) {
cin >> s[i];
}
cin >> m;
int ans = -1;
int idx = -1;
for (int q = 0; q < m; ++q) {
scanf(" %d", &sza);
for (int i = 0; i < int(sza); ++i) {
scanf(" %s", buf);
a[i] = buf;
}
for (int i = 0; i < int(n); ++i)
__NEXT__[i][sza] = __NEXT__[i][sza + 1] = sza + 1;
for (int i = sza - 1; i >= 0; --i) {
for (int j = 0; j < int(n); ++j)
if (a[i] == s[j])
__NEXT__[j][i] = i;
else
__NEXT__[j][i] = __NEXT__[j][i + 1];
}
for (int mask = 0; mask < int((1 << n)); ++mask) {
for (int inv = 0; inv < int(((n * (n - 1)) >> 1) + 1); ++inv) {
if (mask == 0) {
z[inv][mask] = inv == 0 ? 0 : sza + 1;
} else {
z[inv][mask] = sza + 1;
int curi = 0;
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) {
int cur = __NEXT__[i][z[inv - curi][mask ^ (1 << i)]] + 1;
z[inv][mask] = min(z[inv][mask], cur);
} else {
curi++;
if (curi > inv) break;
}
}
}
}
}
for (int i = 0; i <= ((n * (n - 1)) >> 1); ++i)
if (solve(i, ((1 << n) - 1)) <= sza &&
ans < ((n * (n - 1)) >> 1) - i + 1) {
ans = ((n * (n - 1)) >> 1) - i + 1;
idx = q;
}
}
if (ans == -1) {
puts("Brand new problem!");
} else {
printf("%d\n[:", idx + 1);
for (int i = 0; i < int(ans); ++i) printf("|");
puts(":]");
}
cerr << clock() << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
const int maxn = 2e6 + 10;
int lst[100];
int a[maxn];
int k = 0;
int n = 0;
const long long base = (long long)1e9 + 7;
long long f[maxn];
void solve() {
cin >> n >> k;
cin >> s;
int m = s.size();
for (int i = 0; i < k; i++) lst[i] = 0;
for (int i = 0; i < s.size(); i++) {
lst[s[i] - 'a'] = i + 1;
a[i + 1] = s[i] - 'a';
}
for (int i = m + 1; i <= n + m; i++) {
int q = 0;
for (int j = 1; j < k; j++) {
if (lst[j] < lst[q]) {
q = j;
}
}
a[i] = q;
lst[q] = i;
}
f[0] = 1;
for (int i = 0; i < k; i++) lst[i] = 0;
for (int i = 1; i <= n + m; i++) {
f[i] = f[i - 1] + f[i - 1];
if (f[i] >= base) f[i] -= base;
if (lst[a[i]] > 0) f[i] -= f[lst[a[i]] - 1];
if (f[i] >= base) f[i] -= base;
if (f[i] < 0) f[i] += base;
lst[a[i]] = i;
}
cout << f[n + m];
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2")
vector<long long int> ar[1000001];
long long int vis[1000001], dis[1000001], level[1000001];
const int MAX_SIZE = 1000001;
const int N = 2000010;
const int mod = 1e9 + 7;
vector<int> isprime(MAX_SIZE, true);
vector<int> prime;
vector<int> SPF(MAX_SIZE);
long long int fact[N];
void manipulated_seive(int N) {
isprime[0] = isprime[1] = false;
for (int i = 2; i < N; ++i) {
if (isprime[i]) {
prime.push_back(i);
SPF[i] = i;
}
for (int j = 0;
j < (int)prime.size() && i * prime[j] < N && prime[j] <= SPF[i]; ++j) {
isprime[i * prime[j]] = false;
SPF[i * prime[j]] = prime[j];
}
}
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
unordered_map<long long int, long long int> myp;
void primeFactors(long long int n) {
while (n % 2 == 0) {
myp[2]++;
n = n / 2;
}
for (long long int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
myp[i]++;
n = n / i;
}
}
if (n > 2) myp[n]++;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int findlcm(long long int a, long long int b) {
return a * b / gcd(a, b);
}
long long int power(long long int a, long long int b) {
long long int res = 1;
while (b) {
if (b % 2) res *= a;
a *= a;
b /= 2;
}
return res;
}
long long int power_mod(long long int a, long long int b, long long int p) {
long long int res = 1;
while (b) {
if (b % 2) {
res *= a;
res %= p;
}
a *= a;
a %= p;
b /= 2;
}
return res;
}
long long int mod_inverse(long long int x) {
return power_mod(x, mod - 2, mod);
}
long long int nCr(long long int n, long long int r) {
if (r == 0) return 1;
long long int a = fact[n];
long long int b = mod_inverse(fact[n - r]);
long long int c = mod_inverse(fact[r]);
return (((a * b) % mod) * c) % mod;
}
void fun() {
long long int n, x, y, d;
cin >> n >> x >> y >> d;
if (abs(x - y) % d == 0) {
cout << abs(x - y) / d << '\n';
return;
}
long long int ans1 = 1e18, ans2 = 1e18;
if (abs(y - 1) % d == 0) {
ans1 = ceil(((float)abs(x - 1)) / ((float)d));
ans1 += (y - 1) / d;
}
if (abs(n - y) % d == 0) {
ans2 = ceil(((float)abs(n - x)) / ((float)d));
ans2 += abs(n - y) / d;
}
long long int ans = min(ans1, ans2);
if (ans == 1e18) {
cout << -1 << '\n';
return;
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
unsigned long long int t;
cin >> t;
while (t--) {
cout << fixed;
cout << setprecision(10);
fun();
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 305;
long long dist[10][N][N], I[2][N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (i != j) dist[0][i][j] = INT_MIN;
I[0][i][j] = dist[0][i][j];
}
for (int i = 1; i <= m; i++) {
int x, y, c1, c2;
cin >> x >> y >> c1 >> c2;
dist[0][x][y] = c1;
dist[0][y][x] = c2;
}
for (int c = 1; c < 10; c++) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) dist[c][i][j] = dist[c - 1][i][j];
for (int i = 1; i <= n; i++)
for (int k = 1; k <= n; k++)
for (int j = 1; j <= n; j++)
dist[c][i][j] =
max(dist[c][i][j], dist[c - 1][i][k] + dist[c - 1][k][j]);
}
bool ok = 0;
for (int i = 1; i <= n; i++)
if (dist[9][i][i] > 0) {
ok = 1;
break;
}
if (!ok) {
cout << 0;
return 0;
}
int ans = 1;
for (int bit = 9; bit >= 0; bit--) {
ok = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) I[1][i][j] = I[0][i][j];
for (int i = 1; i <= n; i++)
for (int k = 1; k <= n; k++)
for (int j = 1; j <= n; j++)
I[1][i][j] = max(I[1][i][j], I[0][i][k] + dist[bit][k][j]);
for (int i = 1; i <= n; i++)
if (I[1][i][i] > 0) {
ok = 1;
break;
}
if (!ok) {
ans += (1 << bit);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) I[0][i][j] = I[1][i][j];
}
}
cout << ans;
}
| 8 | CPP |
def solve():
n = int(input())
if n == 1:
print(-1)
else:
print("4"+"3"*(n-1))
for _ in range(int(input())):
solve()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 200100;
int N;
pair <ll, ll> arr[MAXN];
ll hi, lo;
int main()
{
ios_base::sync_with_stdio(0);
hi = -1e12;
lo = 1e12;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> arr[i].first >> arr[i].second;
if (arr[i].first > arr[i].second)
swap (arr[i].first, arr[i].second);
lo = min (lo, arr[i].first);
hi = max (hi, arr[i].second);
}
sort (arr, arr + N);
ll hmin = hi;
for (int i = 0; i < N; i++)
hmin = min (hmin, arr[i].second);
ll ans = (hi - hmin) * (arr[N-1].first - lo);
ll nhi = -1e9, nlo = 1e9;
for (int i = 0; i < N - 1; i++)
{
nhi = max (nhi, arr[i].second);
nlo = min (nlo, arr[i].second);
ans = min (ans, (max (nhi, arr[N-1].first) - min (nlo, arr[i+1].first)) * (hi - lo));
}
cout << ans << "\n";
} | 0 | CPP |
a = input()
if a.count('a') > len(a)/2 :
print(len(a))
else :
print(a.count('a') * 2 - 1)
| 7 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
b = a.copy()
b.reverse()
#print(a,b)
i1 = a.index(1)
i2 = b.index(1)
i2 = n-i2-1
#print(i1,i2)
cnt = 0
for i in range(i1,i2+1):
if a[i]==0:
cnt+=1
print(cnt) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, part, output;
cin >> n >> k;
if (n % 2 == 0) {
part = n / 2;
} else {
part = (n / 2) + 1;
}
if (k <= part) {
output = (2 * k) - 1;
} else {
output = (k - part) * 2;
}
cout << output << endl;
return 0;
}
| 7 | CPP |
import sys,bisect,math
from functools import reduce
sys.setrecursionlimit(15000)
A,B = map(int,sys.stdin.readline().split())
def exgcd0(x,y):
# if x < y:
# x,y = y,x
a0,b0,r0=1,0,x
a1,b1,r1=0,1,y
while r1 > 0:
q1=r0//r1
r2=r0%r1
a2=a0-q1*a1
b2=b0-q1*b1
a0,b0,r0=a1,b1,r1
a1,b1,r1=a2,b2,r2
return a0,b0,r0#a,b,c
def exgcd(a,b):
if b==0:
return 1,0,a
else:
q=a//b
r=a%b
s1,t1,c = exgcd(b,r)
s = t1
t = s1-t1*q
return s,t,c
ret = exgcd0(A,B)
print(ret[0],ret[1])
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int M, Nmin, Nmax;
vector<int> P;
void solve(){
sort(P.rbegin(), P.rend());
int gap = 0;
int ans = -1;
for(int i=Nmin-1; i<Nmax; i++){
if(P[i]-P[i+1] >= gap){
gap = P[i]-P[i+1];
ans = i + 1;
}
}
cout << ans << endl;
}
int main(){
while(cin >> M >> Nmin >> Nmax, M|Nmin|Nmax){
P.resize(M);
for(auto &v: P)
cin >> v;
solve();
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF * INF * 10;
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << p.first << ' ' << p.second;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vs s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
if (n == 1) {
cout << s[0] << '\n';
continue;
}
bool x = false;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < 26; ++j) {
string xx =
s[n - 1].substr(0, i) + char('a' + j) + s[n - 1].substr(i + 1);
for (int k = 0; k < n - 1; ++k) {
int cnt = 0;
for (int l = 0; l < m; ++l) {
if (s[k][l] != xx[l]) cnt++;
}
if (cnt > 1) break;
if (k == n - 2) {
x = true;
}
}
if (x) {
cout << xx << '\n';
break;
}
}
if (x) break;
}
if (!x) cout << -1 << '\n';
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long modPower(long long num, long long r) {
if (r == 0) return 1;
if (r == 1) return num % 1000000007;
long long ans = modPower(num, r / 2) % 1000000007;
if (r % 2 == 0) {
return (ans * ans) % 1000000007;
}
return (((ans * ans) % 1000000007) * num) % 1000000007;
}
long long nCr(long long n, long long r) {
long long res = 1;
if (r > n - r) {
r = n - r;
}
for (long long i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
long long pos(long long n) {
if (n < 0)
return (-1) * n;
else
return n;
}
unsigned long long highestPowerof2(unsigned long long n) {
unsigned long long p = (unsigned long long)log2(n);
return (unsigned long long)pow(2, p);
}
long long arraySum(int a[], long long n) {
long long initial_sum = 0;
return accumulate(a, a + n, initial_sum);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unsigned long long n, i, j, sum, psum = 0, power, ans;
cin >> n;
int A[n];
for (i = 0; i < n; i++) {
cin >> A[i];
psum += (A[i] - 1);
}
sort(A, A + n);
ans = psum;
j = 2;
if (n <= 50) {
do {
if (j != 2) psum = sum;
sum = 0;
power = 1;
for (i = 0; i < n; i++) {
sum += pos(A[i] - power);
power = power * j;
}
j++;
if (ans > sum) ans = sum;
} while (psum > sum);
cout << ans;
} else
cout << psum;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t, n, len;
int p[200010], c[200010], l[200010], b[400010];
void dfs(int k, int pp) {
b[++len] = pp;
if (pp == k)
return;
else
dfs(k, p[pp]);
}
void _count(int k) {
len = 0;
b[0] = k;
dfs(k, p[k]);
for (int i = 1; i <= len; i++) b[len + i] = b[i];
for (int i = 0; i <= len + len; i++) l[b[i]] = len;
int minn = 0;
for (int k = 1; k <= len - 1; k++)
if (len % k == 0) {
int i;
for (i = 0; i < k; i++) {
if (l[b[i]] < k) continue;
int t = 0;
for (int j = i + k; j <= len + i; j += k)
if (c[b[j]] != c[b[j - k]]) {
t = 1;
break;
}
if (t == 0)
for (int j = i; j <= len + i; j += k) l[b[j]] = k;
}
}
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
int ans = n;
for (int i = 1; i <= n; i++) {
if (l[i] == 0) {
_count(i);
}
ans = min(ans, l[i]);
}
for (int i = 1; i <= n; i++) l[i] = 0;
printf("%d\n", ans);
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[100100];
int b[100100];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = 1; i < n; i++) {
b[i] = abs(a[i] - a[i + 1]);
}
long long sum = 0, summ = 0;
long long ans = -1;
for (int i = 1; i < n; i++) {
int temp = b[i];
if (i % 2 == 0) temp = -temp;
summ += temp;
sum += temp;
ans = max(ans, sum);
ans = max(ans, -summ);
if (sum < 0) sum = 0;
if (summ > 0) summ = 0;
}
cout << ans << endl;
}
| 9 | CPP |
while True:
try:
n = int(input())
except:
break
x = 0
for a in range(0, 10):
for b in range(0, 10):
for c in range(0, 10):
for d in range(0, 10):
x += (a + b + c + d == n)
print(x)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n;
double a[N], b[N];
double ans, last, now;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
a[i] = x * 1.0 / 100;
}
for (int i = 1; i <= n; i++) b[i] = a[i];
last = 1;
for (int i = 1; i <= n; i++) last *= a[i];
ans = last * n;
for (int j = n + 1; j <= 200000; j++) {
double p = 0;
int q = 0;
for (int i = 1; i <= n; i++) {
double tmp = (b[i] + (1 - b[i]) * a[i]) / b[i];
if (tmp > p) p = tmp, q = i;
}
b[q] = b[q] + (1 - b[q]) * a[q];
now = last * p;
ans += j * (now - last);
last = now;
}
printf("%lf\n", ans);
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int N, K, ans;
int par[100010], dp[100010];
vector<int> adj[100010];
void dfs(int u) {
dp[u] = 0;
for(int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
dfs(v);
dp[u] = max(dp[u], 1 + dp[v]);
}
if(par[u] && dp[u] == K - 1) {
ans++;
dp[u] = -1;
}
}
int main() {
scanf("%d %d", &N, &K);
for(int i = 0; i < N; i++) {
scanf("%d", &par[i]);
par[i]--;
}
ans = par[0] != 0;
par[0] = 0;
for(int i = 1; i < N; i++) {
adj[ par[i] ].push_back(i);
}
dfs(0);
cout << ans;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long s, t;
pair<long long, long long> u[200007];
long long a[200007];
bool f(long long val) {
int i;
long long cur = 0;
for (i = 0; i <= k; i++) {
long long dist = a[i + 1] - a[i];
if (val < dist) {
return false;
}
long long h = (val - dist);
if (h >= dist) {
cur += dist;
} else {
cur += h;
cur += 2 * (dist - h);
}
if (cur > t) {
return false;
}
}
return true;
}
void input() {
scanf("%d%d", &n, &k);
scanf("%I64d%I64d", &s, &t);
int i;
for (i = 1; i <= n; i++) {
scanf("%I64d%I64d", &u[i].first, &u[i].second);
}
for (i = 1; i <= k; i++) {
scanf("%I64d", &a[i]);
}
sort(a + 1, a + k + 1);
a[0] = 0;
a[k + 1] = s;
}
void solve() {
if (t < s) {
printf("-1\n");
return;
}
long long l, r, mid;
l = r = 1;
int i;
for (i = 1; i <= 12; i++) {
r *= 10;
}
while ((r - l) > 3) {
mid = (l + r) / 2;
if (f(mid) == true) {
r = mid;
} else {
l = mid;
}
}
while (f(l) == false) {
l++;
}
long long ans = -1;
for (i = 1; i <= n; i++) {
if (u[i].second < l) {
continue;
}
if (ans == -1 || ans > u[i].first) {
ans = u[i].first;
}
}
printf("%I64d\n", ans);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
input();
solve();
return 0;
}
| 7 | CPP |
n,k = map (int, (input().split()))
a = list(map (int, input().split()))
if a[k-1] > 0:
print ((a.index(a[k-1]) + a.count(a[k-1])))
else:
print (n - a.count(0)) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.