solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
s = input()
count_open = 0
count = 0
for i in range(len(s)):
if s[i] == '(':
count_open += 1
elif count_open != 0:
count += 2
count_open -= 1
print(count) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Counter {
static int k;
Counter() { k++; }
~Counter() { k--; }
};
int Counter::k = 0;
template <typename T>
void pr(const string& name, T t) {
cout << name << " = " << t << endl;
}
template <typename T, typename... Types>
void pr(const string& names, T t, Types... rest) {
auto comma_pos = names.find(',');
cout << names.substr(0, comma_pos) << " = " << t << ", ";
auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);
pr(string(names, next_name_pos), rest...);
}
void mod(long long& a, long long b) {
a %= b;
if (a < 0) a += b;
}
const long long MOD = 1000000007;
long long Am[1000005], DX, DY, Moves[1000005], N, M;
int main() {
cin >> N >> M >> DX >> DY;
long long p = 0;
for (int i = (1); i <= (N); i++) {
p = (p + DX) % N;
Moves[p] = i;
}
for (int i = (1); i <= (M); i++) {
long long x, y;
cin >> x >> y;
long long need = Moves[(N - x) % N];
long long next_y = (y + DY * need) % N;
Am[next_y]++;
}
int m = 0, best;
for (int i = (0); i <= (N - 1); i++)
if (Am[i] > m) {
best = i;
m = Am[i];
}
cout << "0 " << best << "\n";
}
| 11 | CPP |
from string import ascii_lowercase
def solution(arr, n):
count = {letter: 0 for letter in ascii_lowercase}
for string in arr:
for letter in string:
count[letter] += 1
if all(value % n == 0 for value in count.values()):
return 'Yes'
return 'No'
def main():
for test in range(int(input())):
n = int(input())
arr = [input() for _ in range(n)]
print(solution(arr, n))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
const long long M = 1e9 + 7;
const long long inf = 1e17 + 5;
int n, m, k;
int col[N];
long long mat[N][N];
long long dp[N][N][N];
long long rec(int pos, int fin, int prec) {
if (pos == n) {
if (fin == k) {
if (col[n] != 0) {
if (prec == col[n]) {
return 0;
} else
return inf;
} else {
return mat[n][prec];
}
} else if (fin == k - 1) {
if (col[n] != 0) {
if (prec == col[n]) {
return inf;
} else
return 0;
} else {
long long res = inf;
for (int i = 1; i <= m; i++) {
if (i != prec) {
res = min(res, mat[n][i]);
}
}
return res;
}
} else
return inf;
}
if (fin > k) return inf;
long long &res = dp[pos][fin][prec];
if (res != -1) return res;
res = inf;
if (col[pos] != 0) {
if (col[pos] == prec)
res = rec(pos + 1, fin, prec);
else {
res = rec(pos + 1, fin + 1, col[pos]);
}
} else {
for (int i = 1; i <= m; i++) {
if (i == prec)
res = min(res, mat[pos][i] + rec(pos + 1, fin, prec));
else
res = min(res, mat[pos][i] + rec(pos + 1, fin + 1, i));
}
}
return res;
}
int main() {
scanf("%d", &n);
scanf("%d", &m);
scanf("%d", &k);
for (int i = 1; i <= n; i++) scanf("%d", &col[i]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%lld", &mat[i][j]);
}
memset(dp, -1, sizeof(dp));
long long ans = rec(1, 0, 0);
if (ans >= inf) ans = -1;
printf("%lld\n", ans);
;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> mom1, mom2;
long long sec = 0;
int main() {
long long m, h1, x1, y1, a1, h2, a2, x2, y2;
cin >> m >> h1 >> a1 >> x1 >> y1 >> h2 >> a2 >> x2 >> y2;
for (int i = 0; i < int(3e6); i++) {
sec++;
h1 = (h1 * x1 + y1) % m;
h2 = (h2 * x2 + y2) % m;
if (h1 == a1 && h2 == a2) {
cout << sec << endl;
return 0;
}
if (h1 == a1 && (int)(mom1).size() < 2) {
mom1.push_back(sec);
}
if (h2 == a2 && (int)(mom2).size() < 2) {
mom2.push_back(sec);
}
if ((int)(mom1).size() > 1 && (int)(mom2).size() > 1) {
long long T1 = mom1[1] - mom1[0], last1 = mom1[1];
long long T2 = mom2[1] - mom2[0], last2 = mom2[1];
if (T1 < T2) {
swap(T1, T2);
swap(last1, last2);
}
for (int j = 0; j < int(3e6); j++) {
last1 += T1;
if ((last1 - last2) % T2 == 0) {
cout << last1 << endl;
return 0;
}
}
break;
}
}
cout << -1 << endl;
return 0;
}
| 7 | CPP |
N, A, B = map(int, input().split())
print("%d %d" % (min(A, B), max((A+B)-N, 0))) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
struct node {
int l, r;
int lz;
} tree[maxn << 2];
void build(int i, int l, int r) {
tree[i].l = l;
tree[i].r = r;
tree[i].lz = 0;
if (l == r) {
scanf("%d", &tree[i].lz);
return;
}
int mid = (l + r) >> 1;
build((i << 1), l, mid);
build(((i << 1) | 1), mid + 1, r);
}
void push_down(int i) {
if (tree[i].lz) {
tree[(i << 1)].lz = max(tree[(i << 1)].lz, tree[i].lz);
tree[((i << 1) | 1)].lz = max(tree[((i << 1) | 1)].lz, tree[i].lz);
tree[i].lz = 0;
}
}
void update(int i, int l, int r, int x, int f) {
if (tree[i].l == l && tree[i].r == r) {
if (f) {
tree[i].lz = x;
} else {
tree[i].lz = max(tree[i].lz, x);
}
return;
}
push_down(i);
int mid = (tree[i].l + tree[i].r) >> 1;
if (r <= mid) {
update((i << 1), l, r, x, f);
} else if (l > mid) {
update(((i << 1) | 1), l, r, x, f);
} else {
update((i << 1), l, mid, x, f);
update(((i << 1) | 1), mid + 1, r, x, f);
}
}
int query(int i, int x) {
if (tree[i].l == x && tree[i].r == x) {
return tree[i].lz;
}
push_down(i);
int mid = (tree[i].l + tree[i].r) >> 1;
if (x <= mid) {
return query((i << 1), x);
} else {
return query(((i << 1) | 1), x);
}
}
int main() {
int n;
scanf("%d", &n);
build(1, 1, n);
int m;
scanf("%d", &m);
for (int i = 0; i < m; i++) {
int op;
scanf("%d", &op);
if (op == 1) {
int x, p;
scanf("%d%d", &p, &x);
update(1, p, p, x, 1);
} else {
int x;
scanf("%d", &x);
update(1, 1, n, x, 0);
}
}
for (int i = 1; i <= n; i++) {
printf("%d ", query(1, i));
}
printf("\n");
}
| 8 | CPP |
def ceillog(num,base):
n = num ; res = 0
while n:
n//=base
res+=1
return res
for _ in range(int(input())):
n = int(input())
a = set([int(i) for i in input().split()])
flag=0
for i in range(1,2**ceillog(max(a),2)+1):
st=set()
for j in a:
st.add(j^i)
if st==a:
flag=1
break
if flag==1: print(i)
else: print(-1)
| 8 | PYTHON3 |
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
mod=10**9+7
print(pow(pow(2,m,mod)-1,n,mod))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, a, i1, n1;
long long mas[250000];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> mas[i];
}
i1 = 2;
n1 = n;
for (int i = 2; i <= n; i++) {
while (i <= n && a - (i1 - 1) * (n1 - i1) * mas[i] < k) {
cout << i << "\n";
n1--;
i++;
}
a += mas[i] * (i1 - 1);
i1++;
}
return 0;
}
| 9 | CPP |
from collections import Counter
t=int(input())
for _ in range(0,t):
n=int(input())
a=list(map(int,input().split()))
c=Counter(a)
flag=1
g=2048
if(g in a):
print("YES")
continue
while(flag==1):
c=Counter(a)
v=list(c.values())
if(max(v)<2):
break
else:
k=list(c.keys())
#print(a,"ini")
for i in range(0,len(k)):
if(c[k[i]]>1):
a.append(2*k[i])
#print(k[i])
#print(a,"l")
a.remove(k[i])
a.remove(k[i])
#print(a,"j")
if(g in a):
print("YES")
flag=0
break
if(flag==1):
if(g in a):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf32 = 0x3f3f3f3f;
const long long inf64 = 0x3f3f3f3f3f3f3f3f;
struct info {
int l, r, v;
info() {}
info(int l, int r, int v) : l(l), r(r), v(v) {}
};
const int xn = 1e5, xa = 2e5;
int n, vis[xn], rx[xn][2], ry[xn][2];
int ax, ay, dx[xa], dy[xa];
vector<info> s[xa];
const int xp = xa * 4;
int mx[xp], mn[xp];
set<int> st[xp];
void pushup(int u, int t) {
int l = u * 2 + 1, r = l + 1;
if (t) {
mx[u] = max(mx[l], mx[r]);
mn[u] = min(mn[l], mn[r]);
} else
mx[u] = mn[u] = -1;
if (int((st[u]).size())) {
int k = *st[u].rbegin();
mn[u] = max(mn[u], k);
if (k > mx[u]) {
if (vis[k] or k < mn[u])
mx[u] = -1;
else
mx[u] = k;
}
}
}
void modify(int first, int second, int v, int u = 0, int l = 0, int r = ay) {
if (first <= l and r <= second) {
if (v >= n)
st[u].erase(v - n);
else if (~v)
st[u].insert(v);
return pushup(u, r - l > 1);
}
int mid = (l + r) / 2;
if (first < mid) modify(first, second, v, u * 2 + 1, l, mid);
if (second > mid) modify(first, second, v, u * 2 + 2, mid, r);
pushup(u, true);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = (0); i < (n); ++i) {
for (int t = (0); t < (2); ++t) {
cin >> rx[i][t] >> ry[i][t];
dx[ax++] = rx[i][t], dy[ay++] = ry[i][t];
}
}
sort(dx, dx + ax), ax = unique(dx, dx + ax) - dx;
sort(dy, dy + ay), ay = unique(dy, dy + ay) - dy;
for (int i = (0); i < (n); ++i) {
for (int t = (0); t < (2); ++t) {
rx[i][t] = lower_bound(dx, dx + ax, rx[i][t]) - dx;
ry[i][t] = lower_bound(dy, dy + ay, ry[i][t]) - dy;
}
s[rx[i][0]].emplace_back(ry[i][0], ry[i][1], i);
s[rx[i][1]].emplace_back(ry[i][0], ry[i][1], i + n);
}
for (int u = (0); u < (ay * 4); ++u) mx[u] = mn[u] = -1;
for (int first = (0); first < (ax); ++first) {
for (const info &u : s[first]) modify(u.l, u.r, u.v);
while (~mx[0]) {
vis[mx[0]] = true;
modify(ry[mx[0]][0], ry[mx[0]][1], -1);
}
}
int res = 1;
for (int i = (0); i < (n); ++i) res += vis[i];
cout << res << '\n';
return 0;
}
| 10 | CPP |
# 69A - Young Physicist
n = int(input())
a = b = c = 0
for i in range(n):
a_1 , b_1 , c_1 = [int(x) for x in input().split()]
a = a + a_1
b = b + b_1
c = c + c_1
if a==0 and b==0 and c==0:
print("YES")
else:
print('NO') | 7 | PYTHON3 |
from collections import deque, defaultdict, Counter
from itertools import product, groupby, permutations, combinations
from math import gcd, floor
cases = int(input())
for _ in range(cases):
num = int(input())
arr = list(map(int, input().split()))
sm = sum(arr)
if len(set(arr)) == 1:
print(0)
elif sm % num != 0:
print(-1)
else:
md = sm//num
ans = sum(1 for i in arr if i > md)
print(ans) | 8 | PYTHON3 |
inp = input().split(' ')
n = int(inp[0])
m = int(inp[1])
array = [int(i) for i in input().split(' ')]
letters = [int(i) for i in input().split(' ')]
index = 0
total = 0
for count,i in enumerate(array):
total += i
while letters[index] <= total:
print(str(count+1) + " " + str(int(letters[index]-total+i)))
index += 1
if index >= len(letters):
break
if index >= len(letters):
break
while index < len(letters):
print(str(count+1) + " " + str(int(letters[index]-total+i)))
index += 1
| 9 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
evens = []
odds = []
for i in range(2*n):
if a[i]%2==0:
evens.append(i+1)
else:
odds.append(i+1)
ans = []
if len(evens)%2==0:
for i in range(0, len(evens), 2):
ans.append((evens[i], evens[i+1]))
for i in range(0, len(odds), 2):
ans.append((odds[i], odds[i+1]))
for i, j in ans[:-1]:
print(i, j)
else:
for i in range(0, len(evens)-1, 2):
print(evens[i], evens[i+1])
for i in range(0, len(odds)-1, 2):
print(odds[i], odds[i+1]) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
string s;
cin >> n >> s;
map<char, long long> mp;
set<char> se;
for (long long i = 0; i < n; ++i) {
mp[s[i]]++;
se.insert(s[i]);
}
string ne = "";
char lastInserted = '0';
char firstInserted = '9';
for (long long i = 0; i < n; ++i) {
if (*se.begin() == s[i] and s[i] <= firstInserted) {
ne += '1';
mp[s[i]]--;
if (mp[s[i]] == 0) {
se.erase(se.begin());
}
} else {
if (s[i] < lastInserted) {
cout << "-" << endl;
return;
}
firstInserted = min(s[i], firstInserted);
lastInserted = s[i];
mp[s[i]]--;
if (mp[s[i]] == 0) {
se.erase(se.find(s[i]));
}
ne += '2';
}
}
cout << ne << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 9 | CPP |
n=int(input())
x=0
for j in range(2, n):
x=x+(n-j)*j
print(x+n-1+n) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long ris = 0;
bool isPower(long long x, long long y) {
double res1 = log(y) / log(x);
double e = ceil(res1);
return (res1 / e == 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
map<long long, long long> prefix;
vector<long long> multi;
vector<long long> val(n);
for (int i = 0; i < n; i++) cin >> val[i];
long long scorso = 1;
while (abs(scorso) <= 1e16) {
multi.push_back(scorso);
scorso *= k;
if (scorso == 1) break;
}
long long sum = 0;
prefix[0]++;
for (int i = 0; i < n; i++) {
sum += val[i];
for (auto x : multi) {
ris += prefix[sum - x];
}
prefix[sum]++;
}
cout << ris << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, l, n;
cin >> k >> l;
if (l < k) cout << "NO", exit(0);
while (l > 0) {
if (l == 1) cout << "YES\n" << n - 1, exit(0);
if (l % k) cout << "NO", exit(0);
n++, l /= k;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int vis[maxn << 1], n, m, flag;
vector<int> vertices[maxn << 1];
vector<int> ans;
void dfs1(int u) {
if (vertices[u].size() == 0 && u > n) {
flag = 1;
ans.push_back(u);
return;
}
vis[u] = 1;
for (auto v : vertices[u]) {
if (vis[v] == 1) continue;
dfs1(v);
if (flag) {
ans.push_back(u);
return;
}
}
}
void dfs2(int u) {
vis[u] = 2;
for (auto v : vertices[u]) {
if (v > n) v -= n;
if (vis[v] == 2) {
flag = 1;
return;
}
if (!vis[v]) dfs2(v);
if (flag) return;
}
vis[u] = 1;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
for (int j = 1; j <= c; j++) {
int x;
cin >> x;
vertices[i].push_back(x + n);
vertices[i + n].push_back(x);
}
}
int s;
cin >> s;
dfs1(s);
if (flag) {
cout << "Win" << endl;
reverse(ans.begin(), ans.end());
for (auto item : ans) cout << (item > n ? item - n : item) << " ";
return 0;
}
memset(vis, 0, sizeof(vis));
flag = 0;
dfs2(s);
if (flag)
cout << "Draw" << endl;
else
cout << "Lose" << endl;
return 0;
}
| 8 | CPP |
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int gi(){
int x=0,w=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')w=0,ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return w?x:-x;
}
const int N=2005;
const int mod=998244353;
int n,sum[N],C[N][N],f[N][N],ans;char s[N];
int main(){
scanf("%s",s+1);n=strlen(s+1);
for(int i=1;i<=n;++i)sum[i]=sum[i-1]+s[i]-'0';
for(int i=C[0][0]=1;i<=n;++i)
for(int j=C[i][0]=1;j<=i;++j)
C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
f[0][0]=1;
for(int i=1;i<=n;++i)
for(int j=0;j<=i;++j){
if(j&&j<=sum[i])f[i][j]=(f[i][j]+f[i-1][j-1])%mod;
if(j<i&&i-j<=2*i-sum[i])f[i][j]=(f[i][j]+f[i-1][j])%mod;
}
for(int i=max(0,sum[n]-n);i<=sum[n]&&i<=n;++i)ans=(ans+1ll*f[n][i]*C[n][sum[n]-i])%mod;
printf("%d\n",ans);return 0;
}
| 0 | CPP |
a,b,c=map(int,input().split())
i=0
k=c
while (c - b*i)>=0:
k=c-b*i
if k%a==0:
print('Yes')
exit()
i+=1
print('No')
| 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort()
while n!=0:
print(a.pop(n//2),end=" ")
n-=1
| 8 | PYTHON3 |
n=int(input())
l1=list(map(int,input().split()))
l1.remove(l1[0])
l2=list(map(int,input().split()))
l2.remove(l2[0])
a,b,c,d,l3,l4=0,0,0,0,[l1[:]],[l2[:]]
while len(l1)!=0 and len(l2)!=0:
if l1[0]>l2[0]:
a,d=l1[0],l2[0]
l1.remove(l1[0])
l2.remove(l2[0])
l1.append(d)
l1.append(a)
else:
a,d=l2[0],l1[0]
l2.remove(l2[0])
l1.remove(l1[0])
l2.append(d)
l2.append(a)
b+=1
if l1 not in l3 or l2 not in l4:
l3.append(l1[:])
l4.append(l2[:])
else:
c=1
break
if c==0:
if len(l1)==0:
print(str(b)+' 2')
else:
print(str(b)+' 1')
else:
print(-1) | 9 | PYTHON3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
inline bool bound_check(int x) {
return 0 <= x && x <= 5000;
}
int main() {
for (;;) {
int n;
cin >> n;
if (!n) return 0;
pair<int, int> poles[n];
vector<vector<bool> > plane(5001, vector<bool>(5001));
int result = 0;
for (int i = 0; i < n; i++) {
cin >> poles[i].first >> poles[i].second;
plane[poles[i].first][poles[i].second] = true;
}
for (int i = 0; i < n-1; i++)
for (int j = i+1; j < n; j++) {
int dx = poles[j].first - poles[i].first,
dy = poles[j].second - poles[i].second,
a = poles[j].first + dy, b = poles[j].second - dx,
c = a - dx, d = b - dy;
if (bound_check(a) && bound_check(b) && bound_check(c) && bound_check(d)
&& plane[a][b] && plane[c][d])
result = max(result, dx * dx + dy * dy);
}
cout << result << endl;
}
} | 0 | CPP |
T=int(input())
while(T>0):
T-=1
S=input()
N=len(S)
cur=0
ans=0
for i in range(0,N):
if S[i]=='+':
cur+=1
else:
cur-=1
if cur<0:
ans+=(i+1)
cur+=1
if cur>=0:
ans+=N
print(ans)
| 9 | PYTHON3 |
n=int(input())
a=[int(input())for i in range(n)]
c=0
l=[]
l2=[]
for i in a:
if i!=0:
l.append(i)
else:
l2.append(sum(l)//2)
l=[]
l2.append(sum(l)//2)
print(sum(l2)) | 0 | PYTHON3 |
s = input()
r = 0
for x in range(len(s)):
w = 0
for j in range(x):
if s[j] == s[x]:
w += 1
if w == 0:
r+= 1
if r % 2 == 0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 7 | PYTHON3 |
n, q = map(int, input().split())
arr = list(map(int, input().split()))
n0 = arr.count(0)
n1 = n - n0
for _ in range(q):
t, x = map(int,input().split())
if t == 1:
if arr[x - 1] == 1:
n0 += 1
n1 -= 1
arr[x - 1] = 0
else:
n0 -= 1
n1 += 1
arr[x - 1] = 1
else:
if x <= n1:
print(1)
else:
print(0)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
class seg {
public:
int a, l, r;
seg() {}
seg(int _a, int _l, int _r) {
a = _a;
l = _l;
r = _r;
}
};
vector<int> a[2100], b[2100];
int u[2100], v[2100];
bool flag[2100][2100];
void initPoint(int &N, vector<int> a[], int u[], int d) {
map<int, int> p;
int n = 0;
for (int i = 0; i < N; i++) {
int x, y;
scanf("%d%d", &x, &y);
int t = x + y * d;
if (!p[t]) {
p[t] = ++n;
u[n] = t;
}
a[p[t]].push_back(x);
}
N = n;
for (int i = 1; i <= N; i++) sort(a[i].begin(), a[i].end());
}
void initSeg(int N, vector<int> a[], int u[], vector<seg> &s, int d) {
for (int i = 1; i <= N; i++) {
int l = a[i][0] - d, r = a[i][0] + d, size = a[i].size();
for (int j = 1; j < size; j++) {
int x = a[i][j];
if (x - d <= r)
r = x + d;
else {
s.push_back(seg(u[i], l << 1, r << 1));
l = x - d;
r = x + d;
}
}
s.push_back(seg(u[i], l << 1, r << 1));
}
}
bool check(int d) {
vector<seg> s, t;
initSeg(n, a, u, s, d);
initSeg(m, b, v, t, d);
vector<int> a;
memset(flag, 0, sizeof(flag));
for (int i = 0; i < s.size(); i++) {
a.clear();
for (int j = 0; j < t.size(); j++) {
int x = s[i].a + t[j].a;
if (s[i].l <= x && x <= s[i].r && t[j].l <= x && x <= t[j].r)
a.push_back(j);
}
for (int j = 0; j < a.size(); j++)
for (int k = j + 1; k < a.size(); k++) {
int x = a[j], y = a[k];
if (flag[x][y]) return 1;
flag[x][y] = 1;
}
}
return 0;
}
int main() {
scanf("%d%d", &n, &m);
initPoint(n, a, u, 1);
initPoint(m, b, v, -1);
if (n == 1 || m == 1) {
puts("Poor Sereja!");
return 0;
}
int L = 1, R = 1000000, ret = 0;
while (L <= R) {
int mid = (L + R) >> 1;
if (check(mid))
ret = mid, R = mid - 1;
else
L = mid + 1;
}
printf("%d\n", ret);
return 0;
}
| 11 | CPP |
#include "bits/stdc++.h"
#pragma warning(disable:4996)
using namespace std;
int main() {
string st;cin>>st;
int ans=0;
int num=0;
for (auto c : st) {
if (c == 'L') {
num--;
if(num==-4)num=0;
}
else {
num++;
if (num == 4) {
num=0;
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
n,m=map(int,input().split())
a=[0]*n
w=[0]*n
ac=0
wc=0
for _ in range(m):
p,s=input().split()
p=int(p)-1
if a[p]==0:
if s=='AC':
a[p]=1
ac+=1
wc+=w[p]
else:
w[p]+=1
print(ac,wc)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
long long int arr[n];
for (long long int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long int sum = 0;
for (long long int i = 0; i < n - 1; i++) sum += arr[i];
if (sum >= arr[n - 1] and ((sum + arr[n - 1]) % 2) == 0)
cout << "YES\n";
else
cout << "NO\n";
}
int main() { solve(); }
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
const int MOD = 998244353;
void dfs(string s, set<string>& st) {
if (st.count(s)) return;
st.insert(s);
int N = s.length();
rep(i, N - 1) if (s[i] != s[i + 1]) {
string t = s;
t[i] = t[i + 1] = 'a' + 'b' + 'c' - s[i] - s[i + 1];
dfs(t, st);
}
}
int f(string s) {
set<string> st;
dfs(s, st);
return st.size();
}
int solve(string s) {
int N = s.length();
bool same = true, diff = true;
rep(i, N - 1) {
if (s[i] != s[i + 1]) same = false;
else diff = false;
}
if (same) return 1;
int ans = 1;
rep(i, N - 1) ans = (ll)ans * 3 % MOD;
int unko = 0;
rep(i, N) unko = (unko + s[i] - 'a') % 3;
vector<vector<int>> dp(3, vector<int>(3));
dp[0][0] = dp[1][1] = dp[2][2] = 1;
rep(i, N - 1) {
vector<vector<int>> _dp(3, vector<int>(3));
rep(x, 3) rep(y, 3) rep(z, 3) if (x != z)
_dp[z][(y + z) % 3] = (_dp[z][(y + z) % 3] + dp[x][y]) % MOD;
dp = _dp;
}
rep(x, 3) ans = (ans - dp[x][unko]) % MOD;
if (diff) ans = (ans + 1) % MOD;
return (ans + MOD) % MOD;
}
int main() {
/*
for (;;) {
string s; cin >> s;
cout << f(s) << ' ' << solve(s) << endl;
}
*/
string s; cin >> s;
if (s.length() <= 3) {
cout << f(s) << endl;
return 0;
}
cout << solve(s) << endl;
}
| 0 | CPP |
def f(A,B,M,N):
ans=1
MOD=10**9+7
r,c=1,1
if (M*N not in A) or (M*N not in B):
return 0;
# print("MN in A or B")
for o in range(M*N-1,0,-1):
ans=ans%MOD
if o in A:
r+=1
#row i-th's max is o:
if o in B:
c+=1
continue;
else:
# o must in colum j which not the max
ans*=c
continue
if o in B:
# o in B but not in A
c+=1
ans*=r
continue
ans*=(r*c-(M*N-o))
return ans%MOD;
N,M=(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
A=set(A)
B=set(B)
if len(A)!=N or len(B)!=M:
print(0)
else:
print(f(A,B,M,N)) | 0 | PYTHON3 |
def ans(i,j):
x=i+1 if i<n else i-1
y=j+1 if j<m else j-1
print(i,j,i,y,x,y)
print(i,j,x,j,x,y)
print(i,j,i,y,x,j)
for _ in range(int(input())):
n,m=map(int,input().split())
l=[list(map(int,list(input()))) for i in range(n)]
print(sum(sum(z) for z in l)*3)
for i in range(n):
for j in range(m):
if l[i][j]==1:
ans(i+1,j+1) | 7 | PYTHON3 |
S = list(input())
L = len(S)
ans = S[0:L-8]
print (''.join(ans)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n;
cin >> n;
int i, a[n];
for (i = 0; i < n; ++i) cin >> a[i];
int z = a[0], st = a[0], maxm = 0, l = 1;
for (i = 1; i < n; ++i) {
if (a[i] == abs(1 - z)) {
l++;
z = a[i];
} else {
if (st != z && st == 0) {
if (z == 0 && l & 1) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(1);
if (z == 1 && l & 1) v.push_back(1);
} else if (st != z && st == 1) {
for (int j = 0; j < l / 2; ++j) v.push_back(1);
if (z == 1 && l & 1) v.push_back(1);
if (z == 0 && l & 1) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(0);
} else if (st == 0) {
for (int j = 0; j < l; ++j) v.push_back(0);
} else {
for (int j = 0; j < l; ++j) v.push_back(1);
}
z = a[i];
st = a[i];
maxm = max(maxm, l);
l = 1;
}
}
if (st != z && st == 0) {
if (z == 0 && l & 1) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(1);
if (z == 1 && l & 1) v.push_back(1);
} else if (st != z && st == 1) {
for (int j = 0; j < l / 2; ++j) v.push_back(1);
if (z == 1 && l & 1) v.push_back(1);
if (z == 0 && l & 1) v.push_back(0);
for (int j = 0; j < l / 2; ++j) v.push_back(0);
} else if (st == 0) {
for (int j = 0; j < l; ++j) v.push_back(0);
} else {
for (int j = 0; j < l; ++j) v.push_back(1);
}
maxm = max(maxm, l);
if (maxm & 1)
cout << (maxm / 2) << endl;
else
cout << maxm / 2 - 1 << endl;
for (i = 0; i < v.size(); ++i) cout << v[i] << " ";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define All(v) (v).begin(),(v).end()
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,q;
string s;
cin>>n>>s;
set<int> st[26];
for(int i=0;i<n;i++)st[s[i]-'a'].insert(i+1);
cin>>q;
for(int i=0;i<q;i++){
int t;
cin>>t;
if(t==1){
int idx;
char c;
cin>>idx>>c;
st[s[idx-1]-'a'].erase(idx);
st[c-'a'].insert(idx);
s[idx-1]=c;
}else{
int res=0;
int l,r;
cin>>l>>r;
for(int j=0;j<26;j++){
auto it=st[j].lower_bound(l);
if(it!=st[j].end()&&*it<=r)res++;
}
cout<<res<<endl;
}
}
} | 0 | CPP |
n = input()
x = 0
for i in range(int(n)):
s = input()
if s in {'++X', 'X++'}:
x += 1
if s in {'--X', 'X--'}:
x -= 1
print(x)
| 7 | PYTHON3 |
//Edit Distance (Levenshtein Distance)
#include<bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main(){
string s1, s2;
cin>>s1>>s2;
for(int i=0; i<1001; i++){
dp[i][0]=i;
dp[0][i]=i;
}
for(int i=1; i<=s1.length(); i++)
for(int j=1; j<=s2.length(); j++)
if(s1[i-1]==s2[j-1])dp[i][j]=dp[i-1][j-1];
else dp[i][j]=min(dp[i][j-1], min(dp[i-1][j], dp[i-1][j-1]))+1;
cout<<dp[s1.length()][s2.length()]<<endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:60777216")
using namespace std;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
string filename = "test";
void get_output(const vector<long long>& in, int k, long long t,
vector<long long>& out) {
multiset<long long> next_time;
int cnt_left = k;
for (int _n(in.size()), i(0); i < _n; i++) {
if (cnt_left > 0) {
out[i] = in[i] + t;
--cnt_left;
next_time.insert(out[i]);
} else {
multiset<long long>::iterator it = next_time.begin();
out[i] = (((*it) > (in[i])) ? (*it) : (in[i])) + t;
next_time.erase(it);
next_time.insert(out[i]);
}
}
}
int main() {
int k1, k2, k3;
scanf("%d %d %d", &k1, &k2, &k3);
int t1, t2, t3;
scanf("%d %d %d", &t1, &t2, &t3);
int n;
scanf("%d", &n);
vector<int> tmp(n);
for (int _n(n), i(0); i < _n; i++) {
scanf("%d", &tmp[i]);
}
vector<long long> input0;
input0.reserve(n);
for (int _n(n), i(0); i < _n; i++) {
input0.push_back(tmp[i]);
}
vector<long long> output0(n);
get_output(input0, k1, t1, output0);
vector<long long> output1(n);
get_output(output0, k2, t2, output1);
get_output(output1, k3, t3, output0);
long long max_val = 0;
for (int _n(n), i(0); i < _n; i++) {
long long now = output0[i] - input0[i];
if (now > max_val) max_val = now;
}
cout << max_val << endl;
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n = int(input())
digit = int(input())
if n == 1:
if digit % 2 == 0:
print(2)
else:
print(1)
else:
val = str(digit)
even = 0
odd = 0
if len(val) % 2 == 0:
for j in range(1, len(val), 2):
if int(val[j]) % 2 == 0:
even += 1
else:
odd += 1
if even:
print(2)
else:
print(1)
else:
for j in range(0, len(val), 2):
if int(val[j]) % 2 == 0:
even += 1
else:
odd += 1
if odd:
print(1)
else:
print(2)
| 7 | PYTHON3 |
def read():
n, m = map(int, input().rstrip().split())
graph = [set() for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().rstrip().split())
graph[a].add(b)
graph[b].add(a)
graph[a].add(a)
graph[b].add(b)
return (graph, n)
def main():
graph, n = read()
seen = set()
for i in range(1, n + 1):
if len(graph[i]) > 0 and i not in seen:
if not all(graph[i] == graph[j] for j in graph[i]):
return False
seen |= graph[i]
return True
if __name__ == '__main__':
if main():
print('YES')
else:
print('NO')
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[100010], b[100010];
int fa[100010];
bool vis[100010];
priority_queue<long long> q;
vector<long long> ans;
int findfa(int x) { return (fa[x] == x) ? x : fa[x] = findfa(fa[x]); }
void merge(int x, int y) {
int fx = findfa(x);
int fy = findfa(y);
if (fx != fy) {
fa[fy] = fx;
a[fx] += a[fy];
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 100010; i++) fa[i] = i;
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
q.push(0);
ans.push_back(0);
for (int i = n; i > 1; i--) {
int tmp = b[i];
q.push(a[tmp]);
if (vis[tmp + 1]) {
merge(tmp, tmp + 1);
q.push(a[findfa(tmp)]);
}
if (vis[tmp - 1]) {
merge(tmp - 1, tmp);
q.push(a[findfa(tmp - 1)]);
}
vis[tmp] = true;
ans.push_back(q.top());
}
for (int i = ans.size() - 1; i >= 0; i--) cout << ans[i] << '\n';
return 0;
}
| 9 | CPP |
def main():
h = int(input())
l = [c == '#' for _ in range(h) for c in input()]
if not (l[0] or l[-1] or sum(l) % 5):
l[-1] = True
w, idx = len(l) // h, 0
lim = (h - 2) * w - 2
pattern = (0, w - 1, w, w + 1, 2 * w)
while True:
idx = l.index(True, idx + 1)
if idx > lim:
break
if all(l[_ + idx] for _ in pattern):
for _ in pattern:
l[_ + idx] = False
else:
break
l[-1] = False
print(('YES', 'NO')[any(l)])
if __name__ == '__main__':
main() | 8 | PYTHON3 |
n = int(input())
for i in range(n):
t = input()
listt = list(t)
if len(t) > 10:
print(listt[0] + str(len(t)-2) + listt[len(listt)-1])
else:
print(t)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n + 1];
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
}
long long int ans = 0;
vector<long long int> freq((n * n) + n + n, 0);
for (long long int k = 2; k < n; k++) {
long long int j = k - 1;
for (long long int i = 1; i <= k - 2; i++) {
freq[(n * a[i]) + a[j]]++;
}
for (long long int l = k + 1; l <= n; l++) {
ans += freq[(n * a[k]) + a[l]];
}
}
cout << ans << "\n";
}
}
| 10 | CPP |
n=int(input())
a=input()
b=input()
a=list(a)
b=list(b)
moves=0
k=0
for i in range(n-1):
if a[i]!=b[i] and a[i+1]!=a[i] and a[i+1]!=b[i+1]:
c=a[i]
a[i]=a[i+1]
a[i+1]=c
moves+=1
i=i+2
k=1
elif a[i]!=b[i]:
a[i]=b[i]
moves+=1
k=0
else:
k=0
if k==0 and a[n-1]!=b[n-1]:
moves+=1
a[n-1]=b[n-1]
#print(*a)
print(moves)
| 9 | PYTHON3 |
#include<set>
#include<map>
#include<stack>
#include<cmath>
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<climits>
#include<iostream>
#include<algorithm>
using namespace std;
#define INF 1000000000000000
#define MAXN 100000
#define LL long long
LL read(){
LL f=1,x=0;
char c=getchar();
while(c<'0'||'9'<c){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return f*x;
}
LL n,m,Min=1,Max=INF,val[MAXN+5],vis[MAXN+5];
struct edge{
LL v,w;
edge(){}
edge(LL V,LL W){v=V,w=W;}
};
vector<edge> G[MAXN+5];
void DFS(LL x,LL u,LL fa,LL f){
if(x<=0){
if(f){
printf("0\n");
exit(0);
}
Min=max(Min,-x+2);
}
if(f) Max=min(Max,x);
vis[u]=f+1,val[u]=x;
LL v,w,siz=G[u].size();
for(int i=0;i<siz;i++){
v=G[u][i].v,w=G[u][i].w;
if(v==fa) continue;
if(vis[v]){
if(vis[u]==vis[v]){
if(((val[u]+val[v])%2+4)%2!=w%2){
printf("0\n");
exit(0);
}
if(vis[u]==1){
Max=min(Max,1+(w-(val[u]+val[v]))/2);
Min=max(Min,1+(w-(val[u]+val[v]))/2);
if(Min!=Max)
printf("0\n"),exit(0);
}
else{
if(Min>1+((val[u]+val[v])-w)/2||Max<1+((val[u]+val[v])-w)/2){
printf("0\n");
exit(0);
}
Max=Min=1+((val[u]+val[v])-w)/2;
}
}else{
if(val[u]+val[v]!=w){
printf("0\n");
exit(0);
}
if(val[v]<=0){
if(vis[v]-1){
printf("0\n");
exit(0);
}
Min=max(Min,-val[v]+1);
}
}
continue;
}
DFS(w-x,v,u,(f+1)%2);
}
return ;
}
int main(){
n=read(),m=read();
for(int i=1;i<=m;i++){
LL u=read(),v=read(),w=read();
G[u].push_back(edge(v,w));
G[v].push_back(edge(u,w));
}
DFS(1,1,-1,0);
printf("%lld\n",max(0ll,Max-Min+1));
return 0;
} | 0 | CPP |
#!/usr/bin/env python3
def max9s(n):
for i in range(10, 0, -1):
if n + (n-1) >= 10 ** i - 1:
return i
return 0
def calcNums(tgt, n):
# print(tgt)
iniP = max(1, tgt - n)
ini, fin = iniP, min(tgt, n) - 1
while ini < fin:
piv = (ini + fin) // 2 + 1
if tgt - piv >= piv + 1:
ini = piv
else:
fin = piv - 1
if fin < ini or 2 * ini + 1 > tgt:
return 0
# print(iniP, ini, fin)
return ini - iniP + 1
def testCase(n):
ncs = max9s(n)
ans = 0
for i in range(10):
ans += calcNums((i+1) * 10 ** ncs - 1, n)
return ans
print(testCase(int(input())))
| 10 | PYTHON3 |
''' sarp '''
input();print(*sorted(map(int,input().split()))) | 7 | PYTHON3 |
test_cases = int(input())
for i in range(0,test_cases):
num_colm = int(input())
num_of_blocks = input().split()
count = 0
for x in range(0,num_colm-1):
diff = abs(int(num_of_blocks[x])-int(num_of_blocks[x+1]))
if diff % 2 == 0:
count = count + 1
elif diff == 0:
count = count + 1
else:
break
if count == num_colm-1:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
print('+'.join([str(x) for x in list(sorted([int(x) for x in input().split('+')]))])) | 7 | PYTHON3 |
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
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")
ALPHA='abcdefghijklmnopqrstuvwxyz'
M=1000000007
def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]
#-------------------------code---------------------------#
# vsInput()
for _ in range(Int()):
n=Int()
a=sorted(array())
ok=True
for i in range(n-1):
if(abs(a[i]-a[i+1])>1):
ok=False
break
if(ok): print("YES")
else: print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
cin >> s;
long long n = s.length();
long long idx = -1;
bool ok = true;
for (long long i = 0; i < n; i++) {
if (s[i] == '0' && ok) {
ok = false;
idx = i;
break;
}
}
if (idx != -1) {
for (long long i = 0; i < n; i++) {
if (i != idx) {
cout << s[i];
}
}
cout << "\n";
return 0;
} else {
cout << s.substr(0, n - 1) << "\n";
}
return 0;
}
| 7 | CPP |
ans = ["Washington","Adams","Jefferson","Madison","Monroe","Adams","Jackson","Van Buren","Harrison","Tyler","Polk","Taylor","Fillmore","Pierce","Buchanan","Lincoln","Johnson","Grant","Hayes","Garfield","Arthur","Cleveland","Harrison","Cleveland","McKinley","Roosevelt","Taft","Wilson","Harding","Coolidge","Hoover","Roosevelt","Truman","Eisenhower" ,"Kennedy" ,"Johnson","Nixon" ,"Ford" ,"Carter" ,"Reagan" ,"Bush" ,"Clinton" ,"Bush","Obama"]
print(ans[int(input())-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long base, long long exponent) {
long long res = 1;
while (exponent > 0) {
if (exponent & 1) {
res = (base * res) % 1000000007;
}
base = (base * base) % 1000000007;
exponent /= 2;
}
return res;
}
long long modMul(long long a, long long b) { return (a * b) % 1000000007; }
long long modAdd(long long a, long long b) { return (a + b) % 1000000007; }
long long modSub(long long a, long long b) { return (a - b) % 1000000007; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long tt = 1;
while (tt--) {
string s;
cin >> s;
long long q;
cin >> q;
set<int> g[26];
for (long long i = 0; i < s.length(); i++) {
g[s[i] - 'a'].insert(i);
}
while (q--) {
long long a;
cin >> a;
if (a == 1) {
long long pos;
char ch;
cin >> pos;
pos--;
cin >> ch;
if (s[pos] == ch) continue;
g[s[pos] - 'a'].erase(pos);
g[ch - 'a'].insert(pos);
s[pos] = ch;
} else {
long long l, r;
cin >> l >> r;
l--;
r--;
long long ans = 0;
for (long long i = 0; i < 26; i++) {
auto idx = g[i].lower_bound(l);
if (idx != g[i].end())
if ((*idx) <= r) {
ans++;
}
}
cout << ans << "\n";
}
}
}
return 0;
}
| 10 | CPP |
a =[int(i) for i in input().split()]
s =[int(i) for i in list(input())]
out = 0
for i in s:
out += a[i-1]
print(out) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxbuff = 1 << 17;
char ibuff[maxbuff], obuff[maxbuff];
inline char Getchar() {
static char *p1 = ibuff, *p2 = ibuff;
if (p1 == p2) {
p1 = ibuff;
p2 = ibuff + fread(ibuff, 1, maxbuff, stdin);
if (p1 == p2) return -1;
}
return *p1++;
}
int optr = 0;
inline void Putchar(char c) {
if (optr == maxbuff) {
fwrite(obuff, 1, optr, stdout);
optr = 0;
}
obuff[optr++] = c;
}
inline void Flush() { fwrite(obuff, 1, optr, stdout); }
template <class T>
inline int read(T &x) {
x = 0;
char c = Getchar();
if (c == EOF) return -1;
for (; (c < '0' || c > '9') && c != EOF; c = Getchar())
;
if (c == EOF) return -1;
for (; c >= '0' && c <= '9'; c = Getchar()) x = x * 10 + c - '0';
return 0;
}
template <class T>
inline void write(const T &x, int tag = 0) {
if (!x) {
if (!tag) Putchar(x + '0');
return;
}
write(x / 10, 1);
Putchar(x % 10 + '0');
}
template <class T>
inline void writeln(const T &x) {
write(x);
Putchar('\n');
}
template <class T>
inline void writesp(const T &x) {
write(x);
Putchar(' ');
}
int n, tot, x, y, f[2000000], fa[2000000], r[2000000], t[2000000], w[2000000];
long long s[2000000];
long long gcd(long long x, long long y) {
if (!x) return y;
return gcd(y % x, x);
}
int main() {
read(n);
for (int i = (1); i <= (n); i++) read(s[i]);
for (int i = (2); i <= (n); i++) read(fa[i]);
for (int i = (n); i >= (1); i--) s[fa[i]] += s[i];
for (int i = (1); i <= (n); i++) {
long long x = s[1] / gcd(s[i], s[1]);
if (x <= n) r[x]++;
}
for (int i = (1); i <= (n); i++)
if (r[i])
for (int j = (1); j <= (n / i); j++) t[i * j] += r[i];
for (int i = (1); i <= (n); i++)
if (t[i] == i) w[++tot] = i;
for (int i = (tot); i >= (1); i--) {
f[i] = 1;
for (int j = (i + 1); j <= (tot); j++)
if (!(w[j] % w[i])) f[i] = (f[i] + (f[j])) % 1000000007;
}
write(f[1]);
Flush();
}
| 9 | CPP |
def luck(n):
n=str(n)
l=len(n)
sum=0
s=-1
for i in n:
if i=='4' or i=='7':
sum=sum+1
elif int(n)%4==0 or int(n)%7== 0 or int(n)%47==0 or int(n)%44==0 or int(n)%77==0:
s=1
if s==1 or sum==l:
print("YES")
else:
print("NO")
n=int(input())
luck(n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int j, k, pnjg, m, d;
string input, t;
cin >> input;
t = "";
for (int i = 'a'; i <= 'z'; i++) t.push_back(i);
k = 0;
pnjg = input.length();
for (int i = 0; i < pnjg; i++) {
if (k == 26) {
cout << input;
return 0;
}
if (t[k] == input[i])
k++;
else {
if (t[k] > input[i]) input[i] = t[k], k++;
}
}
if (k == 26)
cout << input;
else
cout << "-1";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void oinp() { freopen("a.inp", "r", stdin); }
void oout() { freopen("a.out", "w", stdout); }
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int n, a[1000000], k, h, q, j, x, i;
bool v[1000000];
int main() {
cin >> n >> k;
int nn = n;
h = n / k;
for (i = 1; i <= n; i++) cin >> a[i];
cin >> q;
double minres = 1000000000.0;
double maxres = 0.0;
double mres;
memset(v, false, sizeof(v));
for (i = 1; i <= q; i++) {
mres = 0.0;
for (j = 1; j <= h; j++) {
scanf("%ld", &x);
v[x] = true;
mres += (double)a[x];
}
if (minres > mres) minres = mres;
if (maxres < mres) maxres = mres;
}
j = 0;
for (i = 1; i <= n; i++)
if (v[i] == false) {
j++;
a[j] = a[i];
}
n = j;
sort(a + 1, a + n + 1);
if (n == nn - (nn / k) * k) n = 0;
double res1 = minres / (double)h;
if (n >= h) {
minres = 0;
for (i = 1; i <= h; i++) {
minres += (double)a[i];
}
} else
minres = 1000000000.0;
double res2 = maxres / (double)h;
if (n >= h) {
maxres = 0;
for (i = n - h + 1; i <= n; i++) maxres += (double)a[i];
} else
maxres = -1000000.0;
cout << fixed << setprecision(9) << min(res1, minres / (double)h) << " ";
cout << fixed << setprecision(9) << max(res2, maxres / (double)h);
}
| 8 | CPP |
n=int(input())
list1=list(map(int,input().split()))
t=1
list2=[]
for i in range (n):
for j in range (n):
if list1[j]==t :
list2.append(j+1)
t=t+1
for i in list2 :
print(i,end=' ')
| 7 | PYTHON3 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# AUTHOR: haya14busa
import sys
import io
def div(n):
while n % 2 == 0:
n //= 2
while n % 3 == 0:
n //= 3
return n
def solve(n, bs):
# n: n players (including Limak himself)
# bs: the bids of players. i-th of them has bid with size b_i dollars.
assert 2 <= n <= 10 ** 5
bs = list(set(bs))
for b in bs:
assert 1 <= b <= 10 ** 9
b, rest = bs[0], bs[1:]
v = div(b)
for r in rest:
if div(r) != v:
return 'No'
return 'Yes'
def getinput():
def getint():
return int(input())
def getints_line():
return list(map(int, input().split(' ')))
def getints(n):
return [getint() for _ in range(n)]
def getints_lines(n):
return [getints_line() for _ in range(n)]
return [getint(), getints_line()]
def iosolve():
return str(solve(*getinput()))
# return 'YES' if solve(*getinput()) else 'NO' # for boolean output
# return '\n'.join(map(str, solve(*getinput()))) # for multiple line output
def main():
if sys.stdin.isatty():
test()
stdin_lines = getstdin_lines()
sys.stdin = io.StringIO('\n'.join(stdin_lines))
if stdin_lines:
print(iosolve())
else:
test()
def test():
IO_TEST_CASES = [
(
# INPUT
'''\
4
75 150 75 50
''',
# EXPECT
'''\
Yes
'''
),
(
# INPUT
'''\
3
100 150 250
''',
# EXPECT
'''\
No
'''
),
]
# List[(List[arg for solve()], expect)]
TEST_CASES = [
# ([], None),
]
# You do need to see below
import unittest # to save memory, import only if test required
import sys
import io
class Assert(unittest.TestCase):
def equal(self, a, b):
self.assertEqual(a, b)
def float_equal(self, actual, expect, tolerance):
self.assertTrue(expect - tolerance < actual < expect + tolerance)
art = Assert()
for inputs, expect in TEST_CASES:
art.equal(solve(*inputs), expect)
for stdin, expect in IO_TEST_CASES:
sys.stdin = io.StringIO(stdin.strip())
art.equal(iosolve(), expect.strip())
# art.float_equal(float(iosolve()), float(expect.strip()), 10 ** -6)
def getstdin_lines():
stdin = []
while 1:
try:
stdin.append(input())
except EOFError:
break
return stdin
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
typedef long long ll;
#define int ll
const int N=200005;
int L,n,x[N],ans,tmp1,tmp2,np,p,Suf[N],Pre[N];
signed main()
{
scanf("%lld%lld",&L,&n);
for (int i=1;i<=n;i++) scanf("%lld",&x[i]),Pre[i]=Pre[i-1]+x[i];
for (int i=n;i>=1;i--) Suf[i]=Suf[i+1]+L-x[i];
for (int i=1;i<=n;i++){//枚举段数
int t=i;//顺时针
ans=max(ans,(Suf[t-(i+1)/2+1]-Suf[t+1])*2+Pre[i/2]*2-((i&1)?(L-x[t-(i+1)/2+1]):x[i/2]));
t=n+1-i;//逆时针
ans=max(ans,(Pre[t+(i+1)/2-1]-Pre[t-1])*2+Suf[n+1-i/2]*2-((i&1)?x[t+(i+1)/2-1]:(L-x[n+1-i/2])));
}
printf("%lld\n",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int left = a - 2, right = a;
a--;
int cnt = 0;
if (arr[a] == 1) cnt++;
while (left >= 0 && right <= n - 1) {
if (arr[left] == 1 && arr[right] == 1) cnt += 2;
left--;
right++;
}
if (left < 0) {
for (int i = right; i < n; i++)
if (arr[i] == 1) cnt++;
} else {
for (int i = left; i >= 0; i--)
if (arr[i] == 1) cnt++;
}
cout << cnt << '\n';
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int T, n, a[3333], f[3333], g[3333], c[3333];
long long ans;
int read() {
int x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x;
}
int main() {
T = read();
while (T--) {
n = read(), ans = 0;
for (int i = 1; i <= n; i++) f[i] = g[i] = c[i] = 0;
for (int i = 1; i <= n; i++) a[i] = read(), c[a[i]]++;
for (int i = n; i >= 2; i--) {
long long sum = 0;
for (int j = i - 1; j >= 1; j--) {
if (a[i] == a[j] && i - j >= 2) ans += sum;
sum += f[a[j]];
}
f[a[i]]++;
}
printf("%lld\n", ans);
}
}
| 10 | CPP |
num = int(input())
queries = []
for i in range(0, num):
queries.append(list(map(int, input().split(' '))))
for i in range(0, num):
d = queries[i][2]
l = queries[i][0]
r = queries[i][1]
n = d
while(True):
if n % d == 0:
if n < l or n > r:
print(n)
break
elif n >= l and n <= r:
n += r - n
n += d - (n % d)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const nmax = 100000;
int const sigma = 26;
int v[1 + nmax], frec[1 + sigma], pos[1 + sigma][1 + 2 * nmax];
vector<pair<int, int>> constraint[1 + sigma];
int dp[1 + nmax];
bool satisfy(int x, int l, int r) { return l <= x && x <= r; }
int change(int x, int val, int l, int r) {
int result = -satisfy(dp[x], l, r) + satisfy(dp[x] + val, l, r);
dp[x] += val;
return result;
}
int updateinterval(int x, int y, int val, int l, int r) {
int result = 0;
for (int i = x; i <= y; i++) result += change(i, val, l, r);
return result;
}
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 1; i <= n; i++) v[i] = s[i - 1] - 'a' + 1;
int q, l, r;
cin >> q >> l >> r;
int zerop = 0;
for (int i = 1; i <= q; i++) {
char op;
int x, y;
cin >> op >> x >> y;
constraint[op - 'a' + 1].push_back({x, y});
if (x == 0) zerop++;
}
for (int i = 1; i <= sigma; i++)
for (int j = 1; j <= 2 * nmax; j++) pos[i][j] = n + 1;
for (int i = 1; i <= n; i++) {
frec[v[i]]++;
pos[v[i]][frec[v[i]]] = i;
}
ll result = 0, acc = 0;
for (int i = n; 1 <= i; i--) {
dp[i] = zerop;
if (satisfy(dp[i], l, r) == 1) acc++;
for (int h = 0; h < constraint[v[i]].size(); h++) {
int x = constraint[v[i]][h].first;
int y = constraint[v[i]][h].second;
if (0 < x && pos[v[i]][frec[v[i]] + x - 1] != n + 1)
acc += updateinterval(pos[v[i]][frec[v[i]] + x - 1],
pos[v[i]][frec[v[i]] + x] - 1, 1, l, r);
if (pos[v[i]][frec[v[i]] + y] != n + 1)
acc += updateinterval(pos[v[i]][frec[v[i]] + y],
pos[v[i]][frec[v[i]] + y + 1] - 1, -1, l, r);
}
frec[v[i]]--;
result += acc;
}
cout << result;
return 0;
}
| 11 | CPP |
n = int(input())
m = 1
d = 2
while True:
teste = n * m + 1
if teste > d and teste % d == 0:
print(m)
break
if teste > 2 and teste % 2 == 0:
print(m)
break
if teste > 3 and teste % 3 == 0:
print(m)
break
if teste > 5 and teste % 5 == 0:
print(m)
break
d += 1
m += 1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fileio() {}
vector<long long int>* adj;
vector<long long int> par;
vector<long long int> val;
vector<long long int> down;
vector<long long int> tot;
long long int dfs(long long int v, long long int p) {
down[v] = val[v];
for (long long int a : adj[v]) {
if (a != p) {
par[a] = v;
long long int temp = dfs(a, v);
if (temp > 0) down[v] += temp;
}
}
return down[v];
}
void dfs2(long long int v) {
long long int p = par[v];
if (v != 0) {
if (down[v] >= 0) {
tot[v] = max(tot[p], down[v]);
} else {
tot[v] = max(tot[p] + val[v], val[v]);
}
}
for (long long int a : adj[v]) {
if (a != p) dfs2(a);
}
}
void solve() {
long long int n;
cin >> n;
adj = new vector<long long int>[n];
par.assign(n, 0);
val.assign(n, 0);
down.assign(n, 0);
tot.assign(n, 0);
for (long long int i = 0; i <= n - 1; i++) {
cin >> val[i];
if (val[i] == 0) val[i] = -1;
}
for (long long int i = 0; i <= n - 2; i++) {
long long int a, b;
cin >> a >> b;
adj[a - 1].push_back(b - 1);
adj[b - 1].push_back(a - 1);
}
tot[0] = dfs(0, -1);
dfs2(0);
for (long long int i = 0; i <= n - 1; i++) cout << tot[i] << " ";
}
int32_t main() {
fileio();
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
{ solve(); }
return 0;
}
| 12 | CPP |
def isOnlyOne(num_set):
num_lst = sorted(num_set)
length = len(num_lst)
for i in range(length-1):
if num_lst[i+1] - num_lst[i] > 1:
print("NO")
return
print("YES")
t = int(input())
for _ in range(t):
n = int(input())
num_set = set(map(int, input().rstrip().split()))
isOnlyOne(num_set)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 6005;
const int INF = 1e9;
int dp[MAX][MAX];
int nxt[MAX][MAX];
int label[MAX];
vector<int> a;
vector<int> groups[MAX];
int id[MAX];
int n;
int ans = 0;
vector<int> loc[MAX];
void update(int x, int y, int val) {
if (x > y) swap(x, y);
assert(x < y);
dp[x][y] = max(dp[x][y], val);
}
int check(int u, int v, int w){
return (a[u] == a[v] && a[v] == a[w]);
}
void process(int u, int v, int w, int x, int y) {
assert(u < v);
assert(dp[u][v] != -1);
update(u, w, dp[u][v] + check(v, x, y));
update(u, x, dp[u][v] + check(v, w, y));
update(u, y, dp[u][v] + check(v, x, w));
update(v, w, dp[u][v] + check(u, x, y));
update(v, x, dp[u][v] + check(u, w, y));
update(v, y, dp[u][v] + check(u, w, x));
update(w, x, dp[u][v] + check(u, v, y));
update(w, y, dp[u][v] + check(u, v, x));
update(x, y, dp[u][v] + check(u, v, w));
}
void go(int x, int y) {
assert(x < y);
if (label[y] == n - 1) {
ans = max(ans, dp[x][y] + check(x, y, 3 * n - 1));
return;
}
int cur_x = nxt[a[x]][label[y] + 1];
int cur_y = nxt[a[y]][label[y] + 1];
int group;
if (cur_x != -1 && cur_y != -1) {
group = min(label[cur_x], label[cur_y]);
if (group == n) {
ans = max(ans, dp[x][y] + check(x, y, 3 * n - 1));
} else {
process(x, y, groups[group][0], groups[group][1], groups[group][2]);
}
}
group = label[y] + 1;
process(x, y, groups[group][0], groups[group][1], groups[group][2]);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
vector<int> tmp(3 * n);
for (int i = 0; i < 3 * n; i++) cin >> tmp[i];
int add = 0;
int _n = n;
a.push_back(tmp[0]);
a.push_back(tmp[1]);
for (int i = 2; i < 3 * n - 1; i += 3) {
if (tmp[i] == tmp[i + 1] && tmp[i + 1] == tmp[i + 2]) {
_n--;
add++;
} else {
a.push_back(tmp[i]);
a.push_back(tmp[i + 1]);
a.push_back(tmp[i + 2]);
}
}
a.push_back(tmp.back());
n = _n;
if (n == 0) {
cout << 0 + add << '\n';
return 0;
} else if (n == 1) {
if (a[0] == a[1] && a[1] == a[2]) {
cout << 1 + add << '\n';
} else {
cout << 0 + add << '\n';
}
return 0;
}
label[0] = label[1] = 0;
for (int i = 2; i < 3 * n; i++) {
label[i] = (i + 1) / 3;
groups[label[i]].push_back(i);
}
for (int i = 0; i < 3 * n; i++) {
id[i] = (int) loc[a[i]].size();
loc[a[i]].push_back(i);
}
for (int i = 0; i < 3 * n; i++) {
for (int j = 0; j < 3 * n; j++) {
dp[i][j] = -1;
}
}
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX; j++) {
nxt[i][j] = -1;
}
}
for (int i = 1; i <= n; i++) {
if((int) loc[i].size() == 0) continue;
for (int j: loc[i]) {
int cur = label[j];
while (cur != -1 && nxt[i][cur] == -1) {
nxt[i][cur] = j;
cur--;
}
}
}
dp[0][1] = 0;
for (int i = 1; i < 3 * n; i++) {
for (int j = 0; j < i; j++) {
if (dp[j][i] != -1) {
go(j, i);
}
}
}
cout << ans + add << '\n';
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, char> > vec1, vec2, vec3, vec4, vec5, vec6, vec7, vec8;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, x0, y0, x, y;
char ch;
cin >> n >> x0 >> y0;
for (long long i = 1; i <= n; i++) {
cin >> ch >> x >> y;
x -= x0;
y -= y0;
if (x == 0) {
if (y > 0)
vec1.push_back({y, ch});
else
vec2.push_back({-y, ch});
} else if (y == 0) {
if (x > 0)
vec4.push_back({x, ch});
else
vec3.push_back({-x, ch});
} else if (abs(x) == abs(y)) {
if (x > 0 && y > 0) vec5.push_back({abs(x), ch});
if (x > 0 && y < 0) vec6.push_back({abs(x), ch});
if (x < 0 && y < 0) vec7.push_back({abs(x), ch});
if (x < 0 && y > 0) vec8.push_back({abs(x), ch});
}
}
sort(vec1.begin(), vec1.end());
if (vec1.size() > 0) {
ch = vec1[0].second;
if (ch == 'R' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec2.begin(), vec2.end());
if (vec2.size() > 0) {
ch = vec2[0].second;
if (ch == 'R' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec3.begin(), vec3.end());
if (vec3.size() > 0) {
ch = vec3[0].second;
if (ch == 'R' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec4.begin(), vec4.end());
if (vec4.size() > 0) {
ch = vec4[0].second;
if (ch == 'R' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec5.begin(), vec5.end());
if (vec5.size() > 0) {
ch = vec5[0].second;
if (ch == 'B' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec6.begin(), vec6.end());
if (vec6.size() > 0) {
ch = vec6[0].second;
if (ch == 'B' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec7.begin(), vec7.end());
if (vec7.size() > 0) {
ch = vec7[0].second;
if (ch == 'B' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
sort(vec8.begin(), vec8.end());
if (vec8.size() > 0) {
ch = vec8[0].second;
if (ch == 'B' || ch == 'Q') {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
}
| 10 | CPP |
n=int(input())
a=input()
if a.count(a[0])==n:
print('NO')
else:
for i in range(1, n):
if a[i]!=a[i-1]:
print('YES')
print(a[i-1]+a[i])
break | 7 | PYTHON3 |
for i in range(int(input())):
x = int(input())
a = [i for i in list(map(int, input().split()))]
b = []
for i in range(x):
b.append([a[i], i])
c = sorted(b, key=lambda s: s[0])
c2 = [[j for j in i] for i in c]
for i in range(x//2):
c[i][0] = c[-(i + 1)][0] * (-1)
for i in range(x//2, x):
c[i][0] = c2[x-i-1][0]
c = sorted(c, key=lambda s: s[1])
print(*[i[0] for i in c])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long dp[1000000][4];
int main() {
long long n, i;
string s;
cin >> n;
cin >> s;
dp[0][0] = 1;
dp[0][1] = 1;
dp[0][2] = 1;
for (i = 1; i < n; i++) {
dp[i][0] = dp[i - 1][0] + (s[i] != s[i - 1]);
dp[i][1] = max(dp[i - 1][0] + (s[i] == s[i - 1]),
dp[i - 1][1] + (s[i] != s[i - 1]));
dp[i][2] = max(dp[i - 1][2] + (s[i] != s[i - 1]),
dp[i - 1][1] + (s[i] == s[i - 1]));
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n;
int cnt[2][2], ans[N], ansn;
struct Point {
int x, y;
} p[N];
int main() {
scanf("%d", &n);
cnt[0][0] = cnt[0][1] = cnt[1][0] = cnt[1][1] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i].x, &p[i].y);
p[i].x += 1e6, p[i].y += 1e6;
cnt[p[i].x & 1][p[i].y & 1]++;
}
if (n == 2) {
printf("1\n1\n");
return 0;
}
int sum =
(cnt[0][0] > 0) + (cnt[0][1] > 0) + (cnt[1][0] > 0) + (cnt[1][1] > 0);
while (sum == 1) {
cnt[0][0] = cnt[0][1] = cnt[1][0] = cnt[1][1] = 0;
for (int i = 1; i <= n; i++) {
p[i].x /= 2, p[i].y /= 2;
cnt[p[i].x & 1][p[i].y & 1]++;
}
sum = (cnt[0][0] > 0) + (cnt[0][1] > 0) + (cnt[1][0] > 0) + (cnt[1][1] > 0);
}
if (sum >= 3) {
for (int i = 1; i <= n; i++)
if ((p[i].x + p[i].y) & 1) ans[++ansn] = i;
} else if (sum == 2) {
for (int i = 1; i <= n; i++)
if (p[i].x & 1) ans[++ansn] = i;
if (ansn == 0 || ansn == n) {
for (int i = 1; i <= n; i++)
if (p[i].y & 1) ans[++ansn] = i;
}
}
printf("%d\n", ansn);
for (int i = 1; i <= ansn; i++) printf("%d ", ans[i]);
putchar(10);
return 0;
}
| 11 | CPP |
# import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
n, r, req_avg = map(int, input().split())
avgs = []
for _ in range(n):
a, b = map(int, input().split())
avgs.append((a, b))
required = n * req_avg - sum(x[0] for x in avgs)
if required <= 0:
print(0)
exit()
avgs.sort(key=lambda x: x[1])
total = 0
for curr, cost in avgs:
if required <= 0:
break
if curr >= r:
continue
# We can increment this.
increment_by = min(r - curr, required)
required -= increment_by
total += cost * increment_by
print(total)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using dbl = double;
using ii = pair<int, int>;
using lii = pair<ll, ll>;
template <class T>
using V = vector<T>;
ll N, K;
ll const MOD = (int)1e9 + 7;
ll s(ll a, ll d, ll n) { return (2 * a + d * (n - 1)) * n / 2; }
ll findq(ll a, ll d, ll v) {
int lo = 0, hi = 1e6, ret;
while (lo <= hi) {
int mid = (lo + hi) >> 1;
if (a + d * (mid - 1) > v) {
hi = mid - 1;
ret = mid;
} else
lo = mid + 1;
}
return ret - 1;
}
ll sum(ll a, ll d, ll srt, ll ed) {
ll na = a + d * srt;
ll ne = a + d * ed;
return (na + ne) * (ed - srt + 1) / 2;
}
ll r[1000005], l[1000005], a[1000005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> N >> K;
for (int i = 0; i < (int)N; i++) cin >> a[i];
for (int i = 0; i < (int)N; i++) r[i] = i, l[i] = i;
stack<lii> stk;
for (int i = 0; i < (int)N; i++) {
while (stk.size() && stk.top().first <= a[i]) {
r[stk.top().second] = i - 1;
stk.pop();
}
l[i] = stk.size() ? stk.top().second + 1 : 0;
stk.push({a[i], i});
}
while (stk.size()) {
r[stk.top().second] = N - 1;
stk.pop();
}
ll ret = 0;
for (int i = 0; i < (int)N; i++) {
ll q = (r[i] - l[i] + 1 - K) / (K - 1);
if (r[i] - l[i] + 1 - K < 0) continue;
ll rd = r[i] - i - K + 1 >= 0 ? (r[i] - i - K + 1) / (K - 1) + 1 : 0;
ll ld = i - l[i] + 1 - K >= 0 ? (i - l[i] + 1 - K) / (K - 1) + 1 : 0;
ll rtmp =
(((2 * K + ((K - 1) * q) % MOD) * (q + 1)) % MOD * (MOD + 1) / 2) % MOD;
if (rd <= q) {
ll tt1 = ((q - rd + 1) * r[i]) % MOD;
ll tt2 = (sum(i + K - 1, K - 1, rd, q)) % MOD;
if (tt1 - tt2 < 0)
tt1 = (tt1 - tt2 + MOD) % MOD;
else
tt1 = (tt1 - tt2) % MOD;
rtmp = (rtmp + tt1) % MOD;
}
if (ld <= q) {
ll tt1 = (sum(i - K + 1, 1 - K, ld, q)) % MOD;
ll tt2 = (q - ld + 1) * l[i];
if (tt1 - tt2 < 0)
tt1 = (tt1 - tt2 + MOD) % MOD;
else
tt1 = (tt1 - tt2) % MOD;
rtmp = (rtmp + tt1) % MOD;
}
ret = (ret + (rtmp * a[i]) % MOD) % MOD;
}
cout << ret << endl;
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2005;
int n, ct, ct1, ct2, cnt, ans_ct, head[Maxn], cur[Maxn], dis[Maxn], x[Maxn],
y[Maxn], tmp[Maxn];
pair<pair<int, int>, pair<int, int> > e[Maxn], ans[Maxn];
bool vis[Maxn];
map<pair<pair<int, int>, pair<int, int> >, int> Ma1, Ma2;
vector<pair<int, int> > Ve1[Maxn], Ve2[Maxn];
bool cross(pair<pair<int, int>, pair<int, int> > x,
pair<pair<int, int>, pair<int, int> > y) {
return y.first.second > x.first.second && y.first.second < x.second.second &&
x.first.first > y.first.first && x.first.first < y.second.first;
}
struct edg {
int nxt, to, w;
} edge[Maxn * Maxn];
void add(int x, int y) {
edge[++cnt] = (edg){head[x], y, 1};
head[x] = cnt;
edge[++cnt] = (edg){head[y], x, 0};
head[y] = cnt;
}
queue<int> Qu;
bool bfs(void) {
Qu.push(ct2 + 1);
memset(dis, 0, sizeof(int[ct2 + 3]));
while (!Qu.empty()) {
int u = Qu.front();
Qu.pop();
for (int i = head[u]; i; i = edge[i].nxt) {
int to = edge[i].to;
if (to != ct2 + 1 && !dis[to] && edge[i].w) {
dis[to] = dis[u] + 1;
Qu.push(to);
}
}
}
return dis[ct2 + 2];
}
int dfs(int u, int mini) {
if (u == ct2 + 2 || !mini) return mini;
int w, used = 0;
for (int& i = cur[u]; i; i = edge[i].nxt) {
int to = edge[i].to;
if (dis[u] + 1 == dis[to] && edge[i].w) {
w = dfs(to, min(mini - used, edge[i].w));
used += w, edge[i].w -= w, edge[((i - 1) ^ 1) + 1].w += w;
if (used == mini) return used;
}
}
return used;
}
void dinic(void) {
while (bfs()) {
memcpy(cur, head, sizeof(int[ct2 + 3]));
dfs(ct2 + 1, 0x3f3f3f3f);
}
}
void DFS(int u) {
vis[u] = true;
for (int i = head[u]; i; i = edge[i].nxt) {
int to = edge[i].to;
if (!vis[to] && !edge[i].w) DFS(to);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &x[i], &y[i]), tmp[++ct] = x[i], tmp[++ct] = y[i];
sort(tmp + 1, tmp + 1 + 2 * n);
ct = unique(tmp + 1, tmp + 1 + 2 * n) - tmp - 1;
for (int i = 1; i <= n; i++) {
x[i] = lower_bound(tmp + 1, tmp + 1 + ct, x[i]) - tmp;
y[i] = lower_bound(tmp + 1, tmp + 1 + ct, y[i]) - tmp;
Ve1[x[i]].push_back(make_pair(x[i], y[i]));
Ve2[y[i]].push_back(make_pair(x[i], y[i]));
}
for (int i = 1; i <= ct; i++)
sort(Ve1[i].begin(), Ve1[i].end()), sort(Ve2[i].begin(), Ve2[i].end());
for (int i = 1; i <= ct; i++)
for (int j = 0; j < (int)Ve1[i].size() - 1; j++) {
Ma1[make_pair(Ve1[i][j], Ve1[i][j + 1])] = ++ct1;
e[ct1] = make_pair(Ve1[i][j], Ve1[i][j + 1]);
}
ct2 = ct1;
for (int i = 1; i <= ct; i++)
for (int j = 0; j < (int)Ve2[i].size() - 1; j++) {
Ma2[make_pair(Ve2[i][j], Ve2[i][j + 1])] = ++ct2;
e[ct2] = make_pair(Ve2[i][j], Ve2[i][j + 1]);
}
for (int i = 1; i <= ct1; i++)
for (int j = ct1 + 1; j <= ct2; j++)
if (cross(e[i], e[j])) add(i, j);
for (int i = 1; i <= ct1; i++) add(ct2 + 1, i);
for (int i = ct1 + 1; i <= ct2; i++) add(i, ct2 + 2);
dinic();
for (int i = head[ct2 + 2]; i; i = edge[i].nxt) {
int to = edge[i].to;
if (!edge[i].w) DFS(to);
}
for (int i = head[ct2 + 1]; i; i = edge[i].nxt) vis[edge[i].to] ^= 1;
pair<int, int> las;
for (int i = 1; i <= ct; i++) {
if (Ve2[i].size()) las = Ve2[i][0];
for (int j = 0; j < (int)Ve2[i].size() - 1; j++)
if (!vis[Ma2[make_pair(Ve2[i][j], Ve2[i][j + 1])]])
ans[++ans_ct] = make_pair(las, Ve2[i][j]), las = Ve2[i][j + 1];
if (Ve2[i].size()) ans[++ans_ct] = make_pair(las, *Ve2[i].rbegin());
}
printf("%d\n", ans_ct);
for (int i = 1; i <= ans_ct; i++)
printf("%d %d %d %d\n", tmp[ans[i].first.first], tmp[ans[i].first.second],
tmp[ans[i].second.first], tmp[ans[i].second.second]);
ans_ct = 0;
for (int i = 1; i <= ct; i++) {
if (Ve1[i].size()) las = Ve1[i][0];
for (int j = 0; j < (int)Ve1[i].size() - 1; j++)
if (!vis[Ma1[make_pair(Ve1[i][j], Ve1[i][j + 1])]])
ans[++ans_ct] = make_pair(las, Ve1[i][j]), las = Ve1[i][j + 1];
if (Ve1[i].size()) ans[++ans_ct] = make_pair(las, *Ve1[i].rbegin());
}
printf("%d\n", ans_ct);
for (int i = 1; i <= ans_ct; i++)
printf("%d %d %d %d\n", tmp[ans[i].first.first], tmp[ans[i].first.second],
tmp[ans[i].second.first], tmp[ans[i].second.second]);
return 0;
}
| 12 | CPP |
n = int(input())
x = list(map(int, input().strip().split()))
i = 0
j = n-1
v = -1
steps = ""
while i!=j:
if x[i]>x[j]:
if x[j]>v:
steps += "R"
v = x[j]
j-=1
elif x[i]>v:
steps += "L"
v = x[i]
i += 1
else:
break
elif x[j]>x[i]:
if x[i]>v:
steps += "L"
v = x[i]
i += 1
elif x[j]>v:
steps += "R"
v = x[j]
j -= 1
else:
break
else:
if x[i]>v:
vk = v
k = i
stepsL = ""
while x[k]>vk and j!=k:
stepsL += "L"
vk = x[k]
k += 1
vk = v
k = j
stepsR = ""
while x[k]>vk and i!=k:
stepsR += "R"
vk = x[k]
k -= 1
if len(stepsL)>len(stepsR):
steps += stepsL
else:
steps+=stepsR
print(len(steps))
print(steps)
exit()
if x[i]>v:
steps += "R"
print(len(steps))
print(steps) | 9 | PYTHON3 |
k,x=map(int,input().split());print(*range(x-k+1,x+k)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, bool> > g[102];
bool visited[102];
int col[102];
int ans;
bool dfs(int s, int color) {
visited[s] = true;
col[s] = color;
int newcolor;
int i;
for (i = 0; i < g[s].size(); i++) {
newcolor = color ^ g[s][i].second ^ 1;
if (col[g[s][i].first] >= 0 && col[g[s][i].first] != newcolor) return false;
if (!visited[g[s][i].first] && !dfs(g[s][i].first, newcolor)) return false;
}
return true;
}
int main() {
int n, m, i, j, k, l;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> j >> k >> l;
g[j].push_back(make_pair(k, l));
g[k].push_back(make_pair(j, l));
}
for (i = 1; i <= n; i++) col[i] = -1;
for (i = 1; i <= n; i++) {
if (!visited[i]) {
if (dfs(i, 0) || dfs(i, 1)) {
} else {
cout << "Impossible";
return 0;
}
}
}
for (i = 1; i <= n; i++) {
if (col[i]) ans++;
}
cout << ans << endl;
for (i = 1; i <= n; i++) {
if (col[i]) cout << i << " ";
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
#include <cstdio>
#define x first
#define y second
using namespace std;
typedef long long ll;
const ll p = 1e9 + 7;
int a[201000], b[201000];
int tr[201000];
int lowbit(int x) {
return x & (-x);
}
int getsum(int x) {
int ans = 0;
while(x > 0) ans += tr[x], x -= lowbit(x);
return ans;
}
void add(int x) {
while(x <= 200000) tr[x]--, x += lowbit(x);
}
int main() {
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
int last = 0, ok = 0;
for(int i = 1; i <= n; i++) {
int pos = lower_bound(b + 1, b + 1 + n, a[i]) - b;
if(pos == last) continue;
if(pos>last&&getsum(pos - 1) - getsum(last)) {
ok = 1;
break;
}
if(pos<last&&getsum(last - 1) - getsum(pos)) {
ok = 1;
break;
}
last = pos;
add(pos);
}
for(int i = 1; i <= 200000; i++) tr[i] = 0;
if(ok) cout << "no" << endl;
else cout << "yes" << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100 * 1000 + 123, D = 1000 * 1000 * 1000 + 7;
inline long long pow(long long x, long long y) {
long long ret = 1;
for (; y; x = x * x % D, y >>= 1)
if (y & 1) ret = ret * x % D;
return ret;
}
long long n, k, f[MAXN], ivf[MAXN], ans, pd[MAXN], pt[MAXN];
string s;
inline long long ent(long long x, long long y) {
return (x >= y ? f[x] * ivf[x - y] % D * ivf[y] % D : 0);
}
int32_t main() {
f[0] = 1;
for (long long i = 1; i < MAXN; i++) f[i] = f[i - 1] * i % D;
ivf[MAXN - 1] = pow(f[MAXN - 1], D - 2);
for (long long i = MAXN - 2; ~i; i--) ivf[i] = ivf[i + 1] * (i + 1) % D;
pt[0] = 1;
for (long long i = 1; i < MAXN; i++) pt[i] = pt[i - 1] * 10 % D;
cin >> n >> k >> s;
for (long long i = 0; i < n - k; i++)
pd[i] = ((i > 0 ? pd[i - 1] : 0) + ent(n - 2 - i, k - 1) * pt[i] % D) % D;
for (long long i = max(n - k, 1ll); i < n; i++) pd[i] = pd[i - 1];
reverse(s.begin(), s.end());
for (long long i = 1; i < n; i++)
ans = (ans + (pd[i - 1] * (s[i] - '0') % D) +
(ent(n - 1 - i, k) * (s[i] - '0') * pt[i] % D)) %
D;
ans = (ans + (s[0] - '0') * ent(n - 1, k) % D) % D;
cout << ans;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[105], an1, an2;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int tot = 0;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) tot += a[n] - a[i];
if (tot >= m)
an1 = a[n];
else {
an1 = a[n] + (m - tot) / n;
if ((m - tot) % n) an1++;
}
an2 = a[n] + m;
printf("%d %d", an1, an2);
return 0;
}
| 7 | CPP |
n = int(input())
if n<=2:
print('NO')
elif n%2==0:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
from functools import reduce
from fractions import gcd
N, X = map(int, input().split())
A = [abs(a - X) for a in map(int, input().split())]
print(reduce(gcd, A)) | 0 | PYTHON3 |
import sys
from itertools import chain
def solve():
n, k = map(int, sys.stdin.readline().split())
a = list(map(int, sys.stdin.readline().split()))
ans = []
for i, x in enumerate(a):
if x % 2:
ans.append(i + 1)
if len(ans) < k or (len(ans) - k) % 2 != 0:
sys.stdout.write('NO\n')
else:
sys.stdout.write('YES\n')
sys.stdout.write(' '.join(map(str, chain(ans[:k - 1], (n,)))))
sys.stdout.write('\n')
def main():
q = int(input())
for _ in range(q):
solve()
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int fu(int **matrix, int **data, int rows, int columns) {
for (int i = 0; i < rows; i++)
for (int j = 0; j < columns; j++)
if (data[i][j] != matrix[i][j]) return 0;
return 1;
}
int compare(const void *a, const void *b) {
return *(long long *)a - *(long long *)b;
}
int good(long long *arr, int n) {
for (int i = 1; i < n; i++)
if (arr[i] < arr[i - 1]) return 0;
return 1;
}
int main(void) {
long long n;
cin >> n;
long long cpy = n;
for (int i = 1; i <= 16; i++) {
cpy = n + i;
while (cpy != 0) {
if (abs(cpy % 10) == 8) {
cout << i << endl;
return 0;
}
cpy /= 10;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[1000002], sum = 0;
int32_t main() {
long long n;
cin >> n;
long long sumsum = 0, akt = 0, pop = 0;
for (long long i = 0; i < n; i++) {
char c;
cin >> c;
if (c == '1') {
sum += dp[akt] + akt;
dp[akt + 1] += dp[akt];
if (akt == 0) {
dp[akt + 1]++;
sum += akt + 1;
}
dp[akt] = 1;
sumsum += sum;
pop = 1;
akt++;
} else {
if (pop == 1) {
dp[0] = 0;
}
dp[0]++;
sumsum += sum;
akt = 0;
pop = 0;
}
}
cout << sumsum << "\n";
};
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500003, mod = 1000000007;
int Plus(int x, int y) { return (x += y) >= mod ? x - mod : x; }
void PlusEqual(int &x, int y) {
if ((x += y) >= mod) x -= mod;
}
int mul(long long x, int y) { return x * y % mod; }
int n, p[maxn], pre[maxn], suf[maxn], a[maxn], ans;
bool cmp(int x, int y) { return a[x] < a[y]; }
void pre_add(int pos, int k) {
while (pos <= n) PlusEqual(pre[pos], k), pos += pos & -pos;
}
void suf_add(int pos, int k) {
while (pos) PlusEqual(suf[pos], k), pos -= pos & -pos;
}
int pre_query(int pos) {
int ret = 0;
while (pos) PlusEqual(ret, pre[pos]), pos -= pos & -pos;
return ret;
}
int suf_query(int pos) {
int ret = 0;
while (pos <= n) PlusEqual(ret, suf[pos]), pos += pos & -pos;
return ret;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i), p[i] = i;
sort(p + 1, p + n + 1, cmp);
for (int i = 1; i <= n; i++) {
int x = p[i];
PlusEqual(ans,
Plus(mul(a[x], mul(x, n - x + 1)),
mul(Plus(mul(pre_query(x), n - x + 1), mul(suf_query(x), x)),
a[x])));
pre_add(x, x);
suf_add(x, n - x + 1);
}
printf("%d", ans);
return 0;
}
| 12 | CPP |
n = int(input())
d = [4,7,47,74,44,77,444,447,474,777,774,747,744,477]
for i in d:
if(n%i==0):
print("YES")
exit(0)
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = 1;
for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
if (f) x = -x;
}
template <typename F>
inline void write(F x) {
static short st[30];
short tp = 0;
if (x < 0) putchar('-'), x = -x;
do st[++tp] = x % 10, x /= 10;
while (x);
while (tp) putchar('0' | st[tp--]);
putchar('\n');
}
template <typename T>
inline void Mx(T &x, T y) {
x < y && (x = y);
}
template <typename T>
inline void Mn(T &x, T y) {
x > y && (x = y);
}
const int N = 2000;
long long a1[N], a2[N], b1[N], b2[N], g[N], d[N], m, n;
void solve(long long x, int n, long long *c1, long long *c2) {
if (n == 0) return c1[0] = c2[0] = 0, void();
if (n == 1) return c1[1] = (x == 2), c2[1] = (x == 1), void();
if (x <= d[n - 1]) {
solve(x, n - 1, c1, c2);
c1[n] = min(c1[n - 1], c2[n - 1] + 2);
c2[n] = min(c1[n - 1], c2[n - 1]) + 1 + g[n - 2];
} else {
solve(x - d[n - 1], n - 2, c1, c2);
c1[n] = c1[n - 2] + 1, c2[n] = c2[n - 2];
}
}
long long Dis(long long x, long long y, int n) {
if (n <= 1) return x != y;
if (x <= d[n - 1]) {
if (y > d[n - 1]) return min(a1[n - 1], a2[n - 1]) + 1 + b1[n - 2];
return min(Dis(x, y, n - 1),
min(a1[n - 1] + b2[n - 1], a2[n - 1] + b1[n - 1]) + 2);
}
return Dis(x - d[n - 1], y - d[n - 1], n - 2);
}
int main() {
read(m), read(n), Mn(n, 80ll), d[0] = 1, d[1] = 2;
for (int i = 2; i <= 80; i++) d[i] = d[i - 1] + d[i - 2];
g[1] = g[2] = 1;
for (int i = 3; i <= 80; i++) g[i] = g[i - 2] + 1;
while (m--) {
long long x, y;
read(x), read(y);
if (x > y) swap(x, y);
solve(x, n, a1, a2), solve(y, n, b1, b2);
write(Dis(x, y, n));
}
return 0;
}
| 11 | CPP |
#author: riyan
if __name__ == '__main__':
tc = int(input().strip())
for t in range(tc):
n, x = map(int, input().strip().split())
arr = list(map(int, input().strip().split()))
arr.sort(reverse = True)
ans = 0
carr = 0
for i in range(n):
if arr[i] >= x:
carr += (arr[i] - x)
arr[i] = x
ans += 1
else:
if arr[i] + carr >= x:
carr -= (x - arr[i])
arr[i] = x
ans += 1
else:
arr[i] += carr
carr = 0
print(ans)
| 8 | PYTHON3 |
a=int(input())
if 2<a<=100 and a%2==0:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
for _ in range(int(input())):
n, p = map(int, input().split())
a = list(map(int, input().split()))
b = [p] * (n - 1)
cur = a[0]
for i in range(1, n):
if a[i] % cur == 0:
b[i - 1] = min(cur, b[i - 1])
else:
cur = a[i]
cur = a[n-1]
for i in range(n-2, -1, -1):
if a[i] % cur == 0:
b[i] = min(cur, b[i])
else:
cur = a[i]
print(sum(b)) | 10 | PYTHON3 |
Subsets and Splits