solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
long long a[300000];
long long bb[60];
long long pp[60];
long long s[60];
long long l[60];
long long nk[50][5010];
long long sumall[60];
long long dp[300000][3];
long long ss[5010];
int main() {
long long n, m;
cin >> n >> m;
for (long long i = 0; i < n; i++) {
cin >> l[i];
for (long long j = 0; j < l[i]; j++) {
cin >> nk[i][j];
sumall[i] += nk[i][j];
}
}
for (long long i = 0; i < m; i++) {
cin >> a[i];
a[i]--;
}
long long sum = 0, su;
for (long long i = 0; i < n; i++) {
sum = nk[i][l[i] - 1];
su = nk[i][l[i] - 1];
bb[i] = sum;
for (long long j = l[i] - 2; j >= 0; j--) {
su += nk[i][j];
if (su > sum) {
bb[i] = su;
sum = su;
}
}
}
for (long long i = 0; i < n; i++) {
sum = nk[i][0];
su = nk[i][0];
pp[i] = sum;
for (long long j = 1; j < l[i]; j++) {
su += nk[i][j];
if (su > sum) {
pp[i] = su;
sum = su;
}
}
}
for (long long i = 0; i < n; i++) {
for (long long j = l[i] - 1; j >= 0; j--) {
ss[j] = 0;
}
ss[l[i] - 1] = nk[i][l[i] - 1];
s[i] = ss[l[i] - 1];
for (long long j = l[i] - 2; j >= 0; j--) {
ss[j] = max(nk[i][j], nk[i][j] + ss[j + 1]);
s[i] = max(ss[j], s[i]);
}
}
for (long long i = 0; i < n; i++) {
}
dp[m - 1][0] = s[a[m - 1]];
dp[m - 1][1] = pp[a[m - 1]];
long long ans = max(dp[m - 1][0], dp[m - 1][1]);
for (long long i = m - 2; i >= 0; i--) {
dp[i][0] = max(s[a[i]], bb[a[i]] + dp[i + 1][1]);
ans = max(ans, dp[i][0]);
dp[i][1] = max(pp[a[i]], sumall[a[i]] + dp[i + 1][1]);
ans = max(dp[i][1], ans);
}
cout << ans;
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
int main() {
int r, h, l;
scanf("%d%d", &r, &h);
l = (h + r / 2) / r;
printf("%d\n", l * 2 + ((long long)(h + r - l * r) * (h + r - l * r) * 4 >=
(long long)r * r * 3
? 1
: 0));
return 0;
}
| 1,900 | CPP |
n, m = [int(i) for i in input().split()]
c = 4 # initial count
for i in range(n):
x = [int(j) for j in input().split()]
if i==0 and any(x):
c = 2
elif i==n-1 and any(x):
c = 2
elif x[0] or x[-1]:
c = 2
print(c) | 1,000 | PYTHON3 |
a=input()
c=0
for i in a:
if i=='4' or i=='7':
c+=1
c2=0
c3=0
for j in str(c):
if j=='4':
c2+=1
elif j=='7':
c3+=1
if str(c2+c3)==str(len(str(c))):
print("YES")
else:
print("NO")
| 800 | PYTHON3 |
def find(x):
if root==x:
u=root
else:
i=0
s=2**i
while x%s==0:
i+=1
s=2**i
s=s//2
y=i+1
if (x-s)%(2**y)!=0:
u=x-s
else:
u=x+s
return u
n,q=list(map(int,input().split()))
root=(n+1)//2
for j in range(q):
n1=int(input())
str1=input()
for j in range(len(str1)):
up=find(n1)
if str1[j]=='U':
n1=(up)
elif n1%2==0:
if str1[j]=='L':
if n1!=root:
n1=(n1-abs((up-n1)//2))
else:
n1=(n1-n1//2)
elif str1[j]=='R':
if n1!=root:
n1=(n1+abs((up-n1)//2))
elif n1%2==0:
n1=n1+n1//2
print(n1) | 1,900 | PYTHON3 |
'''
CodeForces 122A
Lucky Division
Tags: Math
'''
'''
def luckyNumber(x):
s = str(x)
return len(s) == s.count('4') + s.count('7')
mx = 1000
lucky = list(filter(luckyNumber, range(1, mx + 1)))
'''
lucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]
n = int(input())
print('YES' if any(map(lambda x: n % x == 0, lucky)) else 'NO') | 1,000 | PYTHON3 |
import sys
input = sys.stdin.readline
N, = map(int, input().split())
if N%2:
print("NO")
else:
E = []
bx, by = None, None
for _ in range(N):
x, y = map(int, input().split())
if bx != None:
E.append(((x-bx), (y-by)))
else:
fx, fy = x, y
bx, by = x, y
E.append(((fx-bx), (fy-by)))
for i in range(N//2):
x, y = E[i]
z, w = E[N//2+i]
if not (x == -z and y == -w):
print("No")
break
else:
print("Yes")
| 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > occ[1000001], divisors[1000001], res_vek;
long long k;
void sieve() {
for (int ctr1 = 2; ctr1 < 1000001; ++ctr1) {
if (divisors[ctr1].empty()) {
for (long long ctr2 = ctr1; ctr2 < 1000001; ctr2 = ctr2 * ctr1)
for (int ctr3 = ctr2; ctr3 < 1000001; ctr3 += ctr2) {
if (divisors[ctr3].empty() || divisors[ctr3].back().first != ctr1)
divisors[ctr3].push_back({ctr1, 0});
divisors[ctr3].back().second++;
}
}
}
}
long long update(int cur, pair<long long, long long> range) {
long long rez = 0;
if (divisors[cur].size() == 1 && divisors[cur].back().second == 1) {
if (range.second > k) {
rez = range.second - max(k, range.first);
range.second -= rez;
}
range.first++;
range.second++;
if (range.first < range.second) occ[cur - 1].push_back({range});
} else {
for (const auto& it : divisors[cur]) {
occ[it.first].push_back(
{range.first,
range.first + (range.second - range.first) * it.second});
}
}
return rez;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
sieve();
int m;
cin >> m;
for (int ctr1 = 0; ctr1 < m; ++ctr1) {
long long p, a;
cin >> p >> a;
occ[p].push_back({0LL, a});
}
cin >> k;
for (int ctr1 = 1000001 - 1; ctr1 > 1; --ctr1) {
if (occ[ctr1].empty()) continue;
sort(occ[ctr1].begin(), occ[ctr1].end());
auto cur = occ[ctr1].front();
long long tot = 0;
for (uint32_t ctr2 = 1; ctr2 < occ[ctr1].size(); ++ctr2) {
if (cur.second >= occ[ctr1][ctr2].first) {
cur.second += occ[ctr1][ctr2].second - occ[ctr1][ctr2].first;
} else {
tot += update(ctr1, cur);
cur = occ[ctr1][ctr2];
}
}
tot += update(ctr1, cur);
if (tot) res_vek.push_back({ctr1, tot});
}
reverse(res_vek.begin(), res_vek.end());
cout << res_vek.size() << '\n';
for (const auto& it : res_vek) cout << it.first << ' ' << it.second << '\n';
return 0;
}
| 0 | CPP |
import math
def B(n,k,x,l):
l.sort()
p=l[0]
di=[]
r=0
g=1
for i in range(1,n):
d=l[i]-p
if d>x:
di.append(d)
r=r+1
g=g+1
p=l[i]
di.sort()
i=0
while k>=1 and i<r:
v=math.ceil(di[i]/x)-1
if k>=v:
k=k-v
g=g-1
i=i+1
else:
break
return(g)
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
v2=B(n,k,x,l)
print(v2) | 1,200 | PYTHON3 |
for i in range(int(input())) :
n = int(input())
if n <= 30 :
print('NO')
elif n == 30+6 :
print('YES')
print(6, 10, 15, 5)
elif n == 30+10 :
print('YES')
print(10, 14, 15, 1)
elif n == 30+14 :
print('YES')
print(10, 14, 15, 5)
else :
print('YES')
print(6, 10, 14, n-30) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void base() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int inf = 1e9 + 7;
int a[30];
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void solve() {
int n;
cin >> n;
int odd = 0;
int g = -1;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] & 1) odd++;
if (g == -1)
g = a[i];
else
g = gcd(g, a[i]);
}
if (odd > 1) {
cout << "0\n";
for (int i = 0; i < n; ++i)
while (a[i]--) cout << (char)(i + 'a');
cout << "\n";
return;
}
cout << g << "\n";
if (odd == 0) {
string res[2];
for (int i = 0; i < n; ++i)
for (int j = 0; j < a[i] / g; ++j) res[0] += i + 'a';
res[1] = res[0];
reverse(res[1].begin(), res[1].end());
for (int i = 0; i < g; ++i) cout << res[i & 1];
cout << "\n";
} else {
string res[2], mid = "";
for (int i = 0; i < n; ++i) {
if (a[i] & 1) {
for (int j = 0; j < a[i] / g; ++j) mid += i + 'a';
} else {
for (int j = 0; j < a[i] / (2 * g); ++j) res[0] += i + 'a';
}
}
res[1] = res[0];
reverse(res[1].begin(), res[1].end());
res[0] = res[0] + mid + res[1];
for (int i = 0; i < g; ++i) cout << res[0];
cout << "\n";
}
}
int main() {
base();
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007ll;
int parent[500005];
int find_par(int u) {
if (parent[u] == u) return u;
return parent[u] = find_par(parent[u]);
}
pair<int, int> edge[500005];
int connection[500005][2];
int n, m;
int s, t, ds, dt;
vector<pair<int, int> > res;
int func() {
for (int i = 0; i <= n; i++) parent[i] = i;
for (int i = 1; i <= m; i++) {
if ((edge[i].first == s || edge[i].second == t) ||
(edge[i].first == t || edge[i].second == s)) {
continue;
}
int u = find_par(edge[i].first);
int v = find_par(edge[i].second);
if (v != u) {
res.push_back(edge[i]);
parent[v] = u;
}
}
vector<int> tem1, tem2;
for (int i = 1; i <= m; i++) {
if ((edge[i].first == s && edge[i].second == t) ||
(edge[i].first == t && edge[i].second == s)) {
continue;
}
if (edge[i].first == s) {
tem1.push_back(edge[i].second);
connection[find_par(edge[i].second)][0] = 1;
} else if (edge[i].second == s) {
tem1.push_back(edge[i].first);
connection[find_par(edge[i].first)][0] = 1;
} else if (edge[i].first == t) {
tem2.push_back(edge[i].second);
connection[find_par(edge[i].second)][1] = 1;
} else if (edge[i].second == t) {
tem2.push_back(edge[i].first);
connection[find_par(edge[i].first)][1] = 1;
}
}
for (int i = 0; i < tem1.size(); i++) {
int v = find_par(tem1[i]);
if (connection[v][0] == 1 && connection[v][1] == 1) continue;
int u = find_par(s);
if (v == u) continue;
parent[v] = u;
res.push_back(make_pair(tem1[i], s));
ds--;
}
for (int i = 0; i < tem2.size(); i++) {
int v = find_par(tem2[i]);
if (connection[v][0] == 1 && connection[v][1] == 1) continue;
int u = find_par(t);
if (v == u) continue;
parent[v] = u;
res.push_back(make_pair(tem2[i], t));
dt--;
}
bool flag = false;
for (int i = 1; i <= m; i++) {
if ((edge[i].first == s && edge[i].second == t) ||
(edge[i].first == t && edge[i].second == s)) {
flag = true;
continue;
}
int u = find_par(edge[i].first);
int v = find_par(edge[i].second);
if (v != u) {
if (edge[i].first == s || edge[i].second == s) {
if (ds > 0) {
ds--;
res.push_back(edge[i]);
parent[v] = u;
}
} else if (edge[i].first == t || edge[i].second == t) {
if (dt > 0) {
dt--;
res.push_back(edge[i]);
parent[v] = u;
}
}
}
}
if (ds > 0 && dt > 0 && find_par(s) != find_par(t) && flag) {
res.push_back(make_pair(s, t));
parent[find_par(s)] = find_par(t);
ds--;
dt--;
}
if (res.size() != n - 1) return -1;
return 0;
}
int main() {
scanf("%d %d", &n, &m);
int u, v;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &edge[i].first, &edge[i].second);
}
scanf("%d %d %d %d", &s, &t, &ds, &dt);
if (func() == -1) {
puts("No");
return 0;
}
puts("Yes");
for (int i = 0; i < res.size(); i++) {
printf("%d %d\n", res[i].first, res[i].second);
}
return 0;
}
| 2,300 | CPP |
def is_prime(n):
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
t = int(input())
for case in range(t):
a, b = [int(x) for x in input().split(' ')]
if a - b == 1 and is_prime(a + b):
print('YES')
else:
print('NO') | 1,100 | PYTHON3 |
R=lambda:int(input())
for i in range(R()):
b = R()
s = input()
n = s.find('1')
if n == -1:
print(b)
else:
print(2*max(b-n,s.rfind('1')+1)) | 1,000 | PYTHON3 |
sum = 0
k,n,w = map(int,input().split())
for i in range(1,w+1):
multiply = k * i
sum = sum + multiply
diff = sum - n
if diff > 0:
print(diff)
else:
print(0)
| 800 | PYTHON3 |
t=int(input())
for _ in range(t):
n=int(input())
a=list(input())
mx_dist=0
flag=0
for j in range(n):
if a[j]=='A':
flag=1
break
if flag :
for i in range(j,n):
if a[i]=='A' :
pos_a=i
else :
mx_dist=max(mx_dist , abs(i-pos_a))
if not flag :
print(0)
else :
print(mx_dist) | 800 | PYTHON3 |
n=int(input())
n=n+1
c=0
for i in range(5555555):
if "8" in str(n):
break
else:
c+=1
n+=1
print(c+1)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, f[4000000], m, hea[4000000], wen[4000000], nex[4000000], len;
void add(int x, int y) {
++len;
nex[len] = hea[x];
wen[len] = y;
hea[x] = len;
}
void dfs(int x, int y) {
f[x] = min(x, f[y]);
for (int i = hea[x]; i; i = nex[i])
if (wen[i] != y) dfs(wen[i], x);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
int x;
scanf("%d", &x);
scanf("%d", &x);
f[0] = 1000000000;
x = x % n + 1;
dfs(x, 0);
int ans = 0, minn = x;
for (int i = 2; i <= m; i++) {
int bo;
scanf("%d%d", &bo, &x);
x = (x + ans) % n + 1;
if (bo & 1)
minn = min(minn, f[x]);
else {
ans = min(minn, f[x]);
printf("%d\n", ans);
}
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, a, mx;
string s;
int main() {
cin >> n >> k >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
a++;
else if (s[i] == '.') {
if (a > mx) mx = a;
a = 0;
}
}
if (k > mx)
cout << "YES";
else
cout << "NO";
}
| 900 | CPP |
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n,k=map(int,input().split())
L=list(map(int,input().split()))
if n==1:
print(0)
continue
val = max(L)
for i in range(n):
L[i]=val-L[i]
k-=1
if k==0:
print(*L)
continue
if k&1==0:
print(*L)
if k&1==1:
val = max(L)
for i in range(n):
L[i]=val-L[i]
print(*L)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int a = 0;
char c = getchar();
while (!isdigit(c)) c = getchar();
while (isdigit(c)) {
a = a * 10 + c - 48;
c = getchar();
}
return a;
}
const int _ = 1 << 18;
int fa[_], cnt[_], sz[_], N;
long long sum = 0;
int find(int x) { return fa[x] == x ? x : (fa[x] = find(fa[x])); }
int main() {
N = read();
++cnt[0];
for (int x, i = 1; i <= N; ++i) {
x = read();
++cnt[x];
sum -= x;
}
for (int i = 0; i < _; ++i) {
fa[i] = i;
sz[i] = 1;
}
for (int i = _ - 1; i; --i) {
int s = i;
do {
if (cnt[s] && cnt[i ^ s]) {
int p = find(s), q = find(i ^ s);
if (p == q) continue;
sum += 1ll * (cnt[p] + cnt[q] - 1) * i;
if (sz[p] > sz[q]) swap(p, q);
fa[p] = q;
cnt[q] = 1;
sz[q] += sz[p];
}
} while (s = (s - 1) & i);
}
cout << sum;
return 0;
}
| 3,500 | CPP |
if __name__ == '__main__' :
n, k = map(int, input().split())
a = [int(num) for num in input().split()]
c = 0
for i in range(n) :
if a[i] <= k :
c = c+1
else :
break
a.reverse()
for i in range(n) :
if a[i] <= k :
c = c+1
else :
break
print(min(n,c)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[2], n, i, t, gcd(int, int);
int main() {
cin >> a[0] >> a[1] >> n;
for (i = 0;; i = 1 - i) {
t = gcd(a[i], n);
if (t > n) break;
n -= t;
}
cout << 1 - i;
return 0;
}
int gcd(int x, int y) {
int r;
for (; y;) {
r = x % y;
x = y;
y = r;
}
return x;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[71][71][36][71];
long long n, m, k;
long long tocal(long long num) {
if (num % k != 0)
return -1e9;
else
return 0;
}
long long vals[71][71];
long long calc(long long i, long long j, long long take, long long has) {
if (i >= n) {
return tocal(has);
}
if (j == m || take >= m / 2) {
long long num = -1e9;
if (has == 0) num = 0;
return max(calc(i + 1, 0, 0, has), num);
}
if (dp[i][j][take][has] != -1) {
return dp[i][j][take][has];
}
long long ret = -1e9;
if (has == 0) ret = 0;
if (take < m / 2)
ret =
max(ret, calc(i, j + 1, take + 1, (has + vals[i][j]) % k) + vals[i][j]);
ret = max(calc(i, j + 1, take, has), ret);
return dp[i][j][take][has] = ret;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> vals[i][j];
}
}
memset(dp, -1, sizeof(dp));
cout << calc(0, 0, 0, 0);
return 0;
}
| 2,100 | CPP |
test_cases = int(input())
def solve():
data = input().split(" ")
a = int(data[0])
b = int(data[1])
diff = abs(a-b)
min_moves = diff // 10
if diff % 10 != 0:
min_moves += 1
print(min_moves)
for i in range(test_cases):
solve()
| 800 | PYTHON3 |
w = int( input().strip() )
print( 'YES' if w > 2 and (w & 1) == 0 else 'NO' ) | 800 | PYTHON3 |
n,p,q,r = map(int,input().split())
x = list(map(int,input().split()))
p_max = []
q_max = []
r_max = []
p_max.append(p*x[0])
for i in range(1,n):
p_max.append(max(p_max[i-1],p*x[i]))
q_max.append(x[0]*q + p_max[0])
for i in range(1,n):
q_max.append(max(q_max[i-1],p_max[i]+x[i]*q))
ans = -10**30
for i in range(0,n):
ans = max(ans,r*x[i]+q_max[i])
print(ans)
| 1,500 | PYTHON3 |
Q = int(input())
Query = [list(map(int, input().split())) for _ in range(Q)]
for x, y in Query:
a = x-y
if a > 1:
print('YES')
else:
print('NO') | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l, r;
cin >> n >> l >> r;
long long x[n + 5], y[n + 5];
for (long long i = 1; i <= n; i++) {
cin >> x[i];
}
map<long long, long long> mp;
for (long long j = 1; j <= n; j++) {
cin >> y[j];
mp[y[j]] = j;
}
long long pre = -1e+16;
long long ans = true;
long long w[n + 5];
for (long long i = 1; i <= n; i++) {
long long o = pre + x[mp[i]] + 1;
long long c = max(l, o);
if (c > r) {
ans = false;
}
w[mp[i]] = c;
pre = w[mp[i]] - x[mp[i]];
}
if (ans == false) {
cout << "-1" << endl;
} else {
for (long long i = 1; i <= n; i++) {
cout << w[i] << " ";
}
cout << endl;
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 5;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
string s;
cin >> s;
vector<vector<int> > pf(3, vector<int>(s.size()));
vector<int> &x = pf[0], &y = pf[1], &z = pf[2];
for (int i = 0; i < s.size(); i++) pf[s[i] - 'x'][i]++;
for (auto &v : pf)
for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
l--, r--;
if (r - l + 1 < 3) {
cout << "YES\n";
continue;
}
int xs = x[r] - (l ? x[l - 1] : 0);
int ys = y[r] - (l ? y[l - 1] : 0);
int zs = z[r] - (l ? z[l - 1] : 0);
if (max({xs, ys, zs}) - min({xs, ys, zs}) >= 2)
cout << "NO\n";
else
cout << "YES\n";
}
}
| 1,500 | CPP |
def busca_binaria(vetor, elem):
inicio = 0
fim = len(vetor) - 1
while inicio <= fim:
meio = (inicio + fim) // 2
if (elem < vetor[meio]):
fim = meio - 1
elif (elem > vetor[meio]):
inicio = meio + 1
else:
inicio = meio
break
return inicio
input1 = input().split()
numDormitories = int(input1[0])
numLetters = int(input1[1])
dormitories = [int(c) for c in input().split()] #each elem represent the number of rooms for eache dormitory
dormitoriesSum = dormitories.copy()
for i in range(1, numDormitories):
dormitoriesSum[i] += dormitoriesSum[i-1]
letters = [int(c) for c in input().split()] #each elem represent the room number
for room in letters:
indDorm = busca_binaria(dormitoriesSum, room)
strPrint = str(indDorm + 1) + " "
somaAnt = 0
if (indDorm > 0):
somaAnt = dormitoriesSum[indDorm - 1]
correctRoom = room - somaAnt
strPrint += str(correctRoom)
print(strPrint)
| 1,000 | PYTHON3 |
a=int(input())
b=[]
for i in range(a):
k,l=map(int,input().split())
r=(24-k)*60-l
b.append(r)
for i in range(a):
print(b[i])
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
const int N = 100005;
void solve() {
long long n;
cin >> n;
long long ans = 1;
for (long long i = 2; i <= n; i++) {
ans = ans + 4 * (i - 1);
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| 800 | CPP |
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
s = sum(arr)
if(s>=4.5*n):
print(0)
else:
cnt = 0
for i in range(n):
cnt+=1
s = s-arr[i]+5
if(s>=4.5*n):
break
print(cnt) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
long long mul(long long x, long long y) { return ((x % M) * (y % M) % M); }
long long binpow(long long x, long long y) {
long long z = 1;
while (y) {
if (y & 1LL) z = mul(z, x);
x = mul(x, x);
y >>= 1LL;
}
return z;
}
long long inv(long long x) { return binpow(x, M - 2); }
long long divide(long long x, long long y) { return mul(x, inv(y)); }
long long x;
void solve() {
cin >> x;
int ans = 0;
long long sf = 1;
long long prev = 1;
while (sf <= x) {
++ans;
long long next = sf + prev;
prev = sf;
sf = next;
}
cout << ans - 1 << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int q, multicase = 0;
if (multicase)
cin >> q;
else
q = 1;
for (int i = 1; i <= q; ++i) solve();
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string x;
int i;
cin >> x;
for (i = 0; x[i]; i++) {
if (i == 0 && x[i] == 57)
x[i] = x[i];
else if (x[i] >= 53)
x[i] = (57 - x[i]) + 48;
cout << x[i];
}
return 0;
}
| 1,200 | CPP |
import os,io
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,m,x,y = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
i,j=0,0
s = 0
d = {}
while i<n and j<m:
if a[i]-x <= b[j] and a[i]+y >= b[j]:
s+=1
i+=1
j+=1
d[s]=(i,j)
elif b[j] < a[i]-x:
j+=1
elif b[j] > a[i]+y:
i+=1
print(s)
for i in range(1,s+1):
print(*d[i]) | 1,300 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
l=max(arr)
count=0
for i in range(len(arr)):
if arr[i]==l:
if i!=0:
for j in range(i,0,-1):
temp = arr[j]
arr[j]=arr[j-1]
arr[j-1]=temp
count=count+1
break
s=min(arr)
for i in range(len(arr)-1,0,-1):
if arr[i]==s:
if i!=len(arr)-1:
k=0
for j in range(i,n-1):
temp1= arr[j]
arr[j]=arr[j+1]
arr[j+1]=temp1
count=count+1
break
print(count)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2005;
void add(int& a, int b) {
a += b;
if (a >= mod) a -= mod;
}
int mul(int a, int b) { return 1ll * a * b % mod; }
int f[maxn][maxn], g[maxn][maxn], N, K;
string str;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", "r")) {
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
if (fopen(""
".inp",
"r")) {
freopen(
""
".inp",
"r", stdin);
freopen(
""
".out",
"w", stdout);
}
cin >> N >> K >> str;
str = " " + str;
f[0][0] = g[0][0] = 1;
for (int i = 1; i <= N; ++i) {
for (int j = 0; j <= K; ++j) {
add(f[i][j], mul(g[i - 1][j], str[i] - 'a'));
for (int k = i - 1; k >= 0 && j + (i - k) * (N + 1 - i) <= K; --k) {
add(f[i][j + (i - k) * (N + 1 - i)], mul(f[k][j], 'z' - str[i]));
}
add(g[i][j], f[i][j]);
add(g[i][j], g[i - 1][j]);
}
}
cout << g[N][K] << '\n';
}
| 2,500 | CPP |
a=input().split()
for i in range(len(a)):
if a[i]==a[i-1] or a[i]==a[i-2] or a[i]==a[i-3]:
a[i]='a'
print(a.count('a')) | 800 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
a1 = a.count(1)
a2 = a.count(2)
print([a2+(a1-a2)//3,min(a1,a2)][[a1,a2].index(max(a1,a2))]) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long c[100006], freq[100006], people[100006], h[100006];
long long catche[5005][505];
long long dp(long long left, long long pep) {
if (left == 0 || pep == 0) return 0;
long long &ans = catche[left][pep];
if (ans != -1) return ans;
ans = 0;
for (long long j = 1; j <= min(left, k); j++) {
ans = max(ans, h[j] + dp(left - j, pep - 1));
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
long long ans = 0;
long long i, j;
for (i = 1; i <= (n * k); i++) {
long long x;
cin >> x;
freq[x]++;
}
for (i = 1; i <= n; i++) {
long long x;
cin >> x;
people[x]++;
}
for (i = 1; i <= k; i++) {
cin >> h[i];
}
for (i = 1; i <= 100005; i++) {
if (!people[i]) {
continue;
}
for (j = 0; j <= freq[i]; j++) {
for (long long kk = 0; kk <= people[i]; kk++) {
catche[j][kk] = -1;
}
}
ans += dp(freq[i], people[i]);
}
cout << ans << '\n';
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long c = 0, i = 4 * n;
while (c < n) {
c++;
cout << i << " ";
i -= 2;
}
cout << endl;
}
return 0;
}
| 800 | CPP |
n = int(input())
lst = [int(i) for i in input().split()]
mat = []
for i in range(n):
a = lst[i]%2
mat.append([lst[i],a,(i+1)])
mat.sort(key = lambda k:k[1])
b = mat[1][1]
if b == 0:
print(mat[n-1][2])
else:
print(mat[0][2])
| 1,300 | PYTHON3 |
t=int(input())
for tc in range(t):
n,k=map(int,input().split())
li=list(map(int,input().split()))
li1=[]
li2=[]
p=max(li[::])
for i in li:
li1.append(p-i)
l=max(li1[::])
for i in li1:
li2.append(l-i)
if k==0:
for i in li:
print(i)
elif k%2!=0:
for i in li1:
print(i)
else:
for i in li2:
print(i)
| 800 | PYTHON3 |
string = input()
new_string = ''
c=0
for i in string:
if i not in new_string:
new_string = new_string + i
c=c+1
if c%2 == 0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!")
| 800 | PYTHON3 |
import math,heapq
from collections import defaultdict
for _ in range(int(input())):
n,w=map(int,input().split())
l=list(map(int,input().split()))
l.sort(reverse=True)
heap=[-w]
heapq.heapify(heap)
cnt=1
for i in range(n):
top=-heapq.heappop(heap)
if(top>l[i]):
top-=l[i]
heapq.heappush(heap,-top)
elif(top==l[i]):
if(len(heap)==0):
if(i==n-1):
continue
heapq.heappush(heap,-w)
cnt+=1
else:
cur=w-l[i]
heapq.heappush(heap,-cur)
heapq.heappush(heap,-top)
cnt+=1
print(cnt) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100001], st[100001], m;
void build(int n) {
a[0] = 1145141919;
for (m = 1; m < n + 2; m <<= 1)
;
for (int i = 1; i <= n; ++i) st[m + i] = i;
for (int i = m - 1; i; i--)
st[i] = a[st[i << 1]] < a[st[i << 1 | 1]] ? st[i << 1] : st[i << 1 | 1];
}
int rmq(int l, int r) {
int p = 0;
for (l += m - 1, r += m + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {
if (~l & 1) p = a[p] < a[st[l ^ 1]] ? p : st[l ^ 1];
if (r & 1) p = a[p] < a[st[r ^ 1]] ? p : st[r ^ 1];
}
return p;
}
int solve(int l, int r, int h) {
if (l > r) return 0;
int p = rmq(l, r);
return min(r - l + 1,
solve(l, p - 1, a[p]) + solve(p + 1, r, a[p]) + a[p] - h);
}
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
build(n);
cout << solve(1, n, 0) << endl;
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int RD() {
int res;
char cr;
while ((cr = getchar()) < '0' || cr > '9')
;
res = cr - '0';
while ((cr = getchar()) >= '0' && cr <= '9') res = res * 10 + cr - '0';
return res;
}
int tmp[305005];
int las[305005], pre[305005];
int dp[305005];
int ans;
int mx[305005 * 8], pv[305005 * 8];
void update(int p) {
mx[p] =
((mx[p << 1]) > (mx[(p << 1) | 1]) ? (mx[p << 1]) : (mx[(p << 1) | 1]));
}
void pushdown(int p) {
if (pv[p]) {
pv[p << 1] += pv[p];
pv[(p << 1) | 1] += pv[p];
mx[p << 1] += pv[p];
mx[(p << 1) | 1] += pv[p];
pv[p] = 0;
}
}
void setTree(int p, int l, int r) {
pv[p] = 0;
if (l == r) {
mx[p] = dp[l];
return;
}
int mid = (l + r) >> 1;
setTree(p << 1, l, mid);
setTree((p << 1) | 1, mid + 1, r);
update(p);
}
void modify(int p, int l, int r, int gl, int gr, int v) {
if (gr <= 0) return;
if (gl <= 0) gl = 1;
if (l == gl && r == gr) {
mx[p] += v;
pv[p] += v;
return;
}
pushdown(p);
int mid = (l + r) >> 1;
if (gr <= mid)
modify(p << 1, l, mid, gl, gr, v);
else if (gl > mid)
modify((p << 1) | 1, mid + 1, r, gl, gr, v);
else
modify(p << 1, l, mid, gl, mid, v),
modify((p << 1) | 1, mid + 1, r, mid + 1, gr, v);
update(p);
}
int query(int p, int l, int r, int gl, int gr) {
if (gr <= 0) return 0;
if (gl <= 0) gl = 1;
if (l == gl && r == gr) return mx[p];
pushdown(p);
int mid = (l + r) >> 1;
int res = 0;
if (gr <= mid)
res = query(p << 1, l, mid, gl, gr);
else if (gl > mid)
res = query((p << 1) | 1, mid + 1, r, gl, gr);
else {
res = query(p << 1, l, mid, gl, mid);
int r2 = query((p << 1) | 1, mid + 1, r, mid + 1, gr);
res = ((res) > (r2) ? (res) : (r2));
}
update(p);
return res;
}
int main() {
int n, K;
n = RD();
K = RD();
for (int i = 1; i <= n; i++) {
int val = RD();
pre[i] = las[val];
las[val] = i;
dp[i] = dp[i - 1] + (pre[i] == 0);
}
setTree(1, 1, n);
while (--K) {
for (int i = 1; i <= n; i++) tmp[i] = 0;
for (int i = 2; i <= n; i++) {
modify(1, 1, n, pre[i], i - 1, 1);
tmp[i] = query(1, 1, n, 1, i - 1);
}
for (int i = 1; i <= n; i++) dp[i] = tmp[i];
setTree(1, 1, n);
}
printf("%d\n", dp[n]);
}
| 2,200 | CPP |
a, b, c, d = map(int, input().split())
if (a + b == c + d or a + c == b + d or a + d == b + c or a + b + c == d or a + b + d == c or a + c + d == b or b + c + d == a):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
def f(a,b):
p = 1
while a!=b:
p = (p*a)%z
a -= 1
return p
def modinv(a,m):
p = 1
while m!=0:
if m%2:
p = (p*a)%z
m -= 1
else:
a = (a*a)%z
m //= 2
return p
k = int(input())
s = 0
ans = 1
z = 1000000007
for i in range(k):
c = int(input())
if i>0:
ans = (ans*f(s+c-1,c-1)*modinv(f(s,0),z-2))%z
s += c
print(ans) | 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 123, N = 1e3, inf = 1e9, mod = 1e9 + 7;
long long x, y, k, ans;
int main() {
ios_base::sync_with_stdio(false);
cin >> x >> y;
if (y == 1 && x > 0) {
cout << "NO";
return 0;
}
if (y != 0 && (x + y) % 2 == 1 && x >= y - 1 && (y - (x - 1)) % 2 == 0)
cout << "Yes";
else
cout << "No";
}
| 1,300 | CPP |
def main():
n, m = map(int, input().split())
edges = []
for _ in range(m):
edge = [int(x) for x in input().split()]
if edge[0] > edge[1]:
edge.reverse()
edges.append(edge)
if n < 7:
print(m)
return
# 7 verticies so two must have the same number
ecount = [0] * 8
for e1,e2 in edges:
ecount[e1] +=1
ecount[e2] +=1
best = 0
for i in range(1,8):
for j in range(1,8):
dom = m - ecount[i]
if [min(i,j), max(i,j)] in edges:
dom += 1
for k in range(1,8):
if k !=i and k != j and [min(i,k), max(i,k)] in edges and [min(j,k), max(j,k)] not in edges:
dom += 1
if dom > best:
best = dom
print(best)
if __name__ == "__main__":
main() | 1,700 | PYTHON3 |
a,b,c,d=map(int,input().split())
r=min(a,c,d)
k=min((a-r),b)
print((r*256)+(k*32)) | 800 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
A = list(map(int,input().split()))
a = A[0]+A[1]
if(A[-1]>=a):
print(1,2,n)
else:
print("-1")
| 800 | PYTHON3 |
from sys import stdin,stdout
def findops(l):
ans=0
count=1
for i in range(1,len(l)):
if l[i]>l[i-1]:
count+=1
else:
ans=max(ans,count)
count=1
return len(l)-max(ans,count)
for _ in range(int(stdin.readline())):
stdin.readline()
l=list(map(int,stdin.readline().split()))
print(findops(sorted(range(len(l)),key=lambda x:l[x]))) | 2,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int kN = 1 << 17;
const int kK = 5;
vector<int> g[kN];
struct Dsu {
vector<int> p;
vector<int> to_del;
Dsu() : p(kN) {
for (int i = 0; i < p.size(); ++i) {
p[i] = i;
}
}
int Get(int u) { return u == p[u] ? u : (p[u] = Get(p[u])); }
bool Unite(int u, int v) {
u = Get(u);
v = Get(v);
if (u == v) {
return false;
}
if (rand() & 1) {
swap(u, v);
}
p[u] = v;
to_del.push_back(u);
return true;
}
void Reset() {
for (int x : to_del) {
p[x] = x;
}
to_del.clear();
}
};
Dsu dsu;
struct Node {
int lp[kK];
int rp[kK];
int from;
int to;
int cnt;
Node() : from(0), to(0), cnt(0) {
memset(lp, 255, sizeof(lp));
memset(rp, 255, sizeof(rp));
}
};
Node Combine(const Node& lhs, const Node& rhs) {
Node res;
res.cnt = lhs.cnt + rhs.cnt;
for (int i = 0; i < kK; ++i) {
if (lhs.from + i <= lhs.to) {
dsu.Unite(lhs.from + i, lhs.lp[i]);
}
if (lhs.to - i >= lhs.from) {
dsu.Unite(lhs.to - i, lhs.rp[i]);
}
if (rhs.from + i <= rhs.to) {
dsu.Unite(rhs.from + i, rhs.lp[i]);
}
if (rhs.to - i >= rhs.from) {
dsu.Unite(rhs.to - i, rhs.rp[i]);
}
}
for (int i = 0; i < kK; ++i) {
if (lhs.to - i < lhs.from) {
continue;
}
int u = lhs.to - i;
for (int v : g[u]) {
if (rhs.from <= v && v <= rhs.to) {
res.cnt -= dsu.Unite(u, v);
}
}
}
res.from = lhs.from;
res.to = rhs.to;
for (int i = 0; i < kK; ++i) {
if (res.from + i <= res.to) {
res.lp[i] = dsu.Get(res.from + i);
}
if (res.to - i >= res.from) {
res.rp[i] = dsu.Get(res.to - i);
}
}
dsu.Reset();
return res;
}
struct SegmentTree {
vector<Node> a;
SegmentTree() : a(2 * kN - 1) { Build(); }
void Build(int ind = 0, int tl = 0, int tr = kN - 1) {
if (tl == tr) {
a[ind].cnt = 1;
a[ind].lp[0] = a[ind].rp[0] = a[ind].from = a[ind].to = tl;
return;
}
int tm = (tl + tr) >> 1;
Build(ind * 2 + 1, tl, tm);
Build(ind * 2 + 2, tm + 1, tr);
a[ind] = Combine(a[ind * 2 + 1], a[ind * 2 + 2]);
}
Node Rsq(int l, int r, int ind = 0, int tl = 0, int tr = kN - 1) {
if (l == tl && r == tr) {
return a[ind];
}
int tm = (tl + tr) >> 1;
if (r <= tm) {
return Rsq(l, r, ind * 2 + 1, tl, tm);
} else if (tm + 1 <= l) {
return Rsq(l, r, ind * 2 + 2, tm + 1, tr);
} else {
return Combine(Rsq(l, tm, ind * 2 + 1, tl, tm),
Rsq(tm + 1, r, ind * 2 + 2, tm + 1, tr));
}
}
};
int main() {
std::ios_base::sync_with_stdio(false);
int n, k, m;
cin >> n >> k >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
g[u - 1].push_back(v - 1);
g[v - 1].push_back(u - 1);
}
SegmentTree st;
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
cout << st.Rsq(l - 1, r - 1).cnt << '\n';
}
return 0;
}
| 2,900 | CPP |
t = int(input())
for i in range(t):
dic = {}
n = int(input())
for j in range(n):
st = input()
for s in st:
if s in dic:
dic[s] += 1
else:
dic[s] = 1
for j in dic.values():
if j % n != 0:
print('NO')
break
else:
print('YES')
| 800 | PYTHON3 |
# https://codeforces.com/problemset/problem/231/A
# Жадный алгоритм — алгоритм, заключающийся в принятии локально оптимальных решений на каждом этапе,
# допуская, что конечное решение также окажется оптимальным.
total_issues = input()
#print(total_issues)
issues_to_solve = 0
for issue in range(int(total_issues)):
solutions = input()
solutionsArr = solutions.split(" ")
a, b, c = int(solutionsArr[0]), int(solutionsArr[1]), int(solutionsArr[2])
if((a + b + c) >= 2):
issues_to_solve += 1
print(issues_to_solve)
| 800 | PYTHON3 |
import math
t = int(input())
for _ in range(t):
n = int(input())
h = (math.sqrt(24*n + 1) - 1) // 6
num = 0
while(h >= 1):
num += 1
n -= (3*(h**2) + h)/2
h = (math.sqrt(24*n + 1) - 1) // 6
print(num) | 1,100 | PYTHON3 |
import os
inp=os.read(0,os.fstat(0).st_size).split(b"\n");_ii=-1
def rdln():
global _ii
_ii+=1
return inp[_ii]
inin=lambda typ=int: typ(rdln())
inar=lambda typ=int: [typ(x) for x in rdln().split()]
inst=lambda: rdln().strip().decode()
#INF=float('inf')
#from collections import deque as que, defaultdict as vector, Counter
#from bisect import bisect
#from heapq import heapify, heappush as hpush, heappop as hpop
from types import GeneratorType
def recursive(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack: return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to); to = next(to)
else:
stack.pop()
if not stack: break
to = stack[-1].send(to)
return to
return wrappedfunc
n,m=0,0
maze=[]
dx=[-1,1,0,0]
dy=[0,0,-1,1]
@recursive
def dfs(i,j,visited):
visited[i][j]=True
for delta in range(4):
x=j+dx[delta]
y=i+dy[delta]
if x>=0 and y>=0 and x<m and y<n and visited[y][x]==False:
#print(x,y)
if maze[y][x]=='.' or maze[y][x]=='G':
yield dfs(y,x,visited)
yield
Gloc=[]
Testcase=inin()
for _ in range(Testcase):
Gloc=[]
n,m=inar()
maze=['' for i in range(n)]
for i in range(n):
maze[i]=list(inst())
pasapasi=False
for i in range(n):
for j in range(m):
if maze[i][j]=='G':
Gloc.append((i,j))
if maze[i][j]=='B':
for delta in range(4):
x=j+dx[delta]
y=i+dy[delta]
if x>=0 and y>=0 and x<m and y<n:
if maze[y][x]=='G':
pasapasi=True
break
if maze[y][x]=='.':
maze[y][x]='#'
if pasapasi:
print('No')
elif maze[n-1][m-1]=="#":
if Gloc==[]:
print('Yes')
else:
print('No')
else:
visited=[[False for j in range(m)] for i in range(n)]
dfs(n-1,m-1,visited)
cond=True
for i,j in Gloc:
cond = cond and visited[i][j]
if cond:
print('Yes')
else:
print('No') | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int roundup = round(sqrt(n));
long long int root = sqrt(n);
double droot = sqrt(n);
long long int ans = roundup + (root - 1);
if (droot == root) {
ans = (root - 1) + (root - 1);
cout << ans << endl;
continue;
}
cout << ans << endl;
}
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, SG[200005], Mx, h[200005], sum[200005];
bool vis[200005];
int fir[200005], nxt[200005], to[200005], tot;
inline void line(int x, int y) {
nxt[++tot] = fir[x];
fir[x] = tot;
to[tot] = y;
}
void dfs(int u) {
for (int i = fir[u]; i; i = nxt[i])
if (!SG[to[i]]) dfs(to[i]);
for (int i = fir[u]; i; i = nxt[i]) vis[SG[to[i]]] = 1;
int x = 1;
while (vis[x] == 1) x++;
Mx = max(Mx, SG[u] = x), sum[x] ^= h[u];
for (int i = fir[u]; i; i = nxt[i]) vis[SG[to[i]]] = 0;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &h[i]);
for (int i = 1, x, y; i <= m; i++) scanf("%d%d", &x, &y), line(x, y);
for (int i = 1; i <= n; i++)
if (!SG[i]) dfs(i);
for (int k = Mx, id = 0; k >= 1; k--)
if (sum[k]) {
for (int i = 1; i <= n; i++)
if (SG[i] == k && (h[i] ^ sum[k]) < h[i]) id = i;
h[id] ^= sum[k];
for (int i = fir[id]; i; i = nxt[i])
if (!vis[SG[to[i]]]) h[to[i]] ^= sum[SG[to[i]]], vis[SG[to[i]]] = 1;
puts("WIN");
for (int i = 1; i <= n; i++) printf("%d%c", h[i], i == n ? 10 : 32);
return 0;
}
puts("LOSE");
}
| 3,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
long long n, i, j;
cin >> n;
vector<long long> v(n / 2);
for (i = 0; i < v.size(); i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
long long mn = LLONG_MAX;
j = 1;
long long ans = 0;
for (i = 0; i < v.size(); i++) {
ans += abs(j - v[i]);
j += 2;
}
mn = ans;
reverse(v.begin(), v.end());
ans = 0;
j = n;
for (i = 0; i < v.size(); i++) {
ans += abs(j - v[i]);
j -= 2;
}
cout << min(mn, ans);
return 0;
}
| 1,100 | CPP |
n = int(input())
c = [int(x) for x in input().split()]
a, b = 0, 0
ai, bi = -1, n
while ai < bi - 1:
if a <= b:
ai += 1
a += c[ai]
else:
bi -= 1
b += c[bi]
print(ai + 1, n - bi)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 110;
vector<int> v;
map<string, int> mp;
int a[MAX];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
string s;
cin >> s;
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++) {
int tmp = it->second;
v.push_back(tmp);
}
sort(v.begin(), v.end());
long long ans1 = 0, ans2 = 0;
int t = 0;
for (int i = v.size() - 1; i >= 0; i--) {
ans1 += a[t] * v[i];
t++;
}
t = n - 1;
for (int i = v.size() - 1; i >= 0; i--) {
ans2 += v[i] * a[t];
t--;
}
cout << ans1 << " " << ans2;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int n, k, c[1000005];
bool chek(int awa) {
for (int i = 1; i <= n; i++)
if (c[i] % awa == 0) return true;
return false;
}
bool check() {
for (int i = 2; i * i <= k; i++) {
if (k % i == 0) {
int now = 1;
while (k % i == 0) {
now *= i;
k /= i;
}
if (!chek(now)) return false;
}
}
if (k != 1)
if (!chek(k)) return false;
return true;
}
int main() {
n = read(), k = read();
for (int i = 1; i <= n; i++) c[i] = read();
if (check())
printf("Yes");
else
printf("No");
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int i = 0;
double d = 0;
for (i = 1; i <= m; i++) {
d += (double)i *
((double)pow((double)i / m, n) - (double)pow((double)(i - 1) / m, n));
}
printf("%.11lf", d);
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int uu, vv;
long long dis;
} v[20005], temp;
int flag[10005], fm = 0, n, m, root[1005], fa[20005], s, t;
long long ans[1005];
bool life[1005];
queue<int> q;
void go() {
int now, tt;
memset(ans, 0, sizeof(ans));
ans[s] = 1;
q.push(s);
life[s] = 1;
while (!q.empty()) {
now = q.front();
q.pop();
tt = root[now];
life[now] = 0;
while (tt) {
if (ans[now] + v[tt].dis < ans[v[tt].vv] || !ans[v[tt].vv]) {
ans[v[tt].vv] = ans[now] + v[tt].dis;
if (!life[v[tt].vv]) {
life[v[tt].vv] = 1;
q.push(v[tt].vv);
}
}
tt = fa[tt];
}
}
return;
}
void ok() {
printf("YES\n");
for (int i = 1; i <= m; i++) {
printf("%d %d %I64d\n", v[i].uu, v[i].vv, v[i].dis);
}
}
int main() {
long long L, dis;
int uu, vv;
int nl = 1, nr = L, mid;
cin >> n >> m >> L >> s >> t;
for (int i = 1; i <= m; i++) {
scanf("%d%d%I64d", &uu, &vv, &dis);
temp.uu = uu;
temp.vv = vv;
temp.dis = dis;
v[i] = temp;
if (dis == 0) flag[fm++] = i;
fa[i] = root[uu];
root[uu] = i;
temp.uu = vv;
temp.vv = uu;
v[i + m] = temp;
fa[i + m] = root[vv];
root[vv] = i + m;
}
L++;
for (int i = 0; i < fm; i++) v[flag[i]].dis = v[flag[i] + m].dis = 1;
go();
if (ans[t] == L)
ok();
else {
if (ans[t] > L)
printf("NO\n");
else {
for (int i = 0; i < fm; i++) v[flag[i]].dis = v[flag[i] + m].dis = L;
go();
if (ans[t] == L)
ok();
else {
if (ans[t] < L)
printf("NO\n");
else {
for (int i = 0; i < fm; i++) {
v[flag[i]].dis = v[flag[i] + m].dis = 1;
go();
if (ans[t] <= L) {
if (ans[t] == L)
ok();
else {
nl = 1;
nr = L;
while (1) {
mid = (nl + nr) / 2;
v[flag[i]].dis = v[flag[i] + m].dis = mid;
go();
if (ans[t] == L) {
ok();
break;
} else {
if (ans[t] < L)
nl = mid;
else
nr = mid;
}
}
}
break;
}
}
}
}
}
}
return 0;
}
| 2,300 | CPP |
import math
def divisors(n,l) :
list = []
for i in range(2, int(math.sqrt(n) + 1)) :
if (n % i == 0) :
if (n / i == i) :
l.append(i)
else :
l.append(i)
list.append(int(n / i))
# The list will be printed in reverse
for i in list[::-1] :
l.append(i)
for _ in range(int(input())):
n=int(input())
if n%2==0:
print(n//2)
continue
l=[]
divisors(n,l)
if not l or max(l)<(n-1)//2:
print(n//2)
else:
print(max(l))
| 800 | PYTHON3 |
# cook your dish here
try:
print(['Malvika','Akshat'][min(map(int,input().split()))%2])
except:
pass | 900 | PYTHON3 |
def solve():
N = int(input())
S = input()
ans = 0
for i in range(1,N+1):
if int(S[i-1]) % 2 == 0:
ans += i
print (ans)
if __name__ == "__main__":
solve() | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int mod = (long long int)1e9 + 7;
int n;
void solve() {
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
map<long long int, long long int> map;
map[0]++;
long long int sum = 0ll, ans = 0;
for (auto x : a) {
sum += x;
if (map[sum]) {
map.clear();
++ans;
++map[sum - x];
++map[sum];
continue;
}
map[sum]++;
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tests;
solve();
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string a;
cin >> a;
int open = 0;
int close = 0;
for (int i = 0; i < n; i++) {
if (a[i] == '(') {
open++;
} else {
close++;
}
}
if (open != close) {
cout << -1 << endl;
return 0;
}
stack<char> s;
open = 0;
close = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (s.empty()) {
s.push(a[i]);
if (a[i] == '(')
open++;
else
close++;
} else {
char temp = s.top();
if (true) {
s.push(a[i]);
if (a[i] == '(') {
open++;
} else {
close++;
}
}
if (open == close) {
vector<char> ch;
while (!s.empty()) {
ch.push_back(s.top());
s.pop();
}
stack<char> stemp;
for (int i = 0; i < ch.size(); i++) {
if (stemp.empty()) {
stemp.push(ch[i]);
} else {
char ttemp = stemp.top();
if (ttemp == ')' && ch[i] == '(') {
stemp.pop();
} else {
stemp.push(ch[i]);
}
}
}
if (stemp.size()) {
ans += ch.size();
}
open = 0;
close = 0;
}
}
}
cout << ans << endl;
return 0;
}
| 1,300 | CPP |
a1=input()
c=0
d=0
for i in range(len(a1)):
if a1[i]=='0':
c=c+1
d=0
if c>=7:
print("YES")
break
else:
d=d+1
c=0
if d>=7:
print("YES")
break
if c<7 and d<7:
print("NO") | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], lo[N], hi[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (a[i] >= 0) {
lo[i] = a[i] / 2;
} else {
lo[i] = a[i] / 2 - (a[i] % 2 ? 1 : 0);
}
hi[i] = lo[i] + (a[i] % 2 ? 1 : 0);
sum += lo[i];
}
for (int i = 1; i <= n; ++i) {
if (sum < 0 and lo[i] < hi[i]) {
lo[i] = hi[i];
++sum;
}
cout << lo[i] << '\n';
}
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, l, m, n;
while (cin >> n) {
long long sum = 0, ans = n - 1;
map<long long, long long> arr;
for (i = 1; i <= n; i++) {
long long input;
cin >> input;
sum += input;
arr[sum]++;
ans = min(ans, n - arr[sum]);
}
cout << ans << endl;
}
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long Maxn = 1e6 + 7;
const long long Max = 1e3 + 7;
const long long Inf = 1e9 + 7;
vector<int> V[Maxn];
int atk[Maxn], h[Maxn], dis, pos, e;
void dfs(int u, int par = 0) {
for (int i = 0; i < V[u].size(); i++) {
int v = V[u][i];
if (v != par) {
h[v] = h[u] + 1;
dfs(v, u);
if (atk[v] && dis <= h[v]) pos = v, dis = h[v];
atk[u] |= atk[v];
}
}
if (atk[u]) e++;
}
void DFS(int u, int par = 0) {
for (int i = 0; i < V[u].size(); i++) {
int v = V[u][i];
if (v != par) {
h[v] = h[u] + 1;
if (atk[v]) dis = max(dis, h[v]);
DFS(v, u);
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
V[u].push_back(v);
V[v].push_back(u);
}
int x;
for (int i = 0; i < m; i++) {
cin >> x;
atk[x] = 1;
}
pos = x;
dfs(x);
h[pos] = 0;
dfs(pos);
h[pos] = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
if (atk[i])
if (h[i] == 0 || h[i] == dis) {
ans = i;
break;
}
DFS(pos);
for (int i = 1; i <= n; i++)
if (atk[i])
if (h[i] == 0 || h[i] == dis) {
ans = min(i, ans);
break;
}
cout << ans << endl << e - 2 - dis << endl;
}
| 2,200 | CPP |
x,y=1,2
z=3
for i in range(int(input())):
a=int(input())
if a ==x :
k=y
y=z
z=k
continue
elif a==y:
k=x
x=z
z=k
continue
else:
print("NO")
exit()
print("YES") | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m, s, d;
cin >> n >> m >> s >> d;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (arr[0] - 1 < s) {
cout << "IMPOSSIBLE";
return 0;
}
if (d == 1) {
cout << "IMPOSSIBLE";
return 0;
}
int i = 0;
bool was_impossible = false;
vector<pair<string, int>> g;
int k = 0;
int last;
while (i < n) {
if (i == 0) {
g.push_back(make_pair("RUN ", arr[i] - 1));
} else {
g.push_back(make_pair("RUN ", arr[i] - arr[i - 1] - 2));
}
if (arr[i + 1] - arr[i] - 2 >= s || i == n - 1) {
g.push_back(make_pair("JUMP ", 2));
last = arr[i] + 1;
i++;
continue;
}
for (int j = i + 1; j <= n - 1; j++) {
if (arr[j] - arr[i] + 2 <= d &&
(j == n - 1 || arr[j + 1] - arr[j] - 2 >= s)) {
g.push_back(make_pair("JUMP ", arr[j] - arr[i] + 2));
last = arr[j] + 1;
i = j + 1;
break;
}
if (j == n - 1) {
cout << "IMPOSSIBLE";
was_impossible = true;
return 0;
}
}
}
if (m - last != 0) {
g.push_back(make_pair("RUN ", m - last));
}
if (was_impossible) {
cout << "IMPOSSIBLE";
return 0;
}
for (vector<pair<string, int>>::iterator it = g.begin(); it != g.end();
++it) {
cout << it->first << it->second << endl;
}
return 0;
}
| 1,600 | CPP |
n, s = int(input()) - 3, input()
d, m = 'ACTG', 10000000000000
for i in range(n):
c = 0
for j in range(i, i + 4):
c += min(abs(ord(s[j]) - ord(d[j - i])), 26 - abs(ord(s[j]) - ord(d[j - i])))
m = min(m, c)
print(m)
| 1,000 | PYTHON3 |
w=input()
w=list(w)
c=0
a=[]
for i in range(len(w)):
if(w[i] not in a):
a.append(w[i])
if(len(a)%2==0):
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dp[222][222], n, k, val[222], t[222];
vector<int> g[222];
inline void dfs(int x, int par = 0) {
dp[x][0] = val[x];
for (int to : g[x]) {
if (to == par) continue;
dfs(to, x);
memset(t, 0, sizeof(t));
for (int i = 0; i <= k; ++i)
for (int j = k - i; j <= k; ++j)
t[min(i, j + 1)] = max(t[min(i, j + 1)], dp[x][i] + dp[to][j]);
for (int j = k; ~j; --j) dp[x][j] = max(dp[x][j + 1], t[j]);
}
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> val[i];
for (int i = 1, u, v; i < n; ++i)
cin >> u >> v, g[u].push_back(v), g[v].push_back(u);
dfs(1);
cout << dp[1][0] << endl;
}
| 2,200 | CPP |
n,k=map(int,input().split())
s=list(map(int,input().split()))
a=0
for i in range(n):
if 5-s[i]>=k:
a+=1
print(a//3) | 800 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
s=0
for i in range(len(a)):
s+=a[i]
min=int(s/2)+1
coll,j=0,0
while coll<min:
coll+=a[j]
j+=1
print(j)
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char s[9][9];
int x, y, n, a, b, h;
int main() {
for (int i = 0; i < 9; i++)
for (int j = 0; j < 9; j++) {
cin >> s[i][j];
if (s[i][j] == ' ' && i % 3 == 0 && i != 0) {
i--;
break;
}
if (s[i][j] == ' ' && j % 3 == 0) j--;
}
cin >> x >> y;
x--;
y--;
x %= 3;
y %= 3;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (s[(x * 3) + i][(y * 3) + j] == '.') n = 1;
}
}
if (n == 0) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (s[i][j] == '.') s[i][j] = '!';
}
}
} else {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (s[x * 3 + i][y * 3 + j] == '.') s[x * 3 + i][y * 3 + j] = '!';
}
}
}
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (i % 3 == 0 && i != 0 && b == 0) {
b = 1;
i--;
break;
}
if (j % 3 == 0 && a == 0 && j != 0) {
a = 1;
cout << ' ';
j--;
continue;
} else
a = 0;
cout << s[i][j];
}
if (b == 1) h++;
if (h == 2) {
b = 0;
h = 0;
}
cout << endl;
}
return 0;
}
| 1,400 | CPP |
t=int(input())
for i in range(t):
n=int(input())
tc=0
fc=0
sc=0
if n%3==0:
tc+=n//3
print(tc,fc,sc)
elif n%5==0:
fc+=n//5
print(tc,fc,sc)
elif n%7==0:
sc+=n//7
print(tc,fc,sc)
elif n<5:
print(-1)
else:
if (n%10)%3==0:
fc=(n//10)*2
tc=(n%10)//3
print(tc,fc,sc)
elif (n%10)==7:
fc=(n//10)*2
sc=1
print(tc,fc,sc)
elif (n%10)==8:
fc=(n//5)
tc=1
print(tc,fc,sc)
else:
fc=(n//5)-1
temp=n-(5*fc)
if temp%3==0:
tc=temp/3
elif temp%7==0:
sc=temp/7
print(int(tc),int(fc),int(sc)) | 900 | PYTHON3 |
import bisect
from collections import Counter
def main(a):
s = sum(a)
n = len(a)
if s % n != 0:
return -1
m = s // n
ct = sum(1 if x > m else 0 for x in a)
return ct
if __name__ == '__main__':
t = int(input())
outputs = []
for _ in range(t):
n = int(input())
# s = input()
arr = list(map(int, input().split(" ")))
output = main(arr)
outputs.append(output)
for o in outputs:
print(o)
| 0 | PYTHON3 |
n=int(input())
def ispersqr(a):
sr=a**0.5
if sr - int(sr)==0:
return int(sr)
else:
return 0
ch=ispersqr(n)
if ch:
print(ch,ch)
else:
l=[i for i in range(2,int(n/2)+1) if n%i==0]
p=len(l)
if p==0:
print(1,n)
else:
q=int(p/2)
print(l[q-1],l[q]) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) { return n | (1LL << i); }
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline double dist(double ix, double iy, double jx, double jy) {
return sqrt(((ix - jx) * (ix - jx)) + ((iy - jy) * (iy - jy)));
}
int marked[1000000 / 64 + 2];
bool isPrime(int x) {
return (x > 1) &&
((x == 2) ||
((x & 1) && (!((marked[x >> 6] & (1 << ((x & 63) >> 1)))))));
}
void seive(int n) {
int i, j;
for (i = 3; i * i <= n; i += 2) {
if (!(marked[i >> 6] & (1 << ((i & 63) >> 1)))) {
for (j = i * i; j <= n; j += i << 1) {
marked[j >> 6] |= (1 << ((j & 63) >> 1));
}
}
}
}
long long bigMod(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1) (r *= a) %= 1000000007;
b >>= 1;
(a *= a) %= 1000000007;
}
return r;
}
double fc[100007], sum[100007], ans[100007];
vector<int> edge[100007];
int sz[100007];
int dfs(int i) {
sz[i] = 1;
for (int k = 0; k < edge[i].size(); k++) sz[i] += dfs(edge[i][k]);
return sz[i];
}
void cal(int i) {
int tot = sz[i] - 1;
int s = edge[i].size();
for (int k = 0; k < edge[i].size(); k++) {
ans[edge[i][k]] = (tot - sz[edge[i][k]]) / 2.0 + ans[i] + 1;
cal(edge[i][k]);
}
}
int main() {
int i, n, x;
fc[0] = 1;
for (i = 1; i <= 100000; i++) {
fc[i] = fc[i - 1] * i;
sum[i] = fc[i] + sum[i - 1];
}
scanf("%d", &n);
for (i = 2; i <= n; i++) {
scanf("%d", &x);
edge[x].push_back(i);
}
dfs(1);
ans[1] = 1.0;
cal(1);
for (i = 1; i <= n; i++) printf("%.1lf ", ans[i]);
printf("\n");
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 1;
const int mod = 998244353;
vector<int> g[N];
long long d[N][2][2];
int n;
void dfs(int cur, int p) {
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j) d[cur][i][j] = 1;
long long tmp = 1;
for (auto nxt : g[cur])
if (nxt != p) {
dfs(nxt, cur);
long long sum = 0;
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j) sum += d[nxt][i][j];
(d[cur][1][0] *= sum) %= mod;
(d[cur][1][1] *= (sum - d[nxt][1][1])) %= mod;
(tmp *= (d[nxt][0][0] + d[nxt][0][1])) %= mod;
}
d[cur][0][0] = d[cur][1][0];
d[cur][0][1] = ((d[cur][1][1] - tmp) % mod + mod) % mod;
}
long long pw(long long base, long long p) {
long long ret = 1;
while (p) {
if (p & 1) ret = ret * base % mod;
base = base * base % mod;
p >>= 1;
}
return ret;
}
int main() {
while (~scanf("%d", &n)) {
for (int i = 1; i <= n - 1; ++i) {
int u, v;
scanf("%d %d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, 1);
printf("%lld\n", ((d[1][0][0] + d[1][0][1] - 1) % mod + mod) % mod);
for (int i = 1; i <= n; ++i) g[i].clear();
}
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
string x[3];
int getWin(char c) {
int ans = 0;
if (x[0][0] == x[0][1] && x[0][1] == x[0][2] && x[0][0] == c) ans++;
if (x[0][0] == x[1][1] && x[1][1] == x[2][2] && x[0][0] == c) ans++;
if (x[0][0] == x[1][0] && x[1][0] == x[2][0] && x[0][0] == c) ans++;
if (x[2][0] == x[2][1] && x[2][1] == x[2][2] && x[2][0] == c) ans++;
if (x[0][2] == x[1][2] && x[1][2] == x[2][2] && x[0][2] == c) ans++;
if (x[2][0] == x[1][1] && x[1][1] == x[0][2] && x[2][0] == c) ans++;
if (x[0][1] == x[1][1] && x[1][1] == x[2][1] && x[0][1] == c) ans++;
if (x[1][0] == x[1][1] && x[1][1] == x[1][2] && x[1][0] == c) ans++;
return ans;
}
int main() {
int xc = 0, oc = 0;
for (int i = 0; i < 3; i++) {
cin >> x[i];
for (int j = 0; j < 3; j++) {
if (x[i][j] == 'X') xc++;
if (x[i][j] == '0') oc++;
}
}
if (xc - oc > 1 || oc > xc) {
cout << "illegal" << endl;
return 0;
}
int xw = getWin('X');
int ow = getWin('0');
if (xw == 1 && ow == 1) {
cout << "illegal" << endl;
return 0;
}
if (xw >= 1) {
if (xc > oc)
cout << "the first player won" << endl;
else
cout << "illegal" << endl;
return 0;
}
if (ow >= 1) {
if (xc == oc)
cout << "the second player won" << endl;
else
cout << "illegal" << endl;
return 0;
}
if (xc + oc == 9) {
cout << "draw" << endl;
return 0;
}
if (xc == oc) {
cout << "first" << endl;
return 0;
}
cout << "second" << endl;
return 0;
}
| 1,800 | CPP |
from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import bisect_left as bl, bisect_right as br, bisect
mod = pow(10, 9) + 7
mod2 = 998244353
def inp(): return stdin.readline().strip()
def out(var, end="\n"): stdout.write(str(var)+"\n")
def outa(*var, end="\n"): stdout.write(' '.join(map(str, var)) + end)
def lmp(): return list(mp())
def mp(): return map(int, inp().split())
def smp(): return map(str, inp().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
def remadd(x, y): return 1 if x%y else 0
def ceil(a,b): return (a+b-1)//b
def isprime(x):
if x<=1: return False
if x in (2, 3): return True
if x%2 == 0: return False
for i in range(3, int(sqrt(x))+1, 2):
if x%i == 0: return False
return True
for _ in range(int(inp())):
n = int(inp())
arr = lmp()
ind = 0
k = 2
mx = arr[0]
mn = arr[0]
for i in range(1, n):
if abs(arr[i]-arr[i-1])>1:
print("YES")
print(i, i+1)
break
else:
print("NO") | 1,200 | PYTHON3 |
from collections import Counter
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
##########################################################
def dice():
dp = [0] * (n + 1)
dp[1] = 1
dp[0] = 1
for i in range(2, n + 1):
for j in range(1, 7):
if i - j >= 0:
dp[i] = (dp[i] + dp[i - j]) % (10 ** 9 + 7)
else:
break
#for _ in range(int(input())):
#import math
import sys
# from collections import deque
#from collections import Counter
# ls=list(map(int,input().split()))
# for i in range(m):
# for i in range(int(input())):
#n,k= map(int, input().split())
#arr=list(map(int,input().split()))
#n=sys.stdin.readline()
#n=int(n)
#n,k= map(int, input().split())
#arr=list(map(int,input().split()))
# n = int(inaput())
# for _ in range(int(input())):
import math
# arr=list(map(int,input().split()))
# for _ in range(int(input())):
'''n, k = map(int, input().split())
arr = list(map(int, input().split()))
q = []
for i in range(k):
l, r = map(int, input().split())
q.append((l, r))
q.sort()
ans = []
for i in range(q[0], q[1]):'''
from collections import Counter
n=int(input())
arr = list(map(int, input().split()))
var=sum(arr)
c=Counter(arr)
cnt=0
ans=[]
for i in range(n):
cn=var-arr[i]
if cn%2==0:
if cn//2 in c:
if arr[i]!=cn//2:
cnt+=1
ans.append(i+1)
else:
if c[cn//2]>1:
cnt+=1
ans.append(i+1)
print(cnt)
if cnt>0:
print(*ans)
| 1,300 | PYTHON3 |
x=int(input())
for z in range(x):
a=int(input())
l=list(map(int,input().split()))
c=l.copy()
c.sort()
if l==c or l==c[::-1]:
print(0)
else:
l=l[::-1]
b=[]
for i in range(a-1):
b.append(l[i]-l[i+1])
#print(l,b)
k=q=0
if b[0]==0:
i=0
while b[i]==0:
i+=1
k=i
#print("i= ",i)
b=b[k:]
#print("b= ",b)
q=k
if b[0]<0:
y=0
for i in range(1,len(b)):
if y==1 and b[i]<0:
#print("k =",k)
k=k+i
break
elif y==0 and b[i]>0:
y=1
if k==q:
k=k+len(b)
print(a-k-1)
elif b[0]>0:
i=0
while b[i]>=0:
i+=1
k=k+i
print(a-k-1) | 1,200 | PYTHON3 |
n, m =map(int, input().split())
sp=list(map(int, input().split()))
if n>m:
print(0)
exit()
ans=1
for i in range(n-1):
for j in range(i+1, n):
ans*= abs(sp[i]-sp[j])
ans%=m
print(ans)
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int const mxn = 5e5 + 10;
vector<int> adj[mxn], v1, v2;
set<int> x, y;
vector<vector<int> > ans;
int mark[mxn];
int main() {
ios_base::sync_with_stdio(false);
int n, m, v;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
if (mark[i] == 2) continue;
v1.clear();
v = i;
mark[v] = 2;
v1.push_back(v);
for (int j = 1; j <= n; j++) {
if (mark[j] == 0) y.insert(j);
}
while (true) {
v2.clear();
for (int j = 0; j < adj[v].size(); j++) {
int u = adj[v][j];
if (!mark[u]) mark[u] = 1;
}
for (auto j : y) {
if (mark[j] == 0) {
mark[j] = 1;
x.insert(j);
v2.push_back(j);
} else
mark[j] = 0;
}
for (int p = 0; p < v2.size(); p++) y.erase(v2[p]);
if (x.size() == 0) break;
v = *x.begin();
mark[v] = 2;
v1.push_back(v);
x.erase(x.begin());
}
y.clear();
ans.push_back(v1);
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); i++) {
cout << ans[i].size() << " ";
for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j] << " ";
cout << "\n";
}
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 * 3 + 5;
vector<pair<int, pair<int, int> > > graph[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
int u, v, w;
for (int i = 1; i <= m; ++i) {
cin >> u >> v >> w;
graph[u].push_back(make_pair(v, make_pair(w, i)));
graph[v].push_back(make_pair(u, make_pair(w, i)));
}
set<pair<long long int, int> > Q;
vector<long long int> dist(N, (long long int)1e18);
dist[1] = 0;
Q.insert(make_pair(0, 1));
vector<int> pos(N, 0);
int cnt = 0;
vector<int> ans;
while (!Q.empty() && cnt < k) {
auto t = *Q.begin();
Q.erase(Q.begin());
int node = t.second;
if (node != 1) {
ans.push_back(pos[node]);
cnt++;
}
for (auto x : graph[node]) {
int to = x.first;
int weight = x.second.first;
int idx = x.second.second;
if (dist[node] + weight < dist[to]) {
Q.erase(make_pair(dist[to], to));
dist[to] = dist[node] + weight;
pos[to] = idx;
Q.insert(make_pair(dist[to], to));
}
}
}
cout << ans.size() << endl;
for (auto a : ans) cout << a << " ";
cout << endl;
return 0;
}
| 1,800 | CPP |
t = int(input())
for i in range(0,t):
n = int(input())
enemy = list(input())
mine = input()
count = 0
for x in range(0, n):
if mine[x] == '1':
if enemy[x] == '0':
count += 1
elif x-1>=0 and enemy[x-1] == '1':
enemy[x-1] = '*'
count += 1
elif x+1<n and enemy[x+1] == '1':
enemy[x+1] = '*'
count += 1
print(count) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
long long ans, cnt;
int main() {
cin >> s;
for (int i = s.size() - 1; i >= 4; i--) {
if (s[i] == 'l' && s[i - 1] == 'a' && s[i - 2] == 't' && s[i - 3] == 'e' &&
s[i - 4] == 'm')
cnt++;
else if (s[i] == 'y' && s[i - 1] == 'v' && s[i - 2] == 'a' &&
s[i - 3] == 'e' && s[i - 4] == 'h')
ans += cnt;
}
cout << ans << endl;
return 0;
}
| 1,300 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.