solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
q=int(input())
s=[]
g=0
for i in range(q):
a=int(input())
s.append(a)
for j in range(len(s)):
g=0
while s[j]%2!=0:
s[j]+=1
g+=1
if s[j]==2:
g=2
print(g,sep='') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bitset<10000005> pbs;
vector<long long> vec;
void bitwiseSieve(long long n) {
long long finalBit = sqrt(n) + 1;
pbs.set();
vec.push_back(2);
for (long long i = 3; i <= finalBit; i += 2) {
if (pbs[i]) {
for (int j = i * i; j <= n; j += i) pbs[j] = 0;
}
}
for (int i = 3; i <= 1000005; i += 2)
if (pbs[i]) vec.push_back(i);
}
map<long long, long long> c;
void khelo(long long n) {
for (long long i = 0; i < vec.size() && vec[i] * vec[i] <= n && n > 1; ++i) {
if (n % vec[i] == 0) {
c[vec[i]]++;
while (n % vec[i] == 0 && n > 1) {
n /= vec[i];
}
}
}
if (n != 1) {
c[n]++;
}
}
long long a[100005];
void solve() {
long long n;
cin >> n;
if (n == 1) {
cout << 1 << "\n";
return;
}
for (long long i = 0; i < n; ++i) {
cin >> a[i];
}
for (long long i = 0; i < n; ++i) {
if (a[i] != 1) khelo(a[i]);
}
long long ans = 0;
if (c.size() == 0) {
cout << 1 << "\n";
return;
}
for (auto it = c.begin(); it != c.end(); ++it) {
ans = max(it->second, ans);
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(0);
bitwiseSieve(100005);
int t = 1;
int c = 1;
while (t--) {
solve();
c++;
}
}
| 8 | CPP |
i=input
print(['No','Yes'][sorted(i())<sorted(i())[::-1]]) | 0 | PYTHON3 |
def incrementtime(h,m,s):
t=s.split(":")
ho=int(t[0])
mi=int(t[1])
if(mi+1<m):
mi+=1
return (t[0]+":"+(str(mi)).zfill(2))
elif (mi+1==m):
temp="00"
if(ho+1<h):
ho+=1
return((str(ho)).zfill(2)+":"+temp)
elif(ho+1==h):
return(temp+":"+temp)
def reflect(s):
t=s.split(":")
m=[ t[0][0],t[0][1],t[1][0],t[1][1] ]
n=[]
for i in m:
if(i=="0"):
n.append("0")
elif(i=="1"):
n.append("1")
elif(i=="2"):
n.append("5")
elif(i=="5"):
n.append("2")
elif(i=="8"):
n.append("8")
return (n[3]+n[2]+":"+n[1]+n[0])
def checkvalidreflection(h,minutes,s):
l=["0","1","2","5","8"]
t=s.split(":")
m=[ t[0][0],t[0][1],t[1][0],t[1][1] ]
for i in m:
if (i not in l):
return False
reflected=reflect(s)
tr=list(reflected.split(":"))
h1=(int(tr[0]))
m1=(int(tr[1]))
if(h1< h and m1<minutes ):
return True
else:
return False
def getnearest(h,m,s):
time=s
while(not checkvalidreflection(h,m,time)):
time=incrementtime(h,m,time)
return time
t=int(input())
for i in range(t):
p=input()
q=p.split(" ")
h=int(q[0])
m=int(q[1])
s=input()
ans=getnearest(h,m,s)
print(ans) | 8 | PYTHON3 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
int main() {
int i, j, k, a, b, c, L, f;
vector<int> v, v2;
while(cin >> c >> L, c||L) {
for(i = 0; 1; i++) {
v2.push_back(c);
while(c >= 1) {
v.push_back(c % 10);
c /= 10;
}
while(v.size() < L) {
v.push_back(0);
}
sort(v.begin(), v.begin() + L);
a = b = 0;
for(k = 0; k < L; k++) {
a += v[k] * pow(10, k);
b += v[L - k - 1] * pow(10, k);
}
c = a - b;
f = 0;
for(j = 0; j < v2.size(); j++) {
if(c == v2[j]) {
f++;
break;
}
}
if(f) {
cout << j << ' ' << c << ' ' << i + 1 - j << endl;
break;
}
v.clear();
}
v.clear();
v2.clear();
}
return 0;
}
| 0 | CPP |
a, b = map(int, input().split())
if a == b:
print(0)
exit()
aa = ""
bb = ""
while a or b:
aa += str(a % 2)
bb += str(b % 2)
a //= 2
b //= 2
aa = aa[::-1]
bb = bb[::-1]
# print(aa)
# print(bb)
idx = 0
while aa[idx] == bb[idx]:
idx += 1
# print(idx)
ln = len(aa)
r = 2 ** (ln - idx) - 1
print(r)
| 10 | PYTHON3 |
t=input()
aa = [int(a) for a in input().split()]
print(sum(aa)/int(t))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int gc(long long int kl, long long int yu) {
long long int pp;
for (pp = min(kl, yu); pp >= 1; pp--) {
if (kl % pp == 0 && yu % pp == 0) break;
}
if (pp == 1)
return 1;
else
return 0;
}
int isP(long int hj) {
long int op;
for (op = 2; op <= sqrt(hj); op++) {
if (hj % op == 0) return 0;
}
return 1;
}
void swap(int *p, int *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
void tog(int *p) {
if (*p == 1)
*p = 0;
else
*p = 1;
}
int main() {
long long int max, e, preI, min, t1, t2, g, p, brk, L, clbp, clb, et, jmp, u,
l1, l2, sp, sq, nd, maxi, li, ri, tr, mp, og, prev, lt1, lt2, n1, n2, c1,
c2, jb, minI, min1, dp, p2, p3, ze, fst, lst, min2, c, s, sm1, sm2, sm3,
sr, sl, l, ln, rz, rn, car, eq, r, shr, ng, d, v, curr, spl, fl, z, ev,
od, t, m, ct, j, q, k, b, maxI, max1, max2, lt, md, a, f, n, xP, xN, w, h,
d2, d1, u1, u2, sm, i, x, y;
cin >> n >> k;
if (n < k)
cout << k;
else if (n % k == 0)
cout << k * ((n / k) + 1);
else {
cout << (long long int)(k * (ceil((double)n / k)));
}
return 0;
}
| 7 | CPP |
s=input()
main=""
aux=""
i=0
while i<len(s)-2:
if s[i]=='W' and s[i+1]=='U' and s[i+2]=='B':
main+=" "
i+=3
else:
main+=s[i]
i+=1
try:
main+=s[i]
except:
pass
try:
main+=s[i+1]
except:
pass
print(main.strip()) | 7 | PYTHON3 |
s=list(map(int,input().split()))
i=set(s)
print(sum(i)-(sum(s)-sum(i))) | 0 | PYTHON3 |
n = int(input())
def test():
l: int = int(input())
s = input()
for i in range(0, l//2):
c1 = s[i]
c2 = s[l-i-1]
if not (c1 == c2 or abs(ord(c2) - ord(c1))==2) :
return False
return True
for i in range(n):
if test():
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Operation {
int i, r, c;
};
vector<Operation> l;
int n, k, mp[4][55], tot;
void transform(int &i, int &j) {
if (i == 1 && j == n)
i = 2;
else if (i == 2 && j == 1)
i = 1;
else if (i == 1)
j++;
else
j--;
}
int main() {
ios::sync_with_stdio(false);
int i, j, prei, prej;
cin >> n >> k;
for (i = 0; i < 4; i++)
for (j = 1; j <= n; j++) cin >> mp[i][j];
for (j = 1; j <= n; j++)
if (mp[0][j] && mp[0][j] == mp[1][j]) {
mp[1][j] = 0;
l.push_back((Operation){mp[0][j], 0, j});
}
for (j = 1; j <= n; j++)
if (mp[3][j] && mp[2][j] == mp[3][j]) {
mp[2][j] = 0;
l.push_back((Operation){mp[3][j], 3, j});
}
if (l.empty() && k == 2 * n) return cout << -1, 0;
for (i = 1, j = 1, prei = 2, prej = 1; ++tot <= 100000;
prei = i, prej = j, transform(i, j)) {
if (mp[i][j]) {
if (i == 1 && mp[1][j] == mp[0][j]) {
mp[1][j] = 0;
l.push_back((Operation){mp[0][j], 0, j});
} else if (i == 2 && mp[2][j] == mp[3][j]) {
mp[2][j] = 0;
l.push_back((Operation){mp[3][j], 3, j});
} else if (!mp[prei][prej]) {
l.push_back((Operation){mp[i][j], prei, prej});
mp[prei][prej] = mp[i][j];
mp[i][j] = 0;
}
}
}
cout << (int)l.size() << endl;
for (auto i : l) cout << i.i << ' ' << i.r + 1 << ' ' << i.c << endl;
return 0;
}
| 7 | CPP |
a, b, c = map(int, input().split())
run = True
while run:
a0, c0 = a, c
while c0 > 0:
a0, c0 = c0, a0 % c0
c = c - a0
if c < 0:
print(1)
run = False
else:
b1, c1 = b, c
while c1 > 0:
b1, c1 = c1, b1 % c1
c = c - b1
if c < 0:
print(0)
run = False
| 7 | PYTHON3 |
"""import math
n,k=map(int,input().split())
t=input()
c=0
temp=0
for i in range(1,n):
for j in range(0,n-i):
if(t[j]==t[j+i]):
c=c+1
else:
break
if(c==n-i and c>temp):
temp=c
c=0
#else:
#if(c>temp):
#temp=c
#c=0
#break
ans=t
for i in range(0,k-1):
ans=ans+t[temp:]
#ans=n+(n-c)*(k-1)
print(ans)"""
"""n=int(input())
s=[int(x) for x in input().split()]
temp=0
c=1
for i in range(1,len(s)):
if(s[i]<=(2*s[i-1])):
c=c+1
else:
if(c>temp):
temp=c
c=1
if(c>temp):
temp=c
print(temp)"""
"""n=int(input())
L=[]
for i in range(0,n):
l,r=map(int,input().split())
L.append((l,r))
o=0
flag=0
G1=[]
G2=[]
l=-1
r=1000000007
for i in range(0,n):
for j in range(i+1,n):
l1=L[i][0]
r1=L[i][1]
l2=L[j][0]
r2=L[j][1]
if((l1<=r1) and (l2<=r2) and ((l2<=l1 and r2<=r1 and l1<=r2) or (l1<=l2 and r1<=r2 and l2<=r1) or (l2>=l1 and r1>=r2) or (l2<=l1 and r1<=r2))):
o=o+1
else:
flag=1
G1.append(i)
G2.append(j)
break
if(flag==0):
temp=0
for i in range(0,n):
l=-1
r=1000000007
for j in range(0,n):
if(j!=i):
l=max(l,L[j][0])
r=min(r,L[j][1])
#print(l)
#print(r)
if((r-l)>temp):
temp=r-l
print(temp)
else:
G1=list(set(G1))
G2=list(set(G2))
if(len(G1)==1 and len(G2)>1):
temp=0
for i in range(0,n):
l=-1
r=1000000007
for j in range(0,n):
if(i!=j and i!=G1[0] and j!=G1[0]):
l=max(l,L[j][0])
r=min(r,L[j][1])
if((r-l)>temp):
temp=r-l
print(temp)
elif(len(G2)==1 and len(G1)>1):
temp=0
for i in range(0,n):
l=-1
r=1000000007
for j in range(0,n):
if(i!=j and i!=G2[0] and j!=G2[0]):
l=max(l,L[j][0])
r=min(r,L[j][1])
if((r-l)>temp):
temp=r-l
print(temp)
elif(len(G1)==1 and len(G2)==1):
temp1=0
for i in range(0,n):
l=-1
r=1000000007
for j in range(0,n):
if(i!=j and i!=G1[0] and j!=G1[0]):
l=max(l,L[j][0])
r=min(r,L[j][1])
if((r-l)>temp1):
temp1=r-l
temp2=0
for i in range(0,n):
l=-1
r=1000000007
for j in range(0,n):
if(i!=j and i!=G2[0] and j!=G2[0]):
l=max(l,L[j][0])
r=min(r,L[j][1])
if((r-l)>temp2):
temp2=r-l
print(max(temp1,temp2))
else:
print(0)"""
"""n,k=map(int,input().split())
s=[int(x) for x in input().split()]
S=[]
c=0
for i in range(0,len(s)):
S.append(str(s[i]))
#print(S)
for i in range(0,n):
t1=S[i]
for j in range(0,n):
if(i!=j):
t=int(t1+S[j])
if(t%k==0):
#print((i+1,j+1))
c=c+1
print(c)"""
a,b=map(int,input().split())
x,y,z=map(int,input().split())
ansy=max(((2*x)+(y)-a),0)
ansb=max(((y)+(3*z)-b),0)
print(max(ansy+ansb,0))
| 7 | PYTHON3 |
a,b,c,d=map(int,input().split());print(["No","Yes"][abs(a-c)<=d or(abs(a-d)<=d and abs(b-c)<=d)]) | 0 | PYTHON3 |
#include<stdio.h>
int main() {
int n, y, m, d, i, j;
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
int sum = 0;
scanf("%d %d %d", &y, &m, &d);
if (y % 3 && m % 2==0) sum += (20 - d);
else sum += (21 - d);
for (j = m + 1; j <= 10; ++j) {
if (y % 3 && j % 2==0) sum += 19;
else sum += 20;
}
for (j = y + 1; j < 1000; ++j) {
if (j % 3) sum += 195;
else sum += 200;
}
printf("%d\n", sum);
}
return 0;
}
| 0 | CPP |
import sys
from sys import stdin
from collections import deque
tt = int(stdin.readline())
for loop in range(tt):
stdin.readline()
n,m = map(int,stdin.readline().split())
C = {}
Clis = []
for i in range(m):
r,c = map(int,stdin.readline().split())
if c not in C:
C[c] = 0
Clis.append(c)
C[c] ^= r
Clis.append(n+1)
C[n+1] = 3
Clis.sort()
now = 0
#print (Clis,C)
ans = "YES"
for ind in Clis:
if C[ind] == 3 and now != 0:
ans = "NO"
break
if C[ind] == 1:
if ind % 2 == 0:
if now == 0:
now = 2
elif now == 1:
now = 0
else:
ans = "NO"
break
else:
if now == 0:
now = 1
elif now == 1:
ans = "NO"
break
else:
now = 0
elif C[ind] == 2:
if ind % 2 == 0:
if now == 0:
now = 1
elif now == 1:
ans = "NO"
break
else:
now = 0
else:
if now == 0:
now = 2
elif now == 1:
now = 0
else:
ans = "NO"
break
#print (ind,now)
print (ans)
| 12 | PYTHON3 |
from collections import Counter
for _ in range(int(input())):
n=int(input())
p=n
if n<4:
print(-1)
continue
if n%2!=0:
start=n
else:
start=n-1
l=[]
while start!=(-1):
l.append(start)
start-=2
l.append(4)
l.append(2)
start=6
while(start<=p):
l.append(start)
start+=2
print(*l) | 13 | PYTHON3 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n;
while(cin >> n , n){
char dic[256];
fill(dic , dic + 256 , 0);
for(int i = 0; i < n; i++){
char c;
cin >> c;
cin >> dic[c];
}
int m;
cin >> m;
for(int i = 0; i < m; i++){
char c;
cin >> c;
if(dic[c] == 0){
cout << c;
} else {
cout << dic[c];
}
}
cout << endl;
}
return 0;
} | 0 | CPP |
c={}
for _ in range(int(input())):
s=tuple(sorted(input()))
c[s]=c.get(s,0)+1
print(sum(v*(v-1)//2 for v in c.values())) | 0 | PYTHON3 |
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
a = list(map(int,list(input()[:n])))
ans = 0
d = [0]*(n*10)
x = 0
for i in range(n):
d[x] += 1
x += a[i]-1
ans += d[x]
print(ans)
| 9 | PYTHON3 |
n=int(input())
if(n%2==0):
x=n/2
if(x%2!=1):
print(0)
else:
print(1)
else:
x=(n+1)/2
if(x%2!=1):
print(0)
else:
print(1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int l1, l2;
int main() {
scanf("%d%d", &l1, &l2);
if (l1 > l2) swap(l1, l2);
for (int i = l1 - 1; i; --i) {
int k = (int)sqrt(l1 * l1 - i * i);
if (i * i + k * k == l1 * l1) {
for (int j = l2 - 1; j; --j) {
int t = (int)sqrt(l2 * l2 - j * j);
if (j * j + t * t == l2 * l2) {
if (t * k - j * i == 0) {
puts("YES");
printf("0 0\n%d %d\n%d %d\n", i, k, -j, t);
return 0;
}
}
}
}
}
puts("NO");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long s, a, b;
long long t1, t2;
long long p, d;
cin >> s >> a >> b >> t1 >> t2 >> p >> d;
if (a > b) {
long min = (a - b) * t2;
if (d == -1) {
if (a == p) {
long z = a - b;
if (min > z * t1) min = z * t1;
}
if (p > b && p > a) {
long z = p - b;
if (min > z * t1) min = z * t1;
} else {
long z = 2 * s + p - b;
if (min > z * t1) min = z * t1;
}
} else {
long z = 2 * s - b - p;
if (min > z * t1) min = z * t1;
}
cout << min;
}
if (b > a) {
long min = (b - a) * t2;
if (d == 1) {
if (a == p) {
long z = b - a;
if (min > z * t1) min = z * t1;
} else if (b > p && a > p) {
long z = b - p;
if (min > z * t1) min = z * t1;
} else {
long z = 2 * s - p + b;
if (min > z * t1) min = z * t1;
}
} else {
long z = b + p;
if (min > z * t1) min = z * t1;
}
cout << min;
}
if (a == b) {
cout << "0";
}
}
| 9 | CPP |
n = int(input())
if n <= 2:
print('No')
else:
print('Yes')
print(len(range(1, n + 1, 2)), end=' ')
for i in range(1, n + 1, 2):
print(i, end=' ')
print('')
print(len(range(2, n + 1, 2)), end=' ')
for i in range(2, n + 1, 2):
print(i, end=' ')
| 8 | PYTHON3 |
print('aA'[input().isupper()]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000005;
map<pair<int, int>, int> mp;
vector<pair<int, int> > Q;
vector<int> q;
int dp[3][maxN], d[maxN];
char a[maxN];
int n;
void solve(int x) {
int X = Q[x].first, Y = Q[x].second, r = -1, r2 = -1;
if (d[X + 1] != X + 1) r = mp[make_pair(X + 1, d[X + 1])];
if (d[Y - 1] != Y - 1) r2 = mp[make_pair(d[Y - 1], Y - 1)];
int num[10];
memset(num, 0, sizeof num);
if (r == -1)
if (a[X + 1] == '0')
num[0] = 1;
else if (a[X + 1] == '1')
num[1] = 1;
else
num[2] = 1;
else
num[0] = dp[0][r], num[1] = dp[1][r], num[2] = dp[2][r];
if (r2 == -1)
if (a[Y - 1] == '0')
num[3] = 1;
else if (a[Y - 1] == '1')
num[4] = 1;
else
num[5] = 1;
else
num[3] = dp[0][r2], num[4] = dp[1][r2], num[5] = dp[2][r2];
if (a[d[X + 1] + 1] == '&') {
if (num[0] || num[3]) dp[0][x] = 1;
if (num[1] && num[4]) dp[1][x] = 1;
if (num[2] && num[5]) dp[2][x] = dp[0][x] = 1;
if ((num[2] && num[4]) || (num[5] && num[1])) dp[2][x] = 1;
} else if (a[d[X + 1] + 1] == '|') {
if (num[1] || num[4]) dp[1][x] = 1;
if (num[0] && num[3]) dp[0][x] = 1;
if (num[2] && num[5]) dp[2][x] = dp[1][x] = 1;
if ((num[2] && num[3]) || (num[5] && num[0])) dp[2][x] = 1;
} else {
if (num[2] && num[5]) dp[0][x] = dp[1][x] = 1;
if ((num[0] || num[1]) && num[5]) dp[2][x] = 1;
if ((num[3] || num[4]) && num[2]) dp[2][x] = 1;
if ((num[0] && num[3]) || (num[1] && num[4])) dp[0][x] = 1;
if ((num[0] && num[4]) || (num[1] && num[3])) dp[1][x] = 1;
}
}
int main() {
scanf("%d", &n);
scanf("%s", &a);
int len = 0;
while (a[len]) len++;
for (int i = 0; i < len; i++) {
if (a[i] == '(')
q.push_back(i);
else if (a[i] == ')') {
Q.push_back(make_pair(q.back(), i));
mp[Q.back()] = (int)Q.size() - 1;
d[q.back()] = i, d[i] = q.back();
q.pop_back();
} else
d[i] = i;
}
for (int i = 0; i < Q.size(); i++) solve(i);
if (len == 1) {
if (a[0] == '?')
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
if (dp[2][mp[make_pair(0, len - 1)]])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; string s; cin >>n >>s; int k=n; n=s.length();
for(int i=0; i<n-1; i++){if(s[i]==s[i+1]) k--;}
cout <<k;
return 0;
} | 0 | CPP |
for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
t = []
for i in arr:
x = bin(i)[2:]
x = '0'*(32-len(x)) + x
t.append(x)
dic = {}
for i in range(32):
dic[i] = 0
c = 0
for i in t:
for j in range(32):
if i[j]=='1':
c += dic[j]
dic[j] += 1
break
print(c)
| 8 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort()
ans="YES"
for i in range(1,n,1):
if(a[i]-a[i-1]>1):
ans="NO"
break
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int a[n+1],b[n+1],c[n];
rep(i,n+1)
a[i]=0;
rep(i,n)
cin>>c[i];
set<int>s;
rep(i,n)
{
b[i+1]=0;
s.insert(c[i]);
if((i-1)>=0)
{
if(c[i-1]>=c[i])
a[c[i]]+=1;
}
if((i+1)<n)
{
if(c[i+1]>c[i])
a[c[i]]+=1;
}
}
if(a[1])
b[1]=1;
for(int i=2;i<=n;i++)
{
if(a[i] && b[i-1] && a[i-1]==1)
b[i]=1;
}
if(s.size()==n)
b[n]=1;
for(int i=n;i>0;i--)
cout<<b[i]<<"";
cout<<"\n";
// cout<<"\n";
}
}
| 10 | CPP |
while True:
n, m = map(int, input().split())
if n == m == 0:
break
data = [list(map(int, input().split())) for i in range(m)]
data.sort()
infect = [False for i in range(n + 1)]
infect[1] = True
for t, s, d in data:
if infect[s]:
infect[d] = True
print(infect.count(True))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 7;
int n, t, Num[N];
struct YYZ {
int S1, S2, t1, t2;
double p1;
} A[N];
struct NFO {
long double S, t;
friend bool operator<(NFO A, NFO B) {
return (((A.S - B.S) > 0 ? (A.S - B.S) : -(A.S - B.S)) <= 1e-7) ? A.t > B.t
: A.S < B.S;
}
friend NFO operator+(NFO A, NFO B) { return (NFO){A.S + B.S, A.t + B.t}; }
inline NFO Inc(int i, int j) {
return (NFO){S + A[i].S1 + (1 - A[i].p1) * A[i].S2,
A[i].p1 * (t + A[i].t1) + (1 - A[i].p1) * j};
}
} Dp[N];
inline NFO Max(NFO A, NFO B) { return A < B ? B : A; }
int main() {
scanf("%d%d", &n, &t);
for (int i = (1), iLimit = (n); i <= iLimit; (++(i)))
scanf("%d%d%d%d%lf", &A[i].S1, &A[i].S2, &A[i].t1, &A[i].t2, &A[i].p1),
Num[i] = i;
sort(Num + 1, Num + 1 + n, [](int a, int b) {
YYZ C = A[a], B = A[b];
return C.p1 * C.t2 / (C.p1 - 1) > B.p1 * B.t2 / (B.p1 - 1);
});
for (int k = (1), kLimit = (n); k <= kLimit; (++(k))) {
int i = Num[k];
for (int j = (t), jLimit = (A[i].t1); j >= jLimit; (--(j))) {
Dp[j] =
Max(Dp[j], Dp[j - A[i].t1] + (NFO){(double)A[i].S1, (double)A[i].t1});
if (j >= A[i].t1 + A[i].t2)
Dp[j] = Max(Dp[j], Dp[j - A[i].t1 - A[i].t2].Inc(i, j));
}
}
NFO Ans = (NFO){0, 2147483647};
for (int i = (0), iLimit = (t); i <= iLimit; (++(i))) Ans = Max(Ans, Dp[i]);
cout << fixed << setprecision(15) << Ans.S << ' ';
cout << fixed << setprecision(15) << Ans.t << ' ';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << "0\n";
return;
}
if (n < 6 && n != 3) {
cout << "-1\n";
return;
}
int count = 0;
while (n % 3 == 0) {
while (n % 6 == 0) {
n /= 6;
count++;
}
if (n % 3 == 0) {
n *= 2;
count++;
} else if (n != 1) {
cout << "-1"
<< "\n";
return;
} else {
if (n == 1) break;
}
}
if (n != 1) {
cout << "-1\n";
return;
}
cout << count << "\n";
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
a,k = map(int,input().split())
prev,temp = a,0
c = 1
if k==1:
print(a)
continue
while c<k:
temp = prev + int(min(str(prev)))*int(max(str(prev)))
c += 1
if prev == temp:
break
prev = temp
print(temp) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() { cout << "red"; }
| 10 | CPP |
import math
test= int(input())
for i in range(test):
x= int(input())
mark=0
xx=1
while(x>0):
a= (xx*(xx+1))//2
while(False):
break
if x>=a:
mark+=1
xx= 2*xx+1
x-=a
while(False):
break
print(mark)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1005;
char A[Nmax][Nmax];
int used[Nmax][Nmax];
int N, M, cnt = 0;
int currCnt = 0;
bool mark(int x1, int y1, int x2, int y2) {
for (int i = x1; i <= x2; ++i) {
if (A[i][y1] == '.' || A[i][y2] == '.') return false;
if (A[i][y1] == '#') {
used[i][y1]++;
if (used[i][y1] == 1) ++currCnt;
}
if (A[i][y2] == '#') {
used[i][y2]++;
if (used[i][y2] == 1) ++currCnt;
}
}
for (int j = y1 + 1; j < y2; ++j) {
if (A[x1][j] == '.' || A[x2][j] == '.') return false;
if (A[x1][j] == '#') {
used[x1][j]++;
if (used[x1][j] == 1) ++currCnt;
}
if (A[x2][j] == '#') {
used[x2][j]++;
if (used[x2][j] == 1) ++currCnt;
}
}
return true;
}
void unmark(int x1, int y1, int x2, int y2) {
for (int i = x1; i <= x2; ++i) {
if (A[i][y1] == '.' || A[i][y2] == '.') return;
if (A[i][y1] == '#') {
used[i][y1]--;
}
if (A[i][y2] == '#') {
used[i][y2]--;
}
}
for (int j = y1 + 1; j < y2; ++j) {
if (A[x1][j] == '.' || A[x2][j] == '.') return;
if (A[x1][j] == '#') {
used[x1][j]--;
}
if (A[x2][j] == '#') {
used[x2][j]--;
}
}
}
bool chooseSecond(const vector<int>& rows, const vector<int>& cols) {
for (int i = 0; i < int(rows.size()); ++i) {
for (int j = i + 1; j < int(rows.size()); ++j) {
int x1 = rows[i], x2 = rows[j];
if (x2 <= x1 + 1) continue;
for (int k = 0; k < int(cols.size()); ++k) {
for (int p = k + 1; p < int(cols.size()); ++p) {
int y1 = cols[k], y2 = cols[p];
if (y2 <= y1 + 1) continue;
int aux = currCnt;
if (mark(x1, y1, x2, y2) && currCnt == cnt) {
cout << "YES\n";
cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
return true;
}
unmark(x1, y1, x2, y2);
currCnt = aux;
}
}
}
}
return false;
}
bool chooseFirst(const vector<int>& rows, const vector<int>& cols) {
for (int i = 0; i < int(rows.size()); ++i) {
for (int j = i + 1; j < int(rows.size()); ++j) {
int x1 = rows[i], x2 = rows[j];
if (x2 <= x1 + 1) continue;
for (int k = 0; k < int(cols.size()); ++k) {
for (int p = k + 1; p < int(cols.size()); ++p) {
int y1 = cols[k], y2 = cols[p];
if (y2 <= y1 + 1) continue;
int aux = currCnt;
if (mark(x1, y1, x2, y2) && chooseSecond(rows, cols)) {
cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
return true;
}
unmark(x1, y1, x2, y2);
currCnt = aux;
}
}
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin >> N >> M;
for (int i = 1; i <= N; ++i) {
cin >> (A[i] + 1);
for (int j = 1; j <= M; ++j)
if (A[i][j] == '#') ++cnt;
}
vector<int> cols, rows;
for (int i = 1; i <= N; ++i) {
bool ok = false;
for (int j = 1; j + 2 <= M; ++j)
if (A[i][j] == '#' && A[i][j + 1] == '#' && A[i][j + 2] == '#') ok = true;
if (ok) rows.push_back(i);
}
while (rows.size() > 6U) rows.erase(rows.begin() + rows.size() / 2);
for (int j = 1; j <= M; ++j) {
bool ok = false;
for (int i = 1; i + 2 <= N; ++i)
if (A[i][j] == '#' && A[i + 1][j] == '#' && A[i + 2][j] == '#') ok = true;
if (ok) cols.push_back(j);
}
while (cols.size() > 6U) cols.erase(cols.begin() + cols.size() / 2);
if (!chooseFirst(rows, cols)) {
cout << "NO\n";
}
}
| 10 | CPP |
n = int(input())
friend = input().split()
new = []
for i in range(0, n):
new.append(0)
for i in range(0, n):
new[int(friend[i]) - 1] = i + 1
for i in range(0, n - 1):
print(new[i], end = " ")
print(new[n - 1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int in() {
int r = 0, c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') return -in();
for (; c > 32; r = (r << 1) + (r << 3) + c - '0', c = getchar())
;
return r;
}
using namespace std;
const int INF = int(1e9 + 7);
pair<int, int> v[100010];
bool cmp(pair<int, int> a, pair<int, int> b) {
return abs(a.first) + abs(a.second) < abs(b.first) + abs(b.second);
if (abs(a.first) == abs(a.second)) {
return abs(a.second) < abs(b.second);
}
return abs(a.first) < abs(b.first);
}
struct op {
int type, k;
char dir;
op() {}
};
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v, v + n, cmp);
vector<op> res;
for (int i = 0; i < n; i++) {
int x = 0, y = 0;
int a = v[i].first, b = v[i].second;
op o;
if (a > x) {
o.type = 1;
o.k = a - x;
o.dir = 'R';
x = a;
res.push_back(o);
}
if (a < x) {
o.type = 1;
o.k = x - a;
o.dir = 'L';
x = a;
res.push_back(o);
}
if (b > y) {
o.type = 1;
o.k = b - y;
o.dir = 'U';
y = b;
res.push_back(o);
}
if (b < y) {
o.type = 1;
o.k = y - b;
o.dir = 'D';
y = b;
res.push_back(o);
}
o.type = 2;
res.push_back(o);
a = 0;
b = 0;
if (a > x) {
o.type = 1;
o.k = a - x;
o.dir = 'R';
x = a;
res.push_back(o);
}
if (a < x) {
o.type = 1;
o.k = x - a;
o.dir = 'L';
x = a;
res.push_back(o);
}
if (b > y) {
o.type = 1;
o.k = b - y;
o.dir = 'U';
y = b;
res.push_back(o);
}
if (b < y) {
o.type = 1;
o.k = y - b;
o.dir = 'D';
y = b;
res.push_back(o);
}
o.type = 3;
res.push_back(o);
}
cout << res.size() << endl;
for (int i = 0; i < res.size(); i++) {
cout << res[i].type << " ";
if (res[i].type == 1) {
cout << res[i].k << " " << res[i].dir;
}
cout << '\n';
}
return 0;
}
| 9 | CPP |
n = int(input())
ans = [int((input().split(' '))[1]) * 2 for i in range(n)]
for i in ans:
print(i)
| 7 | PYTHON3 |
import sys
n = int(sys.stdin.readline().strip())
# 5 movements step:
move5 = n // 5
if n % 5 == 0:
print(move5)
else:
print(move5 + 1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2111, p = 1e9 + 7;
struct tree {
int son[maxn][maxn], cnt[maxn], s[maxn], n;
vector<int> v[maxn];
void read() {
cin >> n;
for (int i = (1); i <= (n - 1); ++i) {
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void dfs(int x, int fa) {
cnt[x] = 0;
s[x] = 0;
for (int y : v[x]) {
if (y == fa) continue;
son[x][++cnt[x]] = y;
s[x] |= (1 << (y - 1));
dfs(y, x);
}
}
} a, b;
int f[maxn][5000];
int dp(int x, int now, int S) {
if (!now || !S) return !S;
int &ret = f[a.son[x][now]][S];
if (ret) return ret - 1;
ret = dp(x, now - 1, S);
for (int y = a.son[x][now], k = 0; k < b.n; ++k)
if (S >> k & 1)
ret = (ret +
1ll * dp(x, now - 1, S - (1 << k)) * dp(y, a.cnt[y], b.s[k + 1])) %
p;
return ret++;
}
int poww(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = 1ll * ans * a % p;
b >>= 1;
a = 1ll * a * a % p;
}
return ans;
}
int main() {
a.read();
b.read();
a.dfs(1, 0);
int ans1 = 0, ans2 = 0;
for (int i = (1); i <= (b.n); ++i) {
b.dfs(i, 0);
for (int j = (1); j <= (a.n); ++j)
ans1 = (ans1 + dp(j, a.cnt[j], b.s[i])) % p;
memset(f, 0, sizeof(f));
}
a = b;
a.dfs(1, 0);
for (int i = (1); i <= (b.n); ++i) {
b.dfs(i, 0);
for (int j = (1); j <= (a.n); ++j)
ans2 = (ans2 + dp(j, a.cnt[j], b.s[i])) % p;
memset(f, 0, sizeof(f));
}
ans1 = 1ll * ans1 * poww(ans2, p - 2) % p;
cout << ans1;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n, m, k;
cin >> n >> m >> k;
long long x = min(n / k, m);
if (m == x)
cout << x << endl;
else {
long long cleft = m - x;
cout << x - cleft / (k - 1) - (cleft % (k - 1) != 0) << endl;
}
}
return 0;
}
| 7 | CPP |
import math
A=[0,0,0,0]
n=int(input())
L=list(map(int,input().split()))
for i in range(len(L)):
A[L[i]-1]+=1
ans=A[3]
if(A[2]>=A[0]):
ans=ans+A[2]+math.ceil(A[1]/2)
else:
ans=ans+A[2]
A[0]=A[0]-A[2]
ans=ans+(A[0]//4)
A[0]=A[0]%4
if(A[1]%2==0):
if(A[0]==0):
ans=ans+A[1]//2
else:
ans=ans+(A[1]//2)+1
else:
if(A[0]<=2):
ans+=math.ceil(A[1]/2)
else:
ans+=math.ceil(A[1]/2)+1
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char arr[300];
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
memset(arr, 'A', sizeof(arr));
if (n != t.size()) {
cout << -1;
return 0;
}
for (int i = 0; i < n; i++) {
if (arr[t[i]] != 'A') {
if (arr[t[i]] != s[i]) {
cout << -1;
return 0;
}
continue;
}
if (arr[s[i]] == 'A') {
arr[s[i]] = t[i];
arr[t[i]] = s[i];
}
if (arr[s[i]] != t[i]) {
cout << -1;
return 0;
}
}
vector<pair<char, char> > v;
for (int i = 0; i < 300; i++) {
if (arr[i] != 'A') {
if (i == arr[i]) continue;
v.push_back(make_pair((char)i, arr[i]));
arr[arr[i]] = 'A';
arr[i] = 'A';
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++)
cout << v[i].first << " " << v[i].second << endl;
return 0;
}
| 8 | CPP |
a = input()
def inpt(a):
cnt = 0
s = 0
while a:
try:
if a[0] == '+':
cnt+=1
a = input()
elif a[0] == '-':
cnt-=1
a = input()
else:
c = a.split(':')[1]
s += cnt*len(c)
a = input()
except:
return s
print(inpt(a)) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Spyder Editor
This is a temporary script file.
"""
from heapq import *
n,k=map(int,input().split())
a=[]
for i in range(n):
y,x=map(int,input().split())
a.append([x,y])
a.sort(reverse=True)
ans=0
s=0
hp=[]
for i in range(n):
s+=a[i][1]
heappush(hp,a[i][1])
if i>=k :
s-=heappop(hp)
ans=max(ans,a[i][0]*s)
print(ans)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long Min(long long a, long long b) {
if (a >= b)
return b;
else
return a;
}
long long Max(long long a, long long b) {
if (a >= b)
return a;
else
return b;
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, i, s = -1;
cin >> n;
vector<long long> a(n), b(n), c(n);
for (i = 0; i < n; ++i) cin >> a[i];
for (i = 0; i < n; ++i) cin >> b[i];
for (i = 0; i < n; ++i) cin >> c[i];
vector<vector<long long> > g(n + 1);
for (i = 0; i < n - 1; i++) {
long long x, y;
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (i = 1; i <= n; i++) {
if (g[i].size() >= 3) {
cout << -1;
exit(0);
}
if (g[i].size() == 1) s = i;
}
if (n == 3 && s == -1) {
vector<long long> sq;
sq.push_back(a[0] + b[1] + c[2]);
sq.push_back(a[0] + c[1] + b[2]);
sq.push_back(b[0] + a[1] + c[2]);
sq.push_back(b[0] + c[1] + a[2]);
sq.push_back(c[0] + b[1] + a[2]);
sq.push_back(c[0] + a[1] + b[2]);
sort(sq.begin(), sq.end());
cout << sq[0] << endl;
if (a[0] + b[1] + c[2] == sq[0])
cout << 1 << " " << 2 << " " << 3;
else if (a[0] + c[1] + b[2] == sq[0])
cout << 1 << " " << 3 << " " << 2;
else if (b[0] + a[1] + c[2] == sq[0])
cout << 2 << " " << 1 << " " << 3;
else if (b[0] + c[1] + a[2] == sq[0])
cout << 2 << " " << 3 << " " << 1;
else if (c[0] + a[1] + b[2] == sq[0])
cout << 3 << " " << 1 << " " << 2;
else
cout << 3 << " " << 2 << " " << 1;
exit(0);
}
i = 0;
int p[] = {0, 1, 2};
long long mi = pow(10, 18), w1, w2, w3;
do {
long long point = 0, temp = 0, prev = -1, i = s;
do {
long long z = p[point];
point++;
point %= 3;
if (z == 0)
temp += a[i - 1];
else if (z == 1)
temp += b[i - 1];
else
temp += c[i - 1];
for (long long k = 0; k < g[i].size(); k++) {
if (g[i][k] != prev) {
prev = i;
i = g[i][k];
break;
}
}
} while (g[i].size() > 1);
long long z = p[point];
point++;
point %= 3;
if (z == 0)
temp += a[i - 1];
else if (z == 1)
temp += b[i - 1];
else
temp += c[i - 1];
if (mi > temp) {
mi = temp;
w1 = p[0] + 1;
w2 = p[1] + 1;
w3 = p[2] + 1;
}
} while (next_permutation(p, p + 3));
cout << mi << endl;
i = s;
long long prev = -1;
vector<long long> ans(n);
p[0] = w1;
p[1] = w2;
p[2] = w3;
long long coun = 1;
ans[i - 1] = p[0];
for (long long k = 0; k < g[i].size(); k++) {
if (g[i][k] != prev) {
ans[g[i][k] - 1] = p[coun];
coun++;
coun %= 3;
prev = i;
i = g[i][k];
k = -1;
}
}
for (i = 0; i < n; i++) cout << ans[i] << " ";
return 0;
}
| 10 | CPP |
import math
number = int(input())
factors = 0
i= 2
while(i<=math.sqrt(number)):
if number%i ==0:
if number//i == i:
factors +=1
else:
factors +=2
i+=1
print(factors+1) | 7 | PYTHON3 |
N = int(input())
S = input()
r = g = b = 0
L = [0] * (3*N)
for i, c in enumerate(S):
if c=="R":
L[i] = r
r += 1
elif c=="G":
L[i] = g
g += 1
else:
L[i] = b
b += 1
LL = [[] for _ in range(N)]
for i, l in enumerate(L):
LL[l].append(i)
idx = 0
A, B, C = list(zip(*LL))
ans = 1
mod = 998244353
for i in range(2, N+1):
ans = ans * i % mod
idx_b = N-1
n = 0
for i, a in enumerate(A[::-1]):
while idx_b >= 0 and a < B[idx_b]:
idx_b -= 1
n += 1
ans = ans * n % mod
#print(n)
n -= 1
idx_b = 0
n = 0
for c in C:
while idx_b < N and B[idx_b] < c:
idx_b += 1
n += 1
ans = ans * n % mod
#print(n)
n -= 1
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct data {
int p, v;
};
int n, m;
int a[110000], b[110000];
data d[110000];
int f[110000];
long long ans[110000];
void add(int x, int y) {
while (x <= n) {
f[x] += y;
x += (x & (-x));
}
}
int quest(int x) {
int ret = 0;
while (x > 0) {
ret += f[x];
x -= (x & (-x));
}
return ret;
}
long long findleft(int le, int ri) {
int rr = quest(ri), R = ri;
long long mid, ans = ri;
int c;
while (le <= ri) {
mid = (le + ri) / 2;
c = rr - quest(mid - 1);
if (c == R - mid + 1) {
ans = mid;
ri = mid - 1;
} else {
le = mid + 1;
}
}
return ans;
}
long long findright(int le, int ri) {
long long mid, ans = le;
int c, lle = quest(le - 1), L = le;
while (le <= ri) {
mid = (le + ri) / 2;
c = quest(mid) - lle;
if (c == mid - L + 1) {
ans = mid;
le = mid + 1;
} else {
ri = mid - 1;
}
}
return ans;
}
void solve(int x) {
long long tmp = 0, c = 0;
memset(f, 0, sizeof(f));
for (int i = 1; i <= n; i++) {
if (a[i] & x) {
b[i] = 1;
add(i, 1);
++c;
tmp += c;
} else
b[i] = c = 0;
}
long long le, ri;
for (int i = 0; i < m; i++) {
if (d[i].v & x) {
if (b[d[i].p] == 0) {
b[d[i].p] = 1;
add(d[i].p, 1);
le = findleft(1, d[i].p);
ri = findright(d[i].p, n);
tmp -= (d[i].p - le + 1) * (d[i].p - le) / 2;
tmp -= (ri - d[i].p + 1) * (ri - d[i].p) / 2;
tmp += (ri - le + 2) * (ri - le + 1) / 2;
}
} else {
if (b[d[i].p] == 1) {
le = findleft(1, d[i].p);
ri = findright(d[i].p, n);
tmp -= (ri - le + 2) * (ri - le + 1) / 2;
tmp += (d[i].p - le + 1) * (d[i].p - le) / 2;
tmp += (ri - d[i].p + 1) * (ri - d[i].p) / 2;
b[d[i].p] = 0;
add(d[i].p, -1);
}
}
ans[i] += tmp * x;
}
}
void init() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 0; i < m; i++) scanf("%d%d", &d[i].p, &d[i].v);
}
int main() {
init();
for (int i = 0; (1 << i) < 100000; i++) solve(1 << i);
for (int i = 0; i < m; i++) cout << ans[i] << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007LL;
long long large = 2000000000000000000LL;
int k;
int n;
char t[1000010];
int s[1000010], a[1000010], b[1000010];
void f(string s, int a[]) {
for (int i = 0; i < n; i++) {
a[i] = (int)(s[i] - 'a');
}
}
int main() {
int test;
cin >> test;
while (test--) {
scanf("%d", &k);
scanf("%s", t);
n = strlen(t);
f(t, s);
scanf("%s", t);
f(t, a);
scanf("%s", t);
f(t, b);
vector<int> map(k, -1);
vector<bool> op(k, false);
bool can = true;
int i = 0;
for (i = 0; i < n; i++) {
if (a[i] == b[i]) {
if (map[s[i]] != -1) {
if (map[s[i]] != a[i]) {
can = false;
break;
}
} else {
if (op[a[i]]) {
can = false;
break;
}
map[s[i]] = a[i];
op[a[i]] = true;
}
} else {
break;
}
}
if (!can) {
printf("NO\n");
continue;
}
if (i == n) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
}
if (map[s[i]] != -1) {
if (map[s[i]] > a[i] && map[s[i]] < b[i]) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
} else {
if (map[s[i]] == a[i]) {
i++;
for (; i < n; i++) {
if (map[s[i]] == -1) {
for (int j = a[i] + 1; j < k; j++) {
if (!op[j]) {
map[s[i]] = j;
op[j] = true;
break;
}
}
if (map[s[i]] != -1) break;
if (op[a[i]]) {
can = false;
break;
}
map[s[i]] = a[i];
op[a[i]] = true;
} else {
if (map[s[i]] > a[i]) break;
if (map[s[i]] < a[i]) {
can = false;
break;
}
}
}
if (can) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
} else {
printf("NO\n");
continue;
}
} else if (map[s[i]] == b[i]) {
i++;
for (; i < n; i++) {
if (map[s[i]] == -1) {
for (int j = b[i] - 1; j >= 0; j--) {
if (!op[j]) {
map[s[i]] = j;
op[j] = true;
break;
}
}
if (map[s[i]] != -1) break;
if (op[b[i]]) {
can = false;
break;
}
map[s[i]] = b[i];
op[b[i]] = true;
} else {
if (map[s[i]] < b[i]) break;
if (map[s[i]] > b[i]) {
can = false;
break;
}
}
}
if (can) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
} else {
printf("NO\n");
continue;
}
}
printf("NO\n");
continue;
}
} else {
for (int j = a[i] + 1; j <= b[i] - 1; j++) {
if (!op[j]) {
map[s[i]] = j;
op[j] = true;
break;
}
}
if (map[s[i]] != -1) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
}
vector<int> tmap = map;
int tpos = i;
vector<bool> top = op;
if (!op[a[i]]) {
map[s[i]] = a[i];
op[a[i]] = true;
i++;
for (; i < n; i++) {
if (map[s[i]] == -1) {
for (int j = a[i] + 1; j < k; j++) {
if (!op[j]) {
map[s[i]] = j;
op[j] = true;
break;
}
}
if (map[s[i]] != -1) break;
if (op[a[i]]) {
can = false;
break;
}
map[s[i]] = a[i];
op[a[i]] = true;
} else {
if (map[s[i]] > a[i]) break;
if (map[s[i]] < a[i]) {
can = false;
break;
}
}
}
if (can) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
}
}
map = tmap;
op = top;
i = tpos;
can = true;
if (!op[b[i]]) {
map[s[i]] = b[i];
op[b[i]] = true;
i++;
for (; i < n; i++) {
if (map[s[i]] == -1) {
for (int j = b[i] - 1; j >= 0; j--) {
if (!op[j]) {
map[s[i]] = j;
op[j] = true;
break;
}
}
if (map[s[i]] != -1) break;
if (op[b[i]]) {
can = false;
break;
}
map[s[i]] = b[i];
op[b[i]] = true;
} else {
if (map[s[i]] < b[i]) break;
if (map[s[i]] > b[i]) {
can = false;
break;
}
}
}
if (can) {
printf("YES\n");
int j = 0;
for (int i = 0; i < k; i++) {
if (map[i] == -1) {
for (; j < k; j++) {
if (!op[j]) {
map[i] = j;
op[j] = true;
break;
}
}
}
}
for (int i = 0; i < k; i++) printf("%c", (char)(map[i] + 'a'));
printf("\n");
continue;
}
}
printf("NO\n");
continue;
}
}
return 0;
}
| 9 | CPP |
from collections import Counter
n, k = map(int, input().split())
al = sorted(Counter(input().split()).values(), reverse=True)
print(sum(al[k:]))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q;
cin >> q;
map<string, string> m;
while (q--) {
string s, t;
cin >> s >> t;
if (m.count(s)) {
m[t] = m[s];
m.erase(s);
} else {
m[t] = s;
}
}
cout << m.size() << endl;
map<string, string>::iterator it = m.begin();
while (it != m.end()) {
cout << it->second << " " << it->first << endl;
it++;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1005;
long long tot, rem, n, m, h;
long long a[N];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> m >> h;
for (long long i = 1; i <= m; i++) cin >> a[i];
a[h]--;
n--;
for (long long i = 1; i <= m; i++) tot += a[i];
rem = tot - a[h];
double num = 1, den = 1;
if (tot < n) {
cout << "-1";
return 0;
}
double ans;
if (rem < n) {
ans = 1;
} else {
for (long long i = rem - n + 1; i <= rem; i++) num *= i;
for (long long i = tot - n + 1; i <= tot; i++) den *= i;
ans = 1 - (num / den);
}
cout << fixed << setprecision(12) << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[103];
int pts[102][2];
long long int m[102][102], inf = LLONG_MAX;
long long int dis[102];
int n, d;
queue<int> q;
bool chck(long long int start_money) {
for (int i = 0; i <= n; i++) dis[i] = -1;
dis[1] = start_money;
q.push(1);
while (!q.empty()) {
int par = q.front();
q.pop();
for (int i = 2; i <= n; i++) {
if (par == i) continue;
if (m[par][i] > dis[par]) continue;
int cur = dis[par] - m[par][i] + a[i];
if (cur > dis[i]) dis[i] = cur, q.push(i);
}
}
return dis[n] != -1;
}
int main() {
scanf("%d%d", &n, &d);
for (int i = 2; i <= n - 1; i++) scanf("%d", a + i);
for (int i = 1; i <= n; i++) scanf("%d%d", &pts[i][0], &pts[i][1]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
m[i][j] = d * (abs(pts[i][0] - pts[j][0]) + abs(pts[i][1] - pts[j][1]));
long long int l = 0, r = 100000000, mid, ans;
while (l <= r) {
mid = (l + r) / 2;
if (chck(mid))
ans = mid, r = mid - 1;
else
l = mid + 1;
}
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
if (abs(a) < eps && abs(b) < eps)
return 0;
else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
return 0;
if (a < b) return -1;
return 1;
}
template <typename t>
inline int jud(t a, t b) {
if (a < b) return -1;
if (a == b) return 0;
return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
if (na == 0) return 0;
int be = 0, en = na - 1;
if (*a <= *(a + na - 1)) {
if (f_lb == 0)
while (be < en) {
int mid = (be + en + 1) / 2;
if (jud(*(a + mid), val) != 1)
be = mid;
else
en = mid - 1;
}
else
while (be < en) {
int mid = (be + en) / 2;
if (jud(*(a + mid), val) != -1)
en = mid;
else
be = mid + 1;
}
if (f_small && jud(*(a + be), val) == 1) be--;
if (!f_small && jud(*(a + be), val) == -1) be++;
} else {
if (f_lb)
while (be < en) {
int mid = (be + en + 1) / 2;
if (jud(*(a + mid), val) != -1)
be = mid;
else
en = mid - 1;
}
else
while (be < en) {
int mid = (be + en) / 2;
if (jud(*(a + mid), val) != 1)
en = mid;
else
be = mid + 1;
}
if (!f_small && jud(*(a + be), val) == -1) be--;
if (f_small && jud(*(a + be), val) == 1) be++;
}
return be;
}
template <class T>
inline T lowb(T num) {
return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
if (a == 0) return 0;
return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
if (a == 0) return 0;
return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
int temp = a >> 32;
if (temp) return 32 - __builtin_clz(temp) + 32;
return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
int temp = a >> 32;
if (temp) return 32 - __builtin_clz(temp) + 32;
return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
if (m < 0) return 0;
long long ans = 1;
long long k = n;
while (m) {
if (m & 1) {
ans *= k;
if (mod) ans %= mod;
}
k *= k;
if (mod) k %= mod;
m >>= 1;
}
return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
if (mod == -1) mod = 1000000007;
a += b;
while (a >= mod) a -= mod;
while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
cerr << endl;
}
template <class t>
void output2(t arr) {
for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
char l[20], r[20];
int rans[1 << 20];
long long get(vector<int> num) {
long long have[20][2];
long long ans = 0;
for (int i = 1; i <= 15; i++) {
int j;
int loc = i / 4;
have[0][1] = 0;
have[0][0] = 1;
for (j = 1; j < (int)num.size(); j++) {
int cnt = i + 1, flag = 1;
if (j == loc + 1) {
cnt = 0;
flag = 0;
for (int k = 0; k <= i; k++) {
if (!(k & (1 << (i % 4)))) continue;
cnt++;
if (k == i) flag = 1;
}
}
have[j][0] = have[j - 1][0] * cnt;
have[j][1] = have[j - 1][0] * flag + have[j - 1][1] * (cnt - flag);
}
int flag = 0;
for (j = num.size() - 1; j >= 0; j--) {
int cnt = 0, rbig = 1, ri = 1;
if (j != loc)
cnt = min(i + 1, num[j]);
else {
rbig = 0;
ri = 0;
for (int k = 0; k <= min(num[j], i); k++) {
if (!(k & (1 << (i % 4)))) continue;
if (k != num[j]) cnt++;
if (k == i) ri = 1;
if (k == min(num[j], i)) rbig = 1;
}
}
ans += have[j][1 - flag] * cnt;
if (num[j] > i || rbig == 0) {
ans += ri * !flag * (have[j][0] - have[j][1]);
break;
}
if (num[j] == i) {
flag = ri;
}
}
if (j == -1 && flag) ans++;
}
return ans;
}
long long get(long long num) {
if (num <= 0) return 0;
if (num < 1 << 16) return rans[num];
vector<int> rv;
for (; num; rv.push_back(num % 16), num /= 16)
;
return get(rv);
}
int getch(char ch) {
if (ch <= '9' && ch >= '0')
return ch - '0';
else
return ch - 'a' + 10;
}
long long getnum(char str[]) {
int l = strlen(str);
long long ans = 0;
for (int i = 0; i < l; i++) {
ans = ans * 16 + getch(str[i]);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
for (int i = 1; i < 1 << 20; i++) {
rans[i] = rans[i - 1];
long long rmask = 0;
for (int j = i; j; j >>= 4) rmask |= 1 << (j % 16);
if ((i ^ rmask) < i) rans[i]++;
}
int nq;
scanf("%d", &nq);
for (int i1 = 0; i1 < nq; i1++) {
scanf("%s%s", l, r);
long long nl = getnum(l), nr = getnum(r);
nl--;
printf("%I64d\n", get(nr) - get(nl));
}
return 0;
}
| 13 | CPP |
#include<bits/stdc++.h>
using namespace std;
const int N=605;
int n,m;
vector<int> g[N];
double dp[N];
double calc(int id){
for(int u=n-1;u>=1;--u){
double sum=0,Max=0;
int cnt=0;
for(int i=0;i<(int)g[u].size();++i){
int v=g[u][i];
sum+=dp[v]+1;
Max=max(Max,dp[v]+1);
++cnt;
}
if(cnt>=2 && id==u){
--cnt;
sum-=Max;
}
dp[u]=sum/cnt;
}
return dp[1];
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;++i){
int u,v;
scanf("%d%d",&u,&v);
g[u].push_back(v);
}
double ans=2e9;
for(int i=0;i<=n-1;++i) ans=min(ans,calc(i));
printf("%.10lf\n",ans);
return 0;
} | 0 | CPP |
word = input()
new_word = list(word)
new_word[0] = new_word[0].capitalize()
new_word = ''.join(new_word)
print(new_word) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t)) aux1 += m * x;
long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1;
aux2 *= cost;
ans += min(aux1, aux2);
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
H,W = map(int,input().split())
A = [list(map(int,input().split())) for i in range(H)]
B = [list(map(int,input().split())) for i in range(H)]
C = [[abs(a-b) for a,b in zip(arow,brow)] for arow,brow in zip(A,B)]
ofs = 80*(H+W)
dp = [[0]*W for _ in range(H)]
dp[0][0] = (1<<(ofs+C[0][0])) | (1<<(ofs-C[0][0]))
for i,crow in enumerate(C):
for j,c in enumerate(crow):
if i:
dp[i][j] = (dp[i-1][j]<<c) | (dp[i-1][j]>>c)
if j:
dp[i][j] |= ((dp[i][j-1]<<c) | (dp[i][j-1]>>c))
ans = ofs*2
for i in range(ofs*2):
if dp[-1][-1]&(1<<i):
ans = min(ans, abs(i-ofs))
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> ans;
int main() {
int n;
scanf("%d", &n);
int l = max(0, n - 1000);
for (int i = l; i <= n; i++) {
int ret = i;
int tmp = ret;
while (tmp) {
ret += tmp % 10;
tmp /= 10;
}
if (ret == n) ans.insert(i);
}
printf("%d\n", ans.size());
for (auto it = ans.begin(); it != ans.end(); it++) printf("%d\n", *it);
return 0;
}
| 9 | CPP |
a, b = map(int, input().split(" "))
print(int(a*b)) | 0 | PYTHON3 |
for j in range (int(input())):
a=int(input())
l=[];c=1
while(a):
t=a%(10*c)
a=a-t
c*=10
if t !=0:
l.append(t)
print(len(l))
print(*l)
| 7 | PYTHON3 |
n = int(input())
def func(m):
s = 0
while m!=0:
rem = m%10
s+=rem
m = m//10
if s%4==0:
return 1
else:
return 0
while func(n)==0:
n = n+1
print(n)
| 7 | PYTHON3 |
n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])
e = int(n[4])
hasil1 = b*a+d*2
hasil2 = c*a+e*2
if hasil1 < hasil2:
print("First")
elif hasil1 == hasil2:
print("Friendship")
else:
print("Second") | 7 | PYTHON3 |
if __name__ == '__main__':
line = str(input()).split()
line = [int(it) for it in line]
print(max(line) - min(line))
| 7 | PYTHON3 |
//16-3 ????????¢??????
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int W[100] = {};
int B[100] = {};
int R[100] = {};
for(int i=0; i<N; i++){
string S;
cin >> S;
for(int j=0; j<M; j++){
if(S[j] == 'W'){
W[i]++;
}
else if(S[j] == 'B'){
B[i]++;
}
else if(S[j] == 'R'){
R[i]++;
}
}
}
int min1 = 999999;
for(int i=0; i<N-2; i++){
int tmp1 = 0;
for(int j=0; j<i+1; j++){
tmp1 += B[j] + R[j];
}
int min2 = 999999;
for(int j=i+1; j<N-1; j++){
int tmp2 = 0;
for(int k=i+1; k<j+1; k++){
tmp2 += W[k] + R[k];
}
for(int k=j+1; k<N; k++){
tmp2 += W[k] + B[k];
}
if(tmp2 < min2) min2 = tmp2;
}
if(tmp1+min2 < min1) min1 = tmp1 + min2;
}
cout << min1 << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int res = (n - 1) / 9 + n;
cout << res << '\n';
}
return 0;
}
| 8 | CPP |
def MCD(a,b):
if a%b==0:
return b
else:
return MCD(b,a%b)
y=int(input())
z=1
salida=0
salida2=0
a=y+1
b=a-1
c=b-1
if y>4:
for k in range (3):
a=a-1
b=a
for l in range (3):
b=b-1
c=b
if b<1:
break
for m in range (3):
c=c-1
if c<1:
break
if ((MCD(a,b)==1 and MCD(b,c)==1 and MCD(a,c)==1) and (a!=1 and b!=1 and c!=1 ) ):
respuesta=a*b*c
salida=1
salida2=1
break
if salida==1:
break
if salida2==1:
z=2
break
else:
if y==4:
respuesta=12
elif y==3:
respuesta=6
else:
respuesta=y
print(respuesta) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string sn, sm;
cin >> sn >> sm;
int n, m, i, area = 0, flag = 0;
n = sn.length();
m = sm.length();
map<char, int> an;
map<char, int> am;
for (i = 0; i < n; i++) an[sn[i]]++;
for (i = 0; i < m; i++) am[sm[i]]++;
map<char, int>::iterator it;
for (it = am.begin(); it != am.end(); it++) {
if (an.find(it->first) == an.end()) {
flag = 1;
break;
} else {
area += min(an[it->first], it->second);
}
}
if (flag == 1)
cout << "-1";
else
cout << area;
return 0;
}
| 8 | CPP |
s=input()
a=s.count("AB")
b=s.count("BA")
if(a*b==0):
print("NO")
elif(a>2 or b>2):
print("YES")
elif(a==2 and b==2):
print("YES")
elif(a==2 and b==1):
if(s.count("ABAB")==0 ):
print("YES")
else:
print("NO")
elif(a==1 and b==2):
if(s.count("BABA")==0 ):
print("YES")
else:
print("NO")
elif(a==1 and b==1):
if(s.count("ABA")==0 and s.count("BAB")==0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
# import sys
# sys.stdin = open("test.in","r")
# sys.stdout = open("test.out","w")
n,k=map(int,input().split())
a=list(input())
for i in range(k):
b=input().split()
for j in range(int(b[0])-1,int(b[1])):
if a[j]==b[2]:
a[j]=b[3]
c=''.join(a)
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> S;
int n, a[500005], b[500005], q[500005], r;
int main() {
scanf("%d", &n);
n *= 2;
int tot = 0;
for (int i = 1; i <= n; i++) {
char c = getchar();
while (c != '+' && c != '-') c = getchar();
if (c == '+')
q[++r] = ++tot, b[i] = 0;
else {
int x;
scanf("%d", &x);
b[i] = x;
if (!r) return puts("NO"), 0;
a[q[r]] = x;
r--;
}
}
if (r) return puts("NO"), 0;
tot = 0;
for (int i = 1; i <= n; i++) {
if (!b[i]) {
++tot;
S.insert(a[tot]);
} else {
int p = (*S.begin());
S.erase(S.begin());
if (p != b[i]) return puts("NO"), 0;
}
}
puts("YES");
for (int i = 1; i <= n / 2; i++) printf("%d ", a[i]);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool flagx[100010];
bool flagy[100010];
int main() {
int n, m;
int x, y;
cin >> n >> m;
long long cntx = n, cnty = n;
memset(flagx, 0, sizeof flagx);
memset(flagy, 0, sizeof flagy);
for (int i = 0; i < m; i++) {
cin >> x >> y;
if (!flagx[x]) flagx[x] = 1, cntx--;
if (!flagy[y]) flagy[y] = 1, cnty--;
if (i) cout << ' ';
cout << cntx * 1L * cnty;
}
return 0;
}
| 8 | CPP |
x = int(input())
for i in range(x):
x = input()
length = len(x)
if length <= 10:
print(x)
else:
print(x[0]+str(length-2)+x[-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
namespace Main {
namespace Source {
template <typename T>
inline const void swap(T& a, T& b) {
const T c(a);
a = b, b = c;
}
template <typename T>
inline const T min(const T& a, const T& b) {
return b < a ? b : a;
}
template <typename T>
inline const void amin(T& a, const T& b) {
a = min(a, b);
}
class segment_tree {
struct node {
long long signed int value, lazy;
node() : value(), lazy() {}
node(const long long signed int value) : value(value), lazy(0) {}
} * o;
unsigned int n;
static inline const unsigned int middle(const unsigned int l,
const unsigned int r) {
return (l + r) / 2;
}
static inline const unsigned int ld(const unsigned int x) { return x << 1; }
static inline const unsigned int rd(const unsigned int x) {
return x << 1 bitor 1;
}
inline const void upto(const unsigned int x) {
o[x].value = min(o[ld(x)].value, o[rd(x)].value) + o[x].lazy;
}
inline const void build(
const unsigned int x, const unsigned int l, const unsigned int r,
const long long unsigned int (*f)(const unsigned int)) {
if (r - l == 1) return (const void)(o[x] = node(f(l)));
const unsigned int m(middle(l, r));
build(ld(x), l, m, f), build(rd(x), m, r, f), upto(x);
}
inline const void modify(const unsigned int x, const unsigned int l,
const unsigned int r, const unsigned int tl,
const unsigned int tr,
const long long signed int t) {
if (tl <= l and r <= tr)
return (const void)(o[x].lazy += t, o[x].value += t);
const unsigned int m(middle(l, r));
if (tl < m) modify(ld(x), l, m, tl, tr, t);
if (tr > m) modify(rd(x), m, r, tl, tr, t);
upto(x);
}
inline const long long signed int query(const unsigned int x,
const unsigned int l,
const unsigned int r,
const unsigned int tl,
const unsigned int tr) {
if (tl <= l and r <= tr) return o[x].value;
const unsigned int m(middle(l, r));
long long signed int re(0x7fffFFFFffffFFFFll);
if (tl < m) amin(re, query(ld(x), l, m, tl, tr));
if (tr > m) amin(re, query(rd(x), m, r, tl, tr));
return re + o[x].lazy;
}
public:
segment_tree() : o(NULL), n(0) {}
compl segment_tree() {
if (o) delete[] o;
}
inline const void build(const unsigned int n, const long long unsigned int (
*f)(const unsigned int)) {
if (o) delete[] o;
o = new node[n * 4](), build(1, 0, this->n = n, f);
}
inline const void modify(const unsigned int x, const signed int t) {
modify(1, 0, n, x, x + 1, t);
}
inline const void modify(const unsigned int l, const unsigned int r,
const signed int t) {
modify(1, 0, n, l, r, t);
}
inline const long long unsigned int query(const unsigned int x) {
return query(1, 0, n, x, x + 1);
}
inline const long long unsigned int query(const unsigned int l,
const unsigned int r) {
return query(1, 0, n, l, r);
}
};
} // namespace Source
using namespace Source;
enum { N = 200000, Log = 17 };
static unsigned int n, q;
namespace Tree {
struct edge;
struct node {
long long unsigned int depth;
unsigned int dfn, first, l, r;
struct nedge {
edge* e;
nedge* next;
nedge(edge* const e, nedge* const next = NULL) : e(e), next(next) {}
} * head;
inline const void add(edge* const e) { head = new nedge(e, head); }
} static o[N + 1];
struct edge {
unsigned int s, t, w;
edge() {}
edge(const unsigned int s, const unsigned int t, const unsigned int w)
: s(s), t(t), w(w) {}
inline const void change_tree(const unsigned int);
inline const void change_1(const unsigned int);
} static e[N * 2];
static unsigned int id[N];
static segment_tree tre, cyc;
static unsigned int st[Log + 2][N * 2];
static unsigned int el, sl;
inline const void edge::change_tree(const unsigned int tar) {
tre.modify(o[t].l, o[t].r, (const signed int)tar - (const signed int)w),
cyc.modify(o[t].l, o[t].r, (const signed int)tar - (const signed int)w),
w = tar;
}
inline const void edge::change_1(const unsigned int tar) {
cyc.modify(o[s].dfn, (const signed int)tar - (const signed int)w), w = tar;
}
static inline const long long unsigned int depth(const unsigned int x) {
return o[id[x]].depth;
}
static inline const long long unsigned int cycle(const unsigned int x) {
return id[x] == 1 ? 0 : o[id[x]].depth + o[id[x]].head->e->w;
}
static inline const unsigned int mindep(const unsigned int a,
const unsigned int b) {
return o[b].depth < o[a].depth ? b : a;
}
static const void search(const unsigned int x, const unsigned int m,
const long long unsigned int depth,
unsigned int& dfn) {
o[x].depth = depth, id[o[x].l = o[x].dfn = dfn++] = x,
st[0][o[x].first = sl++] = x;
for (node::nedge* i(o[x].head); i; i = i->next)
if (i->e->t != 1 and i->e->t != m)
search(i->e->t, x, depth + i->e->w, dfn), st[0][sl++] = x;
o[x].r = dfn;
}
static inline const void add(const unsigned int s, const unsigned int t,
const unsigned int w) {
o[s].add(&(e[++el] = edge(s, t, w)));
}
static inline const void read() {
for (register unsigned int i(0); i < 2 * n - 2; ++i) {
static unsigned int a, b, c;
scanf("%u%u%u", &a, &b, &c);
add(a, b, c);
}
}
static inline const void search() {
unsigned int t(0);
search(1, 0, 0, t);
}
static inline const void init() {
read(), search(), tre.build(n, depth), cyc.build(n, cycle);
for (short unsigned int i(1); i <= Log + 1; ++i)
for (register unsigned int j(0); j + (1 << i) - 1 < sl; ++j)
st[i][j] = mindep(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
}
static inline const unsigned int lca(unsigned int x, unsigned int y) {
x = o[x].first, y = o[y].first;
if (y < x) swap(x, y);
const short unsigned int t(log2(y - x + 1));
return mindep(st[t][x], st[t][y - (1 << t) + 1]);
}
static inline const void change() {
static unsigned int i, w;
scanf("%u%u", &i, &w);
if (i <= n - 1)
e[i].change_tree(w);
else
e[i].change_1(w);
}
static inline const void print() {
static unsigned int u, v;
scanf("%u%u", &u, &v);
long long unsigned int res(tre.query(o[v].dfn) - tre.query(o[u].dfn));
if (lca(u, v) not_eq u) res += cyc.query(o[u].l, o[u].r);
printf("%llu\n", res);
}
} // namespace Tree
static inline const void main() {
scanf("%u%u", &n, &q), Tree::init();
for (register unsigned int i(0); i < q; ++i) {
static short unsigned int t;
scanf("%hu", &t);
switch (t) {
case 1:
Tree::change();
break;
case 2:
Tree::print();
break;
}
}
}
} // namespace Main
signed int main() {
Main::main();
return 0;
}
| 8 | CPP |
word = input()
word = word[1:-1].split(', ')
ans = set(word)
ans.discard('')
print(len(ans))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int main()
{
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
int n,x,t;
cin>>n>>x>>t;
ll ans;
if(n-t/x>=0)
ans=(ll)(n-t/x)*(t/x)+(ll)(t/x-1)*(t/x)/2;
else
{
ans=(ll)n*(n-1)/2;
}
cout<<ans<<endl;
}
return 0;
}
| 7 | CPP |
# Premdeep Doriya
# aka pdoriya68
st1 = input();
st2 = input();
st1 = st1.lower();
st2 = st2.lower();
flag = True;
for i in range(len(st1)):
if ord(st1[i]) != ord(st2[i]):
if ord(st1[i]) < ord(st2[i]):
print('-1');
flag = False;
break;
else:
print('1');
flag = False;
break;
if flag:
print('0'); | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int indegre[1003], out[1003];
vector<long long int> v[1003];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
long long int ans = 0;
for (int i = 1; i <= M; i++) {
long long int x, y, w;
cin >> x >> y >> w;
out[x] -= w;
out[y] += w;
}
for (int i = 1; i <= N; i++) {
if (out[i] > 0) ans += out[i];
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
n,m,k = map(int,input().split())
l = []
for i in range(m+1):
b = int(input())
l.append(b)
z = l[-1]
count = 0
for i in range(m):
b = z^l[i]
c = bin(b)
if c.count('1')<=k:
count+=1
print(count)
| 8 | PYTHON3 |
n=int(input())
state=input()
pwd=input()
cnt=0
for i in range(0,n):
s= int(state[i])
p= int(pwd[i])
if s>p:
if s-p >9-s+p:
cnt=cnt+9-s+p+1
else:
cnt=cnt+s-p
elif s<p:
if p-s >9-p+s:
cnt=cnt+9-p+s+1
else:
cnt=cnt+p-s
print(cnt)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s[100];
for (int w = 1; w <= n; w++) {
int a;
cin >> a;
s[w] = a;
}
int m;
cin >> m;
int i;
for (int b = 1; b <= m; b++) {
int x, y;
cin >> x >> y;
i = x;
s[i]--;
int j = 1;
while (j < y) {
if (i == 1) {
j++;
s[i]--;
continue;
}
s[i - 1]++;
s[i]--;
j++;
}
j = s[i];
while (j > 0) {
if (i == n) {
j--;
s[i]--;
continue;
}
s[i + 1]++;
s[i]--;
j--;
}
}
for (int r = 1; r <= n; r++) {
cout << s[r] << endl;
}
return 0;
}
| 7 | CPP |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
#define int long long
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
#define rg register
const int maxn=1e5+10;
int mm,m,n,a[60];
long long f[60];
long long ans;
void dfs(int x,int n,long long sum){
if(x==n/2+1){
if(sum==m){
long long now=a[1]>=0?(9-a[1]):(9+a[1]);
for(rg int i=2;i<x;i++)now=now*(a[i]>=0?(10-a[i]):(10+a[i]));
ans+=n&1?now*10:now;
}
return ;
}
if(sum+10ll*(f[n-x]-f[x-1])<m||sum-10ll*(f[n-x]-f[x-1])>m)return ;
for(rg int i=-9;i<10;i++){
a[x]=i;
dfs(x+1,n,sum+1ll*a[x]*(f[n-x]-f[x-1]));
}
}
signed main(){
read(m),mm=m;f[0]=1;
while(mm)n++,mm/=10;
for(rg int i=1;i<=18;i++)f[i]=f[i-1]*10;
for(rg int i=n;i<=18;i++)dfs(1,i,0);
printf("%lld\n",ans);
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, d, num, group;
string s;
char c, t = '.';
bool ok[1000000];
int main() {
cin >> n >> m >> s;
for (int i = 0; i < n; i++) {
if (s[i] == t) {
num++;
if (i == 0 || s[i - 1] != t) group++;
ok[i + 1] = 1;
}
}
for (int i = 0; i < m; i++) {
cin >> d >> c;
int a = ok[d], b = c == t;
if (a != b) {
if (a)
num--;
else
num++;
if (!ok[d - 1] && !ok[d + 1] && !b) group--;
if (!ok[d - 1] && !ok[d + 1] && b) group++;
if (ok[d - 1] && ok[d + 1] && !b) group++;
if (ok[d - 1] && ok[d + 1] && b) group--;
}
ok[d] = b;
cout << num - group << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p;
while (1 == scanf("%d", &p)) {
int result = 0;
for (int x = 1; x < p; x++) {
int t = 1;
bool valid = true;
for (int i = 1; i <= p - 2; i++) {
t = (t * x) % p;
if (t == 1) {
valid = false;
break;
}
}
if (!valid) continue;
t = (t * x) % p;
if (t == 1) result++;
}
printf("%d\n", result);
}
return 0;
}
| 7 | CPP |
n = int(input())
while(n>0):
n-=1
t=int(input())
if(t<4):
print("-1")
else:
ans=str("3 1 4 2")
for i in range(5,t+1):
if(i%2!=0):
ans = ans + str(" ") +str(i)
else:
ans = str(i) +str(" ")+ans
print(ans) | 13 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s1[101], s2[101];
cin >> s1 >> s2;
for (int i = 0; s1[i] != '\0'; i++) {
if (s1[i] >= 'A' && s1[i] <= 'Z') s1[i] = s1[i] + 32;
if (s2[i] >= 'A' && s2[i] <= 'Z') s2[i] = s2[i] + 32;
}
if (strcmp(s1, s2) == 1)
cout << "1";
else if (strcmp(s1, s2) == -1)
cout << "-1";
else
cout << "0";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int constant = 320;
int m, t, r, visit[1000], night[1000], q, total;
bool used[1000];
void print(int x) {
for (int i = 0; i < (t); i++) night[x + i]++;
}
int main() {
scanf("%d %d %d", &m, &t, &r);
for (int i = 0; i < (m); i++) scanf("%d", &visit[i]);
for (int i = 0; i < (m); i++) visit[i] += constant;
for (int i = 0; i < (m); i++) {
q = 0;
while (night[visit[i]] < r) {
if (q > visit[i] || t - 1 < q) {
printf("-1\n");
return 0;
}
if (!used[visit[i] - q]) {
total++;
print(visit[i] - q);
q++;
} else
q++;
}
}
printf("%d\n", total);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n], b[n], c[n];
set<long long> s[4];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
cin >> b[i];
s[b[i]].insert(a[i]);
}
for (long long i = 0; i < n; i++) {
cin >> c[i];
s[c[i]].insert(a[i]);
}
long long m;
cin >> m;
for (long long i = 0; i < m; i++) {
long long tmp;
cin >> tmp;
if (s[tmp].empty()) {
cout << -1 << " ";
} else {
long long ele = *s[tmp].begin();
cout << ele << " ";
for (long long j = 1; j <= 3; j++) {
s[j].erase(ele);
}
}
}
cout << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
const double PI = acos(-1.0);
using namespace std;
long long mod, l, r, k;
struct matrix {
long long num[2][2];
};
matrix mul(matrix a, matrix b) {
matrix c;
for (int i = 0; i <= 1; i++)
for (int j = 0; j <= 1; j++) {
c.num[i][j] = 0;
for (int k = 0; k <= 1; k++)
c.num[i][j] =
(c.num[i][j] % mod + a.num[i][k] % mod * b.num[k][j] % mod) % mod;
c.num[i][j] %= mod;
}
return c;
}
matrix quick_pow(matrix a, long long x) {
matrix t;
t.num[1][1] = t.num[0][0] = 1;
t.num[1][0] = t.num[0][1] = 0;
for (; x; x >>= 1) {
if (x & 1) t = mul(t, a);
a = mul(a, a);
}
return t;
}
long long maxx(long long a, long long b) {
if (a > b) return a;
return b;
}
int main() {
long long k, l, r;
cin >> mod >> l >> r >> k;
long long ans = -1;
for (int i = 1; (long long)i * i <= r; i++) {
if (r / i - (l - 1) / i >= k) ans = maxx(ans, i);
if (r / (r / i) - (l - 1) / (r / i) >= k) ans = maxx(ans, r / i);
}
if (mod == 1)
cout << 0 << endl;
else if (ans <= 2)
cout << 1 << endl;
else {
matrix t;
t.num[0][0] = t.num[1][0] = t.num[0][1] = 1;
t.num[1][1] = 0;
t = quick_pow(t, ans - 1);
printf("%I64d\n", (t.num[0][0] + mod) % mod);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int INF = 2000000000;
const long long BIG = 1446803456761533460LL;
const int maxn = 3010;
const int maxc = 12;
const int maxc2 = 1 << maxc;
int N, M, C, C2, A[maxn], dp1[maxn][maxc2], dp2[maxn][maxn], res[maxn];
int pow2[maxn], cnt[maxn];
int poww(int a, int b) {
int r = 1;
while (b) {
if (b & 1) r = (1LL * (r) * (a)) % MOD;
a = (1LL * (a) * (a)) % MOD;
b >>= 1;
}
return r;
}
void small_C() {
C2 = 1 << C;
dp1[0][0] = 1;
for (int i = 0; i < N; ++i) {
M = (i + 1) / C;
for (int j = (M + 1) - 1; j >= 0; --j) {
for (int b = (C2)-1; b >= 0; --b) {
int bb = b | (1 << A[i]);
if (bb == C2 - 1) {
if ((dp1[j + 1][0] += dp1[j][b]) >= MOD) dp1[j + 1][0] -= MOD;
} else {
if ((dp1[j][bb] += dp1[j][b]) >= MOD) dp1[j][bb] -= MOD;
}
}
}
}
for (int j = 0; j < M + 1; ++j)
for (int b = 0; b < C2; ++b)
if ((res[j] += dp1[j][b]) >= MOD) res[j] -= MOD;
--res[0];
}
void large_C() {
pow2[1] = 1;
for (int i = 0; i < maxn - 2; ++i) pow2[i + 2] = (pow2[i + 1] * 2 + 1) % MOD;
for (int i = (maxn - 2) - 1; i >= 0; --i)
pow2[i + 2] = (1LL * (pow2[i + 2]) * (poww(pow2[i + 1], MOD - 2))) % MOD;
dp2[0][0] = 1;
for (int i = 0; i < N; ++i) {
memset(cnt, 0, sizeof cnt);
M = (i + 1) / C;
int zero = C - 1;
int val = 1;
for (int k = (i + 1) - 1; k >= 0; --k) {
if (k < i && A[k] != A[i]) {
if (cnt[A[k]] == 0)
--zero;
else
val = (1LL * (val) * (pow2[cnt[A[k]] + 1])) % MOD;
++cnt[A[k]];
}
if (zero == 0)
for (int j = 0; j < M + 1; ++j) {
dp2[i + 1][j + 1] = (dp2[i + 1][j + 1] + 1LL * dp2[k][j] * val) % MOD;
}
}
}
memset(cnt, 0, sizeof cnt);
int val = 1;
int zero = C;
for (int i = (N + 1) - 1; i >= 0; --i) {
M = (i + 1) / C;
if (i < N) {
if (cnt[A[i]] == 0)
--zero;
else
val = (1LL * (val) * (pow2[cnt[A[i]] + 1])) % MOD;
++cnt[A[i]];
}
int a = poww(2, N - i);
if (zero == 0)
if ((a += MOD - val) >= MOD) a -= MOD;
for (int j = 0; j < M + 1; ++j) {
res[j] = (res[j] + 1LL * dp2[i][j] * a) % MOD;
}
}
--res[0];
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> N >> C;
for (int i = 0; i < N; ++i) cin >> A[i], --A[i];
if (C < maxc)
small_C();
else
large_C();
for (int i = 0; i < N + 1; ++i) cout << res[i] << ' ';
cout << '\n';
}
| 12 | CPP |
n = set(list(input().split(" ")))
if len(n)==2:
print("Yes")
else:
print("No") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e3 + 10;
int n, m, k;
struct oh {
int r, l;
oh *next;
} *org = new oh, *ed = new oh;
oh *sert(int l, int d);
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
org->r = org->l = 0;
ed->r = ed->l = 0x7fffffff;
org->next = ed;
while (n--) {
int w, d;
cin >> w >> d;
oh x = *sert(w, d);
cout << x.l << " " << x.r << endl;
}
return 0;
}
oh *sert(int l, int d) {
int r = l + d - 1;
oh *q = new oh, *p1 = org, *p2, *fl = 0;
while (p1 != ed) {
p2 = p1->next;
if (fl == 0 && p2->l > p1->r + d) {
fl = p1;
q->l = p1->r + 1;
q->r = q->l + d - 1;
}
if (l > p1->r && r < p2->l) {
fl = p1;
q->l = l;
q->r = r;
break;
}
p1 = p2;
}
q->next = fl->next;
fl->next = q;
return q;
}
| 13 | CPP |
#include <iostream>
using namespace std;
long n, k;
const long MAX = 100000;
long T[MAX];
long check(long p){
long i = 0;
for (long j = 0; j < k; j++){
long s = 0;
while (s + T[i] <= p){
s += T[i];
i++;
if (i == n) return n;
}
}
return i;
}
long solve(){
long left = 0;
long right = 100000 * 10000;
while (left < right){
long mid = (left + right) / 2;
long v = check(mid);
if (v >= n) right = mid;
else left = mid + 1;
}
return right;
}
int main(){
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> T[i];
long ans = solve();
cout << ans << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
int main() {
int x, y;
scanf("%d %d", &x, &y);
double root = sqrt(x * x + y * y);
int flor = (int)root;
if (flor == root) {
printf("black\n");
return 0;
}
if (x * y < 0) flor++;
(flor & 1) ? printf("white\n") : printf("black\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, last;
int small[205][205];
bool vis[205];
int mn[205], len;
pair<int, int> a[105];
inline bool smaller(int x, int y) {
if (~small[x][y]) return small[x][y];
printf("? %d %d\n", x, y);
fflush(stdout);
char ch = getchar();
while (ch < 33) ch = getchar();
small[x][y] = (ch == '<');
small[y][x] = (ch == '>');
return small[x][y];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
cout << fixed << setprecision(12);
int tests;
cin >> tests;
while (tests--) {
cin >> n;
memset(small, -1, sizeof(small));
for (int i = 1; i <= n; ++i) {
if (smaller(i * 2 - 1, i * 2))
a[i] = {i * 2 - 1, i * 2};
else
a[i] = {i * 2, i * 2 - 1};
}
stable_sort(a + 1, a + n + 1,
[&](const pair<int, int> &x, const pair<int, int> &y) -> bool {
return smaller(x.first, y.first);
});
memset(vis, false, sizeof(vis));
last = 1;
for (int i = 2; i <= n; ++i) {
len = 0;
for (int j = 1; j <= last; ++j)
if (!vis[j]) mn[++len] = a[j].second;
if (!len) {
++last;
continue;
}
int x = *min_element(mn + 1, mn + len + 1, smaller);
if (smaller(a[last + 1].first, x))
++last;
else {
for (int j = 1; j <= last; ++j)
if (a[j].second == x) {
vis[j] = true;
break;
}
}
}
printf("!\n");
fflush(stdout);
}
return 0;
}
| 15 | CPP |
num = int(input())
if(num >= 1 or num <= 100):
if(num%2==0 and num!=2):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
Subsets and Splits