solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
N = int(input())
p = 1
for i in range(2, N + 1):
p *= i
ans = 1
for i in range(2, N + 1):
if p % i != 0:
continue
c = 1
while p % i == 0:
p //= i
c += 1
ans *= c
print(ans % 1000000007) | 0 | PYTHON3 |
n = int(input())
li = [input().split() + [i] for i in range(n)]
li.sort(key=lambda x: (x[0], -int(x[1])))
for x, y, z in li:
print(z + 1)
| 0 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
a=list(map(int,input().split()))
ceve=0
codd=0
ce=0
co=0
for j in range(len(a)):
if(a[j]%2==0):
ceve+=1
else:
codd+=1
for z in range(len(a)):
if(z%2==0 and a[z]%2!=0):
ce+=1
elif(z%2!=0 and a[z]%2==0):
co+=1
if(ce!=co):
print(-1)
else:
print((ce+co)//2) | 8 | PYTHON3 |
a=input()
b=a.split('1')
faltu=b.count('')
for i in range(faltu):
b.remove('')
p=b.count('4')
q=b.count('44')
#print(b)
yo=a.count('1')
ro=a.count('4')
if yo+ro==len(a) and p+q==len(b) and a[0]=='1':
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int d, n, w[2005], x, y;
long long sum;
vector<int> ans[2005];
long long dfs(int u, int f, int rt) {
long long ret = 1;
for (int i = 0; i < ans[u].size(); i++) {
int v = ans[u][i];
if (v == f || w[rt] < w[v] || (w[rt] == w[v] && rt < v) || w[rt] - w[v] > d)
continue;
ret = ret * (dfs(v, u, rt) + 1) % 1000000007;
}
return ret;
}
int main() {
while (scanf("%d%d", &d, &n) != EOF) {
sum = 0;
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
for (int i = 1; i < n; i++) {
scanf("%d%d", &x, &y);
ans[x].push_back(y);
ans[y].push_back(x);
}
for (int i = 1; i <= n; i++) sum = (sum + dfs(i, -1, i)) % 1000000007;
printf("%I64d\n", sum);
}
return 0;
}
| 10 | CPP |
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()
from collections import defaultdict
def check(a):
a.sort()
j = 1
for i in a:
if i != j:
return False
j += 1
return True
def sol():
n = ni()
a = na()
maxA = max(a)
ans = []
if check(a[:n - maxA]) and check(a[n - maxA:]):
ans.append((n - maxA, maxA))
if maxA * 2 != n and check(a[:maxA]) and check(a[maxA:]):
ans.append((maxA, n - maxA))
print(len(ans))
for l, r in ans:
print(l, r)
t = ni()
for i in range(t):
sol() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct E {
int v;
long long w1, w2;
E* next;
};
long long add(long long x, long long y) {
return x != -1 && y != -1 ? (x + y) : -1;
}
long long cmp(long long x, long long y) {
return x != -1 && (x < y || y == -1);
}
struct Mat {
long long g[2][2];
Mat() { memset(g, -1, sizeof(g)); }
Mat(initializer_list<long long> list) {
const long long* ptr = list.begin();
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j) g[i][j] = *ptr++;
}
const long long* operator[](int k) const { return g[k]; }
long long* operator[](int k) { return g[k]; }
Mat operator*(const Mat& rhs) const {
Mat ret = Mat();
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j)
for (int k = 0; k < 2; ++k)
ret[i][j] = min(ret[i][j], add(g[i][k], rhs[k][j]), cmp);
return ret;
}
};
const int N = 300010, Q = 600010;
int n;
long long wn[N], ans[Q];
int f[N], qu[Q][2];
Mat val[N];
vector<pair<int, bool>> qry[N];
vector<int> q2[N];
bool vis[N], opt[Q][2];
E* g[N];
void adde(int u, int v, long long w1, long long w2) {
static E pool[N * 2], *p = pool;
p->v = v;
p->w1 = w1;
p->w2 = w2;
p->next = g[u];
g[u] = p++;
}
void dfs1(int u);
void dfs2(int u);
Mat tran(const Mat& m) { return {m[0][0], m[1][0], m[0][1], m[1][1]}; }
int find(int x) {
if (f[x] == x) return x;
int prt = f[x];
f[x] = find(f[x]);
val[x] = val[x] * val[prt];
return f[x];
}
void dfs3(int u);
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%lld", &wn[i]);
for (int rep = 1; rep < n; ++rep) {
int u, v;
long long w1, w2;
scanf("%d%d%lld%lld", &u, &v, &w1, &w2);
adde(u, v, w1, w2);
adde(v, u, w1, w2);
}
dfs1(1);
memset(vis, 0, sizeof(vis));
dfs2(1);
int q;
scanf("%d", &q);
for (int i = 1; i <= q; ++i) {
int x, y;
scanf("%d%d", &x, &y);
int u = (x + 1) >> 1, v = (y + 1) >> 1;
bool a = !(x & 1), b = !(y & 1);
qu[i][0] = u;
qu[i][1] = v;
opt[i][0] = a;
opt[i][1] = b;
qry[u].emplace_back(i, 0);
qry[v].emplace_back(i, 1);
}
fill(val + 1, val + n + 1, Mat{0, -1, -1, 0});
dfs3(1);
for (int i = 1; i <= q; ++i) printf("%lld\n", ans[i]);
return 0;
}
void dfs1(int u) {
vis[u] = true;
for (E* p = g[u]; p; p = p->next)
if (!vis[p->v]) dfs1(p->v), wn[u] = min(wn[u], wn[p->v] + p->w1 + p->w2);
}
void dfs2(int u) {
vis[u] = true;
for (E* p = g[u]; p; p = p->next)
if (!vis[p->v]) wn[p->v] = min(wn[p->v], wn[u] + p->w1 + p->w2), dfs2(p->v);
}
void dfs3(int u) {
f[u] = u;
for (E* p = g[u]; p; p = p->next)
if (!f[p->v]) {
dfs3(p->v);
f[p->v] = u;
val[p->v] = Mat({0, wn[p->v], wn[p->v], 0}) * Mat({p->w1, -1, -1, p->w2});
}
for (const auto& q : qry[u])
if (f[qu[q.first][!q.second]]) {
int lca = find(qu[q.first][!q.second]);
q2[lca].push_back(q.first);
}
Mat cur{0, wn[u], wn[u], 0};
for (int id : q2[u]) {
Mat res1 = (find(qu[id][0]), val[qu[id][0]]),
res2 = (find(qu[id][1]), val[qu[id][1]]);
ans[id] = (res1 * cur * tran(res2))[opt[id][0]][opt[id][1]];
}
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const auto INIT = [] {
return ios::sync_with_stdio(false), cin.tie(nullptr);
}();
int main() {
int n;
cin >> n;
int64_t num = 1;
for (int64_t i = 3; i <= n; ++i) {
num *= i;
}
cout << (num / (n / 2)) / (n / 2) << '\n';
return 0;
}
| 11 | CPP |
"""for p in range(int(input())):
n,k=map(int,input().split(" "))
number=input().split(" ")
chances=[k for i in range(n)]
prev=-1
prev_updated=-1
last_used=False
toSub=0
start=0
prevSub=0
if(number[0]=='1'):
prev=0
prev_updated=0
start=1
for i in range(start,n):
if(number[i]=='1'):
# print("\ni",i,"\ntoSub",toSub,"\nprevUpadted",prev_updated,"\nprev",prev,"\nlast_used",last_used)
f1=False
# toSub+=1
toSub=0
zeros=i - prev_updated - 1
if(last_used):
zeros-=1
#chances[i]-=toSub
#print(prevSub,(i - prev - 1 ) +1)
if(i - prev - 1 <= prevSub):
chances[i]-= prevSub - (i - prev - 1 ) +1
if(chances[i]<zeros):
chances[i]=zeros
toSub+= prevSub - (i - prev - 1 ) +1
f1=True
if(zeros==0 or chances[i]==0):
prev_updated=i
prev=i
last_used=False
prevSub=toSub
continue
# print("\nchances: ",chances[i],"\t\tzeroes : ",zeros,"\t\tprevSub :",prevSub)
if(chances[i]>zeros):
# print("\t\t\t\t1")
number[i-zeros]='1'
number[i]='0'
prev_updated=i-zeros
last_used=False
elif(chances[i]==zeros):
# print("\t\t\t\t2")
number[i]='0'
number[i-chances[i]]='1'
prev_updated=i-chances[i]
last_used=True
else:
# print("\t\t\t\t3")
number[i]='0'
number[i-chances[i]]='1'
prev_updated=i-chances[i]
last_used=True
prev=i
prevSub=toSub
if(prev_updated>2 and f1):
if(number[prev_updated]=='1' and number[prev_updated-1]=='0' and number[prev_updated-2]=='1'):
last_used=False
#if()
# print("\ni",i,"\ntoSub",toSub,"\nprevUpadted",prev_updated,"\nprev",prev,"\nlast_used",last_used)
# print(number)
else:
toSub=0
print(*number)
# print(chances)"""
"""class offer:
def __init__(self, n, fre):
self.num = n
self.free = fre
self.delta= n-fre
n,m,k=map(int,input().split(" "))
shovel=list(map(int,input().split(" ")))
#dicti={}
offers=[]
temp_arr=[False for i in range(n)]
for i in range(m):
p,q=map(int,input().split(" "))
if(p>k):
continue
offers.append(offer(p,q))
# dicti[p]=q
#for i in dicti:
# dicti[i].sort()
shovel.sort()
shovel=shovel[:k+1]
offers.sort(key=lambda x: x.delta/x.num,reverse=True)
bestoffer=[]
for i in offers:
if(not temp_arr[i.num]):
temp_arr[i.num]=True
bestoffer.append(i)
cost=0
for i in bestoffer:
for p in range(int(input())):
arr=list(input())
n=len(arr)
for i in range(n):
arr[i]=ord(arr[i])-96
arr.sort()
arr1=arr[:n//2]
arr2=arr[n//2:]
arr=[]
#print(arr,arr1,arr2)
i1=n//2-1
i2=n-i1-2
while (i1!=-1 and i2!=-1):
arr.append(arr1[i1])
arr.append(arr2[i2])
i1-=1
i2-=1
if(i1!=-1):
arr.append(arr1[i1])
elif(i2!=-1):
arr.append(arr2[i2])
#print(arr)
s=""
for i in range(n-1):
if(abs(arr[i]-arr[i+1])==1):
s=-1
print("No answer")
break
else:
s+=chr(arr[i]+96)
if(s!=-1):
s+=chr(arr[-1]+96)
print(s)"""
"""
n,m=map(int,input().split(" "))
seti=[]
ans=[1 for i in range(n)]
for i in range(m):
arr=list(map(int,input().split(" ")))
if(arr[0]>1):
seti.append(set(arr[1:]))
else:
m-=1
parent=[-1 for i in range(m)]
#print(seti)
for i in range(m-1):
for j in range(i+1,m):
if(parent[j]==-1):
if(len(seti[i].intersection(seti[j]))>0):
seti[i]=seti[i].union(seti[j])
parent[j]=i
#print(parent)
for i in range(m):
if(parent[i]==-1):
temp=list(seti[i])
store=len(temp)
for j in temp:
ans[j-1]=store
print(*ans)
for p in range(int(input())):
arr=list(input())
n=len(arr)
for i in range(n):
arr[i]=ord(arr[i])-96
arr.sort()
arr1=arr[:n//2]
arr2=arr[n//2:]
arr=[]
#print(arr,arr1,arr2)
i1=n//2-1
i2=n-i1-2
while (i1!=-1 and i2!=-1):
arr.append(arr1[i1])
arr.append(arr2[i2])
i1-=1
i2-=1
if(i1!=-1):
arr.append(arr1[i1])
elif(i2!=-1):
arr.append(arr2[i2])
s=""
for i in range(n-1):
if(abs(arr[i]-arr[i+1])==1):
s=-1
print("No answer")
break
else:
s+=chr(arr[i]+96)
if(s!=-1):
s+=chr(arr[-1]+96)
print(s)
#n=0"""
n,m,k=map(int,input().split(" "))
m-=n
ans=1
side1=k-1
side2=n-k
prevadd=1
while m>=prevadd:
m-=prevadd
ans+=1
if(side1+side2==0):
ans+=m//n
break
if(side1>0):
side1-=1
prevadd+=1
if(side2>0):
side2-=1
prevadd+=1
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int mn, n, m, tmp, a[1000], b[1000], c[1000], maxx;
int main() {
scanf("%d%d", &n, &m);
maxx = 0;
mn = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
a[0] = b[0] = c[0] = 0;
tmp = n;
while (tmp > 0) {
a[++a[0]] = tmp % 10;
if (tmp % 10 > mn) mn = tmp % 10;
tmp /= 10;
}
tmp = m;
while (tmp > 0) {
b[++b[0]] = tmp % 10;
if (tmp % 10 > mn) mn = tmp % 10;
tmp /= 10;
}
memset(c, 0, sizeof(c));
c[0] = max(a[0], b[0]);
for (int i = 1; i <= c[0]; i++) c[i] = a[i] + b[i];
int k = 0;
for (int i = mn + 1; i <= 16; i++) {
k = i;
for (int j = 1; j <= c[0]; j++)
if (c[j] >= k) {
c[j] -= k;
c[j + 1]++;
}
if (c[c[0] + 1] > 0) c[0]++;
if (c[0] > maxx) maxx = c[0];
memset(c, 0, sizeof(c));
c[0] = max(a[0], b[0]);
for (int j = 1; j <= c[0]; j++) c[j] = a[j] + b[j];
}
printf("%d\n", maxx);
return 0;
}
| 8 | CPP |
n = int(input())
mod = int(1000000007)
print((pow(3, 3*n, mod) - pow(7, n, mod))%mod)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void amin(T &x, const T &y) {
if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
if (x < y) x = y;
}
template <class Iter>
void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp = 0; begin != end; ++begin) {
if (sp)
putchar(' ');
else
sp = true;
printf(fmt, *begin);
}
putchar('\n');
}
int N;
int A[200111];
vector<int> G[200111];
int main() {
scanf("%d", &N);
for (int i = 0, i_len = (N); i < i_len; ++i) scanf("%d", A + i);
for (int i = 0, i_len = (N); i < i_len; ++i) {
int m = A[i];
for (int k = 1; k * k <= m; k++) {
if (m % k == 0) {
G[k].push_back(i);
if (k * k < m) G[m / k].push_back(i);
}
}
}
long long ans = 0;
vector<pair<int, int> > cur(N + 1);
for (int i = 0, i_len = (N + 1); i < i_len; ++i) cur[i] = make_pair(i, i);
for (int a = 200000; a > 0; a--)
if (G[a].size() > 1u) {
sort(G[a].begin(), G[a].end());
vector<pair<int, int> > X, nxt;
if (0 < G[a].end()[-2]) X.emplace_back(0, G[a].end()[-2]);
if (G[a][0] < G[a].back() - 1) X.emplace_back(G[a][0] + 1, G[a].back());
if (G[a][1] < N - 1) X.emplace_back(G[a][1] + 1, N);
for (__typeof((X).begin()) e = (X).begin(), e_end = (X).end(); e != e_end;
++e) {
bool zero = false;
for (int i = 0, i_len = (cur.size()); i < i_len; ++i)
if (e->first >= cur[i].first && e->second <= cur[i].second) {
zero = true;
break;
}
if (zero) continue;
int last = 0;
for (int i = 0, i_len = (cur.size()); i < i_len; ++i) {
if (e->second <= last) break;
if (cur[i].first > e->first) {
if (cur[i].second < e->second) {
ans += (long long)a * (cur[i].second - last) *
(cur[i].first - e->first);
} else {
ans +=
(long long)a * (e->second - last) * (cur[i].first - e->first);
}
}
last = cur[i].second;
}
nxt.clear();
bool inserted = false;
for (int i = 0, i_len = (cur.size()); i < i_len; ++i) {
if (cur[i].first < e->first)
nxt.push_back(cur[i]);
else {
if (!inserted) {
nxt.push_back(*e);
inserted = true;
}
if (cur[i].second > e->second) nxt.push_back(cur[i]);
}
}
swap(cur, nxt);
}
}
printf("%lld\n", ans);
return 0;
}
| 9 | CPP |
n=int(input())
if n!=1:
print(n*3,n*2)
else:
print(10,9)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma hdrstop
#pragma argsused
using namespace std;
int main(int argc, char* argv[]) {
int i, j, resp, resn, resv, resl, res, n, a, b;
vector<int> x, y;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
x.push_back(a);
y.push_back(b);
}
res = 0;
for (i = 0; i < n; i++) {
resv = 0;
resn = 0;
resp = 0;
resl = 0;
for (j = 0; j < n; j++) {
if (i != j) {
if (x[i] == x[j] && y[i] > y[j])
resn++;
else if (x[i] == x[j] && y[i] < y[j])
resv++;
else if (x[i] > x[j] && y[i] == y[j])
resl++;
else if (x[i] < x[j] && y[i] == y[j])
resp++;
}
if (resp != 0 && resl != 0 && resv != 0 && resn != 0) {
res++;
break;
}
}
}
printf("%d", res);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, x, m, y, d, ans;
int main() {
cin >> n >> x >> m >> y;
ans = m + n + 1;
if (x > y) swap(x, y), swap(n, m);
for (int i = 1; i <= n; i++)
if (x + i > y - m && x + i < y + m)
if (x + i > y)
ans += 2 * (min(m, y - x + i - 1) + (y - x - i));
else
ans += 2 * (min(m, y - x + i - 1) - (y - x - i)) - 1;
cout << ans;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
set<int> s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
while (m % 2 == 0) m /= 2;
while (m % 3 == 0) m /= 3;
s.insert(m);
}
if (s.size() == 1)
cout << "Yes";
else
cout << "No";
}
| 7 | CPP |
def dkwpwn(lists):
count = 0
output = ''
start = end = None
lists1 = sorted(lists)
for i in range(len(lists)-1):
if lists[i]>lists[i+1]:
start = i
break
for i in reversed(range(1,len(lists))):
if lists[i]<lists[i-1]:
end = i
break
if start == None or end== None:
print('yes')
return '1 1'
temp = lists[start:end+1]
temp = temp[::-1]
lists[start:end+1]=temp
if lists == lists1:
print('yes')
return '{} {}'.format(start+1,end+1)
return 'no'
q = int(input())
lists = list(map(int,input().split()))
print(dkwpwn(lists))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str, t;
cin >> str >> t;
int m = str.size(), n = t.size();
int arr[n][2];
int i = 0, j = 0;
for (int i = 0; i < m; i++)
if (str[i] == t[j]) arr[j][0] = i, j++;
j = n - 1;
for (int i = m - 1; i >= 0; i--)
if (str[i] == t[j]) arr[j][1] = i, j--;
int ans = max(arr[0][1], m - 1 - arr[n - 1][0]);
for (int i = 0; i < n - 1; i++) ans = max(ans, arr[i + 1][1] - arr[i][0] - 1);
cout << ans;
return 0;
}
| 10 | CPP |
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
pos_of = [0]*n
for i in range(n):
pos_of[a[i]-1] = i
l=pos_of[0]
r = pos_of[0]
output = ''
for i in range(n):
if pos_of[i]>r:
r = pos_of[i]
if pos_of[i]<l:
l = pos_of[i]
if r-l==i:
output+='1'
else:
output+='0'
print(output) | 8 | PYTHON3 |
a, b, c, d = map(float, input().split())
t = (a-c)**2 + (b-d)**2
print(t**(1/2))
| 0 | PYTHON3 |
N, M = map(int, input().split())
parent = [i for i in range(N + M)]
rank = [0] * (N + M)
def find(i):
if parent[i] == i:
return i
else:
parent[i] = find(parent[i])
return parent[i]
def same(x, y):
return find(x) == find(y)
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if rank[x] > rank[y]:
parent[y] = x
else:
parent[x] = y
if rank[x] == rank[y]:
rank[y] += 1
for i in range(N):
P = list(map(int, input().split()))
n = P[0]
for j in range(1, n + 1):
unite(i, P[j] - 1 + N)
k = find(0)
for i in range(N):
if k != find(i):
print('NO')
exit()
print('YES') | 0 | PYTHON3 |
#include<iostream>
using namespace std;
#define m long long
#define d(s,i,n) for(m i=s;i<n;i++)
m l[90][90],r[90][90];
signed main(){m n;cin>>n;d(0,i,89){l[i][0]=1,r[i][0]=1;d(1,j,90){if(i==j)r[i][j]=r[i][j-1]*2+l[i][j-1];else r[i][j]=r[i][j-1]+l[i][j-1];l[i][j]=r[i][j-1];}}d(0,i,n){m a,b; cin>>a>>b;if(b>a)swap(a,b);m k=0;d(0,j,90)if(a>=r[0][j]&&b>=l[0][j])k=j;m g;if(k==0)k=1,g=1;else if(k==1)if(b==1)g=a;else g=4;else{g=1;if(b>=r[0][k]&&a>=l[0][k]&&l[0][k]!=r[0][k])g++;d(1,j,k+1)if(r[j][k]<=a&&l[j][k]<=b)g+=1+(a-r[j][k])/l[j][k];d(1,j,k+1)if(r[j][k]<=b&&l[j][k]<=a)g+=1+(b-r[j][k])/l[j][k];}cout<<k<<" "<<g%1000000007<<" ";}} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, e = 0, f = 0, i, j;
string s, x = "", y = "", z = "";
cin >> s;
c = -1;
for (i = s.size() - 1; i >= 0; i--) {
if (s[i] != 'a') {
z += s[i];
e++;
} else {
c = i;
break;
}
}
if (e != 0) {
for (i = z.size() - 1; i >= 0; i--) {
x += z[i];
}
}
z = "";
for (i = 0; i < c; i++) {
if (s[i] != 'a') {
y += s[i];
f++;
}
z += s[i];
}
z += 'a';
if (e < f) {
cout << ":(" << endl;
return 0;
} else if (e == 0 && f == 0) {
cout << z << endl;
return 0;
}
if (c == -1) {
if (s.size() % 2 == 0) {
a = s.size() / 2;
for (i = 0; i < s.size() / 2; i++) {
if (x[i] != x[a]) {
cout << ":(" << endl;
return 0;
}
a++;
}
for (i = 0; i < s.size() / 2; i++) cout << x[i];
cout << endl;
return 0;
} else {
cout << ":(" << endl;
return 0;
}
}
c = x.size() + y.size();
if (c % 2 != 0 || y.size() > x.size()) {
cout << ":(" << endl;
return 0;
}
a = y.size();
b = x.size();
c = 0;
while (a < b) {
a++;
b--;
y += x[c];
c++;
}
for (i = 0; i < y.size(); i++) {
if (y[i] != x[i + c]) {
cout << ":(" << endl;
return 0;
}
}
for (i = 0; i < c; i++) {
z += x[i];
}
cout << z << endl;
return 0;
}
| 8 | CPP |
from sys import stdin
def ii(): return int(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def li(): return list(mi())
def si(): return stdin.readline()
x, y, z=mi()
a, b, c=mi()
print('YES' if x<=a and x+y<=a+b and x+y+z<=a+b+c else 'NO')
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll r, c, n;
vector<pair<ll, ll> > vr[(ll)1e5];
vector<pair<ll, ll> > vc[(ll)1e5];
bool used[2][(ll)1e5];
ll score[2][(ll)1e5];
pair<ll, ll> dfs(ll pos, ll value, bool first, bool tate){
if(first){
used[(ll)!tate][pos] = 1;
score[(ll)!tate][pos] = 0;
pair<ll, ll> ret = pair<ll, ll>(1145141919 * (ll)!tate, 1145141919 * (ll)tate);
for(auto next : (tate ? vr[pos] : vc[pos])){
auto temp = dfs(next.first, next.second, 0, !tate);
ret = pair<ll, ll>(min(ret.first, temp.first), min(ret.second, temp.second));
}
return ret;
}
used[(ll)!tate][pos] = 1;
score[(ll)!tate][pos] = value;
pair<ll, ll> ret = pair<ll, ll>((tate ? value : 1145141919), (tate ? 1145141919 : value));
for(auto next : (tate ? vr[pos] : vc[pos])){
if(used[(ll)tate][next.first]){
if(score[(ll)tate][next.first] + value != next.second) return pair<ll, ll>(-1, - 1);
else continue;
}
auto temp = dfs(next.first, next.second - value, 0, !tate);
ret = pair<ll, ll>(min(ret.first, temp.first), min(ret.second, temp.second));
}
return ret;
}
int main(){
cin >> r >> c >> n;
for(ll i = 0; i < n; ++i){
ll po, yo, pi; cin >> po >> yo >> pi;
vr[--po].push_back(pair<ll, ll>(--yo, pi));
vc[yo].push_back(pair<ll, ll>(po, pi));
}
for(ll i = 0; i < r; ++i){
if(!used[0][i]){
pair<ll, ll> ret = dfs(i, 0, 1, 1);
if(ret.first + ret.second < 0){
cout << "No\n";
return 0;
}
}
}
for(ll i = 0; i < c; ++i){
if(!used[1][i]){
pair<ll, ll> ret = dfs(i, 0, 1, 0);
if(ret.first + ret.second < 0){
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
} | 0 | CPP |
a = [0, 0, 0]
for i in range(int(input())):
b = input().split()
for j in range(2):
a[j] += int(b[j])
print('YES' if a[0] == a[1] == a[2] == 0 else 'NO')
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=1
final=[]
for i in range(1,n):
if l[i]>=l[i-1]:
c+=1
else:
final.append(c)
c=1
final.append(c)
print(max(final)) | 7 | PYTHON3 |
#include<stdio.h>
#include<string.h>
int main(){
int kosu[2][20][20],x,y,c,i,j;
while(~scanf("%d%d",&x,&y)){
if(x==0&&y==0)break;
memset(kosu,0,sizeof(kosu));
for(i=1;i<=y;i++){
for(j=1;j<=x;j++){
scanf("%d",&c);
kosu[1][i][j]=c;
}
}
for(i=1;i<=x;i++){
if(kosu[1][1][i]==0)kosu[0][1][i]=1;
}
for(i=2;i<y;i++){
for(j=1;j<=x;j++){
if(kosu[1][i][j]==1)continue;
if(kosu[1][i-2][j]==2)kosu[0][i][j]+=kosu[0][i-2][j];
if(kosu[1][i][j]==2){
kosu[0][i][j]+=(kosu[1][i-1][j]==2?0:kosu[0][i-1][j]);
}else{
kosu[0][i][j]+=((kosu[1][i-1][j-1]==2?0:kosu[0][i-1][j-1])+(kosu[1][i-1][j]==2?0:kosu[0][i-1][j])+(kosu[1][i-1][j+1]==2?0:kosu[0][i-1][j+1]));
}
}
}
if(y==1){
j=0;
for(i=1;i<=x;i++){
j+=kosu[0][y][i];
}
printf("%d\n",j);
continue;
}
for(j=1;j<=x;j++){
if(kosu[1][y-1][j]==2)kosu[0][y][j]+=kosu[0][y-1][j];
if(kosu[1][y][j]!=1 && kosu[1][y-2][j]==2)kosu[0][y][j]+=kosu[0][y-2][j];
if(kosu[1][y][j]==1)continue;
if(kosu[1][y][j]==2){
kosu[0][y][j]+=(kosu[1][y-1][j]==2?0:kosu[0][y-1][j]);
}else{
kosu[0][y][j]+=((kosu[1][y-1][j-1]==2?0:kosu[0][y-1][j-1])+(kosu[1][y-1][j]==2?0:kosu[0][y-1][j])+(kosu[1][y-1][j+1]==2?0:kosu[0][y-1][j+1]));
}
}
j=0;
for(i=1;i<=x;i++){
j+=kosu[0][y][i];
}
printf("%d\n",j);
}
return 0;
} | 0 | CPP |
n, k = input().split();
b = input().split();
out = list(range(int(n)))
def intToName(i):
letters = ord("Z") - ord("A") + 1
res = "";
first = True;
while True:
i,c = divmod(i,letters);
if first:
res += chr(ord("A")+c)
else:
res += chr(ord("a")+c)
if i == 0:
return res;
else:
i -= 1;
first = False;
i = 0;
while i <= int(n)-int(k):
soldierFirst = i
soldierLast = i+int(k)-1
if b[i] == "NO":
out[soldierLast] = out[soldierFirst];
i += 1;
for i in range(int(n)-1):
print(intToName(out[i]), end = " ");
print(intToName(out[int(n)-1])); | 8 | PYTHON3 |
from collections import defaultdict
s = input()
d = defaultdict(int)
for c in s:
for a in range(97,123):
a = chr(a)
d[a+c]+=d[a]
d[c]+=1
print(max(d.values())) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, cn, sum, a[310000];
long long it[310000 * 4], id[310000 * 4];
void enter() {
scanf("%d", &n);
cn = 1;
sum = 0;
a[1] = 0;
}
void update(int l, int h, int k, int i, int j, int x) {
if ((l > j) || (i > h)) return;
if ((i <= l) && (h <= j)) {
id[k] += x;
return;
};
if (id[k] != 0) {
it[k] += id[k] * (h - l + 1);
id[k * 2 + 1] += id[k];
id[k * 2] += id[k];
id[k] = 0;
}
int m = (l + h) / 2;
update(l, m, k * 2, i, j, x);
update(m + 1, h, k * 2 + 1, i, j, x);
it[k] = it[k * 2] + id[k * 2] * (m - l + 1) + it[k * 2 + 1] +
id[k * 2 + 1] * (h - m);
}
long long get(int l, int h, int k, int i, int j) {
if ((l > j) || (i > h)) return 0;
if ((i <= l) && (h <= j)) return it[k] + id[k] * (h - l + 1);
if (id[k] != 0) {
it[k] += id[k] * (h - l + 1);
id[k * 2 + 1] += id[k];
id[k * 2] += id[k];
id[k] = 0;
}
int m = (l + h) / 2;
long long x = get(l, m, k * 2, i, j);
long long y = get(m + 1, h, k * 2 + 1, i, j);
return x + y;
}
int main() {
enter();
for (int i = 1; i <= n; i++) {
int t, x, k;
cin >> t;
if (t == 1) {
cin >> k >> x;
update(1, 310000, 1, 1, k, x);
}
if (t == 2) {
cin >> k;
cn++;
update(1, 310000, 1, cn, cn, k);
};
if (t == 3)
if (cn > 1) {
long long x = get(1, 310000, 1, cn, cn);
update(1, 310000, 1, cn, cn, -x);
cn--;
};
long long sum = get(1, 310000, 1, 1, cn);
printf("%0.8f\n", float(sum) / float(cn));
}
}
| 7 | CPP |
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
t = 0
if (a + b) <= c:
t = c - (a + b) + 1
elif (a + c) <= b:
t = b - (a + c) + 1
elif (b + c) <= a:
t = a - (b + c) + 1
print(t)
| 7 | PYTHON3 |
weight = int(input())
if weight > 2 and (weight %2 == 0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000007;
int last[MAXN] = {0}, ans[MAXN] = {0};
int tree[4 * MAXN], Ttree[4 * MAXN] = {0};
void BuildTree(int v, int tl, int tr) {
tree[v] = tr - tl + 1;
if (tl == tr) return;
int mid = (tl + tr) / 2;
BuildTree(2 * v, tl, mid);
BuildTree(2 * v + 1, mid + 1, tr);
}
void Insert(int v, int tl, int tr, int pos, int val) {
if (tl == tr) {
ans[tl] = val;
tree[v]--;
return;
}
int mid = (tl + tr) / 2;
if (pos <= tree[2 * v])
Insert(2 * v, tl, mid, pos, val);
else
Insert(2 * v + 1, mid + 1, tr, pos - tree[2 * v], val);
tree[v] = tree[2 * v] + tree[2 * v + 1];
}
void Modify(int v, int tl, int tr, int pos) {
if (tl == tr) {
Ttree[v] = 1 - Ttree[v];
return;
}
int mid = (tl + tr) / 2;
if (pos <= mid)
Modify(2 * v, tl, mid, pos);
else
Modify(2 * v + 1, mid + 1, tr, pos);
Ttree[v] = Ttree[2 * v] + Ttree[2 * v + 1];
}
int GetSum(int v, int tl, int tr, int l, int r) {
if (tl > r || tr < l) return 0;
l = max(tl, l);
r = min(tr, r);
if (tl == l && tr == r) return Ttree[v];
int mid = (tl + tr) / 2;
return GetSum(2 * v, tl, mid, l, r) + GetSum(2 * v + 1, mid + 1, tr, l, r);
}
int main() {
int N, M;
cin >> N >> M;
BuildTree(1, 1, N);
int Total = 0;
for (int i = 1; i <= M; i++) {
int x, y;
cin >> x >> y;
if (last[x] == 0) {
if (Total >= y) {
cout << -1 << endl;
return 0;
}
y = y - Total;
Insert(1, 1, N, y, x);
Modify(1, 1, M, i);
Total++;
} else {
if (y != GetSum(1, 1, M, last[x], M)) {
cout << -1 << endl;
return 0;
}
Modify(1, 1, M, last[x]);
Modify(1, 1, M, i);
}
last[x] = i;
}
for (int i = 1; i <= N; i++)
if (last[i] == 0) Insert(1, 1, N, 1, i);
for (int i = 1; i <= N; i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m, k;
cin >> n >> m >> k;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << (a[n - 1] * ((m / (k + 1)) * k)) + (a[n - 1] * ((m % (k + 1)))) +
((a[n - 2] * ((m / (k + 1)))));
}
signed main() {
long long t = 1;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[111];
void input() {
cin >> n;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int b;
cin >> b;
if (i == j) continue;
a[i] |= b;
a[j] |= b;
}
}
void solve() {
for (int i = 0; i < n; i++) cout << a[i] << " ";
}
int main(int argc, char* argv[]) {
input();
solve();
}
| 10 | CPP |
t=int(input())
for i in range(t):
a,b=map(int,input().split())
def div(a,b):
for j in range(b):
if a%b==0:
return("0")
else:
return(b-a%b)
print(div(a,b)) | 10 | PYTHON3 |
def makelist2(n,m):
return[[0 for k in range(m)]for i in range(n)]
n,a = map(int,input().split())
x = list(map(int,input().split()))
X = max(x)
X = max(X,a)
b=[]
for i in range(n):
b.append(x[i]-a)
dp =makelist2(n+1,2*n*X+1)
dp[0][n*X] = 1
for j in range(n+1):
for t in range(2*n*X+1):
if j>=1 and (t-b[j-1] < 0 or t-b[j-1]>2*n*X):
dp[j][t] = dp[j-1][t]
elif j>= 1:
dp[j][t] = dp[j-1][t] + dp[j-1][t-b[j-1]]
print(dp[n][n*X]-1) | 0 | PYTHON3 |
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
int main(void){
int a,l,x;
while(cin>>a>>l>>x){
double s1=(a+2.0*l)/2.0;
double S=sqrt(s1*(s1-a)*(s1-l)*(s1-l));
double s2=(2.0*l+x)/2.0;
S+=2.0*sqrt(s2*(s2-l)*(s2-(l+x)/2.0)*(s2-(l+x)/2.0));
printf("%.10f\n",S);
}
return 0;
} | 0 | CPP |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef complex<int> P;
typedef pair<int,int> pii;
const double EPS = 1e-10;
const double PI = acos(-1.0);
template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t;}
bool solve(){
int gx, gy;
cin>> gx>> gy;
int n;
cin>> n;
vector<pii> s(n), t(n);
for(int i=0;i<n;i++){
int a, b, c, d;
cin>> a>> b>> c>> d;
if(a > c || b > d){
swap(a,c);
swap(b,d);
}
s[i].first = a;
s[i].second = b;
t[i].first = c;
t[i].second = d;
}
vector<vector<ll> > a(gy+2, vector<ll>(gx+2));
a[0][0] = 1;
for(int i=0;i<=gy;i++){
for(int j=0;j<=gx;j++){
bool x = true, y = true;
for(int k=0;k<n;k++){
if(s[k].first == j && s[k].second == i && t[k].first == j+1) x = false;
if(s[k].first == j && s[k].second == i && t[k].second == i+1) y = false;
}
if(x) a[i][j+1] += a[i][j];
if(y) a[i+1][j] += a[i][j];
}
}
// for(int i=0;i<=gy;i++){ for(int j=0;j<=gx;j++) cout<< " "<< a[i][j]; cout<< endl; }
if(a[gy][gx] == 0) cout<< "Miserable Hokusai!" << endl;
else cout<< a[gy][gx]<< endl;
return true;
}
int main(){
cout.setf(ios::fixed); cout.precision(10);
int n;
cin>> n;
for(int i=0;i<n;i++) solve();
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
long long c[1010][1010] = {0};
vector<long long> v;
void calc(long long x) {
int i, j, k, l;
for (i = 0; i <= 1000; i++) {
c[i][0] = c[i][i] = 1;
for (j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
}
}
for (i = 2; i <= 1000; i++) {
j = x;
k = 0;
l = i;
while (j--) {
while (l) {
if (l & 1) k++;
l = l >> 1;
}
l = k;
if (k == 1)
break;
else
k = 0;
}
if (j == 0) v.push_back(i);
}
}
long long k, ans = 0;
int main() {
string s;
cin >> s >> k;
if (k == 0) {
cout << 1 << endl;
return 0;
}
if (k == 1) {
cout << s.length() - 1 << endl;
return 0;
}
calc(k - 1);
int i, j, l = 0, n;
for (i = 0; i < s.length(); i++) {
n = s.length() - i - 1;
if (s[i] == '1') {
for (j = 0; j < v.size(); j++) {
if (v[j] - l < 0) continue;
if (n >= v[j] - l)
ans = (ans + c[n][v[j] - l]) % M;
else
break;
}
l++;
}
}
for (i = 0; i < v.size() && k != 1; i++) {
if (v[i] == l) {
ans++;
break;
}
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <cstdio>
using namespace std;
bool isdraw(int used)
{
if(used == (1<<3)-1) return true;
for(int i=0; i<3; i++)
if(used == (1<<i)) return true;
return false;
}
int main()
{
int t;
while(scanf("%d", &t), t)
{
int ar[5], used=0;
ar[0]=t;
used|=(1<<(ar[0]-1));
for(int i=1; i<5; i++)
{
scanf("%d", &ar[i]);
used|=(1<<(ar[i]-1));
}
for(int i=0; i<5; i++)
{
if(isdraw(used)) puts("3");
else
{
if(used&(1<<(ar[i])%3)) puts("1");
else puts("2");
}
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, cnt = 0, k, j = 1;
cin >> n;
vector<int> vec;
for (i = 0; i < n; i++) {
cin >> k;
vec.push_back(k);
}
sort((vec).begin(), (vec).end());
i = 0;
while (1) {
if (i >= n) break;
if (vec[i] >= j) {
cnt++;
j++;
}
i++;
}
cout << cnt;
}
| 8 | CPP |
a,b,c=map(int,input().split())
m=b//a
print(min(m,c)) | 0 | PYTHON3 |
s = input()
if 'C' in s and 'F' in s:
if 'F' in s[s.index('C'):]:
print('Yes')
exit()
print('No') | 0 | PYTHON3 |
n = input()
arr = input().split()
s = set()
cnt = 0
max_cnt = 0
for a in arr:
if a in s:
cnt -= 1
s.remove(a)
else:
s.add(a)
cnt += 1
if cnt > max_cnt:
max_cnt = cnt
print(max_cnt)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
int n, a[MAXN], k;
bool search(int x, bool ch) {
int e, s;
s = e = (ch ? n - 1 : 0);
for (s; (ch ? s >= 0 : s < n); (ch ? (e >= 0, s--) : (e < n, s++))) {
while ((ch ? e >= 0 : e < n) && abs(a[e] - a[s]) < x) (ch ? e-- : e++);
if ((ch ? e >= 0 : e < n) && abs(a[e] - a[s]) == x) return 1, k = e;
}
return 0;
}
void chap(int x) {
cout << 1 << endl << x << endl;
exit(0);
}
int main() {
ios_base::sync_with_stdio(0);
int x, y, l;
bool ch1, ch2;
cin >> n >> l >> x >> y;
for (int i = 0; i < n; i++) cin >> a[i];
ch1 = search(x, 0);
ch2 = search(y, 0);
if (ch1 || ch2) {
if (ch1 ^ ch2)
chap((ch1 ? y : x));
else
cout << '0' << endl;
return 0;
}
if (search(x + y, 0)) chap(a[k] - y);
if (search(y - x, 0) && a[k] + x < l) chap(a[k] + x);
if (search(y - x, 1) && a[k] - x > 0) chap(a[k] - x);
cout << 2 << endl << x << endl << y << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, sizeA;
char a[10][512][512];
a[0][0][0] = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
int temp = pow(2, i);
int temp2 = pow(2, i - 1);
for (int j = 0; j < temp; j++) {
for (int v = 0; v < temp; v++) {
int t1 = v % temp2;
int t2 = j % temp2;
a[i][j][v] = a[i - 1][t1][t2];
}
}
for (int j = temp / 2; j < temp; j++) {
for (int v = temp / 2; v < temp; v++) {
a[i][j][v] = -1 * a[i][j][v];
}
}
}
int temp = pow(2, k);
for (int i = 0; i < temp; i++) {
for (int j = 0; j < temp; j++) {
if (a[k][i][j] == 1) cout << "+";
if (a[k][i][j] == -1) cout << "*";
}
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int dx[5] = {0, -1, 0, 1, 0};
const int dy[5] = {-1, 0, 1, 0, 0};
char S[111];
bool bio[400][400];
int main(void) {
scanf("%s", S);
int x = 200, y = 200;
for (char *c = S; *c; ++c) {
bio[x][y] = true;
int xx = x, yy = y;
if (*c == 'L') --x;
if (*c == 'R') ++x;
if (*c == 'U') ++y;
if (*c == 'D') --y;
for (int i = 0; i < 5; ++i) {
int a = x + dx[i], b = y + dy[i];
if (a == xx && b == yy) continue;
if (bio[a][b]) {
puts("BUG");
return 0;
}
}
}
puts("OK");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
map<int, int> mp;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int w;
scanf("%d", &w);
mp[w] += 1;
}
vector<int> d, a;
int cnt = 0;
while (mp.size() > 0) {
vector<int> t;
cnt += 1;
d.push_back(a.size());
for (auto iter : mp) {
a.push_back(iter.first);
t.push_back(iter.first);
}
for (auto w : t) {
mp[w] -= 1;
if (mp[w] == 0) {
mp.erase(mp.find(w));
}
}
}
d.push_back(a.size());
int maxx = 0, r = 0, c = 0;
for (int i = 1; i * i <= n; i++) {
int limit;
if (i >= (int)d.size())
limit = n;
else
limit = d[i];
int j = limit / i;
if (j >= i && i * j > maxx) {
maxx = i * j;
r = i;
c = j;
}
}
printf("%d\n%d %d\n", maxx, r, c);
vector<vector<int>> g(r, vector<int>(c, 0));
map<int, int> count;
for (int i = 0; i < maxx; i++) count[a[i]] += 1;
vector<pair<int, int>> q;
for (auto iter : count) {
q.push_back(make_pair(iter.second, iter.first));
}
sort(q.begin(), q.end());
reverse(q.begin(), q.end());
int x = 0, y = 0;
for (auto iter : q) {
for (int i = 0; i < iter.first; i++) {
g[x][y] = iter.second;
x += 1;
y += 1;
if (x == r) {
y = ((y - x + 1) + c) % c;
x = 0;
}
if (y == c) {
y = 0;
}
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
printf("%d ", g[i][j]);
}
puts("");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool collapses(const vector<vector<float> >& v) {
float totMass = 0;
float cog[2];
cog[0] = 0;
cog[1] = 0;
int vs = v.size();
for (int i = 0; i < vs; i++) {
float center[] = {(v[i][0] + v[i][2]) / 2, (v[i][1] + v[i][3]) / 2};
float mass = v[i][0] - v[i][2];
mass = mass * mass * mass;
mass *= (mass >= 0 ? 1 : -1);
cog[0] = mass * center[0] + totMass * cog[0];
cog[1] = mass * center[1] + totMass * cog[1];
totMass += mass;
cog[0] /= totMass;
cog[1] /= totMass;
if (i < vs - 1) {
if ((cog[0] < v[i + 1][0] && cog[0] < v[i + 1][2]) ||
(cog[0] > v[i + 1][0] && cog[0] > v[i + 1][2]) ||
(cog[1] < v[i + 1][1] && cog[1] < v[i + 1][3]) ||
(cog[1] > v[i + 1][1] && cog[1] > v[i + 1][3])) {
return true;
}
} else {
if ((cog[0] < v[i][0] && cog[0] < v[i][2]) ||
(cog[0] > v[i][0] && cog[0] > v[i][2]) ||
(cog[1] > v[i][1] && cog[1] > v[i][3]) ||
(cog[1] > v[i][1] && cog[1] > v[i][3])) {
return true;
}
}
}
return false;
}
int main() {
vector<vector<float> > v;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
vector<float> vv;
int p;
for (int ii = 0; ii < 4; ii++) {
cin >> p;
vv.push_back((float)p);
}
v.insert(v.begin(), vv);
if (collapses(v)) {
cout << i << endl;
return 0;
}
}
cout << n << endl;
}
| 10 | CPP |
def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N, x, d = map(int, input().split())
if d == 0:
if x:
print(N+1)
else:
print(1)
exit()
if d < 0:
x = x + d * (N-1)
d *= -1
dic = defaultdict(list)
for i in range(N+1):
mod = (x * i) % d
st = (i * (i+1)) // 2
ed = (i * (N + N-i+1)) // 2
st = st * d + (x-d) * i
ed = ed * d + (x-d) * i
dic[mod].append((st, ed))
ans = 0
for mod in dic:
L = dic[mod]
L.sort(key=lambda t: t[0])
ed_prev = L[0][0] - 1
for st, ed in L:
if st > ed_prev:
ans += (ed - st) // d + 1
ed_prev = ed
elif ed > ed_prev:
ans += (ed - ed_prev) // d
ed_prev = ed
print(ans)
if __name__ == '__main__':
main()
| 0 | PYTHON3 |
from sys import stdin as si
from collections import Counter as c
from functools import reduce
class Solution:
def bazinga(self,x,a):
if a==1: return 1
while a>=1:
l = len(bin(a)[2:])-1
m = 1<<l
#print (a,m)
a = abs(a - m)
if a==0: l+=1
return l
if __name__ == '__main__':
#for i in range(int(si.readline().strip())):
#n,m = map(int,si.readline().strip().split())
#m = list(map(int, si.readline().strip().split()))
n, m = map(int,si.readline().strip().split())
S = Solution()
print (S.bazinga(n, m))
'''
http://codeforces.com/problemset/problem/743/B
''' | 8 | PYTHON3 |
p=int(input())
print(0,0,p) | 7 | PYTHON3 |
n = int(input())
v = input().split(" ")
max = 0
for i in v:
ii = int(i)
if max<ii:
max = ii
s = max-25
if s < 0:
s = 0
print(s) | 7 | PYTHON3 |
"""def power(x, y):
res = 1
x=x
while (y > 0):
if ((y & 1) == 1) :
res = (res * x)
y = y >> 1
x = (x * x)
return res"""
"""def fact(n):
if(n==0):
return 1
if(n==1):
return 1
return fact(n-1)+fact(n-2)"""
"""def sieveOfEratothenes(n):
dp = [True]*(n+1)
dp[1]=True
p=2
while(p*p<n+1):
if(dp[p]==True):
for i in range(p*p, n+1, p):
dp[i]=False
p+=1
return dp"""
import math
#import combinations
t=int(input())
for _ in range(t):
#n=int(input())
#s=input()
n,m,k=map(int,input().split())
#arr=list(map(int,input().split()))
#b=list(map(int,input().split()))
if(n//k>=m):
print(m)
else:
num=n//k
m=m-num
ans=num -math.ceil(m/(k-1))
print(ans)
| 7 | PYTHON3 |
production = True
import sys, math, collections
def input(input_format = 0, multi = 0):
if multi > 0: return [input(input_format) for i in range(multi)]
else:
next_line = sys.stdin.readline()[:-1]
if input_format >= 10:
use_list = False
input_format = int(str(input_format)[-1])
else: use_list = True
if input_format == 0: formatted_input = [next_line]
elif input_format == 1: formatted_input = list(map(int, next_line.split()))
elif input_format == 2: formatted_input = list(map(float, next_line.split()))
elif input_format == 3: formatted_input = list(next_line)
elif input_format == 4: formatted_input = (lambda x: [x[0], list(map(int, x[1:]))])(next_line.split())
elif input_format == 5: formatted_input = (lambda x: [x[0], list(map(float, x[1:]))])(next_line.split())
elif input_format == 6: formatted_input = next_line.split()
else: formatted_input = [next_line]
return formatted_input if use_list else formatted_input[0]
def out(output_line, output_format = 0, newline = True):
formatted_output = ""
if output_format == 0: formatted_output = str(output_line)
elif output_format == 1: formatted_output = " ".join(map(str, output_line))
elif output_format == 2: formatted_output = "\n".join(map(str, output_line))
print(formatted_output, end = "\n" if newline else "")
def log(*args):
if not production:
print("$$$", end = "")
print(*args)
enum = enumerate
#
# >>>>>>>>>>>>>>> START OF SOLUTION <<<<<<<<<<<<<<
#
def solve():
n, k = input(1)
a = input(1)
r = [k - (i % k) for i in a]
r.sort()
log(a)
log(r)
b = dict()
for i in r:
b.setdefault(i, 0)
for i in r:
if i == k:
continue
else:
o = i + (b[i] * k)
b[i] += 1
log(b)
m = 0
a = k
d = True
for i in r[::-1]:
if b[i]:
d = False
if b[i] > m:
m = b[i]
a = i
log(m, k, a, d)
if d:
out(0)
return
out((m * k) - (k - a - 1))
return
for i in range(input(11)): solve()
# solve()
#
# >>>>>>>>>>>>>>>> END OF SOLUTION <<<<<<<<<<<<<<<
#
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010;
const int mod = 1e9 + 9;
int f[maxn], sfib[maxn], d[maxn], s[maxn], a[maxn];
int L[maxn / 100], R[maxn / 100];
void init() {
sfib[1] = f[1] = 1;
for (int i = 2; i <= maxn - 10; i++) {
f[i] = (f[i - 1] + f[i - 2]) % mod;
sfib[i] = (sfib[i - 1] + f[i]) % mod;
}
}
int main() {
init();
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
s[i] = (s[i - 1] + a[i]) % mod;
}
int op, l, r, k = 1;
int SZ = sqrt(m + 0.5);
while (m--) {
scanf("%d%d%d", &op, &l, &r);
if (op == 1) {
L[k] = l, R[k++] = r;
d[l] = (d[l] + 1) % mod;
d[r + 1] = (d[r + 1] - f[r - l + 2] + mod) % mod;
d[r + 2] = (d[r + 2] - f[r - l + 1] + mod) % mod;
if (k > SZ) {
for (int i = 1; i <= n; i++) {
if (i >= 2) d[i] = ((d[i] + d[i - 1]) % mod + d[i - 2]) % mod;
a[i] = (a[i] + d[i]) % mod;
s[i] = (s[i - 1] + a[i]) % mod;
}
k = 1;
memset(d, 0, sizeof(d));
}
} else {
int ret = 0, lt, rt;
for (int i = 1; i < k; i++) {
lt = max(L[i], l), rt = min(R[i], r);
if (lt > rt) continue;
ret = (ret + sfib[rt - L[i] + 1] - sfib[lt - L[i]]) % mod;
}
ret = (ret + s[r] - s[l - 1]) % mod;
printf("%d\n", (ret % mod + mod) % mod);
}
}
return 0;
}
| 9 | CPP |
import math
x = int(input())
print("ABC" if x < 1200 else "ARC") | 0 | PYTHON3 |
for i in range(int(input())):
t = int(input())
a = []
for i in range(t):
x,y = map(int,input().split())
a.append([x,y])
a.sort()
ans = ""
x= 0
y = 0
f = 0
for i in range(len(a)-1):
if a[i+1][0] < a[i][0] or a[i+1][1] < a[i][1]:
print("NO")
f = 1
break
if f==1:
continue
for i in range(len(a)):
a[i][0] -= x
x += a[i][0]
a[i][1] -= y
y += a[i][1]
f = "R" * a[i][0]
ans += f
f1 = "U" * a[i][1]
ans += f1
print("YES")
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int small = 0;
int big = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 97 and s[i] <= 122) {
small++;
} else if (s[i] >= 65 and s[i] <= 90) {
big++;
}
}
if (small < big) {
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 97 and s[i] <= 122) {
s[i] -= 32;
}
}
} else if (small >= big) {
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 65 and s[i] <= 90) {
s[i] += 32;
}
}
}
cout << s << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
int ntest;
std::cin >> ntest;
while (ntest--) {
std::string out;
int k;
std::cin >> k;
std::array<std::vector<int>, 2> v;
int emptycol;
assert((emptycol = -1));
for (auto& row : v) {
row.resize(k * 2 + 1);
for (unsigned col = 0; col < row.size(); ++col) {
int& x = row[col];
if (std::cin >> x) {
if (x <= 2 * k + 1) {
x = 3 * k + 1 + x;
if (x > 4 * k) x -= 4 * k + 1;
} else {
x = (3 * k + 1) - (x - (2 * k + 2));
}
} else {
std::cin.clear();
char c;
std::cin >> c;
assert(c == 'E');
x = -1;
emptycol = col;
}
}
}
auto& row_contain_empty = v[1][emptycol] < 0 ? v[1] : v[0];
while ((int)emptycol < 2 * k) {
out += 'r';
std::swap(row_contain_empty[emptycol], row_contain_empty[emptycol + 1]);
++emptycol;
}
if (v[0].back() < 0) {
out += 'd';
std::swap(v[0].back(), v[1].back());
}
assert(v[1].back() < 0);
std::vector<int> newp;
newp.reserve(4 * k + 1);
newp.insert(end(newp), begin(v[0]) + k - 1, end(v[0]));
newp.insert(end(newp), ++v[1].rbegin(), v[1].rend());
newp.insert(end(newp), begin(v[0]), begin(v[0]) + k - 1);
assert(newp.size() == unsigned(4 * k + 1));
v[0].clear();
v[1].clear();
int start = 0;
int i = 4 * k;
{
auto posi = int(std::find(begin(newp), end(newp), i) - begin(newp));
std::rotate(begin(newp), begin(newp) + posi + 1, end(newp));
start = (int)newp.size() - (posi + 1);
}
assert(newp.back() == i);
auto const macroA = [&]() {
out += 'A';
++start;
if (start == (int)newp.size()) start = 0;
};
auto const macroB = [&]() {
out += 'B';
std::swap(newp[start], newp[(start + 1) % newp.size()]);
std::swap(newp[start], newp[(start + 2) % newp.size()]);
};
while (i > 2) {
assert(newp.back() == (int)newp.size() - 1);
assert(newp[i] == i);
int const j = i - 1;
auto posj = int(std::find(begin(newp), end(newp), j) - begin(newp));
if (posj != j) {
while (start != std::max(0, posj - 1)) macroA();
if (posj == 0) {
macroB();
++posj;
}
while (posj < j) {
assert(start == posj - 1);
macroB();
++posj;
macroA();
}
}
assert(newp[j] == j);
i = j;
}
assert(newp[2] == 2);
if (newp[1] != 1) {
std::cout << "SURGERY FAILED\n";
continue;
}
assert(newp[0] == 0);
while (start != 0) macroA();
std::cout << "SURGERY COMPLETE\n" << out << '\n';
{
std::cout << "A ";
for (int z = 2 * k; z--;) std::cout << 'l';
std::cout << 'u';
for (int z = 2 * k; z--;) std::cout << 'r';
std::cout << "d\n";
std::cout << "B ";
for (int z = k; z--;) std::cout << 'l';
std::cout << 'u';
for (int z = k; z--;) std::cout << 'l';
std::cout << 'd';
for (int z = k; z--;) std::cout << 'r';
std::cout << 'u';
for (int z = k; z--;) std::cout << 'r';
std::cout << 'd';
for (int z = k; z--;) std::cout << 'l';
for (int z = k; z--;) std::cout << 'l';
std::cout << 'u';
for (int z = k; z--;) std::cout << 'r';
std::cout << 'd';
for (int z = k; z--;) std::cout << 'r';
std::cout << 'u';
for (int z = k; z--;) std::cout << 'l';
std::cout << 'd';
for (int z = k; z--;) std::cout << 'r';
std::cout << '\n';
}
std::cout << "DONE\n";
}
}
| 12 | CPP |
t = int(input())
for i in range(t):
num = list(map(int,input().strip().split()))[:2]
n = num[0]
k = num[1]
a = sorted(list(map(int,input().strip().split()))[:n])
b = sorted(list(map(int,input().strip().split()))[:n],reverse = True)
count = 0
for i in range(n):
if i < k and a[i] < b[i]:
count += b[i]
else:
count += a[i]
print(count) | 8 | PYTHON3 |
n,m=map(int,input().split())
p = 1000000007
x=(int)(pow(2,m,p))-1;
y=(int)(pow(x,n,p));
print(y); | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<int, int> mp;
map<int, int>::iterator it;
int n, A[1009], c = 0, t = 0, d = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
mp[A[i]]++;
}
for (it = mp.begin(); it != mp.end(); it++) {
if (it->second == 2 && it->first != 0)
c++;
else if (it->second > 2 && it->first != 0) {
t = -1;
break;
}
}
if (t == -1)
cout << t << endl;
else if (c > 0)
cout << c << endl;
else
cout << "0" << endl;
return 0;
}
| 7 | CPP |
class Sheet1:
def __init__(self, string):
row_col = string[1:].split('C')
self.row = row_col[0]
self.column = row_col[1]
def change(self):
ret = []
num = int(self.column)
while(num > 0):
mod = num % 26
if mod == 0:
num = num // 26 - 1
ret.append('Z')
else:
num = num // 26
ret.append(chr(mod + ord('A') - 1))
ret.reverse()
ret = ''.join(ret)
return ret + self.row
class Sheet2:
def __init__(self, string):
i = 0
while(string[i].isalpha()):
i+=1
self.column = string[:i]
self.row = string[i:]
def change(self):
column = self.column
ret = 0
for c in column:
ret *= 26
ret += ord(c) - ord('A') + 1
return 'R' + self.row + 'C' + str(ret)
n = int(input())
strings = []
while(n):
string = input()
strings.append(string)
n -= 1
for string in strings:
if (string[0]=="R"):
numbers = string[1:].split("C")
if(len(numbers) == 2 and numbers[0].isdigit() and numbers[1].isdigit()):
sheet1 = Sheet1(string)
print(sheet1.change())
else:
sheet2 = Sheet2(string)
print(sheet2.change())
else:
sheet2 = Sheet2(string)
print(sheet2.change()) | 8 | PYTHON3 |
'''input
5
0 1 2 3 4
'''
n = int(input())
c = list(map(int, input().split()))
print(sum([max(c)-x for x in c]))
| 7 | PYTHON3 |
import math
#q=int(input())
q=1
for _ in range(q):
n=int(input())
l=list(map(int,input().split()))
total=sum(l)
if l[0]>(total//2):
print(1)
print(1)
else:
s=l[0]
ans=[1]
for i in range(1,n):
if l[i]<=l[0]//2:
ans.append(i+1)
s+=l[i]
if s>total//2:
print(len(ans))
print(*ans)
else:
print(0)
| 7 | PYTHON3 |
#200B
n = int(input())
p = list(map(int, input().split()))
sum = 0
for i in range(n):
sum = sum + p[i]
sum = sum / n
print(sum) | 8 | PYTHON3 |
t=int(input())
for test in range(t):
s=input()
n=len(s)
oneleft=[0]*n
oneright=[0]*n
zeroleft=[0]*n
zeroright=[0]*n
if s[0]=="1":
zeroleft[0]=1
else:
oneleft[0]=1
if s[-1]=="1":
zeroright[-1]=1
else:
oneright[-1]=1
for i in range(1,n):
if s[i]=="1":
zeroleft[i]=zeroleft[i-1]+1
oneleft[i]=oneleft[i-1]
else:
zeroleft[i]=zeroleft[i-1]
oneleft[i]=oneleft[i-1]+1
for i in range(n-2,-1,-1):
if s[i]=="1":
zeroright[i]=zeroright[i+1]+1
oneright[i]=oneright[i+1]
else:
zeroright[i]=zeroright[i+1]
oneright[i]=oneright[i+1]+1
# print("oneleft,oneright,zeroleft,zeroright",oneleft,oneright,zeroleft,zeroright)
m=min(zeroright[0],oneright[0])
for i in range(n-1):
m=min(m,oneleft[i]+zeroright[i+1],zeroleft[i]+oneright[i+1])
m=min(m,zeroleft[-1],oneleft[-1])
print(m)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
const int inf = (1ll << 31) - 1;
using namespace std;
char c[1000010];
int a[1000010], b[1000010], d[1000010];
bool num(char x) {
if (x >= '0' && x <= '9') return 1;
return 0;
}
bool isLet(char x) {
if (x >= 'a' && x <= 'z') return 1;
return 0;
}
int main() {
scanf("%s", &c);
int n = strlen(c);
for (int i = 0; i < n;) {
int j = i;
while (isLet(c[j]) && j < n) j++;
while (i < j) {
a[i] = j - i;
i++;
}
i = j + 1;
}
for (int i = 0; i < n;) {
int j = i;
while ((isLet(c[j]) || num(c[j])) && j < n) j++;
while (i <= j) {
b[i] = j;
i++;
}
i = j + 1;
}
for (int i = n - 1; i >= 0;) {
int j = i;
while ((isLet(c[j]) || num(c[j]) || c[j] == '_') && j >= 0) j--;
int cnt = 0, x = j + 1;
while (i >= x) {
cnt += isLet(c[x]);
d[x] = cnt;
x++;
}
i = j - 1;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (c[i] == '@') {
int ans1 = 0, ans2 = 0;
if (i > 0) ans1 = d[i - 1];
if (i + 1 < n) {
int j = b[i + 1];
if (j + 1 < n && j != i + 1 && c[j] == '.') {
ans2 = a[j + 1];
}
}
ans += ans1 * 1ll * ans2;
}
}
cout << ans << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, A = 205;
int n;
int a[N];
int cnt[A][N];
vector<int> pos[A];
void reset() {
for (int i = 0; i < A; i++) pos[i].clear();
for (int i = 1; i < A; i++) {
for (int j = 0; j <= n; j++) cnt[i][j] = 0;
}
}
void read() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
}
void solve() {
for (int j = 1; j <= n; j++) {
for (int i = 1; i < A; i++) cnt[i][j] = cnt[i][j - 1];
pos[a[j]].push_back(j);
cnt[a[j]][j]++;
}
int ans = 0;
for (int i = 1; i < A; i++) {
ans = max(ans, (int)pos[i].size());
for (int k = 1; k <= pos[i].size() / 2; k++) {
int l = pos[i][k - 1] + 1;
int r = pos[i][pos[i].size() - k] - 1;
for (int j = 1; j < A && l <= r; j++) {
if (i == j) continue;
int m = cnt[j][r] - cnt[j][l - 1];
ans = max(ans, 2 * k + m);
}
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
read();
reset();
solve();
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
constexpr auto MOD = 1000000007LL;
constexpr auto LINF = (1LL << 60);
constexpr auto INF = 2147483647LL;
constexpr auto PI = 3.1415926535897932384626433;
constexpr auto EPS = 1E-9;
template <typename T1, typename T2>
ostream& operator<<(ostream& out, const pair<T1, T2> p) {
out << p.first << ' ' << p.second;
return out;
}
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& p) {
in >> p.first >> p.second;
return in;
}
template <typename T>
istream& operator>>(istream& in, vector<T> v) {
for (auto& x : v) cin >> x;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
constexpr auto MAXN = 500010;
int n, k, a[MAXN], ord[MAXN], dp[4][5010];
int main() {
ios_base::sync_with_stdio(false);
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i + 1 < n; i++) cerr << a[i + 1] - a[i] << endl;
iota(ord, ord + n, 0);
sort(ord, ord + n - 1, [](int x, int y) {
int i = a[x + 1] - a[x];
int j = a[y + 1] - a[y];
if (i != j) return i < j;
return x < y;
});
for (int i = 0; i < 4; i++)
for (int j = 0; j < 5010; j++) dp[i][j] = MOD;
dp[0][0] = 0;
n = min(k * 4, n - 1);
sort(ord, ord + n);
int res = MOD;
for (int i = 0; i < n; i++) {
int i0 = i % 4;
for (int j = 0; j <= k; j++) {
dp[(i0 + 1) % 4][j] = min(dp[(i0 + 1) % 4][j], dp[i0][j]);
dp[(i0 + 1 + (ord[i] + 1 == ord[i + 1])) % 4][j + 1] =
min(dp[(i0 + 1 + (ord[i] + 1 == ord[i + 1])) % 4][j + 1],
dp[i0][j] + a[ord[i] + 1] - a[ord[i]]);
}
}
for (int i = 0; i < 4; i++) res = min(res, dp[i][k]);
cout << res << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[10];
int main() {
for (int i = 1; i <= 6; i++) cin >> a[i];
cout << (a[1] + a[2] + a[3]) * (a[1] + a[2] + a[3]) - a[1] * a[1] -
a[3] * a[3] - a[5] * a[5];
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y, id[3000001], c = 0, d = 0;
set<pair<int, int>> forbid;
set<int> remain;
inline bool ok(int a, int b) {
if (a > b) swap(a, b);
return forbid.find({a, b}) == forbid.end();
}
void dfs(int i) {
vector<int> memo;
for (int x : remain)
if (ok(x, i)) memo.push_back(x);
for (int x : memo) remain.erase(x);
for (int x : memo) dfs(x);
}
int main() {
scanf("%d%d%d", &n, &m, &k);
d = n - 1;
for (int i = 2; i <= n; i++) remain.insert(i);
for (int i = 0; i < m; i++) {
scanf("%d%d", &x, &y);
if (x > y) swap(x, y);
if (x == 1) d--;
forbid.insert(make_pair(x, y));
}
if (d < k) {
puts("impossible");
return 0;
}
for (int i = 2; i <= n; i++) {
if (ok(1, i) && remain.find(i) != remain.end()) {
dfs(i);
c++;
}
}
if (!remain.empty() || c > k)
puts("impossible");
else
puts("possible");
return 0;
}
| 11 | CPP |
n,k = map(int, input().split())
l=list(map(int, input().split()))
r=0
l2=[]
for x in l:
r+=x
l2.append(r//k)
r=r%k
for x in l2:
print(x,end=" ")
print() | 7 | PYTHON3 |
from collections import Counter
N = int(input())
As = list(map(int, input().split()))
MOD = 10 ** 9 + 7
factorials = [1]
fact_invs = [1]
for i in range(1, N+2):
factorials.append((factorials[-1]*i) % MOD)
fact_invs.append(pow(factorials[-1], MOD-2, MOD))
fact_invs.append(1)
def combi(n, k):
if n < k:
return 0
ret = factorials[n]
ret *= fact_invs[k]
ret %= MOD
ret *= fact_invs[n-k]
return ret % MOD
ct = Counter(As)
mc = ct.most_common(1)[0][0]
L = R = None
for i, a in enumerate(As):
if a == mc:
if L is None:
L = i
else:
R = N - i
for k in range(1, N+2):
print((combi(N+1, k) - combi(L+R, k-1)) % MOD)
| 0 | PYTHON3 |
def input_int():
list(map(int, input().strip().split()))
def main():
n=int(input())
s=input().strip()
j=count=0
for i in range(1, n):
if s[i]==s[j]:
count+=1
j+=1
print(count)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int T, n;
vector<int> s[1234567];
char col[1234567];
int js() {
for (int i = 1; i <= n; ++i)
if (col[i] == 'W') {
int ans = 0;
for (auto g : s[i]) ans += col[g] == 'W';
if (ans >= 2) return 1;
}
for (int i = 1; i <= n; ++i)
if (col[i] == 'B') {
int ans = 0;
for (auto g : s[i]) ans += col[g] == 'B';
if (ans >= 2) return -1;
}
return 0;
}
bool brute(int cur) {
int w = js();
if (w == 1) return 1;
if (w == -1) return 0;
bool poss = 0;
for (int i = 1; i <= n; ++i)
if (col[i] == 'N') {
poss = 1;
if (!cur) {
col[i] = 'W';
if (brute(!cur)) {
col[i] = 'N';
return 1;
}
col[i] = 'N';
} else {
col[i] = 'B';
if (!brute(!cur)) {
col[i] = 'N';
return 0;
}
col[i] = 'N';
}
}
if (!poss) return 0;
return cur;
}
int dep[1234567];
void dfs(int x, int fa = 0) {
dep[x] = dep[fa] + 1;
for (auto b : s[x])
if (b != fa) dfs(b, x);
}
bool sol() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) s[i].clear();
for (int i = 1, a, b; i < n; ++i)
scanf("%d%d", &a, &b), s[a].push_back(b), s[b].push_back(a);
scanf("%s", col + 1);
if (n <= 5) return brute(0);
for (int i = 1; i <= n; ++i)
if (s[i].size() >= 4) return 1;
for (int i = 1; i <= n; ++i)
if (s[i].size() == 3) {
int c2 = 0;
for (auto g : s[i]) c2 += s[g].size() > 1;
if (c2 >= 2) return 1;
}
for (int i = 1; i <= n; ++i)
if (col[i] == 'W') {
if (s[i].size() > 1) return 1;
int g = s[i].front();
if (s[g].size() >= 3) return 1;
}
dfs(1);
int g[2] = {0, 0};
for (int i = 1; i <= n; ++i)
if (col[i] == 'W') g[dep[i] & 1]++;
for (int i = 1; i <= n; ++i)
if (s[i].size() == 3) g[!(dep[i] & 1)]++;
if (g[0] > 1 || g[1] > 1) return 1;
return 0;
}
int main() {
scanf("%d", &T);
while (T--)
if (sol())
puts("White");
else
puts("Draw");
}
| 13 | CPP |
R=lambda:map(int,input().split())
n,s=R()
a=sorted(R())
m=n//2
print(abs(a[m]-s)+sum(max(0,x-s)for x in a[:m])+sum(max(0,s-x)for x in a[m+1:])) | 8 | PYTHON3 |
h = int(input())
hb=bin(h)[2:]
hbn=len(hb)
print((2**hbn-1))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
namespace TYC {
const int N = 100005, M = 17;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
int n, K, answer, Nxt[N], Fa[M][N], G[N], W[N];
long long Pre[N], Suf[N];
vector<int> E[N];
struct node {
long long p, s, v, tag;
void add(const long long t) { s += t, v += t, tag += t; }
} tr[N << 2];
inline int read() {
int x = 0, f = 0, ch = getchar();
while (!isdigit(ch)) f |= (ch == '-'), ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
inline void pushdown(const int o) {
long long t = tr[o].tag;
if (t) {
tr[(o << 1)].add(t);
tr[(o << 1 | 1)].add(t);
tr[o].tag = 0;
}
}
long long calc(const int o, const int l, const int r, const long long x) {
if (l == r) return x + tr[o].p;
int mid = (l + r) >> 1;
pushdown(o);
long long y = tr[(o << 1)].s;
if (x >= y)
return min(x + tr[(o << 1)].p, calc((o << 1 | 1), mid + 1, r, x));
else
return min(calc((o << 1), l, mid, x), tr[o].v);
}
inline void maintain(const int o, const int l, const int r) {
tr[o].s = max(tr[(o << 1)].s, tr[(o << 1 | 1)].s);
tr[o].v = calc((o << 1 | 1), (l + r) / 2 + 1, r, tr[(o << 1)].s);
}
void build(const int o = 1, const int l = 1, const int r = n) {
if (l == r) {
tr[o].p = -Suf[l];
tr[o].s = Suf[l];
return;
}
int mid = (l + r) >> 1;
build((o << 1), l, mid);
build((o << 1 | 1), mid + 1, r);
tr[o].p = min(tr[(o << 1)].p, tr[(o << 1 | 1)].p);
maintain(o, l, r);
}
void add(const int s, const int e, const long long v, const int o = 1,
const int l = 1, const int r = n) {
if (s <= l && r <= e) return tr[o].add(v);
int mid = (l + r) >> 1;
pushdown(o);
if (s <= mid) add(s, e, v, (o << 1), l, mid);
if (e > mid) add(s, e, v, (o << 1 | 1), mid + 1, r);
maintain(o, l, r);
}
int find(const int o, const int l, const int r, const long long x) {
if (l == r) return x + tr[o].p <= K ? l : 0;
int mid = (l + r) >> 1;
pushdown(o);
if (x + tr[(o << 1 | 1)].p <= K)
return find((o << 1 | 1), mid + 1, r, x);
else
return find((o << 1), l, mid, x);
}
int query(const int o = 1, const int l = 1, const int r = n,
const long long x = -INF) {
if (l == r) return tr[o].p + x <= K ? l : 0;
int mid = (l + r) >> 1, p;
pushdown(o);
long long y = tr[(o << 1)].s;
if (x >= y) {
p = query((o << 1 | 1), mid + 1, r, x);
if (!p && x + tr[(o << 1)].p <= K) p = find((o << 1), l, mid, x);
} else {
if (tr[o].v <= K)
p = query((o << 1 | 1), mid + 1, r, y);
else
p = query((o << 1), l, mid, x);
}
return p;
}
void init() {
for (int i = 1; i <= n; i++) {
Pre[i] = Pre[i - 1] + G[i] - W[i];
Suf[i] = Suf[i - 1] + G[i] - W[i - 1];
}
static int sta[N], top;
for (int i = n; i; i--) {
while (top && Pre[i - 1] <= Pre[sta[top] - 1]) top--;
Nxt[i] = top ? sta[top] : n + 1;
sta[++top] = i;
}
for (int i = 1; i <= n; i++) E[Nxt[i]].push_back(i);
Nxt[n + 1] = n + 1;
}
inline int get_ancestor(const int u) {
int x = u;
for (int i = M - 1; ~i; i--)
if (Fa[i][x] && Fa[i][x] != n + 1 && Pre[u - 1] - Pre[Fa[i][x] - 1] <= K)
x = Fa[i][x];
return Fa[0][x];
}
void dfs(const int u) {
for (int i = 1; i < M && Fa[i - 1][u]; i++)
Fa[i][u] = Fa[i - 1][Fa[i - 1][u]];
if (Nxt[u] <= n) add(Nxt[u] - 1, n, Pre[u - 1] - Pre[Nxt[u] - 1]);
if (u <= n) {
int p = get_ancestor(u);
if (p <= n) add(p - 1, n, INF);
if (u != 1) add(1, u - 1, -INF);
answer = max(answer, query() - u + 1);
if (p <= n) add(p - 1, n, -INF);
if (u != 1) add(1, u - 1, INF);
}
for (int v : E[u]) Fa[0][v] = u, dfs(v);
if (u <= n) add(Nxt[u] - 1, n, Pre[Nxt[u] - 1] - Pre[u - 1]);
}
void work() {
n = read(), K = read();
for (int i = 1; i < n; i++) W[i] = read();
for (int i = 1; i <= n; i++) G[i] = read();
init();
build(1, 1, n);
dfs(n + 1);
printf("%d\n", answer);
}
} // namespace TYC
int main() {
TYC::work();
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int d[200005][2];
long long dp[200005][2];
int n;
long long DFS(int x, long long y, int flag, int cnt) {
long long x1, y1;
if (d[x][flag] != -1) {
if (d[x][flag] == cnt)
return 1;
else if (dp[x][flag] == 1)
return 1;
else {
return y - dp[x][flag];
}
}
d[x][flag] = cnt;
if (flag == 0) {
y1 = y + a[x];
x1 = x + a[x];
if (x1 > n || x1 <= 0) {
dp[x][flag] = -a[x];
return y + a[x];
} else if (x1 == 1) {
dp[x][flag] = 1;
return 1;
}
long long tmp = DFS(x1, y1, !flag, cnt);
if (tmp == 1)
dp[x][flag] = 1;
else
dp[x][flag] = y - tmp;
return tmp;
} else {
y1 = y + a[x];
x1 = x - a[x];
if (x1 > n || x1 <= 0) {
dp[x][flag] = -a[x];
return y + a[x];
} else if (x1 == 1) {
dp[x][flag] = 1;
return 1;
}
long long tmp = DFS(x1, y1, !flag, cnt);
if (tmp == 1)
dp[x][flag] = 1;
else
dp[x][flag] = y - tmp;
return tmp;
}
}
int main() {
int i, j, cnt, x;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
scanf("%d", &a[i]);
}
cnt = 1;
memset(d, -1, sizeof(d));
for (i = 2; i <= n; i++) {
DFS(i, 0, 0, cnt);
cnt++;
DFS(i, 0, 1, cnt);
cnt++;
}
for (i = 1; i < n; i++) {
x = i + 1;
if (x > n || x <= 0)
printf("%d\n", a[i]);
else if (dp[x][1] == 1)
printf("-1\n");
else
cout << i - dp[x][1] << endl;
}
return 0;
}
| 8 | CPP |
t = int(input())
for _ in range(t):
a = int(input())
lis = []
for j in range(a):
if j == 0:
sh = list(input())
sh[0] = "7"
sh = list(map(int, sh))
elif j == a-1:
sh = list(input())
sh[-1] = "7"
sh = list(map(int, sh))
else:
sh = list(input())
sh = list(map(int, sh))
lis.append(sh)
# print(lis)
if lis[0][1] == 0 and lis[1][0] == 0 and lis[-1][-2] == 0 and lis[-2][-1] == 0:
print(2)
print("1 2")
print("2 1")
elif lis[0][1] == 1 and lis[1][0] == 0 and lis[-1][-2] == 0 and lis[-2][-1] == 0:
print(1)
print("2 1")
elif lis[0][1] == 0 and lis[1][0] == 1 and lis[-1][-2] == 0 and lis[-2][-1] == 0:
print(1)
print("1 2")
elif lis[0][1] == 1 and lis[1][0] == 1 and lis[-1][-2] == 0 and lis[-2][-1] == 0:
print(0)
elif lis[0][1] == 0 and lis[1][0] == 0 and lis[-1][-2] == 1 and lis[-2][-1] == 1:
print(0)
elif lis[0][1] == 1 and lis[1][0] == 0 and lis[-1][-2] == 1 and lis[-2][-1] == 1:
print(1)
print("1 2")
elif lis[0][1] == 0 and lis[1][0] == 1 and lis[-1][-2] == 1 and lis[-2][-1] == 1:
print(1)
print("2 1")
elif lis[0][1] == 1 and lis[1][0] == 1 and lis[-1][-2] == 1 and lis[-2][-1] == 1:
print(2)
print("1 2")
print("2 1")
elif lis[0][1] == 0 and lis[1][0] == 0 and lis[-1][-2] == 1 and lis[-2][-1] == 0:
print(1)
print("{} {}".format(a-1,a))
elif lis[0][1] == 1 and lis[1][0] == 0 and lis[-1][-2] == 1 and lis[-2][-1] == 0:
print(2)
print("1 2")
print("{} {}".format(a-1,a))
elif lis[0][1] == 0 and lis[1][0] == 1 and lis[-1][-2] == 1 and lis[-2][-1] == 0:
print(2)
print("1 2")
print("{} {}".format(a,a-1))
elif lis[0][1] == 1 and lis[1][0] == 1 and lis[-1][-2] == 1 and lis[-2][-1] == 0:
print(1)
print("{} {}".format(a,a-1))
elif lis[0][1] == 0 and lis[1][0] == 0 and lis[-1][-2] == 0 and lis[-2][-1] == 1:
print(1)
print("{} {}".format(a,a-1))
elif lis[0][1] == 1 and lis[1][0] == 0 and lis[-1][-2] == 0 and lis[-2][-1] == 1:
print(2)
print("1 2")
print("{} {}".format(a,a-1))
elif lis[0][1] == 0 and lis[1][0] == 1 and lis[-1][-2] == 0 and lis[-2][-1] == 1:
print(2)
print("{} {}".format(a,a-1))
print("2 1")
elif lis[0][1] == 1 and lis[1][0] == 1 and lis[-1][-2] == 0 and lis[-2][-1] == 1:
print(1)
print("{} {}".format(a-1,a)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long int bitfun(long long int x) { return (x & (-x)); }
long long int ans = 0;
long long int k, n, m, x, y;
map<tuple<long long int, long long int, long long int>, char> bottle;
map<tuple<long long int, long long int, long long int>, bool> vis;
void bfs(long long int h, long long int l, long long int b) {
bottle[{h, l, b}] = true;
ans++;
if (h < k - 1 && bottle[{h + 1, l, b}] == '.' && vis[{h + 1, l, b}] == 0)
bfs(h + 1, l, b);
if (h > 0 && bottle[{h - 1, l, b}] == '.' && vis[{h - 1, l, b}] == 0)
bfs(h - 1, l, b);
if (l < n - 1 && bottle[{h, l + 1, b}] == '.' && vis[{h, l + 1, b}] == 0)
bfs(h, l + 1, b);
if (l > 0 && bottle[{h, l - 1, b}] == '.' && vis[{h, l - 1, b}] == 0)
bfs(h, l - 1, b);
if (b < m - 1 && bottle[{h, l, b + 1}] == '.' && vis[{h, l, b + 1}] == 0)
bfs(h, l, b + 1);
if (b > 0 && bottle[{h, l, b - 1}] == '.' && vis[{h, l, b - 1}] == 0)
bfs(h, l, b - 1);
}
void solve() {
cin >> k >> n >> m;
for (int i = 0; i < k; i++) {
for (int j = 0; j < n; j++)
for (int x = 0; x < m; x++) {
char y;
cin >> y;
bottle[{i, j, x}] = y;
vis[{i, j, x}] = 0;
}
}
cin >> x >> y;
--x;
--y;
bfs(0, x, y);
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
| 8 | CPP |
###### ### ####### ####### ## # ##### ### #####
# # # # # # # # # # # # # ###
# # # # # # # # # # # # # ###
###### ######### # # # # # # ######### #
###### ######### # # # # # # ######### #
# # # # # # # # # # #### # # #
# # # # # # # ## # # # # #
###### # # ####### ####### # # ##### # # # #
# from __future__ import print_function # for PyPy2
from itertools import permutations as perm
from fractions import Fraction
from collections import *
from sys import stdin
from bisect import *
from heapq import *
# from math import *
g = lambda : stdin.readline().strip()
gl = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1e9)+7
inf = float("inf")
fi = []
t, = gil()
for _ in range(t):
n, = gil()
c = gil()
sme, smo = c[0], c[1]
ans = (sme+smo)*n
base = c[0] + c[1]
for i in range(2, n):
base += c[i]
if i&1:
smo = min(smo, c[i])
else:
sme = min(sme, c[i])
k = i+1
e = n - (k//2) - (k&1)
o = n - (k//2)
# print(k, sme, smo, o, e, base, (base + (e*sme) + (o*smo)))
# o, e = e, o
# print(i+1, base + (a*sm1) + (b*sm2))
ans = min(ans, base + (e*sme) + (o*smo))
# print()
fi.append(str(ans))
print('\n'.join(fi)) | 9 | PYTHON3 |
def main() :
s = input().split('@')
ans = ''
itr = 0
if len(s)<2 or len(s[0])<1 or len(s[-1])<1 :
print("No solution")
return
for i in range(1,len(s)-1) :
if len(s[i]) < 2 :
print("No solution")
return
ans = s[0]+'@'+s[1][0]
for i in range( 1,len(s)-1 ) :
ans += ',' + s[i][1:] + '@' + s[i+1][0]
ans += s[-1][1:]
print(ans)
main()
| 8 | PYTHON3 |
wgt = int(input())
if wgt>2:
if wgt%2==0:
print('YES')
else:
print('NO')
else:
print('NO') | 7 | PYTHON3 |
#!/usr/bin/env python
# coding: utf-8
# In[204]:
# # n = int(input())
# # line = list(map(int, input().split()))
# # line = list(str(input()))
# In[293]:
code = str(input()).lower()
# In[294]:
rm_list = [ "a", "o", "y", "e", "u", "i"]
res = ''
for c in code:
if c not in rm_list:
res += c
# In[295]:
ans = "." + ".".join(res)
print(ans)
# In[ ]:
# In[ ]:
# In[ ]:
# In[ ]:
# In[195]:
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int l = k;
if ((k % 2 == 0 && n % 2) || (n < k)) {
cout << "NO" << endl;
continue;
}
if (n % 2 == 0 && k % 2) {
if (n < 2 * k) {
cout << "NO" << endl;
continue;
}
cout << "YES" << endl;
for (int i = 0; i < k - 1; i++) {
cout << 2 << " ";
}
cout << n - 2 * (l - 1) << endl;
} else {
cout << "YES" << endl;
while (k > 1) {
cout << 1 << " ";
k--;
}
cout << n - (l - 1) << endl;
}
}
return 0;
}
| 8 | CPP |
n,ar,x,y,d=int(input()),input(),'a','a',''
for i in ar:
if i>=x: d+='0';x=i
elif i>=y: d+='1';y=i
else: print("NO");exit()
print("YES"+'\n'+d) | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e6 + 6;
struct node {
int l, r, sum;
} Tree[4 * Maxn];
void build(int l, int r, int ind) {
Tree[ind].l = l, Tree[ind].r = r, Tree[ind].sum = 0;
if (l != r) {
int mid = (l + r) >> 1;
build(l, mid, ((ind) << 1));
build(mid + 1, r, ((ind) << 1 | 1));
}
}
int getAns(int l, int r, int ind) {
int ll = Tree[ind].l, rr = Tree[ind].r;
if (l <= ll && r >= rr) return Tree[ind].sum;
int mid = (ll + rr) >> 1;
int ans1 = 0, ans2 = 0;
if (l <= mid) ans1 = getAns(l, r, ((ind) << 1));
if (r > mid) ans2 = getAns(l, r, ((ind) << 1 | 1));
return ans1 + ans2;
}
void update(int pos, int ind) {
int ll = Tree[ind].l, rr = Tree[ind].r, mid = (ll + rr) >> 1;
if (ll == rr) {
Tree[ind].sum++;
return;
}
if (pos <= mid)
update(pos, ((ind) << 1));
else
update(pos, ((ind) << 1 | 1));
Tree[ind].sum = Tree[((ind) << 1)].sum + Tree[((ind) << 1 | 1)].sum;
}
int n, m, cnt, ans[Maxn], tmp[Maxn];
vector<int> q;
vector<pair<int, int> > query[Maxn];
vector<int> pos[Maxn];
int main() {
build(1, 1e6, 1);
scanf("%d%d", &n, &m);
int l, r;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &l, &r);
pos[l].push_back(r);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &cnt);
for (int j = 1; j <= cnt; j++) {
scanf("%d", &tmp[j]);
q.push_back(tmp[j]);
}
tmp[cnt + 1] = 1e6 + 1;
for (int j = 1; j <= cnt; j++)
query[tmp[j]].push_back(make_pair(i, tmp[j + 1] - 1));
}
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
int pre = 0, sz = q.size();
for (int i = 0; i < sz; i++) {
for (int j = pre + 1; j <= q[i]; j++) {
int ssz = pos[j].size();
for (int k = 0; k < ssz; k++) update(pos[j][k], 1);
}
pre = q[i];
int ssz = query[q[i]].size();
for (int j = 0; j < ssz; j++)
ans[query[q[i]][j].first] += getAns(q[i], query[q[i]][j].second, 1);
}
for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
#pragma optimize("Ofast")
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 1; i <= n / 2; ++i) cout << i << ' ' << n - i + 1 << ' ';
if (n & 1) cout << n / 2 + 1 << "\n";
return 0;
}
| 9 | CPP |
n,c = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
word = 1
for i in range(1,n):
if t[i]-t[i-1]<= c:
word+=1
else:
word = 1
print(word) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long primes[1000001];
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void sieveOfEratosthenes(long long N) {
N += 2;
primes[1] = 1;
for (long long i = 2; i < N; i++) primes[i] = i;
for (long long i = 4; i < N; i += 2) primes[i] = 2;
for (long long i = 3; i * i < N; i++) {
if (primes[i] == i) {
for (long long j = i * i; j < N; j += i)
if (primes[j] == j) primes[j] = i;
}
}
}
long long findPrimeFactors(long long num) {
long long c = 0;
sieveOfEratosthenes(num);
long long factor;
while (num != 1) {
factor = primes[num];
c++;
num /= factor;
}
return c;
}
bool find(vector<long long> v, long long start, long long end,
long long value) {
if (start > end) return false;
long long mid = (start + end) / 2;
if (v[mid] == value) return true;
if (v[mid] < value)
return find(v, mid + 1, end, value);
else
return find(v, start, mid - 1, value);
return false;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
long i, j, k, n, t;
string s;
cin >> t;
while (t--) {
cin >> n;
cin >> s;
i = 0;
j = n - 1;
while (s[i] == '?') {
i++;
}
for (k = i - 1; k >= 0; k--) {
if (k + 1 < n && s[k + 1] == 'R') {
s[k] = 'B';
} else {
s[k] = 'R';
}
}
while (s[j] == '?') {
j--;
}
for (k = j + 1; k < n; k++) {
if (k - 1 >= 0 && s[k - 1] == 'R')
s[k] = 'B';
else
s[k] = 'R';
}
for (k = i; k <= j; k++) {
if (s[k] == '?') {
if (s[k - 1] == 'R')
s[k] = 'B';
else
s[k] = 'R';
}
}
cout << s << "\n";
}
}
| 8 | CPP |
# -*- coding: utf-8 -*-
import sys
import os
s = input().strip()
S1 = [] # sum of pond
S2 = [] # each pond
area = 0
for i, c in enumerate(s):
if c == '\\':
S1.append(i)
elif c == '_':
pass
elif c == '/' and S1:
j = S1.pop(-1)
area += i - j
# for each pond
# ?????????????????????????????´???, pond?????±??????????????????
pond_sum = i - j # ???????????????????????¢???
while S2 and S2[-1][0] > j:
pond_sum += S2[-1][1]
S2.pop(-1)
S2.append([j, pond_sum])
pond_areas = []
for data in S2:
pond_areas.append(data[1])
# answer
print(area)
print(len(pond_areas), *pond_areas) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int di[] = {0, -1, 0, 1, -1, 1, -1, 1};
int dj[] = {-1, 0, 1, 0, 1, -1, -1, 1};
int MOD = 1e9 + 7;
int const N = 2e5 + 10;
int a[N], n, m;
bool valid(long long x) {
long long s = 0;
int c = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
if (cnt == x) c++, cnt = 0;
if (a[i] - c > 0)
s += a[i] - c;
else
break;
cnt++;
}
return s >= m;
}
long long solv() {
long long st = 1, ed = 1e6;
long long ans = -1;
while (st <= ed) {
long long mid = (st + ed) / 2;
if (valid(mid))
ans = mid, ed = mid - 1;
else
st = mid + 1;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n, greater<int>());
cout << solv();
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void debug(string S = "hello ! debug") {
cout << S << endl;
return;
}
template <class T>
void printVector(vector<T> &V) {
cout << endl;
for (int i = 0; i < V.size(); ++i) {
cout << V[i] << " ";
}
cout << endl;
return;
}
long long int sizeOfSt(long long int N) {
long long int x = (long long int)(ceil(log2(N)));
long long int max_size = 2 * (long long int)pow(2, x) - 1;
return max_size;
}
template <class T>
T maximumFromVector(vector<T> &V) {
T ans = V[0];
for (int i = 1; i < V.size(); ++i) {
ans = max(ans, V[i]);
}
return ans;
}
template <class T>
T minimumFromVector(vector<T> &V) {
T ans = V[0];
for (int i = 1; i < V.size(); ++i) {
ans = min(ans, V[i]);
}
return ans;
}
template <class T>
T vectorSum(vector<T> &V) {
T sum = 0;
for (long long int i = 0; i < V.size(); ++i) {
sum += V[i];
}
return sum;
}
int main() {
long long int n;
scanf("%lld", &n);
string S;
cin >> S;
long long int ans = S.length();
for (long long int i = 0; i < S.length() - 1; ++i) {
if (S[i] != S[i + 1]) {
--ans;
++i;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
int w,h,n;
cin>>w>>h>>n;
int x[n],y[n],a[n];
int b=0,c=w,d=0,e=h;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i]>>a[i];
if(a[i]==1)b=max(x[i],b);
else if(a[i]==2)c=min(x[i],c);
else if(a[i]==3)d=max(y[i],d);
else e=min(y[i],e);
}
if(b>=c || d>=e) cout<<0<<endl;
else cout<<(c-b)*(e-d)<<endl;
} | 0 | CPP |
n = int(input())
s = input()
arr = [0,0,0,0,0,0,0,0,0,0]
for i in range(n):
try:
arr[int(s[i])] = 0
except:
if s[i] =='L':
for j in range(len(arr)):
if arr[j] == 0:
arr[j] = 1
break
elif s[i] == 'R':
for j in reversed(range(len(arr))):
if arr[j] == 0:
arr[j] = 1
break
for _ in range(len(arr)):
print(arr[_],end='') | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.