solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
while True:
a = input()
if a == "0":
break
print(sum([int(a[i]) for i in range(len(a))])) | 0 | PYTHON3 |
s,v,n=input(),0,0
for i in s:
if i.lower()==i:n+=1
else:v+=1
if v>n:print(s.upper())
else: print(s.lower())
| 7 | PYTHON3 |
class DSU:
def __init__(self, length): self.length = length; self.parent = [-1] * self.length # O(log(n))
def getParent(self, node, start): # O(log(n))
if node >= self.length: return False
if self.parent[node] < 0:
if start != node: self.parent[start] = node
return node
return self.getParent(self.parent[node], start)
def union(self, node1, node2): # O(log(n))
parent1 = self.getParent(node1, node1); parent2 = self.getParent(node2, node2)
if parent1 == parent2: return False
elif self.parent[parent1] <= self.parent[parent2]: self.parent[parent1] += self.parent[parent2]; self.parent[parent2] = parent1
else: self.parent[parent2] += self.parent[parent1]; self.parent[parent1] = parent2
return True
def getCount(self, node): return -self.parent[self.getParent(node, node)] # O(log(n))
def solve(n, lst):
dsu = DSU(n)
for i in range(n):
dsu.union(i, lst[i] - 1)
for i in lst:
print(dsu.getCount(i - 1), end=" ")
for _ in range(int(input())):
n = int(input())
lst = list(map(int, input().split()))
solve(n, lst)
print()
| 8 | PYTHON3 |
for t in range(int(input())):
num1,num2 = map(int,input().split())
print(int(((num1*num2)+1)/2))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int inf = (int)1e9;
const double PI = acos(-1.0);
using namespace std;
int a[1000];
int main() {
int n, m, k, l;
cin >> n >> m;
vector<int> v;
vector<string> v2;
string s;
int a[m];
map<string, int> maap;
for (int i = 0; i < n; ++i) {
cin >> k;
v.push_back(k);
}
sort(v.begin(), v.end());
for (int i = 0; i < m; ++i) {
cin >> s;
maap[s]++;
v2.push_back(s);
}
vector<int> v3;
sort(v2.begin(), v2.end());
for (int i = 0; i < m; ++i) {
if (v2[i] == v2[i - 1])
continue;
else
v3.push_back(maap[v2[i]]);
}
sort(v3.begin(), v3.end());
int sum1 = 0, sum2 = 0;
for (int i = 0; i < v3.size(); ++i) {
sum1 += v3[v3.size() - 1 - i] * v[i];
sum2 += v[v.size() - 1 - i] * v3[v3.size() - 1 - i];
}
cout << sum1 << " " << sum2 << endl;
return 0;
}
| 9 | CPP |
n = int(input())
res = []
i = 0
for x in range(n):
res.append('NO')
a = int(input())
for y in range(34):
for z in range(34):
if(y*7 + z*3 == a):
res[x] = 'YES'
break
for x in res:
print(x) | 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
print(['EASY','HARD'][1 in a]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char b,a;
cin >> b;
if(b=='A')a='T';
if(b=='C')a='G';
if(b=='G')a='C';
if(b=='T')a='A';
cout << a << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int TMXN = 1e6 * 4 + 1;
const long long INFL = 1e18;
const int MOD = 1e9 + 7;
int n;
int p[N], used[N];
vector<pair<int, int> > ar;
int cnt;
int main() {
scanf("%d", &n);
for (int i = 3; i <= n; i += 2) {
if (!p[i]) {
vector<int> v;
for (int j = i; j <= n; j += i) {
p[j] = 1;
if (!used[j]) {
v.push_back(j);
}
}
if (v.size() % 2) {
swap(v[0], v[1]);
for (int j = 1; j < v.size() - 1; j += 2) {
ar.push_back(make_pair(v[j], v[j + 1]));
used[v[j]] = 1;
used[v[j + 1]] = 1;
}
} else {
for (int j = 1; j < v.size(); j += 2) {
ar.push_back(make_pair(v[j], v[j - 1]));
used[v[j]] = 1;
used[v[j - 1]] = 1;
}
}
}
}
vector<int> second;
for (int i = 2; i <= n; i += 2) {
if (!used[i]) {
second.push_back(i);
}
}
for (int i = 1; i < second.size(); i += 2) {
ar.push_back(make_pair(second[i], second[i - 1]));
}
cout << ar.size() << '\n';
for (int i = 0; i < ar.size(); i++) {
cout << ar[i].first << ' ' << ar[i].second << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int f(int x) {
int r = x;
while (x != 0) r += x % 10, x /= 10;
return r;
}
int main() {
int n;
scanf("%d", &n);
vector<int> r;
for (int i = max(n - 100, 0); i < n; ++i)
if (f(i) == n) r.push_back(i);
printf("%d\n", r.size());
for (int i : r) printf("%d\n", i);
}
| 7 | CPP |
n=int(input())
z=""
list1=[]
fib1=1
list1.append(fib1)
fib2=1
list1.append(fib2)
for i in range(2,n+1):
fib3=fib1+fib2
list1.append(fib3)
fib1=fib2
fib2=fib3
for i in range(1,n+1):
if(i in list1):
z=z+"O"
else:
z=z+"o"
print(z)
| 7 | PYTHON3 |
import math
from decimal import Decimal
def na():
n = int(input())
b = [int(x) for x in input().split()]
return n,b
def nab():
n = int(input())
b = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]
return n,b,c
def dv():
n, m = map(int, input().split())
return n,m
def dva():
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
return n,m,b
def eratosthenes(n):
sieve = list(range(n + 1))
for i in sieve:
if i > 1:
for j in range(i + i, len(sieve), i):
sieve[j] = 0
return sorted(set(sieve))
def nm():
n = int(input())
b = [int(x) for x in input().split()]
m = int(input())
c = [int(x) for x in input().split()]
return n,b,m,c
def dvs():
n = int(input())
m = int(input())
return n, m
d = {}
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * (n + 1)
for i in a:
d[i] = d.get(i,0) + 1
b[i] = 1
if sum(b) != n:
print(0)
exit()
print(min(d.values()))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long getint() {
long long v = 0, sign = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
v = v * 10 + ch - '0';
ch = getchar();
}
return v * sign;
}
const int N = 100010, INF = ~0u >> 2;
priority_queue<pair<int, int> > H;
long long a[N], d[N], data[25], z;
int n, m, k, x, y, L, ed[25], f[N * 20], c[N];
bool b[N];
void add() {
z = getint();
data[++L] = z / k;
ed[L] = z % k;
int h = 0, t = 0;
for (int i = 0; i < k; ++i) f[++t] = i;
while (h < t) {
x = f[++h], b[x] = 0;
for (int i = 1; i <= L; ++i) {
y = x + ed[i], z = d[x] + data[i];
if (y >= k) y -= k, z++;
if (z < d[y]) {
d[y] = z;
if (!b[y]) b[y] = 1, f[++t] = y;
}
}
}
while (!H.empty()) H.pop();
for (int i = 1; i <= n; ++i)
if (d[a[i] % k] <= a[i] / k && c[i]) H.push(make_pair(c[i], -i));
}
void dec() {
x = getint();
y = getint();
c[x] -= y;
if (d[a[x] % k] <= a[x] / k) H.push(make_pair(c[x], -x));
}
void pop() {
while (1) {
if (H.empty()) {
puts("0");
return;
}
pair<int, int> o = H.top();
H.pop();
x = -o.second, y = o.first;
if (c[x] == y) {
printf("%d\n", y), c[x] = 0;
return;
}
}
}
int main() {
getint();
n = getint();
m = getint();
k = getint();
memset(d, 1, sizeof d);
d[1] = 0;
for (int i = 1; i <= n; ++i) {
a[i] = getint();
c[i] = getint();
if (a[i] % k == 1) H.push(make_pair(c[i], -i));
}
int ch;
for (int i = 1; i <= m; ++i) {
ch = getint();
if (ch == 1)
add();
else if (ch == 2)
dec();
else
pop();
}
return 0;
}
| 9 | CPP |
#include<iostream>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
long long mn=a*(n-1)+b,mx=b*(n-1)+a;
cout<<((a>b||(n==1&&a!=b))?0:mx-mn+1);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int r[100005], r2[100006];
int main() {
long long int a, b, c, d, e, f, g, h, i, j, k;
vector<int> v;
while (cin >> a) {
for (b = 1; b <= a; b++) {
cin >> c;
v.push_back(c);
}
sort(v.begin(), v.end());
d = a / 2.;
e = 0;
f = 0;
for (g = 0; g < d; g++) {
e += v[g];
}
for (g = d; g < a; g++) {
f += v[g];
}
long long int zz = (f * f) + (e * e);
cout << zz << endl;
v.clear();
}
return 0;
}
| 8 | CPP |
import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
mini = 0
maxi = max(A)
while maxi - mini > 1:
mid = (maxi+mini)//2
s = sum(math.ceil(a/mid)-1 for a in A)
if s>K:
mini = mid
else:
maxi = mid
print(mini+1) | 0 | PYTHON3 |
def solve():
return
n = int(input())
ans = 0
while n > 0:
arr = list(map(int, input().split()))
if sum(arr) >= 2:
ans += 1
n -= 1
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int q, r, n, minp[1000001], pri[1000001], cnt;
int f[1000001][22], sum[1000001][22];
bool vis[1000001];
const int mod = 1e9 + 7;
inline int rd() {
int x = 0, f = 1;
char c = ' ';
while (c < '0' || c > '9') f = c == '-' ? -1 : 1, c = getchar();
while (c <= '9' && c >= '0') x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline void pre() {
for (int i = 2; i < 1000001; i++) {
if (!vis[i]) pri[++cnt] = i, minp[i] = i;
for (int j = 1; j <= cnt && i * pri[j] < 1000001; j++) {
vis[i * pri[j]] = 1;
minp[i * pri[j]] = pri[j];
if (i % pri[j] == 0) break;
}
}
}
int main() {
q = rd();
pre();
f[0][0] = sum[0][0] = 1;
for (int i = 1; i < 22; i++) f[0][i] = 2, sum[0][i] = sum[0][i - 1] + f[0][i];
for (int i = 1; i < 1000001; i++) {
for (int j = 0; j < 22; j++) f[i][j] = sum[i - 1][j];
sum[i][0] = f[i][0];
for (int j = 1; j < 22; j++) sum[i][j] = (sum[i][j - 1] + f[i][j]) % mod;
}
while (q--) {
r = rd();
n = rd();
long long ans = 1;
while (n > 1) {
int t = minp[n], j = 0;
while (n % t == 0) n /= t, j++;
(ans *= f[r][j]) %= mod;
}
printf("%lld\n", ans);
}
return 0;
}
| 11 | CPP |
import math
n,m,a=map(int, input().split())
x=n/a
x=math.ceil(x)
y=m/a
y=math.ceil(y)
N=x*y
if N==type(int):
print(N)
else:
print(math.ceil(N))
| 7 | PYTHON3 |
import collections
import math
from math import gcd
def main():
from sys import stdin, stdout
def read():
return stdin.readline().rstrip('\n')
def read_array(sep=None, maxsplit=-1):
return read().split(sep, maxsplit)
def read_int():
return int(read())
def read_int_array(sep=None, maxsplit=-1):
return [int(a) for a in read_array(sep, maxsplit)]
def write(*args, **kwargs):
sep = kwargs.get('sep', ' ')
end = kwargs.get('end', '\n')
stdout.write(sep.join(str(a) for a in args) + end)
def write_array(array, **kwargs):
sep = kwargs.get('sep', ' ')
end = kwargs.get('end', '\n')
stdout.write(sep.join(str(a) for a in array) + end)
def list_factors(x):
floor = math.floor(math.sqrt(x))
lower_side = []
higher_side = []
for i in range(1, floor + 1):
if x % i == 0:
lower_side.append(i)
higher_side.append(x // i)
if lower_side[-1] == higher_side[-1]:
higher_side.pop()
return lower_side + higher_side[::-1]
n, m = read_int_array()
if m == n * (n-1) // 2:
write("Yes")
return
lines = collections.defaultdict(set)
for _ in range(m):
a, b = read_int_array()
if a > b:
a, b = b, a
d = min(b-a, ((a-b) + n) % n)
lines[d].add((a-1, b-1))
if all(len(d_set) == n for d_set in lines.values()):
write("Yes")
return
for i in range(2, n):
if n % i == 0:
win = True
for line_set in lines.values():
for a, b in line_set:
a, b = (a + i) % n, (b + i) % n
if a > b:
a, b = b, a
if (a, b) not in line_set:
win = False
break
if not win:
break
else:
write("Yes")
return
write("No")
main()
| 8 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
li=[]
for i in range(2,int(n**0.5)+1):
if n%i==0:
li.append(i)
if len(li)==0:
print(1,n-1)
else:
print(n//min(li),n-(n//min(li))) | 8 | PYTHON3 |
n=int(input())
s=input()
answer=''
a=s
if n%2!=0:
answer+=s[0]
for i in range(1,n-1,2):
answer=s[i]+answer+s[i+1]
else:
for i in range(1,n,2):
answer=s[i-1]+answer+s[i]
print(answer)
''' logva=volga
abba=baba'''
| 8 | PYTHON3 |
s = input()
x = "hello"
b = 0
for i in range(len(s)):
if b < 5:
if (x[b] == s[i]):
b += 1
else:
break
if b == 5:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def segfunc(x, y):
# 求めたい値を算出するためのロジックを書く
return max(x, y)
class SegmentTree:
# ide_ele は単位元。初期値
def __init__(self, init_val, ide_ele):
self.n = len(init_val)
self.ide_ele = ide_ele
self.num = 2 ** (self.n - 1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
for i in range(self.n):
self.seg[i + self.num - 1] = init_val[i]
for i in range(self.num - 2, -1, -1):
self.seg[i] = segfunc(self.seg[2 * i + 1], self.seg[2 * i + 2])
# 0-indexed
def update(self, k, x):
k += self.num - 1
self.seg[k] = x
while k:
k = (k - 1) // 2
self.seg[k] = segfunc(self.seg[k * 2 + 1], self.seg[k * 2 + 2])
# 0-indexed
# 半開区間 pからq - 1 までが担当範囲
# [p, q)
def query(self, p, q):
if q <= p:
return self.ide_ele
p += self.num - 1
q += self.num - 2
res = self.ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, self.seg[p])
if q & 1 == 1:
res = segfunc(res, self.seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, self.seg[p])
else:
res = segfunc(segfunc(res, self.seg[p]), self.seg[q])
return res
def main():
N, K = [int(x) for x in input().split()]
A = [int(input()) for _ in range(N)]
init_val = [0] * 300002
s = SegmentTree(init_val, 0)
ma = max(A)
for a in A:
ans = s.query(max(0, a - K), min(ma, a + K) + 1)
s.update(a, ans + 1)
print(s.query(0, ma + 1))
if __name__ == '__main__':
main()
| 0 | PYTHON3 |
n=int(input())
t=0
maxx=0
for i in range(n):
s=list(map(int,input().split()))
t-=s[0]
t+=s[1]
if t>maxx:
maxx=t
print(maxx) | 7 | PYTHON3 |
t = int(input())
for i in range(t):
a,b,c,d=map(int,input().split())
if(a<=b):
print(b)
continue
else:
if(c<=d):
print("-1")
continue
else:
sum = 0
r = 0
sum=sum+b
r=r+b
m=a-sum
e=c-d
if(m%e==0):
z=int(m/e)
else:
z=int(m/e)+1
r=r+z*c
sum=sum+z*e
if(sum>=a):
print(r)
else:
print("-1")
| 7 | PYTHON3 |
# template begins
#####################################
from io import BytesIO, IOBase
import sys
import math
import os
from collections import defaultdict
from math import ceil
from bisect import bisect_left, bisect_left
from time import perf_counter
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
def mint(): return map(int, input().split())
def mfloat(): return map(float, input().split())
def intin(): return int(input())
#####################################
# template ends
# Use the recursion snippet if heavy recursion is needed (depth>1000)
def solve():
n = intin()
s = input()
forward_jumps = [0]*n
backward_jumps = [0]*n
sheeps = 0
cost = 0
for i in range(n):
if s[i]=='*':sheeps+=1
else:cost += sheeps
forward_jumps[i]=cost
sheeps = 0
cost = 0
for i in range(n-1, -1, -1):
if s[i]=='*':sheeps+=1
else:cost += sheeps
backward_jumps[i]=cost
print(min(i+j for i,j in zip(forward_jumps, backward_jumps)))
def main():
t = int(input())
# t = 1
for _ in range(t):
solve()
if __name__ == "__main__":
main()
| 11 | PYTHON3 |
a=[int(x) for x in input().split("+")]
a.sort()
print("+".join([str(x) for x in a])) | 7 | PYTHON3 |
n=int(input())
l=[]
for i in range(n):
s=input()
l.append(s)
if len(set(l))==1:
print(s)
else:
a=list(set(l))
x=l.count(a[0])
y=l.count(a[1])
if x>y:
print(a[0])
else:
print(a[1]) | 7 | PYTHON3 |
vals = [ int(x) for x in input().split()]
d = vals[0]
sumTime = vals[1]
minMaxTimePerDay = []
minSumTime = 0
maxSumTime = 0
for _ in range(d):
timesPerDay = [int(x) for x in input().split()]
minMaxTimePerDay.append(timesPerDay)
minSumTime += timesPerDay[0]
maxSumTime += timesPerDay[1]
if sumTime < minSumTime or sumTime > maxSumTime:
print("NO")
else:
print("YES")
timePerDay = []
remainingTime = sumTime
for i in range(d):
timePerDay.append(minMaxTimePerDay[i][0])
remainingTime -= timePerDay[i]
i = 0
while remainingTime > 0:
addedTime = min(remainingTime, minMaxTimePerDay[i][1] - minMaxTimePerDay[i][0])
timePerDay[i] += addedTime
remainingTime -= addedTime
i += 1
print(" ".join([str(time) for time in timePerDay])) | 8 | PYTHON3 |
/**
* Libraries
*/
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
using lli = long long int;
const int INF = 1000000007;
const int FULL_SERACH_ORDERS = 10;
struct order {
int id, dstV;
int time;
bool operator<(const order x) const {
return this->dstV < x.dstV;
}
};
int dist[400][400];
int nextPath[400][400]; // 経路復元用
int T;
int dstList[FULL_SERACH_ORDERS + 1];
vector<order> orderList; // 順序は保証できないかも
vector<order> waitingList;
lli calcScore(int t, int car, const order& o) {
lli deliveredTime = dist[car][o.dstV] + t;
lli waitingTime = deliveredTime - o.time;
return T * T - waitingTime * waitingTime;
}
void updateDstList(int t, int car) {
int orderNum = orderList.size();
if (orderNum == 0) {
dstList[0] = 0;
return;
}
int olistSize = min(FULL_SERACH_ORDERS, orderNum);
sort(orderList.begin(), orderList.end());
vector<order> olist(olistSize);
copy(orderList.begin(), orderList.begin() + olistSize, olist.begin());
lli maxScore = -1 * INF;
do {
lli score = 0l;
for (order o: olist) {
score += calcScore(t, car, o);
t += dist[car][o.dstV];
car = o.dstV;
}
if (maxScore < score) {
maxScore = score;
for (int i = 0; i < olistSize; i++) {
dstList[i] = olist[i].dstV;
}
}
} while (next_permutation(olist.begin(), olist.end()));
dstList[olistSize] = 0;
}
signed main() {
int V, E; cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
dist[i][j] = i == j ? 0 : INF;
nextPath[i][j] = j;
}
}
for (int i = 0; i < E; i++) {
int u, v, d; cin >> u >> v >> d; u--; v--;
dist[u][v] = d;
dist[v][u] = d;
}
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
nextPath[i][j] = nextPath[i][k];
}
}
}
}
cin >> T;
int car = 0;
int skipTo = 0;
int dstV = 0, gotoV = 0;
int dstListIndex = 0;
for (int t = 0; t < T; t++) {
// cout << "time: " << t << endl;
int N; cin >> N;
vector<order> orders(N);
for (order o: orders) {
cin >> o.id >> o.dstV; o.dstV--; o.time = t;
waitingList.push_back(o);
}
// 辺上を移動する
// cout << "moving on edge: " << endl;
if (t < skipTo) {
cout << gotoV + 1 << endl; // move w
continue;
} else if (skipTo == t) {
skipTo = -1;
car = gotoV;
}
// 積荷回収
// cout << "salvage: " << endl;
if (car == 0) {
for (order o: waitingList) {
orderList.push_back(o);
}
waitingList.clear();
updateDstList(t, car);
dstListIndex = 0;
} else if (car == dstV) {
auto result = remove_if(orderList.begin(), orderList.end(),
[=](order o) { return o.dstV == car; });
orderList.erase(result, orderList.end());
dstListIndex++;
}
// 目的地更新
// cout << "arrive[having orders: " << orderList.size() << "]: " << endl;
dstV = dstList[dstListIndex];
// 短期目的地更新
// cout << "get destination(" << dstV << "): " << endl;
gotoV = nextPath[car][dstV];
skipTo = t + dist[car][gotoV];
// 意思決定
// cout << "detect command: " << endl;
if (gotoV == car) {
cout << -1 << endl; // stay
} else {
cout << gotoV + 1 << endl; // move w
}
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
class MCMF {
public:
struct Edge {
int from, to, cap, flow;
int cost;
Edge(int from, int to, int cap, int flow, int cost)
: from(from), to(to), cap(cap), flow(flow), cost(cost) {}
Edge() {}
} e[100005];
int head[1005], nxt[100005], a[1005], p[1005];
bool inq[1005];
int d[1005];
int cnt, s, t;
int node;
int n;
char str[105];
int b[105];
int num[30];
void init(int n) {
cnt = 0;
this->n = n;
}
void addEdge(int from, int to, int cap, int cost) {
e[cnt] = Edge(from, to, cap, 0, cost);
int tmp = head[from];
head[from] = cnt;
nxt[cnt++] = tmp;
e[cnt] = Edge(to, from, 0, 0, -cost);
tmp = head[to];
head[to] = cnt;
nxt[cnt++] = tmp;
}
bool spfa(int &flow, int &cost) {
for (int i = 0; i <= node; i++) {
d[i] = 0x3f3f3f3f;
inq[i] = false;
}
d[s] = 0, inq[s] = true, p[s] = 0, a[s] = 0x3f3f3f3f;
queue<int> q;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
inq[u] = false;
for (int i = head[u]; ~i; i = nxt[i]) {
Edge &ed = e[i];
if (ed.cap > ed.flow && d[ed.to] > d[u] + ed.cost) {
d[ed.to] = d[u] + ed.cost;
p[ed.to] = i;
a[ed.to] = min(a[u], ed.cap - ed.flow);
if (!inq[ed.to]) {
inq[ed.to] = true;
q.push(ed.to);
}
}
}
}
if (d[t] == 0x3f3f3f3f) return false;
flow += a[t];
cost += d[t] * a[t];
int u = t;
while (u != s) {
e[p[u]].flow += a[t];
e[p[u] ^ 1].flow -= a[t];
u = e[p[u]].from;
}
return true;
}
int maxFlow() {
int flow = 0;
int cost = 0;
while (spfa(flow, cost))
;
return cost;
}
void buildGraph() {
memset(head, -1, sizeof(head));
s = 0;
t = 26 + n / 2 + 1;
node = t;
for (int i = 1; i <= 26; i++) addEdge(s, i, num[i], 0);
for (int i = 1; i <= 26; i++) {
for (int j = 1; j <= n / 2; j++) {
if (str[j] == (i + 'a' - 1) || str[n - j + 1] == (i + 'a' - 1)) {
if (str[j] == str[n - j + 1])
addEdge(i, j + 26, 1, -max(b[j], b[n - j + 1]));
else {
if (str[j] == (i + 'a' - 1))
addEdge(i, j + 26, 1, -b[j]);
else
addEdge(i, j + 26, 1, -b[n - j + 1]);
}
} else
addEdge(i, j + 26, 1, 0);
}
}
for (int i = 1; i <= n / 2; i++) addEdge(i + 26, t, 2, 0);
}
void solve() {
scanf("%s", str + 1);
for (int i = 1; i <= n; i++) num[str[i] - 'a' + 1]++;
for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
buildGraph();
int ans = maxFlow();
printf("%d\n", -ans);
}
} mcmf;
int main() {
int n;
scanf("%d", &n);
mcmf.init(n);
mcmf.solve();
return 0;
}
| 12 | CPP |
n = int(input())
print(sum([int(p) for p in input().split()]) / n) | 8 | PYTHON3 |
def coloring(n,a,b,c):
pool = a+b+c
stack = [a[0]]
j,k,l =1,1,1
for i in range(1,n):
if len(stack)==(n-1):
if stack[0]==a[i]:j = 0
elif stack[0]==b[i]:k =0
elif stack[0]==c[i]:l=0
if len(stack)==n:return stack
if stack[-1]!=a[i] and j:stack.append(a[i])
elif stack[-1]!=b[i] and k:stack.append(b[i])
elif stack[-1]!=c[i] and l:stack.append(c[i])
return stack
if __name__ == '__main__':
n = int(input())
res = []
for i in range(n):
p = int(input())
num1= list(map(int, input().split()))
num2= list(map(int, input().split()))
num3= list(map(int, input().split()))
res.append(coloring(p,num1,num2,num3))
# #
for j in res:
print(*j) | 7 | PYTHON3 |
s = input()
a = []
ans = len(s)
for i in s:
if i=='S':
a.append(1)
elif len(a)!=0:
a.pop()
ans -= 2
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rread(T& num) {
num = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') num = num * 10 + ch - '0', ch = getchar();
num *= f;
}
inline int getgcd(int x, int y) {
if (!x) return y;
return getgcd(y % x, x);
}
inline long long getlcm(int x, int y) {
return (long long)x / getgcd(x, y) * y;
}
inline long long getgcd(long long x, long long y) {
if (!x) return y;
return getgcd(y % x, x);
}
inline long long getlcm(long long x, long long y) {
return x / getgcd(x, y) * y;
}
inline int power(int x, int k, int p) {
int res = 1;
for (; k; k >>= 1, x = (long long)x * x % p)
if (k & 1) res = (long long)res * x % p;
return res;
}
const int maxn = 1005;
bool flag1 = 0, flag2 = 0;
int a, b, c, d, n, k, q[maxn];
vector<int> ans1, ans2;
bool vis[maxn];
inline bool check() {
for (int(i) = (1); (i) < (ans1.size()); (i)++)
if ((ans1[i] == a && ans1[i - 1] == b) ||
(ans1[i] == b && ans1[i - 1] == a) ||
(ans1[i] == c && ans1[i - 1] == d) ||
(ans1[i] == d && ans1[i - 1] == c))
return 0;
for (int(i) = (1); (i) < (ans2.size()); (i)++)
if ((ans2[i] == a && ans2[i - 1] == b) ||
(ans2[i] == b && ans2[i - 1] == a) ||
(ans2[i] == c && ans2[i - 1] == d) ||
(ans2[i] == d && ans2[i - 1] == c))
return 0;
return 1;
}
inline void print() {
if (!check()) {
puts("-1");
return;
}
if (flag1) reverse(ans1.begin(), ans1.end());
if (flag2) reverse(ans2.begin(), ans2.end());
for (int(i) = (0); (i) < (ans1.size()); (i)++) printf("%d ", ans1[i]);
puts("");
for (int(i) = (0); (i) < (ans2.size()); (i)++) printf("%d ", ans2[i]);
puts("");
}
int main() {
rread(n);
rread(k);
rread(a);
rread(b);
if (a > b) swap(a, b), flag1 ^= 1;
rread(c);
rread(d);
if (c > d) swap(c, d), flag2 ^= 1;
if (a == c && b == d) {
ans1.push_back(a);
for (int(i) = (1); (i) <= (n); (i)++)
if (i != a && i != b) ans1.push_back(i);
ans1.push_back(b);
ans2 = ans1;
print();
return 0;
}
if (k == n - 1) {
puts("-1");
return 0;
}
if (a == c || b == d) {
if (b == d) {
swap(a, b);
flag1 ^= 1;
swap(c, d);
flag2 ^= 1;
}
vis[a] = vis[b] = vis[d] = 1;
ans1.push_back(a);
ans2.push_back(a);
bool gettmp = 0;
for (int(i) = (1); (i) <= (n); (i)++)
if (!vis[i]) {
ans1.push_back(i);
ans2.push_back(i);
if (!gettmp) {
ans1.push_back(d);
ans2.push_back(b);
gettmp = 1;
}
}
ans1.push_back(b);
ans2.push_back(d);
print();
return 0;
}
if (k == n) {
puts("-1");
return 0;
}
int tot = 0;
q[++tot] = a;
q[++tot] = b;
q[++tot] = c;
q[++tot] = d;
vis[a] = vis[b] = vis[c] = vis[d] = 1;
for (int(i) = (1); (i) <= (n); (i)++)
if (!vis[i]) q[++tot] = i;
ans1.push_back(a);
ans1.push_back(c);
for (int(i) = (5); (i) <= (n); (i)++) ans1.push_back(q[i]);
ans1.push_back(d);
ans1.push_back(b);
ans2.push_back(c);
ans2.push_back(a);
for (int(i) = (n); (i) >= (5); (i)--) ans2.push_back(q[i]);
ans2.push_back(b);
ans2.push_back(d);
print();
return 0;
}
| 10 | CPP |
#include<cstdio>
#include<vector>
using namespace std;
const int INF = 1000000000;
struct edge{int from,to,cost;};
vector<edge> E;
int v,e,r;
int d[1000];
int main(){
scanf("%d %d %d",&v,&e,&r);
for(int i=0;i<e;i++){
edge tmp;
scanf("%d %d %d",&tmp.from,&tmp.to,&tmp.cost);
E.push_back(tmp);
}
fill(d,d+v,INF);
d[r] = 0;
int count = 0;
while(true){
bool flag = true;
for(int i=0;i<E.size();i++){
if(d[E[i].from]!=INF&&d[E[i].from]+E[i].cost<d[E[i].to]){
d[E[i].to] = d[E[i].from]+E[i].cost;
flag = false;
}
}
if(flag||count==v+5) break;
count++;
}
if(count==v+5) printf("NEGATIVE CYCLE\n");
else{
for(int i=0;i<v;i++){
if(d[i]==INF) printf("INF\n");
else printf("%d\n",d[i]);
}
}
return 0;
} | 0 | CPP |
n=int(input());r=[];m=0
for _ in [0]*n:
r.append(int(input()))
for i in range(n):
a=i;l=0
while r[a]!=-1:
a=r[a]-1;l+=1
m=max(m,l)
print(m+1) | 7 | PYTHON3 |
x,y=input().split()
x=int(x)
y=int(y)
m=0
s=0
if y>x:
m=x
s=int((y-m)/2)
else:
m=y
s=int((x-m)/2)
print('%s %d'%(m,s))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int n,a[10011],x,ans[200001],ansn,A[10011];
bool bo[100001];
int getval(int x,int nw)
{
int ans=0;
for (int i=n; i>=0; i--)
ans=(1ll*ans*x+a[i])%nw;
return ans;
}
int ran() {return rand()%1000*1000000+rand()%1000*1000+rand()%1000;}
void check(int nw)
{
if (getval(0,nw)) return;
if (nw<=120)
{
for (int j=1; j<nw; j++)
if (getval(j,nw)) return;
ans[++ansn]=nw;
return;
}
for (int j=1; j<=120; j++)
if (getval(ran()%nw,nw)) return;
ans[++ansn]=nw;
}
int main()
{
memset(bo,1,sizeof(bo));
for (int j=2; j<=100000; j++) if (bo[j])
for (int i=(j<<1); i<=100000; i+=j) bo[i]=0;
srand(20021221);
scanf("%d",&n);
for (int i=n; i>=0; i--) scanf("%d",&a[i]);
for (int i=2; i<=40000; i++) if (bo[i]) check(i);
int An=0;
for (int i=0; i<=n; i++) if (a[i]) A[++An]=abs(a[i]);
for (int T=1; T<=An&&T<=3; T++)
{
x=A[T];
for (int i=2; i<=40000; i++) while (x%i==0) x/=i;
if (x!=1) check(x);
}
sort(ans+1,ans+1+ansn);
for (int i=1; i<=ansn; i++)
if (ans[i]!=ans[i-1]) printf("%d\n",ans[i]);
return 0;
} | 0 | CPP |
from collections import Counter
def dp(arr):
mat=[0]* (max(arr)+1)
dic=Counter(arr)
if(1 in dic):
mat[1]=dic[1]
for i in range(2,len(mat)):
k=0
if(i in dic):
k=dic[i]
mat[i]=max(mat[i-2]+i*k,mat[i-1])
return mat[-1]
n=int(input())
arr=list(map(int,input().split()))
print(dp(arr)) | 9 | PYTHON3 |
n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
while any(number-m > 0 for number in a):
a = [i - m for i in a]
a = [i>0 for i in a]
a = a[::-1]
print (n - a.index(True)) | 7 | PYTHON3 |
#include <iostream>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
int n, m;
char x[100][101];
void dfs(int i, int j){
char c = x[i][j];
x[i][j] = 0;
rep(k, 4){
int p = i + dx[k];
int q = j + dy[k];
if(0 <= p && p < n && 0 <= q && q < m && x[p][q] == c){
dfs(p, q);
}
}
}
int main(){
while(1){
cin >> n >> m;
if(!n){
break;
}
rep(i, n){
cin >> x[i];
}
int ans = 0;
rep(i, n){
rep(j, m){
if(x[i][j]){
dfs(i, j);
++ans;
}
}
}
cout << ans << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 3 * 1e5 + 5;
vector<int> g[N];
long double ans[N];
long double pr[N];
void dfs(int v, int len = 0, int p = -1) {
if (g[v].size() == 1 && v != 0) ans[len] += pr[v];
for (auto to : g[v]) {
if (to != p) {
pr[to] = pr[v] * (1.0 / (g[v].size() - (v != 0)));
dfs(to, len + 1, v);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
pr[0] = 1.0;
dfs(0);
long double ANS = 0.0;
for (int i = 1; i < N; ++i) {
ANS += ans[i] * (long double)i;
}
cout << fixed << setprecision(12) << ANS;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
int m=(n+1)/2;
printf("%.10f",(double)m/n);
} | 0 | CPP |
n, k = map(int, input().split())
x = input()
num = x[:k]
for i in range(k, n, k):
if num > x[i:i + k]:
break
if num < x[i:i + k]:
num = str(int(num) + 1)
break
print(n)
print(num * (n // k) + num[:(n % k)]) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, k;
cin >> t;
while (t--) {
cin >> n >> k;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int small = a[0];
long long int count = 0;
for (int i = 1; i < n; i++) {
long long int diff = (k - a[i]);
count += diff / small;
}
cout << count << endl;
}
return 0;
}
| 7 | CPP |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string la,lb;
int a[4],b[4];
int hit,blow;
while(cin>>la>>lb,la!="0"&&lb!="0"){
hit=blow=0;
for(int i=0;i<4;i++){
if(la[i]==lb[i]){hit++;}
a[i]=la[i]-'0';
b[i]=lb[i]-'0';
}
sort(a,a+4);sort(b,b+4);
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(a[i]==b[j])blow++;
if(a[i]<b[j])break;
}
}
cout<< hit<<" "<<blow-hit<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N, K; cin >> N >> K;
int L[12], R[12];
for(int i = 0; i < K; i++) cin >> L[i] >> R[i];
long long dp[200010] = {};
long long DP[200010] = {};
dp[1] = 1; DP[1] = 1;
long long mod = 998244353;
for(int i = 2; i <= N; i++){
for(int j = 0; j < K; j++){
int l = i - R[j]; int r = i - L[j];
if(r < 0) continue;
else if(l <= 0) dp[i] += DP[r];
else dp[i] += DP[r] - DP[l-1];
}
dp[i] += mod * 10;
dp[i] %= mod;
DP[i] = (DP[i-1] + dp[i]) % mod;
}
cout << dp[N] << "\n";
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int tree[5000005];
int sdgidjbg[5000005];
int sdgwrjw[5000005];
int prv[100005], prv1[100005];
int cur = 2;
vector<int> b[100005];
int root[100005];
void upd(int s, int e, int i, int x) {
if (s == e) {
tree[i]++;
return;
}
int mid = (s + e) >> 1;
if (x >= s && x <= mid) {
tree[cur] = tree[sdgidjbg[i]];
sdgidjbg[cur] = sdgidjbg[sdgidjbg[i]];
sdgwrjw[cur] = sdgwrjw[sdgidjbg[i]];
sdgidjbg[i] = cur++;
upd(s, mid, sdgidjbg[i], x);
} else {
tree[cur] = tree[sdgwrjw[i]];
sdgidjbg[cur] = sdgidjbg[sdgwrjw[i]];
sdgwrjw[cur] = sdgwrjw[sdgwrjw[i]];
sdgwrjw[i] = cur++;
upd(mid + 1, e, sdgwrjw[i], x);
}
tree[i] = tree[sdgidjbg[i]] + tree[sdgwrjw[i]];
}
int sumquery(int l, int r, int s, int e, int i) {
if (s > r || e < l || l > r) return 0;
if (s >= l && e <= r) return tree[i];
int mid = (s + e) >> 1;
return sumquery(l, r, s, mid, sdgidjbg[i]) +
sumquery(l, r, mid + 1, e, sdgwrjw[i]);
}
int query(int s, int e, int i, int x) {
if (s == e) {
if (tree[i]) return s - 1;
return s;
}
int mid = (s + e) >> 1;
if (tree[sdgidjbg[i]] > x) return query(s, mid, sdgidjbg[i], x);
return query(mid + 1, e, sdgwrjw[i], x - tree[sdgidjbg[i]]);
}
void build(int l, int r, int i) {
if (l == r) {
if (prv1[l] == 0) tree[i] = 1;
return;
}
int mid = (l + r) >> 1;
if (sdgidjbg[i] == 0) sdgidjbg[i] = cur++;
if (sdgwrjw[i] == 0) sdgwrjw[i] = cur++;
build(l, mid, sdgidjbg[i]);
build(mid + 1, r, sdgwrjw[i]);
tree[i] = tree[sdgidjbg[i]] + tree[sdgwrjw[i]];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
prv1[i] = prv[a[i]];
b[prv[a[i]]].push_back(i);
prv[a[i]] = i;
}
build(1, n, 1);
root[0] = 1;
for (int i = 1; i <= n; i++) {
root[i] = cur++;
tree[root[i]] = tree[root[i - 1]];
sdgidjbg[root[i]] = sdgidjbg[root[i - 1]];
sdgwrjw[root[i]] = sdgwrjw[root[i - 1]];
for (auto j : b[i]) upd(1, n, root[i], j);
}
for (int i = 1; i <= n; i++) {
int an = 0, cur = 1;
while (cur <= n) {
int x = sumquery(1, cur - 1, 1, n, root[cur - 1]);
if (sumquery(1, n, 1, n, root[cur - 1]) <= x + i)
cur = n + 1;
else
cur = query(1, n, root[cur - 1], x + i) + 1;
an++;
}
cout << an << " ";
}
cout << '\n';
return 0;
}
| 9 | CPP |
n = int(input())
a = list(map(int, input().split()))
ai = max(a)
aj = min(filter(lambda x: x!=ai, a), key=lambda x: abs(x-ai//2))
print("{} {}".format(ai, aj)) | 0 | PYTHON3 |
n = int(input())
f = []
s = []
for i in range(n):
x = int(input())
if x > 0:
f.append(x)
else:
s.append(abs(x))
if i == n-1:
if x > 0:
lst = 'first'
else:
lst = 'second'
if sum(f) > sum(s):
print('first')
elif sum(s) > sum(f):
print('second')
else:
for i in range(min(len(f),len(s))):
if f[i] > s[i]:
print('first')
exit()
elif s[i] > f[i]:
print('second')
exit()
if len(f) > len(s):
print('first')
elif len(s) > len(f):
print('second')
else:
print(lst)
| 8 | PYTHON3 |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
ans = 0
if k == 1:
ans = (n-k)*A
print(ans)
else:
while x > 1:
if x % k == 0:
div = int(x/k)
temp1 = (x-div)*A
temp2 = B
if temp1 > temp2:
x = int(x/k)
ans += B
else:
x = int(x/k)
ans += temp1
else:
val = int(x/k)
if val!=0:
# print(val)
val1 = val*k
ans = ans + (x-val1)*A
x = val1
else:
ans = ans + (x-1)*A
x=1
# print(x)
print(ans) | 8 | PYTHON3 |
n=int(input())
for i in range(n):
a=int(input())
s=input()
t=0
while s[t]!='8' and a>=11:
a-=1
t+=1
if a>=11:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
import math
import sys
input=sys.stdin.readline
for _ in range(int(input())):
n = int(input())
k = 2
while (True):
d = 2 ** k - 1
if (n % d == 0):
print(n // d)
break
k += 1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int fr[111], i, j;
int main() {
string cur, nxt, dum;
cin >> cur >> nxt;
dum = cur;
next_permutation(dum.begin(), dum.end());
if ((dum > cur) && (dum < nxt)) {
cout << dum;
return 0;
}
dum = cur;
for (i = cur.size() - 1; i >= 0; i--) {
for (j = cur[i] + 1; j <= 'z'; j++) {
dum[i] = j;
if ((dum > cur) && (dum < nxt)) {
cout << dum;
return 0;
}
}
dum[i] = 'a';
}
cout << "No such string";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
ostream& operator<<(ostream& out, const pair<A, B>& a) {
return out << "(" << a.first << ", " << a.second << ")";
}
template <class A>
ostream& operator<<(ostream& out, const vector<A>& a) {
out << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) out << ", ";
out << *it;
}
return out << "]";
}
void solve() {
long long n, i, j, x, t, y, k;
cin >> n >> k;
string s;
cin >> s;
for (i = 0; i < k; i++) {
set<long long> st;
char c = '?';
for (j = i; j < n; j += k) {
st.insert(s[j]);
if (s[j] != '?') c = s[j];
}
if (st.size() == 3) {
cout << "NO\n";
return;
}
if (st.size() == 2 && *(st.begin()) == '0' && *(st.rbegin()) == '1') {
cout << "NO\n";
return;
}
if (c != '?') {
for (j = i; j < n; j += k) s[j] = c;
}
}
x = y = 0;
for (i = 0; i < k; i++) {
if (s[i] == '1')
x++;
else if (s[i] == '0')
x--;
else
y++;
}
if (abs(x) > y) {
cout << "NO\n";
return;
}
cout << "YES\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, i, j, x, t, y;
cin >> t;
while (t--) solve();
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (n == 0) return m;
return gcd(n, m % n);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int rem = 0;
string s;
cin >> s;
int a[n];
for (int i = 0; i < n; i++) a[i] = s[i] - '0';
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
if (a[i] == 0) {
a[i] = 1;
ans++;
rem = 0;
} else {
a[i] = 0;
ans++;
rem = 1;
}
} else if (rem == 0)
break;
else {
if (a[i] == 0) {
a[i] = 1;
ans++;
rem = 0;
} else {
a[i] = 0;
ans++;
rem = 1;
}
}
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
'''input
12:21
'''
def main():
h,m = map(int, input().split(':'))
if h < 5:
if m < int(str(h) + '0'):
print("0" + str(h) + ':' + str(h) + '0')
else:
print("0" + str(h+1) + ':' + str(h+1) + '0')
elif h == 5:
if m < 50:
print("05:50")
else:
print("10:01")
elif h < 9:
print("10:01")
elif h < 15:
if m < int(str(h)[::-1]):
print(str(h) + ':' + str(h)[::-1])
else:
print(str(h+1) + ':' + str(h+1)[::-1])
elif h < 20:
print("20:02")
elif h < 23:
if m < int(str(h)[::-1]):
print(str(h) + ':' + str(h)[::-1])
else:
print(str(h+1) + ':' + str(h+1)[::-1])
else:
if m < 32:
print("23:32")
else:
print("00:00")
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
n, m, a, b = map(int,input().split(" "))
res1 = 0
res2 = 0
p = n//m
res1 += p*b
if(n%m!=0):
if((n-(m*p))*a < b):
res1 += (n-(m*p))*a
else:
res1 += b
res2 = n*a
print(min(res1,res2)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n, m;
cin >> n;
long long a[n + 2];
set<pair<long long, long long>> st;
vector<long long> vec;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
st.insert({i, a[i]});
vec.push_back(a[i]);
}
bool flag = true;
for (long long i = 1; i <= min(100LL, n); i++) {
flag = true;
for (long long j = 2; j <= i + 1; j++) {
if (a[i] % j != 0) flag = false;
}
if (flag) break;
}
if (flag)
cout << "NO" << '\n';
else
cout << "YES" << '\n';
}
}
| 9 | CPP |
#_________________ Mukul Mohan Varshney _______________#
#Template
import sys
import os
import math
import copy
from math import gcd
from bisect import bisect
from io import BytesIO, IOBase
from math import sqrt,floor,factorial,gcd,log,ceil
from collections import deque,Counter,defaultdict
from itertools import permutations, combinations
from itertools import accumulate
#define function
def Int(): return int(sys.stdin.readline())
def Mint(): return map(int,sys.stdin.readline().split())
def Lstr(): return list(sys.stdin.readline().strip())
def Str(): return sys.stdin.readline().strip()
def Mstr(): return map(str,sys.stdin.readline().strip().split())
def List(): return list(map(int,sys.stdin.readline().split()))
def Hash(): return dict()
def Mod(): return 1000000007
def Ncr(n,r,p): return ((fact[n])*((ifact[r]*ifact[n-r])%p))%p
def Most_frequent(list): return max(set(list), key = list.count)
def Mat2x2(n): return [List() for _ in range(n)]
def Lcm(x,y): return (x*y)//gcd(x,y)
def dtob(n): return bin(n).replace("0b","")
def btod(n): return int(n,2)
def common(l1, l2):
return set(l1).intersection(l2)
# Driver Code
def solution():
for _ in range(Int()):
n=Int()
a=List()
b=List()
mukul_p=False
mukul_m=False
for i in range(n):
if(b[i]-a[i]>0 and mukul_p==False):
print("NO")
break
if(b[i]-a[i]<0 and mukul_m==False):
print("NO")
break
if(a[i]>0):
mukul_p=True
elif(a[i]<0):
mukul_m=True
else:
print("YES")
#Call the solve function
if __name__ == "__main__":
solution() | 8 | PYTHON3 |
t=int(input())
for i in range(t):
a,b=map(int,input().split())
x=min(a,b)
if(4*x*x>=a*b*2):
print(4*x*x)
continue
y=max(a,b)
print(y*y)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int k;
int ans = 0;
int main() {
cin >> s >> k;
for (int i = 0; i < k; ++i) s += '?';
int n = (int)s.length();
for (int left = 0; left < n; ++left) {
for (int right = left + 1; right < n; ++right) {
int len = right - left + 1;
if (len % 2 == 1) continue;
bool isTandem = true;
for (int i = left; i < left + len / 2; ++i) {
if (s[i] != s[i + len / 2] && s[i] != '?' && s[i + len / 2] != '?')
isTandem = false;
}
if (isTandem) ans = max(ans, len);
}
}
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
bool adj[4][110] = {{false}}, checkArr[4][110];
bool BFS() {
queue<pair<int, int>> bfsQ;
bfsQ.push({1, 1});
checkArr[1][1] = true;
while (!bfsQ.empty()) {
int x = bfsQ.front().first, y = bfsQ.front().second;
bfsQ.pop();
if (x == 2 && y == n) return true;
for (int i = 0; i < 8; i++) {
int nx, ny;
switch (i) {
case 0:
nx = x + 1;
ny = y;
break;
case 1:
nx = x + 1;
ny = y + 1;
break;
case 2:
nx = x;
ny = y + 1;
break;
case 3:
nx = x - 1;
ny = y + 1;
break;
case 4:
nx = x - 1;
ny = y;
break;
case 5:
nx = x - 1;
ny = y - 1;
break;
case 6:
nx = x;
ny = y - 1;
break;
case 7:
nx = x + 1;
ny = y - 1;
break;
default:
break;
}
if (adj[nx][ny] && !checkArr[nx][ny]) {
checkArr[nx][ny] = true;
bfsQ.push({nx, ny});
}
}
}
return false;
}
int main(void) {
int t;
cin >> t;
while (t--) {
cin >> n;
fill(adj[1] + 1, adj[1] + 1 + n, false);
fill(adj[2] + 1, adj[2] + 1 + n, false);
fill(checkArr[1] + 1, checkArr[1] + 1 + n, false);
fill(checkArr[2] + 1, checkArr[2] + 1 + n, false);
for (int i = 1; i <= n; i++) {
char x;
cin >> x;
if (x == '0')
adj[1][i] = true;
else
adj[1][i] = false;
}
for (int i = 1; i <= n; i++) {
char x;
cin >> x;
if (x == '0')
adj[2][i] = true;
else
adj[2][i] = false;
}
if (BFS())
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 7 | CPP |
import sys
n = input()
pom = n
characters='47'
n = n.replace('7','')
n = n.replace('4','')
n = str(str(len(pom)-len(n))).replace('7','')
n = n.replace('4','')
if n =='':
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
k,r=map(int,input().split())
count=1
z=[r,0]
while (k*count)%10 not in z:
count=count+1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
inline int ifnotzero(int num) { return ~((num - 1) >> 31); }
int Q, t, L, R, k;
int data[2][100005];
int main() {
scanf("%d", &Q);
while (Q--) {
scanf("%d", &t);
if (t == 1) {
scanf("%d%d%d", &L, &R, &k);
bool idx = k > 0;
uint32_t dt = abs(k) - 1;
for (int i = L; i < R; ++i) {
uint32_t a = data[idx][i] - 1;
data[idx][i] = (a < dt ? a : dt) + 1;
}
} else {
scanf("%d%d", &L, &R);
long long res = 0;
for (int i = L; i < R; ++i)
res += (data[0][i] + data[1][i]) & ifnotzero(data[1][i]) &
ifnotzero(data[0][i]);
printf("%lld\n", res);
}
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x = 0, max = 0;
int v[200005];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
if (v[i] == 1) {
x++;
if (x > max) max = x;
}
if (v[i] == 0) x = 0;
}
if (x > 0) {
for (int i = 1; i <= n; i++) {
if (v[i] == 1) {
x++;
if (x > max) max = x;
}
if (v[i] == 0) {
x = 0;
break;
}
}
}
cout << max;
return 0;
}
| 8 | CPP |
#include<iostream>
using namespace std;
int main(){
int n; cin >> n;
int a[100050];
for(int i=1;i<=n;i++) cin >> a[i];
int j = 1;
for(int c=1;c<=n;c++){
int k = a[j];
if(k==2){
cout << c << endl;
return 0;
}
j = k;
}
cout << -1 << endl;
} | 0 | CPP |
n=int(input())
m=set(map(int,input().split()))
for i in m:
if i==0:
m.remove(0)
break
print(len(m)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
const long long mxn = 2e5 + 1, md = 998244353;
map<array<long long, 2>, long long> mem;
set<long long> av;
long long dp(long long i, long long li, vector<long long>& a) {
if (a[i] != -1) return (li != a[i] || a[i] == k + 2);
if (mem.count({i, li})) return mem[{i, li}];
long long ans = 0;
for (long long x : av)
if (x != li) (ans += dp(i + 1, x, a)) %= md;
if (li > k)
ans += dp(i + 1, k + 1, a) * (k - av.size() - (li == k + 1));
else
ans += dp(i + 1, k + 1, a) * (k - av.size());
ans %= md;
return mem[{i, li}] = ans;
}
long long process(vector<long long> a) {
a.push_back(k + 2);
reverse(a.begin(), a.end());
a.push_back(k + 2);
reverse(a.begin(), a.end());
for (long long i = 0; i + 1 < a.size(); i++)
if (a[i] != -1 && a[i] == a[i + 1]) return 0;
long long ans = 1;
for (long long i = 1; i + 1 < a.size(); i++) {
if (a[i] != -1) continue;
long long li = 0;
mem.clear();
av.clear();
for (long long j = i; j < a.size(); j++) {
if (a[j] != -1) break;
li = j;
}
if (a[i - 1] <= k) av.insert(a[i - 1]);
if (a[li + 1] <= k) av.insert(a[li + 1]);
(ans *= dp(i, a[i - 1], a)) %= md;
i = li;
}
return ans;
}
signed main() {
cin >> n >> k;
vector<long long> a(n);
for (long long& x : a) cin >> x;
vector<long long> e, o;
for (long long i = 0; i < n; i++) {
if (i & 1)
o.push_back(a[i]);
else
e.push_back(a[i]);
}
cout << (process(o) * process(e)) % md;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
typedef pair<int,P>iP;
typedef pair<P,P>PP;
#define F first
#define S second
int dp[1<<8],n,m,h,k,s,t,p,l,d,I[5],dis[111][25];
vector<PP>v[111];
void input(){
r(i,(1<<8))dp[i]=1e9;
r(i,111)v[i].clear();
cin>>n>>m>>h>>k;
if(!n)exit(0);
r(i,m){
r(j,5)cin>>I[j]; I[0]--; I[1]--; I[4]--;
v[I[0]].push_back(PP(P(I[1],I[2]),P(I[3],I[4])));
v[I[1]].push_back(PP(P(I[0],I[2]),P(I[3],I[4])));
}
cin>>s>>t>>p; s--; t--;
dp[0]=0;
r(i,p){
int sum=0,x;
cin>>l>>d;
r(j,l){
cin>>x; x--;
sum|=(1<<x);
}
r(j,(1<<k)) if(dp)dp[j|sum]=min(dp[j|sum],dp[j]+d);
}
}
int dij(int x){
int ans=1e9;
r(i,111)r(j,25)dis[i][j]=1e9;
priority_queue<iP,vector<iP>,greater<iP> >q;
dis[s][0]=0;
q.push(iP(0,P(s,0)));
while(!q.empty()){
iP p=q.top();q.pop();
int cost=p.F;
int now=p.S.F;
int H=p.S.S;
if(dis[now][H]<cost)continue;
r(i,v[now].size()){
PP pp=v[now][i];
int nex=pp.F.F;
int ncos=pp.F.S;
int nh=pp.S.F;
int kai=pp.S.S;
if((1<<kai)&x)ncos=cost;
else ncos+=cost;
if(nh+H>h)continue;
if(dis[nex][nh+H]>ncos){
dis[nex][nh+H]=ncos;
q.push(iP(ncos,P(nex,nh+H)));
}
}
}
r(i,25)ans=min(ans,dis[t][i]);
return ans+dp[x];
}
signed main(){
while(1){
int ans=1e9;
input();
r(i,(1<<k))ans=min(ans,dij(i));
cout<<(ans==1e9?-1:ans)<<endl;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
vector<pair<int, int>> g[N];
const int M = 30001;
int x[M];
int y[M];
int w[M];
int forb = -1;
const int inf = 2e9 + 10;
bool vis[N];
int low[N];
int dist[N];
bool to_s_tab[M];
int n, s, t;
bool firstrun = true;
pair<int, int> dfs(int v, int d, int road) {
bool to_s = v == s;
pair<int, int> ans(inf, -1);
vis[v] = true;
dist[v] = low[v] = d;
for (auto u : g[v])
if (u.second != road && u.second != forb) {
if (vis[u.first])
low[v] = min(low[v], dist[u.first]);
else {
auto p = dfs(u.first, d + 1, u.second);
if (p.first != -1) {
to_s = true;
ans = p;
}
low[v] = min(low[v], low[u.first]);
}
}
if (firstrun && to_s && road != -1) to_s_tab[road] = true;
if (!to_s) return make_pair(-1, -1);
if (low[v] == dist[v] && road != -1) ans = min(ans, make_pair(w[road], road));
return ans;
}
pair<int, int> cost() {
for (int i = 1; i <= n; i++) vis[i] = low[i] = 0;
auto p = dfs(t, 0, -1);
if (p.first == -1) return make_pair(0, -1);
return p;
}
int main() {
int m;
scanf("%d %d %d %d", &n, &m, &s, &t);
for (int i = 0; i < m; i++) {
scanf("%d %d %d", x + i, y + i, w + i);
g[x[i]].emplace_back(y[i], i);
g[y[i]].emplace_back(x[i], i);
}
auto c = cost();
pair<int, pair<int, int>> ans = make_pair(c.first, make_pair(c.second, -1));
firstrun = false;
for (forb = 0; forb < m; forb++) {
if (!to_s_tab[forb]) continue;
c = cost();
if (c.first != inf)
ans = min(ans, make_pair(c.first + w[forb], make_pair(forb, c.second)));
}
if (ans.first == inf) {
puts("-1");
return 0;
}
printf("%d\n%d\n", ans.first,
(ans.second.first != -1) + (ans.second.second != -1));
if (ans.second.first != -1) printf("%d ", ans.second.first + 1);
if (ans.second.second != -1) printf("%d", ans.second.second + 1);
puts("");
}
| 9 | CPP |
import string
r1=string.ascii_lowercase
r2=string.ascii_uppercase
s1=input()
s2=input()
ctr=0
for i in range(len(s1)):
if s1[i] in r1:
a=r1.index(s1[i])
else:
a=r2.index(s1[i])
if s2[i] in r1:
b=r1.index(s2[i])
else:
b=r2.index(s2[i])
if b==a:
pass
if a>b:
print(1)
break
if b>a:
print(-1)
break
if a==b:
print(0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
const double PI = 3.14;
using namespace std;
void Rokaya() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const double EPS = 1e-6;
const int N = 1e6 + 1;
int DCNP(double a, double b) {
if (fabs(a - b) < EPS) return 0;
return (a < b ? -1 : 1);
}
int gcd(int n, int m) {
if (m == 0) return n;
return gcd(m, n % m);
}
long long lcm(long long n, long long m) {
long long ans = (n * m) / gcd(n, m);
return ans;
}
bool isprime(long long n) {
if (n == 2 || n == 3 || n == 5)
return true;
else if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0 || n % 1 == 0)
return false;
else {
for (int i = 5; i <= sqrt(n); i += 2) {
if (n % i == 0) return false;
}
}
return true;
}
long long power(long long x, long long k, long long p) {
long long ret = 1;
while (k) {
if (k & 1) ret = (ret * x) % p;
k >>= 1;
x = (x * x) % p;
}
return ret;
}
int main() {
Rokaya();
int n, k;
cin >> n >> k;
if (k < (n / 2) || (n == 1 && k >= n)) {
cout << "-1\n";
return 0;
}
if (n == 1 && k == 0) {
cout << "1\n";
return 0;
}
long long ans = k - (n - 2) / 2;
cout << ans << " " << ans * 2 << " ";
n -= 2;
int i = 1;
while (n) {
if (i != ans && i != ans * 2) {
cout << i << " ";
n--;
}
i++;
}
cout << "\n";
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
int n,m,k,e[100009],f[100009],num[100009];
vector<int>gg[100009];
int getf(int x) {
if(x!=f[x]) f[x]=getf(f[x]);
return f[x];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m>>k;
for(int i=1;i<=n;i++) f[i]=i;
for(int i=0;i<m;i++) {
int a,b;
cin>>a>>b;
e[a]++;
e[b]++;
if(getf(a)!=getf(b)) {
int fa=getf(a),fb=getf(b);
f[fa]=fb;
}
}
for(int i=1;i<=n;i++) num[getf(i)]++;
for(int i=1;i<=n;i++) num[i]=num[getf(i)];
for(int i=1;i<=n;i++) num[i]=num[i]-e[i]-1;
for(int i=0;i<k;i++) {
int a,b;
cin>>a>>b;
if(getf(a)==getf(b)) num[a]--,num[b]--;
}
for(int i=1;i<=n;i++) cout<<num[i]<<' ';
return 0;
} | 0 | CPP |
s, n = map(int, input().split())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
a.sort(key=lambda x: x[0])
answer = True
for x in a:
if x[0] < s:
s += x[1]
else:
answer = False
break
if answer:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
import math
n, m, a = input().split()
n = int(n)
m = int(m)
a = int(a)
number = math.ceil(n/a) * math.ceil(m/a)
print(number)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int arr[maxn] = {};
int pref[maxn] = {};
int last[maxn] = {};
int kiek[maxn] = {};
int main() {
int n, c;
cin >> n >> c;
cin >> arr[0];
pref[0] += (arr[0] == c ? 1 : 0);
for (int i = 1; i < n; ++i) {
cin >> arr[i];
pref[i] = pref[i - 1] + (arr[i] == c ? 1 : 0);
}
int mak = pref[n - 1];
for (int i = 0; i < n; ++i) {
int dbr = arr[i];
if (dbr == c) continue;
if (last[dbr] == 0) {
last[dbr] = i + 1;
kiek[dbr] = 1;
mak = max(mak, pref[n - 1] + 1);
} else {
int pries = pref[last[dbr] - 1];
int po = pref[n - 1] - pref[i];
if (pref[n - 1] >= kiek[dbr] + pries + po) {
last[dbr] = i + 1;
kiek[dbr] = 1;
} else
++kiek[dbr];
mak = max(mak, pries + po + kiek[dbr]);
}
}
cout << mak;
return 0;
}
| 11 | CPP |
s = list(input())
ans = 0
l = 0
r = len(s)-1
while l < r:
if s[l] != s[r]:
if s[l] == "x":
ans += 1
r += 1
elif s[r] == "x":
ans += 1
l -= 1
else:
print(-1)
exit()
l += 1
r -= 1
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
long long x;
scanf("%d", &n);
x = (n - 2);
x = x * x;
printf("%I64d", x);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
int tx = x - y;
int ty = x + y;
x = tx;
y = ty;
if (x < 0)
cout << "-1\n";
else {
int l = 1, r = 1e9 + 5;
while (r - l > 1) {
int mid = (l + r) / 2;
if ((1LL * y * (mid - 1) + mid - 1) / mid <= x)
l = mid;
else
r = mid;
}
long double ans = y;
ans /= l;
ans /= 2.0;
cout << setprecision(19) << fixed << ans << "\n";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int a[15];
int b[7] = {1869, 6198, 1896, 1689, 1986, 1968, 1698};
int main() {
cin >> s;
memset(a, 0, sizeof(a));
for (int i = 0; i < s.size(); i++) {
a[s[i] - '0']++;
}
a[1]--;
a[6]--;
a[8]--;
a[9]--;
int ans = 0;
for (int i = 1; i <= 9; i++) {
while (a[i]) {
ans = (ans * 10 + i) % 7;
a[i]--;
cout << i;
}
}
cout << b[ans];
while (a[0]) {
cout << "0";
a[0]--;
}
cout << endl;
return 0;
}
| 9 | CPP |
#include <iostream>
using namespace std;
int main() {
long long int A,B,N; cin>>A>>B>>N;
cout<<A*min(B-1,N)/B<<endl;
return 0;
} | 0 | CPP |
for s in[*open(0)][2::2]:
a=[1]+len(s)*8*[0];t=0
for x in s[:-1]:t+=int(x)-1;a[t]+=1
print(sum(x*(x-1)//2for x in a)) | 9 | PYTHON3 |
a=list(map(int,input().split()))
m=max(a)-1
print(sum(m-i for i in a if i<m))
| 9 | PYTHON3 |
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=200005;
int n,q;
long long a[N],x;
long long p[N],s[N];
long long l,r;
int get(long long x,int k)
{
if (!k)
return n;
int l=1;
int r=n-k+1;
while (l<r)
{
int mid=(l+r+1)>>1;
if (x>=a[mid])
{
if (x-a[mid-1]<=a[mid+k-1]-x)
r=mid-1;
else
l=mid;
}
else
if (a[mid-1]<x&&abs(x-a[mid-1])>abs(a[mid+k-1]-x))
l=mid;
else
r=mid-1;
}
return r+k-1;
}
int main()
{
scanf("%d%d",&n,&q);
for (int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s[i]=s[i-1]+a[i];
}
for (int i=1;i<=n;i++)
if ((n^i)&1)
p[i]=p[i-1]+a[i];
else
p[i]=p[i-1];
while (q--)
{
scanf("%lld",&x);
l=0;
r=n/2;
while (l<r)
{
int mid=(l+r+1)>>1;
if (get(x,mid)<n-mid+1)
l=mid;
else
r=mid-1;
}
int c=get(x,r);
printf("%lld\n",s[n]-(s[c]-s[c-r]+p[c-r]));
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int n, k;
cin >> n >> k;
k = (n - k) / 2;
for (int i = 0; i < n / (k + 1); ++i) {
for (int j = 0; j < k; ++j) cout << '0';
cout << '1';
}
for (int i = 0; i < n % (k + 1); ++i) cout << '0';
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> v[211111];
pair<int, int> q[211111];
int f[211111];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> q[i].first, q[i].second = i;
sort(q, q + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
v[x].push_back(y);
v[y].push_back(x);
}
for (int i = 0; i < n; i++) f[i] = -1;
long long ans = 0;
for (int i = 0; i < n; i++) {
int x = q[i].second;
for (int j = 0; j < v[x].size(); j++)
if (f[v[x][j]] != -1) ans += f[v[x][j]];
f[x] = q[i].first;
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[11];
int main() {
int n;
scanf("%d", &n);
long long ans = 0;
for (int i = 1; i <= n; ++i) {
a[i % 9]++;
ans -= n / i;
}
for (int i = 0; i < 9; ++i)
for (int j = 0; j < 9; ++j) ans += 1ll * a[i] * a[j] * a[(i * j) % 9];
cout << ans << endl;
}
| 9 | CPP |
import sys
import math
from collections import defaultdict,deque
input = sys.stdin.readline
def inar():
return [int(el) for el in input().split()]
def main():
n=int(input())
arr=inar()
arr.sort()
ans=0
dic={}
for i in range(n):
if arr[i]==0:
continue
if arr[i]<0:
take=-1*(arr[i])
if take not in dic:
dic[take]=1
ans+=1
else:
take=-1*(arr[i])
if take not in dic:
dic[take]=1
ans+=1
print(ans)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
import collections
while 1:
n=int(input())
if n==0:break
words=[]
words_match=[]
count=0
ans=[]
for i in range(n):
words+=list(map(str,input().split()))
keyword=input()
words.sort()
for i in words:
if keyword==i[0]:words_match.append(i)
count_dict = collections.Counter(words_match)
ans=count_dict.most_common(5)
if ans==[]:
print("NA")
else:
for i in range(len(ans)):
if i>0:print(" ",end="")
print(ans[i][0],end="")
print()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
vector<int> a(N);
vector<vector<int>> pos(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
--a[i];
pos[a[i]].push_back(i);
}
vector<vector<int>> dp(N + 1,
vector<int>(N + 1, numeric_limits<int>::max()));
for (int i = 0; i <= N; ++i) {
dp[i][i] = 0;
}
for (int len = 1; len <= N; ++len) {
for (int l = 0; l + len <= N; ++l) {
int r = l + len;
dp[l][r] = dp[l + 1][r] + (len > 1);
for (auto i : pos[a[l]]) {
if (l < i && i < r) {
dp[l][r] = min(dp[l][r], dp[l][i] + dp[i][r]);
}
}
}
}
cout << dp[0][N] << '\n';
}
exit(0);
}
| 9 | CPP |
n = int(input())
t = 0
t_max = 0
for i in range(n):
a, b = [int(ab) for ab in input().split()]
t -= a
t += b
if t > t_max:
t_max = t
print(t_max) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, q, r, mid, lo, hi;
bool check, brk;
int main() {
cin >> n;
int a[n];
for (int i=0; i<n; i++) cin >> a[i];
cin >> q;
for (int i=0; i<q; i++) {
cin >> r;
check = 0;
brk = 0;
mid = n/2;
lo = 0;
hi = n-1;
while (!check) {
if (r < a[mid]) {
hi = mid;
}
else {
if (r > a[mid]) lo = mid;
else check = 1;
}
mid = (lo + hi)/2;
if (lo + 1>= hi) break;
}
if (r == a[lo]) check = 1;
if (r == a[hi]) check = 1;
cout << check << endl;
}
}
| 0 | CPP |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool f[26];
vector<string> ans;
string str;
void dfs(int pos) {
if ( pos >= str.size() ) {
ans.push_back(str);
}
else {
char c = str[pos];
int cid = (int)(c-'a');
if (f[(cid+25)%26]) {
dfs(pos+1);
}
if (!f[cid]) {
++str[pos];
f[cid] = true;
dfs(pos+1);
f[cid] = false;
--str[pos];
}
}
}
int main() {
while (cin >> str, str != "#") {
ans.clear();
fill(&f[0], &f[0]+26, false); f[25] = true;
dfs(0);
cout << ans.size() << endl;
if (ans.size() <= 10) {
for (int i = 0; i < ans.size(); ++i) cout << ans[i] << endl;
}
else {
for (int i = 0; i < 5; ++i) cout << ans[i] << endl;
for (int i = ans.size()-5; i < ans.size(); ++i) cout << ans[i] << endl;
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[15];
int main() {
int n, m;
scanf("%d%d", &n, &m);
memset(a, 0, sizeof a);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
a[x]++;
}
int ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = i + 1; j <= m; j++) {
ans = ans + a[i] * a[j];
}
}
printf("%d\n", ans);
return 0;
}
| 8 | CPP |
str_1=input()
q=int(input())
for _ in range(q):
lst=list(input().split())
res = (lst[0])
a = int(lst[1])
b = int(lst[2])+1
if res=='print':
print(str_1[a:b])
elif res=='replace':
str_1=str_1[:a]+lst[3]+str_1[b:]
elif res=='reverse':
str_1=str_1[:a] + str_1[a:b][::-1] + str_1[b:] | 0 | PYTHON3 |
l, r = list(map(int, input().split()))
if l % 2 != 0:
l += 1
if l + 2 > r:
print("-1")
exit()
print(l, l+1, l+2)
| 7 | PYTHON3 |
Subsets and Splits