solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
liste1 = input().split()
endliste = [0]*n
for i in range(len(liste1)):
endliste[int(liste1[i])-1] = i+1
string = " ".join(str(x) for x in endliste)
print(string) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[127];
int main() {
string s;
int ans = 0;
cin >> s;
for (int i = 0, n = s.size(); i < n; i++) arr[(int)s[i]]++;
while (true) {
if (arr['n'] >= 3 && arr['e'] >= 3 && arr['t'] >= 1 && arr['i'] >= 1) {
ans++;
arr['n'] -= 2;
arr['e'] -= 3;
arr['t']--;
arr['i']--;
} else
break;
}
cout << ans;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int mx = 0;
struct edge {
int fr, to, next1, next2;
} e[maxn << 1];
int h[maxn], d[maxn], pr[maxn];
int vis[maxn];
void init() {
memset(h, -1, sizeof(h));
memset(pr, -1, sizeof(pr));
return;
}
int cnt = 0;
void add(int u, int v) {
e[cnt].fr = u;
e[cnt].to = v;
e[cnt].next1 = h[u];
e[cnt].next2 = pr[v];
h[u] = pr[v] = cnt++;
return;
}
int inq[maxn];
int f[maxn];
void a_star_pre() {
queue<int> q;
q.push(0);
f[0] = 0;
inq[0] = 1;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = pr[x]; i != -1; i = e[i].next2) {
if (e[i].fr != 0 && inq[e[i].fr] == 0) {
f[e[i].fr] = f[x] + 1;
inq[e[i].fr] = 1;
q.push(e[i].fr);
}
}
}
return;
}
int ans[maxn];
void find(int x) {
vis[x]++;
int pos = -1, mxl = 2147483647;
for (int i = h[x]; i != -1; i = e[i].next1) {
if (vis[e[i].to] && e[i].to != 0) continue;
if (pos == -1) {
pos = e[i].to;
mxl = f[e[i].to];
} else {
if (mxl < f[e[i].to]) {
pos = e[i].to;
mxl = f[e[i].to];
}
}
}
if (pos == -1) return;
ans[++cnt] = pos;
find(pos);
return;
}
int n;
int main() {
init();
cin >> n;
for (int i = 0; i < n; ++i) {
int x = (2 * i) % n;
int y = (2 * i + 1) % n;
if (x != i) add(i, x);
if (y != i) add(i, y);
}
a_star_pre();
cnt = 0;
ans[++cnt] = 0;
find(0);
if (cnt != n + 1) {
cout << -1 << endl;
return 0;
} else {
for (int i = 1; i <= cnt; ++i) cout << ans[i] << " ";
cout << endl;
}
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int E = 5e2 + 5;
int a, b, n, k;
bool dp[E][E];
long long c, d, ans;
int main() {
scanf("%d%d", &n, &k);
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
c += a;
d += b;
for (int j = 0; j < k; j++) {
if (dp[i][j]) {
dp[i + 1][j] = 1;
}
}
for (int l = 0; l < k; l++) {
if (dp[i][l]) {
for (int j = max(k - b, 1); j <= min(a, k - 1); j++) {
dp[i + 1][(l + j) % k] = 1;
}
}
}
}
ans = c / k + d / k;
for (int i = 0; i < k; i++) {
if (dp[n][i]) {
ans = max(ans, (c - i) / k + (d + i) / k);
}
}
printf("%lld\n", ans);
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, pos[N][2];
long long a[N], b[N];
bool flag;
long long read() {
long long d = 0;
char ch = getchar();
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) d = (d << 3) + (d << 1) + ch - 48, ch = getchar();
return d;
}
int main() {
n = read();
for (int i = 1; i <= n; i++) a[i] = a[i - 1] + read();
for (int i = 1; i <= n; i++) b[i] = b[i - 1] + read();
if (a[n] < b[n]) {
for (int i = 1; i <= n; i++) swap(a[i], b[i]);
flag = 1;
}
memset(pos, -1, sizeof(pos));
for (int i = 0, j = 0; i <= n; i++) {
while (j < n && a[i] >= b[j + 1]) j++;
int k = a[i] - b[j];
if (pos[k][0] >= 0) {
if (flag) swap(i, j), swap(pos[k][0], pos[k][1]);
printf("%d\n", i - pos[k][0]);
for (int l = pos[k][0] + 1; l <= i; l++) printf("%d ", l);
printf("\n%d\n", j - pos[k][1]);
for (int l = pos[k][1] + 1; l <= j; l++) printf("%d ", l);
return 0;
}
pos[k][0] = i;
pos[k][1] = j;
}
return 0;
}
| 3,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e18;
const long long N = 1e5 + 2;
const long long mod = 1e9 + 7;
const long double eps = 1E-7;
long double n, A, B, C, a[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> A >> B;
for (int i = 1; i <= int(n); i++) {
cin >> a[i];
C = C + a[i];
}
if (a[1] * A / C >= B) {
cout << 0;
return 0;
}
sort(a + 2, a + 1 + int(n));
for (int i = n; i > 1; i--) {
C -= a[i];
if (a[1] * A / C >= B) {
cout << n - i + 1;
return 0;
}
}
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int i = s.length() - 1; i >= 0; i--) {
string s1 = s.substr(i);
if (s1 == "po") {
cout << "FILIPINO";
break;
} else if (s1 == "desu" || s1 == "masu") {
cout << "JAPANESE";
break;
} else if (s1 == "mnida") {
cout << "KOREAN";
break;
}
}
cout << endl;
}
}
| 800 | CPP |
for _ in range(int(input())):
n, k = map(int, input().split())
a_arr = sorted(map(int, input().split()))
b_arr = sorted(map(int, input().split()), key=lambda v: -v)
for i in range(k):
if a_arr[i] >= b_arr[i]:
break
a_arr[i] = b_arr[i]
print(sum(a_arr))
| 800 | PYTHON3 |
n,m=[int(x) for x in input().split()]
c=0
for i in range(n):
a=list(map(int,input().split()))
for j in range(0,m*2,2):
if(a[j]==1 or a[j+1]==1):
c+=1
print(c)
#2 2
#0 0 0 1
#1 0 1 1
#1 3
#1 1 0 1 0 0
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 6e5;
int gi() {
int w = 0;
bool q = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') q = 0, c = getchar();
while (c >= '0' && c <= '9') w = w * 10 + c - '0', c = getchar();
return q ? w : -w;
}
int head[N], nxt[2 * N], to[N * 2];
int fa[N], siz[N], in[N], dep[N], n;
long long sum[N];
int G[N];
inline int find(int x) { return G[x] == x ? x : G[x] = find(G[x]); }
inline long long f(int k) {
return -in[k] * sum[k] - 1LL * in[k] * (n - siz[k]) * (n - siz[k] - 1);
}
inline void dfs(int k) {
siz[k] = in[k] = 1;
dep[k] = dep[fa[k]] + 1;
for (int i = head[k]; i; i = nxt[i])
if (to[i] != fa[k]) {
fa[to[i]] = k;
dfs(to[i]);
siz[k] += siz[to[i]];
sum[k] += 1LL * siz[to[i]] * (siz[to[i]] - 1);
}
}
int main() {
int i, s, a, b, tot = 0, m, A, B;
n = gi();
for (i = 1; i < n; i++) {
a = gi(), b = gi();
to[++tot] = b, nxt[tot] = head[a], head[a] = tot;
to[++tot] = a, nxt[tot] = head[b], head[b] = tot;
}
for (i = 1; i <= n; i++) G[i] = i;
dfs(1);
long long ans = 1LL * n * (n - 1) * (n - 2), S;
for (i = 1; i <= n; i++) ans += f(i);
printf("%I64d\n", ans);
for (m = gi(); m--;) {
a = find(gi()), b = find(gi());
S = s = A = B = 0;
while (a != b) {
if (dep[a] < dep[b]) swap(a, b);
s += in[a];
S += sum[a] - 1LL * siz[a] * (siz[a] - 1);
ans -= f(a);
G[a] = fa[a], a = find(fa[A = a]);
}
S += sum[a];
ans -= f(a);
in[a] += s, sum[a] = S;
ans += f(a);
printf("%I64d\n", ans);
}
return 0;
}
| 3,300 | CPP |
n=int(input())
lst=list(map(int,input().split()))
summa=0
for i,x in enumerate(lst):
summa+=x-1
if summa%2==0:print(2)
else:print(1) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m;
cin >> n;
int cost = 0;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int j = 0; j < n; j++) {
cost = 0;
for (int p = 0; p < arr[j]; p++) {
int v;
cin >> v;
cost = cost + (v * 5);
}
cost = cost + (arr[j] * 15);
if (j == 0) {
m = cost;
} else {
if (cost <= m) {
m = cost;
}
}
}
cout << m;
return 0;
}
| 900 | CPP |
import os
import sys
from io import BytesIO, IOBase
# 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")
# ------------------------------
def RL(): return map(int, sys.stdin.readline().rstrip().split())
def RLL(): return list(map(int, sys.stdin.readline().rstrip().split()))
def N(): return int(input())
def print_list(l):
print(' '.join(map(str,l)))
# import sys
# sys.setrecursionlimit(5010)
# from heapq import *
# from collections import deque as dq
# from math import ceil,floor,sqrt,pow
# import bisect as bs
# from collections import Counter
# from collections import defaultdict as dc
for _ in range(N()):
n = N()
for a in range((n//3)+1):
flag = False
for b in range(((n-a*3)//5)+1):
if (n-a*3-b*5)%7==0:
print(a,b,(n-a*3-b*5)//7)
flag = True
break
if flag:
break
if not flag:
print(-1)
| 900 | PYTHON3 |
n = int(input())
problems = 0
for i in range(n):
knowledge=input()
if knowledge.count('1') >= 2:
problems+=1
print(problems)
| 800 | PYTHON3 |
def abc(k,val,m):
ans=0
i=0
j=len(k)-1
while i<=j:
mid = i+(j-i)//2
if k[mid]-m<=val:
ans=mid
i=mid+1
else:
j=mid-1
return ans
t=int(input())
for _ in range(t):
n,s=map(int,input().split())
l=list(map(int,input().split()))
k=[0]
for i in l:
k.append(i+k[-1])
if k[-1]<=s:
print(0)
else:
ans=-1
x=-1
c=0
g=0
for i in range(n):
if c>s:
break
g+=l[i]
m = abc(k,s-c,g)
if ans==-1:
ans=m-1
x=i
else:
if ans<m-1:
ans=m-1
x=i
c+=l[i]
print(x+1)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int i, j, a, n, m, g1, s1, x[1002];
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> s;
for (j = 0; j < m; j++) {
if (s[j] == 'S') s1 = j;
if (s[j] == 'G') g1 = j;
}
if (s1 < g1) {
cout << "-1" << endl;
return 0;
}
x[s1 - g1] = 1;
}
for (i = 1; i <= m; i++) {
if (x[i] == 1) a++;
}
cout << a;
}
| 1,200 | CPP |
n,m=map(int,input().split())
arr=input("")
a=[0]+[int(i) for i in arr.split()]
ans=0
for i in range(1,m+1):
x,y=map(int,input().split())
ans=ans+min(a[x],a[y])
print(ans) | 1,400 | PYTHON3 |
t = int(input())
for T in range(t):
n = int(input())
if n == 1:
print(-1)
else:
print(2, sep = "", end = "")
for i in range(n-1):
print(3, sep = "", end = "")
print("")
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
string ans;
map<int, int> ml, mr;
int main() {
int i, j, k, l;
int n, m, s, f;
while (scanf("%d%d%d%d", &n, &m, &s, &f) != EOF) {
ml.clear();
mr.clear();
ans.clear();
for (i = 1; i <= m; i++) {
scanf("%d%d%d", &j, &k, &l);
ml[j] = k;
mr[j] = l;
}
int mark = 0;
while (s != f) {
mark++;
int next_;
if (s < f)
next_ = s + 1;
else
next_ = s - 1;
if ((s >= ml[mark] && s <= mr[mark]) ||
(next_ >= ml[mark] && next_ <= mr[mark]) && ml[mark] + mr[mark]) {
ans += 'X';
continue;
}
if (s < f) {
s++;
ans += 'R';
} else {
s--;
ans += 'L';
}
}
cout << ans << endl;
}
return 0;
}
| 1,500 | CPP |
n = int(input())
a = [input() for _ in range(n)]
flag = 0
for i in range(n):
if a[i].find('OO') != -1:
a[i] = a[i].replace('OO','++',1)
flag = 1
break
print('YES' if flag else 'NO')
if flag:
for s in a:print(s) | 800 | PYTHON3 |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
n = int(stdin.readline().strip())
numbers = list(map(int, stdin.readline().strip().split()))
temp = 1
ans = 1
for i, j in zip(numbers, numbers[1:]):
if i <= j:
temp += 1
ans = max(ans, temp)
else:
temp = 1
print(ans)
if not live: stdin.close() | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10, SQ = 40;
int par[maxn];
double dp[maxn][SQ];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int q, C = 2;
cin >> q;
dp[1][0] = 1;
while (q--) {
int typ, u;
cin >> typ >> u;
if (typ == 1) {
par[C] = u;
dp[C][0] = 1;
int tmp = u, son = C, h = 1;
double bfd = 0;
while (tmp && h < SQ) {
double val = 1 - dp[tmp][h];
val /= double(0.5) * (1 + (1 - bfd));
val *= double(0.5) * (1 + (1 - dp[son][h - 1]));
bfd = dp[tmp][h];
dp[tmp][h] = 1 - val;
h++, son = tmp, tmp = par[tmp];
}
C++;
} else {
double ans = 0;
for (int i = 1; i < SQ; i++) {
ans += dp[u][i];
}
cout << setprecision(8) << fixed << ans << "\n";
}
}
return 0;
}
| 2,700 | CPP |
n=int(input())
x=0;
for i in range(n):
s=input();
if s[0]=='+' or s[-1]=='+':
x=x+1
else:
x=x-1
print(x) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tc;
cin >> tc;
while (tc--) {
long long n, k;
cin >> n >> k;
long long ar[n];
int d = 0;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
ar[i] = x;
}
long long mx = -1e18;
for (long long i = n - 1; i >= max(0LL, n - 100); i--) {
for (long long j = 0; j < n; j++) {
if (i != j) {
long long ans = ((i + 1) * (j + 1)) - (k * (ar[i] | ar[j]));
mx = max(mx, ans);
}
}
}
cout << mx << endl;
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef struct {
long long num, cost;
} figures;
bool cmp(figures a, figures b) { return a.cost < b.cost; }
int main() {
int i, j, k, l, n, m;
cin >> n;
figures fig[n];
for (int i = 0; i < (n); i++) cin >> fig[i].num >> fig[i].cost;
long long t;
cin >> t;
long long dest[t];
for (int i = 0; i < (t); i++) cin >> dest[i];
sort(fig, fig + n, cmp);
sort(dest, dest + t);
long long prev1 = 0, prev2 = 0;
for (int i = (0); i < (t); i++) {
prev2 = dest[i];
dest[i] -= prev1;
prev1 = prev2;
}
int ind = 0;
long long f = 1, ct = 0;
long long tot = 0;
while (ind < n) {
long long can;
long long avail = fig[ind].num;
if (ct < t)
can = min(avail, dest[ct]);
else
can = avail;
tot += can * f * fig[ind].cost;
if (ct < t) {
dest[ct] -= can;
if (dest[ct] == 0) {
f = min(f + 1, t + 1);
ct++;
}
}
fig[ind].num -= can;
if (fig[ind].num == 0) {
ind++;
}
}
cout << tot << endl;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5;
int T;
long long len, sum;
int n;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
int ans = 0, l = 0, r = M;
while (l <= r) {
int mid = (l + r) >> 1;
if (mid * 1ll * mid + mid * 4ll + 4 >= n * 4ll)
r = mid - 1, ans = mid;
else
l = mid + 1;
}
printf("%d\n", ans);
}
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int N = 250;
int x[N];
bool solve() {
double sum = 0;
for (int i = (0); i < (N); ++i) sum += x[i];
double avg = sum / N;
double sumsq = 0;
for (int i = (0); i < (N); ++i) sumsq += (x[i] - avg) * (x[i] - avg);
double var = sumsq / (N - 1);
double res = 3 * var / avg / avg;
return res > .6;
}
void run() {
for (int i = (0); i < (N); ++i) scanf("%d", &x[i]);
printf("%s\n", solve() ? "uniform" : "poisson");
}
void testunif() {
int P = rand() % (1000 - 10 + 1) + 10;
for (int i = (0); i < (N); ++i) x[i] = rand() % (2 * P + 1);
assert(solve());
}
void testpoisson() {
int P = rand() % (1000 - 10 + 1) + 10;
double L = exp(-1.0 * P);
for (int i = (0); i < (N); ++i) {
int k = 0;
double p = 1;
do {
++k;
double u = 1.0 * rand() / RAND_MAX;
p *= u;
} while (p > L);
x[i] = k - 1;
}
assert(!solve());
}
int main() {
int n;
scanf("%d", &n);
for (int i = (1); i <= (n); ++i) run();
return 0;
}
| 2,100 | CPP |
def solve ():
s = list(input())
s1 = s.copy()
success = False
for i in range(0, len(s)-25):
good_substring = True
for j in ('ABCDEFGHIJKLMNOPQRSTUVWXYZ'):
if(s[i:i+26].count(j) > 1):
good_substring = False
if(good_substring == False):
continue
for j in ('ABCDEFGHIJKLMNOPQRSTUVWXYZ'):
counter = s[i:i+26].count(j)
if counter == 0:
if s1[i:i+26].count('?') != 0:
s1[s1.index('?', i, i + 26)] = j
if(j == 'Z'):
success = True
break
if(success):
for i in range(0, len(s1)):
if s1[i] == '?':
s1[i] = 'A'
for i in s1:
print(i, end = '')
else:
print(-1)
solve() | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = n; i > n - k; i--) cout << i << " ";
for (int i = 1; i <= n - k; i++) cout << i << " ";
cout << "\n";
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
int main(void) {
std::vector<int> a;
std::map<int, int> seen;
int best, n, k, q, x, i, j, l;
std::cin >> n >> k;
a.resize(n);
seen[0] = 0;
for (i = 0; i < n; ++i) {
std::cin >> a[i];
for (j = 1; j <= k; ++j) {
if (seen.count(a[i] * j)) {
seen[a[i] * j] = std::min(seen[a[i] * j], j);
} else {
seen[a[i] * j] = j;
}
}
}
std::cin >> q;
while (q--) {
std::cin >> x;
best = INT_MAX;
for (i = 0; i < n; ++i) {
for (j = 1; j <= k && a[i] * j <= x; ++j) {
if (seen.count(x - a[i] * j) && j + seen[x - a[i] * j] <= k) {
best = std::min(best, j + seen[x - a[i] * j]);
}
}
}
if (best == INT_MAX) {
std::cout << "-1\n";
} else {
std::cout << best << "\n";
}
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, ar[3000], c[2100][2100], hput, cpos;
long long ar1[3000], ar2[3000];
long long fact[5000], ways[5000];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
}
for (int i = 0; i <= 2000; i++)
for (int j = 0; j <= 2000; j++)
if (j == 0 || j == i)
c[i][j] = 1;
else
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007;
for (int i = 1; i <= n; i++)
if (ar[i] == -1) ar1[i] = 1;
for (int i = 1; i <= n; i++)
if (ar[i] > 0) ar2[ar[i]] = 1;
for (int i = 1; i <= n; i++)
if (ar1[i] == 1 && ar2[i] == 0) hput++;
for (int i = 1; i <= n; i++)
if (ar1[i] == 1) cpos++;
fact[0] = 1;
for (int i = 1; i <= 2500; i++) fact[i] = fact[i - 1] * i % 1000000007;
for (int bad = 0; bad <= hput; bad++)
ways[bad] = c[hput][bad] * fact[cpos - bad] % 1000000007;
for (int i = hput - 1; i >= 0; i--)
for (int j = i + 1; j <= hput; j++) {
ways[i] = ways[i] - ways[j] * c[j][i] % 1000000007;
while (ways[i] < 0) ways[i] += 1000000007;
}
cout << ways[0] << endl;
cin.get();
cin.get();
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long T;
long long a[200005];
long long b[200005];
vector<pair<long long, long long> > v1;
vector<pair<long long, long long> > v2;
int main() {
scanf("%d%d", &n, &T);
double ans = 0;
long long low = 0, high = 0;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) scanf("%d", &b[i]);
for (int i = 0; i < n; i++) {
long long x = b[i], y = a[i];
if (x == T)
ans += y;
else if (x < T) {
v1.push_back(pair<long long, long long>(x, y));
low += (T - x) * y;
ans += y;
} else if (x > T) {
v2.push_back(pair<long long, long long>(x, y));
high += (x - T) * y;
ans += y;
}
}
if (low == high) {
printf("%.8f", ans);
return 0;
} else if (low > high) {
long long minus = low - high;
sort(v1.begin(), v1.end());
for (int i = 0; i < v1.size(); i++) {
if ((T - v1[i].first) * v1[i].second > minus) {
ans -= (double)minus / (T - v1[i].first);
break;
} else {
ans -= v1[i].second;
minus -= (T - v1[i].first) * v1[i].second;
}
}
printf("%.8f", ans);
} else {
long long minus = high - low;
sort(v2.begin(), v2.end());
for (int i = v2.size() - 1; i >= 0; i--) {
if ((v2[i].first - T) * v2[i].second > minus) {
ans -= (double)minus / (v2[i].first - T);
break;
} else {
ans -= v2[i].second;
minus -= (v2[i].first - T) * v2[i].second;
}
}
printf("%.8f", ans);
}
return 0;
}
| 2,000 | CPP |
from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin, tan
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
x=list(stdin.readline())
x.pop()
return x
def si(): return stdin.readline()
############# CODE STARTS HERE #############
for _ in range(ii()):
n=ii()
a=li()
f=-1
for i in range(n):
if not a[i]%2:
f=i+1
if f==-1:
if n>1:
print(2)
print(1, 2)
else:
print(f)
else:
print(1)
print(f) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[100100], b[100100];
vector<long long> q;
pair<int, int> t[400400];
int p[100100];
pair<int, int> find_max(int l, int r, int lv, int rv, int v) {
if (l > rv || r < lv) return make_pair(-1, -1);
if (lv >= l && rv <= r) return t[v];
return max(find_max(l, r, lv, (lv + rv) / 2, v * 2),
find_max(l, r, (lv + rv) / 2 + 1, rv, v * 2 + 1));
}
void modify(int v, int i, int d) {
t[v] = max(t[v], make_pair(d, i));
v /= 2;
for (; v > 0; v /= 2) t[v] = max(t[v * 2], t[v * 2 + 1]);
}
int main() {
ios_base::sync_with_stdio(0);
int n, d;
scanf("%d%d", &n, &d);
for (int i = 0; i < n; i++) scanf("%I64d", &a[i]);
for (int i = 0; i < n; i++) b[i] = a[i];
sort(b, b + n);
for (int i = 0; i < n; i++)
if (i == 0 || b[i] != b[i - 1]) q.push_back(b[i]);
int k = q.size();
int z = 1;
pair<int, int> ans = make_pair(-1, -1);
while (z < k) z *= 2;
cerr << z << endl;
for (int i = 0; i < z * 2; i++) t[i] = make_pair(0, -1);
for (int i = 0; i < n; i++) {
int r = lower_bound(q.begin(), q.end(), a[i] + d) - q.begin();
int l = upper_bound(q.begin(), q.end(), a[i] - d) - q.begin() - 1;
pair<int, int> m = make_pair(0, -1);
if (r < q.size()) {
m = find_max(r + 1, z, 1, z, 1);
}
if (l >= 0) {
m = max(m, find_max(1, l + 1, 1, z, 1));
}
int t = lower_bound(q.begin(), q.end(), a[i]) - q.begin() + 1;
p[i] = m.second;
modify(t + z - 1, i, m.first + 1);
ans = max(ans, make_pair(m.first + 1, i));
}
printf("%d\n", ans.first);
vector<int> A;
while (ans.second != -1) {
A.push_back(ans.second);
ans.second = p[ans.second];
}
for (int i = A.size() - 1; i >= 0; i--) printf("%d ", A[i] + 1);
return 0;
}
| 2,000 | CPP |
n = int(input())
A = list(map(int, input().split()))
B = []
for i in range(n - 1):
B.append(abs(A[i] - A[i + 1]))
dpmin = [0] * n
dpmax = [0] * n
for i in range(n - 2, -1, -1):
dpmax[i] = B[i]
dpmin[i] = B[i]
dpmin[i] = min(dpmin[i], B[i] - dpmax[i + 1])
dpmax[i] = max(dpmax[i], B[i] - dpmin[i + 1])
print(max(dpmax))
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
double pi = acos(-1);
const long long mod = 1000000007;
using namespace std;
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const long long N = 1000005;
long long fact[N], invfact[N];
long long power(long long x, long long y) {
if (y <= 0) return 1LL;
long long z = power(x, y / 2);
if (y % 2) return (((z * z) % mod) * x) % mod;
return (z * z) % mod;
}
void pre() {
fact[0] = invfact[0] = invfact[1] = fact[1] = 1;
for (int i = 2; i < N; i++) fact[i] = (i * fact[i - 1]) % mod;
for (int i = 2; i < N; i++)
invfact[i] = (invfact[i - 1] * power(i, mod - 2)) % mod;
}
long long nCr(long long n, long long k) {
if (k < 0 || k > n) return 0;
return (((fact[n] * invfact[n - k]) % mod) * invfact[k]) % mod;
}
const long long N1 = 1e6 + 1;
vector<long long> isprime(N1, 1), prime;
void seive() {
for (int i = 2; i < sqrt(N1) + 1; i++) {
if (isprime[i]) {
for (long long j = i * i; j < N1; j += i) isprime[j] = 0;
prime.push_back(i);
}
}
for (int i = sqrt(N1) + 1; i < N1; i++)
if (isprime[i]) prime.push_back(i);
}
struct dsu {
vector<long long> par, rank;
dsu(long long n) : par(n + 1), rank(n + 1) {
for (long long i = 0; i <= n; i++) {
par[i] = i;
rank[i] = 1;
}
}
long long root(long long a) {
if (a == par[a]) return a;
return par[a] = root(par[a]);
}
void merge(long long a, long long b) {
a = root(a);
b = root(b);
if (a == b) return;
if (rank[a] > rank[b]) swap(a, b);
par[b] = a;
}
set<long long> parent(long long n) {
set<long long> second;
for (long long i = 1; i <= n; i++) {
second.insert(root(i));
}
return second;
}
};
void solve() {
vector<int> count(3, 0);
for (int j = 0; j < 3; j++) {
string line;
getline(cin, line);
for (auto i : line)
if (i == 'a' || i == 'e' || i == 'i' || i == 'o' || i == 'u') count[j]++;
}
if (count[0] == 5 && count[1] == 7 && count[2] == 5)
cout << "YES";
else
cout << "NO";
}
int main() {
optimizeIO();
{ solve(); }
}
| 800 | CPP |
div = [int(input()) for i in range(4)]
d = [True for i in range(int(input()))]
for i in range(4):
s = 0
if div[i] == 1:
d = [False for i in range(len(d))]
break
while s + div[i] <= len(d):
d[s + div[i] - 1] = False
s += div[i]
print(d.count(False)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, rez = 1, br = 0;
string s[220], p, x;
map<string, vector<string>> m;
void dfs(string l) {
br++;
for (int i = 0; i < m[l].size(); i++) dfs(m[l][i]);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> x >> p;
transform(s[i].begin(), s[i].end(), s[i].begin(), ::tolower);
transform(p.begin(), p.end(), p.begin(), ::tolower);
m[s[i]].push_back(p);
}
for (int i = n; i >= 1; i--) {
br = 0;
dfs(s[i]);
rez = max(rez, br);
}
cout << rez;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int ans[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int ind = 0;
ans[0] = 0;
for (int i = 0; i < k; i++) ans[ind] += arr[i];
ind++;
for (int i = 1; i < n; i++) {
if (ind == (n - k) + 1)
break;
else {
ans[ind] = (ans[i - 1] - arr[i - 1]) + arr[i - 1 + k];
ind++;
}
}
int min = 0;
int miner = ans[0];
for (int i = 1; i <= n - k; i++) {
if (ans[i] < miner) {
miner = ans[i];
min = i + 1;
} else if (i == n - k)
break;
}
if (min == 0)
cout << "1";
else
cout << min;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int i, j, k;
int main(void) {
int n, tw, h;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
if (j == 100)
h++;
else
tw++;
}
if (h == 0 && tw % 2 != 0) {
cout << "NO";
return 0;
}
if ((h + (2 * tw)) % 2 != 0) {
cout << "NO";
} else
cout << "YES";
return 0;
}
| 1,100 | CPP |
a,b,c = map(int,input().split())
from decimal import *
getcontext().prec = 1000
s = str(Decimal(a)/Decimal(b))
if(len(s) > 1000) :
s = s[:len(s)-1]
else :
s += '0'
index = 0
for i in s :
if(i == '.') :
break
index += 1
c = str(c)
ans = 0
flag = False
l = len(s)
for i in range(index+1,l):
ans += 1
if(s[i] == c):
flag = True
break
if(flag) :
print(ans)
else :
print(-1) | 1,300 | PYTHON3 |
import math
t=int(input())
while(t):
n=int(input())
for i in range(2,10**5):
if(n%i==0):
print(n//i,n-(n//i))
break
else:
print(1,n-1)
t=t-1 | 1,300 | PYTHON3 |
t = int(input())
while t>0:
n = int(input())
x = input()
a = "1"
b = "1"
i = 1
while i<n and x[i]!="1":
a+=str(int(x[i])//2)
b+=str(int(x[i])//2)
i+=1
if i!=n:
a+="1"
b+="0"
i+=1
a+="0"*(n-i)
b+=x[i:]
print(a,"\n",b,sep="")
t-=1 | 1,200 | PYTHON3 |
n = int(input())
e = []
c = [-1]
diff = []
for i in range(n-1):
e.append(list(map(int, input().split(' '))))
for i in map(int, input().split(' ')):
c.append(i)
for i in range(n-1):
if c[e[i][0]] != c[e[i][1]]:
diff.append(e[i])
if not diff: # All same color, print any
print("YES")
print(e[0][0])
else:
s = set(diff[0])
for d in diff:
s.intersection_update(d)
if s:
print("YES")
print(list(s)[0])
else:
print("NO")
| 1,600 | PYTHON3 |
class CodeforcesTask1105BSolution:
def __init__(self):
self.result = ''
self.n_k = []
self.string = ''
def read_input(self):
self.n_k = [int(x) for x in input().split(" ")]
self.string = input()
def process_task(self):
scores = [0] * 26
prev = None
prog = 0
for x in range(self.n_k[0]):
c = self.string[x]
if prev == c:
prog += 1
else:
prog = 1
if prog == self.n_k[1]:
scores[ord(c) - 97] += 1
prog = 0
prev = c
self.result = str(max(scores))
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask1105BSolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
| 1,100 | PYTHON3 |
for i in range(int(input())):
m,n = map(int,input().split())
if(m == n):
print(0)
else:
if((abs(m-n))> 10):
if((abs(m-n))%10 != 0):
print(((abs(m-n))//10)+1)
else:
print(((abs(m-n))//10))
else:
print(1)
| 800 | PYTHON3 |
from collections import Counter,defaultdict,deque
#from heapq import *
#import itertools
#from operator import itemgetter
#from itertools import count, islice
#from functools import reduce
#alph = 'abcdefghijklmnopqrstuvwxyz'
#dirs = [[1,0],[0,1],[-1,0],[0,-1]]
#from math import factorial as fact
#a,b = [int(x) for x in input().split()]
#sarr = [x for x in input().strip().split()]
#import math
from math import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(2**30)
#mod = 10**9+7
def solve():
h,c,t = [int(x) for x in input().split()]
avg = (h+c)/2
if avg>=t:
print(2)
return
d = t-avg
n1 = floor((h-avg)/d)
if n1%2==0:
n1-=1
n2 = n1+2
a1 = d-((h-avg)/n1)
a2 = d-((h-avg)/n2)
if abs(a1)<=abs(a2):
print(n1)
else:
print(n2)
tt = int(input())
for test in range(tt):
solve()
#
| 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[200100], b[200100];
vector<int> vec1, vec2;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
int kol = 0;
if (vec1.empty() || vec1.back() < a[i]) ++kol;
if (vec2.empty() || vec2.back() > a[i]) ++kol;
if (kol == 0) return cout << "NO", 0;
if (kol == 1) {
if (vec1.empty() || vec1.back() < a[i]) {
vec1.push_back(a[i]);
} else {
vec2.push_back(a[i]);
b[i] = 1;
}
} else {
if (i == n) {
vec1.push_back(a[i]);
} else {
if (a[i] < a[i + 1]) {
vec1.push_back(a[i]);
} else {
vec2.push_back(a[i]);
b[i] = 1;
}
}
}
}
cout << "YES\n";
for (int i = 1; i <= n; i++) cout << b[i] << ' ';
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, mxdep, dep[100005], fa[100005], cnt[100005];
int x, d[100005], vis[100005], tot, ans[100005];
int em, e[100005], nx[100005], ls[100005];
void insert(int x, int y) {
em++;
e[em] = y;
nx[em] = ls[x];
ls[x] = em;
cnt[x]++;
}
int main() {
scanf("%d", &n);
dep[0] = 1;
for (i = 1; i < n; i++) {
scanf("%d", &fa[i]), dep[i] = dep[fa[i]] + 1;
x = (dep[i] > dep[x]) ? i : x;
insert(fa[i], i);
}
mxdep = dep[x];
while (cnt[x] == 0 && x) d[++d[0]] = x, vis[x] = 1, cnt[fa[x]]--, x = fa[x];
for (tot = 1; tot <= n - mxdep; tot++) {
for (int &i = ls[x]; i; i = nx[i])
if (!vis[e[i]]) {
x = e[i], ans[tot] = d[d[0]];
break;
}
while (cnt[x] == 0 && x) d[++d[0]] = x, vis[x] = 1, cnt[fa[x]]--, x = fa[x];
}
printf("0 ");
while (d[0]) printf("%d ", d[d[0]--]);
printf("\n%d\n", n - mxdep);
for (i = n - mxdep; i >= 1; i--) printf("%d ", ans[i]);
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1};
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> x) {
os << "(" << x.first << ", " << x.second << ")";
return os;
}
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
a = (a + b) % MOD;
if (a < 0) a += MOD;
}
template <typename T>
inline bool IsPri(T x) {
if (x < 2) return false;
for (T i = 2; i * i <= x; ++i)
if (x % i == 0) return false;
return true;
}
template <typename T>
inline T _Gcd(T a, T b) {
while (b) {
T t = b;
b = a % b;
a = t;
}
return a;
}
template <typename T>
inline int _BitCnt(T x) {
int cnt = 0;
while (x) ++cnt, x &= x - 1;
return cnt;
}
inline long long Pow(long long a, long long n) {
long long t = 1;
a %= MOD;
while (n > 0) {
if (n & 1) t = t * a % MOD;
a = a * a % MOD, n >>= 1;
}
return t % MOD;
}
inline int read() {
static char buf[1000000], *p1 = buf, *p2 = buf;
register int x = false;
register char ch =
p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
? EOF
: *p1++;
;
register bool sgn = false;
while (ch != '-' && (ch < '0' || ch > '9'))
ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
? EOF
: *p1++;
;
if (ch == '-')
sgn = true,
ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
? EOF
: *p1++;
;
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48),
ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
? EOF
: *p1++;
;
return sgn ? -x : x;
}
const int N = 110;
int n, m;
char g[N][N];
vector<vector<int>> ans;
void filp(int x1, int y1, int x2, int y2, int x3, int y3) {
g[x1][y1] ^= 1, g[x2][y2] ^= 1, g[x3][y3] ^= 1;
ans.push_back({x1, y1, x2, y2, x3, y3});
}
void Filp(int x, int y, int k) {
if (k == 1) filp(x, y, x, y + 1, x + 1, y);
if (k == 2) filp(x, y, x, y + 1, x + 1, y + 1);
if (k == 3) filp(x, y, x + 1, y, x + 1, y + 1);
if (k == 4) filp(x, y + 1, x + 1, y, x + 1, y + 1);
}
void solve() {
vector<pair<int, int>> v, v2;
for (int i = n - 1; i <= n; ++i)
for (int j = m - 1; j <= m; ++j)
if (g[i][j] == '1')
v.push_back({i, j});
else
v2.push_back({i, j});
if (((int)(v).size()) == 4 || ((int)(v).size()) == 3)
filp(v[0].first, v[0].second, v[1].first, v[1].second, v[2].first,
v[2].second);
else if (((int)(v).size()) == 2 || ((int)(v).size()) == 1)
filp(v2[0].first, v2[0].second, v2[1].first, v2[1].second, v[0].first,
v[0].second);
}
int main() {
int T;
cin >> T;
while (T--) {
ans.clear();
cin >> n >> m;
for (int i = 1; i <= n; ++i) scanf("%s", g[i] + 1);
for (int i = 1; i <= n - 2; ++i) {
for (int j = 1; j < m; j += 2) {
if (g[i][j] == '1' && g[i][j + 1] == '1')
Filp(i, j, 1);
else if (g[i][j] == '1')
Filp(i, j, 3);
else if (g[i][j + 1] == '1')
Filp(i, j, 4);
}
if ((m & 1) && g[i][m] == '1') Filp(i, m - 1, 4);
}
for (int j = 1; j <= m - 2; ++j)
if (g[n - 1][j] == '1' && g[n][j] == '1')
Filp(n - 1, j, 1);
else if (g[n - 1][j] == '1')
Filp(n - 1, j, 2);
else if (g[n][j] == '1')
Filp(n - 1, j, 4);
solve();
solve();
solve();
solve();
printf("%d\n", ((int)(ans).size()));
for (auto v : ans)
for (int i = 0; i < 6; ++i) printf("%d%c", v[i], " \n"[i == 5]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) assert(g[i][j] == '0');
assert(((int)(ans).size()) <= n * m);
}
return 0;
}
| 1,500 | CPP |
a = int(input())
yyy="0"
for x in range (a):
b=list(input())
if len (b) <= 10:
yyy="".join(map(str, b))
else:
yyy=b[0]+str((len(b)-2))+b[-1]
print(yyy) | 800 | PYTHON3 |
n = int(input())
is_found = False
for i in range(1, n):
for j in range(1, n):
if (j+i == n):
if (j%2==0) and (i%2==0):
print("YES\n")
is_found = True
break
if is_found == True:
break
if is_found == False:
print("NO\n") | 800 | PYTHON3 |
n,s=map(int,input().split())
if(s>=2*n):
print('YES')
for i in range(n-1):
print(2,end=' ')
s-=2
print(s)
print(1)
else:
print('NO')
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const double pi = acos((double)-1);
const long long MAXN = 10000;
const long long mod = 1e9 + 7;
int ys[300000];
int dj[300000];
int num[300000];
stack<int> S;
int main() {
int n;
string s;
cin >> n >> s;
int sum = 0, sum2 = 0;
int mid = -1;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
sum++;
else
sum--;
if (sum < sum2) {
sum2 = sum;
mid = i;
}
}
if (sum) {
cout << 0 << "\n" << 1 << ' ' << 1 << "\n";
return 0;
}
num[(mid + 1) % n] = 0;
int ans = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0;
int a = 1, b = 1;
for (int i = mid + 1; i < mid + 1 + n; i++) {
if (s[i % n] == '(') {
S.push(i % n);
sum++;
} else {
int x = S.top();
S.pop();
dj[x] = dj[i % n] = sum;
if (sum == 3) tmp3++;
if (sum == 2) {
num[x] = tmp3;
tmp3 = 0;
tmp2++;
}
if (sum == 1) {
num[x] = tmp2;
tmp2 = 0;
tmp1++;
ans++;
}
sum--;
ys[x] = i % n;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == ')') continue;
if (dj[i] == 1) {
if (ans < num[i] + 1) {
ans = num[i] + 1;
a = i + 1, b = ys[i] + 1;
}
} else if (dj[i] == 2) {
if (ans < tmp1 + 1 + num[i]) {
ans = tmp1 + 1 + num[i];
a = i + 1, b = ys[i] + 1;
}
}
}
cout << ans << "\n" << a << ' ' << b << "\n";
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int INF = 1e6;
int main() {
int n, k, nc;
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (d > f) {
int w = a + (b * (b + 1)) / 2 - (d * (d - 1)) / 2;
w -= c;
w = max(w, 0);
w = w + (d * (d - 1)) / 2 - (f * (f - 1)) / 2;
w -= e;
w = max(w, 0);
w += (f * (f - 1)) / 2;
cout << w << endl;
} else {
int w = a + (b * (b + 1)) / 2 - (f * (f - 1)) / 2;
w -= e;
w = max(w, 0);
w = w - (d * (d - 1)) / 2 + (f * (f - 1)) / 2;
w -= c;
w = max(w, 0);
w += (d * (d - 1)) / 2;
cout << w << endl;
}
}
| 800 | CPP |
m=list(map(int,input().split('+')))
m.sort()
for i in range(len(m)):
print(m[i],end="")
if i <len(m)-1:
print('+',end="")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int i, j, n, m, w, tim, x, y, num, nn, ma, ans, an, remain, pp;
int q[200007][4], s[2007], ts[2007], tq[200007][4], l[200000][3];
int d[2007], t[2007], p[2007], df[2007], lo[2007], sum[2007], pl[2007];
void inse(int x, int y) {
num++;
q[num][1] = y;
q[num][2] = s[x];
s[x] = num;
num++;
q[num][1] = x;
q[num][2] = s[y];
s[y] = num;
};
void inse1(int x, int y) {
num++;
tq[num][1] = y;
tq[num][2] = ts[x];
ts[x] = num;
num++;
tq[num][1] = x;
tq[num][2] = ts[y];
ts[y] = num;
};
void dfs(int x, int y) {
int k = s[x];
d[x] = 1;
tim++;
df[x] = tim;
lo[x] = tim;
int z = 0;
while (k != 0) {
if (q[k][1] != y) {
if (!d[q[k][1]]) {
dfs(q[k][1], x);
lo[x] = min(lo[x], lo[q[k][1]]);
z++;
if (lo[q[k][1]] >= df[q[k][1]]) q[k][0] = 1;
} else
lo[x] = min(lo[x], df[q[k][1]]);
}
k = q[k][2];
}
};
void don(int x, int y) {
int k = s[x];
d[x] = 1;
p[x] = y;
while (k != 0) {
if (!d[q[k][1]])
if (q[k][0])
ma++, don(q[k][1], ma);
else
don(q[k][1], y);
k = q[k][2];
}
};
void tko(int x, int f) {
int k = ts[x];
d[x] = 1;
int ok = 0;
while (k != 0) {
if (tq[k][1] != f) {
ok++;
tko(tq[k][1], x);
sum[x] += sum[tq[k][1]];
}
k = tq[k][2];
}
if (ok > 0) sum[x]++;
if ((ok == 1) && (f == 0)) pl[x] = 1;
};
void goo(int x, int f) {
int k = ts[x];
d[x] = 1;
int min1 = 0;
int min2 = 0;
while (k != 0) {
if (tq[k][1] != f) {
goo(tq[k][1], x);
if (sum[tq[k][1]] - t[tq[k][1]] > min1) {
min2 = min1;
min1 = sum[tq[k][1]] - t[tq[k][1]];
} else if (sum[tq[k][1]] - t[tq[k][1]] > min2)
min2 = sum[tq[k][1]] - t[tq[k][1]];
}
k = tq[k][2];
}
t[x] = sum[x] - 1;
if (t[x] < 0) t[x] = 0;
t[x] = t[x] - min1;
int w;
w = remain - 1;
if (f != 0) w = w - pp;
if (w < 0) w = 0;
w = w - min1 - min2;
if (w < an) an = w;
};
int main() {
cin >> n >> m;
for (i = 1; i <= m; i++) {
scanf("%d %d", &x, &y);
inse(x, y);
l[i][1] = x;
l[i][2] = y;
}
for (i = 1; i <= n; i++) {
if (!d[i]) {
dfs(i, 0);
}
}
memset(d, 0, sizeof(d));
ma = 0;
for (i = 1; i <= n; i++)
if (!d[i]) {
ma++;
don(i, ma);
}
num = 0;
ans = n - ma;
for (i = 1; i <= m; i++) {
x = p[l[i][1]];
y = p[l[i][2]];
if (x != y) {
inse1(x, y);
}
}
memset(d, 0, sizeof(d));
for (i = 1; i <= ma; i++) {
if (d[i] == 0) tko(i, 0);
}
memset(d, 0, sizeof(d));
for (i = 1; i <= ma; i++) {
if (d[i] == 0)
remain = sum[i], pp = pl[i], an = 2000, goo(i, 0), ans += an + 1;
}
ans--;
cout << ans;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, mp = INT_MAX, nk = 0, h = 0, y = 0, sum = 0, k = INT_MIN, in = 0;
int count = 0;
set<int> s;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
s.insert(a[i]);
sum = sum + a[i];
if (a[i] > k) {
k = a[i];
nk = i;
}
}
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
count++;
}
}
if (s.size() == 1) {
cout << "Exemplary pages.";
return 0;
}
if (count >= 2) {
cout << "Unrecoverable configuration.";
return 0;
}
for (int i = 0; i < n; i++) {
if (a[i] < mp) {
mp = a[i];
in = i;
}
}
if (sum % n != 0) {
cout << "Unrecoverable configuration.";
return 0;
} else {
int y = sum / n;
int m = *max_element(a, a + n);
int mi = *min_element(a, a + n);
h = m - y;
}
cout << h;
cout << " ";
cout << "ml. from cup";
cout << " ";
cout << "#";
cout << in + 1;
cout << " ";
cout << "to cup #";
cout << nk + 1;
cout << ".";
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long g, x, z, t, q, w, re = 1e18, x1, x2;
scanf("%I64d %I64d %I64d", &t, &q, &w);
x = q * w;
if (x >= 6 * t)
printf("%I64d\n%I64d %I64d\n", x, q, w);
else {
for (g = min(q, w); g * g <= 6 * t; g++) {
if (6 * t % g == 0 && (6 * t) / g >= (max(q, w) == w ? w : q)) {
re = 6 * t;
x1 = g, x2 = (6 * t) / g;
break;
} else {
z = (6 * t + g - 1) / g;
if (z * g < re && z >= (max(q, w) == w ? w : q)) {
re = z * g;
x1 = g, x2 = z;
}
}
}
printf("%I64d\n%I64d %I64d\n", re, (min(q, w) == q) ? x1 : x2,
(max(q, w) == w) ? x2 : x1);
}
return 0;
}
| 2,000 | CPP |
from sys import stdin,stdout
# Testing https://codeforces.com/contest/659/submission/54795830
n,m=stdin.readline().strip().split(' ')
n,m=int(n),int(m)
adj_li=[[] for i in range(n+1)]
for i in range(m):
u,v=stdin.readline().strip().split(' ');u,v=int(u),int(v)
adj_li[u].append(v);adj_li[v].append(u)
visited=[False for i in range(n+1)]
ans=0;
for i in range(1,n+1):
if not visited[i]:
flag=True
q=[(i,-1)];visited[i]=True
for curr,par in q:
for i in adj_li[curr]:
if i!=par:
if not visited[i]:
q.append((i,curr));
visited[i]=True;
#adj[i].remove(curr)
else:
#print("flag false",curr,i)
flag=False
if flag:
ans+=1
stdout.write(str(ans)) | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
double ans = 0, tmp = 0, now = 0;
scanf("%d", &n);
while (n--) {
scanf("%lf", &tmp);
now *= tmp;
ans += 2 * now + tmp;
now += tmp;
}
printf("%.10f\n", ans);
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
while (cin >> t) {
while (t--) {
int n, t1 = 0;
cin >> n;
string s;
char s1[5005];
cin >> s;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += s[i] - '0';
}
if (sum == 0) {
cout << -1 << endl;
continue;
}
bool flag = true;
for (int i = n - 1; i >= 0; i--) {
if ((s[i] - '0') % 2) {
n = i + 1;
break;
}
sum -= s[i] - '0';
}
if (sum == 0) {
cout << -1 << endl;
continue;
}
if (sum % 2 == 0) {
for (int i = 0; i < n; i++) cout << s[i];
cout << endl;
continue;
}
for (int i = 0; i < n - 1; i++) {
if (flag && (s[i] - '0') % 2) {
flag = !flag;
continue;
}
s1[t1++] = s[i];
}
s1[t1++] = s[n - 1];
if (flag) {
cout << -1 << endl;
continue;
}
flag = false;
for (int i = 0; i < t1; i++) {
if (!flag && s1[i] == '0') continue;
flag = true;
cout << s1[i];
}
if (!flag) {
cout << -1 << endl;
continue;
}
cout << endl;
}
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isUpperCase(char c) { return c >= 'A' && c <= 'Z'; }
bool isLowerCase(char c) { return c >= 'a' && c <= 'z'; }
bool isLetter(char c) { return c >= 'A' && c <= 'Z' || c >= 'a' && c <= 'z'; }
bool isDigit(char c) { return c >= '0' && c <= '9'; }
char toLowerCase(char c) { return (isUpperCase(c)) ? (c + 32) : c; }
char toUpperCase(char c) { return (isLowerCase(c)) ? (c - 32) : c; }
template <class T>
inline T MAX(T a, T b) {
return a > b ? a : b;
}
template <class T>
inline T MIN(T a, T b) {
return a < b ? a : b;
}
template <class T>
inline void SWAP(T &a, T &b) {
a = a ^ b;
b = a ^ b;
a = a ^ b;
}
template <class T, class T1>
inline void Reverse(T1 A[], T i, T j) {
for (; i < j; i++, j--) SWAP(A[i], A[j]);
}
template <class T>
inline T fAbs(T a) {
return a < 0 ? a * (-1) : a;
}
template <class T>
inline T GCD(T a, T b) {
if (a < 0) return GCD(-a, b);
if (b < 0) return GCD(a, -b);
while (b) {
b ^= a ^= b ^= a %= b;
}
return a;
}
template <class T>
inline T LCM(T a, T b) {
return a / GCD(a, b) * b;
}
int main() {
string s[2], t;
int n, l, a = 0, b = 0;
cin >> n;
cin >> s[0];
a++;
for (l = 1; l < n; l++) {
cin >> t;
if (s[0] == t)
a++;
else {
s[1] = t;
b++;
}
}
if (a > b)
cout << s[0];
else
cout << s[1];
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
int main() {
int n, i, x, k, j = 0;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
for (x = 0; x < n; x++) {
if (i == j && x == j) {
printf("%d ", k);
} else
printf("0 ");
}
j++;
printf("\n");
}
}
| 800 | CPP |
V = ['a', 'A', 'e', 'E', 'i', 'I', 'o', 'O', 'u', 'U', 'y', 'Y']
C = ['b', 'B', 'c', 'C', 'd', 'D', 'f', 'F', 'g', 'G',
'h', 'H', 'j', 'J', 'k', 'K', 'l', 'L', 'm', 'M',
'n', 'N', 'p', 'P', 'q', 'Q', 'r', 'R', 's', 'S',
't', 'T', 'v', 'V', 'w', 'W', 'x', 'X', 'z', 'Z']
s = [x for x in input() if x.isalpha()]
if s[-1] in V: print('YES')
elif s[-1] in C: print('NO') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int arr[4];
double mean, med, rang;
scanf("%d", &n);
if (n == 0) {
cout << "YES" << endl;
cout << "1\n1\n3\n3\n";
}
if (n == 4) {
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
sort(arr, arr + n);
mean = (double)(arr[0] + arr[1] + arr[2] + arr[3]) / 4;
med = (double)(arr[1] + arr[2]) / 2;
rang = arr[3] - arr[0];
if (mean == med && rang == med)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
if (n == 3) {
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
for (int k = 1; k <= 1000000; k++) {
int temp[4];
temp[0] = arr[0];
temp[1] = arr[1];
temp[2] = arr[2];
temp[3] = k;
sort(temp, temp + 4);
mean = (double)(temp[0] + temp[1] + temp[2] + temp[3]) / 4;
med = (double)(temp[1] + temp[2]) / 2;
rang = temp[3] - temp[0];
if (mean == med && rang == med) {
cout << "YES" << endl;
cout << k << endl;
return 0;
}
}
cout << "NO" << endl;
}
if (n == 1) {
scanf("%d", &a);
cout << "YES" << endl;
cout << a << endl << 3 * a << endl << 3 * a << endl;
}
if (n == 2) {
cin >> a >> b;
int x = min(a, b), y = max(a, b);
if (y > 3 * x)
cout << "NO" << endl;
else {
cout << "YES" << endl;
cout << 3 * x << endl;
cout << 4 * x - y << endl;
}
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
vector<int> p(m), c(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> c[i];
}
sort(x.begin(), x.end());
vector<pair<int, int>> P(m);
for (int i = 0; i < m; i++) {
P[i] = make_pair(p[i], c[i]);
}
sort(P.begin(), P.end());
for (int i = 0; i < m; i++) {
p[i] = P[i].first;
c[i] = P[i].second;
}
int sum = 0;
for (int i = 0; i < m; i++) {
sum += c[i];
}
if (sum < n) {
cout << -1 << endl;
} else {
vector<long long> dp(n + 1, INF);
dp[0] = 0;
for (int i = 0; i < m; i++) {
vector<long long> d(n);
for (int j = 0; j < n; j++) {
d[j] = abs(x[j] - p[i]);
}
vector<long long> S(n + 1);
S[0] = 0;
for (int j = 0; j < n; j++) {
S[j + 1] = S[j] + d[j];
}
vector<long long> a(n + 1);
for (int j = 0; j <= n; j++) {
a[j] = dp[j] - S[j];
}
deque<int> dq;
for (int j = 0; j <= n; j++) {
while (!dq.empty()) {
if (a[dq.back()] >= a[j]) {
dq.pop_back();
} else {
break;
}
}
dq.push_back(j);
dp[j] = a[dq.front()] + S[j];
if (dq.front() == j - c[i]) {
dq.pop_front();
}
}
}
cout << dp[n] << endl;
}
}
| 2,600 | CPP |
n=input()
if n.find("1111111")!=-1 or n.find("0000000")!=-1:
print("YES")
else:
print("NO")
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, lef[3000], rig[3000], last, ans;
char dom[3000];
scanf("%d", &n);
last = -1;
for (i = 0; i < n; ++i) {
scanf(" %c", &dom[i]);
if (dom[i] == 'L') {
last = -1;
} else if (dom[i] == 'R') {
last = i;
}
lef[i] = last;
}
last = -1;
for (i = n - 1; i > -1; --i) {
if (dom[i] == 'R') {
last = -1;
} else if (dom[i] == 'L') {
last = i;
}
rig[i] = last;
}
ans = 0;
for (i = 0; i < n; ++i) {
if ((lef[i] != -1 && rig[i] != -1 && i - lef[i] == rig[i] - i) ||
(lef[i] == -1 && rig[i] == -1)) {
++ans;
}
}
printf("%d\n", ans);
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int n, h[maxn], ecnt, deg[maxn];
struct enode {
int v, n;
enode() {}
enode(int _v, int _n) : v(_v), n(_n) {}
} e[maxn << 1];
inline void addedge(int u, int v) {
ecnt++;
e[ecnt] = enode(v, h[u]);
h[u] = ecnt;
}
int sz[maxn];
void dfs1(int u, int fa) {
sz[u] = 1;
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (v == fa) continue;
dfs1(v, u);
sz[u] += sz[v];
}
}
int flag, Ans = -1, val[maxn], res;
void dfs3(int u, int fa, int depth) {
if (val[depth] == -1)
val[depth] = deg[u];
else if (val[depth] != deg[u])
res = 0;
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (v == fa) continue;
dfs3(v, u, depth + 1);
}
}
inline void check(int u) {
if (flag) return;
flag = 1;
res = 1;
memset(val, -1, sizeof(val));
dfs3(u, 0, 1);
if (res)
Ans = u;
else
Ans = -1;
}
int rt, mn_rt;
void dfs2(int u, int fa) {
int tmp = n - sz[u];
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (v == fa) continue;
dfs2(v, u);
tmp = max(tmp, sz[v]);
}
if (tmp < mn_rt) rt = u, mn_rt = tmp;
}
int d[maxn], q[maxn << 1], inq[maxn], Mn1 = -1, dep[maxn];
void ddfs(int u, int fa) {
dep[u] = dep[fa] + 1;
if (deg[u] == 1) {
if (Mn1 == -1 || dep[Mn1] > dep[u]) Mn1 = u;
}
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (v == fa) continue;
ddfs(v, u);
}
}
inline void work1() {
int head = 1, tail = 0;
memset(inq, 0, sizeof(inq));
for (int i = 1; i <= n; i++) {
d[i] = deg[i];
if (d[i] == 1) q[++tail] = i, inq[i] = 1;
}
while (head <= tail) {
int u = q[head];
head++;
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (d[v] > 1) d[v]--;
if (d[v] == 1 && !inq[v]) q[++tail] = v, inq[v] = 1;
}
}
int u = q[tail];
ddfs(u, 0);
res = 1;
memset(val, -1, sizeof(val));
dfs3(Mn1, 0, 1);
if (res) Ans = Mn1;
}
int Mx2 = 1;
void dddfs(int u, int fa) {
dep[u] = dep[fa] + 1;
if (dep[u] > dep[Mx2]) Mx2 = u;
for (int i = h[u]; ~i; i = e[i].n) {
int v = e[i].v;
if (v == fa) continue;
dddfs(v, u);
}
}
inline void work2() {
int L, R;
dddfs(1, 0);
L = Mx2;
dddfs(Mx2, 0);
R = Mx2;
res = 1;
memset(val, -1, sizeof(val));
dfs3(L, 0, 1);
if (res) Ans = L;
res = 1;
memset(val, -1, sizeof(val));
dfs3(R, 0, 1);
if (res) Ans = R;
}
int main() {
scanf("%d", &n);
ecnt = 0;
memset(h, -1, sizeof(h));
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
deg[u]++;
deg[v]++;
addedge(u, v);
addedge(v, u);
}
dfs1(1, 0);
rt = -1, mn_rt = n + 1;
dfs2(1, 0);
res = 1;
memset(val, -1, sizeof(val));
dfs3(rt, 0, 1);
if (res) Ans = rt;
if (Ans == -1) work1();
if (Ans == -1) work2();
printf("%d\n", Ans);
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, d, S;
vector<pair<int, int> > La, Lb, Lc;
vector<int> tmp;
long long sum[100000 + 5];
pair<int, int> solve(long long cnt, int ans1, int ans2) {
if (cnt >= Lb.size())
ans1 += Lb.size();
else {
ans1 += cnt;
int ll = 0, rr = Lb.size() - cnt;
while (ll < rr) {
int mid = (ll + rr + 1) / 2;
if (sum[mid] + ans2 <= S)
ll = mid;
else
rr = mid - 1;
}
ans1 += ll;
ans2 += sum[ll];
}
return pair<int, int>(ans1, ans2);
}
int main() {
scanf("%d %d %d", &n, &d, &S);
for (int i = 0, a, b, c; i < n; i++) {
scanf("%d %d %d", &a, &b, &c);
if (c >= d) {
if (a > 0)
La.push_back(pair<int, int>(b, a));
else
Lb.push_back(pair<int, int>(b, a));
tmp.push_back(b);
} else
Lc.push_back(pair<int, int>(a, b));
}
sort(tmp.begin(), tmp.end());
int tmp1 = 0, tmp2 = 0;
for (int i = 0; i < tmp.size() && tmp2 + tmp[i] <= S; i++) {
tmp1++;
tmp2 += tmp[i];
}
sort(La.begin(), La.end());
sort(Lb.begin(), Lb.end());
for (int k = 0; k < int(Lb.size()); k++) sum[k + 1] = sum[k] + Lb[k].first;
int ans1 = tmp1, ans2 = tmp2;
long long SUM = 0;
for (int k = 0; k < int(La.size()); k++) SUM += La[k].second - 1;
long long cv1 = 0, cv2 = 0, cv3 = 0;
for (int k = 0; k < int(Lc.size()); k++) {
if (Lc[k].first > 0) {
cv1++;
cv2 += Lc[k].first - 1;
} else {
cv3++;
}
}
long long tv2 = 0;
for (int k = 0; k < int(La.size()) && tv2 + La[k].first <= S; k++) {
tv2 += La[k].first;
SUM++;
long long cnt = SUM + cv2, cc = La.size() + cv1;
if (cnt >= cv3) {
cc += cv3;
cnt -= cv3;
} else {
cc += cnt;
cnt = 0;
}
pair<int, int> ans = solve(cnt, cc, tv2);
if (ans.first > ans1 || (ans.first == ans1 && ans.second < ans2)) {
ans1 = ans.first;
ans2 = ans.second;
}
}
printf("%d %d\n", ans1, ans2);
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int solve(vector<vector<char>> mat, int n, int m, string dir,
pair<int, int> s) {
string name = "DLRU";
int count = 0;
int len = dir.length();
map<char, char> mp;
while (true) {
mp['0'] = name[0];
mp['1'] = name[1];
mp['2'] = name[2];
mp['3'] = name[3];
int parse = 0;
int i = s.first;
int j = s.second;
while (true) {
if (parse == len) break;
char ch = mp[dir[parse++]];
if (ch == 'L') {
j = j - 1;
if (j < 0) break;
} else if (ch == 'R') {
j = j + 1;
if (j >= m) break;
} else if (ch == 'U') {
i = i - 1;
if (i < 0) break;
} else {
i = i + 1;
if (i >= n) break;
}
if (mat[i][j] == 'E') {
count++;
break;
}
if (mat[i][j] == '#') break;
}
if (!next_permutation(name.begin(), name.end())) break;
}
return count;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<char>> mat(n, vector<char>(m));
string name, dir;
pair<int, int> s;
for (int i = 0; i < n; i++) {
cin >> name;
for (int j = 0; j < m; j++) {
if (name[j] == 'S') {
s = make_pair(i, j);
}
mat[i][j] = name[j];
}
}
cin >> dir;
cout << solve(mat, n, m, dir, s) << endl;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7, inf = 0x3f3f3f3f, mod = 1e9 + 7;
bool notprime[maxn];
int mu[maxn], prime[maxn], cnt;
int dp[maxn];
vector<int> fac[maxn];
void getprime() {
notprime[0] = notprime[1] = 1;
mu[1] = 1;
for (int i = 2; i < maxn; ++i) {
if (!notprime[i]) prime[cnt++] = i, mu[i] = -1;
for (int j = 0; j < cnt && 1ll * prime[j] * i < maxn; ++j) {
notprime[prime[j] * i] = 1;
if (i % prime[j] == 0) {
mu[prime[j] * i] = 0;
break;
}
mu[prime[j] * i] = -mu[i];
}
}
for (int i = 2; i <= 100000; ++i) {
for (int j = 1; j * j <= i; ++j) {
if (i % j == 0) {
fac[i].push_back(j);
if (i / j != j) fac[i].push_back(i / j);
}
}
}
}
long long quick(long long x, long long n) {
long long res = 1;
while (n) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
getprime();
int m;
cin >> m;
dp[1] = 0;
for (int i = 2; i <= m; ++i) {
dp[i] = m;
for (auto &y : fac[i]) {
if (y == i) continue;
long long cnt = 0;
for (auto &d : fac[i / y])
cnt = (cnt + 1ll * mu[d] * (m / (y * d)) % mod) % mod;
dp[i] = (dp[i] + dp[y] * cnt % mod) % mod;
}
dp[i] = dp[i] * quick(m - m / i, mod - 2) % mod;
}
long long ans = 0;
for (int i = 1; i <= m; ++i) ans = (ans + dp[i]) % mod;
ans = ans * quick(m, mod - 2) % mod;
ans = (ans + 1) % mod;
cout << ans << '\n';
return 0;
}
| 2,300 | CPP |
s = ''
n = int(input())
for i in range(n):
n = input()
if len(n) <= 10:
s = s + n + '\n'
else:
s = s + n[0] + str(len(n)-2) + n[len(n)-1] + '\n'
print(s) | 800 | PYTHON3 |
"""https://codeforces.com/contest/1038/problem/A"""
import math
n,k = tuple(map(int, input().split()))
s = input()
mapp={'A':0,'B':1,'C':2,'D':3,'E':4,'F':5,'G':6,'H':7,'I':8,'J':9,'K':10,'L':11,'M':12,'N':13,'O':14,
'P':15,'Q':16,'R':17,'S':18,'T':19,'U':20,'V':21,'W':22,'X':23,'Y':24,'Z':25}
A = [0]*k
for a in s:
i = mapp[a]
if i < k:
A[i]+=1
print(min(A)*k) | 800 | PYTHON3 |
import math
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
s=input()
pre=[]
for i in range(n):
if(s[i]=="1"):
pre.append(i)
if(pre==[]):
print(math.ceil(n/(k+1)))
else:
count=0
for i in range(len(pre)-1):
tem=max(0,(pre[i+1]-pre[i]-k-1)//(k+1))
count+=tem
first=pre[0]
count+=max(0,(first)//(k+1))
last=n-pre[-1]
count+=max(0,(last-1)//(k+1))
print(count)
| 1,300 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define For(i,x,y) for(ll i = (x);i <= (y);++i)
#define FOr(i,x,y) for(ll i = (x);i >= (y);--i)
#define rep(i,x,y) for(ll i = (x);i < (y);++i)
#define fi first
#define se second
#define pa pair<ll,ll>
#define mk make_pair
#define pb push_back
#define clr(a,b) memset(a,b,sizeof(a))
#define cpy(a,b) memcpy(a,b,sizeof(b))
#define y1 y11111111111111111111
#define debug puts("@@@@@@@@@@@@@@@@@@@@")
inline ll read(){
ll x = 0,f = 1;char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')f = -1;ch = getchar();}
while(ch >= '0' && ch <= '9'){x = x*10+ch-'0';ch = getchar();}
return x*f;
}
const ll N=5000100;
vector<pa>mp[N];
vector<ll>sum[N];
ll pos[N],a[N],n,ans=-1,a1,a2,a3,a4;
int main(){
n=read();
For(i,1,n)a[i]=read(),sum[a[i]].pb(i);
n=0;
For(i,1,2500000)if (sum[i].size()>=4){
puts("YES");
cout<<sum[i][0]<<' '<<sum[i][1]<<' '<<sum[i][2]<<' '<<sum[i][3]<<endl;
return 0;
}else if (sum[i].size()>=2){
if (!a1)a1=sum[i][0],a2=sum[i][1];
else{
puts("YES");
cout<<a1<<' '<<sum[i][0]<<' '<<a2<<' '<<sum[i][1]<<endl;
return 0;
}
a[++n]=i;
pos[n]=sum[i][0];
a[++n]=i;
pos[n]=sum[i][1];
}else if (sum[i].size()>=1)a[++n]=i,pos[n]=sum[i][0];
For(i,1,n)For(j,i+1,n){
ll x=a[i]+a[j];
rep(k,0,mp[x].size()){
if ((mp[x][k].fi!=i)&&(mp[x][k].se!=i)&&(mp[x][k].fi!=j)&&(mp[x][k].se!=j)){
puts("YES");
cout<<pos[mp[x][k].fi]<<' '<<pos[mp[x][k].se]<<' '<<pos[i]<<' '<<pos[j]<<endl;
return 0;
}
}
mp[x].pb(mk(i,j));
}
puts("NO");
} | 1,800 | CPP |
nxt= []
last = []
rt = []
def dsu(n):
for i in range(0,n+1):
rt.append(-1)
last.append(i)
nxt.append(-1)
def root(x):
if(rt[x]<0):
return x
else:
rt[x] = root(rt[x])
return rt[x]
def union(x,y):
x = root(x)
y = root(y)
if(x!=y):
rt[x] = rt[x]+rt[y]
rt[y] = x
nxt[last[x]] = y
last[x] = last[y]
n = int(input())
dsu(n)
for z in range(n-1):
x,y = [int(i) for i in input().split()]
union(x,y)
i = root(1)
while(i!=-1):
print(i,end= " ")
i = nxt[i] | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, q, x, pos[3];
vector<int> graph[100100];
int T[100100], P[100100][20], L[100100];
bool visited[100100];
void dfs(int u, int father, int lvl) {
T[u] = father;
L[u] = lvl;
visited[u] = true;
for (int v : graph[u])
if (!visited[v]) dfs(v, u, lvl + 1);
}
void process(int N) {
for (int i = 0; i < N; i++)
for (int j = 0; 1 << j < N; j++) P[i][j] = -1;
for (int i = 0; i < N; i++) P[i][0] = T[i];
for (int j = 1; 1 << j < N; j++)
for (int i = 0; i < N; i++)
if (P[i][j - 1] != -1) P[i][j] = P[P[i][j - 1]][j - 1];
}
int lca(int p, int q) {
int timp, log;
if (L[p] < L[q]) timp = p, p = q, q = timp;
for (log = 1; 1 << log <= L[p]; log++)
;
log--;
for (int i = log; i >= 0; i--)
if (L[p] - (1 << i) >= L[q]) p = P[p][i];
if (p == q) return p;
for (int i = log; i >= 0; i--)
if (P[p][i] != -1 && P[p][i] != P[q][i]) p = P[p][i], q = P[q][i];
return T[p];
}
int dst(int a, int b) { return L[a] + L[b] - 2 * L[lca(a, b)]; }
int main() {
scanf("%d %d", &n, &q);
for (int i = 2; i <= n; i++) {
scanf("%d", &x);
graph[x].push_back(i);
graph[i].push_back(x);
}
dfs(1, 0, 1);
process(100100);
for (int i = 0; i < q; i++) {
scanf("%d %d %d", &pos[0], &pos[1], &pos[2]);
int ans = 0;
for (int j = 0; j < 3; j++) {
vector<int> lft;
for (int k = 0; k < 3; k++)
if (k != j) lft.push_back(k);
ans = max(ans, (dst(pos[j], pos[lft[0]]) + dst(pos[j], pos[lft[1]]) -
dst(pos[lft[0]], pos[lft[1]])) /
2 +
1);
}
printf("%d\n", ans);
}
return 0;
}
| 1,900 | CPP |
def iseven(n):
if n%2 ==0:
return 1
else:
return 0
n=int(input())
s=list(map(int,input().split()))
for i in range(n):
s[i]=iseven(s[i])
if sum(s)==1:
print(s.index(1)+1)
else:
print(s.index(0)+1) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, resto, i, j;
int grafo[101][101];
cin >> n;
long long comb = 1, comb_ant = 1;
for (i = 4; comb <= n; i++) {
comb_ant = comb;
comb = comb * i / (i - 3);
}
i -= 2;
if (n == 1) i = 3;
resto = n - comb_ant;
for (int k = 0; k < i; k++) {
for (int l = 0; l < i; l++) {
if (k == l)
grafo[k][l] = 0;
else
grafo[k][l] = 1;
}
}
while (resto > 0) {
long long c = 1, c_ant = 1;
for (j = 3; c < resto && j <= i - 1; j++) {
c_ant = c;
c = c * j / (j - 2);
}
j -= 2;
if (c_ant == 1) j = 2;
resto -= c_ant;
for (int k = 0; k < i + 1; k++) {
if (k < j) {
grafo[i][k] = 1;
grafo[k][i] = 1;
} else {
grafo[i][k] = 0;
grafo[k][i] = 0;
}
}
i++;
}
cout << i << endl;
for (int k = 0; k < i; k++) {
for (int l = 0; l < i; l++) {
cout << grafo[k][l];
}
cout << endl;
}
return 0;
}
| 1,600 | CPP |
kl = int(input())
for kkl in range(kl):
str=input()
t=input()
sp=list(str)
sp.sort()
sp.append(1)
i=0
if "a" in sp and "b" in sp and "c" in sp and t=="abc":
while sp[i]=="a":
i+=1
ka=i
while (sp[i]=="c" or sp[i]=="b") and i<len(sp):
i+=1
if i == len(sp):
i+=1
sp1=sp[ka:i]
sp1.reverse()
sp[ka:i]=sp1
for i in range(len(sp)-1):
print(sp[i], end="")
print() | 800 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int maxn = 1e6 + 10;
template <class T>
T mymin(const T a, const T b) {
return a < b ? a : b;
}
template <class T>
T mymax(const T a, const T b) {
return a > b ? a : b;
}
string s;
int cnta, cntb, cntc;
int main() {
ios::sync_with_stdio(false);
cin >> s;
bool visa, visb, visc;
visa = visb = visc = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'a') {
visa = 1;
cnta++;
if (visb || visc) {
cout << "NO" << endl;
exit(0);
}
}
if (s[i] == 'b') {
visb = 1;
cntb++;
if (visc) {
cout << "NO" << endl;
exit(0);
}
}
if (s[i] == 'c') {
visc = 1;
cntc++;
}
}
if (cnta && cntb && (cntc == cnta || cntc == cntb))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
long long a, b, c, d, e, f, g, ans, i;
cin >> a >> b >> c >> d;
ans = a + 2 + b * 2;
ans += (c + 2);
if (a > c) ans += (a - c);
ans += (d * 2);
cout << ans << endl;
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int ma, ima;
vector<vector<int> > g;
vector<int> d, u;
vector<int> p, r;
int find_set(int v) {
if (v == p[v]) return v;
return p[v] = find_set(p[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (r[a] < r[b]) swap(a, b);
p[b] = a;
if (r[a] == r[b])
;
++r[a];
int t = max((d[a] + 1) / 2 + (d[b] + 1) / 2 + 1, d[b]);
d[a] = max(t, d[a]);
}
}
void dfs(int v, int dist) {
u[v] = 1;
if (dist > ma) {
ma = dist;
ima = v;
}
for (int i = 0; i < g[v].size(); ++i)
if (u[g[v][i]] == 0) dfs(g[v][i], dist + 1);
u[v] = 0;
}
int diam(int v) {
ma = 0;
ima = v;
dfs(v, 0);
dfs(ima, 0);
return ma;
}
int main() {
ios_base::sync_with_stdio(false);
scanf("%d %d %d", &n, &m, &q);
g.resize(n);
p.resize(n);
r.assign(n, 0);
d.assign(n, 0);
for (int i = 0; i < n; ++i) p[i] = i;
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d %d", &a, &b);
--a;
--b;
union_sets(a, b);
g[a].push_back(b);
g[b].push_back(a);
}
u.assign(n, 0);
for (int i = 0; i < n; ++i)
if (i == find_set(i)) d[i] = diam(i);
for (int i = 0; i < q; ++i) {
int c;
scanf("%d", &c);
if (c == 1) {
int a;
scanf("%d", &a);
--a;
printf("%d\n", d[find_set(a)]);
} else {
int a, b;
scanf("%d %d", &a, &b);
--a;
--b;
union_sets(a, b);
}
}
return 0;
}
| 2,100 | CPP |
s1 = input()
s2 = input()
cnt = 0
n = min(len(s1), len(s2))
for i in range(n):
if s1[i] != s2[i]:
cnt += 1
if cnt == 2 and set(s1) == set(s2):
print('YES')
else:
print('NO') | 1,100 | PYTHON3 |
n = int(input())
h_road = [0] * (n + 1)
v_road = [0] * (n + 1)
res = ''
for i in range(n ** 2):
h, v = map(int, input().split())
if h_road[h] == 0 and v_road[v] == 0:
h_road[h] = 1
v_road[v] = 1
res += str(i + 1) + ' '
print(res) | 1,000 | PYTHON3 |
z=int(input(""))
x=list()
for i in range(0,z):
a=input("")
x.append(a)
for j in range(0,z):
a=len(x[j])
if a<=10:
print(x[j])
else:
print(x[j][0]+str(a-2)+x[j][a-1])
| 800 | PYTHON3 |
def func():
numBalls = input().split()
[r,g,b,w] = [int(i) for i in numBalls ]
x = 0
if r%2:
x += 1
x *= 2
if g%2:
x += 1
x *= 2
if b%2:
x += 1
x *= 2
if w%2:
x += 1
skelaton = [ 0, 1, 2, 4, 7, 8, 11, 13, 14, 15 ]
if r and g and b:
if x in skelaton:
print ( "Yes" )
else:
print ( "No" )
else:
skelaton_new = [ 0, 1, 2, 4, 8, 14, 15 ]
if x in skelaton_new:
print ( "Yes")
else:
print ( "No" )
numTest = int( input() )
while numTest:
numTest -= 1
func()
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Dancer {
int Coordinate, StopX, StopY;
Dancer() {}
Dancer(int group, int coordinate)
: Coordinate(coordinate),
StopX(group == 1 ? -1 : Width),
StopY(group == 1 ? Height : -1){};
static int Width, Height;
};
int Dancer::Width, Dancer::Height;
struct DancersKit {
int Count;
vector<Dancer *> Vertical, Horizontal, Common;
DancersKit() { Count = 0; }
void Add(int group, Dancer *dancer) {
if (group == 1)
Vertical.push_back(dancer);
else
Horizontal.push_back(dancer);
Common.push_back(dancer);
Count++;
}
void Resolve() {
sort(Horizontal.begin(), Horizontal.end(),
[](Dancer *a, Dancer *b) { return a->Coordinate < b->Coordinate; });
sort(Vertical.begin(), Vertical.end(),
[](Dancer *a, Dancer *b) { return a->Coordinate < b->Coordinate; });
sort(Common.begin(), Common.end(), [](Dancer *a, Dancer *b) {
bool aLess;
if (a->StopX == b->StopX) {
if (a->StopX == -1)
aLess = a->Coordinate > b->Coordinate;
else
aLess = a->Coordinate < b->Coordinate;
} else
aLess = a->StopX == -1;
return aLess;
});
vector<Dancer *>::iterator common = Common.begin();
for (int i = 0; i < Horizontal.size(); i++) {
(*common)->StopX = Dancer::Width;
(*common)->StopY = Horizontal[i]->Coordinate;
common++;
}
for (int i = Vertical.size() - 1; i >= 0; i--) {
(*common)->StopX = Vertical[i]->Coordinate;
(*common)->StopY = Dancer::Height;
common++;
}
}
};
int main() {
int length;
scanf("%d%d%d", &length, &Dancer::Width, &Dancer::Height);
vector<Dancer> dancers(length);
map<int, DancersKit> Signs;
for (int i = 0; i < length; i++) {
int group, coordinate, delay;
scanf("%d%d%d", &group, &coordinate, &delay);
dancers[i] = Dancer(group, coordinate);
Signs[coordinate - delay].Add(group, &(dancers[i]));
}
for (map<int, DancersKit>::iterator kit = Signs.begin(); kit != Signs.end();
kit++)
kit->second.Resolve();
for (int i = 0; i < length; i++)
printf("%d %d\n", dancers[i].StopX, dancers[i].StopY);
return 0;
}
| 1,900 | CPP |
n,m=map(int, input().split())
b='#'*m
r='.'*(m-1)+'#'
l='#'+'.'*(m-1)
sw = 0
for i in range(n):
if i % 2 == 0:
print(b)
else:
if not sw:
print(r)
sw = 1
else:
print(l)
sw = 0
| 800 | PYTHON3 |
n=int(input())
L=list(map(int,input().split()))
L1=list(map(int,input().split()))
s=L[1:]+L1[1:]
lon=len(set(s))
print(["I become the guy.","Oh, my keyboard!"][lon!=n])
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxi = ~0U >> 1;
const int mn = 100010;
int n, m, tot;
vector<pair<int, int> > mp[mn];
int dp[mn][3];
int vis[mn];
void dpp(int x) {
vis[x] = 1;
int max1 = 0, max2 = 0;
for (int i = 0; i < mp[x].size(); i++) {
int j = mp[x][i].first;
int tp = mp[x][i].second;
if (vis[j])
continue;
else
dpp(j);
int m0 = tp + dp[j][0];
dp[x][0] += m0;
max1 = max(max1, m0 - (dp[j][1] + (1 - tp)));
max2 = max(max2, max(m0 - (dp[j][2] + tp), m0 - dp[j][1]));
}
dp[x][1] = dp[x][0] - max1;
dp[x][2] = dp[x][0] - max2;
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
mp[x].push_back(pair<int, int>(y, 0));
mp[y].push_back(pair<int, int>(x, 1));
}
tot = maxi;
for (int i = 1; i <= n; i++) {
memset(vis, 0, sizeof(vis));
memset(dp, 0, sizeof(dp));
dpp(i);
tot = min(tot, min(dp[i][0], min(dp[i][1], dp[i][2])));
}
printf("%d\n", tot);
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
int main() {
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
cin.tie(0);
long long int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
int m = n / 2;
if (v[m] == s) {
cout << 0 << endl;
return 0;
}
long long int ans = 0;
if (v[m] > s) {
int start = 0;
while (start <= m && s > v[start]) {
start++;
};
for (int i = start; i <= m; i++) {
ans += v[i] - s;
}
} else {
int end = n - 1;
while (end >= m && s < v[end]) {
end--;
};
for (int i = end; i >= m; i--) {
ans += s - v[i];
}
}
cout << ans << endl;
}
| 1,300 | CPP |
import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
ORDA = 97
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
if n < 2: return list()
prime = [True for _ in range(n + 1)]
p = 3
while p * p <= n:
if prime[p]:
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 2
r = [2]
for p in range(3, n + 1, 2):
if prime[p]:
r.append(p)
return r
def divs(n, start=1):
r = []
for i in range(start, int(math.sqrt(n) + 1)):
if (n % i == 0):
if (n / i == i):
r.append(i)
else:
r.extend([i, n // i])
return r
def divn(n, primes):
divs_number = 1
for i in primes:
if n == 1:
return divs_number
t = 1
while n % i == 0:
t += 1
n //= i
divs_number *= t
def prime(n):
if n == 2: return True
if n % 2 == 0 or n <= 1: return False
sqr = int(math.sqrt(n)) + 1
for d in range(3, sqr, 2):
if n % d == 0: return False
return True
def convn(number, base):
newnumber = 0
while number > 0:
newnumber += number % base
number //= base
return newnumber
def cdiv(n, k): return n // k + (n % k != 0)
for _ in range(ii()):
n = ii()
a = li()
a.sort(reverse=True)
print(*a)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
long long dotproduct(vector<long long>& a, vector<long long>& b) {
long long sum = 0;
for (long long i = 0; i < a.size(); i += 1) {
sum += a[i] * b[i];
}
return sum;
}
int main() {
fast();
long long px, py, pz;
long long x, y, z;
cin >> px >> py >> pz >> x >> y >> z;
px *= 2;
py *= 2;
pz *= 2;
x *= 2;
y *= 2;
z *= 2;
long long a1, a2, a3, a4, a5, a6;
cin >> a1 >> a2 >> a3 >> a4 >> a5 >> a6;
long long res = 0;
vector<long long> zoxnv = {0, -1, 0};
vector<long long> zox2nv = {0, 1, 0};
vector<long long> xoynv = {0, 0, -1};
vector<long long> xoy2nv = {0, 0, 1};
vector<long long> yoznv = {-1, 0, 0};
vector<long long> yoz2nv = {1, 0, 0};
vector<long long> seezox = {px - (x / 2), py, pz - (z / 2)};
if (dotproduct(seezox, zoxnv) > 0) {
res += a1;
}
vector<long long> seezox2 = {px - (x / 2), py - y, pz - (z / 2)};
if (dotproduct(seezox2, zox2nv) > 0) {
res += a2;
}
vector<long long> seexoy = {px - (x / 2), py - (y / 2), pz};
if (dotproduct(seexoy, xoynv) > 0) {
res += a3;
}
vector<long long> seexoy2 = {px - (x / 2), py - (y / 2), pz - z};
if (dotproduct(seexoy2, xoy2nv) > 0) {
res += a4;
}
vector<long long> seeyoz = {px, py - (y / 2), pz - (z / 2)};
if (dotproduct(seeyoz, yoznv) > 0) {
res += a5;
}
vector<long long> seeyoz2 = {px - x, py - (y / 2), pz - (z / 2)};
if (dotproduct(seeyoz2, yoz2nv) > 0) {
res += a6;
}
cout << res;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100001;
const int MAXNODE = MAXN << 2;
const int MOD = 1000000007;
int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; }
int mul(int a, int b) {
return !b || a < MOD / b ? a * b : (long long)a * b % MOD;
}
int C[6][6], matrix[6][6], accsum[6][MAXN];
void init() {
for (int i = 0; i < 6; i++) {
C[i][0] = C[i][i] = 1;
for (int j = 1; j < i; j++) {
C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
}
}
for (int i = 1; i < 6; i++) {
for (int j = 0; j < i; j++) {
for (int k = 0; k <= j; k++) {
matrix[i][i - 1 - k] = add(matrix[i][i - 1 - k], C[j][k]);
}
}
}
for (int j = 1; j < MAXN; j++) {
accsum[0][j] = 1;
}
for (int i = 1; i < 6; i++) {
for (int j = 1; j < MAXN; j++) {
accsum[i][j] = mul(accsum[i - 1][j], j);
}
}
for (int i = 0; i < 6; i++) {
for (int j = 1; j < MAXN; j++) {
accsum[i][j] = add(accsum[i][j], accsum[i][j - 1]);
}
}
}
class Segment {
public:
int size, value, sum[6];
bool tag;
Segment() {
size = value = 0;
tag = false;
for (int i = 0; i < 6; i++) {
sum[i] = 0;
}
}
Segment(int size, int value, bool tag) : size(size), value(value), tag(tag) {
for (int i = 0; i < 6; i++) {
sum[i] = tag ? mul(value, accsum[i][size]) : 0;
}
}
Segment operator+(const Segment &rhs) const {
Segment res = Segment(size + rhs.size, 0, false);
for (int i = 0; i < 6; i++) {
res.sum[i] = add(sum[i], rhs.sum[i]);
int l = 1;
for (int j = i - 1; j >= 0; j--) {
l = mul(l, size);
res.sum[i] = add(res.sum[i], mul(rhs.sum[j], mul(matrix[i][j], l)));
}
}
return res;
}
};
int a[MAXN];
class SegTree {
public:
int n;
Segment seg[MAXNODE];
static int LEFT(int idx) { return idx << 1; }
static int RIGHT(int idx) { return (idx << 1) | 1; }
void _build(int idx, int lower, int upper) {
if (lower == upper) {
seg[idx] = Segment(1, a[lower], true);
return;
}
int middle = (lower + upper) >> 1;
_build(LEFT(idx), lower, middle);
_build(RIGHT(idx), middle + 1, upper);
seg[idx] = seg[LEFT(idx)] + seg[RIGHT(idx)];
}
void init(int n) {
this->n = n;
_build(1, 0, n - 1);
}
void pushDown(int idx) {
if (seg[idx].tag) {
seg[LEFT(idx)] = Segment(seg[LEFT(idx)].size, seg[idx].value, true);
seg[RIGHT(idx)] = Segment(seg[RIGHT(idx)].size, seg[idx].value, true);
seg[idx].tag = false;
}
}
int l, r, v;
void _modify(int idx, int lower, int upper) {
if (r < lower || upper < l) {
return;
}
if (l <= lower && upper <= r) {
seg[idx] = Segment(upper - lower + 1, v, true);
return;
}
pushDown(idx);
int middle = (lower + upper) >> 1;
_modify(LEFT(idx), lower, middle);
_modify(RIGHT(idx), middle + 1, upper);
seg[idx] = seg[LEFT(idx)] + seg[RIGHT(idx)];
}
void modify(int l, int r, int value) {
this->l = l;
this->r = r;
this->v = value;
_modify(1, 0, n - 1);
}
Segment _calc(int idx, int lower, int upper) {
if (r < lower || upper < l) {
return Segment();
}
if (l <= lower && upper <= r) {
return seg[idx];
}
pushDown(idx);
int middle = (lower + upper) >> 1;
return _calc(LEFT(idx), lower, middle) +
_calc(RIGHT(idx), middle + 1, upper);
}
Segment calc(int l, int r) {
this->l = l;
this->r = r;
return _calc(1, 0, n - 1);
}
};
int n, m;
SegTree st;
int main() {
init();
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
st.init(n);
for (int i = 0; i < m; i++) {
char op[4];
int l, r, x;
scanf("%s%d%d%d", op, &l, &r, &x);
if (op[0] == '?') {
Segment sg = st.calc(l - 1, r - 1);
printf("%d\n", sg.sum[x]);
} else {
st.modify(l - 1, r - 1, x);
}
}
return 0;
}
| 2,500 | CPP |
#include<bits/stdc++.h>
using namespace std;
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const double Pi = acos(-1);
namespace io{
template <typename T> inline void read(T &x) {
x = 0; T f = 1;char s = getchar();
for(; !isdigit(s); s = getchar()) if(s == '-') f = -1;
for(; isdigit(s); s = getchar()) x = (x << 3) + (x << 1) + (s ^ 48);
x *= f;
}
template <typename T> inline void write(T x) {
if(x < 0) putchar('-'), x = -x;
if(x > 9) write(x/10);
putchar(x%10+'0');
}
};
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _for(n,m,i) for (int i = (n); i < (m); ++i)
#define _rep(n,m,i) for (int i = (n); i <= (m); ++i)
#define _srep(n,m,i)for (int i = (n); i >= (m); i--)
#define _sfor(n,m,i)for (int i = (n); i > (m); i--)
#define ef(u, i) for(int i = head[u]; i; i = e[i].next)
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define lowbit(x) x & (-x)
#define pii pair<int,int>
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define ALL(X) (X).begin(), (X).end()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define fi first
#define se second
#define dbg(x...) do { cout << "|" << #x <<" -> "; err(x); } while (0)
void err() { cout << "|" << endl; }
template<class T, class... Ts> void err(const T& arg,const Ts&... args) { cout << arg << " "; err(args...); }
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
const int N = (1<<19) + 5 ;
char s[N];
int T[N], cnt, fa[N];
int l[N], r[N];
void solve() {
int n; R(n);
scanf("%s", s + 1);
int la = 1<<(n-1);
int f = la + 1;
for(int i = 1; i < (1<<n); i += 2) {
fa[i] = fa[i+1] = f;
l[f] = i, r[f] = i + 1;
if(i <= la) {
if(s[i] == '?') T[i] = 2;
else T[i] = 1;
if(s[i+1] == '?') T[i+1] = 2;
else T[i+1] = 1;
} else {
if(s[i] == '?') T[i] = T[l[i]] + T[r[i]];
else if(s[i] == '0') T[i] = T[l[i]];
else T[i] = T[r[i]];
if(s[i+1] == '?') T[i+1] = T[l[i+1]] + T[r[i+1]];
else if(s[i+1] == '0') T[i+1] = T[l[i+1]];
else T[i+1] = T[r[i+1]];
}
++f;
}
int gen = (1<<n)-1;
fa[gen] = 0;
int q; R(q);
int op;
char cc[2];
while(q--) {
R(op, cc);
s[op] = cc[0];
while(op) {
if(l[op]) {
if(s[op] == '?') T[op] = T[l[op]] + T[r[op]];
else if(s[op] == '0') T[op] = T[l[op]];
else T[op] = T[r[op]];
} else {
if(s[op] == '?') T[op] = 2;
else T[op] = 1;
}
op = fa[op];
}
W(T[gen]);
}
}
int main() {
// #define LOCAL
#ifdef LOCAL
freopen("test.in", "r", stdin);
freopen("test.out", "w", stdout);
#endif
// CASET
solve();
return 0;
} | 1,800 | CPP |
import math
for _ in range(int(input())):
n, x, t = map(int, input().split())
r = math.floor(t/x)
k = min(r - 1, n - 1)
#print(r)
print(max(0, n - r) * r + (k * (k + 1)) // 2) | 1,000 | PYTHON3 |
for _ in range(int(input())):
a,b=map(int,input().split())
print((24-a)*60-b) | 800 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.