solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
nb = int(input())
for k in range(nb):
l = int(input())
T = list(map(int, input().split(" ")))
k = 0
joueur = 0
b = False
while not b and k < l:
if T[k] > 1:
b = True
else :
joueur = 1 - joueur
k += 1
if b and joueur == 0:
print("First")
elif b and joueur == 1:
print("Second")
elif l%2 == 0 :
print("Second")
else :
print("First") | 1,100 | PYTHON3 |
t = int(input())
for q in range(t):
n,k = map(int,input().split())
s = input()
ans = 0
count = 0
total = 0
for i in range(k):
count = 0
for j in range(i,n,k):
if s[j] == '1':
count+=1
total+=1
else:
count -= 1
if count < 0:
count = 0
ans = max(count,ans)
print(total-ans)
| 1,900 | PYTHON3 |
n=int(input())
k=0
while n:
c=0
l=list(map(int,input().split()))
for i in range(0,3):
if l[i]==1:
c=c+1
if c>=2:
k=k+1
n=n-1
print(k)
| 800 | PYTHON3 |
a = input()
b = list(a)
c = len(a)
d = 0
for x in range(c):
if b[x] == "H" or b[x] == "Q" or b[x] == "9" :
d+=1
if d >0:
print("YES")
else:
print("NO")
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int infi = 1e9;
const long long int infl = 1e18;
const int MOD = 1e9 + 7;
long long int log_2(long long int n) {
return (n > 1ll) ? 1ll + log_2(n / 2) : 0ll;
}
inline void add(long long int &a, long long int b) {
a += b;
if (a >= MOD) a -= MOD;
}
inline void sub(long long int &a, long long int b) {
a -= b;
if (a < 0) a += MOD;
}
inline string IntToString(long long int a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
inline long long int StringToInt(string a) {
char x[100];
long long int res;
strcpy(x, a.c_str());
sscanf(x, "%lld", &res);
return res;
}
inline string GetString(void) {
char x[1000005];
scanf("%s", x);
string s = x;
return s;
}
inline string uppercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
return s;
}
inline string lowercase(string s) {
int n = (int)s.size();
for (int(i) = (0); (i) < (n); ++(i))
if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
return s;
}
inline void OPEN(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
void showarr(long long int arr[], long long int n) {
int i;
for (i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
}
void showvec(vector<long long int> v) {
int i;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
int isPalindrome(string str) {
int l = 0;
int h = str.length() - 1;
while (h > l) {
if (str[l++] != str[h--]) {
return 0;
}
}
return 1;
}
void showvecpair(vector<pair<long long int, long long int> > v) {
for (int i = 0; i < (int)v.size(); i++) {
cout << v[i].first << " " << v[i].second << endl;
}
}
bool sortbysec(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b) {
return (a.second < b.second);
}
void bin(unsigned n) {
unsigned i;
for (i = 1 << 31; i > 0; i = i / 2) (n & i) ? printf("1") : printf("0");
}
long long int cntset(long long int n) {
bitset<64> b1(n);
return b1.count();
}
long long int p[100005];
void seive() {
long long int i, j;
for (i = 0; i < 100005; i++) p[i] = i;
for (i = 2; i <= sqrt(100005); i++) {
if (p[i] != i) continue;
for (j = i * i; j < 100005; j += i) {
if (p[j] == j) p[j] = i;
}
}
return;
}
long long int power(long long int n, long long int x) {
long long int j = n, prod = 1;
while (x) {
if (x % 2) {
prod = ((prod % MOD) * (j % MOD)) % MOD;
}
j = (j * j) % MOD;
x = x / 2;
}
return prod;
}
void solve() {
long long int w, y, u, v, c = 0, k, m, l, a, b, n, i, j, max = INT_MIN,
min = INT_MAX, ctr = m, cnt = n, x, ans;
cin >> n >> m >> k;
ans = n * m;
ctr = m;
cnt = n;
y = (n - 1) / k;
if (y > 0) {
c = -1;
if (n - k * y > 0)
cnt = (y + 1ll) * (n - k * y);
else
cnt = (y + 1ll);
}
x = (m - 1) / k;
if (x > 0) {
c = -1;
if (m - k * x > 0)
ctr = (x + 1ll) * (m - k * x);
else
ctr = (x + 1ll);
}
if (c == 0)
cout << ans << endl;
else
cout << cnt * ctr << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, T;
T = 1;
for (i = 1; i <= T; i++) {
solve();
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct bit {
bit(){};
unsigned int a[(100000 >> 5) + 4];
int size;
void setSize(int sz) { size = (sz >> 5) + 2; }
void set(int pos, int val) {
int ind = pos >> 5;
unsigned int r = 1;
if (val == 1) {
a[ind] |= r << (pos & 31);
} else {
if (a[ind] & (r << (pos & 31))) a[ind] -= r << (pos & 31);
}
}
int get(int pos) {
int ind = pos >> 5;
unsigned int r = 1;
return (a[ind] & (r << (pos & 31))) > 0;
}
void shiftR(int n) {
int cnt = n >> 5;
if (cnt)
for (int i = size; i >= 0; --i) {
if (i + cnt <= size) a[i + cnt] = a[i];
a[i] = 0;
}
cnt = n & 31;
if (cnt) {
unsigned int r = 1, last = (r << cnt) - 1, mask = 0;
for (int i = 0; i <= size; ++i) {
last = a[i] >> (32 - cnt);
a[i] <<= cnt;
a[i] |= mask;
mask = last;
}
}
}
};
int n, d, x, a[100005], b[100005];
int getNextX() {
x = (1LL * x * 37 + 10007) % 1000000007;
return x;
}
void initAB() {
for (int i = 0; i < n; i = i + 1) {
a[i] = i + 1;
}
for (int i = 0; i < n; i = i + 1) {
swap(a[i], a[getNextX() % (i + 1)]);
}
for (int i = 0; i < n; i = i + 1) {
if (i < d)
b[i] = 1;
else
b[i] = 0;
}
for (int i = 0; i < n; i = i + 1) {
swap(b[i], b[getNextX() % (i + 1)]);
}
}
bit bs, used, tmp;
int ans[100005], fbit[1 << 16];
int main() {
for (int mask = 0; mask < (1 << 16); ++mask) {
fbit[mask] = -1;
for (int j = 0; j < 16; ++j) {
if (mask & (1 << j)) {
fbit[mask] = j;
break;
}
}
}
scanf("%d%d%d", &n, &d, &x);
bs.setSize(n);
used.setSize(n);
initAB();
for (int i = 0; i < n; ++i) {
if (b[i]) bs.set(i, 1);
used.set(i, 1);
}
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i) {
v.push_back(make_pair(a[i], i));
}
sort(v.rbegin(), v.rend());
int MASK = (1 << 16) - 1;
for (int t = 0; t < v.size(); ++t) {
memcpy(tmp.a, bs.a, sizeof(tmp.a));
tmp.size = bs.size;
tmp.shiftR(v[t].second);
for (int i = 0; i < used.size; ++i) {
if (used.a[i] & tmp.a[i]) {
unsigned int val = used.a[i] & tmp.a[i], one = 1;
int mask = val & MASK, j;
while (fbit[mask] != -1) {
j = fbit[mask];
mask -= 1 << j;
used.set(i * 32 + j, 0);
ans[i * 32 + j] = v[t].first;
}
mask = (val >> 16) & MASK;
while (fbit[mask] != -1) {
j = fbit[mask];
mask -= 1 << j;
used.set(i * 32 + 16 + j, 0);
ans[i * 32 + 16 + j] = v[t].first;
}
}
}
}
for (int i = 0; i < n; ++i) printf("%d\n", ans[i]);
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
return os << "(" << x.first << "," << x.second << ")";
}
vector<int> cycle;
const int MAXN = 15005;
bool used[MAXN];
int head = -1;
vector<int> E[MAXN];
bool go(int x, int p = -1) {
used[x] = true;
for (int y : E[x]) {
if (y == p) continue;
if (used[y]) {
assert(head == -1);
head = y;
cycle.push_back(x);
return true;
}
if (go(y, x)) {
cycle.push_back(x);
if (head == x) return false;
return true;
}
}
return false;
}
int no1, no2;
long long F[MAXN], S[MAXN], G[MAXN];
int n;
void solve(int x, int p = -1) {
S[x] = 1;
long long maxg = LLONG_MIN;
for (int y : E[x]) {
if (y == no1 || y == no2 || y == p) continue;
solve(y, x);
S[x] += S[y];
F[x] += F[y];
maxg = max(maxg, G[y] - F[y] - S[y]);
}
G[x] = n + F[x] + (maxg == LLONG_MIN ? 0 : maxg);
F[x] += S[x];
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
E[u].push_back(v);
E[v].push_back(u);
}
go(0);
long long sumF = 0;
int c = cycle.size();
for (int i = 0; i < c; ++i) {
no1 = cycle[(i - 1 + c) % c];
no2 = cycle[(i + 1) % c];
solve(cycle[i]);
F[cycle[i]] -= S[cycle[i]];
sumF += F[cycle[i]];
}
vector<int> prefixS(c + 1);
for (int i = 0; i < c; ++i) prefixS[i + 1] = prefixS[i] + S[cycle[i]];
vector<int> dp(c), ndp(c);
function<int(int, int)> calcSum = [&](int a, int b) {
if (b >= c) return n - prefixS[a] + prefixS[b - c + 1];
return prefixS[b + 1] - prefixS[a];
};
assert(prefixS[c] == n);
for (int l = c - 1; l >= 1; --l) {
for (int i = 0; i < c; ++i) {
ndp[i] = n - calcSum(i, i + l - 1);
ndp[i] += max(dp[i], dp[i ? i - 1 : c - 1]);
}
swap(dp, ndp);
}
long long ans = 0;
for (int i = 0; i < c; ++i) {
long long v = G[cycle[i]];
long long val = sumF + dp[i] - F[cycle[i]];
val += v;
ans = max(ans, val);
}
printf("%lld\n", ans);
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, h[256], b[512], e[512], z = 2, q[256];
void go(int x, int y) {
int s = 0;
for (int i = 2; i < z; i += 2) {
int v[256] = {0}, d = 0, t = 0;
v[q[t++] = x] = 1;
while (d < t && !v[y]) {
int a = q[d++];
for (int j = h[a]; j > 0; j = e[j])
if (j / 2 * 2 != i && !v[b[j]]) v[q[t++] = b[j]] = 1;
}
if (!v[y]) ++s;
}
cout << s << endl;
}
int main() {
cin >> n >> m;
for (int i = 0, x, y; i < m && cin >> x >> y; ++i)
b[z] = y, e[z] = h[x], h[x] = z++, b[z] = x, e[z] = h[y], h[y] = z++;
cin >> k;
for (int i = 0, x, y; i < k && cin >> x >> y; ++i) go(x, y);
}
| 1,600 | CPP |
usern = input()
setUser = set(usern)
leny = len(setUser)
if(leny%2 != 0):
print('IGNORE HIM!')
else:
print('CHAT WITH HER!')
| 800 | PYTHON3 |
from collections import defaultdict
from math import sqrt,factorial,gcd,log2,inf,ceil
# map(int,input().split())
n,m,q = map(int,input().split())
pref = [0]*(n+1)
s = input()
s1 = input()
for i in range(n):
z = s[i:i+m]
if z == s1:
pref[i+1] = 1
# print(pref)
for i in range(q):
a,b = map(int,input().split())
b-=m
b+=1
if a<=b:
print(sum(pref[a:b+1]))
else:
print(0)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
void solve() {
string l = "", s, t;
cin >> n;
cin >> s >> t;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
k++;
l += s[i];
l += t[i];
}
}
if (k != 2)
cout << "NO" << endl;
else {
if (l.substr(0, 2) == l.substr(2, 2))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
l = "";
k = 0;
}
int main() {
int q;
cin >> q;
while (q--) {
solve();
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
void open(const char *s) {}
int rd() {
int s, c;
while ((c = getchar()) < '0' || c > '9')
;
s = c - '0';
while ((c = getchar()) >= '0' && c <= '9') s = s * 10 + c - '0';
return s;
}
const int N = 1000010;
char s1[N], s2[N], s[N];
pair<int, int> ans[N];
namespace pam {
int next[N][30];
int fail[N];
int len[N];
int last;
int n;
int cnt;
int a[N];
int diff[N];
int slink[N];
void init() {
cnt = 1;
len[1] = -1;
fail[0] = 1;
fail[1] = 0;
diff[0] = -1;
diff[1] = -1;
last = 0;
}
void insert(int v) {
a[++n] = v;
while (a[n - len[last] - 1] != a[n]) last = fail[last];
int now = last;
if (!next[now][v]) {
int cur = ++cnt;
len[cur] = len[last] + 2;
last = fail[last];
while (a[n - len[last] - 1] != a[n]) last = fail[last];
fail[cur] = next[last][v];
diff[cur] = len[cur] - len[fail[cur]];
if (diff[cur] == diff[fail[cur]])
slink[cur] = slink[fail[cur]];
else
slink[cur] = fail[cur];
next[now][v] = cur;
}
last = next[now][v];
}
pair<int, int> s0[N], s1[N];
void gao(int x) {
ans[x].first = 0x3fffffff;
for (int i = last; len[i] > 0; i = slink[i]) {
s0[i] = s1[i] = pair<int, int>(0x3fffffff, 0);
if ((x - (len[slink[i]] + diff[i])) & 1)
s1[i] = pair<int, int>(ans[x - (len[slink[i]] + diff[i])].first,
x - (len[slink[i]] + diff[i]));
else
s0[i] = pair<int, int>(ans[x - (len[slink[i]] + diff[i])].first,
x - (len[slink[i]] + diff[i]));
if (diff[i] == diff[fail[i]]) {
s0[i] = min(s0[i], s0[fail[i]]);
s1[i] = min(s1[i], s1[fail[i]]);
}
if (x & 1)
ans[x] = min(ans[x], pair<int, int>(s1[i].first + 1, s1[i].second));
else
ans[x] = min(ans[x], pair<int, int>(s0[i].first + 1, s0[i].second));
}
}
} // namespace pam
int main() {
open("xsy3225");
scanf("%s", s1 + 1);
scanf("%s", s2 + 1);
int n = strlen(s1 + 1);
for (int i = 1; i <= n; i++) {
s[2 * i - 1] = s1[i];
s[2 * i] = s2[i];
}
n *= 2;
pam::init();
for (int i = 1; i <= n; i++) {
if (i == 292) int xxx = 1;
pam::insert(s[i] - 'a' + 1);
pam::gao(i);
if (!(i & 1) && s[i - 1] == s[i]) ans[i] = min(ans[i], ans[i - 2]);
}
if (ans[n].first >= 0x3fffffff)
printf("-1\n");
else {
printf("%d\n", ans[n].first);
for (int i = n; i >= 1;)
if (ans[i].first == ans[i - 2].first && s[i - 1] == s[i])
i -= 2;
else {
printf("%d %d\n", ans[i].second / 2 + 1, i / 2);
i = ans[i].second;
}
}
return 0;
}
| 3,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const long long MOD = 1e9 + 7;
const double eps = 1e-9;
int n;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
cin >> s;
int ans = 0;
for (int i = 1; i < n; i++) ans += (s[i] != s[i - 1]);
cout << min(n, ans + 3) << "\n";
}
| 1,600 | CPP |
line=input().split()
r=int(line[0])
b=int(line[1])
x=min(r,b)
r-=x
b-=x
y=max(r//2,b//2)
print(x,y) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mod = 1000000007;
long long p[6][maxn], s[6][maxn];
int c[10][10];
int n, m;
int a[maxn];
struct segtree {
int sum[6][maxn << 2];
long long flag[maxn << 2];
long long Pow(int a, int b) {
long long ans = 1;
for (int i = 1; i <= b; i++) ans = ans * a % mod;
return ans;
}
void init() {
c[0][0] = 1;
for (int i = 1; i < 6; i++) {
c[i][i] = 1;
for (int j = 0; j < i; j++) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
for (int i = 1; i < maxn; i++)
for (int j = 0; j < 6; j++) p[j][i] = Pow(i, j);
for (int i = 1; i < maxn; i++)
for (int j = 0; j < 6; j++) s[j][i] = (s[j][i - 1] + p[j][i]) % mod;
}
void build(int l, int r, int rt) {
flag[rt] = -1;
if (l == r) {
for (int i = 0; i < 6; i++) sum[i][rt] = p[i][l] * a[l] % mod;
} else {
int m = (l + r) >> 1;
build(l, m, rt << 1);
build(m + 1, r, rt << 1 | 1);
pushup(rt);
}
}
void pushdown(int rt, int l, int r) {
int m = (l + r) >> 1, ls = rt << 1, rs = ls | 1;
if (~flag[rt]) {
for (int i = 0; i < 6; i++) {
sum[i][ls] = (flag[rt] * (s[i][m] - s[i][l - 1]) % mod + mod) % mod;
sum[i][rs] = (flag[rt] * (s[i][r] - s[i][m]) % mod + mod) % mod;
}
flag[ls] = flag[rs] = flag[rt];
flag[rt] = -1;
}
}
void pushup(int rt) {
int ls = rt << 1, rs = rt << 1 | 1;
for (int i = 0; i < 6; i++) sum[i][rt] = (sum[i][ls] + sum[i][rs]) % mod;
}
void update(int L, int R, int val, int l, int r, int rt) {
if (L <= l && r <= R) {
flag[rt] = val;
for (int i = 0; i < 6; i++)
sum[i][rt] = (flag[rt] * (s[i][r] - s[i][l - 1]) % mod + mod) % mod;
return;
}
pushdown(rt, l, r);
int m = (l + r) >> 1;
if (L <= m) update(L, R, val, l, m, rt << 1);
if (R > m) update(L, R, val, m + 1, r, rt << 1 | 1);
pushup(rt);
}
int query(int L, int R, int dem, int l, int r, int rt) {
if (L <= l && r <= R) {
return sum[dem][rt];
}
pushdown(rt, l, r);
int m = (l + r) >> 1;
int ans = 0;
if (L <= m) ans = (ans + query(L, R, dem, l, m, rt << 1)) % mod;
if (R > m) ans = (ans + query(L, R, dem, m + 1, r, rt << 1 | 1)) % mod;
return ans;
}
} st;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
st.init();
st.build(1, n, 1);
char op[5];
int l, r, k;
while (m--) {
scanf("%s", op);
scanf("%d%d%d", &l, &r, &k);
if (op[0] == '?') {
long long ans = 0;
long long tmp = 1;
for (int i = 0; i <= k; i++) {
ans += (long long)st.query(l, r, k - i, 1, n, 1) * c[k][i] % mod * tmp %
mod;
ans %= mod;
tmp = tmp * (1 - l) % mod;
}
printf("%I64d\n", (ans + mod) % mod);
} else {
st.update(l, r, k, 1, n, 1);
}
}
return 0;
}
| 2,500 | CPP |
for ad in range(int(input())):
s=list(input())
c = 0;
ans = len(s)
x=-1
for i in range(len(s)):
if s[i] == "+":
c += 1
elif s[i] == "-":
c -= 1
if c == x:
x -= 1
ans += i+1
print(ans) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e3 + 5;
const int mod = (int)1e9 + 7;
inline bool B(int a, int b) { return (a & (1 << b)) > 0; }
int n, ans[N], cn, a[N];
vector<int> z[20];
inline void solve() {
scanf("%d", &n);
memset(ans, 63, sizeof ans);
for (int i = 0; i < (1 << 13); i++) {
if (__builtin_popcount(i) == 6) {
cn++;
if (cn <= n) {
for (int j = 0; j < 13; j++) {
if (B(i, j)) {
z[j].emplace_back(cn);
}
}
}
}
}
for (int i = 0; i < 13; i++) {
if (z[i].size() > 0) {
printf("%d\n", z[i].size());
for (auto j : z[i]) {
printf("%d ", j);
}
puts("");
fflush(stdout);
for (int j = 1; j <= n; j++) {
scanf("%d", &a[j]);
if (!binary_search(z[i].begin(), z[i].end(), j)) {
ans[j] = min(ans[j], a[j]);
}
}
}
}
puts("-1");
for (int i = 1; i <= n; i++) {
printf("%d%c", ans[i], " \n"[i == n]);
}
}
int tests = 1;
int main() {
while (tests--) {
solve();
}
return 0;
}
| 1,900 | CPP |
s,n,q,a=input(),int(input()),{},""
for i in s:q[i]=[q[i][0]+1,1]if i in q else [1,1]
if len(q)>n:print(-1)
else:
for i in range(n-len(q)):
o=0
for j in q:
m=(q[j][0]+q[j][1]-1)//q[j][1]
if m>o:o,w=m,j
q[w][1]=q[w][1]+1
o=0
for i in q:
a+=i*q[i][1]
m=(q[i][0]+q[i][1]-1)//q[i][1]
if m>o:o=m
print(o,"\n",a) | 1,400 | PYTHON3 |
#!/usr/bin/env python3
N = int(input())
is_prime = [True]*(N+1)
primes = set()
for i in range(2, N+1):
if is_prime[i]:
for j in range(i, N+1, i):
is_prime[j] = False
primes.add(i)
ans = set()
for p in primes:
for k in range(1, N + 1):
if p**k <= N:
ans.add(p**k)
else:
break
print(len(ans))
print(' '.join(str(x) for x in ans)) | 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long INF = (long long)1e20;
long long mod = (long long)1e9 + 7;
long long iINF = (int)1e20;
mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
long long dp[4100][4100];
long long c[2001][2001];
long long calc(long long open, long long close) {
if (open == 0 && close == 0) {
dp[open + close][open - close] = 1;
return dp[open + close][open - close];
}
if (close > open || close < 0) {
return 0;
}
if (dp[open + close][open - close] != 0) {
return dp[open + close][open - close];
}
dp[open + close][open - close] =
(calc(open, close - 1) + calc(open - 1, close)) % mod;
return dp[open + close][open - close];
}
signed main() {
long long n, m;
cin >> n >> m;
int bal = 0, min_bal = 0;
for (int i = 0; i < m; ++i) {
char c;
cin >> c;
if (c == '(') {
++bal;
} else {
--bal;
}
min_bal = min(min_bal, bal);
}
fill(&dp[0][0], &dp[0][0] + 4100 * 4100, 0);
long long num = calc(2001, 2001);
c[1][0] = 1;
c[1][1] = 1;
c[0][0] = 1;
for (int i = 2; i < 2001; ++i) {
c[i][0] = 1;
c[i][i] = 1;
for (int j = 1; j < i; ++j) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
long long ans = 0;
for (int i = 0; i <= (n - m); ++i) {
for (int b = -min_bal; b <= i; ++b) {
if (n - m - i >= b + bal) {
ans += (dp[i][b] * dp[n - m - i][b + bal]) % mod;
ans %= mod;
}
}
}
cout << ans;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<vector<char>> mat(n, vector<char>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
cin >> mat[i][j];
vector<vector<int>> left(n, vector<int>(m));
vector<vector<int>> right(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
left[i][0] = (int)(mat[i][0] == '*');
for (int j = 1; j < m; ++j)
left[i][j] = mat[i][j] == '*' ? left[i][j - 1] + 1 : 0;
right[i][m - 1] = (int)(mat[i][m - 1] == '*');
for (int j = m - 2; j >= 0; --j)
right[i][j] = mat[i][j] == '*' ? right[i][j + 1] + 1 : 0;
}
ll cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
int height = 1;
while (i + height - 1 < n) {
int width = 2 * min(left[i + height - 1][j], right[i + height - 1][j]) - 1;
if (width < 2 * height - 1)
break;
++cnt;
++height;
}
}
}
cout << cnt << "\n";
}
return 0;
}
| 1,400 | CPP |
from math import log2
for _ in range(int(input())):
n = int(input())
l = list(map(int, input().split()))
max = l[0]
ans = 0
for i in l:
if i >= max:
max = i
else:
j = int(log2(max - i)) + 1
if j > ans:
ans = j
print(ans) | 1,500 | PYTHON3 |
def main():
n = int(input())
a = [int(i) for i in input().split()]
s = {}
z = max(a)
dp = [0] * (z + 1)
for i in range(z):
s[i + 1] = 0
for i in a:
s[i] += 1
dp[1] = s[z] * z
for i in range(2, z + 1):
dp[i] = max(dp[i - 1], dp[i - 2] + s[z - i + 1] * (z - i + 1))
print(dp[-1])
main() | 1,500 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Tue Apr 7 13:22:50 2020
@author: dell
"""
result = 0
n = (int)(input())
s = ""
for i in range (0,n):
s = input()
if '+' in s:
result= result+1
else:
result = result-1
print(result) | 800 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
l.sort(); ans=100000
for i in range(1,n):
ans=min(ans,l[i]-l[i-1])
print(ans)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
const int ZERO = 10000 + 10;
const int LIMIT = 10000 + 10;
const int MOD = 1e9 + 7;
int dp[2][ZERO + LIMIT];
int main() {
int n;
scanf("%d", &n);
vi a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof(dp));
int answer = 0;
dp[0][a[0] + ZERO] = 1;
dp[0][-a[0] + ZERO] = 1;
dp[0][ZERO] = 1;
for (int i = 1; i < n; ++i) {
int x = a[i];
memset(dp[i % 2], 0, sizeof(dp[i % 2]));
for (int j = 0; j < ZERO + LIMIT; ++j) {
int t1 = (j - x >= ZERO - LIMIT) ? dp[1 - (i % 2)][j - x] : 0;
int t2 = (j + x < ZERO + LIMIT) ? dp[1 - (i % 2)][j + x] : 0;
dp[i % 2][j] = (t1 + t2) % MOD;
}
answer += dp[i % 2][ZERO];
answer %= MOD;
dp[i % 2][ZERO]++;
}
printf("%d\n", answer);
return 0;
}
| 2,300 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.sort()
print(sum(int((a[i]+a[-(i+1)])**2) for i in range(int(n/2))))
| 900 | PYTHON3 |
#! usr/bin/env python
# -*- coding: utf-8 -*-
MOD = 10 ** 9 + 7
MAX_N = 2 * 10 ** 5 + 5
dp = [[0] * 3 for i in range(MAX_N)]
def main():
n, l, r = map(int, input().split())
k0 = r // 3 - (l-1) // 3
k1 = (r//3+(r % 3 >= 1)) - ((l-1)//3+((l-1) % 3 >= 1))
k2 = (r//3+(r % 3 >= 2)) - ((l-1)//3+((l-1) % 3 >= 2))
dp[0][0], dp[0][1], dp[0][2] = k0, k1, k2
for i in range(1, n):
dp[i][0] = dp[i-1][0] * k0 + dp[i-1][1] * k2 + dp[i-1][2] * k1
dp[i][1] = dp[i-1][0] * k1 + dp[i-1][1] * k0 + dp[i-1][2] * k2
dp[i][2] = dp[i-1][0] * k2 + dp[i-1][1] * k1 + dp[i-1][2] * k0
for j in range(3):
dp[i][j] %= MOD
print(dp[n-1][0])
if __name__ == '__main__':
main()
| 1,500 | PYTHON3 |
for i in range(int(input())):
n, m = [int(x) for x in input().split()]
if n % m == 0:
print('YES')
else:
print('NO') | 800 | PYTHON3 |
count = int(input())
shows = []
impossible = False
showing = 0
for i in range(count):
show = input().split(' ')
shows.append([int(show[0]), 1])
shows.append([int(show[1]) + 1, -1])
shows.sort(key=lambda iterableShow: iterableShow[0] * 3 + iterableShow[1])
for i in range(count * 2):
showing += shows[i][1]
if showing > 2:
print("NO")
impossible = True
break
if not impossible:
print("YES")
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void Down_sum(vector<int> &p, vector<int> &l, vector<int> &d, vector<int> &b,
int &sum, int n) {
bool f = true, f2 = true;
while (f) {
f2 = true;
f = true;
int second = 0, md = 1e9;
for (int i = 2; i <= n; ++i)
if (b[i] != 1 && l[i] == 1 && d[i] < md) {
second = i;
md = d[i];
f2 = false;
}
for (int i = 1; i <= n; ++i)
if (l[i] != -1 && d[i] == d[second] - 2) {
--sum;
--l[i];
--d[second];
++l[p[second]];
p[second] = i;
f = false;
break;
}
if (f) b[second] = 1;
if (f2) {
sum = -1;
break;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int t = 100;
cin >> t;
while (t--) {
int n, D;
cin >> n >> D;
vector<int> p(n + 1, 0);
vector<int> d(n + 1, 0), s2(n + 1, 0);
vector<int> l(n + 1, 1);
vector<int> b(n + 1, 0);
int sum = 0, minD = 0;
for (int i = 2; i <= n; ++i) {
s2[i] = s2[i / 2] + 1;
minD += s2[i];
--l[i - 1];
p[i] = i - 1;
d[i] = d[i - 1] + 1;
sum += d[i];
}
if (sum < D || minD > D) {
cout << "NO\n";
continue;
}
while (sum > D) {
Down_sum(p, l, d, b, sum, n);
}
if (sum == -1) {
cout << "NO\n";
continue;
}
cout << "YES\n";
for (int i = 2; i <= n; ++i) cout << p[i] << " ";
cout << "\n";
}
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> g[100001];
int depth[100001], sz[100001];
int tin[100001], tout[100001];
int pr[100001][20];
int tclock = 0;
int LogN;
void dfs(int v, int p) {
tin[v] = tclock++;
sz[v] = 1;
pr[v][0] = p;
for (int i = 1; i <= LogN; ++i) pr[v][i] = pr[pr[v][i - 1]][i - 1];
for (auto i : g[v]) {
if (i == p) continue;
depth[i] = depth[v] + 1;
dfs(i, v);
sz[v] += sz[i];
}
tout[v] = tclock;
}
int isParent(int a, int b) { return tin[a] <= tin[b] && tout[a] >= tout[b]; }
int lca(int a, int b) {
if (isParent(a, b)) return a;
if (isParent(b, a)) return b;
for (int i = LogN; i >= 0; --i)
if (!isParent(pr[a][i], b)) a = pr[a][i];
return pr[a][0];
}
int NthParent(int v, int len) {
int pos = 0;
for (int i = LogN; i >= 0; --i) {
if (pos + (1 << i) <= len) {
pos += 1 << i;
v = pr[v][i];
}
}
return v;
}
inline int getDist(int a, int b, int par) {
return (depth[a] - depth[par]) + (depth[b] - depth[par]);
}
int main() {
cin.sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int a, b;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
while ((1 << LogN) < n) ++LogN;
dfs(0, 0);
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
--a, --b;
if (a == b) {
cout << n << '\n';
continue;
}
int par = lca(a, b);
int dist = getDist(a, b, par);
if (dist & 1) {
cout << 0 << '\n';
continue;
}
if (depth[a] == depth[b]) {
int nth = dist / 2 - 1;
int para = NthParent(a, nth);
int parb = NthParent(b, nth);
cout << n - sz[para] - sz[parb] << '\n';
} else {
int mid = dist / 2;
int lower = dist / 2 - 1;
if (depth[a] < depth[b]) swap(a, b);
int pmid = NthParent(a, mid);
int plower = NthParent(a, lower);
cout << sz[pmid] - sz[plower] << '\n';
}
}
return 0;
}
| 2,100 | CPP |
t=int(input())
for i in range(t):
a,b=map(int,input().split())
if b>a:a,b=b,a
s=a+b
f=True
if s%3!=0:
f=False
if a>(2*b):
f=False
if f:
print("YES")
else:
print("NO") | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
int main(void) {
int i;
int n;
int l[5], r[5];
int val;
long long cnt[10001];
double sum, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d %d", l + i, r + i);
sum = 0.0;
for (val = 1; val <= 10000; val++) {
int high1, high2, high3, high4, high5;
int sec1, sec2, sec3, sec4;
cnt[val] = 0;
for (high1 = 0; high1 < n; high1++)
for (sec1 = 0; sec1 < n; sec1++)
if (high1 != sec1) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1)
way *= (((r[i] - (((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) +
1) > (0))
? (r[i] -
(((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) + 1)
: (0));
else if (i == sec1)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (sec1 = 0; sec1 < n; sec1++)
for (sec2 = sec1 + 1; sec2 < n; sec2++)
if (high1 != sec1 && high1 != sec2) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1)
way *= (((r[i] - (((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) +
1) > (0))
? (r[i] -
(((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) + 1)
: (0));
else if (i == sec1 || i == sec2)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (sec1 = 0; sec1 < n; sec1++)
for (sec2 = sec1 + 1; sec2 < n; sec2++)
for (sec3 = sec2 + 1; sec3 < n; sec3++)
if (high1 != sec1 && high1 != sec2 && high1 != sec3) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1)
way *=
(((r[i] - (((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) +
1) > (0))
? (r[i] -
(((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) + 1)
: (0));
else if (i == sec1 || i == sec2 || i == sec3)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (sec1 = 0; sec1 < n; sec1++)
for (sec2 = sec1 + 1; sec2 < n; sec2++)
for (sec3 = sec2 + 1; sec3 < n; sec3++)
for (sec4 = sec3 + 1; sec4 < n; sec4++)
if (high1 != sec1 && high1 != sec2 && high1 != sec3 &&
high1 != sec4) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1)
way *=
(((r[i] - (((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) +
1) > (0))
? (r[i] -
(((l[i]) > (val + 1)) ? (l[i]) : (val + 1)) + 1)
: (0));
else if (i == sec1 || i == sec2 || i == sec3 || i == sec4)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (high2 = high1 + 1; high2 < n; high2++) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1 || i == high2)
way *= val >= l[i] && val <= r[i];
else
way *=
((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] + 1) >
(0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (high2 = high1 + 1; high2 < n; high2++)
for (high3 = high2 + 1; high3 < n; high3++) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1 || i == high2 || i == high3)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (high2 = high1 + 1; high2 < n; high2++)
for (high3 = high2 + 1; high3 < n; high3++)
for (high4 = high3 + 1; high4 < n; high4++) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1 || i == high2 || i == high3 || i == high4)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
for (high1 = 0; high1 < n; high1++)
for (high2 = high1 + 1; high2 < n; high2++)
for (high3 = high2 + 1; high3 < n; high3++)
for (high4 = high3 + 1; high4 < n; high4++)
for (high5 = high4 + 1; high5 < n; high5++) {
long long way;
way = 1LL;
for (i = 0; i < n; i++)
if (i == high1 || i == high2 || i == high3 || i == high4 ||
i == high5)
way *= val >= l[i] && val <= r[i];
else
way *= ((((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) - l[i] +
1) > (0))
? ((((r[i]) < (val - 1)) ? (r[i]) : (val - 1)) -
l[i] + 1)
: (0));
cnt[val] += way;
}
sum += cnt[val];
}
ans = 0.0;
for (i = 1; i <= 10000; i++) ans += (double)i * cnt[i] / sum;
printf("%.15f\n", ans);
return 0;
}
| 2,000 | CPP |
t=int(input())
for tt in range (t):
n=int(input())
s=len(str(n))
a=n%10
b=(a-1)*10+(s*(s+1)//2)
print(b)
| 800 | 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, k;
cin >> n >> k;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
long long int b[k];
vector<long long int> b1;
long long int l1 = 0;
for (long long int i = 0; i < k; i++) {
cin >> b[i];
b[i]--;
if (b[i] == 0) {
l1++;
}
if (b[i] > 0) b1.push_back(b[i]);
}
sort(b1.begin(), b1.end());
long long int ans = 0;
sort(a, a + n, greater<long long int>());
for (long long int i = 0; i < k; i++) {
if (i < l1) {
ans += 2 * a[i];
} else
ans += a[i];
}
sort(a, a + n);
stack<long long int> s;
for (long long int i = 0; i < n - k; i++) s.push(a[i]);
long long int j = 0;
vector<long long int> v[k - l1];
while (!s.empty()) {
long long int g = b1[j];
long long int k1;
while (g--) {
k1 = s.top();
s.pop();
}
ans += k1;
j++;
}
cout << ans << endl;
}
}
| 1,400 | CPP |
t = int(input())
for i in range(t):
n = int(input())
while n % 2 == 0:
n //= 2
if n > 1:
print('YES')
else:
print('NO') | 900 | PYTHON3 |
n=int(input())
a=input()
i=1
c=0
ans=' '
while (c<n):
ans=ans+a[c]
c=c+i
i=i+1
print(ans)
| 800 | PYTHON3 |
len_num = int(input())
num_str = input()
len_1 = len_num // 2
len_2 = len_1
if(len_num & 1):
len_2 += 1
flag = 0
ans = 0
while(True):
if(num_str[len_1] != '0'):
num1 = int(num_str[:len_1]) + int(num_str[len_1:len_num])
ans = num1
flag = 1
if(len_2 < len_num and num_str[len_2] != '0'):
num2 = int(num_str[:len_2]) + int(num_str[len_2:len_num])
if(flag):
if(ans > num2):
ans = num2
else:
ans = num2
flag = 1
len_1 -= 1
len_2 += 1
if(flag):
break
print(ans) | 1,500 | PYTHON3 |
number_of_stones = int(input())
stones = input()
res = 0
for processed_stone_no in range(number_of_stones-1):
if stones[processed_stone_no] == stones[processed_stone_no+1]:
res += 1
print (res)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<long double>> dp;
vector<long long> previous;
long double n, k;
string s;
vector<long long> symbols;
int main() {
cin >> n >> k;
cin >> s;
s = ' ' + s;
previous.resize(26, 0);
symbols.resize(n + 1);
dp.resize(n + 1, vector<long double>(n + 1, 0));
for (long long i = 1; i <= n; i++) {
symbols[i] = s[i] - 'a';
}
dp[0][0] = 1;
for (long long i = 1; i <= n; i++) {
for (long long j = 0; j <= i; j++) {
if (j > 0) dp[i][j] = dp[i - 1][j - 1];
dp[i][j] += dp[i - 1][j];
if (previous[symbols[i]] != 0 && j > 0) {
dp[i][j] -= dp[previous[symbols[i]] - 1][j - 1];
}
}
previous[symbols[i]] = i;
}
long double ans = 0;
for (long long i = n; i >= 0; i--) {
ans += min(k, dp[n][i]) * (n - i);
k -= min(k, dp[n][i]);
}
if (k > 0) {
cout << -1 << '\n';
return 0;
}
cout << (long long)(ans + 0.4999999);
return 0;
}
| 2,000 | CPP |
n1,t1=input().split()
n=int(n1)
t=int(t1)
count=0
j=10**(n-1)
p=10**(n)-1
while j<=p:
if j%t==0:
count=count+1
print(j)
exit()
j=j+1
if count==0:
print('-1')
| 1,000 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
if n==1:
print(-1)
else:
if (n-1)%3!=0:
print("2"*(n-1)+"3")
else:
print("2"+"3"*(n-1)) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N = 1e6, SZ = 320, INF = 1 << 29;
long long LINF = (1LL << 60), mod = 1e9 + 7;
const long double eps = 1e-8, PI = acos(-1.0);
inline int dcmp(double x, double y = 0.0) { return abs(x - y) < eps; }
template <typename Type>
inline Type ru(Type &v) {
static char READ_DATA;
static int SIGNAL_INPUT = 1;
while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
if (READ_DATA == '-')
SIGNAL_INPUT = -1;
else if (READ_DATA == EOF)
return EOF;
v = READ_DATA - '0';
while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9')
v = v * 10 + READ_DATA - '0';
v *= SIGNAL_INPUT;
return v;
}
template <typename A, typename B>
inline int ru(A &x, B &y) {
if (ru(x) == EOF) return EOF;
ru(y);
return 2;
}
template <typename A, typename B, typename C>
inline int ru(A &x, B &y, C &z) {
if (ru(x) == EOF) return EOF;
ru(y);
ru(z);
return 3;
}
long long gcd(long long a, long long b) {
a = abs(a);
b = abs(b);
while (b) {
a %= b;
swap(a, b);
}
return a;
}
struct Edge {
int u, v, w, nxt;
Edge(int _u = 0, int _v = 0, int _w = 0, int _nxt = -1) {
u = _u;
v = _v;
w = _w;
nxt = _nxt;
}
};
const int maxn = 2e5 + 20;
vector<int> g[maxn];
int n, k, vis[maxn];
queue<int> q;
int main() {
ru(n, k);
for (int i = 1; i <= k; i++) {
int u, v;
ru(u, v);
g[i].push_back(u + k);
g[i].push_back(v + k);
g[u + k].push_back(i);
g[v + k].push_back(i);
}
for (int i = 1; i <= k; i++)
if (!vis[i]) {
q.push(i);
vis[i] = 1;
int u;
while (!q.empty()) {
u = q.front();
q.pop();
for (int &v : g[u]) {
if (u <= k) {
if (!vis[v]) {
q.push(v);
vis[u] = 1;
vis[v] = 1;
}
} else {
if (!vis[v]) {
q.push(v);
vis[v] = -1;
}
}
}
}
}
int ans = 0;
for (int i = 1; i <= k; i++) {
if (vis[i] == -1) {
++ans;
}
}
printf("%d", ans);
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long xx[] = {0, 0, 1, -1};
long long yy[] = {1, -1, 0, 0};
long long v[5000], d[5000], p[5000];
bool visited[5000];
signed main() {
long long a;
cin >> a;
for (long long i = 0; i < a; i++)
cin >> v[i] >> d[i] >> p[i], visited[i] = true;
for (long long i = 0; i < a; i++) {
if (!visited[i]) continue;
long long k = 0;
long long sum = 0;
for (long long j = i + 1; j < a; j++) {
if (!visited[j]) continue;
p[j] = p[j] - max((long long)0, v[i] - k);
p[j] -= sum;
k++;
if (p[j] < 0) {
visited[j] = false;
sum += d[j];
}
}
}
long long count = 0;
for (long long i = 0; i < a; i++)
if (visited[i]) count++;
cout << count << endl;
for (long long i = 0; i < a; i++)
if (visited[i]) cout << i + 1 << " ";
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long board[2005][2005];
long long score[2005][2000 + 5];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
long long t = n;
long long a4 = 0, a7 = 0;
while (n >= 0) {
if (n % 7 == 0) {
a7 = n / 7;
break;
}
n = n - 4;
if (n < 0) break;
a4++;
}
if (a4 * 4 + a7 * 7 != t) {
cout << "-1";
return 0;
}
for (long long x = 1; x <= a4; x++) cout << "4";
for (long long x = 1; x <= a7; x++) cout << "7";
}
| 1,000 | CPP |
try:
l=[x for x in input()]
l=set(l)
if len(l)%2==0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!")
except:
pass
| 800 | PYTHON3 |
t=int(input())
while t!=0:
n=int(input())
n=int(n/2)
print(f"{n}\n")
t-=1 | 800 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
#New Imports
from collections import defaultdict
def solution():
n = int(input())
a = list(map(int,input().split()))
s = sum(a)
i = 0
j = n-1
sleft = 0
sright = 0
sleftarr = []
srightarr = []
for i in range(n):
sleft += a[i]
sleftarr.append(sleft)
for i in reversed(range(n)):
sright += a[i]
srightarr.append(sright)
srightarr.reverse()
for i in range(n):
for j in range(i+1,n):
sleft = sleftarr[i]
sright = srightarr[j]
if sleft == sright and (s-(2*sleft))%sleft == 0:
x = i+1
f = 0
sval = 0
while x < j:
sval += a[x]
if sval == sleft:
sval = 0
if x == j-1:
f = 1
elif sval > sleft:
break
x += 1
if f == 1:
count = s//sleft
print(n-count)
return
if sleft == sright and i+1 == j:
print(n-2)
return
print(n-1)
return
def main():
testcases = 1
testcases = int(input())
for _ in range(testcases):
solution()
# region fastio
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")
# endregion
if __name__ == "__main__":
main() | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int maxn = 2 * 100000 + 5;
long long int Z, len, fir, sec;
long long int all[maxn];
long long int sor[maxn];
int main() {
std::ios_base::sync_with_stdio(false);
cin >> len;
for (int i = 1; i <= len; i++) {
cin >> all[i];
sor[i] = all[i];
}
sort(sor + 1, sor + len + 1);
for (int i = 1; i <= len; i++) sor[i] -= all[i];
for (int i = 1; i <= len; i++) {
if (sor[i] != 0 and fir == 0) {
fir = i;
}
if (sor[i] != 0 and fir != 0) {
sec = i;
}
}
swap(all[fir], all[sec]);
for (int i = 1; i <= len; i++) sor[i] = all[i];
sort(sor + 1, sor + len + 1);
for (int i = 1; i <= len; i++) {
if (all[i] != sor[i]) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
| 1,300 | CPP |
def PlugIn(word):
s = []
ph = ""
for i in word:
if (s == [] or i != s[-1]):
s.append(i)
else:
if (i == s[-1]):
s.pop()
print (ph.join(s))
word = input()
PlugIn(word)
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MD = 1e9 + 7;
int n, m, k, lst[27], ind[27];
long long sum, dp[27];
set<pair<int, int> > s;
string str;
int main() {
cin >> m >> k;
cin >> str;
n = str.size();
sum = 1;
memset(ind, -1, sizeof(ind));
for (int i = 0; i < k; i++) s.insert({-1, i});
for (int i = 1; i <= n; i++) {
long long presum = sum;
sum = 2 * sum - dp[(int)(str[i - 1]) - 97];
sum %= MD;
sum += MD;
sum %= MD;
dp[(int)(str[i - 1]) - 97] += (sum - presum);
dp[(int)(str[i - 1]) - 97] %= MD;
s.erase(s.find({ind[(int)(str[i - 1]) - 97], (int)(str[i - 1]) - 97}));
ind[(int)(str[i - 1]) - 97] = i;
s.insert({ind[(int)(str[i - 1]) - 97], (int)(str[i - 1]) - 97});
}
for (int i = 1; i <= m; i++) {
int x = s.begin()->second;
s.erase(s.begin());
long long presum = sum;
sum = 2 * sum - dp[x];
sum %= MD;
sum += MD;
sum %= MD;
dp[x] += (sum - presum);
dp[x] %= MD;
ind[x] = i + n;
s.insert({ind[x], x});
}
cout << sum << '\n';
}
| 2,200 | CPP |
input()
a = [int(i) for i in input().split(' ')]
a.sort(reverse=True)
s = 0
n = 0
for i in range(len(a)):
s += a[i]
n += 1
if i + 1 < len(a):
if s > sum(a[i+1::]):
print(n)
quit()
print(n)
| 900 | PYTHON3 |
a,b = map(int,input().split())
if(b-a >= 5):
print(0)
else:
ans = 1
for i in range(a+1,b+1):
ans *= (i%10)
print(ans%10) | 1,100 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
if a[n-1]>a[0]:
print("YES")
else:
print("NO") | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long dp[105][105][2];
int main() {
long long n, m, k1, k2;
cin >> n >> m >> k1 >> k2;
memset(dp, 0, sizeof(dp));
dp[0][0][0] = dp[0][0][1] = 1;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
for (int k = 1; k <= max(k1, k2); k++) {
if (k <= i && k <= k1) {
dp[i][j][0] += dp[i - k][j][1];
dp[i][j][0] %= 100000000;
}
if (k <= j && k <= k2) {
dp[i][j][1] += dp[i][j - k][0];
dp[i][j][1] %= 100000000;
}
}
}
}
cout << (dp[n][m][0] + dp[n][m][1]) % 100000000;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
const int inf = 1e8 + 1;
int a[maxn];
int sum[40];
int n, m;
long long k;
int vis[maxn];
int d[maxn];
char s[100010];
int main() {
int i, j;
int a, b, t;
scanf("%d%I64d", &n, &k);
scanf("%s", s);
memset(sum, 0, sizeof(sum));
for (i = 0; i < n; i++) {
int temp = s[i] - 'A';
sum[temp]++;
}
long long ans = 0;
long long ma = 0;
while (k > 0) {
ma = 0;
int f = 0;
for (i = 0; i < 26; i++) {
if (sum[i] > ma) {
ma = sum[i];
f = i;
}
}
if (ma > k) {
ans += k * k;
sum[f] -= k;
k = 0;
} else {
k -= ma;
sum[f] = 0;
ans += ma * ma;
}
}
printf("%I64d\n", ans);
return 0;
}
| 1,300 | CPP |
T = int(input())
ss = []
for i in range(T):
s,i,e = map(int,input().split())
if s - i > e:
otv = e + 1
ss.append(otv)
if s - i == e:
otv = e
ss.append(otv)
if s - i < e:
import math
otv = math.ceil((e + (s - i))/2)
if otv <= 0:
ss.append(0)
else:
ss.append(otv)
for i in range(len(ss)):
print(int(ss[i]))
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
char c, sg = 0;
while (c = getchar(), (c > '9' || c < '0') && c != '-')
;
for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
c = getchar())
first = (first << 1) + (first << 3) + c - '0';
if (sg) first = -first;
}
template <class T>
inline void print(T first) {
if (first < 0) {
putchar('-');
return print(-first);
}
if (first < 10) {
putchar('0' + first);
return;
}
print(first / 10);
putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
long long c, p[20000], s[20000], dp[20000];
int N;
int main() {
gn(N);
gn(c);
for (int i = 1; i <= N; i++) scanf("%I64d", &p[i]);
for (int i = 1; i <= N; i++) scanf("%I64d", &s[i]);
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 1; i <= N; i++) {
for (int j = i; j > 0; j--) {
dp[j] = min(s[i] + dp[j - 1], dp[j] + 1LL * j * c + p[i]);
}
dp[0] += p[i];
}
long long ans = 0x3f3f3f3f3f3f3f3fLL;
for (int i = 0; i <= N; i++) smin(ans, dp[i]);
cout << ans << endl;
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y, tp;
int a[105][105][105], b[105][105], tk[105][105];
int A[105], B[105], C[105];
long long f[105][105][105][4], g[105][105][2], ans[105];
void Find(int X, int Y) {
int i, j, k = 0;
for (int t = 1; t < tk[X][Y]; t++)
if (a[X][Y][t] == X && a[X][Y][t + 1] == Y) k++;
if (k == 1)
for (int t = 1; t < tk[X][Y]; t++)
if (a[X][Y][t] == X && a[X][Y][t + 1] == Y) {
A[0] = 0;
for (i = t; i >= 1; i--) A[++A[0]] = a[X][Y][i];
int bz = 1;
for (i = 1; i < A[0]; i++) {
x = A[i + 1], y = A[i];
if (!b[x][y]) {
bz = 0;
break;
}
for (j = tk[x][y]; j >= 1; j--) {
A[++A[0]] = a[x][y][j];
if (A[0] > 2 * n + 1) {
bz = 0;
break;
}
}
if (!bz) break;
}
if (!bz) continue;
B[0] = 0;
for (i = t + 1; i <= tk[X][Y]; i++) B[++B[0]] = a[X][Y][i];
for (i = 1; i < B[0]; i++) {
x = B[i], y = B[i + 1];
if (!b[x][y]) {
bz = 0;
break;
}
for (j = 1; j <= tk[x][y]; j++) {
B[++B[0]] = a[x][y][j];
if (B[0] > 2 * n + 1) {
bz = 0;
break;
}
}
if (!bz) break;
}
if (!bz || A[0] + B[0] > 2 * n + 1) continue;
f[A[A[0]]][B[B[0]]][A[0] + B[0] - 1][0]++;
g[A[0] + B[0] - 1][B[B[0]]][1]++;
}
if (!tk[X][Y])
f[X][Y][1][3]++;
else {
if (a[X][Y][tk[X][Y]] == X) {
A[0] = 0;
for (i = tk[X][Y]; i >= 1; i--) A[++A[0]] = a[X][Y][i];
int bz = 1;
for (i = 1; i < A[0]; i++) {
x = A[i + 1], y = A[i];
if (!b[x][y]) {
bz = 0;
break;
}
for (j = tk[x][y]; j >= 1; j--) {
A[++A[0]] = a[x][y][j];
if (A[0] > 2 * n) {
bz = 0;
break;
}
}
if (!bz) break;
}
if (bz) f[A[A[0]]][Y][A[0]][1]++, g[A[0]][Y][0]++;
}
if (a[X][Y][1] == Y) {
A[0] = 0;
for (i = 1; i <= tk[X][Y]; i++) A[++A[0]] = a[X][Y][i];
int bz = 1;
for (i = 1; i < A[0]; i++) {
x = A[i], y = A[i + 1];
if (!b[x][y]) {
bz = 0;
break;
}
for (j = 1; j <= tk[x][y]; j++) {
A[++A[0]] = a[x][y][j];
if (A[0] > 2 * n) {
bz = 0;
break;
}
}
if (!bz) break;
}
if (bz) f[X][A[A[0]]][A[0]][2]++;
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= m; i++) {
scanf("%d%d", &x, &y), b[x][y] = 1;
scanf("%d", &tk[x][y]);
for (j = 1; j <= tk[x][y]; j++) scanf("%d", &a[x][y][j]);
}
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (b[i][j]) Find(i, j);
for (i = 1; i <= 2 * n; i++)
for (x = 1; x <= n; x++)
for (j = 0; j < 2; j++)
if (g[i][x][j]) {
for (k = 1; i + k <= 2 * n; k++)
for (y = 1; y <= n; y++) {
if (!j && f[x][y][k][0])
(g[i + k][y][1] += g[i][x][j] * f[x][y][k][0]) %= 1000000007;
if (!j && f[x][y][k][1])
(g[i + k][y][0] += g[i][x][j] * f[x][y][k][1]) %= 1000000007;
if (j && f[x][y][k][2])
(g[i + k][y][1] += g[i][x][j] * f[x][y][k][2]) %= 1000000007;
if (j && f[x][y][k][3])
(g[i + k][y][0] += g[i][x][j] * f[x][y][k][3]) %= 1000000007;
}
if (j) ans[i] += g[i][x][j];
}
for (i = 1; i <= 2 * n; i++) printf("%lld\n", ans[i] % 1000000007);
}
| 3,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans, flag, cnt, tot, rx, ry, edge;
char mp[305][305];
bool vis[305][305];
int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
struct node {
int x, y;
} q[90005];
bool isok(int x, int y) {
if (x < 1 || x > n || y < 1 || y > m || mp[x][y] == '0') return false;
return true;
}
void dfs(int x, int y) {
int i, nx, ny;
for (i = 0; i < 8; i++) {
nx = x + dx[i];
ny = y + dy[i];
if (!isok(nx, ny) || vis[nx][ny]) continue;
if (rx < nx || rx == nx && ry < ny) {
rx = nx;
ry = ny;
}
q[++cnt].x = nx;
q[cnt].y = ny;
vis[nx][ny] = 1;
dfs(nx, ny);
}
}
void dfs1(int x, int y) {
int i, nx, ny;
for (i = 0; i < 8; i++) {
nx = x + dx[i];
ny = y + dy[i];
if (!isok(nx, ny) || vis[nx][ny]) continue;
if (rx < nx || rx == nx && ry < ny) {
rx = nx;
ry = ny;
}
q[++cnt].x = nx;
q[cnt].y = ny;
vis[nx][ny] = 1;
dfs1(nx, ny);
}
}
bool yes1(int x, int y, int nx, int ny) {
if (x < nx) return false;
if (abs(nx - x) != abs(ny - y) || abs(nx - x) + 1 > edge) return false;
return true;
}
bool yes2(int x, int y, int nx, int ny) {
if (x > nx) return false;
if (abs(nx - x) != abs(ny - y) || abs(nx - x) + 1 > edge) return false;
return true;
}
void solve() {
int i, j, t;
ans = 0;
memset(vis, 0, sizeof(vis));
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (mp[i][j] == '0' || vis[i][j]) continue;
vis[i][j] = 1;
rx = i;
ry = j;
cnt = 0;
q[++cnt].x = i;
q[cnt].y = j;
dfs(i, j);
if (rx == i && ry == j) continue;
if (rx - i != ry - j || cnt != (rx - i + 1) * 4 - 4) continue;
flag = 1;
for (int k = 1; k <= cnt; k++) {
if (q[k].x == i && q[k].y >= j && q[k].y <= ry ||
q[k].x == rx && q[k].y >= j && q[k].y <= ry ||
q[k].y == j && q[k].x >= i && q[k].x <= rx ||
q[k].y == ry && q[k].x >= i && q[k].x <= rx)
;
else {
flag = 0;
break;
}
}
ans += flag;
}
}
memset(vis, 0, sizeof(vis));
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (mp[i][j] == '0' || vis[i][j]) continue;
vis[i][j] = 1;
rx = i;
ry = j;
cnt = 0;
q[++cnt].x = i;
q[cnt].y = j;
dfs1(i, j);
if (rx == i && ry == j) continue;
if (ry != j) continue;
if ((rx - i + 1) % 2 == 0) continue;
edge = (rx - i + 1) / 2 + 1;
if (edge * 4 - 4 != cnt) continue;
flag = 1;
for (int k = 1; k <= cnt; k++) {
if (yes1(q[k].x, q[k].y, i, j) || yes2(q[k].x, q[k].y, rx, ry))
;
else {
flag = 0;
break;
}
}
ans += flag;
}
}
printf("%d\n", ans);
}
int main() {
int i, j, t;
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%s", mp[i] + 1);
}
solve();
}
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
void f_io() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
}
int main() {
f_io();
long long int t, n, a, x, h, c, y, w, b, k, m;
cin >> t;
while (t--) {
cin >> x >> y >> k;
if ((y * k + k - 1) % (x - 1) == 0)
cout << (y * k + k - 1) / (x - 1) + k << "\n";
else {
cout << (y * k + k - 1) / (x - 1) + 1 + k << "\n";
}
}
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct debug_t {
template <typename T>
debug_t& operator<<(const T& value) {
return *this;
}
debug_t& write(const char data[], size_t n) { return *this; }
} debug;
const int N = (int)5e5;
const int M = (int)5e5;
int n, m, p;
char s[N + 1], cmd[M + 1];
int nextPos[N + 1], prevPos[N + 1], matching[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
vector<int> st;
st.reserve(N >> 1);
int i;
while (cin >> n >> m >> p >> s >> cmd) {
p--;
for (i = 0; i < n; i++) {
nextPos[i] = i + 1;
prevPos[i + 1] = i;
if (s[i] == '(')
st.push_back(i);
else {
matching[i] = st.back();
matching[st.back()] = i;
st.pop_back();
}
}
nextPos[n - 1] = prevPos[0] = -1;
assert(st.empty());
for (i = 0; i < m; i++) switch (assert(~p), cmd[i]) {
case 'L':
p = prevPos[p];
break;
case 'R':
p = nextPos[p];
break;
case 'D': {
int jmp = matching[p];
assert(~jmp && jmp != p);
if (jmp < p) swap(p, jmp);
if (~prevPos[p]) nextPos[prevPos[p]] = nextPos[jmp];
if (~nextPos[jmp]) {
prevPos[nextPos[jmp]] = prevPos[p];
p = nextPos[jmp];
} else
p = prevPos[p];
break;
}
default:
assert(false);
}
debug << "p = " << p << "; ";
while (~prevPos[p]) p = prevPos[p];
do cout << s[p];
while (p = nextPos[p], ~p);
cout << '\n';
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int a[200005] = {0}, len, dpos, incpos;
char res[200005];
char ans[200005];
char second[200005];
char temp[200005];
void add(char *a, char *b) {
int i, x, y, z, carry = 0;
for (i = len - 1; i >= 0; i--) {
if (i == dpos) {
res[i] = '.';
continue;
}
x = a[i] - '0';
y = b[i] - '0';
z = (x + y + carry) % 10;
carry = (x + y + carry) / 10;
char ch = z + '0';
res[i] = ch;
}
if (carry != 0) {
char ch = carry + '0';
ans[0] = ch;
for (i = 0; i < len; i++) ans[i + 1] = res[i];
ans[i + 1] = '\0';
incpos++;
} else {
for (i = 0; i < len; i++) ans[i] = res[i];
ans[i] = '\0';
}
}
int main() {
ios_base::sync_with_stdio(false);
long long int i, t, nlen;
char ch;
cin >> len >> t;
cin >> second;
for (i = 0; i < len; i++)
if (second[i] == '.') break;
dpos = i;
if ((second[len - 1] - '0') >= 5)
a[len - 1] = 1;
else
a[len - 1] = 10000000000;
for (i = len - 2; i > dpos; i--) {
if ((second[i] - '0') >= 5)
a[i] = 1;
else if (second[i] == '4')
a[i] = a[i + 1] + 1;
else
a[i] = 10000000000;
}
for (i = dpos + 1; i < len; i++)
if (a[i] <= t) break;
incpos = i;
if (incpos == len)
cout << second << "\n";
else {
incpos--;
if (incpos == dpos) incpos--;
for (i = 0; i < dpos; i++) temp[i] = '0';
temp[i] = '.';
for (i = dpos + 1; i < len; i++) temp[i] = '0';
temp[incpos] = '1';
add(second, temp);
for (i = len - 1; i > dpos; i--) {
if (second[i] != '0') break;
}
nlen = i;
if (nlen == dpos) nlen = nlen - 1;
nlen = min(nlen, incpos);
for (i = 0; i <= nlen; i++) cout << ans[i];
cout << "\n";
}
return 0;
}
| 1,700 | CPP |
import math
t=int(input())
while t:
n,k=input().split()
n=int(n)
k=int(k)
data=[int(x) for x in input().split()]
sum=0
if n==1:
for ele in data:
sum+=ele
print(sum)
elif n==2:
i=0
while i<k*n:
sum+=data[i]
i+=2
print(sum)
else:
i=n*k-(n//2+1)
while i>=k*(n-(n//2+1)):
sum+=data[i]
i=i-(n//2+1)
print(sum)
t-=1 | 900 | PYTHON3 |
import sys
input = sys.stdin.readline
def main():
t = int(input())
for _ in range(t):
S = input().strip()
print(len(S))
if __name__ == '__main__':
main()
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2, INF = 0x3f3f3f3f;
struct kruskal {
int u, v, w, id;
friend bool operator<(const kruskal &a, const kruskal &b) {
return a.w < b.w;
}
} kr[maxn];
int head[maxn], cnt;
struct EDGE {
int v, nxt, w, id;
EDGE() {}
EDGE(int a, int b, int c, int d) { v = a, nxt = b, w = c, id = d; }
} e[maxn << 1];
bool inm[maxn];
int n, m, fa[maxn], ans[maxn], anc[maxn][19], mx[maxn][19], dep[maxn], up[maxn];
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
void add(int u, int v, int w, int id) {
e[cnt] = EDGE(v, head[u], w, id);
head[u] = cnt++;
}
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void dfs(int p, int f, int d) {
dep[p] = dep[f] + 1, anc[p][0] = f, mx[p][0] = d;
for (int i = 1; i <= 18; i++)
anc[p][i] = anc[anc[p][i - 1]][i - 1],
mx[p][i] = max(mx[p][i - 1], mx[anc[p][i - 1]][i - 1]);
for (int i = head[p]; ~i; i = e[i].nxt) {
int to = e[i].v;
if (to == f) continue;
up[to] = e[i].id, dfs(to, p, e[i].w);
}
}
int lca(int x, int y, int &d) {
d = 0;
if (dep[x] < dep[y]) swap(x, y);
for (int i = 18; i >= 0; i--) {
if (dep[anc[x][i]] >= dep[y]) {
d = max(d, mx[x][i]);
x = anc[x][i];
}
}
if (x == y) return x;
for (int i = 18; i >= 0; i--) {
if (anc[x][i] ^ anc[y][i]) {
d = max(d, max(mx[x][i], mx[y][i]));
x = anc[x][i], y = anc[y][i];
}
}
d = max(d, max(mx[x][0], mx[y][0]));
return anc[x][0];
}
void modify(int x, int lca, int w) {
x = find(x);
while (dep[x] > dep[lca]) {
ans[up[x]] = min(ans[up[x]], w);
int y = find(anc[x][0]);
fa[x] = y;
x = find(x);
}
}
int main() {
while (~scanf("%d%d", &n, &m)) {
memset(head, -1, sizeof(head));
memset(inm, 0, sizeof(inm));
cnt = 0;
for (register int i = 1; i <= n; i++) fa[i] = i;
for (register int i = 1; i <= m; i++)
kr[i].id = i, kr[i].u = read(), kr[i].v = read(), kr[i].w = read();
sort(kr + 1, kr + m + 1);
int blo = n;
for (register int i = 1; i <= m && blo > 1; ++i) {
int u = kr[i].u, v = kr[i].v;
u = find(u), v = find(v);
if (u ^ v) {
fa[u] = v;
inm[i] = true, --blo;
add(kr[i].u, kr[i].v, kr[i].w, kr[i].id);
add(kr[i].v, kr[i].u, kr[i].w, kr[i].id);
}
}
dfs(1, 0, 0);
memset(ans, INF, sizeof(ans));
for (register int i = 1; i <= n; ++i) fa[i] = i;
for (register int i = 1; i <= m; ++i) {
if (inm[i]) continue;
int u = kr[i].u, v = kr[i].v, f = lca(u, v, ans[kr[i].id]);
--ans[kr[i].id];
modify(u, f, kr[i].w - 1);
modify(v, f, kr[i].w - 1);
}
for (int i = 1; i <= m; i++) printf("%d\n", ans[i] == INF ? -1 : ans[i]);
}
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
inline int fpow(int x, int y) {
if (y == 0) return 1;
if (y == 1) return x;
long long res = fpow(x, y / 2);
(res *= res) %= mod;
return y % 2 == 0 ? int(res) : int((res * x) % mod);
}
int num[15], len[15];
inline pair<int, int> getInt(const string& s) {
long long res = 0, clen = 0;
clen = 0;
for (size_t i = 0; i < s.size(); i++) {
int digit = s[i] - '0';
clen += len[digit];
clen %= mod - 1;
res *= fpow(10, len[digit]);
res %= mod;
res += num[digit];
res %= mod;
}
return make_pair(int(res), int(clen));
}
int n, q[100005];
string s, qs[100005];
int main() {
ios::sync_with_stdio(false);
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> q[i] >> qs[i];
qs[i] = qs[i].substr(2);
}
for (int i = 0; i < 10; i++) {
num[i] = i;
len[i] = 1;
}
for (int i = n - 1; i >= 0; i--) {
pair<int, int> p = getInt(qs[i]);
num[q[i]] = p.first;
len[q[i]] = p.second;
}
cout << getInt(s).first << endl;
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
cin >> n;
vector<pair<long long, long long> > v;
for (i = 0; i < 2 * n; i++) {
long long a;
cin >> a;
v.push_back({a, i});
}
sort(v.begin(), v.end());
long long sum = 0;
for (i = 0; i < 2 * n; i += 2) {
if (i == 0) {
sum += (v[i].second);
} else {
sum += abs(v[i].second - v[i - 2].second);
}
}
for (i = 1; i < 2 * n; i += 2) {
if (i == 1) {
sum += (v[i].second);
} else {
sum += abs(v[i].second - v[i - 2].second);
}
}
cout << sum << '\n';
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 42;
bool flag[maxn];
vector<int> t;
int main() {
long long s, x, a, b, y, d, n, m, num, ans;
while (scanf("%lld%lld", &s, &x) != EOF) {
memset(flag, false, sizeof(flag));
y = s - x;
n = x;
t.clear();
while (n) {
t.push_back(n % 2);
n /= 2;
}
num = 0;
for (int i = 0; i < t.size(); ++i) {
if (t[i]) {
flag[i] = true;
++num;
}
}
ans = pow(2, num);
bool ok = true;
n = y;
if (y == 0)
ans -= 2;
else if (y < 0)
ok = false;
t.clear();
while (n) {
t.push_back(n % 2);
n /= 2;
}
for (int i = 0; i < t.size(); ++i) {
if (t[i]) {
if (i == 0 || flag[i - 1]) {
ok = false;
break;
}
}
}
if (ok)
printf("%lld\n", ans);
else
printf("0\n");
}
return 0;
}
| 1,700 | CPP |
n = int(input())
arr = list(map(int, input().strip().split()))
[a, b] = list(map(int, input().strip().split()))
# Making it zero indexed
a -= 1
b -= 1
ans = 0
for i in range(a, b):
ans += arr[i]
print(ans)
| 800 | PYTHON3 |
input()
stones = input()
count = 0
st = 1
for i in stones:
if i == st:
count += 1
else:
st = i
print(count) | 800 | PYTHON3 |
t = int(input())
for T in range(0, t):
l, r, sum = map(int, input().split())
deff = r-l
more = True
if sum >= l:
for i in range(r, l-1, -1):
if sum%i <= deff:
a = i
need = sum%i
more = False
break
elif i-(sum%i) <= deff:
a = i
need = i-(sum%i)
break
if not more:
print(a, l+need, l)
else:
print(a, l, l+need)
else:
need = l - sum
print(l, l, l+need)
| 1,500 | PYTHON3 |
x = [int(i) for i in list(input())]
a = x[0]
t = 0
y = []
for i in range(len(x)-1):
if x[i] == a:
t += 1
else:
a = x[i]
y.append(t)
t = 1
if x[len(x)-1] == x[len(x)-2]:
t += 1
y.append(t)
else:
y.append(t)
max = y[0]
for i in range(len(y)):
if y[i] > max:
max = y[i]
if max >= 7:
print('YES')
else:
print('NO')
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, pos, l, r;
int main() {
scanf("%d %d %d %d", &n, &pos, &l, &r);
int ans = 0;
if (l == 1 && r == n) {
printf("0\n");
return 0;
}
if (pos < l) {
ans += l - pos + 1;
if (r != n) ans += r - l + 1;
printf("%d\n", ans);
} else if (l == pos || pos == r) {
if (l == 1)
if (pos == l)
ans += r - l + 1;
else
ans = 1;
if (r == n)
if (pos == r)
ans += r - l + 1;
else
ans = 1;
if (l != 1 && r != n) ans += r - l + 2;
printf("%d\n", ans);
} else if (l < pos && pos < r) {
if (abs(pos - l) < abs(pos - r))
if (l != 1)
ans += pos - l + 1, pos = l;
else
ans += r - pos + 1, pos = r;
else if (r != n)
ans += r - pos + 1, pos = r;
else
ans += pos - l + 1, pos = l;
if (pos == l)
if (r != n) ans += r - l + 1;
if (pos == r)
if (l != 1) ans += r - l + 1;
printf("%d\n", ans);
} else if (pos > r) {
ans += pos - r + 1;
if (l != 1) ans += r - l + 1;
printf("%d\n", ans);
}
return 0;
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ar[300];
int main() {
int n;
cin >> n;
int minus = 0;
int min = 2000;
for (int i = 0; i < 2 * n - 1; ++i) {
cin >> ar[i];
if (ar[i] < 0) {
minus++;
ar[i] = -ar[i];
}
if (ar[i] < min) min = ar[i];
}
int sum = 0;
if (minus % 2 == 0 || n % 2 == 1) {
for (int i = 0; i < 2 * n - 1; ++i) sum += ar[i];
cout << sum;
return 0;
}
for (int i = 0; i < 2 * n - 1; ++i) {
sum += ar[i];
}
cout << sum - 2 * min;
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const long long mod = (long long)1e18;
void solve() {
string s;
cin >> s;
bool valid = false, valid2 = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
if (!valid) {
cout << 1 << " " << 1 << '\n';
valid = true;
} else {
cout << 3 << " " << 1 << '\n';
valid = false;
}
} else {
if (!valid2) {
cout << 4 << " " << 3 << '\n';
valid2 = true;
} else {
cout << 4 << " " << 1 << '\n';
valid2 = false;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int t = 1;
while (t--) solve();
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<string> split(string s) {
istringstream buf(s);
istream_iterator<string> beg(buf), end;
vector<string> list(beg, end);
return list;
}
void solve() {
int n, ans;
cin >> n;
ans = n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int mid_key = v[n - 1] / 2;
int mid = upper_bound(v.begin(), v.end(), mid_key) - v.begin() - 1;
int stop = min(mid, n / 2 - 1), j = n - 1, i = stop;
while (i >= 0 && j > stop) {
if (v[j] - v[i] >= v[i]) {
j--;
ans--;
}
i--;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
for (int test_case = 1; test_case <= t; test_case++) solve();
return 0;
}
| 1,600 | CPP |
def Fox_And_Snake(n, m):
for i in range(1, n+1):
if i%2 != 0:
print('#'*m)
elif i%4 == 0:
print('#'+'.'*(m-1))
else:
print('.'*(m-1)+'#')
n, m = input().split()
Fox_And_Snake(int(n), int(m)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > k4 = {{1, 2}, {3, 4}, {1, 3}, {2, 4}, {1, 4}, {2, 3}};
vector<int> bip = {2, 1, 4, 3, 4, 3, 2, 1, 3, 4, 1, 2, 1, 2, 3, 4};
vector<pair<int, int> > k5 = {{4, 0}, {3, 4}, {3, 0}, {2, 0}, {1, 2},
{1, 0}, {1, 3}, {2, 4}, {1, 4}, {2, 3}};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n == 1) {
cout << "YES\n";
return 0;
}
if (n % 4 == 2 || n % 4 == 3) {
cout << "NO\n";
return 0;
}
if (n % 4 == 0) {
cout << "YES\n";
for (int m = 0; m < n; m += 4) {
for (auto p : k4) cout << m + p.first << " " << m + p.second << '\n';
}
for (int p = 0; p < n; p += 4) {
for (int q = p + 4; q < n; q += 4) {
for (int i = 0; i < 16; i++) {
cout << p + (i % 4) + 1 << " " << q + bip[i] << '\n';
}
}
}
}
if (n % 4 == 1) {
cout << "YES\n";
for (int m = 0; m < n - 1; m += 4) {
for (auto p : k5) {
int a = p.first;
int b = p.second;
a += m;
if (b == 0)
b = n;
else
b += m;
cout << a << " " << b << '\n';
}
}
for (int p = 0; p < n - 1; p += 4) {
for (int q = p + 4; q < n - 1; q += 4) {
for (int i = 0; i < 16; i++) {
cout << p + (i % 4) + 1 << " " << q + bip[i] << '\n';
}
}
}
}
}
| 3,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int max(int a, int b) {
if (a < b) return b;
return a;
}
int min(int a, int b) {
if (a < b) return a;
return b;
}
signed main() {
int a, b, c, op = 998244353, n, m, yap, x = 300001, d, t, p, r, k = 26, e;
cin >> yap;
while (yap > 0) {
yap--;
cin >> n >> m >> k;
a = m / 2 * n;
b = n / 2 * m;
if (k > a || k % 2 != a % 2 || n * m / 2 - k > b)
cout << "NO\n";
else {
cout << "YES\n";
vector<string> s(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m / 2; j++) {
if (i % 4 == 0) {
if (j % 2 == 0)
s[i] += "aa";
else
s[i] += "bb";
}
if (i % 4 == 1) {
if (j % 2 == 0)
s[i] += "cc";
else
s[i] += "dd";
}
if (i % 4 == 2) {
if (j % 2 == 0)
s[i] += "ee";
else
s[i] += "ff";
}
if (i % 4 == 3) {
if (j % 2 == 0)
s[i] += "gg";
else
s[i] += "hh";
}
}
if (i % 4 < 2)
s[i] += 'i';
else
s[i] += 'j';
}
a -= k;
for (int i = 0; i < n / 2; i++) {
for (int j = 0; j < m / 2; j++) {
if (a > 0) {
swap(s[2 * i][2 * j], s[2 * i + 1][2 * j + 1]);
a -= 2;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cout << s[i][j];
cout << "\n";
}
}
}
return 0;
}
| 2,100 | CPP |
test = int(input())
for i in range (test):
n, x = input().split()
cnt_i = 0
cnt_p = 0
n = int(n)
x = int(x)
number = []
number = input().split()
number = list(map(int, number))
for j in range (n):
if number[j] % 2 ==1:
cnt_i = cnt_i + 1
else:
cnt_p = cnt_p + 1
if x % 2 == 0 and cnt_p == 0:
print("NO")
continue
if cnt_i % 2 ==0:
cnt_i = cnt_i - 1
if cnt_i >= x:
print("YES")
continue
if cnt_i <= 0:
print("NO")
continue
if (x - cnt_p) <= cnt_i:
print("YES")
else:
print("NO")
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 5e5 + 5;
int n, x, a[MX / 2], u;
long long m[MX / 2];
void solve() {
cin >> n;
u = (n + 1) / 2;
for (int i = (0); i < (u); ++i) cin >> a[i + 1];
cin >> x;
m[0] = 0;
long long ms = 0;
for (int i = (0); i < (u); ++i) {
ms += x - a[i + 1];
m[i + 1] = min(m[i], ms);
}
long long as = 0;
for (int i = (0); i < (u); ++i) as += a[i + 1];
for (int k = (u); k <= (n); ++k) {
if (as + m[n - k] > 0) {
cout << k << '\n';
return;
}
as += x;
}
cout << "-1\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
}
| 2,400 | CPP |
t = int(input())
matrix = []
def checkTop(a, y):
base = 0
height = 0
if (y != 0):
height += y
base += a
return base * height
def checkRight(a, b, x):
base = 0
height = 0
if (x != a):
base +=(a-1)-x
height += b
return base * height
def checkBottom(a, b, y):
base = 0
height = 0
if (y != b):
height += (b-1)-y
base += a
return base * height
def checkLeft(b, x):
base = 0
height = 0
if (x != 0):
base += x
height +=b
return base * height
if 1 <= t <= 10 ** 4:
for i in range(0, t):
distance = tuple(input().split())
a = int(distance[0])
b = int(distance[1])
x = int(distance[2])
y = int(distance[3])
areas = [checkTop(a, y), checkRight(a, b, x), checkBottom(a, b, y), checkLeft(b,x)]
print(max(areas))
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> arr(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> add(n, 0);
int j = 0;
int rem;
long sum_so_far = 0;
for (int i = n - 1; i >= 0; i--) {
rem = (arr[i] + sum_so_far) % 2002;
add[j] = 2001 - rem - j;
if (add[j] < 0) {
add[j] = 4004 + add[j];
}
sum_so_far += add[j];
j++;
}
cout << (n + 1) << endl;
j = n;
for (int i = 1; i <= n; i++) {
cout << "1 " << j << " " << add[i - 1] << endl;
j--;
}
cout << "2 " << n << " 2002\n";
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
double w, h, a, ans;
scanf("%lf %lf %lf", &w, &h, &a);
if (h > w) swap(h, w);
a = min(a, 180 - a);
a = a * acos(-1) / 180;
if (a == 0)
ans = w * h;
else if (a <= 2 * atan(h / w)) {
ans = w * h;
ans -= tan(a) * pow((1.0 * w - (h * (1 - cos(a)) / sin(a))), 2.0) / 4.0;
ans -= tan(a) * pow((1.0 * h - (w * (1 - cos(a)) / sin(a))), 2.0) / 4.0;
} else
ans = h * h / sin(a);
printf("%.9lf\n", ans);
return 0;
}
| 2,000 | CPP |
import os
import sys
from io import BytesIO, IOBase
# New Imports
from sys import maxsize
from itertools import permutations
import math
def arr_input():
return list(map(int, input().split()))
def mul_input():
return map(int, input().split())
def int_inp():
return int(input())
from math import gcd
from collections import Counter
from functools import reduce
def solution():
n=int_inp()
a=arr_input()
if n%2!=0 and len(set(a))==n and sorted(a)==a :
print("NO")
else:
print("YES")
def main():
#testcases=1
testcases = int(input())
for _ in range(testcases):
solution()
# region fastio
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)
def input(): return sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> MP;
int main() {
int n, m, k;
double K;
cin >> n >> m >> K;
k = K * 100.0 + 1e-9;
for (int i = 0; i < n; i++) {
string s;
double t;
cin >> s >> t;
t *= k;
if (t / 100 >= 100) MP[s] = t / 100;
}
for (int i = 0; i < m; i++) {
string s;
cin >> s;
if (MP[s] == 0) MP[s] == -1;
}
cout << MP.size() << endl;
for (map<string, int>::iterator it = MP.begin(); it != MP.end(); it++) {
cout << it->first << " ";
if (it->second == -1)
cout << 0 << endl;
else
cout << it->second << endl;
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 9;
long long n, k, m, h;
pair<long long, long long> a[N];
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> h >> m >> k;
map<long long, long long> mp;
mp[0] = 0;
for (long long i = 0; i < n; i++) {
long long x, y;
cin >> x >> y;
long long t = y % (m / 2);
long long l = (t + 1) % (m / 2), r = (t + k - 1 + m / 2) % (m / 2);
a[i] = {l, r};
if (l == r) continue;
if (l > r) mp[l]++, l = 0;
mp[l]++, mp[r + 1]--;
}
long long cnt = 0, t = 0, ans = 1e9;
for (auto [key, val] : mp) {
if (key >= m / 2) break;
cnt += val;
if (cnt < ans) ans = cnt, t = key;
}
cout << ans << ' ' << t << '\n';
vector<long long> res;
for (long long i = 0; i < n; i++) {
auto [l, r] = a[i];
if (l == r) continue;
if (r > l and t >= l and t <= r)
res.push_back(i + 1);
else if (l > r and ((t >= l and t < m / 2) or (t >= 0 and t <= r)))
res.push_back(i + 1);
}
for (auto i : res) cout << i << ' ';
}
| 2,300 | CPP |
t = int(input())
for tc in range(t):
n = int(input())
a = list(map(int, input().split()))
ans = [0]*n
for i in range(len(a)):
ans[(i+a[i])%n] += 1
output = "YES"
for a in ans:
if a != 1:
output = "NO"
break
print(output)
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int a[N];
char s[N];
char out[N];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++) a[i] = s[i] - '0';
int l = 1, r = n;
if (a[l] != a[r]) {
a[l]--;
a[l + 1] += 10;
if (!a[l]) l++;
}
while (l <= r) {
if (a[l] != a[r]) {
if (a[l] >= a[r] + 10 && a[r] < 10) {
a[r - 1]--;
a[r] += 10;
}
if (a[l] - 1 == a[r]) {
a[l]--;
a[l + 1] += 10;
}
}
if (a[l] != a[r]) {
return puts("0"), 0;
} else {
if (l != r) {
a[r] /= 2;
a[l] -= a[r];
} else {
if (a[l] & 1) return puts("0"), 0;
a[l] /= 2;
}
if (a[l] < 0 || a[l] > 9 || a[r] < 0 || a[r] > 9) return puts("0"), 0;
}
l++, r--;
}
l = 1;
if (!a[l]) l++;
for (int i = l; i <= n; i++) printf("%d", a[i]);
}
| 2,400 | CPP |
#Bhargey Mehta (Junior)
#DA-IICT, Gandhinagar
import sys, math, queue
#sys.stdin = open('input.txt', 'r')
MOD = 10**9+7
sys.setrecursionlimit(1000000)
n = int(input())
a = []
x = []
for i in range(n):
a.append(list(map(int, input().split())))
x.append((a[0][1]*a[0][2])//a[1][2])
x[0] = int(math.sqrt(x[0]))
for i in range(1, n):
x.append(a[i][0]//x[0])
print(*x) | 1,300 | PYTHON3 |
n, m = map(int, input().split())
x = []
ans = [0] * n
for i in range(m):
s, d, c = map(int, input().split())
x.append([d - 1, s - 1, c, i + 1])
ans[d - 1] = m + 1
x.sort()
for d, s, c, i in x:
cnt = 0
while cnt < c:
if s == d:
print(-1)
exit()
if ans[s] == 0:
ans[s] = i
cnt += 1
s += 1
print(*ans) | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[4002];
int main() {
int i, j, t, t1, t2, num, x, n;
while (scanf("%d%d", &x, &n) != EOF) {
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++) {
scanf("%d", &t);
if (t == 2) {
scanf("%d", &t1);
a[t1] = 1;
} else {
scanf("%d%d", &t1, &t2);
a[t1] = a[t2] = 1;
}
}
num = 0;
t1 = t2 = 0;
for (i = 1; i < x; i++) {
if (!a[i]) {
num++;
t2++;
} else {
t1 += (num + 1) / 2;
num = 0;
}
}
t1 += (num + 1) / 2;
printf("%d %d\n", t1, t2);
}
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int f[2 * (1 << 18) + 17][101];
int a[(1 << 18) + 17];
void process(int i, int a, int b) {
int x = i + (1 << 18);
f[x][a] = b;
for (x /= 2; x >= 1; x /= 2)
for (int i = 1; i <= 100; i++) f[x][i] = f[x * 2 + 1][f[x * 2][i]];
}
int main() {
for (int x = (1 << 18) + 1; x <= 2 * (1 << 18) + 1; x++)
for (int i = 1; i <= 100; i++) f[x][i] = i;
for (int x = (1 << 18); x >= 1; x--)
for (int i = 1; i <= 100; i++) f[x][i] = f[x * 2 + 1][f[x * 2][i]];
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
cin >> q;
vector<vector<vector<int>>> events(n + 2);
for (int i = 1; i <= q; i++) {
int l, r, x, y;
cin >> l >> r >> x >> y;
events[l].push_back({i, x, y});
events[r + 1].push_back({i, x, x});
}
for (int i = 1; i <= n; i++) {
for (vector<int> event : events[i]) process(event[0], event[1], event[2]);
cout << f[1][a[i]] << " \n"[i == n];
}
}
| 2,500 | CPP |
n = int(input())
for i in range(n):
cnt = 0
a,b = input().split()
a = int(a)
b = int(b)
if a%b==0:
print(cnt)
else:
if a > b:
print((a//b+1)*b-a)
else:
print(b-a) | 1,500 | PYTHON3 |
n=int(input())
a=[]
b=[]
k=0
for i in range(n):
f=[int(i) for i in input().split(" ")]
a.append(f[0])
b.append(f[1])
a=a[1:]
b=b[1:]
for i in range(len(a)):
if a[i]==b[i]:
k=k+1
if k==len(a):
print("Poor Alex")
else:
print("Happy Alex")
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, num0 = 0, num1 = 0, numx = 0;
char ch;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
ch = s.at(i);
if (ch == '0')
num0++;
else if (ch == '1')
num1++;
else
numx++;
}
if (num0 + numx > num1) cout << "00" << endl;
if (((num1 + numx + num0) % 2 == 1 && (num1 + numx > num0) &&
(num0 + numx >= num1 - 1)) ||
((num1 + numx + num0) % 2 == 0 && (num1 + numx >= num0) &&
(num0 + numx >= num1))) {
if ((ch == '1') ||
((ch == '?') && ((num0 + 1 == num1 + numx) || (num0 == num1 + numx))))
cout << "01" << endl;
else if ((ch == '0') || ((ch == '?') && ((num0 + numx == num1 - 1) ||
(num0 + numx == num1))))
cout << "10" << endl;
else
cout << "01\n10" << endl;
}
if (num1 + numx > num0 + 1) cout << "11" << endl;
return 0;
}
| 1,900 | CPP |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n=I()
ans=[]
l=LI()
for x in l:
if 15<=x<21:
ans.append('YES')
else:
a=[]
for i in range(15,21):
a.append(x-i)
f=False
for y in a:
if y>=14 and y%14==0:
f=True
break
if f:
ans.append('YES')
continue
else:
ans.append('NO')
for x in ans:
print(x)
main()
# print(main())
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[1005][1005], b[1005][1005], c[1005][1005], n, m;
int p[5] = {1, 2, 3, 4};
inline void qwq() {
for (int i = 1; i <= n; i++) {
int now = 0, flag = 1;
if (i % 2 == 0) now = 2;
for (int j = 1; j <= m; j++) {
if (a[i][j] && a[i][j] != p[now]) {
flag = 0;
break;
}
c[i][j] = p[now];
now ^= 1;
}
if (flag) continue;
now = 1, flag = 1;
if (i % 2 == 0) now = 3;
for (int j = 1; j <= m; j++) {
if (a[i][j] && a[i][j] != p[now]) {
flag = 0;
break;
}
c[i][j] = p[now];
now ^= 1;
}
if (!flag) return;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cout << c[i][j];
puts("");
}
exit(0);
}
inline void qaq() {
for (int j = 1; j <= m; j++) {
int now = 0, flag = 1;
if (j % 2 == 0) now = 2;
for (int i = 1; i <= n; i++) {
if (a[i][j] && a[i][j] != p[now]) {
flag = 0;
break;
}
c[i][j] = p[now];
now ^= 1;
}
if (flag) continue;
now = 1, flag = 1;
if (j % 2 == 0) now = 3;
for (int i = 1; i <= n; i++) {
if (a[i][j] && a[i][j] != p[now]) {
flag = 0;
break;
}
c[i][j] = p[now];
now ^= 1;
}
if (!flag) return;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cout << c[i][j];
puts("");
}
exit(0);
}
int main(int argc, char** argv) {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%1d", &a[i][j]);
do {
qwq();
qaq();
} while (next_permutation(p, p + 4));
cout << 0;
return 0;
}
| 2,500 | CPP |
Subsets and Splits