solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
t=int(input())
for _ in range(t):
n=int(input())
a=[i for i in range(1,2*n+1)]
m=[int(i) for i in input().split()]
l=[]
for e in m:
k=e
l.append(k)
while(True):
e=e+1
if e not in m and e not in l:
l.append(e)
break
q=l.copy()
q.sort()
if(q==a):
print(*l)
else:
print(-1)
| 1,200 |
PYTHON3
|
import sys
input = lambda: sys.stdin.readline().strip()
t = int(input())
while t:
t-=1
n,k = map(int,input().split())
a = list(map(int,input().split()))
mi = min(a)
ma = max(a)
if n==k:
print(n)
print(' '.join(map(str,a)))
continue
b = list(set(a))
if len(b)<k:
b = b + [i for i in range(1,k-len(b)+1)]
k_ = len(b)
for i in range(k_,10**4):
b.append(b[i-k_])
m = len(b)
if k_<=k:
print(m)
print(' '.join(map(str,b)))
else:
print(-1)
| 1,400 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
bool check(int hr, int min) {
if (hr % 10 == 7 || hr / 10 == 7 || min % 10 == 7) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x, hr, min, res = 0;
cin >> x >> hr >> min;
while (!check(hr, min)) {
min -= x;
if (min < 0) {
min += 60;
hr--;
}
if (hr < 0) {
hr += 24;
}
res++;
}
cout << res << "\n";
return 0;
}
| 900 |
CPP
|
a=int(input())
f,l=0,sorted(list(map(int,input().split())))
for x in range(a):
if l[x]>=0:f=1;break
if f==1:print(sum(l[x:])-sum(l[:x]))
else:print(abs(sum(l)))
| 800 |
PYTHON3
|
k, n, w = input().split()
k, n, w = int(k), int(n), int(w)
cost = 0
for i in range(1, w+1):
cost = cost + i*k
borrowed = cost - n
if borrowed < 0:
borrowed = 0
print(borrowed)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int a[MAX];
int n, m, st;
bool check(long long x) {
int cnt = 0;
long long sum = 0;
for (int i = 1; i <= st; ++i) {
sum += a[i];
while (sum + i >= x) {
sum -= (x - i);
cnt++;
if (cnt > m) return 0;
}
}
if (cnt == m) {
if (sum <= 0)
return 1;
else
return 0;
}
return 1;
}
int main() {
while (~scanf("%d %d", &n, &m)) {
long long sum = 0;
long long l, r, ans;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
if (a[i] != 0) st = i;
sum += a[i];
}
l = st;
r = l + sum;
while (l <= r) {
long long mid = (l + r) / 2;
if (check(mid)) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
printf("%I64d\n", ans);
}
return 0;
}
| 2,200 |
CPP
|
from string import ascii_lowercase
n = int(input().strip())
output_str = ['-1' for i in range(n)]
alph = 0
for i in range(n):
if output_str[i] == '-1':
output_str[i] = ascii_lowercase[alph]
j = 0
while i + 4*j < n:
if output_str[i+4*j] == '-1':
output_str[i+4*j] = ascii_lowercase[alph]
j += 1
alph += 1
print(''.join(output_str))
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double E = exp(1);
template <class T1>
void deb(T1 e) {
cout << "-->" << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << "-->" << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << "-->" << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << "-->" << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
template <typename T>
inline T sqr(T n) {
return n * n;
}
inline double hypot(double x, double y) { return sqrt(sqr(x) + sqr(y)); }
template <typename T>
inline T pmod(T n, T m) {
return ((n % m) + m) % m;
}
template <typename T>
T power(T n, int p) {
return (p == 0) ? (T)(1) : (sqr(power(n, p >> 1)) * ((p & 1) * (n - 1) + 1));
}
template <typename T>
T bigmod(T n, int p, T m) {
return (p == 0)
? (T)(1)
: ((sqr(bigmod(n, p >> 1, m)) % m) * ((p & 1) * (n - 1) % m + 1)) %
m;
}
char ara[100100];
int flag[30][30], len;
int dp[100100][30];
int rec(int pos, int prev) {
if (pos >= len) return 0;
int &ret = dp[pos][prev];
if (ret != -1) return ret;
ret = (1 << 30);
ret = min(ret, 1 + rec(pos + 1, prev));
if (!flag[ara[pos] - 'a'][prev]) ret = min(ret, rec(pos + 1, ara[pos] - 'a'));
return ret;
}
int main() {
int n;
char forbid[5];
scanf("%s", ara);
len = strlen(ara);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", forbid);
flag[forbid[0] - 'a'][forbid[1] - 'a'] = 1;
flag[forbid[1] - 'a'][forbid[0] - 'a'] = 1;
}
memset(dp, -1, sizeof(dp));
printf("%d\n", rec(0, 27));
return 0;
}
| 1,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long a[n];
double sum = 0.0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
sum -= a[n - 1];
sum = sum / (n - 1);
double ans = (a[n - 1] / 1) + sum;
printf("%.9f\n", ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long test = 1;
cin >> test;
while (test--) {
solve();
}
return 0;
}
| 800 |
CPP
|
from collections import Counter
M = 10**9 + 7
def multipliers(pfs):
y = 1
for c in pfs.values():
y *= c+1
if y % 2:
sx = 1
for p, c in pfs.items():
sx = (sx * pow(p, c//2, M)) % M
return pow(sx, y, M)
else:
x = 1
for p, c in pfs.items():
x = (x * pow(p, c, M)) % M
return pow(x, y//2, M)
if __name__ == '__main__':
m = int(input())
pfs = Counter(map(int, input().split()))
print(multipliers(pfs))
| 2,000 |
PYTHON3
|
import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
import string
ORDA = 97 # a
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return [int(i) for i in input().split()]
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
if n < 2: return list()
prime = [True for _ in range(n + 1)]
p = 3
while p * p <= n:
if prime[p]:
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 2
r = [2]
for p in range(3, n + 1, 2):
if prime[p]:
r.append(p)
return r
def divs(n, start=2):
r = []
for i in range(start, int(math.sqrt(n) + 1)):
if (n % i == 0):
if (n / i == i):
r.append(i)
else:
r.extend([i, n // i])
return r
def divn(n, primes):
divs_number = 1
for i in primes:
if n == 1:
return divs_number
t = 1
while n % i == 0:
t += 1
n //= i
divs_number *= t
def prime(n):
if n == 2: return True
if n % 2 == 0 or n <= 1: return False
sqr = int(math.sqrt(n)) + 1
for d in range(3, sqr, 2):
if n % d == 0: return False
return True
def convn(number, base):
new_number = 0
while number > 0:
new_number += number % base
number //= base
return new_number
def cdiv(n, k): return n // k + (n % k != 0)
def ispal(s):
for i in range(len(s) // 2 + 1):
if s[i] != s[-i - 1]:
return False
return True
for _ in range(ii()):
a, b = sorted(mi())
print(a + b - 2 * (a & b))
| 800 |
PYTHON3
|
def yes_no(r,g,b):
if r+g+1>=b:
return "YES"
else:
return "NO"
for _ in range(int(input())):
r,g,b = sorted(list(map(int,input().split())))
print(yes_no(r,g,b))
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int sz[500005], pw[500005];
long long ans[500005];
struct edge {
int u, v;
edge *next;
} p[500005 << 1], *h[500005];
int egcnt = 0;
void addedge(int u, int v) {
edge *n1 = &p[egcnt++];
n1->u = u, n1->v = v;
n1->next = h[u], h[u] = n1;
}
void dfs(int a, int fa) {
sz[a] = 1;
long long nans = 1;
for (edge *p = h[a]; p; p = p->next) {
if (p->v == fa) continue;
dfs(p->v, a);
sz[a] += sz[p->v];
nans *= (pw[sz[p->v] - 1] + ans[p->v]), nans %= 998244353;
}
ans[a] = pw[sz[a] - 1] - nans;
ans[a] %= 998244353;
}
int main() {
pw[0] = 1;
for (int i = 1; i < 500005; i++) pw[i] = pw[i - 1] * 2 % 998244353;
int n;
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
addedge(u, v), addedge(v, u);
}
dfs(1, 0);
long long res = 0;
for (int i = 1; i <= n; i++) ans[i] *= pw[n - sz[i]], ans[i] %= 998244353;
for (int i = 1; i <= n; i++) res += ans[i];
res *= 2, res %= 998244353;
if (res < 0) res += 998244353;
printf("%lld\n", res);
return 0;
}
| 2,800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
set<int> st1, st2;
int main() {
int n, a, b, x, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
st1.insert(x);
}
scanf("%d%d", &a, &b);
while (a > b) {
set<int>::iterator it;
int aa = a - 1;
for (it = st1.begin(); it != st1.end(); it++)
if (a - a % (*it) >= b) {
aa = min(a - a % (*it), aa);
st2.insert(*it);
}
ans++;
a = aa;
st1.clear();
st1 = st2;
st2.clear();
}
printf("%d\n", ans);
}
| 2,200 |
CPP
|
# n = int(raw_input())
# a = int(n ** 0.5) + 1
# if n == 1:
# print "not prime"
# if n % 2 == 0:
# print "not prime"
# else:
# for i in xrange(3, a + 1, 2):
# if n % i == 0:
# print "not prime"
# exit(0)
# print "prime"
# a = int(raw_input())
# b = int(raw_input())
# c = b % a
# while c > 0:
# a = c
# b = a
# c = b % a
# print a
# n = int(raw_input())
# a = int(n ** 0.5)
# if a ** 2 != n:
# a += 1
# b = 0
# c = 0
# if n == 1:
# print "1"
# exit(0)
# if a ** 2 == n:
# c = 1
# for i in xrange(1, a, 1):
# if n % i == 0:
# b += 1
# print 2 * b + c
# for i in range(1,5):
# print i * "a"
# for i in range(1,5):
# print (5-i) * "a"
# for i in range (1,5):
# print i * " " + (5-i) * "a"
# for i in range (1,5):
# print (5-i) * " " + i * "a"
# n = int(input())
# numbers = list(map(int, input().split()))
# e = numbers[0]
# a = 0
# b = 0
# for i in numbers:
# c = i
# if e > c:
# b = e % c
# a = c
# if c < e:
# b = c % e
# a = e
# while a != 0 and b != 0:
# d = a
# b = a % b
# a = d
# if a != b:
# e = a + b
# print(e)
# n = int(input())
# a = 0
# b = 1
# c = 1
# for i in range(n):
# c = a + b
# a = b
# b = c
# print(c)
# def get(n):
# if n == 1:
# return 1
# elif n == 2:
# return 2
# else:
# return get(n - 1) + get(n - 2)
# n = int(input())
# print(get(n))
# n = int(input())
#
# dp = [0] * (n + 1)
#
#
# def get(n):
# if dp[n] != 0:
# return dp[n]
# if n == 1:
# return 1
# elif n == 2:
# return 2
# else:
# dp[n] = get(n - 1) + get(n - 2)
# return dp[n]
#
#
# print(get(n))
# n = int(input())
# a = 0
# for i in range(1, n // 2 + 1):
# if (n - i) % i == 0:
# a += 1
# print(a)
# n = int(input())
# if n % 2 == 0:
# print("Mahmoud")
# else:
# print("Ehab")
# n,m = list(map(int, input().split()))
# array = list(map(int, input().split()))
# b = [0 for i in range(n)]
# for i in array:
# b[i-1] += 1
# c = 1001
# for i in b:
# if c > i:
# c = i
# print(c)
# n,m = list(map(int, input().split()))
# if n > 2.71828182846 and m > 2.71828182846:
# if n > m:
# print(">")
# else:
# print("<")
# else:
# if n > m:
# print("<")
# else:
# print(">")
#
# n = list(map(int, input().split()))
# array = list(map(int, input().split()))
# c = 0
# for i in range(len(array)):
# if array[i] != 0:
# a = i + 1
# b = i
# while b != a:
# d = array[b]
# array[b] = 0
# b = array[d-1]
# c += 1
# print(c)
# n = list(map(int, input().split()))
# array = list(map(int, input().split()))
# a = 1000000001
# amount = 0
# for i in range(len(array)):
# c = array[n - i - 1]
# if c < a:
# amount = amount + c
# a = c
# elif c > a:
# amount = amount + a - 1
# a = a - 1
#
# print (amount)
n = int(input())
while 1 == 1:
a = str(n + 1)
n = n + 1
if a[0] != a[1] and a[0] != a[2] and a[0] != a[3] and a[1] != a[2]and a[2] != a[3] and a[1] != a[3]:
print (n)
break
| 800 |
PYTHON3
|
n = int(input())
if n % 2 == 0:
print(int(n/2))
for i in range(int(n/2-1)):
print('2', end=' ')
print('2')
else:
print(int(n/2-1) + 1)
for i in range(int(n/2-1)):
print('2', end=' ')
print('3')
| 800 |
PYTHON3
|
k, r = map(int, input().split())
shovel = k
for i in range(shovel*1000):
if ((shovel%10)== 0 or (shovel-r)%10 == 0):
break
else:
shovel += k
print(i+1)
| 800 |
PYTHON3
|
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
for i1 in range(int(input())):
n=int(input())
ans=0
turn=0
while n>0:
if (n%2==0 and n%4!=0) or n==4:
n=n//2
this=n
else:
n=n-1
this=1
if turn==0:
ans+=this
turn=1
else:
turn=0
print(ans)
| 1,400 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int l = 2229;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i <= l; i++) cout << 5;
cout << '\n';
for (int j = 0; j < l; j++) cout << 4;
cout << 5 << '\n';
return 0;
}
| 1,200 |
CPP
|
t = int(input())
while (t):
a = list(map(int,input().split()))
a.sort()
print(a[0]*a[2])
t -= 1
| 800 |
PYTHON3
|
n = int(input())
a = input().strip()
i = 0
ans = 0
while i < n:
countX = 0
while (i < n) and (a[i] == 'x'):
countX += 1
i += 1
if countX > 0:
ans += max(0, countX - 2)
else:
i += 1
print(ans)
| 800 |
PYTHON3
|
n,k=map(int,input().split())
if n%2==0:
d=int(n/2)
else:
d=int(n/2)+1
if k<=d:
print(2*k-1)
else:
print((k-d)*2)
| 900 |
PYTHON3
|
from sys import stdin
import bisect
import heapq
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def iin():
return int(input())
def lin():
return list(map(int, input().split()))
def main():
return map(int,input().split())
for _ in range(int(input())):
n=iin()
a,b=main()
l=a
z=0
su=0
t=b
q=float("-infinity")
for i in range(1,n):
a,b=main()
f=max(0,a-t)
q=max(q,f-a)
t=b
su+=f
z=max(0,l-t)
su+=z
q=max(q,z-l)
print(su-q)
| 1,600 |
PYTHON3
|
# stdin = open("testdata.txt")
# def input():
# return stdin.readline().strip()
def divisible(n, a, k):
dct = {}
for i in range(n):
dct[(k - a[i]%k)%k] = dct.get((k - a[i]%k)%k,0) + 1
if 0 in dct:
del dct[0]
y = list(dct.items())
if y:
x = max(dct.items(),key = lambda x: (x[-1], x[0]))
if len(dct.items()) == n and n == k:
return k
return x[0] + k*(x[1]-1) + 1
else:
return 0
q = int(input())
for _ in range(q):
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(divisible(n,a,k))
| 1,400 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int mo = 1000000007;
int m[14], tot, mm, num, mmm;
int a[14], b[14];
long long f[14], c[14], ans, now;
void get(int dep, int last, int ff) {
if (ff || dep == 0) {
f[tot - num] += c[last];
return;
}
if (a[dep] == 0) {
for (int j = 0; j <= 9; j++)
if (j != 4 && j != 7)
if (j <= m[dep]) {
a[dep] = j;
get(dep - 1, last - 1, a[dep] < m[dep]);
a[dep] = 0;
}
} else if (a[dep] <= m[dep])
get(dep - 1, last, a[dep] < m[dep]);
}
void dfs(int dep) {
if (dep > tot) {
get(tot, num, 0);
return;
}
for (int i = 1; i <= 3; i++) {
a[dep] = b[i];
if (i == 3) num++;
dfs(dep + 1);
if (i == 3) num--;
}
}
void go(int dep, int cc) {
if (dep > 6) {
long long t = f[now];
memset(b, 0, sizeof(b));
for (int i = 1; i <= 6; i++) {
t = t * (f[a[i]] - b[a[i]]) % mo;
b[a[i]]++;
}
ans += t;
ans %= mo;
return;
}
for (int i = 0; i < now; i++)
if (cc + i < now) {
a[dep] = i;
go(dep + 1, cc + i);
}
}
int main() {
cin >> mm;
b[1] = 4;
b[2] = 7;
b[3] = 0;
c[0] = 1;
for (int i = 1; i <= 12; i++) {
c[i] = c[i - 1] * 8 % mo;
}
while (mm > 0) {
m[++tot] = mm % 10;
mm = mm / 10;
}
dfs(1);
f[0]--;
for (int i = tot; i >= 1; i--) {
now = i;
go(1, 0);
}
cout << ans << endl;
}
| 1,900 |
CPP
|
for _ in range(int(input())):
a = int(input())
print(1,a-1)
| 800 |
PYTHON3
|
"""
Queremos determinar a cardinalidade do conjunto dos numeros
A = {x | x = lcm(a, b) / a}...
Queremos determinar |A|.
x = lcm(a, b) / a (i)
sabemos que:
lcm(a, b) * gcd(a, b) = ab (ii)
dividindo ambos lados da (ii) por gcd(a, b), vem que:
lcm(a, b) = ab / gcd(a, b) (iii)
onde gcd(a, b) = c, e c e o maior divisor comum de a e b.
substituindo (iii) em (i), temos:
x = lcm(a, b) / a
= (ab / gcd(a, b)) / a
= a**2 * b / gcd(a, b), onde gcd(a, b) = c, tal que c | a e c | b, logo:
= (a ** 2)b / c.
Agora note que c | a ** 2 e c | b, pois gcd(a, b) = c.
portanto, a cardinalidade do conjunto A e igual a quantidade de divisores
de b.
"""
from math import ceil, sqrt
def main():
b = int(input())
A = set()
for a in range(1, ceil(sqrt(b))+1):
if b % a == 0:
A.add(a)
A.add(b // a)
print(len(A))
if __name__ == "__main__":
main()
| 1,200 |
PYTHON3
|
t=int(input())
for _ in range(t):
a,b=map(int,input().split())
x=b-a
if x==0:
print(0)
elif x>0:
if x%2==0:
print(2)
else:
print(1)
else:
if x%2==0:
print(1)
else:
print(2)
| 800 |
PYTHON3
|
l=list(map(int,input().split(" ")))
n=l[0]
m=l[1]
k=l[2]
if(n>m or n>k):
print("No")
else:
print("Yes")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> used(m, 0);
vector<vector<int>> a(m);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
vector<int> cur;
for (int j = 0; j < m; ++j) {
if (s[j] == '#') {
cur.push_back(j);
}
}
for (auto x : cur) {
if (used[x]) {
if (a[x] != cur) {
cout << "No";
return 0;
}
} else {
used[x] = 1;
a[x] = cur;
}
}
}
cout << "Yes";
return 0;
}
| 1,300 |
CPP
|
from bisect import bisect_left as bl
t=int(input())
a=list(map(int,input().split()))
q,l=[],[0]*t
for i in range(t):
if a[i]==0:
q.append(i)
r=len(q)
for i in range(t):
if a[i]!=0:
p=bl(q,i)
if p==0:
l[i]=q[0]-i
elif p==r:
l[i]=i-q[-1]
else:
l[i]=min(i-q[p-1],q[p]-i)
print(*l)
| 1,200 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int findindex(string s, int len, char ch) {
for (int i = 0; i < len; i++) {
if (s[i] == ch) {
return i;
}
}
}
int main() {
string s;
cin >> s;
int len = s.size();
int cntr = 0, cntg = 0, cnty = 0, cntb = 0;
int index;
index = findindex(s, len, 'R');
for (int i = index; i < len; i += 4) {
if (s[i] == '!') cntr++;
}
for (int i = index; i >= 0; i -= 4) {
if (s[i] == '!') cntr++;
}
index = findindex(s, len, 'B');
for (int i = index; i < len; i += 4) {
if (s[i] == '!') cntb++;
}
for (int i = index; i >= 0; i -= 4) {
if (s[i] == '!') cntb++;
}
index = findindex(s, len, 'Y');
for (int i = index; i < len; i += 4) {
if (s[i] == '!') cnty++;
}
for (int i = index; i >= 0; i -= 4) {
if (s[i] == '!') cnty++;
}
index = findindex(s, len, 'G');
for (int i = index; i < len; i += 4) {
if (s[i] == '!') cntg++;
}
for (int i = index; i >= 0; i -= 4) {
if (s[i] == '!') cntg++;
}
cout << cntr << " " << cntb << " " << cnty << " " << cntg << endl;
return 0;
}
| 1,100 |
CPP
|
n = int(input())
b = [0] * 8
a = [int(x) for x in input().split()]
for i in a:
b[i] += 1
k1 = k2 = k3 = 0
if b[5] == b[7] == 0:
if b[3] > 0:
b[6] -= b[3]
b[1] -= b[3]
k2 = b[3]
b[3] = 0
if b[6] > 0:
k1 = b[6]
b[1] -= b[6]
b[2] -= b[6]
b[6] = 0
if b[4] > 0:
k3 = b[4]
b[1] -= b[4]
b[2] -= b[4]
b[4] = 0
if b[1] == b[2] == b[3] == b[4] == b[6] == 0:
for i in range(k3):
print('1 2 4')
for i in range(k1):
print('1 2 6')
for i in range(k2):
print('1 3 6')
else:
print('-1')
else:
print('-1')
| 1,200 |
PYTHON3
|
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
for _ in range(INT()):
N, K = MAP()
S = list(map(int, input()))
A = [[] for i in range(K)]
for i, s in enumerate(S):
A[i%K].append(s)
cnt1all = S.count(1)
ans = INF
for i in range(K):
M = len(A[i])
dp0 = [INF] * (M+1)
dp1 = [INF] * (M+1)
dp2 = [INF] * (M+1)
dp0[0] = 0
cnt1 = 0
for j in range(M):
cnt1 += (A[i][j] == 1)
dp0[j+1] = min(dp0[j+1], dp0[j] + (A[i][j] == 1))
dp1[j+1] = min(dp1[j+1], dp0[j] + (A[i][j] == 0))
dp1[j+1] = min(dp1[j+1], dp1[j] + (A[i][j] == 0))
dp2[j+1] = min(dp2[j+1], dp1[j] + (A[i][j] == 1))
dp2[j+1] = min(dp2[j+1], dp2[j] + (A[i][j] == 1))
cost = min(dp0[M], dp1[M], dp2[M])
ans = min(ans, cnt1all - cnt1 + cost)
print(ans)
| 1,900 |
PYTHON3
|
def main():
n = int(input())
a = list(map(int, input().split()))
k = input()
ans, s = 0, 0
for i in range(n):
if k[i] == "1":
ans = max(ans + a[i], s)
s += a[i]
print(ans)
if __name__ == '__main__':
main()
| 1,600 |
PYTHON3
|
lines = input()
lines= int(lines)
jin=['']*lines
for i in range(lines):
jin[i]= input()
for i in range(lines):
if(len(jin[i])>10):
print(jin[i][0]+str(len(jin[i])-2) +jin[i][len(jin[i])-1])
else:
print(jin[i])
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
while (b) {
b ^= a ^= b ^= a %= b;
}
return a;
}
long long LCM(long long a, long long b) {
int x = (a * b) / GCD(a, b);
return x;
}
long long maxarray(long long *arr, long long n) {
long long x = *max_element(arr, arr + n);
return x;
}
long long minarray(long long *arr, long long n) {
long long x = *min_element(arr, arr + n);
return x;
}
double triangle(double a, double b, double c) {
double s, area;
s = (a + b + c) / 2;
area = sqrt(fabs(s * (s - a) * (s - b) * (s - c)));
return area;
}
int main() {
int n, ans, i, j;
cin >> n;
ans = ((n * n) + 1) / 2;
cout << ans << endl;
;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (j % 2 == 0) {
cout << 'C';
} else {
cout << '.';
}
}
cout << endl;
i++;
if (i < n) {
for (j = 0; j < n; j++) {
if (j % 2 == 0) {
cout << '.';
} else {
cout << 'C';
}
}
cout << endl;
}
}
return 0;
}
| 800 |
CPP
|
stroka = input()
print(stroka[0].upper()+stroka[1:len(stroka)])
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
const int N = 30010;
const int N2 = 2010;
const int INF = 0x3f3f3f3f;
int n, d;
int w[N];
class DP2DMax {
public:
void Init(int max1, int max2, int min1 = 0, int min2 = 0) {
max1_ = max1;
max2_ = max2;
min1_ = min1;
min2_ = min2;
for (int i = min1_; i <= max1_; ++i) {
for (int j = min2_; j <= max2_; ++j) {
dp[Id1(i)][Id2(j)] = -INF;
}
}
}
void InitState(int a, int b, int w) { dp[a - min1_][b - min2_] = w; }
void Update(int a, int b, int a2, int b2, int w) {
if (!Valid(a, b) || !Valid(a2, b2)) {
return;
}
a = Id1(a);
b = Id2(b);
a2 = Id1(a2);
b2 = Id2(b2);
if (dp[a2][b2] < dp[a][b] + w) {
dp[a2][b2] = dp[a][b] + w;
}
}
int Value(int a, int b) {
if (!Valid(a, b)) {
return -INF;
}
return dp[Id1(a)][Id2(b)];
}
private:
int Id1(int x) { return x - min1_; }
int Id2(int x) { return x - min2_; }
bool Valid(int a, int b) {
return a >= min1_ && a <= max1_ && b >= min2_ && b <= max2_;
}
int max1_;
int max2_;
int min1_;
int min2_;
int dp[N][N2];
} dp2_max;
int main() {
scanf("%d%d", &n, &d);
int mx_x = 0;
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
++w[x];
mx_x = std::max(mx_x, x);
}
int k_max = 0;
int sum = 0;
while (1) {
sum += (d + k_max);
if (sum >= mx_x) {
break;
}
++k_max;
}
int k_min = 0;
sum = 0;
while (1) {
sum += (d - k_min);
if (d - k_min == 1 || sum >= mx_x) {
break;
}
++k_min;
}
dp2_max.Init(mx_x, k_max, d, -k_min);
dp2_max.InitState(d, 0, w[d]);
for (int i = d; i <= mx_x; ++i) {
for (int j = -k_min; j <= k_max; ++j) {
if (dp2_max.Value(i, j) != -INF) {
int step = d + j;
assert(step >= 1);
dp2_max.Update(i, j, i + step, j, w[i + step]);
dp2_max.Update(i, j, i + step + 1, j + 1, w[i + step + 1]);
dp2_max.Update(i, j, i + step - 1, j - 1, w[i + step - 1]);
}
}
}
int ans = 0;
for (int i = d; i <= mx_x; ++i) {
for (int j = -k_min; j <= k_max; ++j) {
ans = std::max(ans, dp2_max.Value(i, j));
}
}
printf("%d\n", ans);
return 0;
}
| 1,900 |
CPP
|
n,m=map(int,input().split())
if n<m:
print(n)
else:
(l, r) = (0, int(2e9))
n-=m
while l<r:
mid=(l+r)//2
val=mid*(mid+1)
if val>=2*n:
r=mid
else:
l=mid+1
print(m+l)
| 1,600 |
PYTHON3
|
from sys import stdin
def readInts():
return list(map(int, stdin.readline().split()))
def gcd(a,b):
if b==0:
return a
else:
return gcd(b, a%b)
y, w = readInts()
maxi = max(y, w) - 1
dom = 6 - maxi
greatest = gcd(dom,6)
print('{}/{}'.format(dom//greatest, 6//greatest))
| 800 |
PYTHON3
|
n = int(input())
print(*[1, 1, n-2] if n % 3 == 0 else [1, 2, n - 3])
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
__attribute__((constructor)) static void fast_cin() {
ios_base::sync_with_stdio(false);
cin.tie(0);
}
using ll = int64_t;
using ull = uint64_t;
using mp = pair<ll, ll>;
ostream &operator<<(ostream &fout, const vector<mp> &vec) {
for (const auto &el : vec) fout << el.first << "=" << el.second << ' ';
return fout;
}
template <typename T>
ostream &operator<<(ostream &fout, const vector<T> &vec) {
for (const auto &el : vec) fout << el << ' ';
return fout;
}
template <typename T>
istream &operator>>(istream &fin, vector<T> &vec) {
for (size_t i = 0; i < vec.size(); i++) fin >> vec[i];
return fin;
}
vector<string> split(const string &s, char c) {
vector<string> v;
ull st = 0, fn = 0, lvl = 0;
for (; fn < s.size(); fn++) {
if (s[fn] == c && lvl == 0) {
v.push_back(s.substr(st, fn - st));
st = fn + 1;
}
if (s[fn] == '(') {
lvl++;
}
if (s[fn] == ')') {
lvl--;
}
}
v.push_back(s.substr(st, fn - st));
return v;
}
void pr_var(vector<string>::iterator it) {
(void)it;
cout << endl;
}
template <typename T, typename... Args>
void pr_var(vector<string>::iterator it, T a, Args... args) {
cout << *it << "=" << a << " ";
pr_var(++it, args...);
}
ll div_ceil(ll n, ll d) {
ll res = n / d;
if (res >= 0) res += n % d ? 1 : 0;
return res;
}
ll gcd(ll a, ll b) {
a = llabs(a);
b = llabs(b);
while (a && b) a > b ? a %= b : b %= a;
return a + b;
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return c == 0 ? 0 : llabs(a / c * b);
}
const double PI = acos(-1.0);
constexpr double EPS = 1e-9;
constexpr double INF = 2e18;
using mt = tuple<ll, ll, ll>;
constexpr ll MAX = 1e5 + 5;
map<ll, ll> m;
int main() {
for (ll i = 2; i <= 1e6; i++) {
ll s = i * i * i;
m[s] = i;
}
ll n;
cin >> n;
for (ll tc = 0; tc < n; tc++) {
ll a, b;
cin >> a >> b;
do {
} while (0);
if (a == 1 && b == 1) {
cout << "Yes"
<< "\n";
continue;
}
if (a == 1 && b != 1) {
cout << "No"
<< "\n";
continue;
}
if (b == 1 && a != 1) {
cout << "No"
<< "\n";
continue;
}
ll c = a * b;
auto it = m.find(c);
if (it == m.end()) {
cout << "No"
<< "\n";
continue;
}
ll no = 0;
if (a % it->second != 0) no = 1;
if (b % it->second != 0) no = 1;
if (no) {
cout << "No"
<< "\n";
continue;
}
cout << "Yes"
<< "\n";
}
return 0;
}
| 1,700 |
CPP
|
def C():
s = input()
a , b = 0 , 0
for x in s:
if(x=='1'):
if(b%2==0):
print(4,3)
else:
print(4,1)
b+=1
else:
if(a%2==0):
print(1,1)
else:
print(3,1)
a+=1
C()
| 1,400 |
PYTHON3
|
a=int(input())
for i in range(a):
a,b=map(int,input().split())
s=input()
arr=[int(i) for i in s]
brr=[]
for i in arr:
if(i==0):
if(len(brr)>0):
brr.append(0)
else:
if(len(brr)==0 or brr[len(brr)-1]==0):
brr.append(1)
else:
brr[len(brr)-1]=brr[len(brr)-1]+1
while(len(brr)>0 and brr[len(brr)-1]==0):
brr.pop()
arr=[]
k=0
for i in brr:
if(i==0):
if(k==0):
arr.append(1)
k=1
else:
arr[len(arr)-1]=arr[len(arr)-1]+1
else:
arr.append(i)
k=0
ans=0
for i in range(1,len(arr)-1,2):
if(arr[i]*b+a>2*a):
ans=ans+a
else:
ans=ans+arr[i]*b
if(len(arr)==0):
print(0)
else:
print(ans+a)
| 1,300 |
PYTHON3
|
n=int(input())
flag=0
if n>0:
for i in range(n):
a,b,c=input().split()
b=int(b)
c=int(c)
if b>=2400 and c>b:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
else:
print("NO")
| 800 |
PYTHON3
|
num = int(input())
arr = list(map(int,input().strip().split()))[:num]
flag = 1
for i in range(0,num) :
if arr[i] == 1 :
flag = 0
if flag == 0 :
print("HARD")
else :
print("EASY")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
unsigned int f = 1, num = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) num = (num << 1) + (num << 3) + ch - '0', ch = getchar();
return num * f;
}
using namespace std;
int a[1000003];
int main() {
int n = read(), m = read();
long long ans = -n, x = 0;
for (int i = 1; i <= n; i++) a[i] = read(), ans += a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) x += a[i] > x;
cout << ans - a[n] + x;
return 0;
}
| 1,400 |
CPP
|
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
c = 0
for i in range(1,d+1):
if(i%k != 0 and i%l != 0 and i%m != 0 and i%n != 0):
c = c+1
print(d-c)
| 800 |
PYTHON3
|
n=int(input())
t=n
c=0
s=0
while t!=0:
c+=1
t=t//10
c-=1
a=pow(10,c)
a=a*(n//a)
a-=1
b=n-a
while(a!=0 or b!=0):
s+=a%10
s+=b%10
a=a//10
b=b//10
print(s)
| 1,100 |
PYTHON3
|
n, k, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
sum_row = 0
for elem in a:
sum_row += elem
max_ans = 0
for i in range(min(n + 1, m // sum_row + 1)):
ans = i * (k + 1)
m1 = m - sum_row * i
for j in range(k):
t = (n - i) * a[j]
if t <= m1:
m1 -= t
ans += (n - i)
else:
ans += m1 // a[j]
break
max_ans = max(max_ans, ans)
print(max_ans)
| 1,800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
string s;
cin >> s;
long long cur = 0, pre = 0;
long long ans = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'R') {
pre = i + 1;
}
cur = i + 1;
ans = max(ans, cur - pre);
}
long long x = s.length() + 1;
if (x - pre > ans)
cout << x - pre << endl;
else
cout << ans + 1 << endl;
}
}
| 1,100 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int maxn = 1010;
const int maxk = 110;
long long n, k, m;
long long f[maxn][maxk];
long long p1[maxn];
long long p2[maxn];
void build() {
p1[0] = p2[0] = 1;
for (int i = 1; i < maxn; i++) {
p1[i] = p1[i - 1] * 10 % k;
p2[i] = p2[i - 1] * 10 % m;
}
}
void solve() {
memset(f, 0, sizeof(f));
scanf("%I64d%I64d%I64d", &n, &k, &m);
build();
for (int i = 1; i < 10; i++) f[1][i % k]++;
for (int i = 1; i < n; i++)
for (int j = 0; j < k; j++)
for (int l = 0; l < 10; l++)
if (l * p1[i] % k != j)
f[i + 1][j] = (f[i + 1][j] + f[i][(k + j - (l * p1[i] % k)) % k]) % m;
else if (l)
f[i + 1][j] = (f[i + 1][j] + 1) % m;
long long ans = f[n][0] % m;
for (int i = 1; i < n; i++) ans = (ans + f[i][0] * 9 * p2[n - i - 1]) % m;
printf("%I64d", ans);
}
int main() {
solve();
return 0;
}
| 2,200 |
CPP
|
import sys
input = lambda : sys.stdin.readline().rstrip()
for _ in range(int(input())):
n=int(input())
a = [int(x) for x in input().split()]
b,c = [],[0]*(n)
st = []
for i in range(n):
while st and a[st[-1]]>a[i]:
st.pop()
b.append(st[-1] if len(st) else -1)
st.append(i)
st = []
for i in range(n-1,-1,-1):
while st and a[st[-1]]>a[i]:
st.pop()
c[i] = st[-1] if len(st) else -1
st.append(i)
f=False
for i in range(n):
if b[i]!=-1 and c[i]!=-1:
f=True
print("YES")
print(b[i]+1,i+1,c[i]+1)
break
if not f:
print("NO")
| 900 |
PYTHON3
|
for _ in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
if n==1:
print("1")
elif n==2:
if abs(arr[1]-arr[0])>1:
print("1")
else:
print("2")
else:
sum=0
arr.sort(reverse=False)
for i in range(n-1):
if (arr[i+1]-arr[i])>1:
sum+=1
if sum==n-1:
print("1")
else:
print("2")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[21][21];
int SG[41][41][41][41][2];
int get_SG(int min_x, int max_x, int min_y, int max_y, int type) {
if (SG[min_x][max_x][min_y][max_y][type] != -1)
return SG[min_x][max_x][min_y][max_y][type];
char vis[41] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (((j + i) & 1) != type) continue;
int _x = i + j, _y = i - j + m;
if (_x >= min_x && _x < max_x && _y >= min_y && _y < max_y) {
int g = 0;
if (a[i][j] == 'L') {
g = get_SG(min_x, _x, min_y, max_y, type) ^
get_SG(_x + 1, max_x, min_y, max_y, type);
} else if (a[i][j] == 'R') {
g = get_SG(min_x, max_x, min_y, _y, type) ^
get_SG(min_x, max_x, _y + 1, max_y, type);
} else {
g = get_SG(min_x, _x, min_y, _y, type) ^
get_SG(min_x, _x, _y + 1, max_y, type) ^
get_SG(_x + 1, max_x, min_y, _y, type) ^
get_SG(_x + 1, max_x, _y + 1, max_y, type);
}
vis[g] = 1;
}
}
}
for (int i = 0;; i++)
if (vis[i] == 0) return SG[min_x][max_x][min_y][max_y][type] = i;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", a[i]);
}
memset(SG, -1, sizeof(SG));
int ans =
get_SG(0, n + m - 1, 0, n + m, 0) ^ get_SG(0, n + m - 1, 0, n + m, 1);
if (ans)
puts("WIN");
else
puts("LOSE");
return 0;
}
| 2,500 |
CPP
|
import sys
read = lambda: sys.stdin.readline()
T = int(read())
for t in range(T):
n = int(read())
n3 = 0
while(n % 3 == 0):
n = n // 3
n3 += 1
n2 = 0
while(n % 2 == 0):
n = n // 2
n2 += 1
if(n != 1 or n2 > n3):
print(-1)
continue
print(n3 + (n3 - n2))
| 900 |
PYTHON3
|
n, a, x, b, y = map(int, input().split())
while a != x and b != y:
a += 1
if a == n + 1:
a = 1
b -= 1
if b == 0:
b = n
if a == b:
print("YES")
break
else:
print("NO")
| 900 |
PYTHON3
|
n=int(input())
count,count1=0,0
index,index1=0,0
a=[int(x) for x in input().split()]
for i in range(n):
if(a[i]%2==0):
index=i
count+=1
if(a[i]%2!=0):
index1=i
count1+=1
if(count==1):
print(index+1)
else:
print(index1+1)
| 1,300 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int p[4];
bool flag;
int main() {
cin >> p[0] >> p[1] >> p[2] >> p[3];
sort(p, p + 4);
for (int i = 0; i <= 1; i++) {
for (int j = i + 1; j <= 2; j++) {
for (int k = j + 1; k <= 3; k++) {
if (p[i] + p[j] > p[k]) {
cout << "TRIANGLE" << endl;
return 0;
}
if (p[i] + p[j] == p[k]) flag = true;
}
}
}
if (!flag)
cout << "IMPOSSIBLE" << endl;
else
cout << "SEGMENT" << endl;
return 0;
}
| 900 |
CPP
|
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int maxn = 1000005;
int nxt[maxn];
char a[maxn], b[maxn];
int main() {
scanf("%s", a + 1);
int n = strlen(a + 1);
int m = n;
for (register int i = 1; i <= n; i++) {
b[i] = a[i];
}
for (register int i = 2, j; i <= n; i++) {
j = nxt[i - 1];
while (j && a[i] != a[j + 1]) {
j = nxt[j];
}
if (a[i] == a[j + 1]) {
j++;
}
nxt[i] = j;
}
if (!nxt[n]) {
printf("Just a legend");
return 0;
}
while (1) {
n = nxt[n];
if (n == 0) {
break;
}
for (int i = nxt[n]; i <= m - 1; i++) {
if (nxt[i] == n) {
for (register int k = 1; k <= n; k++) {
printf("%c", b[k]);
}
return 0;
}
}
}
printf("Just a legend");
return 0;
}
| 1,700 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] != t[n - i - 1]) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
| 800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int n, t, ans, a[100];
long long sum, mult = 1;
int main() {
cin >> t;
while (t--) {
sum = 0;
mult = 1;
ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (mult * a[i] == 0) {
a[i]++;
ans++;
}
sum += a[i];
}
if (sum == 0)
cout << ans + 1 << "\n";
else
cout << ans << "\n";
}
return 0;
}
| 800 |
CPP
|
from sys import stdin, stdout, exit
n,k = map(int, stdin.readline().split())
s = stdin.readline().strip()
def z(winner):
return 'tokitsukaze' if winner == 0 else 'quailty'
ones = [i for i in range(n) if s[i] == '1']
zeros = [i for i in range(n) if s[i] == '0']
if not ones or not zeros:
print(z(0))
exit()
if max(ones) - min(ones)+1 <= k or max(zeros) - min(zeros)+1 <= k:
print(z(0))
exit()
if max(ones) - min(ones)+1 >= k+2 or max(zeros) - min(zeros)+1 >= k+2:
print("once again")
exit()
if n == 2*(k+1):
print("once again")
exit()
print(z(1))
| 2,300 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l[1000], r[1000];
int n, p1, p2, p3, t1, t2;
cin >> n >> p1 >> p2 >> p3 >> t1 >> t2;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> l[i] >> r[i];
ans += (r[i] - l[i]) * p1;
if (i > 0) {
if (l[i] - r[i - 1] > t1) {
ans += t1 * p1;
int t = l[i] - r[i - 1] - t1;
if (t > t2) {
ans += t2 * p2;
ans += (t - t2) * p3;
} else
ans += t * p2;
} else
ans += (l[i] - r[i - 1]) * p1;
}
}
cout << ans << endl;
}
| 900 |
CPP
|
z,zz=input,lambda:list(map(int,z().split()))
zzz=lambda:[int(i) for i in stdin.readline().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f
from bisect import bisect as bs
from bisect import bisect_left as bsl
from itertools import accumulate as ac
def lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))
def prime(x):
p=ceil(x**.5)+1
for i in range(2,p):
if (x%i==0 and x!=2) or x==0:return 0
return 1
def dfs(u,visit,graph):
visit[u]=True
for i in graph[u]:
if not visit[i]:
dfs(i,visit,graph)
###########################---Test-Case---#################################
"""
"""
###########################---START-CODING---##############################
n=int(z())
li={}
for _ in range(n):
x=z()
try:
print(x+str(li[x]))
li[x]+=1
except:
li[x]=1
print('OK')
| 1,300 |
PYTHON3
|
n, m=map(int, input().split())
a=0; an=0; ans=0; x=n%m; y=n//m
for i in range(m):
for j in range(m):
if ((i*i+j*j)%m)==0:
a+=1
for i in range(1, x+1):
for j in range(1, x+1):
if ((i*i+j*j)%m)==0:
an+=1
for i in range(1, x+1):
for j in range(m):
if ((i*i+j*j)%m)==0:
ans+=1
print(y*y*a+2*y*ans+an)
| 1,600 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = (0); i < ((n)); ++i) cin >> a[i];
vector<vector<int> > g(n);
for (int i = (0); i < ((m)); ++i) {
int x, y;
cin >> x >> y;
--x;
--y;
g[x].push_back(y);
g[y].push_back(x);
}
vector<int> used(n);
int res = 0;
for (int t = (0); t < ((n)); ++t) {
int best = -1;
pair<int, int> bestRes(1e9, 1e9);
for (int i = (0); i < ((n)); ++i)
if (!used[i]) {
int sum = 0;
for (int j = (0); j < (((int)g[i].size())); ++j) {
if (!used[g[i][j]]) sum += a[g[i][j]];
}
if (best == -1 || bestRes.second < a[i] ||
bestRes.second == a[i] && bestRes.first > sum) {
best = i;
bestRes = make_pair(sum, a[i]);
}
}
used[best] = 1;
res += bestRes.first;
}
cout << res << endl;
return 0;
}
| 1,400 |
CPP
|
sl = ['a', 'o', 'y', 'e', 'u', 'i']
t = [i for i in input().lower() if i not in sl]
print('.', '.'.join(t), sep='')
| 1,000 |
PYTHON3
|
weight = int(input())
if (weight%2)==0 and weight>2 and weight<=100 and weight>=1:
print("YES")
else:
print("NO")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const long long lim = 1e9 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long i, j, n, x;
cin >> n;
x = n / 2;
if (x % 2 == 1) {
cout << "NO\n";
continue;
}
long long a[n / 2], asum, bsum, b[n / 2];
asum = 0;
bsum = 0;
for (i = 1; i <= n / 2; ++i) {
a[i - 1] = 2 * i;
asum += a[i - 1];
}
for (i = 0; i < n / 2 - 1; ++i) {
b[i] = (2 * i) + 1;
bsum += b[i];
}
b[n / 2 - 1] = asum - bsum;
cout << "YES\n";
for (i = 0; i < n / 2; ++i) cout << a[i] << " ";
for (i = 0; i < n / 2; ++i) cout << b[i] << " ";
cout << endl;
}
return 0;
}
| 800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long a[100000];
int main() {
long long n;
long long cnt = 0;
scanf("%I64d", &n);
for (long long i = 0; i < n; i++) {
scanf("%I64d", &a[i]);
for (long long j = 0; j < i; j++)
if (a[j] > a[i]) cnt++;
}
cout << (cnt % 2 + (cnt / 2) * 4) << endl;
return 0;
}
| 1,900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500;
long long N;
long long A[MAXN];
long long calc(long long minv) {
long long res = 0;
for (long long i = 0; i < N; ++i) {
long long h = A[i] / (minv + 1);
long long k = A[i] % (minv + 1);
if (k == 0) {
res += h;
continue;
}
long long f = minv - k;
if (h < f) return 1LL << 60;
res += h + 1;
}
return res;
}
signed main() {
ios::sync_with_stdio(0);
{
cin >> N;
for (long long i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A, A + N);
}
{
long long ans = 1LL << 50;
for (long long i = 1; i * i <= A[0]; ++i) {
ans = min(ans, calc(i));
ans = min(ans, calc(A[0] / i));
if (i - 1 > 0) {
ans = min(ans, calc(i - 1));
}
if (A[0] / i - 1 > 0) {
ans = min(ans, calc(A[0] / i - 1));
}
}
cout << ans << endl;
}
return 0;
}
| 2,500 |
CPP
|
t = int(input())
for _ in range(t):
a,b = [int(i) for i in input().split()]
diff = abs(a-b)
ans = diff//10 + (1 if diff%10 != 0 else 0)
print(ans)
| 800 |
PYTHON3
|
for _ in range(int(input())):
n,a,b,c,d=map(int,input().split())
w1=a-b
w2=a+b
g1=c-d
g2=c+d
if n*w1 >g2 or n*w2<g1:
print("No")
else:
print("Yes")
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::map<std::string, int> names;
int n;
int m;
std::cin >> n >> m;
int h = n;
unsigned i = 1 << n;
while (n--) {
std::string name;
std::cin >> name;
names.emplace(std::move(name), n);
}
std::vector<unsigned> forbidden(m);
for (auto&& mask : forbidden) {
std::string a;
std::string b;
std::cin >> a >> b;
mask = 1 << names.find(a)->second | 1 << names.find(b)->second;
}
int best_h = 0;
unsigned best_mask = 0;
while (i--) {
if (h > best_h) {
auto it =
std::find_if(forbidden.begin(), forbidden.end(), [&](unsigned f) {
f &= i;
return f & (f - 1);
});
if (it == forbidden.end()) {
best_h = h;
best_mask = i;
}
}
unsigned j = i & ~(i - 1);
while (j >>= 1) {
h++;
}
h--;
}
std::cout << best_h << '\n';
for (const auto& p : names) {
if (best_mask & 1 << p.second) std::cout << p.first << '\n';
}
return 0;
}
| 1,500 |
CPP
|
def mdc(a, b):
while b:
a, b = b, a%b
return a
y, w = map(int, input().split())
n = 7 - max(y,w)
if(y == 1 and w == 1):
print("1/1")
else:
if(mdc(6, n) == 1):
print(str(n) + '/6')
else:
print(str(int(n/mdc(6, n))) + '/' + str(int(6/mdc(6, n))))
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
bool checking(string s) {
int c = 0;
int n = s.length();
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '0') c++;
if (c >= 6 and s[i] == '1') return true;
}
return false;
}
int main() {
string s;
cin >> s;
if (checking(s))
cout << "yes";
else
cout << "no";
return 0;
}
| 1,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 8000000;
int cnt, p[70000], P[8000091];
bool vis[70000], v[8000091];
void prime(int n) {
int i, j, k;
for (int i = 2; i <= n; i += 1) {
if (!vis[i]) p[++cnt] = i;
k = n / i;
for (j = 1; j <= cnt && p[j] <= k; j += 1) {
vis[i * p[j]] = 1;
if (i % p[j] == 0) break;
}
}
}
int main() {
prime(20000);
int t, l, u, i, j, k, w, r, x, ans = 0;
scanf("%d%d", &l, &u);
if (l <= 2 && u >= 2) ans = 1;
if (l == 1) l = 2;
w = l;
if (w <= u)
for (t = min(l + inf, u);; t = min(t + inf, u)) {
for (i = w; i <= t; i += 1) v[i - w] = 0;
r = (int)sqrt((double)t);
for (i = 1;; i += 1) {
if (p[i] > r) break;
k = (w - 1) / p[i] + 1;
x = t / p[i] + 1;
for (j = max(2, k); j <= x; j += 1) v[j * p[i] - w] = 1;
}
j = t - w;
for (i = 0; i <= j; i += 1)
if (!v[i] && (i + w) % 4 == 1) ans += 1;
if (t == u) break;
w = t + 1;
}
cout << ans;
return 0;
}
| 2,200 |
CPP
|
import sys
input = lambda: sys.stdin.readline().rstrip('\r\n')
def solve():
T = int(input())
for i in range(T):
word_len = int(input())
bigrams = list(map(list, input().split()))
ans = []
ans.append(bigrams[0][0])
for i in range(1, word_len-2):
if bigrams[i][0] == bigrams[i-1][1]:
ans.append(bigrams[i-1][1])
else:
ans.append(bigrams[i-1][1])
ans.append(bigrams[i][0])
ans.append(bigrams[word_len-3][1])
if len(ans) < word_len:
ans.append('a')
print(''.join(ans))
solve()
| 800 |
PYTHON3
|
n, k = map(int, input().split())
total = 4 * 60
k = total - k
tmp = n
c = 1
while tmp>0 and k>0:
k -= c * 5
if k < 0:
break
tmp -= 1
c += 1
if tmp > 0:
print(n - tmp)
else:
print(n)
| 800 |
PYTHON3
|
s = str(input())
s = s.replace('1111111', '3', 20)
s = s.replace('0000000', '3', 20)
if s.count('3') >= 1:
print('YES')
else:
print('NO')
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 == 0)
cout << -1 << endl;
else {
for (int i = 0; i < n; i++) {
if (i) cout << " ";
cout << i;
}
cout << endl;
for (int i = 1; i <= n; i++) {
if (i > 1) cout << " ";
cout << i % n;
}
cout << endl;
for (int i = 0; i < n; i++) {
if (i) cout << " ";
cout << (2 * i + 1) % n;
}
cout << endl;
}
return 0;
}
| 1,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int n, m, k;
int main() {
scanf("%d%d%d", &n, &m, &k);
double res;
if (m <= k)
res = 1.0;
else if (m > n + k)
res = 0.0;
else {
res = 1.0;
for (int _b = (k), i = (0); i <= _b; i++) {
res /= n + i + 1;
res *= m - i;
}
res = 1 - res;
}
printf("%.10lf\n", res);
return 0;
}
| 2,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long INF = 1e18L + 7;
template <class n, class second>
ostream &operator<<(ostream &p, pair<n, second> x) {
return p << "<" << x.first << ", " << x.second << ">";
}
template <class n>
auto operator<<(ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value,
decltype(y.begin(), p)>::type {
int o = 0;
p << "{";
for (auto c : y) {
if (o++) p << ", ";
p << c;
}
return p << "}";
}
void dor() { cerr << '\n'; }
template <class n, class... second>
void dor(n p, second... y) {
cerr << p << " ";
dor(y...);
}
template <class n, class second>
void mini(n &p, second y) {
if (p > y) p = y;
}
template <class n, class second>
void maxi(n &p, second y) {
if (p < y) p = y;
}
const int N = 1e5 + 7;
int n;
vector<vector<int> > ans;
int t[N];
void zle() {
cout << "NO" << '\n';
exit(0);
}
void ok() {
cout << "YES" << '\n';
cout << ans.size() << '\n';
for (auto it : ans) {
cout << it[0] << " " << it[1] << " " << it[2] << '\n';
}
exit(0);
}
void first(int a, int b, int c) {
ans.push_back({a, b, c});
t[a] ^= 1;
t[b] ^= 1;
t[c] ^= 1;
}
void g(int b, int c) {
int r = c - b;
int a = b - r;
first(a, b, c);
}
vector<int> kraw;
int skad[1 << 18];
int dist[1 << 18];
queue<int> Q;
void brut(int b) {
for (int i = 0; i < b; ++i) {
for (int r = 1; i + 2 * r < b; ++r) {
int m = 0;
m |= 1 << i;
m |= 1 << (i + r);
m |= 1 << (i + 2 * r);
kraw.push_back(m);
}
}
int second = 0;
for (int i = 0; i < b; ++i) {
if (t[i + 1]) second |= 1 << i;
}
for (int i = 0; i < 1 << b; ++i) {
dist[i] = inf;
}
dist[second] = 0;
Q.push(second);
while (!Q.empty()) {
int v = Q.front();
Q.pop();
for (auto it : kraw) {
if (dist[v ^ it] == inf) {
dist[v ^ it] = dist[v] + 1;
skad[v ^ it] = v;
Q.emplace(v ^ it);
}
}
}
if (dist[0] == inf) zle();
vector<int> path;
int curr = 0;
while (curr != second) {
path.emplace_back(curr ^ skad[curr]);
curr = skad[curr];
}
reverse((path).begin(), (path).end());
for (auto it : path) {
vector<int> foo;
for (int i = 0; i < b; ++i) {
if (it & (1 << i)) foo.push_back(i + 1);
}
first(foo[0], foo[1], foo[2]);
}
ok();
}
void solve(int b) {
if (b <= 13) {
brut(b);
return;
}
int sum = 0;
for (int i = b - 2; i <= b; ++i) {
sum += t[i];
}
if (sum == 3) {
first(b - 2, b - 1, b);
solve(b - 3);
} else if (sum == 0)
solve(b - 3);
else if (sum == 1) {
for (int i = b - 2; i <= b; ++i) {
if (t[i]) {
first(i - 6, i - 3, i);
break;
}
}
solve(b - 3);
} else {
if (!t[b]) {
g(b - 2, b - 1);
solve(b - 3);
} else if (!t[b - 1]) {
g(b - 2, b);
solve(b - 3);
} else {
vector<int> zap;
for (int i = b - 5; i <= b - 3; ++i) {
if (t[i]) zap.push_back(i);
}
if (zap.empty()) {
g(b - 5, b - 1);
g(b - 5, b);
} else if (zap.size() == 3) {
g(b - 3, b - 1);
g(b - 4, b);
} else if (zap.size() == 2) {
g(zap.back(), b);
g(zap[zap.size() - 2], b - 1);
} else {
if (zap[0] == b - 5) {
first(b - 5, b - 3, b - 1);
first(b - 6, b - 3, b);
} else if (zap[0] == b - 4) {
first(b - 2, b - 1, b);
first(b - 6, b - 4, b - 2);
} else if (zap[0] == b - 3) {
first(b - 6, b - 3, b);
g(b - 6, b - 1);
}
}
solve(b - 6);
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> t[i];
}
solve(n);
for (int i = 1; i <= n; ++i) {
assert(t[i]);
}
}
| 2,600 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char E[1005][1005];
char D[1005][1005];
char getc1() {
char c = getchar();
while (c != '.' && c != 'w' && c != 'b') c = getchar();
return c;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
E[i][0] = '.';
for (int j = 1; j <= m; j++) {
E[i][j] = getc1();
if (D[i][j] && E[i][j] == '.') {
puts("NO");
return 0;
}
if (D[i][j]) E[i][j] = '.';
}
for (int j = 1; j <= m; j++) {
if (E[i][j] == 'b' && E[i][j - 1] == '.') {
puts("NO");
return 0;
}
if (E[i][j] == 'w' && E[i][j - 1] == '.') {
if (E[i][j + 1] == 'b') {
if (E[i][j + 2] == 'w') {
E[i][j] = E[i][j + 1] = E[i][j + 2] = '.';
D[i][j] = D[i][j + 1] = D[i][j + 2] = (i % 2 ? 'a' : 'b') - '.';
} else {
puts("NO");
return 0;
}
} else {
E[i][j] = '.';
D[i][j] = D[i + 1][j] = D[i + 2][j] = (j % 2 ? 'c' : 'd') - '.';
if (i + 2 > n) {
puts("NO");
return 0;
}
}
}
}
}
puts("YES");
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) putchar(D[i][j] + '.');
putchar(10);
}
return 0;
}
| 2,000 |
CPP
|
a,c=input().split(":")
d,f=input().split(":")
mint=(((int(d)-int(a))*60)+int(f)-int(c))//2
x=(int(a)*60)+int(c)
mint=mint+x
hr=mint//60
minte=mint%60
if hr//10==0:
hr="%02d" % hr
if minte//10==0:
minte="%02d" % minte
print(str(hr)+":"+str(minte))
| 1,000 |
PYTHON3
|
# f = open('test.py')
# def input():
# return f.readline()
from collections import defaultdict
def read_list():
return list(map(int,input().strip().split(' ')))
def print_list(l):
print(' '.join(map(str,l)))
N = int(input())
for _ in range(N):
s = input()
n = int(input())
b = read_list()
dic = [0]*26
for c in s:
dic[ord(c)-ord('a')]+=1
now = 25
state = [0]*n
big = set()
count = 0
res = ['0']*n
tmp = b.count(0)
count+=tmp
while dic[now]<tmp:
now-=1
# print(now)
dic[now]-=tmp
c = chr(ord('a')+now)
last = 0
for _ in range(tmp):
find = b.index(0,last)
res[find] = c
last = find+1
big.add(find)
for i in range(n):
if i not in big:
for bign in big:
state[i]+=abs(bign-i)
# print(res)
# print(state)
now -= 1
while count<n:
this = []
for i in range(n):
if i not in big and state[i]==b[i]:
this.append(i)
l = len(this)
while dic[now]<l:
now-=1
c = chr(ord('a')+now)
for i in this:
big.add(i)
res[i] = c
for i in range(n):
if i not in big:
for bign in this:
state[i]+=abs(bign-i)
count+=l
now-=1
print(''.join(map(str,res)))
| 1,800 |
PYTHON3
|
n = int(input())
x = 0
for i in range(n):
s = input()
if ((s == "++X") | (s == "X++")):
x += 1
elif ((s == "--X") | (s == "X--")):
x -= 1
print(x)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
void solve() {
long long int n, d, a;
cin >> n >> d;
vector<long long int> v;
long long int on = 0;
for (long long int i = 0; i < n; i++) {
cin >> a;
if (a) {
on++;
}
v.push_back(a);
}
if (!on) {
cout << "0"
<< "\n";
return;
}
long long int mx = 1, cycle = 0;
for (long long int i = 0; i < n; i++) {
if (v[i] != 1) {
continue;
}
long long int ln = 0, prev = i;
while (v[prev] == 1) {
v[prev] = 2;
prev = (prev - d + n) % n;
ln++;
}
if (v[prev] == 2) {
cycle = 1;
break;
}
prev = i;
ln--;
v[prev] = 1;
while (v[prev] == 1) {
v[prev] = 2;
prev = (prev + d + n) % n;
ln++;
}
mx = max(mx, ln);
}
if (cycle) {
mx = -1;
}
cout << mx << "\n";
}
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) solve();
return 0;
}
| 1,700 |
CPP
|
t = int(input())
def devideIt (n):
count = 0
while n != 1:
if n % 2 == 0:
n = n // 2
elif n % 3 == 0:
n = (2 * n) // 3
elif n % 5 == 0:
n = (4 * n) // 5
else:
return -1
count+=1
return count
for i in range(t):
print(devideIt(int(input())))
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
map<pair<int, int>, int> m;
m[{0, 0}] = 1;
int x = 0, y = 0, prev = 1, res = INT_MAX;
for (register int i = 0; i < n; i++) {
if (s[i] == 'L')
x--;
else if (s[i] == 'R')
x++;
else if (s[i] == 'U')
y++;
else
y--;
if (m[{x, y}] > 0) {
res = min(res, prev + 1 - m[{x, y}]);
}
m[{x, y}] = prev + 1;
prev++;
}
if (res == INT_MAX) {
cout << -1 << "\n";
return;
}
map<pair<int, int>, int> m1;
m1[{0, 0}] = 1;
int res1;
x = 0, y = 0, prev = 1, res1 = INT_MAX;
for (register int i = 0; i < n; i++) {
if (s[i] == 'L')
x--;
else if (s[i] == 'R')
x++;
else if (s[i] == 'U')
y++;
else
y--;
if (m1[{x, y}] > 0) {
res1 = min(res1, prev + 1 - m1[{x, y}]);
if (res1 == res) {
cout << m1[{x, y}] << " " << prev << "\n";
return;
}
}
m1[{x, y}] = prev + 1;
prev++;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
;
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
| 1,500 |
CPP
|
n, k = map(int, input().split())
print(('abcdefghijklmnopqrstuvwxyz'[:k] * n)[:n])
# Made By Mostafa_Khaled
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
struct mat {
long long a[100][100];
} base, ans;
long long n, k, N;
long long c[100][100];
void mul(mat &c, mat a, mat b) {
for (int i = 0; i <= N; ++i)
for (int j = 0; j <= N; ++j) c.a[i][j] = 0;
for (int k = 0; k <= N; ++k)
for (int i = 0; i <= N; ++i)
for (int j = 0; j <= N; ++j)
c.a[i][j] = (c.a[i][j] + a.a[i][k] * b.a[k][j] % mod) % mod;
}
int main() {
cin >> n >> k;
c[0][0] = 1;
for (int i = 1; i <= k; ++i) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j <= i - 1; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
N = 2 * k + 2;
for (int i = 0; i <= N - 1; ++i) ans.a[0][i] = 1;
base.a[N][N] = base.a[N - 1][N] = 1;
for (int i = 0; i <= k; ++i)
for (int j = 0; j <= i; ++j)
base.a[k + 1 + j][i] = base.a[j][i + k + 1] =
base.a[k + 1 + j][k + 1 + i] = c[i][j];
while (n) {
if (n & 1) mul(ans, ans, base);
mul(base, base, base);
n >>= 1;
}
cout << ans.a[0][N] << endl;
return 0;
}
| 0 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int a[((int)6)][((int)6)];
vector<string> res;
void _swap1(int i, int j) {
string x = "";
x += (char)(i + '1');
string y = "";
y += (char)(j + '1');
for (int p = 0; p < 3; p++)
res.push_back("U" + y), res.push_back("L" + x), res.push_back("U" + y),
res.push_back("R" + x);
res.push_back("U" + y);
}
void _swap2(int i, int j) {
string x = "";
x += (char)(i + '1');
string y = "";
y += (char)(j + '1');
for (int p = 0; p < 3; p++)
res.push_back("R" + x), res.push_back("U" + y), res.push_back("R" + x),
res.push_back("D" + y);
res.push_back("R" + x);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < ((int)6); i++)
for (int j = 0; j < ((int)6); j++) {
char c;
cin >> c;
if (c >= '0' && c <= '9')
a[i][j] = c - '0';
else
a[i][j] = c - 'A' + 10;
}
for (int i = 0; i < ((int)6); i++)
for (int j = 0; j < ((int)6); j++) {
int now_i = -1, now_j = -1;
for (int i2 = 0; i2 < ((int)6); i2++)
for (int j2 = 0; j2 < ((int)6); j2++)
if (a[i2][j2] == i * ((int)6) + j) {
now_i = i2;
now_j = j2;
break;
}
while (now_j != j) {
int nxt = (now_j - 1 + ((int)6)) % ((int)6);
swap(a[now_i][now_j], a[now_i][nxt]);
_swap1(now_i, nxt);
now_j = nxt;
}
while (now_i != i) {
int nxt = (now_i - 1 + ((int)6)) % ((int)6);
swap(a[now_i][now_j], a[nxt][now_j]);
_swap2(nxt, now_j);
now_i = nxt;
}
}
cout << res.size() << "\n";
for (auto u : res) cout << u << "\n";
return 0;
}
| 2,800 |
CPP
|
from math import ceil
n=int(input())
a=list(map(int,input().split()))
c=a.count(1)
c1=a.count(3)
w=min(c,c1)
ans=a.count(4)
c-=w
c1-=w
ans+=w
ans+=c1
#print(ans,c1,w,c)
ss=c+(a.count(2)*2)
ans+=ceil(ss/4)
print(ans)
| 1,100 |
PYTHON3
|
for _ in range(int(input())):
x,y,n=map(int,input().split())
z=n%x
if z==y:
print(n)
elif z>y:
print(n-(z-y))
else:
print(n-z-x+y)
| 800 |
PYTHON3
|
n = int(input())
a = [*map(int, input().split())]
ans = 0
j = 1
for i in range(1, n):
if a[i] <= a[i - 1] * 2:
j += 1
else:
ans = max(ans, j)
j = 1
print(max(ans, j))
| 1,200 |
PYTHON3
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Wed Oct 31 19:15:37 2018
@author: LX
"""
word = input()
print(word[0].upper() + word[1:])
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, dp[100][100], tak[100][100];
pair<long long, pair<long long, long long> > a[100];
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i].second.first >> a[i].first;
a[i].second.second = i;
}
for (int i = 1; i <= 75; i++)
for (int j = 0; j <= 75; j++) tak[i][j] = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) dp[0][i] = -9999999999999999;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= min(k, (long long)i); j++) {
long long ra1 = dp[i - 1][j] + a[i].first * (k - 1);
long long ra2 = -9999999999999999;
if (j) ra2 = dp[i - 1][j - 1] + a[i].second.first + a[i].first * (j - 1);
if (ra1 <= ra2) {
tak[i][j] = 1;
}
dp[i][j] = max(ra1, ra2);
}
for (int j = min(k, (long long)i) + 1; j <= n; j++)
dp[i][j] = -9999999999999999;
}
vector<long long> ans, las;
long long p = k;
for (int i = n; i >= 1; i--) {
if (tak[i][p]) {
p--;
ans.push_back(a[i].second.second);
} else {
las.push_back(a[i].second.second);
}
}
reverse(ans.begin(), ans.end());
cout << n + (int)las.size() << '\n';
for (int i = 0; i < (int)ans.size() - 1; i++) cout << ans[i] << " ";
for (int i = 0; i < las.size(); i++) {
cout << las[i] << " -" << las[i] << " ";
}
cout << ans[(int)ans.size() - 1] << '\n';
}
int main() {
ios::sync_with_stdio(false);
long long q;
cin >> q;
while (q--) solve();
return 0;
}
| 2,500 |
CPP
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.