solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
import sys
input = sys.stdin.readline
def solve_case():
a, b, c, d = [int(x) for x in input().split()]
if a > b * c:
print(-1)
else:
k = a // (b * d)
print(a * (k + 1) - k * (k + 1) // 2 * b * d)
def main():
for _ in range(int(input())):
solve_case()
main() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int M = 1000005;
int n, a[M];
long long cnt[M];
long long sum[M];
long long sz[M];
long long ans;
long long pos[M];
void Add(long long &x) { x %= mod, x += mod, x %= mod; }
int main() {
pos[0] = 1;
for (int i = 1; i <= 1000000; i++) pos[i] = pos[i - 1] * 2, pos[i] %= mod;
cin >> n;
for (int i = 1, x; i <= n; i++) {
scanf("%d", &x);
int S = sqrt(x);
for (int j = 1; j <= S; j++) {
if (x % j == 0) {
sum[j]++;
if (j * j != x) sum[x / j]++;
}
}
}
for (int i = 1000000, x; i > 1; i--) {
if (sum[i] == 0) continue;
x = i;
int S = sqrt(x);
ans += (((pos[sum[i] - 1] * sum[i]) % mod) - sz[i]) * i;
Add(ans);
for (int j = 2; j <= S; j++) {
if (x % j == 0) {
sz[j] += pos[sum[i] - 1] * sum[i] - sz[i];
Add(sz[j]);
if (j * j != x) {
sz[x / j] += pos[sum[i] - 1] * sum[i] - sz[i];
Add(sz[x / j]);
}
}
}
}
printf("%lld", ans);
}
| 10 | CPP |
def find_set(v):
if v==parent[v]:
return v
parent[v] = find_set(parent[v])
return parent[v]
def union_sets(x,y):
x = find_set(x)
y = find_set(y)
if x!=y:
if rank[x] < rank[y]:
x,y = y,x
parent[y] = x
if rank[x] == rank[y]:
rank[x]+=1
n,k = map(int,input().split())
parent = [0]*n
rank = [0]*n
vis = [0]*n
for i in range(n):
parent[i] = i
for _ in range(k):
x,y = map(int,input().split())
union_sets(x-1,y-1)
#print(parent)
c = 0
for i in range(n):
if parent[i] == i:
c+=1
print(k-n+c)
| 10 | PYTHON3 |
from sys import stdin, stdout
n = int(stdin.readline())
values = list(map(int, stdin.readline().split()))
challengers = []
for i in range(n):
challengers.append(values[i])
challengers.sort()
cnt = 0
for i in range(1, n + 1):
a = challengers.pop()
if a != values[-i]:
for j in range(n, i, -1):
if values[-j] == a:
values[-j], values[-i] = values[-i], values[-j]
break
break
if sorted(values) != values:
stdout.write('NO')
else:
stdout.write('YES') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T& num) {
char CH;
bool F = false;
for (CH = getchar(); CH < '0' || CH > '9'; F = CH == '-', CH = getchar())
;
for (num = 0; CH >= '0' && CH <= '9';
num = num * 10 + CH - '0', CH = getchar())
;
F && (num = -num);
}
int stk[70], tp;
template <class T>
inline void print(T p) {
if (!p) {
puts("0");
return;
}
while (p) stk[++tp] = p % 10, p /= 10;
while (tp) putchar(stk[tp--] + '0');
putchar('\n');
}
const long long mod = 1e9 + 7;
const double PI = acos(-1.0);
const int inf = 1e9;
const int N = 5e5 + 10;
const int maxn = (1 << 20) + 14;
const double eps = 1e-12;
int n, cnt;
vector<int> ve[N];
int dep[N], num[N];
void dfs(int cur, int fa, int deep) {
int len = ve[cur].size();
for (int i = 0; i < len; i++) {
int x = ve[cur][i];
if (x == fa) continue;
dfs(x, cur, deep + 1);
}
if (len == 1) dep[++cnt] = deep;
}
int main() {
int u, v;
read(n);
for (int i = 1; i <= n - 1; i++) {
read(u);
read(v);
ve[u].push_back(v);
ve[v].push_back(u);
}
int len = ve[1].size(), ans = 0;
for (int i = 0; i < len; i++) {
cnt = 0;
dfs(ve[1][i], 1, 1);
sort(dep + 1, dep + cnt + 1);
for (int j = 1; j <= cnt; j++) {
num[j] = max(num[j - 1] + 1, dep[j]);
}
ans = max(ans, num[cnt]);
}
print(ans);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
string st, tem;
vector<int> tk, point;
int sz_man, sz_point;
int ck(int md) {
int lst = 0;
for (int j = 0; j < sz_man; j++) {
int man = tk[j];
int dif = max(0, man - point[lst]);
if (dif > md) return 0;
lst = lower_bound(point.begin(), point.end(), man) - point.begin();
if (lst == sz_point) return 1;
int start = lst;
for (int i = start; i < sz_point; i++) {
int now = point[i];
int a = dif * 2 + now - man;
int b = (now - man) * 2 + dif;
lst = i;
if (min(a, b) > md) break;
if (i == sz_point - 1) return 1;
}
if (point[lst] > man) {
for (int i = j; i < sz_man; i++) {
if (tk[i] > point[lst]) break;
j = max(j, i - 1);
}
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long i, j, l, u, v, w, x, y, z, a, b, c, d, e, f, t = 1, tc;
long long flg, sz, cnt, gt, ans, mx, mn, res;
long long m, k, n;
long long low, hi, md, sm, ff;
cin >> n >> st;
sz = st.size();
low = 0, hi = sz * 2 + 10;
for (i = 0; i < sz; i++) {
if (st[i] == 'P') tk.push_back(i);
;
if (st[i] == '*') point.push_back(i);
;
}
sz_man = tk.size();
sz_point = point.size();
ans = 0;
while (low <= hi) {
md = (low + hi) / 2;
if (ck(md))
ans = md, hi = md - 1;
else
low = md + 1;
}
cout << ans << endl;
return 0;
}
| 11 | CPP |
n = int(input())
a = list(map(int,input().split()))
x = list(set(a))
if len(x)>3:
print(-1)
elif len(x)==1:
print(0)
elif len(x)==2:
if (abs(x[0]-x[1]))%2==0:
print((abs(x[0]-x[1]))//2)
else:
print(abs(x[0]-x[1]))
else:
x.sort()
if (2*x[1])==(x[0]+x[2]):
print(x[1]-x[0])
else:
print(-1) | 8 | PYTHON3 |
def f(n):
l = ['Sheldon', 'Leonard', 'Penny', 'Rajesh','Howard']
pl = [5*(2**i-1) for i in range(1,33)] #1,3,7,..
for i in range(33):
if pl[i]>=n:
break
if i==0:
return l[n-1]
n -= pl[i-1]
return l[n//(1<<i)]
n = int(input())
print(f(n))
| 7 | PYTHON3 |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
ye = 2*x + y
bl = y + 3*z
o = max(0, ye - a) + max(0, bl - b)
print(o) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, char> > adj[100];
vector<pair<bool, bool> > oddeven[100];
signed main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
long long arr[n + 1];
for (long long i = 0; i < n; i++) cin >> arr[i + 1];
vector<long long> stk;
stk.push_back(0);
for (long long i = 1; i <= n; i++) {
stk.push_back(arr[i]);
while (stk[stk.size() - 1] == stk[stk.size() - 2]) {
long long a = stk[stk.size() - 1];
stk.pop_back();
stk.pop_back();
stk.push_back(a + 1);
}
}
cout << stk.size() - 1 << endl;
for (long long i = 1; i < stk.size(); i += 1) cout << stk[i] << " ";
return 0;
}
| 11 | CPP |
from fractions import gcd
a, b, n = map(int, input().split())
while True:
gcd_simon = gcd(a, n)
if gcd_simon <= n:
n -= gcd_simon
else:
print (1)
break
gcd_antisimon = gcd(b, n)
if gcd_antisimon <= n:
n -= gcd_antisimon
else:
print (0)
break
| 7 | PYTHON3 |
if "".join(sorted(input().split())) == '1479':
print('YES')
else:
print('NO') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, M, K, T;
string s;
int cnt[26];
int main() {
cin >> N >> s;
int st = s[0], pos = -1;
for (int i = 1; i < N; i++) {
if (st != s[i]) {
pos = i;
break;
}
}
if (pos == -1)
cout << "NO";
else
cout << "YES\n" << string(s.begin() + pos - 1, s.begin() + pos + 1);
return 0;
}
| 7 | CPP |
n = int(input())
count = 0
for i in range(n):
x, y, z = map(int,input().split())
if x + y >=2 or x + z >=2 or y + z >=2 :
count = count + 1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double n, r;
cin >> n >> r;
long double x = ((n - 2) / (2 * n)) * 3.1415926535897;
long double t = cos(x);
long double ans = r * t / (1 - t);
cout << std::setprecision(8) << ans << endl;
}
| 9 | CPP |
t = int(input())
for i in range(t):
n = int(input())
a = list(map(int, input().split()))
left = n
dp = [0] * n
for i in range(n - 2, -1, -1):
if (a[i] == 1):
dp[i] = 1 - dp[i + 1]
else:
dp[i] = 0
if (dp[0] == 0):
print('First')
else:
print('Second') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[400];
int v[] = {1, 2, 4};
bool b[10][400];
int main() {
cin.sync_with_stdio(false);
int k;
cin >> k;
int x = 1;
a[1] = make_pair(1, 1);
a[2] = make_pair(2, 1);
a[3] = make_pair(3, 1);
a[4] = make_pair(4, 1);
x = 5;
for (int j = 2; j <= 11; ++j)
for (int i = 0; i < 3; ++i) a[x++] = make_pair(v[i], j);
for (int i = 1; i <= k; ++i) {
b[a[i].first][a[i].second] = 1;
}
cout << "+------------------------+\n";
cout << "|";
for (int i = 1; i <= 11; ++i)
if (b[1][i])
cout << "O.";
else
cout << "#.";
cout << "|D|)\n";
for (int i = 2; i <= 4; ++i) {
cout << "|";
for (int j = 1; j <= 11; ++j)
if (i != 3) {
if (b[i][j])
cout << "O.";
else
cout << "#.";
} else {
if (j > 1)
cout << "..";
else {
if (b[i][j])
cout << "O.";
else
cout << "#.";
}
}
if (i != 3)
cout << "|.|";
else
cout << "..|";
if (i != 4) cout << "\n";
}
cout << ")\n";
cout << "+------------------------+";
return 0;
}
| 7 | CPP |
n = int(input());
def number_of_moves(a, b):
diff = abs(a - b)
ans = 0 if a == b else 1
ans = 2 if b > a and diff % 2 == 0 else ans
ans = 2 if a > b and diff % 2 == 1 else ans
return ans
for i in range(n):
inpt = input().strip().split(' ')
inpt = list(map(lambda x: int(x),inpt))
answer = number_of_moves(inpt[0], inpt[1])
print(answer) | 7 | PYTHON3 |
from sys import stdin,stdout
input = stdin.readline
def main():
n, m = map(int,input().split())
sets = list(range(n+1+m))
sizes = [1]*(n+1+m)
def get(a):
if sets[a] != a:
sets[a] = get(sets[a])
return sets[a]
def union(a, b):
a = get(a)
b = get(b)
if a == b:return
if sizes[a] > sizes[b]:
a,b = b,a
sets[a] = b
sizes[b] += sizes[a]
flags = [1]*n
for i in range(n):
nums = list(map(int,input().split()))
for j in range(1,nums[0]+1):
union(i,nums[j]-1+n)
flags[i] = nums[0]
ans = 0
s=set()
for i in range(n):
if flags[i] == 0:
ans+=1
continue
s.add(get(i))
print(max(0,len(s)-1)+ans)
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y[1000], a, b, c, d, n, i, j;
cin >> n;
cin >> a >> b >> c >> d;
x = a + b + c + d;
for (i = 1; i < n; i++) {
cin >> a >> b >> c >> d;
y[i] = a + b + c + d;
}
for (i = 1; i < n - 1; i++)
for (j = 1; j < n - i; j++)
if (y[j] < y[j + 1]) swap(y[j], y[j + 1]);
i = 1;
while (x < y[i]) i++;
cout << i;
return 0;
}
| 7 | CPP |
k, n, w = input().split()
k = int(k)
n = int(n)
w = int(w)
if (w * (w + 1) * k) / 2 - n <= 0:
print("0")
else:
print(int((w * (w + 1) * k) / 2 - n)) | 7 | PYTHON3 |
n=int(input())
a=[]
su=0
for i in range(n):
b=[]
b=list(map(int, input().split()))
a.append(b)
for i in range(n):
for j in range(n):
if a[i][0]==a[j][1]:
su+=1
print(su)
| 7 | PYTHON3 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> in(n);
for(int i = 0;i< n;i++){
cin >> in[i];
}
vector<int> check(n, 1);//ok
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
int A = j, B = i;
for(int k = 0;k < n;k++){
A = (A+1)%n;
B = (B-1+n)%n;
if (in[i][j] != in[A][B]){
check[k] = 0;
}
}
}
}
int ans = count(begin(check), end(check), 1);
cout << ans * n << endl;
return 0;
}
| 0 | CPP |
'''test=int(input())
for i in range(test):
a,b,c,d=[int(i) for i in input().split(" ")]
x,y,x1,y1,x2,y2=[int(i) for i in input().split(" ")]
ans1=0
ans2=0
if abs(x-x1)>=a and abs(x2-x)>=b:
ans1=1
elif abs(x-x1)>=a:
if abs(x2-(x-a))>=b:
ans1=1
elif abs(x2-x)>=b:
if abs(x+b-x1)>=a:
ans1=1
if abs(y-y1)>=c and abs(y2-y)>=d:
ans2=1
elif abs(y-y1)>=c:
if abs(y2-(y-c))>=d:
ans2=1
elif abs(y2-y)>=d:
if abs(y+d-y1)>=c:
ans2=1
if ans1&ans2:
print("YES")
else:
print("NO")'''
'''b=int(input())
s1=[int(i) for i in input().split(' ')]
g=int(input())
s2=[int(i) for i in input().split(" ")]
s1.sort()
s2.sort()
ans=0
for i in range(b):
for j in range(g):
if abs(s1[i]-s2[j])<=1:
s2[j]=1000
ans+=1
break
print(ans)
'''
#CF 639
'''test=int(input())
for i in range(test):
n,m=[int(i) for i in input().split()]
if n==1:
print("YES")
elif '''
'''test=int(input())
def value(t):
return (t*(3*t+1))/2
def f(x):
if x<2:
return 0
elif x==2:
return 1
else:
h=1
k=2
while k<=x:
h+=1
k=value(h)
card_used=value(h-1) if k!=x else k
return 1+f(x-card_used)
for i in range(test):
n=int(input())
ans=f(n)
#print(value(4))
print(ans)
'''
#CF 640 (DIV-4)
'''test=int(input())
for i in range(test):
n=int(input())
ans=[]
c=0
while n:
k=10**(c)
ans.append((n%10)*k)
c+=1
n=n//10
tes=[i for i in ans if i]
print(len(tes))
for j in tes:
print(j,end=" ")'''
'''test=int(input())
for i in range(test):
n,k=[int(i) for i in input().split()]'''
'''test=int(input())
for i in range(test):
n,k=[int(i) for i in input().split()]
jump=n-1
if k<n:
rank=k
else:
rank=k+int((k-1)//(n-1))
print(rank)'''
'''test=int(input())
for i in range(test):
n=int(input())
arr=[int(i) for i in input().split()]
i=-1
j=n
rem=n
alice=0
bob=0
prev=0
flag=1
cnt=0
while rem>0 and j!=i:
gain=0
if flag:
while gain<=prev and rem>0 and i!=j:
i+=1
gain+=arr[i]
rem-=1
flag=0
alice+=gain
prev=gain
else:
while gain<=prev and rem>0 and j!=i:
j-=1
gain+=arr[j]
rem-=1
flag=1
bob+=gain
prev=gain
cnt+=1
print(cnt,alice,bob,sep=" ")
'''
#CF 641
'''test=int(input())
def f(n):
i=2
while i**2<=n:
if n%i==0:
return i
i+=1
return n
for i in range(test):
n,k=[int(i) for i in input().split()]
if n%2:
n+=f(n)
n+=2*(k-1)
elif not n%2:
n+=2*(k)
print(n)'''
'''test=int(input())
for i in range(test):
n=int(input())
arr=[int(i) for i in input().split()]
dp=[1]*(n)
for i in range(len(arr)-1,-1,-1):
flag=0
intial=2
mul=(i+1)*2
while mul<=len(arr):
if arr[mul-1]>arr[i]:
dp[i]=max(dp[i],1+dp[mul-1])
intial+=1
mul=(i+1)*intial
print(max(dp)) '''
#CF 642(DIV.-3)
'''test=int(input())
for i in range(test):
n,m=[int(i) for i in input().split()]
if n==1:
print(0)
elif n==2:
print(m)
else:
if n%2:
print(2*m)
else:
print(1+2*(m-1))'''
test=int(input())
for i in range(test):
n,k=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
if k==0:
print(sum(a))
else:
a.sort()
b.sort(reverse=True)
for i in range(k):
if a[i]<b[i]:
a[i]=b[i]
print(sum(a))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
int n = s.length();
set<int> ones;
set<int> zeros;
for (int i = 0; i < n; i++) {
if (s[i] == '1')
ones.insert(i + 1);
else
zeros.insert(i + 1);
}
vector<vector<int> > ans;
bool ok = true;
while (!zeros.empty()) {
vector<int> temp;
int num = *zeros.begin();
temp.push_back(num);
zeros.erase(num);
int status = 1;
while (1) {
int to_find = temp.back();
if (status == 1) {
auto it = ones.upper_bound(to_find);
if (it == ones.end()) {
break;
} else {
temp.push_back(*it);
ones.erase(*it);
status = 0;
}
} else {
auto it = zeros.upper_bound(to_find);
if (it == zeros.end()) {
break;
} else {
temp.push_back(*it);
zeros.erase(*it);
status = 1;
}
}
}
if (status == 1) {
ans.push_back(temp);
} else {
ok = false;
break;
}
}
if (ones.empty() && zeros.empty() && ok) {
cout << ans.size() << "\n";
for (auto var : ans) {
cout << var.size() << " ";
for (auto new_var : var) cout << new_var << " ";
cout << "\n";
}
} else {
cout << "-1";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100006, MOD = 1e8, N = 201000;
int S, a[N], P;
string s, p;
bool ck(int in) {
vector<int> v;
for (int i = 0; i < in; i++) v.push_back(a[i]);
sort(v.begin(), v.end());
string now;
int r = 0;
for (int i = 0; i < S; i++) {
if (r < in)
if (v[r] == i) {
r++;
continue;
}
now += s[i];
}
for (int i = 0, j = 0; i < now.size(); i++) {
if (now[i] == p[j]) j++;
if (j == P) return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> s >> p;
S = s.length();
P = p.length();
for (int i = 0; i < S; i++) cin >> a[i], --a[i];
int l = 0, r = S - P, ans = 0;
while (l <= r) {
int m = (l + r) >> 1;
if (ck(m)) {
ans = m;
l = m + 1;
} else
r = m - 1;
}
cout << ans << endl;
}
| 7 | CPP |
def rolling(n, ls):
l = []
for i in range(n):
c = 0
s = 7
while(ls[i] > 0):
if(ls[i] > 1 and ls[i] < 8):
c = c + 1
ls[i] = 0
elif(ls[i] % s != 1):
c = c + int(ls[i] / s)
ls[i] = ls[i] % s
s = s - 1
l.append(c)
return l
n = int(input())
ls = [int(input()) for i in range(n)]
print("\n".join(map(str, rolling(n, ls)))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int a[100001], val[100001];
vector<int> g[100001];
long long int n;
void dfs(int u, long long int s) {
if (a[u] == -1) {
a[u] = s;
long long int cur = 1LL * 1e18;
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
cur = min(cur, a[v]);
}
if (cur != 1LL * 1e18) a[u] = cur;
}
if (a[u] != -1) {
if (s > a[u]) {
cout << -1 << endl;
exit(0);
}
val[u] = a[u] - s;
s = a[u];
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
dfs(v, s);
}
}
}
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int p;
cin >> p;
g[p].push_back(i + 2);
}
for (int i = 1; i <= n; i++) cin >> a[i];
dfs(1, 0);
long long int ans = 0;
for (int i = 0; i < n + 1; i++) ans += val[i];
cout << ans << endl;
return 0;
}
| 10 | CPP |
def cal(n):
while n > 9:
ans = 0
while n > 0:
ans += n % 10
n //= 10
n = ans
return n
for i in range(int(input())):
k, x = map(int, input().split())
print((k - 1) * 9 + x) | 8 | PYTHON3 |
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)
ok = True
d_max = max(a)
if n > 2 and d_max == 1:
ok = False
if c[d_max] == 1:
ok = False
else:
if d_max % 2 == 0:
d_min = d_max // 2
if min(a) < d_min:
ok = False
if c[d_min] != 1:
ok = False
for d in range(d_min + 1, d_max):
if c[d] < 2:
ok = False
else:
d_min = (d_max + 1) // 2
if min(a) < d_min:
ok = False
if c[d_min] != 2:
ok = False
for d in range(d_min + 1, d_max):
if c[d] < 2:
ok = False
if ok:
print("Possible")
else:
print("Impossible") | 0 | PYTHON3 |
n = int(input())
ans = [int(1e7) - i for i in range(n)][::-1]
print(' '.join(map(str, ans)))
| 8 | PYTHON3 |
N = int(input())
src = [tuple(map(int,input().split())) for i in range(N-1)]
ans = []
for i in range(N-1):
t = 0
for c,s,f in src[i:]:
if t <= s:
t = s+c
else:
t += (-t%f) + c
ans.append(t)
ans.append(0)
print(*ans,sep='\n') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long l, r, x = 1;
cin >> l >> r;
unsigned long long a = l, b = r, ans = 0;
for (int i = 63; i >= 0; i--)
if (((x << i) & l) == ((x << i) & r)) {
if (((x << i) & l) == 0) {
if (((x << i) ^ a) <= r) {
ans += (x << (i + 1)) - 1;
break;
}
} else {
if (((x << i) ^ b) >= l) {
ans += (x << (i + 1)) - 1;
break;
}
}
} else
ans = ans ^ (x << i);
cout << ans << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Pii = pair<int, int>;
using Pli = pair<ll, int>;
const int inf = 1e9 + 10;
const int maxN = 2 * 1e5 + 10;
int n, m, q;
vector<Vi> adj;
vector<int> in, out;
void solve() {
cin >> n >> m;
adj.resize(n + 1);
in.resize(n + 1);
out.resize(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
adj[a].push_back(b);
in[a]++;
out[b]++;
}
long long result = 0;
for (int i = 1; i <= n; i++) {
result += (ll)in[i] * out[i];
}
cout << result << "\n";
cin >> q;
for (int i = 0; i < q; i++) {
int a;
cin >> a;
for (int v : adj[a]) {
result -= out[a] + in[v];
in[a]--;
out[a]++;
out[v]--;
in[v]++;
adj[v].push_back(a);
result += in[a] + out[v];
}
adj[a].clear();
cout << result << "\n";
}
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int z = 1;
for (int i = 0; i < z; i++) {
solve();
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct matr {
long long a1, a2, b1, b2;
} emp;
long long n, k, l, m;
matr fib;
matr mulmatr(matr a, matr b) {
matr c;
c.a1 = a.a1 * b.a1 + a.a2 * b.b1;
c.a2 = a.a1 * b.a2 + a.a2 * b.b2;
c.b1 = a.b1 * b.a1 + a.b2 * b.b1;
c.b2 = a.b1 * b.a2 + a.b2 * b.b2;
c.a1 %= m;
c.a2 %= m;
c.b1 %= m;
c.b2 %= m;
return c;
}
matr binmatr(matr x, long long exp) {
if (exp == 0) {
return emp;
}
if (exp % 2) {
return mulmatr(binmatr(x, exp - 1), x);
}
matr t = binmatr(x, exp >> 1);
return mulmatr(t, t);
}
long long binpow(long long x, long long exp) {
if (exp == 0) {
return 1 % m;
}
if (exp % 2) {
return (binpow(x, exp - 1) * (x % m)) % m;
}
long long t = binpow(x, exp >> 1);
return ((t % m) * (t % m)) % m;
}
long long solve() {
long long p = min(l, 60ll);
if (k >= (1ll << p)) return 0ll;
emp.a1 = emp.b2 = 1 % m;
fib.a1 = 0;
fib.a2 = fib.b1 = fib.b2 = 1 % m;
long long ans = 1 % m;
matr test = binmatr(fib, n + 1);
long long poww = binpow(2, n);
long long zero = test.b2;
long long one = ((poww - zero) % m + m) % m;
for (int i = 0; i < l; i++) {
long long x = (k >> i) & 1;
if (x) {
ans = ((ans % m) * (one % m)) % m;
} else {
ans = ((ans % m) * (zero % m)) % m;
}
}
return ans;
}
int main() {
cin >> n >> k >> l >> m;
cout << solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> tbl;
vector<int> sol;
int x, y, xx0, yy0, a, b, a0, b0, hit;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> x >> y >> xx0 >> yy0 >> s;
a = --xx0, b = --yy0, hit = 0, a0 = b0 = -1;
tbl = vector<vector<int>>(x, vector<int>(y, s.size()));
tbl[a][b] = 0;
sol = vector<int>(s.size() + 1);
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if (c == 'U')
a = max(0, min(x - 1, xx0 - 1));
else if (c == 'D')
a = max(0, min(x - 1, xx0 + 1));
else if (c == 'R')
b = max(0, min(y - 1, yy0 + 1));
else if (c == 'L')
b = max(0, min(y - 1, yy0 - 1));
tbl[a][b] = min(tbl[a][b], i + 1);
xx0 = a;
yy0 = b;
}
for (auto &v : tbl)
for (int w : v) ++sol[w];
for (int i = 0; i < sol.size(); ++i) cout << sol[i] << ' ';
cout << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 20;
map<long long, long long> v[N][N];
long long n, m, half, k, a[N][N], ans;
void calclf(long long x, long long y, long long val, long long cnt) {
val ^= a[x][y];
if (cnt == half) {
v[x][y][val]++;
return;
}
if (x + 1 < n) calclf(x + 1, y, val, cnt + 1);
if (y + 1 < m) calclf(x, y + 1, val, cnt + 1);
}
void calcrg(long long x, long long y, long long val, long long cnt) {
if (cnt == n + m - 2 - half) {
if (v[x][y][k ^ val] > 0) ans += v[x][y][k ^ val];
return;
}
if (x > 0) calcrg(x - 1, y, val ^ a[x][y], cnt + 1);
if (y > 0) calcrg(x, y - 1, val ^ a[x][y], cnt + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long i, j;
cin >> n >> m >> k;
half = (n + m - 2) / 2;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
calclf(0, 0, 0, 0);
calcrg(n - 1, m - 1, 0, 0);
cout << ans << endl;
return 0;
}
| 12 | CPP |
x1,x2,x3,x4=map(int,input().split())
l=[x1,x2,x3,x4]
l.sort()
m=l[3]
a=m-l[0]
b=m-l[1]
c=m-l[2]
print(a,b,c) | 7 | PYTHON3 |
s = input();
flag=0
for i,c in enumerate(s):
if i==0:
continue
elif i==len(s)-1:
continue
else:
l=[]
if s[i-1]!='.' and s[i+1]!='.' and s[i]!='.':
l.append(s[i-1])
l.append(s[i+1])
l.append(c)
if len(set(l))==3:
flag=1
break
if flag==0:
print("No")
else:
print("Yes") | 7 | PYTHON3 |
k,t=map(int,input().split());a=list(map(int,input().split()));m=max(a);print(max(0,m-(k-m)-1)) | 0 | PYTHON3 |
s = input()
res = s.split("WUB")
for t in res:
if (t != ""): print(t, end=" ") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m = 1000008;
bool prime[m];
for (int i = 0; i < m; ++i) prime[i] = true;
for (int i = 2; i <= m; ++i) {
if (prime[i])
for (long long j = 1LL * i * i; j < m; j += i) prime[j] = false;
}
int n;
cin >> n;
int res = 0;
for (int i = 1; i <= n; ++i) {
int cnt = 0;
for (int j = 2; j < i; ++j)
if (i % j == 0 && prime[j]) ++cnt;
if (cnt == 2) ++res;
}
cout << res << "\n";
return 0;
}
| 7 | CPP |
n=int(input())
l=[1,5,10,20,100]
i=4
c = 0
while i>=0:
if n>=l[i]:
tmp = n//l[i]
c+=tmp
n=n%l[i]
i-=1
else:
i-=1
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int f = 1, ans = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = ans * 10 + c - '0';
c = getchar();
}
return f * ans;
}
const int MAXN = 2e3 + 11;
int d[MAXN], D[MAXN], N, M, A[MAXN][MAXN];
void copy() {
for (int i = 1; i <= N; i++) D[i] = d[i];
return;
}
int calc() {
int res = 0, cnt = 0;
sort(D + 1, D + N + 1);
for (int i = 1; i <= N; i++) {
res += D[i];
if (res == (i * (i - 1) / 2)) cnt++;
}
return cnt;
}
bool col[MAXN];
char str[MAXN];
int main() {
N = read();
for (int i = 1; i <= N; i++) {
scanf("%s", str + 1);
for (int j = 1; j <= N; j++) {
A[i][j] = str[j] - '0';
if (A[i][j]) d[j]++;
}
}
copy();
if (calc() == 1) {
printf("0 1\n");
return 0;
}
if (N <= 6) {
int cnt = N + 1, ans = 0;
for (int S = 1; S < (1 << N); S++) {
int num = 0;
for (int i = 1; i <= N; i++) col[i] = S & (1 << (i - 1)), num += col[i];
memset(D, 0, sizeof(D));
for (int u = 1; u <= N; u++)
for (int v = 1; v <= N; v++)
if (A[u][v]) {
if (col[u] ^ col[v])
D[v]++;
else
D[u]++;
}
if (calc() != 1) continue;
if (num < cnt)
cnt = num, ans = 1;
else if (num == cnt)
ans++;
}
if (cnt == N + 1) {
printf("-1\n");
return 0;
}
int mul = 1;
for (int i = 1; i <= cnt; i++) mul *= i;
printf("%d %d\n", cnt, ans * mul);
return 0;
}
int cnt = 0;
for (int u = 1; u <= N; u++) {
copy();
for (int v = 1; v <= N; v++) {
if (A[u][v]) D[v]--, D[u]++;
if (A[v][u]) D[u]--, D[v]++;
}
if (calc() == 1) cnt++;
}
printf("1 %d\n", cnt);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1010];
int main() {
int t, n;
while (~scanf("%d", &n)) {
int maxx = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &t);
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
if ((a[j] - a[i]) <= t) maxx = max(j - i + 1, maxx);
}
}
printf("%d\n", maxx);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dr[] = {0, 1, -1, 0, 1, -1, -1, 1};
int dc[] = {-1, 0, 0, 1, 1, 1, -1, -1};
int main() {
int a, b, c;
int v[3];
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
sort(v, v + 3);
cout << ((v[1] - v[0]) + (v[2] - v[1])) << endl;
return 0;
}
| 7 | CPP |
import sys
import math
n, m, q = map(int, input().split())
g = math.gcd(n, m)
ds = [None, n // g, m // g]
buf = []
for line in sys.stdin:
sx, sy, ex, ey = map(int, line.split())
s_area = (sy - 1) // ds[sx]
e_area = (ey - 1) // ds[ex]
buf.append('yes' if s_area == e_area else 'no')
print('\n'.join(buf))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2222;
int dp[N][N];
string s, t;
void checkMin(int &a, int b) {
if (a == -1 || a > b) a = b;
}
void solve() {
int slen = s.length(), tlen = t.length();
int ans = -1;
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= tlen; i++) {
for (int j = 0; j <= slen; j++) {
checkMin(dp[j][i], i);
checkMin(ans, dp[j][i] + tlen - i);
if (j + 1 <= slen && i + 1 <= tlen)
checkMin(dp[j + 1][i + 1], dp[j][i] + (s[j] != t[i]));
}
}
cout << ans << endl;
}
int main() {
cin >> s >> t;
solve();
return 0;
}
| 7 | CPP |
s=input()
cnt=set(s)
cnts=len(cnt)
if cnts==2:
print('Yes')
else:
print('No') | 0 | PYTHON3 |
for _ in range(int(input())):
n,x=map(int,input().split())
arr=list(map(int,input().split()))
res=0
tmp=arr.copy()
new_arr=[0]*n
for i in range(n):
cnt=0
while arr[i]%x==0:
cnt+=1
arr[i]=arr[i]//x
new_arr[i]=cnt
idx=new_arr.index(min(new_arr))
min_value=min(new_arr)
res=(min_value+1)*sum(tmp)+sum(tmp[:idx])
print(res) | 8 | PYTHON3 |
n=int(input());print(int(n**.5)**2) | 0 | PYTHON3 |
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = sys.stdin.readline().split()
self.index = 0
val = self.buff[self.index]
self.index += 1
return val
def next_int(self):
return int(self.next())
def cal(self, s):
if len(s) == 1:
return s[0]
if s[0] == 0:
return self.cal(s[1:])
v = 1
for c in s:
v *= c
return v
def solve(self):
n = self.next_int()
m = self.next_int()
h = self.next_int()
f = [self.next_int() for _ in range(0, m)]
l = [self.next_int() for _ in range(0, n)]
for i in range(0, n):
rs = []
for j in range(0, m):
if self.next_int() == 0:
rs.append(0)
else:
rs.append(min(f[j], l[i]))
print(' '.join(map(lambda x: str(x), rs)))
if __name__ == '__main__':
Main().solve()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> v, u;
pair<long long, long long> n;
set<string> y;
long long a, b, c, d = 0, e = 1, i, f = 0, g = 0, j, k = 1, l = 0, r = 0, z,
m, h, p[100001];
string t[100001], s[100001], x = "", q;
double w;
cin >> a;
for (i = 1; i <= a; i++) {
cin >> s[i] >> t[i];
if (s[i] > t[i]) {
swap(s[i], t[i]);
}
}
for (i = 1; i <= a; i++) {
cin >> p[i];
if (s[p[i]] > x) {
x = s[p[i]];
} else {
if (t[p[i]] > x) {
x = t[p[i]];
} else {
cout << "NO";
exit(0);
}
}
}
cout << "YES";
}
| 9 | CPP |
### Boy or Girl
s=input()
if len(set(s))&1:
print("IGNORE HIM!")
else:print( "CHAT WITH HER!")
| 7 | PYTHON3 |
#include<cstdio>
#include<cstdlib>
#include<string>
#include<iostream>
using namespace std;
struct Node {
int key;
Node *right, *left, *parent;
};
Node *root, *NIL;
Node *find(Node *u, int k) {
while (u != NIL&&k != u->key) {
if (k < u->key)u = u->left;
else u = u->right;
}
return u;
}
void insert(int k) {
Node *y = NIL;
Node *x = root;
Node *z;
z = (Node*)malloc(sizeof(Node));
z->key = k;
z->left = NIL;
z->right = NIL;
while (x != NIL) {
y = x;
if (z->key < x->key) {
x = x->left;
}else{
x = x->right;
}
}
z->parent = y;
if (y == NIL) {
root = z;
} else {
if (z->key < y->key) {
y->left = z;
} else {
y->right = z;
}
}
}
void inorder(Node *u) {
if (u == NIL)return;
inorder(u->left);
cout << " " << u->key;
inorder(u->right);
}
void preorder(Node *u) {
if (u == NIL)return;
cout << " " << u->key;
preorder(u->left);
preorder(u->right);
}
int main()
{
int n, i, x;
string com;
cin >> n;
for (i = 0; i < n; i++) {
cin >> com;
if (com == "find") {
cin >> x;
Node *t = find(root, x);
if (t != NIL) cout << "yes" << endl;
else cout << "no" << endl;
}else if (com == "insert") {
cin >> x;
insert(x);
}else if(com=="print"){
inorder(root);
printf("\n");
preorder(root);
printf("\n");
}
}
return 0;
} | 0 | CPP |
t = int(input())
for _ in range(t):
n = int(input())
a = sorted(map(int, input().split()))
if n < 3:
print(0)
else:
total = 0
for i in range(1,n-1):
total += i * a[-2-i]
for i in range(1,n-1):
total -= i * a[i+1]
print(total)
| 9 | PYTHON3 |
#include<iostream>
#include<cmath>
using namespace std;
int main(void)
{
int i,j,k,l,n,d,m=0,ans=0;
cin>>n>>d;
int x[n][d];
for(i=0;i<n;i++) for(j=0;j<d;j++) cin>>x[i][j];
for(i=0;i<n;i++){
for(j=i;j<n;j++){
m=0;
for(k=0;k<d;k++) m=m+(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
for(l=1;l<=160;l++){
if(l*l==m) ans++;
}
}
}
cout<<ans<<endl;
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
cout<<s.rfind("Z")-s.find("A")+1<<endl;
}
| 0 | CPP |
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
"""
created by shhuan at 2017/10/12 22:12
"""
n = int(input())
s = input()
# n = 100000
# s = ''
# for i in range(n):
# x = random.randint(1, 10)
# if x >= 5:
# s += '1'
# else:
# s += '0'
#
# t0 = time.time()
# n = 8
# s = '11010111'
ones = [0] * (n+1)
for i in range(1, n+1):
ones[i] = ones[i-1]
ones[i] += s[i-1] == '1'
ones = [2*x for x in ones]
ones = [(x-i, i) for i,x in enumerate(ones)]
ds = collections.defaultdict(list)
for d, i in ones:
ds[d].append(i)
# print(ones)
# print(ds)
ans = 0
for k, v in ds.items():
ans = max(ans, max(v)-min(v))
print(ans)
# print(time.time() - t0)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 101000;
int n, m, x[N], px, val, nrel[3 * N], py, poo;
long long sum[7][11][3 * N];
void update(int nod, int pozx, int pozy) {
int i, j;
if (pozx == pozy) {
nrel[nod] = 1;
for (i = 2; i <= 6; ++i)
for (j = 0; j < 2 * i - 2; ++j) {
if (!j)
sum[i][j][nod] = 1LL * 2 * val;
else if (j < i)
sum[i][j][nod] = 1LL * j * val;
else
sum[i][j][nod] = 1LL * (2 * i - j) * val;
}
return;
}
int mid = (pozx + pozy) / 2;
if (mid < px)
update(2 * nod + 1, mid + 1, pozy);
else
update(2 * nod, pozx, mid);
nrel[nod] = nrel[2 * nod + 1] + nrel[2 * nod];
for (i = 2; i <= 6; ++i)
for (j = 0; j < 2 * i - 2; ++j)
sum[i][j][nod] = sum[i][j][2 * nod] +
sum[i][(j + nrel[2 * nod]) % (2 * i - 2)][2 * nod + 1];
}
long long query(int nod, int pozx, int pozy, int zig, int po) {
if (px <= pozx && pozy <= py) return sum[zig][po][nod];
int mid = (pozx + pozy) / 2;
if (mid < px) return query(2 * nod + 1, mid + 1, pozy, zig, po);
if (mid >= py) return query(2 * nod, pozx, mid, zig, po);
return query(2 * nod, pozx, mid, zig, po) +
query(2 * nod + 1, mid + 1, pozy, zig, (mid - px + 2) % (2 * zig - 2));
}
int main() {
int i, op, zig;
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> x[i];
px = i;
val = x[i];
update(1, 1, n);
}
cin >> m;
for (i = 1; i <= m; ++i) {
cin >> op;
if (op == 1) {
cin >> px >> val;
update(1, 1, n);
} else {
cin >> px >> py >> zig;
cout << query(1, 1, n, zig, 1) << "\n";
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
T gcd(T a, T b) {
return a ? gcd(b % a, a) : b;
}
template <class T>
int sgn(T x) {
return x > 0 ? 1 : (x < 0 ? -1 : 0);
}
string str;
const int maxn = 2e5;
int size[maxn];
vector<int> ans[maxn];
set<int> s1, s2, s;
int main() {
cin >> str;
int cur = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == '0') {
if (s2.empty())
s.insert(i);
else {
int j = *s2.begin();
ans[j].push_back(i);
s2.erase(j);
s1.insert(j);
}
} else {
if (s1.empty()) {
if (s.empty()) {
cout << -1;
return 0;
} else {
int j = *s.begin();
s.erase(j);
ans[cur].push_back(j);
ans[cur].push_back(i);
s2.insert(cur);
++cur;
}
} else {
int j = *s1.begin();
s1.erase(j);
s2.insert(j);
ans[j].push_back(i);
}
}
}
if (!s2.empty()) {
cout << -1;
return 0;
}
printf("%d\n", cur + s.size());
for (int i = 0; i < cur; ++i) {
printf("%d ", ans[i].size());
for (auto j : ans[i]) printf("%d ", j + 1);
printf("\n");
}
for (auto j : s) printf("1 %d\n", j + 1);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;cin>>N;
vector<int> a(N+1);
for(int i=1;i<=N;i++)cin>>a[i];
int cnt=0;
for(int i=1;i<=N;i++){
if(a[a[i]]==i)cnt++;
}
cout<<cnt/2<<endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int avg;
cin >> n;
int math, coder, no;
for (int i = 0; i < n; i++) {
cin >> math >> coder >> no;
avg = (math + coder + no) / 3;
cout << min(min(math, coder), avg) << endl;
}
}
| 9 | CPP |
l = []
while not l or len(l) < len(l[0]):
l.append(list(map(int, input().split())))
for x in l:
if 1 in x:
y = [(l.index(x)+1),(x.index(1)+1)]
print(abs(3 - y[0]) + abs(3 - y[1])) | 7 | PYTHON3 |
x=int(input());print(0,0,x) | 7 | PYTHON3 |
import math
for _ in range(int(input())):
n,s=map(int,input().strip().split())
if n==1:
print(0)
elif n==2:
print(s)
else:
min_val=s//2
max_val=math.ceil(s/2)
print((min_val*2)+(max_val*2)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int arr[5];
using namespace std;
int main() {
int n;
int cnt = 1;
cin >> n;
int t1, t2;
int cr1 = -1, cr2 = -1;
int mx = 0;
int res = 0;
for (int i = 0; i < n; ++i) {
cin >> t1 >> t2;
if (t1 == cr1 && t2 == cr2)
++cnt;
else {
cnt = 1;
}
res = max(res, cnt);
cr1 = t1;
cr2 = t2;
}
cout << res << endl;
return 0;
}
| 7 | CPP |
input0 = input().split(" ")
input1 = list(map(int, input0))
k = input1[0]
n = input1[1]
w = input1[2]
total = 0
for i in range(1, w+1):
total += i * k
remainder = total - n
if remainder > 0:
print(remainder)
else:
print("0")
| 7 | PYTHON3 |
def main():
word_count = int(input())
words = []
for i in range(word_count):
words.append(input())
for word in words:
if word[-2:] == 'po':
print('FILIPINO')
elif word[-4:] == 'desu' or word[-4:] == 'masu':
print('JAPANESE')
elif word[-5:] == 'mnida':
print('KOREAN')
else:
print('not possible..')
if __name__ == '__main__':
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
using lim = numeric_limits<T>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int rem = a[0] % k;
bool possible = true;
long long total = a[0];
long long smol = a[0];
for (int i = 1; i < n; i++) {
possible &= rem == a[i] % k;
total += a[i];
if (smol > a[i]) smol = a[i];
}
total -= smol * n;
if (possible)
cout << total / k << "\n";
else
cout << -1 << "\n";
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define erep(i, m, n) for(int i=m; i<=n; i++)
static const int dx[] = {-1, 0, 1, 0};
static const int dy[] = {0, -1, 0, 1};
int n;
int h, w;
int X1[1111], Y1[1111];
int X2[1111], Y2[1111];
bool maze[6666][6666];
inline bool check(int hx, int hy){ return 0 <= hx && hx < h - 1 && 0 <= hy && hy < w - 1;}
int main(int argc, char *argv[])
{
while(cin >> w >> h, w){
cin >> n;
rep(i, n) cin >> Y1[i] >> X1[i] >> Y2[i] >> X2[i];
vector<int> x, y;
rep(i, n) erep(dz, -1, 1){
int nx1 = X1[i] + dz;
int nx2 = X2[i] + dz;
int ny1 = Y1[i] + dz;
int ny2 = Y2[i] + dz;
if(0 <= nx1 && nx1 <= h) x.push_back(nx1);
if(0 <= nx2 && nx2 <= h) x.push_back(nx2);
if(0 <= ny1 && ny1 <= w) y.push_back(ny1);
if(0 <= ny2 && ny2 <= w) y.push_back(ny2);
}
x.push_back(0);
x.push_back(h);
y.push_back(0);
y.push_back(w);
sort(x.begin(), x.end());
sort(y.begin(), y.end());
x.erase(unique(x.begin(), x.end()), x.end());
y.erase(unique(y.begin(), y.end()), y.end());
rep(i, n){
X1[i] = find(x.begin(), x.end(), X1[i]) - x.begin();
X2[i] = find(x.begin(), x.end(), X2[i]) - x.begin();
Y1[i] = find(y.begin(), y.end(), Y1[i]) - y.begin();
Y2[i] = find(y.begin(), y.end(), Y2[i]) - y.begin();
}
h = x.size();
w = y.size();
rep(i, h) rep(j, w) maze[i][j] = false;
rep(i, h) maze[i][w - 1] = true;
rep(j, w) maze[h - 1][j] = true;
rep(k, n) erep(i, X1[k], X2[k] - 1) erep(j, Y1[k], Y2[k] - 1) maze[i][j] = true;
int res = 0;
rep(i, h) rep(j, w) if(!maze[i][j]) {
res += 1;
maze[i][j] = true;
queue<pair<int, int> > que;
que.push(make_pair(i, j));
while(!que.empty()){
pair<int, int> here = que.front(); que.pop();
int hx = here.first;
int hy = here.second;
rep(k, 4){
int nx = hx + dx[k];
int ny = hy + dy[k];
if(!check(nx, ny)) continue;
if(!maze[nx][ny]){
maze[nx][ny] = true;
que.push(make_pair(nx, ny));
}
}
}
}
cout << res << endl;
}
return 0;
} | 0 | CPP |
for _ in range(int(input())):
n,x=map(int,input().split())
m = {}
ans=[]
for i in range(n-1):
a,b =map(int,input().split())
m[a]=0
m[b]=0
ans.append(a)
ans.append(b)
for i in ans:
m[i]+=1
if(n==1 or m[x]==1):
print("Ayush")
else:
if (n-2)%2==0:
print("Ayush")
else:
print("Ashish") | 9 | PYTHON3 |
k, d = [int(x) for x in input().split()]
if d == 0 and k != 1:
print('No solution')
else:
print(str(d) + '0' * (k - 1))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int ara[201009];
int main() {
int n, s, x;
cin >> n >> s;
int mx = 0, flag = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
if (i == s) {
if (x != 0) {
flag = 1;
continue;
}
}
ara[x]++;
mx = max(mx, x);
}
int t1 = 0;
if (flag == 0)
t1 = ara[0] - 1;
else
t1 = ara[0];
int tot = 0;
for (int i = 1; i <= mx; i++) {
if (ara[i] == 0 && t1 > 0) {
tot++;
ara[i] = 1;
t1--;
if (t1 == 0) break;
}
}
tot = tot + t1 + flag;
ara[0] = 1;
for (int i = 0; i <= mx; i++) {
if (ara[i] == 0) {
tot++;
ara[i] = 1;
ara[mx]--;
while (ara[mx] == 0) mx--;
}
}
cout << tot << endl;
return 0;
}
| 9 | CPP |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int n, power[14];
void solve(int x, int v, string S) {
if (v == n) { reverse(S.begin(), S.end()); printf("%s\n", S.c_str()); return; }
if (x == 14) return;
solve(x + 1, v - power[x], S + '-');
solve(x + 1, v, S + '0');
solve(x + 1, v + power[x], S + '+');
}
int main() {
power[0] = 1;
for (int i = 1; i < 14; i++) power[i] = power[i - 1] * 3;
scanf("%d", &n); solve(0, 0, "");
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100;
int tot = 0;
int prime[MaxN + 5];
bool CheckPrime(int x) {
for (int i = 2; i <= x - 1; i++)
if (x % i == 0) return false;
return true;
}
int main() {
for (int i = 2; i <= 51; i++)
if (CheckPrime(i)) prime[++tot] = i;
int cnt = 0;
bool flag = true;
char res[5];
for (int i = 1; i <= tot; i++) {
printf("%d\n", prime[i]);
fflush(stdout);
scanf("%s", res);
if (res[0] == 'y') {
cnt++;
if (cnt > 1) {
flag = false;
break;
}
if (prime[i] <= 10) {
printf("%d\n", prime[i] * prime[i]);
fflush(stdout);
scanf("%s", res);
if (res[0] == 'y') {
flag = false;
break;
}
}
}
}
if (flag)
printf("prime\n");
else
printf("composite\n");
fflush(stdout);
}
| 9 | CPP |
x = list(map(int, input().split()))
r = []
mx = max(x)
for i in range(0, len(x)):
if x[i] != mx:
r.append(mx - x[i])
print(r[0],r[1],r[2]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[3][3];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0, k = 2; i < 3; i++, k--) {
for (int j = 0, l = 2; j < 3; j++, l--) {
if (a[i][j] != a[k][l]) {
cout << "NO";
return 0;
}
}
}
cout << "YES";
return 0;
}
| 7 | CPP |
a,b,*c=map(int,open(0).read().split());print(sum(sorted(c)[:b])) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k1, k2, x, count = 0, check = 1000;
cin >> n;
cin >> k1;
queue<int> q1, q2;
while (k1--) {
cin >> x;
q1.push(x);
}
cin >> k2;
while (k2--) {
cin >> x;
q2.push(x);
}
while (q1.size() > 0 || q2.size() > 0) {
count++;
int a = q1.front();
int b = q2.front();
q1.pop();
q2.pop();
if (a > b) {
q1.push(b);
q1.push(a);
if (q2.size() == 0) {
cout << count << " " << 1;
break;
}
}
if (b > a) {
q2.push(a);
q2.push(b);
if (q1.size() == 0) {
cout << count << " " << 2;
break;
}
}
if (count == 1000) {
cout << -1;
break;
}
}
return 0;
}
| 9 | CPP |
n=int(input())
a=list(map(int,input().split()))
mn=set()
mn.add(0)
k=1
for i in range(n):
if a[i] in mn:
mn-={a[i]}
mn.add(i+1)
else:
k+=1
mn.add(i+1)
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 6E2;
int n, m;
double f[N], g[N];
vector<int> e[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int s, t;
cin >> s >> t;
--s;
--t;
e[s].push_back(t);
}
for (int i = n - 2; i >= 0; --i) {
for (int v : e[i])
f[i] += f[v] + 1;
f[i] /= e[i].size();
}
double ans = f[0];
for (int i = 0; i < n; ++i) {
if (e[i].size() <= 1)
continue;
double mx = 0;
for (int v : e[i])
mx = max(mx, f[v] + 1);
copy(f, f + n, g);
g[i] = (g[i] * e[i].size() - mx) / (e[i].size() - 1);
for (int j = i - 1; j >= 0; --j) {
g[j] = 0;
for (int v : e[j])
g[j] += g[v] + 1;
g[j] /= e[j].size();
}
ans = min(ans, g[0]);
}
cout << setprecision(10) << fixed << ans << endl;
return 0;
} | 0 | CPP |
from sys import stdin, stdout
def main():
#t = int(stdin.readline())
t = int(input())
ans = []
for _ in range(t):
#a, b, c, d = map(int, stdin.readline().split(' '))
a, b, c, d = map(int, input().split(' '))
x, y = b, c
for z in range(c, d + 1):
if x + y >= z and x + z >= y and y + z >= x:
ans.append(' '.join(map(str, [x, y, z])))
break
#stdout.write('\n'.join(map(str, ans)))
print(*ans, sep='\n')
if __name__ == "__main__":
main() | 7 | PYTHON3 |
for _ in range(int(input())):
n = input()
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mask = [0]*len(a)
d = {}
for i in range(len(b)):
d[b[i]] = i
ans = 0
for i in range(len(a)):
if mask[i]==0:
mask[i] = 1
s = set()
s.add(a[i])
x = i
while (len(s)!=len(a)):
x = d[a[x]]
mask[x] = 1
if a[x] in s:
break
s.add(a[x])
ans+=1
print(pow(2,ans,10**9+7))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long tu[2000001], tu1[2000001];
int main() {
long long n, m;
cin >> n;
long long q;
map<long long, long long> wp;
for (long long a = 1; a <= n; a++) {
scanf("%I64d", &q);
wp[q]++;
}
cin >> m;
for (long long a = 1; a <= m; a++) scanf("%I64d", &tu[a]);
for (long long a = 1; a <= m; a++) scanf("%I64d", &tu1[a]);
long long gx = -1, my = -1;
long long zuobiao = -1;
for (long long a = 1; a <= m; a++) {
if (wp[tu[a]] > gx || wp[tu[a]] >= gx && wp[tu1[a]] >= my) {
gx = wp[tu[a]];
zuobiao = a;
my = wp[tu1[a]];
}
}
cout << zuobiao << endl;
return 0;
}
| 9 | CPP |
n, k = map(int, input().split())
x = k*(n // k + 1)
print(x)
| 7 | PYTHON3 |
N = int(input())
if N not in [1, 2, 3, 5, 6, 9, 10, 13, 17]:
print("Yes")
else:
print("No")
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 5, M = 100000 + 5;
int n, m;
int f[N];
struct EdgeTable {
int hd[N], to[M], nxt[M];
inline void addedge(int idx, int a, int b) {
nxt[idx] = hd[a];
hd[a] = idx;
to[idx] = b;
}
};
EdgeTable zheng, fan;
bool can1[N], can2[N];
inline void calc_can1() {
queue<int> q;
for (int i = 1; i <= n; ++i) {
if (f[i] == 1) {
can1[i] = true;
q.push(i);
}
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (int e = zheng.hd[u]; e; e = zheng.nxt[e]) {
int v = zheng.to[e];
if (can1[v]) continue;
can1[v] = true;
q.push(v);
}
}
}
inline void calc_can2() {
queue<int> q;
for (int i = 1; i <= n; ++i) {
if (f[i] == 2) {
can2[i] = true;
q.push(i);
}
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (int e = fan.hd[u]; e; e = fan.nxt[e]) {
int v = fan.to[e];
if (can2[v]) continue;
can2[v] = true;
if (f[v] != 1) q.push(v);
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &f[i]);
for (int i = 1; i <= m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
zheng.addedge(i, a, b);
fan.addedge(i, b, a);
}
calc_can1();
calc_can2();
for (int i = 1; i <= n; ++i) printf("%d\n", can1[i] && can2[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> nodes[1 << 20];
vector<int> color[1 << 20];
bool vis[1 << 20];
int val[1 << 20];
int cnt[1 << 20];
unordered_map<int, bool> mp[1 << 20];
int n;
void dfs(int x) {
if (vis[x]) return;
vis[x] = true;
for (int y : nodes[x]) {
if (val[y] != val[x] && !mp[val[x]][val[y]]) {
mp[val[x]][val[y]] = true;
cnt[val[x]]++;
}
dfs(y);
}
}
int main() {
int m;
int chosen = 1;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &val[i]);
color[val[i]].push_back(i);
chosen = val[i];
}
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
nodes[x].push_back(y);
nodes[y].push_back(x);
}
for (int i = 1; i <= n; i++) {
dfs(i);
}
for (int i = 1; i <= 1e5; i++) {
if (color[i].size() == 0) continue;
if (cnt[chosen] < cnt[i] || (cnt[chosen] == cnt[i] && chosen > i))
chosen = i;
}
cout << chosen;
return 0;
}
| 10 | CPP |
s = input() + 'd'
n = len(s)
glas = set(('a', 'o', 'u', 'i', 'e'))
f = True
for i in range(n - 1):
if s[i] in glas or s[i] == 'n':
continue
if s[i + 1] not in glas:
f = False
if f:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 1, MAXX = 1e9 + 1;
int n, a[MAXN];
map<int, int> dp, id;
signed main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
if (dp[a[i]] < dp[a[i] - 1] + 1) {
dp[a[i]] = dp[a[i] - 1] + 1;
id[a[i]] = i;
}
}
int MAX = INT_MIN, maxid;
map<int, int>::iterator itr;
for (itr = dp.begin(); itr != dp.end(); ++itr) {
if (MAX < itr->second) {
MAX = itr->second;
maxid = itr->first;
}
}
cout << MAX << endl;
int pal = maxid;
vector<int> ans;
for (int i = n; i >= 1; --i) {
if (pal == maxid - MAX) break;
if (pal == a[i]) {
pal--;
ans.push_back(i);
}
}
for (int i = int(ans.size()) - 1; i >= 0; --i) {
cout << ans[i] << " ";
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, x, c[100009];
bool d[100009];
long long sm, mx;
bool w;
vector<int> v, v1, v2;
int main() {
cin >> n >> k >> x;
for (int i = 1; i <= n; i++) {
cin >> c[i];
if (i - 1 >= 1)
if (c[i] == c[i - 1] and c[i] == x) v2.push_back(i);
}
for (int k = 0; k < v2.size(); k++) {
sm += 2;
for (int i = 1; i <= n; i++)
if (i != v2[k] and i != v2[k] - 1) v.push_back(c[i]);
for (int i = 1; i <= 100; i++) {
int x = v.size();
if (x - 2 > 0)
for (int j = 0; j < v.size() - 2; j++)
if (v[j] == v[j + 1] and v[j + 1] == v[j + 2])
d[j] = d[j + 1] = d[j + 2] = 1, w = 1;
if (w == 0) break;
for (int j = 0; j < v.size(); j++) {
if (d[j] == 0)
v1.push_back(v[j]);
else
sm++;
}
v = v1;
v1.clear();
w = 0;
fill(d, d + n + 1, 0);
}
mx = max(sm, mx);
sm = 0;
v.clear();
}
cout << mx << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 15, MS = 32;
char tMap[MS][MS], tRes[MS][MS];
int bID[MS][MS], n, m, res, number[N], pos[MS][3];
int check(bool gen = false) {
int used[7][7];
memset(used, 0, sizeof used);
for (int i = 1; i <= 28; ++i) {
int a = number[pos[i][1]], b = number[pos[i][2]];
if (used[a][b]) return 0;
used[a][b] = used[b][a] = 1;
}
if (gen) {
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (tMap[i][j] != '.')
tRes[i][j] = '0' + number[bID[i][j]];
else
tRes[i][j] = '.';
}
return 1;
}
void dfs(int cp, int cv) {
if (cv == 7) {
res += check(res == 0);
return;
}
if (number[cp] != -1)
dfs(cp + 1, cv);
else {
for (int i = cp + 1; i <= 14; ++i)
if (number[i] == -1) {
number[cp] = number[i] = cv;
dfs(cp + 1, cv + 1);
number[cp] = number[i] = -1;
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%s", tMap[i] + 1);
int cn = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (tMap[i][j] != '.') {
if (!bID[i][j])
bID[i][j] = bID[i][j + 1] = bID[i + 1][j] = bID[i + 1][j + 1] = ++cn;
int z = 1 + ((tMap[i][j] >= 'a') ? tMap[i][j] - 'a'
: tMap[i][j] - 'A' + 26);
pos[z][++pos[z][0]] = bID[i][j];
}
if (cn != 14) throw;
memset(number, -1, sizeof number);
dfs(1, 0);
printf("%I64d\n", (long long)res * 7 * 6 * 5 * 4 * 3 * 2 * 1);
for (int i = 1; i <= n; ++i) printf("%s\n", tRes[i] + 1);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
cout << a[(n + 1) / 2 - 1];
return 0;
}
| 7 | CPP |
n, m = map(int, input().split())
b = 0
t = n
swap = False
n = min(n, m)
m = max(t, m)
if n != t:
swap = True
if abs(n-m)%2 == 0:
b = 1
a = n + (abs(n-m)-1)//2
c = 6-m+1 + (abs(n-m)-1)//2
if n == m:
print(0, 6, 0)
elif swap:
print(c, b, a)
else:
print(a, b, c)
| 7 | PYTHON3 |
for i in range(int(input())):
a,b,n = map(int,input().split())
x = a^b
if n%3 == 0:
print(a)
elif n%3 == 1:
print(b)
else:
print(x) | 7 | PYTHON3 |
a="I hate "
b="I love "
c="that "
d="it "
z=" "
n=int(input())
for i in range(2,n+2):
if i==2:
z+=a
else:
if i%2==0:
z+=c+a
if i%2!=0:
z+=c+b
print (z + d) | 7 | PYTHON3 |
n,m=map(int,input().split())
cnt=0
for i in range(n):
l=[int(i) for i in input().split()]
for j in range(0,2*m,2):
if l[j]==1 or l[j+1]==1:
cnt+=1
print(cnt) | 7 | PYTHON3 |
def sum_digits(n):
s = 0
while n:
s += n % 10
n //= 10
return s
n=int(input())
while(sum_digits(n)%4!=0):
n+=1
print(n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int mx = 0;
const int maxn = 5100;
int q[maxn][maxn * 2];
int s[maxn * 2];
int f[maxn];
int g[maxn];
int ta[maxn];
int tb[maxn];
int n;
bool cmp(int a[], int b[], int t) {
ta[0] = t;
for (int i = 0; i <= mx; i++) {
if (a[i] == -1 && b[i] != -1) return false;
if (a[i] == -1) continue;
tb[a[i]] = i ^ t;
}
for (int i = 0; i < n; i++) ta[i] = g[i] ^ tb[i];
if (ta[0] != t) return false;
for (int i = 0; i < n; i++)
if (ta[tb[i]] != i) return false;
sort(tb, tb + n);
for (int i = 1; i < n; i++)
if (tb[i] == tb[i - 1]) return false;
return true;
}
int main() {
scanf("%d", &n);
memset(s, -1, sizeof(s));
memset(q, -1, sizeof(q));
for (int i = 0; i < n; i++) {
printf("? %d %d\n", 0, i);
fflush(stdout);
scanf("%d", &f[i]);
s[f[i]] = i;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
mx = max(mx, i ^ j);
q[i][i ^ j] = j;
}
}
for (int i = 0; i < n; i++) {
printf("? %d %d\n", i, i);
fflush(stdout);
scanf("%d", &g[i]);
}
int res = 0, t = -1;
for (int i = 0; i < n; i++) {
if (cmp(s, q[i], i)) {
res++;
t = i;
}
}
cmp(s, q[t], t);
printf("!\n%d\n", res);
for (int i = 0; i < n; i++) {
printf("%d", ta[i]);
if (i == n - 1)
printf("\n");
else
printf(" ");
}
}
| 8 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.