solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
vector<int> vec1, vec2, vec;
int main() {
int n;
while (scanf("%d", &n) == 1) {
vec.clear();
vec1.clear();
vec2.clear();
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
vec.push_back(temp);
}
sort(vec.begin(), vec.end());
int flag = 0;
for (int i = 0; i < n - 2; i++) {
if (vec[i] == vec[i + 1] && vec[i] == vec[i + 2]) {
flag = 1;
break;
}
}
if (flag) {
printf("NO\n");
continue;
}
vec1.push_back(vec[0]);
for (int i = 1; i < n; i++) {
if (vec1.back() == vec[i])
vec2.push_back(vec[i]);
else {
vec1.push_back(vec[i]);
}
}
int len1 = vec1.size(), len2 = vec2.size();
printf("YES\n");
printf("%d\n", len1);
for (int i = 0; i < len1; i++)
i == 0 ? printf("%d", vec1[i]) : printf(" %d", vec1[i]);
printf("\n");
printf("%d\n", len2);
for (int i = len2 - 1; i >= 0; i--)
i == len2 - 1 ? printf("%d", vec2[i]) : printf(" %d", vec2[i]);
printf("\n");
}
return 0;
}
| 9 | CPP |
n = int(input())
S = input()
rooms = [0] * 10
for s in S:
if s == "L":
for i in range(10):
if not rooms[i]:
rooms[i] = 1
break
elif s == "R":
for i in reversed(range(10)):
if not rooms[i]:
rooms[i] = 1
break
else:
rooms[int(s)] = 0
print("".join(map(str, rooms)))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int N = 1e6 * 5;
long double EPS = 1 / 1e18;
map<int, int> m;
map<pair<int, int>, int> m1;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m2, i;
cin >> n >> m2;
pair<int, int> a[400000];
for (i = 0; i < m2; i++) {
cin >> a[i].first >> a[i].second;
m[a[i].first]++;
m[a[i].second]++;
if (a[i].first < a[i].second) swap(a[i].first, a[i].second);
m1[a[i]]++;
}
int x = a[0].first, y = a[0].second;
for (i = 1; i <= n; i++) {
if (m[i] == 0 || i == x) continue;
if (m[i] + m[x] - m1[make_pair(max(i, x), min(i, x))] == m2) {
cout << "YES";
return 0;
}
}
for (i = 1; i <= n; i++) {
if (m[i] == 0 || i == y) continue;
if (m[i] + m[y] - m1[make_pair(max(i, y), min(i, y))] == m2) {
cout << "YES";
return 0;
}
}
cout << "NO";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int num[1010], id[1010], flag[1010];
int main() {
int n, a, b;
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d%d", &a, &b);
if (a < b) swap(a, b);
if (a != n) return 0 * printf("NO\n");
num[b]++;
}
id[1] = n;
int L = 1, R = 1;
for (int i = n - 1; i >= 1; i--) {
if (num[i]) {
for (int j = 1; j <= num[i] - 1; j++) R++;
id[++R] = i;
flag[R] = 1;
} else {
while (id[L + 1]) L++;
id[++L] = i;
}
if (L > R) return 0 * printf("NO\n");
}
printf("YES\n");
for (int i = 1; i < R; i++) {
if (!flag[i])
printf("%d %d\n", id[i], id[i + 1]);
else
printf("%d %d\n", n, id[i + 1]);
}
return 0;
}
| 11 | CPP |
n = int(input())
teams = []
c = 0
for i in range(n):
t = [int(i) for i in input().split()]
teams.append(t)
for i in range(n-1):
for j in range(i+1, n):
if teams[i][0]==teams[j][1]:
c += 1
if teams[i][1]==teams[j][0]:
c += 1
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int first[100010], color[100010];
int sign[(100010 << 1)];
int main() {
int N, M, K, cmax, num, i;
while (scanf("%d%d%d", &N, &M, &K) != EOF) {
cmax = 0;
memset(first, 0, sizeof(first));
memset(color, 0, sizeof(color));
for (i = 1; i <= N; i++) {
scanf("%d", &num);
sign[i - 1] = num;
if (color[num] + K < i - 1 - first[num]) {
while (color[num] + K < i - 1 - first[num]) {
if (sign[first[num]] == num) color[num]--;
if (color[num] == 0) {
first[num] = i - 1;
continue;
}
first[num]++;
}
}
color[num]++;
if (color[num] > cmax) cmax = color[num];
}
printf("%d\n", cmax);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int row, col, k, p;
int arr[1005][1005];
scanf("%d%d%d%d", &row, &col, &k, &p);
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++) scanf("%d", &arr[i][j]);
vector<long long> r, c;
vector<long long> h;
r.clear();
c.clear();
h.clear();
for (int i = 0; i < row; i++) {
long long cur = 0;
for (int j = 0; j < col; j++) cur += arr[i][j];
h.push_back(cur);
}
make_heap(h.begin(), h.end());
for (int i = 1; i <= k; i++) {
long long mx = h.front();
r.push_back(mx);
pop_heap(h.begin(), h.end());
h.pop_back();
mx -= col * p;
h.push_back(mx);
push_heap(h.begin(), h.end());
}
h.clear();
for (int i = 0; i < col; i++) {
long long cur = 0;
for (int j = 0; j < row; j++) cur += arr[j][i];
h.push_back(cur);
}
make_heap(h.begin(), h.end());
for (int i = 1; i <= k; i++) {
long long mx = h.front();
c.push_back(mx);
pop_heap(h.begin(), h.end());
h.pop_back();
mx -= p * row;
h.push_back(mx);
push_heap(h.begin(), h.end());
}
for (int i = 1; i < k; i++) {
r[i] += r[i - 1];
c[i] += c[i - 1];
}
long long ans = max(r[k - 1], c[k - 1]);
for (int i = 1; i < k; i++) {
long long tmp = ((long long)i) * (k - i) * p;
ans = max(ans, r[i - 1] + c[k - i - 1] - tmp);
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isprime(int x) {
if (x == 1) return false;
for (int i = 2; i * i <= x; ++i)
if (!(x % i)) return false;
return true;
}
int col[6009];
int main() {
int n;
cin >> n, fill(col + 1, col + n + 1, 1);
int sum = n * (n + 1) >> 1;
if (!isprime(sum)) {
if (sum & 1) {
if (isprime(sum - 2)) {
col[2] = 2;
goto print;
}
sum -= 3, col[3] = 3;
}
for (int i = 3; i <= n; i += 2)
if (col[i] == 1 && isprime(i) && isprime(sum - i)) {
col[i] = 2;
break;
}
}
print:
for (int i = 1; i <= n; ++i) cout << col[i] << " \n"[i == n];
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct bit {
long long n;
vector<long long> arr;
bit(long long _n) : n(_n) { arr.assign(n + 5, 0); }
void add(long long x) {
while (x <= n) arr[x]++, x += x & -x;
}
long long get(long long x) {
long long re = 0;
while (x) re += arr[x], x -= x & -x;
return re;
}
};
unordered_map<long long, long long> ans[200005];
long long x[200005], y[200005], z[200005], t[200005];
vector<long long> pt[200005];
vector<long long> p[200005];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, q;
cin >> n >> q;
for (long long i = 1; i <= n; i++) {
long long x, y = i;
cin >> x;
pt[x].emplace_back(y);
}
for (long long i = 1; i <= q; i++) {
cin >> y[i] >> x[i] >> t[i] >> z[i];
x[i]--;
y[i]--;
p[x[i]].emplace_back(y[i]);
p[x[i]].emplace_back(t[i]);
p[x[i]].emplace_back(n);
p[z[i]].emplace_back(y[i]);
p[z[i]].emplace_back(t[i]);
p[z[i]].emplace_back(n);
p[n].emplace_back(y[i]);
p[n].emplace_back(t[i]);
p[n].emplace_back(n);
}
bit v = bit(n);
for (long long i = 1; i <= n; i++) {
for (auto id : pt[i]) v.add(id);
for (auto range : p[i]) ans[i][range] = v.get(range);
}
for (long long T = 1; T <= q; T++) {
vector<vector<long long> > p(4, vector<long long>(4));
vector<long long> idx = {0, x[T], z[T], n};
vector<long long> idy = {0, y[T], t[T], n};
for (long long i = 1; i <= 3; i++)
for (long long j = 1; j <= 3; j++) {
p[i][j] = ans[idx[i]][idy[j]];
}
for (long long i = 3; i >= 1; i--)
for (long long j = 3; j >= 1; j--)
p[i][j] = p[i][j] - p[i - 1][j] - p[i][j - 1] + p[i - 1][j - 1];
long long temp1 = p[1][1] + p[1][2] + p[1][3],
temp2 = p[1][1] + p[2][1] + p[3][1],
temp3 = p[3][1] + p[3][2] + p[3][3],
temp4 = p[1][3] + p[2][3] + p[3][3];
long long t1 = p[1][1], t2 = p[1][3], t3 = p[3][1], t4 = p[3][3];
long long re = temp1 * (temp1 - 1) / 2 + temp2 * (temp2 - 1) / 2 +
temp3 * (temp3 - 1) / 2 + temp4 * (temp4 - 1) / 2;
re -= t1 * (t1 - 1) / 2 + t2 * (t2 - 1) / 2 + t3 * (t3 - 1) / 2 +
t4 * (t4 - 1) / 2;
cout << n * (n - 1) / 2 - re << endl;
}
}
| 9 | CPP |
s=list(input())
cnt=0
now=''
buf=''
for i in range(len(s)):
now+=s[i]
if buf!=now:
buf=now
now=''
cnt+=1
print(cnt)
| 0 | PYTHON3 |
import math
m,n=map(int,input().split())
a=(m*n)/2
print(math.floor(a)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void FastIO() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(15);
}
long long modpow(long long a, long long p, long long mod) {
long long ret = 1;
while (p) {
if (p & 1) ret = (ret * a) % mod;
a = (a * a) % mod;
p /= 2;
}
return ret % mod;
}
long long power(long long a, long long p) {
long long ret = 1;
while (p) {
if (p & 1) ret = (ret * a);
a = (a * a);
p /= 2;
}
return ret;
}
vector<int> ans;
int main() {
FastIO();
int n;
cin >> n;
for (int i = 30; i >= 0; i--)
if (n & (1 << i)) cout << i + 1 << " ";
cout << '\n';
return 0;
}
| 7 | CPP |
for t in range(int(input())):
n, k = map(int, input().split())
v = 0
while n >= k:
n, v = n // k, v + n % k + 1
print(v + n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C& a4, C b4) {
a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
a4 = max(a4, b4);
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
out << "(" << pair.first << ", " << pair.second << ")";
return out;
}
int gcd(int x, int y) {
if (x == 0) return y;
return gcd(y % x, x);
}
int main() {
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int a, b, c, d;
cin >> a >> b >> c >> d;
int g = gcd(c, d);
c /= g;
d /= g;
int e = min(a / c, b / d);
cout << e * c << " " << e * d << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int h[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
h[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
for (int k = i, l = j + 1; l < m; l++) {
if (s[i][j] == s[k][l]) {
h[i][j] = 1;
h[k][l] = 1;
}
}
for (int k = i + 1, l = j; k < n; k++) {
if (s[i][j] == s[k][l]) {
h[i][j] = 1;
h[k][l] = 1;
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (h[i][j] != 1) cout << s[i][j];
}
}
}
| 8 | CPP |
col = int(input())
ans = 0
for i in range(0, col):
p = list(input()) # p V T
col = col - 1
if p[0] != '0' and p[2] != '0' and p[4] != '0':
if p[0] == p[2] == p[4]:
ans = ans + 1
else:
if p[0] == p[2] and p[0] != '0' and p[2] != '0':
ans = ans + 1
if p[2] == p[4] and p[2] != '0' and p[4] != '0':
ans = ans + 1
if p[0] == p[4] and p[0] != '0' and p[4] != '0':
ans = ans + 1
print(ans)
| 7 | PYTHON3 |
# bsdk idhar kya dekhne ko aaya hai, khud kr!!!
# import math
# from itertools import *
# import random
# import calendar
# import datetime
# import webbrowser
n, m = map(int, input().split())
matches = []
sticks = []
for i in range(m):
x, y = map(int, input().split())
matches.append(x)
sticks.append(y)
temp = sticks.copy()
temp.sort()
sorted_matches = []
for i in temp:
sorted_matches.append(matches[sticks.index(i)])
y = sticks.index(i)
sticks[y] = "X"
count = 0
sorted_matches.reverse()
temp.reverse()
for i in range(m):
if sorted_matches[i] <= n:
count += temp[i] * sorted_matches[i]
n -= sorted_matches[i]
else:
count += n * temp[i]
break
print(count)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,a,b;
cin >> x >> a >> b;
if(x == 1)cout <<"Hello World" << endl;
if(x == 2)cout << a+b << endl;
}
| 0 | CPP |
def main():
s, l = input(), input()
def number_of_stone_liss_standing_on(s, l):
current_stone = 1
for color in l:
if color == s[current_stone - 1]:
current_stone += 1
return current_stone
print(number_of_stone_liss_standing_on(s, l))
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double INF = 1e+9;
int x, y, z, x1, yy, z1, a[7];
int main() {
scanf("%d%d%d", &x, &y, &z);
scanf("%d%d%d", &x1, &yy, &z1);
for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
int ans = 0;
if (y < 0) ans += a[1];
if (y > yy) ans += a[2];
if (z < 0) ans += a[3];
if (z > z1) ans += a[4];
if (x < 0) ans += a[5];
if (x > x1) ans += a[6];
printf("%d\n", ans);
return 0;
}
| 10 | CPP |
n,m=map(int,input().split())
count1=0
count2=0
if m>n:
print("-1")
else:
while n>0:
if n%2==1:
n-=1
count1+=1
else:
n-=2
count2+=1
while (count1+count2)%m!=0:
count2-=1
count1+=2
print(count1+count2) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int c = 1000000000;
set<int> s;
int n, m, tot;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
s.insert(a);
}
int k = 0;
set<int>::iterator it;
tot = 0;
while ((it = s.find(++k)) != s.end())
;
while (k <= c && m >= k) {
tot++;
m -= k;
while ((it = s.find(++k)) != s.end())
;
}
printf("%d\n", tot);
for (int i = 1; i < k; i++) {
if ((it = s.find(i)) == s.end()) {
tot--;
printf("%d%c", i, tot ? ' ' : '\n');
}
}
return 0;
}
| 9 | CPP |
# -*- coding: utf-8 -*-
def rli():
return list(map(int, input().split()))
def main():
n = int(input())
ns = []
for i in range(n):
x, y = rli()
ns.append((x, y))
w = int(input())
for i in range(n):
x, y = ns[i]
if y >= w:
print(n - i)
return
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
def main():
s = input()
t = input()
n = len(s)
c = 0
for i in range(n):
c += s[i] != t[i]
if c % 2:
print('impossible')
return
ans = ''
x = 0
for i in range(n):
if s[i] == t[i]:
ans += s[i]
else:
if 2 * x < c:
ans += s[i]
else:
ans += t[i]
x += 1
print(ans)
if __name__ == '__main__':
main()
| 8 | PYTHON3 |
import sys
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,m = inpl()
s = [input() for _ in range(n)]
chk = [[False]*m for _ in range(n)]
res = []
se = set()
for size in range(1,50)[::-1]:
if size*2+1 > n or size*2+1 > m: continue
for cy in range(size,n-size):
for cx in range(size,m-size):
if (cy+1,cx+1) in se: continue
f = True
for dy in range(cy-size,cy+size+1):
if s[dy][cx] == '.': f = False
for dx in range(cx-size,cx+size+1):
if s[cy][dx] == '.': f = False
if f:
res.append([cy+1,cx+1,size])
se.add((cy+1,cx+1))
for dy in range(cy-size,cy+size+1):
chk[dy][cx] = True
for dx in range(cx-size,cx+size+1):
chk[cy][dx] = True
for y in range(n):
for x in range(m):
if s[y][x] == '*' and not chk[y][x]:
print(-1)
quit()
print(len(res))
for l in res:
print(*l) | 11 | PYTHON3 |
a,b = input().split(" ")
aa = []
bb = []
for i in range(len(a)):
aa.append(a[:i+1])
for i in range(len(b)):
bb.append(b[:i+1])
aa.sort()
bb.sort()
c = []
for x in aa:
for y in bb:
c.append(x+y)
c.sort()
print(c[0]) | 7 | PYTHON3 |
# n = eval(input())
line = input()
strings = line.split()
list = []
for string in strings:
list.append(eval(string))
result = sorted(list)
print((result[2] - result[1]) + (result[1] - result[0])) | 7 | PYTHON3 |
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,type[13][600005],pw[13],res[600005];
char t[200005];
bool flag;
void debug()
{
printf("flag=%d\n",flag);
for(int i=0;i<n;i++)
{
printf("%d:",i);
for(int j=0;j<pw[i];j++)printf("%d ",type[i][j]);
printf("\n");
}
}
int main()
{
scanf("%d",&n);
pw[0]=1;
for(int i=1;i<=n;i++)pw[i]=pw[i-1]*3;
for(int i=0;i<n;i++)
{
for(int j=0;j<pw[i];j++)
type[i][j]=0;
}
scanf("%s",t+1);
m=(int)strlen(t+1);
for(int i=1;i<=m;i++)
{
if(t[i]=='S')
{
flag^=1;
continue;
}
int now=0;
for(int b=0;b<n;b++)
{
if(flag==0)
{
int v=now+pw[b]*((type[b][now]+2)%3);
type[b][now]=(type[b][now]+2)%3;
now=v;
}
else
{
int v=now+pw[b]*((type[b][now]+1)%3);
type[b][now]=(type[b][now]+1)%3;
now=v;
}
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<pw[n];j++)
{
int b=(j/pw[i])%3-type[i][j%pw[i]]+3;
b%=3;
if(flag)b=(3-b)%3;
res[j]+=b*pw[i];
}
}
for(int i=0;i<pw[n];i++)printf("%d ",res[i]);
printf("\n");
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
auto SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937 rng(SEED);
const int mod = 1e9 + 7, x = 864197532, N = 300087, logN = 18, K = 500,
C = 1 << 20;
struct op {
int a, b, c;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, xorr = 0;
cin >> n;
vector<int> a(n);
for (int i = (0); i < (n); i++) cin >> a[i], xorr ^= a[i];
vector<op> ans;
if (n & 1) {
for (int i = 1; i < n; i += 2) {
ans.push_back({i - 1, i, i + 1});
int x = a[i - 1] ^ a[i] ^ a[i + 1];
a[i - 1] = a[i] = a[i + 1] = x;
}
for (int i = n - 2; i >= 0; i -= 2) {
ans.push_back({n - 1, i, i - 1});
int x = a[n - 1] ^ a[i] ^ a[i - 1];
a[n - 1] = a[i] = a[i - 1] = x;
}
} else {
if (xorr) return cout << "NO\n", 0;
for (int i = n - 4; i >= 2; i -= 2) {
ans.push_back({i, i + 1, i + 2});
int x = a[i] ^ a[i + 1] ^ a[i + 2];
a[i] = a[i + 1] = a[i + 2] = x;
ans.push_back({i + 3, i + 1, i + 2});
x = a[i + 3] ^ a[i + 1] ^ a[i + 2];
a[i + 3] = a[i + 1] = a[i + 2] = x;
}
ans.push_back({0, 1, 2});
int x = a[0] ^ a[1] ^ a[2];
a[0] = a[1] = a[2] = x;
}
cout << "YES\n";
cout << ans.size() << endl;
for (auto A : ans)
cout << A.a + 1 << ' ' << A.b + 1 << ' ' << A.c + 1 << endl;
}
| 10 | CPP |
test=int(input())
while test>0:
n=int(input())
l=list(map(int,input().split()))
l.sort()
c=1
for i in range(n-1):
if(abs(l[i]-l[i+1])>1):
c+=1;
if(c==1):
print("YES")
else:
print("NO")
test-=1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0;
int b = 0;
int c;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == 25) {
a++;
}
if (c == 50) {
if (a > 0) {
a--;
b++;
} else {
cout << "NO";
return 0;
}
}
if (c == 100) {
if (b > 0) {
if (a > 0) {
a--;
b--;
} else {
cout << "NO";
return 0;
}
} else {
if (a > 2) {
a -= 3;
} else {
cout << "NO";
return 0;
}
}
}
}
cout << "YES";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, i, j, k, A[500001], ans = 0;
int main() {
scanf("%d", &N);
for (int l = 0; l < N; l++) scanf("%d", &A[l]);
i = 1;
while (i < N - 1) {
j = k = i;
while (j < N - 1 && A[j] != A[j - 1] && A[j] != A[j + 1]) j++;
if (!((j - i) & 1))
while (k < i + (j - i) / 2) A[k++] = A[i - 1];
while (k < j) A[k++] = A[j];
ans = max(ans, (int)ceil((j - i) / 2.0));
i = j + 1;
}
printf("%d\n", ans);
for (int i = 0; i < N; i++) printf("%d ", A[i]);
printf("\n");
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int testCase;
cin >> testCase;
for (int id = 0; id < testCase; id++) {
int a, b, h, w;
cin >> a >> b;
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cin >> w >> h;
int ans;
int dx = min(max(0, w - x1), max(0, x2 - (a - w)));
int dy = min(max(0, h - y1), max(0, y2 - (b - h)));
if (x2 - x1 + w > a) {
if (y2 - y1 + h > b)
ans = -1;
else
ans = dy;
} else {
if (y2 - y1 + h > b)
ans = dx;
else
ans = min(dx, dy);
}
cout << ans << "\n";
}
return 0;
}
| 8 | CPP |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
template<class T, class E>
struct SegTree{
typedef function<T(T,T)> F;
typedef function<T(T,E)> G;
typedef function<E(E,E)> H;
typedef function<E(E,int)> P;
int n;
F f;
G g;
H h;
P p;
T d1;
E d0;
vector<T> dat;
vector<E> lazy;
SegTree(int n_, F f, G g, H h, T d1, E d0, P p=[](E a, int b){ return a; })
: f(f), g(g), h(h), d1(d1), d0(d0), p(p) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2 * n - 1, d1);
lazy.resize(2 * n - 1, d0);
}
void eval(int k, int l, int r) {
if (lazy[k] == d0) return;
dat[k] = g(dat[k], p(lazy[k], r - l));
if (k < n - 1) {
lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
lazy[2 * k + 2] = h(lazy[2 * k + 2], lazy[k]);
}
lazy[k] = d0;
}
void update(int a, int b, E x, int k = 0, int l = 0, int r = -1) {
if (r == -1) r = n;
eval(k, l, r);
if (b <= l || r <= a) return;
if (a <= l && r <= b) {
lazy[k] = h(lazy[k], x);
eval(k, l, r);
}
else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
dat[k] = f(dat[2 * k + 1], dat[2 * k + 2]);
}
}
// return op[a..b)
// k: node id, [l, r): node interval
E query(int a, int b, int k = 0, int l = 0, int r = -1) {
// cerr << "a = " << a << ", b = " << b << ", k = " << k << ", l = " << l << ", r = " << r << endl;
if (r == -1) r = n;
eval(k, l, r);
if (r <= a || b <= l) return d1;
if (a <= l && r <= b) return dat[k];
E vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
E vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return f(vl, vr);
}
void print() {
int j = 2;
for (int i = 0; i < 2 * n - 1; i++) {
cerr << "(" << dat[i] << ", " << lazy[i] << ")";
if (i == j - 2) { cerr << endl; j *= 2;}
else { cerr << " "; }
}
}
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n, q;
cin >> n >> q;
SegTree<int, int> seg(
n,
[](int a, int b){ return std::min(a, b); },
[](int a, int b){ return b; },
[](int a, int b){ return b; },
INT_MAX,
-1);
rep(i, q) {
int t;
cin >> t;
if (t == 0) {
int a, b, x;
cin >> a >> b >> x;
seg.update(a, b + 1, x);
}
else {
int a, b;
cin >> a >> b;
cout << seg.query(a, b + 1) << endl;
}
}
return 0;
}
| 0 | CPP |
n, t = [int(i) for i in input().split()]
x = list(input())
t0 = 0
while t0 < t:
i = 0
while i < n-1:
if x[i] == 'B' and x[i+1] == 'G':
x[i], x[i+1] = 'G', 'B'
i += 2
else:
i += 1
t0 += 1
print(''.join(x))
| 8 | PYTHON3 |
n = int(input())
S = list(map(int, input().split()))
SENTINEL = 10 ** 9 + 1
count = 0
def merge(S, left, mid, right):
L = S[left:mid] + [SENTINEL]
R = S[mid:right] + [SENTINEL]
i = j = 0
global count
for k in range(left, right):
count += 1
if (L[i] <= R[j]):
S[k] = L[i]
i += 1
else:
S[k] = R[j]
j += 1
def mergeSort(S, left, right):
if(left + 1 < right):
mid = (left + right) // 2
mergeSort(S, left, mid)
mergeSort(S, mid, right)
merge(S, left, mid, right)
mergeSort(S, 0, n)
print(*S)
print(count) | 0 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast")
using namespace std;
const int inf = 2e9 + 7;
const long long INF = INT64_MAX;
double eps = 1e-6;
const int mod = 998244353;
const int N = 3e5 + 10;
const double pi = acos(-1.0);
long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
long long a[N];
long long g[N], f[N];
int main() {
long long n;
cin >> n;
long long s = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
s += a[i];
}
g[0] = 1 - n;
long long D = s * (n - 1) % mod;
for (int i = 1; i <= s - 1; i++) {
long long C = i * (n - 1) % mod, B = s - i;
g[i] = g[i - 1] * C % mod * power(B, mod - 2) % mod;
g[i] = (g[i] - D * power(B, mod - 2) % mod + mod) % mod;
}
f[s] = 0;
for (int i = s - 1; i >= 0; i--) {
f[i] = (f[i + 1] - g[i] + mod) % mod;
}
long long res = 0;
for (int i = 1; i <= n; i++) {
res = (res + f[a[i]]) % mod;
}
res = (res - f[0] * (n - 1) % mod + mod) % mod;
res = (res * power(n, mod - 2)) % mod;
cout << res;
}
| 10 | CPP |
// C - Strange Bank
#include <bits/stdc++.h>
using namespace std;
int f(int yen, int coin, int cnt=0){
while(yen > 0){ cnt += yen % coin; yen /= coin; }
return cnt;
}
int main(){
int n; cin>>n;
int ans = n;
for(int yen6=0; yen6<=n; ++yen6)
ans = min(ans, f(n-yen6, 9, f(yen6, 6)));
cout<< ans <<endl;
}
| 0 | CPP |
n,d=map(int,input().split())
kol=int(input())
a=[]
for i in range(kol):
x,y=map(int,input().split())
if y<=x+d and y>=x-d and y>=-x+d and y<=-x+2*n-d:
a.append('YES')
else:
a.append('NO')
for i in a:
print(i)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans = 0;
int main() {
cin >> n >> m;
string arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int row = 0, col = 0, x = 0, y = 0;
for (int k = 0; k < n; k++) {
ans = 0;
for (int p = 0; p < m; p++) {
if (arr[k][p] == '*') {
ans++;
}
}
if (ans == 1) {
row = k;
for (int f = m - 1; f >= 0; f--) {
if (arr[k][f] == '*') {
y = f;
break;
}
}
} else if (ans == 2) {
x = k;
}
}
for (int j = m - 1; j >= 0; j--) {
if (arr[x][j] == '*' && j != y) {
col = j;
break;
}
}
cout << row + 1 << " " << col + 1 << "\n";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int sortindex[20][500010];
pair<pair<int, int>, int> sa[500010];
int lcp[500010];
int n;
char s[500010];
vector<int> pos_string[2 * 500010];
vector<int> pos_sa[2 * 500010];
int pre[500010];
void buildSA() {
int i, j;
for (i = 0; i < n; ++i) sortindex[0][i] = s[i] - '(';
for (i = 0; i < n; ++i) sa[i].second = i;
for (i = 1; (1 << (i - 1)) < n; ++i) {
for (j = 0; j < n; ++j) {
sa[j].first.first = sortindex[i - 1][sa[j].second];
if (sa[j].second + (1 << (i - 1)) < n)
sa[j].first.second = sortindex[i - 1][sa[j].second + (1 << (i - 1))];
else
sa[j].first.second = -1;
}
sort(sa, sa + n);
int cnt = 0;
sortindex[i][sa[0].second] = 0;
for (j = 1; j < n; ++j) {
if (sa[j].first == sa[j - 1].first)
sortindex[i][sa[j].second] = sortindex[i][sa[j - 1].second];
else
sortindex[i][sa[j].second] = ++cnt;
}
}
}
int findlcp(int x, int y) {
int i;
int ret = 0;
for (i = 0; (1 << (i - 1)) < n; ++i)
;
--i;
for (; i >= 0; --i) {
if (sortindex[i][x] == sortindex[i][y]) {
ret += (1 << i);
x += (1 << i);
y += (1 << i);
if (x >= n || y >= n) break;
}
}
return ret;
}
void buildlcp() {
int i;
for (i = 1; i < n; ++i) lcp[i] = findlcp(sa[i - 1].second, sa[i].second);
}
int bit[2][500010];
inline void update(int i, int val, bool f) {
while (i <= n) {
bit[f][i] += val;
i = i + (i & (-i));
}
}
inline int query(int i, bool f) {
int ret = 0;
while (i) {
ret += bit[f][i];
i = i - (i & (-i));
}
return ret;
}
inline int query(int i, int j, bool f) {
if (j < i) return 0;
++i;
++j;
return query(j, f) - query(i - 1, f);
}
int main() {
int i;
scanf("%d", &n);
scanf("%s", &s);
buildSA();
buildlcp();
lcp[0] = 0;
pre[0] = 0;
for (i = 1; i <= n; ++i) {
pre[i] = pre[i - 1];
if (s[i - 1] == '(')
pre[i]++;
else
pre[i]--;
pos_string[pre[i] + n].push_back(i - 1);
}
for (i = 0; i < n; ++i) pos_sa[pre[sa[i].second] + n].push_back(i);
memset(bit[0], 0, sizeof(bit[0]));
memset(bit[1], 0, sizeof(bit[1]));
long long ans = 0;
for (i = 0; i < 2 * n; ++i) {
for (auto j : pos_string[i]) update(j + 1, 1, 0);
for (auto j : pos_sa[i]) {
int lo = sa[j].second, hi = n - 1, mid;
while (lo < hi) {
mid = (lo + hi) / 2;
if (query(sa[j].second, mid, 1))
hi = mid;
else
lo = mid + 1;
}
if (query(sa[j].second, lo, 1)) --lo;
hi = min(lo, n - 1);
lo = sa[j].second + lcp[j];
ans = ans + query(lo, hi, 0);
}
for (auto j : pos_string[i]) {
update(j + 1, -1, 0);
update(j + 1, 1, 1);
}
}
printf("%lld\n", ans);
}
| 12 | CPP |
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
tod=[[] for i in range(k)]
for i in range(n):
tod[i%k].append(a[i])
from itertools import accumulate
for i in range(k):
tod[i]=list(accumulate(tod[i]))
ans=[]
now=0
for i in range(n):
now+=tod[i%k][i//k]
ans.append(now)
print(" ".join(map(str,ans))) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(int i, int j) { return (i > j); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, sum = 0, sum1 = 0;
cin >> n;
vector<int> bag(n);
for (int i = 0; i < n; i++) {
cin >> bag[i];
}
sort(bag.begin(), bag.end(), cmp);
for (int i = 0; i < n; i++) {
sum += bag[i];
}
int ctr = 0;
for (int i = 0; i < n; i++) {
ctr++;
sum1 += bag[i];
if (sum1 > sum / 2) {
break;
}
}
cout << ctr << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1;
while (y) {
if (y & 1) res = (res * x) % 1000000007;
y = y / 2, x = (x * x) % 1000000007;
}
return res % 1000000007;
}
vector<vector<long long int> > graph;
long long int visited[100001];
long long int indeg[100001];
long long int n;
bool func() {
queue<long long int> q;
long long int vis[100001] = {0};
long long int i;
for (i = 1; i <= n; i++)
if (indeg[i] == 0) q.push(i);
if (q.size() != 1) return false;
while (!q.empty()) {
long long int k = q.front();
vis[k] = 1;
q.pop();
for (auto v : graph[k]) {
indeg[v]--;
if (indeg[v] == 0) {
q.push(v);
}
}
if (q.size() > 1) return false;
}
for (i = 1; i <= n; i++)
if (!vis[i]) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int m;
cin >> n >> m;
long long int arr[m + 1][2];
long long int i;
for (i = 1; i <= m; i++) {
cin >> arr[i][0] >> arr[i][1];
}
long long int low = 1, high = m;
long long int ans = -1;
while (low <= high) {
long long int mid = (low + high) / 2;
graph.resize(n + 1);
for (i = 0; i <= n; i++) graph[i].clear(), indeg[i] = 0, visited[i] = 0;
long long int cnt = 0;
for (i = 1; i <= mid; i++) {
graph[arr[i][0]].push_back(arr[i][1]);
indeg[arr[i][1]]++;
if (visited[arr[i][0]] == 0) {
visited[arr[i][0]] = 1;
cnt++;
}
if (visited[arr[i][1]] == 0) {
visited[arr[i][1]] = 1;
cnt++;
}
}
if (cnt != n) {
low = mid + 1;
continue;
}
if (func()) {
ans = mid;
high = mid - 1;
} else
low = mid + 1;
}
cout << ans;
}
| 10 | CPP |
#include <bits/stdc++.h>
int t, n;
int a[100010];
long long ans;
inline void swap(int x, int y) {
ans += 1ll * (x - y) * (x - y);
std::swap(a[x], a[y]);
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
ans = 0;
for (int i = 1; i <= n; i++)
a[i] = i;
for (int i = 1; i <= n / 2; i++)
swap(i, n);
for (int i = n / 2 + 1; i <= n - 1; i++)
swap(1, i);
printf("%lld\n", ans);
for (int i = 1; i <= n; i++)
printf("%d ", a[i]);
puts("");
printf("%d\n", n - 1);
for (int i = n - 1; i >= n / 2 + 1; i--)
printf("%d %d\n", i, 1);
for (int i = n / 2; i >= 1; i--)
printf("%d %d\n", i, n);
}
return 0;
} | 11 | CPP |
a = [int(x) for x in input().split()]
b = set(a)
print(len(a) - len(b))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long int n;
char ans[1000][1000] = {0};
void solve(int k) {
if (k == 1) {
ans[0][0] = '+';
return;
}
k = k >> 1;
solve(k);
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
ans[i][j + k] = ans[i][j];
ans[i + k][j] = ans[i][j];
ans[i + k][j + k] = ans[i][j] == '+' ? '*' : '+';
}
}
return;
}
int main() {
cin >> n;
n = 1 << n;
solve(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << ans[i][j];
}
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
string f(string s) {
string t;
int n = s.size();
t.push_back(s[0]);
for (int i = 0; i < n; i++) {
if (s[i] == 'a' || s[i] == 'i' || s[i] == 'u' || s[i] == 'e' ||
s[i] == 'o') {
if (i + 1 < n)
t.push_back(s[i + 1]);
}
}
return t;
}
int main() {
int n;
while (true) {
cin >> n;
if (n == 0)
break;
vector<string> v(n), w(n);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
w[i] = f(v[i]);
for (int k = 1; k <= 50; k++) {
vector<string> s(n);
for (int i = 0; i < n; i++)
s[i] = w[i].substr(0, k);
sort(s.begin(), s.end());
bool ok = true;
for (int j = 1; j < n; j++)
if (s[j] == s[j - 1])
ok = false;
if (ok) {
cout << k << endl;
break;
} else if (k == 50) {
cout << -1 << endl;
break;
}
}
}
return 0;
}
| 0 | CPP |
def no_diff_bits (a,b):
maxi = max(a,b)
mini = min(a,b)
counter = 0
while maxi != 0 :
r1 = maxi % 2
maxi = maxi // 2
r2 = mini % 2
mini = mini // 2
if r1 != r2:
counter = counter + 1
#print(counter)
return counter
n , m , k = [int(x) for x in input().split()]
c = []
for i in range(m+1):
x = int(input())
c.append(x)
counter = 0
for i in range(m):
diff = no_diff_bits(c[i],c[m])
if diff <= k :
counter = counter +1
print(counter)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long DIM = 60 + 7;
const long long INF = 10E18 + 173;
const long long MOD = 10E8 + 7;
long long gi(char ch) {
if (ch == 'A')
return 1;
else
return 0;
}
long long A[DIM][DIM];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
for (long long query = 1; query <= t; query++) {
long long n, m;
cin >> n >> m;
long long sum = 0;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= m; j++) {
char ch;
cin >> ch;
A[i][j] = gi(ch);
sum += A[i][j];
}
}
if (sum == 0) {
cout << "MORTAL" << endl;
continue;
}
if (sum == n * m) {
cout << 0 << endl;
continue;
}
long long ff = 1, flag = 0;
for (long long i = 1; i <= n; i++) {
if (A[i][1] != 1) {
flag = 1;
break;
}
}
ff = min(ff, flag);
flag = 0;
for (long long i = 1; i <= n; i++) {
if (A[i][m] != 1) {
flag = 1;
break;
}
}
ff = min(ff, flag);
flag = 0;
for (long long j = 1; j <= m; j++) {
if (A[1][j] != 1) {
flag = 1;
break;
}
}
ff = min(ff, flag);
flag = 0;
for (long long j = 1; j <= m; j++) {
if (A[n][j] != 1) {
flag = 1;
break;
}
}
ff = min(ff, flag);
if (ff == 0) {
cout << 1 << endl;
continue;
}
long long rf = 1;
for (long long i = 1; i <= n; i++) {
long long flag = 0;
for (long long j = 1; j <= m; j++) {
if (A[i][j] == 0) {
flag = 1;
break;
}
}
rf = min(rf, flag);
}
for (long long j = 1; j <= m; j++) {
long long flag = 0;
for (long long i = 1; i <= n; i++) {
if (A[i][j] == 0) {
flag = 1;
break;
}
}
rf = min(rf, flag);
}
if (rf == 0 || A[1][1] == 1 || A[1][m] == 1 || A[n][1] == 1 ||
A[n][m] == 1) {
cout << 2 << endl;
continue;
}
flag = 0;
for (long long i = 1; i <= n; i++) {
if (A[i][1] == 1) flag = 1;
if (A[i][m] == 1) flag = 1;
}
for (long long j = 1; j <= m; j++) {
if (A[1][j] == 1) flag = 1;
if (A[n][j] == 1) flag = 1;
}
if (flag == 1) {
cout << 3 << endl;
continue;
}
cout << 4 << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int thomas = 0;
for (int j = 1; j <= 4; j++) {
int t;
cin >> t;
thomas += t;
}
int rank = 1;
for (int i = 2; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= 4; j++) {
int t;
cin >> t;
sum += t;
}
if (thomas < sum) {
rank += 1;
}
}
cout << rank << endl;
return 0;
}
| 7 | CPP |
X = int(input())
if X < 6 or X % 2 != 0:
print(0)
exit()
print(X // 4 if X / 4 != X // 4 else X // 4 - 1)
| 7 | PYTHON3 |
import sys;Z=sys.stdin.readline
from collections import defaultdict as D
O=[]
for _ in range(int(Z())):
n=int(Z());a=[*map(int,Z().split())];d=D(int);s=0
for i in range(n):s+=(n-i)*d[a[i]];d[a[i]]+=i+1
O.append(f'{s}')
print('\n'.join(O)) | 9 | PYTHON3 |
n = int(input())
if n < 6:
print(-1)
else:
print('1 2\n2 3\n2 4\n4 5\n4 6')
for i in range(0, (n - 6) // 2 * 2, 2):
print(1, i + 7)
print(i + 7, i + 8)
if n % 2 == 1:
print(2, n)
#print()
for i in range(n - 1):
print(i + 1, i + 2) | 9 | PYTHON3 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,ll> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 100005;
#define getchar getchar_unlocked
#define putchar putchar_unlocked
inline ll in() {
ll n = 0; short c;
while ((c = getchar()) >= '0') n = n * 10 + c - '0';
return n;
}
inline void out(ll n) {
short res[20], i = 0;
do { res[i++] = n % 10, n /= 10; } while (n);
while (i) putchar(res[--i] + '0');
putchar('\n');
}
ll h[MAX_N];
int main()
{
int n = in(), q = in();
set<int> st = {0};
rep(i,q){
int a = in();
ll b = in();
auto it = st.lower_bound(a);
bool flag = (it == st.end() || *it != a);
auto it2 = --it;
ll flag2 = h[*it2];
if(it2 == st.begin()){
int p = *it2;
ll x = b / a, y = b % a;
if(y == 0){
h[p] += x;
}else{
st.insert(p+y), h[p+y] = h[p]+x;
h[p] += x+1;
}
}else{
do {
int p = *it2, q = *(--it2);
++it2;
ll cri = (a-p)*(h[q]-h[p]);
if(b >= cri){
b -= cri;
st.erase(it2);
}else{
ll x = b / (a-p), y = b % (a-p);
if(y == 0){
h[p] += x;
}else{
st.insert(p+y), h[p+y] = h[p] + x;
if(h[q] != h[p]+x+1){
h[p] += x+1;
}else{
st.erase(it2);
}
}
b = 0;
}
it = st.lower_bound(a);
it2 = --it;
}while(it2 != st.begin() && b > 0);
if(b > 0){
int p = *it2;
ll x = b / a, y = b % a;
if(y == 0){
h[p] += x;
}else{
st.insert(p+y), h[p+y] = h[p]+x;
h[p] += x+1;
}
}
}
if(flag) st.insert(a), h[a] = flag2;
}
int s = 0;
ll prv = -1;
each(p,st){
if(p > 0){
srep(i,s,p) out(prv);
}
s = p, prv = h[p];
}
srep(i,s,n) out(prv);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
const int N = 1000 * 1000;
int n;
int m;
vector<pair<int, pair<int, int> > > q[N + 1];
pair<int, int> v[N + 1];
int o;
unordered_map<int, int> num;
int f[N + 1];
int res[N + 1];
int getx(int x) {
if (num.count(x)) return num[x];
num[x] = o++;
return o - 1;
}
int getf(int x) {
int y = 0;
while (x > 0) {
y += f[x];
x = (x & (x + 1)) - 1;
}
return y;
}
void add(int x, int y, int n) {
while (x <= n) {
f[x] += y;
x |= x + 1;
}
}
string get(int x) {
string s = "";
if (x == 0) s = "0";
while (x) {
s = s + char(x % 10 + '0');
x /= 10;
}
reverse((s).begin(), (s).end());
return s;
}
char h[100];
char *ch;
int read() {
int x = 0;
while (!(*ch >= '0' && *ch <= '9')) ch++;
while (*ch >= '0' && *ch <= '9') {
x = x * 10 + (*ch) - '0';
ch++;
}
return x;
}
int main() {
scanf("%d", &n);
gets(h);
for (int i = 0; i < n; i++) {
int a, t, x;
gets(h);
ch = h;
a = read();
t = read();
x = read();
x = getx(x);
q[x].push_back(make_pair(i, make_pair(a, t)));
res[i] = -1e9;
}
for (int i = 0; i < o; i++) {
int len = ((int)(q[i]).size());
for (int j = 0; j < len; j++) v[j] = make_pair(q[i][j].second.second, j);
sort(v, v + len);
for (int j = 0; j < len; j++) q[i][v[j].second].second.second = j + 1;
for (int j = 1; j <= len; j++) f[j] = 0;
for (int j = 0; j < len; j++)
if (q[i][j].second.first == 1)
add(q[i][j].second.second, 1, len);
else if (q[i][j].second.first == 2)
add(q[i][j].second.second, -1, len);
else
res[q[i][j].first] = getf(q[i][j].second.second);
}
string ans = "";
bool f = true;
for (int i = 0; i < n; i++)
if (res[i] >= -1e8) {
if (!f) ans += "\n";
f = false;
ans += get(abs(res[i]));
}
puts(ans.c_str());
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, x, y;
cin >> n >> m >> k;
for (int i = 0; i < k; ++i) {
cin >> x >> y;
if (x <= 5 || y <= 5 || n - x + 1 <= 5 || m - y + 1 <= 5) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
| 9 | CPP |
#include <stdio.h>
#include <algorithm>
int a[200005];
int b[200005];
int main(){
int n,v,mid;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&v);
a[i]=v;
b[i]=v;
}
std::sort(b,b+n);
mid = b[n/2-1];
for(int i=0;i<n;i++){
if(a[i]>mid){
printf("%d\n",mid);
}else{
printf("%d\n",b[n/2]);
}
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
class Solution {
private:
long long beach_len, wave_cycle_len, survival_depth;
vector<long long> beach_dep;
vector<vector<pair<long long, long long> > > survival_ranges;
void generateSurvivalRanges() {
int ind = 0;
for (long long dep : beach_dep) {
survival_ranges.push_back(vector<pair<long long, long long> >());
if (dep + wave_cycle_len <= survival_depth) {
survival_ranges[ind].push_back({0, 2 * wave_cycle_len - 1});
} else {
int temp = survival_depth - dep;
if (temp > 0)
survival_ranges[ind].push_back(
{2 * wave_cycle_len - temp, 2 * wave_cycle_len - 1});
survival_ranges[ind].push_back({0, temp});
}
ind++;
}
}
bool isAllValid() {
for (long long dep : beach_dep) {
if (dep > survival_depth) return false;
}
return true;
}
public:
void read() {
scanf("%lld %lld %lld", &beach_len, &wave_cycle_len, &survival_depth);
for (int i = 0, inp; i < beach_len; i++) {
scanf("%d", &inp);
beach_dep.push_back(inp);
}
}
void solve() {
if (!isAllValid()) {
puts("No");
return;
}
generateSurvivalRanges();
long long cur_time = survival_ranges[0][0].first;
for (int i = 1; i < beach_len; i++) {
if (survival_ranges[i].size() == 1 &&
survival_ranges[i][0].second == 2 * wave_cycle_len - 1)
cur_time = survival_ranges[i][0].first;
else if (survival_ranges[i - 1].size() == 1 &&
survival_ranges[i - 1][0].second == 2 * wave_cycle_len - 1)
cur_time = survival_ranges[i][0].first;
else if (survival_ranges[i - 1].size() == 1 &&
survival_ranges[i].size() == 1) {
puts("No");
return;
} else if (survival_ranges[i - 1].size() == 1) {
if (survival_ranges[i][1].second >= 1)
cur_time++;
else {
puts("No");
return;
}
} else if (survival_ranges[i].size() == 1) {
cur_time = (cur_time + 1) % (2 * wave_cycle_len);
if (cur_time != 0 && cur_time <= wave_cycle_len) {
puts("No");
return;
}
cur_time = 0;
} else {
pair<int, int> pre_range, cur_range, common;
pre_range.first = cur_time <= survival_ranges[i - 1][1].second
? 2 * wave_cycle_len + cur_time + 1
: cur_time + 1;
pre_range.second =
2 * wave_cycle_len + survival_ranges[i - 1][1].second + 1;
cur_range.first = survival_ranges[i][0].first;
cur_range.second = 2 * wave_cycle_len + survival_ranges[i][1].second;
common.first = max(pre_range.first, cur_range.first);
common.second = min(pre_range.second, cur_range.second);
if (common.second - common.first >= 0)
cur_time = common.first % (2 * wave_cycle_len);
else {
puts("No");
return;
}
}
}
puts("Yes");
}
};
int main() {
int tcase;
scanf("%d", &tcase);
while (tcase--) {
Solution *obj = new Solution();
obj->read();
obj->solve();
delete obj;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
char ch;
while (blank(ch = nc()))
;
if (IOerror) return;
for (x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0')
;
}
inline void readll(long long int &x) {
char ch;
while (blank(ch = nc()))
;
if (IOerror) return;
for (x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0')
;
}
inline void reads(char *s) {
char ch;
while (blank(ch = nc()))
;
if (IOerror) return;
s[0] = ch;
for (int i = 1; (!blank(ch = nc())); ++i) {
s[i] = ch;
}
}
}; // namespace fastIO
const double esp = 1e-7;
const double pi = acos(-1.0);
const int maxx = 1101000;
const int mod = int(1e9 + 7);
long long a[100010];
int main() {
long long n, x, y;
while (~scanf("%lld", &n)) {
scanf("%lld", &x);
scanf("%lld", &y);
for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);
for (int i = 0; i < n; ++i) {
bool o, t;
o = t = true;
int pin = i - 1;
for (int j = 0; j < x; ++j) {
if (pin < 0) break;
if (a[pin] < a[i]) {
o = false;
break;
}
pin--;
}
pin = i + 1;
for (int j = 0; j < y; ++j) {
if (pin >= n) break;
if (a[pin] < a[i]) {
t = false;
break;
}
pin++;
}
if (o && t) {
printf("%d\n", i + 1);
break;
}
}
}
return 0;
}
| 7 | CPP |
a = int(input())
b = int(input())
s = max(a,b) - min(a,b)
print(sum([i+1 for i in range(s//2)])*2+((s//2+s%2) if s%2==1 else 0))
| 7 | PYTHON3 |
def kmp(s):
lps = [0] * (len(s))
for i in range (1 , len(s)):
p_i = lps[i - 1]
while (p_i > 0 and
s[i] != s[p_i]):
p_i = lps[p_i - 1]
lps[i] = p_i
if (s[i] == s[p_i]):
lps[i] += 1
return lps[- 1]
def rest(s):
t = s + "#"
s = s[: : -1]
t += s
return kmp(t)
def next(s):
length = 0
n = len(s)
i = 0
j = n - 1
while i < j:
if (s[i] != s[j]):
break
i += 1
j -= 1
length += 1
ans = s[0 : length]
remaining = s[length : length + (n - (2 * length))]
if (len(remaining)):
longest_prefix = rest(remaining);
remaining = remaining[: : -1]
l_s = rest(remaining);
if (longest_prefix > l_s):
remaining = remaining[: : -1]
ans += remaining[0 : longest_prefix]
else:
ans += remaining[0 : l_s]
ans += s[n - length : n]
return ans
for _ in range(int(input())):
st = input()
print(next(st))
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long length = log10(N);
long long sum = 9 * length;
N -= pow(10, length) - 1;
for(int i = 0; i < length; i++)
N /= 10;
sum += N;
cout << sum << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
const long long maxn = 5e5 + 54;
const long long mod = 2520;
const long long base = 1e18;
long long p[maxn];
long long l[maxn];
long long nxt[maxn];
long long st[4 * maxn];
long long anc[maxn][20];
long long cst[maxn][20];
void update(long long id, long long left, long long right, long long x,
long long diff) {
if (x > right || x < left) return;
if (left == right) {
st[id] = diff;
return;
}
long long mid = (left + right) / 2;
update(id * 2, left, mid, x, diff);
update(id * 2 + 1, mid + 1, right, x, diff);
st[id] = max(st[id * 2], st[id * 2 + 1]);
}
long long get(long long id, long long left, long long right, long long x,
long long y) {
if (x > right || y < left) return 0;
if (x <= left && y >= right) return st[id];
long long mid = (left + right) / 2;
return max(get(id * 2, left, mid, x, y),
get(id * 2 + 1, mid + 1, right, x, y));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("t.inp", "r")) {
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
long long n;
cin >> n;
vector<long long> vt;
for (int i = 1; i <= n; i++) {
cin >> p[i] >> l[i];
vt.push_back(p[i]);
}
for (int i = n; i >= 1; i--) {
nxt[i] = i;
long long h = p[i] + l[i];
h = upper_bound(vt.begin(), vt.end(), h) - vt.begin();
nxt[i] = max(nxt[i], get(1, 1, n, i, h));
update(1, 1, n, i, nxt[i]);
}
for (int i = 1; i <= n; i++) {
update(1, 1, n, i, p[i] + l[i]);
}
for (int i = 1; i <= n; i++) {
if (nxt[i] != n) {
anc[i][0] = nxt[i] + 1;
cst[i][0] = p[nxt[i] + 1] - (get(1, 1, n, i, nxt[i]));
}
}
for (int i = n; i >= 1; i--) {
for (int j = 1; j < 20; j++) {
if (anc[i][j - 1] == 0) break;
anc[i][j] = anc[anc[i][j - 1]][j - 1];
cst[i][j] = cst[i][j - 1] + cst[anc[i][j - 1]][j - 1];
}
}
long long q;
cin >> q;
while (q--) {
long long x, y;
cin >> x >> y;
if (nxt[x] >= y) {
cout << 0 << "\n";
continue;
}
long long l = 0, h = n;
while (l <= h) {
long long mid = (l + h) / 2;
long long nw = x;
for (int j = 19; j >= 0; j--) {
if (mid & (1ll << j)) {
nw = anc[nw][j];
}
}
if (nw == 0 || nxt[nw] >= y)
h = mid - 1;
else
l = mid + 1;
}
long long nw = x;
long long ans = 0;
for (int j = 19; j >= 0; j--) {
if (l & (1ll << j)) {
ans += cst[nw][j];
nw = anc[nw][j];
}
}
cout << ans << "\n";
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 2;
int n, m, k, p;
long long a[N], h[N];
struct TState {
int day;
long long cur_h, end_h, a;
};
inline bool operator<(TState lhs, TState rhs) { return lhs.day < rhs.day; }
bool Check(long long max_h) {
priority_queue<TState> pq;
for (int i = 0; i < n; ++i)
if (max_h / a[i] < m)
pq.push({m - int(max_h / a[i]), max_h % a[i], h[i], a[i]});
else if (max_h - a[i] * m < h[i])
pq.push({0, max_h - a[i] * m, h[i], a[i]});
for (int i = m; i >= 1; --i)
for (int j = k; j > 0 && !pq.empty(); --j) {
TState top = pq.top();
pq.pop();
if (top.day >= i) return false;
top.cur_h += p;
if (top.day > 0) {
long long days = min(top.cur_h / top.a, (long long)top.day);
top.day -= days;
top.cur_h -= days * top.a;
if (top.day > 0 || (top.day == 0 && top.cur_h < top.end_h))
pq.push(top);
} else if (top.cur_h < top.end_h)
pq.push(top);
}
return pq.empty();
}
int main() {
cin >> n >> m >> k >> p;
for (int i = 0; i < n; ++i) cin >> h[i] >> a[i];
long long lo = *max_element(a, a + n), hi = 1e13, res = -1;
while (lo <= hi) {
long long mid = (lo + hi) / 2;
if (Check(mid))
res = mid, hi = mid - 1;
else
lo = mid + 1;
}
cout << res;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int Log = 18;
int n, h[N], p[Log][N];
vector<int> g[N], ans;
void pre() {
for (int i = 1; i < Log; i++)
for (int j = 0; j < n; j++)
if (p[i - 1][j] != -1) p[i][j] = p[i - 1][p[i - 1][j]];
}
void dfs(int v, int dep) {
for (auto x : g[v]) {
h[x] = h[v] + 1;
p[0][x] = v;
dfs(x, dep + 1);
}
}
int lca(int u, int v) {
if (h[u] > h[v]) swap(u, v);
for (int i = Log - 1; i > -1; i--)
if (p[i][v] != -1 && h[p[i][v]] >= h[u]) v = p[i][v];
if (u == v) return v;
for (int i = Log - 1; i > -1; i--)
if (p[i][u] != -1 && p[i][u] != p[i][v]) u = p[i][u], v = p[i][v];
return p[0][v];
}
pair<long long, long long> a[N];
long long ri[N];
vector<long long> f, s;
void ok() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%I64d %I64d", &a[i].first, &a[i].second);
f.push_back(n - 1);
s.push_back(n - 1);
ri[n - 1] = -1;
for (int i = n - 2; i > -1; i--) {
long long ss = f.size();
while (f.size() > 1 && (a[i].second - a[f[ss - 2]].second) *
(-a[f[ss - 1]].first + a[f[ss - 2]].first) >
(a[f[ss - 1]].second - a[f[ss - 2]].second) *
(-a[i].first + a[f[ss - 2]].first))
f.pop_back(), ss--;
ss = s.size();
while (ss > 1 && (a[i].second - a[s[ss - 2]].second) *
(-a[s[ss - 1]].first + a[s[ss - 2]].first) >
(a[s[ss - 1]].second - a[s[ss - 2]].second) *
(-a[i].first + a[s[ss - 2]].first))
s.pop_back(), ss--;
ri[i] = max(s.back(), f.back());
f.push_back(i);
s.push_back(i);
}
for (int i = 0; i < n - 1; i++) g[ri[i]].push_back(i);
}
int main() {
memset(p, -1, sizeof(p));
ok();
dfs(n - 1, 0);
pre();
int q;
scanf("%d", &q);
while (q--) {
int a, b;
scanf("%d %d", &a, &b);
ans.push_back(lca(--a, --b) + 1);
}
for (auto x : ans) printf("%d ", x);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 155;
int m1[maxn][maxn];
void init() {
memset(m1, 0, sizeof(m1));
m1[1][1] = 1;
m1[2][1] = 0;
m1[2][2] = 1;
for (int i = 3; i <= 151; i++) {
int res = 1;
for (int j = 1; j <= i; j++) {
if (abs(m1[i - 2][j]) && m1[i - 1][j - 1] == 0) {
m1[i][j] = m1[i - 2][j];
continue;
}
if (m1[i - 2][j] == 0 && m1[i - 1][j - 1] != 0) {
m1[i][j] = res * m1[i - 1][j - 1];
continue;
}
if (m1[i - 2][j] == m1[i - 1][j - 1]) {
res = -1;
}
}
}
}
int main() {
int n;
init();
while (cin >> n) {
cout << n << endl;
int rr = 1;
if (m1[n + 1][n + 1] < 0) rr = -1;
for (int i = 1; i < n + 1; i++) cout << m1[n + 1][i] * rr << " ";
cout << m1[n + 1][n + 1] * rr << endl;
rr = 1;
if (m1[n][n] < 0) rr = -1;
cout << n - 1 << endl;
for (int i = 1; i < n; i++) cout << m1[n][i] * rr << " ";
cout << m1[n][n] * rr << endl;
}
}
| 10 | CPP |
n = int(input())
strs = []
def isL(s,fisrt):
ss = list(s)
newss = []
for i in range(len(ss)):
newss.append(ss[len(ss)-i-1])
if str(ss) == str(newss) and fisrt == True:
l = sorted(ss)
return isL(''.join(l),False)
if str(ss) == str(newss) and fisrt == False:
return -1
else:
return s
result = []
for i in range(n):
result.append(isL(input(),True))
for i in range(n):
print(result[i]) | 8 | PYTHON3 |
n=int(input())
count=0
for i in range(1,n+1,1) :
for j in range(i,n+1,1) :
k=i^j
if k>n :
continue
else :
if k<i or k<j :
continue
else :
if i+j>k and i+k>j and j+k>i :
count+=1
## for k in range(j,n+1,1) :
## if i^j^k==0 :
## if i+j>k and i+k>j and j+k>i :
#### print(i,j,k)
## count+=1
print(count)
| 8 | PYTHON3 |
import math
n = int(input())
a = math.factorial(n)
b = math.factorial(n/2)
c = math.factorial((n/2)-1)
ans = (a*c*c)/(b*b)
ans= ans/2
print(int(ans)) | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
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 =
std::chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const long long INF = 9223372036854775807;
const long long N = 500005;
const long long mod = 1e9 + 7;
const long long M = 22;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string s;
cin >> s;
long long ok = 0;
long long f = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '0') {
ok = i;
f = 1;
break;
}
}
if (!f) {
long long l2 = 0, r2 = (n / 2) - 1;
long long l1 = 0, r1 = 2 * (n / 2) - 1;
l1++, l2++, r1++, r2++;
cout << l1 << " " << r1 << " " << l2 << " " << r2 << '\n';
continue;
}
long long k = (n / 2);
if (n % 2) k++;
if (ok < k) {
long long l2 = ok + 1, r2 = n - 1;
long long l1 = ok, r1 = n - 1;
l1++, l2++, r1++, r2++;
cout << l1 << " " << r1 << " " << l2 << " " << r2 << '\n';
} else {
long long l2 = 0, r2 = ok - 1;
long long l1 = 0, r1 = ok;
l1++, l2++, r1++, r2++;
cout << l1 << " " << r1 << " " << l2 << " " << r2 << '\n';
}
}
}
| 9 | CPP |
#include<cstdio>
int main(){
int n,m,x,y,i,t;
scanf("%d%d%d%d",&n,&m,&x,&y);
for(i=0;i<n;i++){
scanf("%d",&t);
if(t>x)x=t;
}
for(i=0;i<m;i++){
scanf("%d",&t);
if(t<y)y=t;
}
puts(y>x?"No War":"War");
return 0;
} | 0 | CPP |
inp = input()
n, k = inp.split(" ")
n = int(n)
k = int(k)
numbers = (input()).split(" ")
for i in range(len(numbers)):
numbers[i] = int(numbers[i])
numbers.sort()
if n == 1:
if k == 0:
if numbers[0] > 1:
print(1)
else:
print(-1)
else:
print(numbers[0])
elif k == n:
print(numbers[k - 1])
elif k == 0 and numbers[0] > 1:
print(1)
elif k == 0 or numbers[k - 1] == numbers[k]:
print(-1)
else:
print(numbers[k - 1])
| 9 | PYTHON3 |
INF = 10**18
N,M = map(int,input().split())
edge = [list(map(int,input().split())) for _ in range(M)]
graph = [[INF for j in range(N)] for i in range(N)]
for i in range(N):
graph[i][i] = 0
for e in edge:
graph[e[0]-1][e[1]-1] = e[2]
graph[e[1]-1][e[0]-1] = e[2]
for k in range(N):
for i in range(N):
for j in range(N):
if graph[i][k] != INF and graph[k][j] != INF:
graph[i][j] = min(graph[i][j],graph[i][k]+graph[k][j])
ans = 0
for e in edge:
if graph[e[0]-1][e[1]-1] != e[2]:
ans += 1
print(ans) | 0 | PYTHON3 |
import math
num=int(input())
n,k=[0]*num,[0]*num
for i in range(num):
n[i],k[i]=list(map(int,input().split()))
for i in range(num):
if (n[i]-k[i])%2==0 and k[i]<=math.sqrt(n[i]):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
input();s=input();print(abs(len(s)-2*s.count('0'))) | 7 | PYTHON3 |
import sys,math,itertools
from collections import Counter,deque,defaultdict
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify, nlargest
from copy import deepcopy
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))
def inps(): return sys.stdin.readline()
def inpsl(x): tmp = sys.stdin.readline(); return list(tmp[:x])
def err(x): print(x); exit()
n,r = inpl()
d = 180/n
d = math.sin(d*math.pi/180)
print(r*d/(1-d)) | 9 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
if(a>b)return 0*printf("0");
if(n==1)return 0*printf("%d",a==b?1:0);
cout<<(n-2)*(b-a)+1;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[100005];
long long neg = 0, pos = 0, zero = 0;
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ch1 = a[0] * a[1] * a[2] * a[3] * a[n - 1];
long long ch2 = a[0] * a[1] * a[n - 3] * a[n - 2] * a[n - 1];
long long ch3 = a[n - 5] * a[n - 4] * a[n - 3] * a[n - 2] * a[n - 1];
cout << max(ch1, max(ch2, ch3)) << endl;
}
return 0;
}
| 8 | CPP |
ans = 'ABC' if int(input()) < 1200 else 'ARC'
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
int ans = 0;
int cnt1, cnt2;
cnt1 = cnt2 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x % 3 == 0) ans++;
if (x % 3 == 1) cnt1++;
if (x % 3 == 2) cnt2++;
}
int m = min(cnt1, cnt2);
ans += m;
cnt1 -= m;
cnt2 -= m;
if (cnt2 == 0)
ans += cnt1 / 3;
else
ans += cnt2 / 3;
cout << ans << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, mod = 1e9 + 7, i, j, k, p, cnt[105], x, y;
struct juzhen {
long long a[105][105];
} a;
juzhen mul(juzhen x, juzhen y) {
juzhen ans;
memset(ans.a, 0, sizeof(ans.a));
int i, j, k;
for (i = 0; i < p; i++) {
for (j = 0; j < p; j++) {
for (k = 0; k < p; k++) {
(ans.a[i][j] += x.a[i][k] * y.a[k][j]) %= mod;
}
}
}
return ans;
}
juzhen qpower(juzhen x, int y) {
juzhen z;
memset(z.a, 0, sizeof(z.a));
int i;
for (i = 0; i < p; i++) z.a[i][i] = 1;
while (y) {
if (y & 1) z = mul(z, x);
y /= 2;
x = mul(x, x);
}
return z;
}
int main() {
cin >> n >> m >> k >> p;
for (i = 1; i <= n; i++) {
scanf("%d", &x);
cnt[x]++;
}
memset(a.a, 0, sizeof(a.a));
for (i = 0; i < p; i++) {
for (j = 0; j < 10; j++) {
a.a[i][(i * 10 + j) % p] += cnt[j];
}
}
a = qpower(a, m);
cout << a.a[0][k] % mod << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, k;
int zle;
bool bylo = false;
vector<int> p;
bool Pier(int x) {
for (int i = 2; i * i <= x; ++i)
if (x % i == 0) return false;
return true;
}
void Gen(long long ilo, long long znak, int nr, int ogr) {
zle += znak * (ogr / ilo);
for (int i = nr + 1; i < p.size(); ++i)
if (ilo * p[i] <= ogr) Gen(ilo * p[i], -znak, i, ogr);
}
int Ile(int kon) {
if (kon == 0) return 0;
if (k * k > kon) {
if (k <= kon) return 1;
return 0;
}
if (!bylo) {
vector<bool> P(k, true);
P[0] = P[1] = false;
for (int i = 2; i < k; ++i)
if (P[i])
for (int j = 2 * i; j < k; j += i) P[j] = false;
for (int i = 0; i < k; ++i)
if (P[i]) p.push_back(i);
bylo = true;
}
zle = 0;
for (int i = 0; i < p.size(); ++i)
if (p[i] * k <= kon) Gen(p[i] * k, 1, i, kon);
int wsz = kon / k;
return wsz - zle;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> a >> b >> k;
if (!Pier(k)) {
cout << "0";
return 0;
}
cout << Ile(b) - Ile(a - 1);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int INF = 0x3f3f3f3f;
char s1[200005], s2[200005];
int main() {
int n, k;
int num1 = 0;
scanf("%d%d", &n, &k);
scanf("%s", s1);
for (int i = 0; i < n; i++) {
char a = s1[i];
if (a == '(') {
if (k > num1) {
printf("(");
k--;
num1++;
} else {
for (int j = 1; j <= num1; j++) {
printf(")");
}
return 0;
}
} else if (a = ')') {
printf(")");
k--;
num1--;
if (k == 0) return 0;
}
}
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int i,a;cin>>a;
printf("Christmas");
for(i=0;i<25-a;i++){
printf(" Eve");
}
printf("\n");
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = 0;
while (1) {
sort(a.begin(), a.end(), greater<ll>());
if (a[0] < N) break;
ll q = a[0] / N;
for (int i = 0; i < N; i++) {
a[i] += (i == 0) ? -q * N : q;
}
ans += q;
}
cout << ans << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)2e9;
const long long md = 1000000007;
long long dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
long long power(long long a, long long p) {
long long ans = 1;
while (p) {
if (p & 1) ans *= a;
p /= 2;
a *= a;
ans %= md;
a %= md;
}
return ans;
}
long long mdinv(long long a) { return power(a, md - 2); }
struct RSQ {
long long n;
vector<long long> st;
RSQ(long long l) {
n = l;
st.assign(4 * n, 0);
}
void inc(long long first, long long val) { inc(1, 0, n - 1, first, val); }
void inc(long long i, long long l, long long r, long long first,
long long val) {
if (first < l || r < first) return;
if (l == r) {
st[i] += val;
return;
}
long long m = (l + r) / 2;
inc(i * 2, l, m, first, val);
inc(i * 2 + 1, m + 1, r, first, val);
st[i] = st[i * 2] + st[i * 2 + 1];
}
long long sum(long long first, long long second) {
return sum(1, 0, n - 1, first, second);
}
long long sum(long long i, long long l, long long r, long long first,
long long second) {
if (second < l || r < first) return 0;
if (first <= l && r <= second) return st[i];
long long m = (l + r) / 2;
return sum(i * 2, l, m, first, second) +
sum(i * 2 + 1, m + 1, r, first, second);
}
long long kth(long long k) { return kthElement_Helper(1, 0, n - 1, k); }
long long kthElement_Helper(long long i, long long l, long long r,
long long k) {
if (l == r) return l;
if (st[i * 2] >= k) return kthElement_Helper(i * 2, l, (l + r) / 2, k);
return kthElement_Helper(i * 2 + 1, (l + r) / 2 + 1, r, k - st[i * 2]);
}
};
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, w;
cin >> n >> w;
vector<long long> v(n);
for (long long i = 0; i < (long long)n; i++) cin >> v[i];
vector<long long> fin(n);
RSQ seats(n);
for (long long i = 0; i < (long long)n; i++) seats.inc(i, 1);
set<pair<long long, pair<long long, long long>>> pq;
for (long long i = 0; i < (long long)n; i++) {
pq.insert({v[i], {0, i}});
}
long long queTim = 0;
set<long long> wt;
while (!pq.empty()) {
auto p = *pq.begin();
pq.erase(pq.begin());
if (p.second.first == 0) {
long long ind = p.second.second;
wt.insert(ind);
} else if (p.second.first == 1) {
long long ind = p.second.second;
seats.inc(ind, 1);
}
while (wt.size() != 0) {
long long f = *wt.begin();
if (seats.sum(0, f) == f + 1) {
seats.inc(f, -1);
fin[f] = max(queTim + w, p.first + w);
queTim = fin[f];
pq.insert({fin[f], {1, f}});
wt.erase(wt.begin());
} else
break;
}
}
for (long long i : fin) cout << i << " ";
}
| 9 | CPP |
n,k=map(int,input().split())
l=sorted(map(int,input().split()))
ma=l[-1]
if k>=n: print(ma)
else:
kk=2*k-n
for i in range((n-kk)//2):
j=(n-kk-1)-i
t=l[i]+l[j]
if t>ma: ma=t
print(ma) | 8 | PYTHON3 |
for t in range(int(input())):
n=int(input())
s=sorted(list(map(int,input().split())))
mini=s[1]-s[0]
for i in range(1,n): mini=min(mini,s[i]-s[i-1])
print(mini) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int prim(int start, vector<vector<pair<int,int>>> hen) {
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> que;
que.emplace(0, start);
vector<int> seen(hen.size());
int sum = 0;
while(que.size()) {
int cost = que.top().first, vert = que.top().second;
que.pop();
if(seen[vert])continue;
seen[vert] = true;
//処理をする
sum += cost;
for(auto i : hen[vert]) {
if(seen[i.first])continue;
que.emplace(i.second, i.first);
}
}
return sum;
}
int main()
{
int n, m;
cin >> n >> m;
vector<vector<pair<int,int>>> hen(n);
for(int i = 0; i < m; i++) {
int a, b, c; cin >> a >> b >> c;
hen[a].emplace_back(b, c);
hen[b].emplace_back(a, c);
}
cout << prim(0, hen) << endl;
}
| 0 | CPP |
import re
n=int(input())
r=input()
s=re.split(r'\s+',r)
for i in range(n):
s[i]=int(s[i])
mi=s[0]
ma=s[0]
a=0
for i in range(n):
if s[i]<mi:
mi=s[i]
a+=1
elif s[i]>ma:
ma=s[i]
a+=1
print(a)
| 7 | PYTHON3 |
n=int(input())
x=[int(w) for w in input().split()]
a=n//2
y=sum(x)//a
m=[]
for i in range(n):
for j in range(n):
if i!=j and x[i]+x[j]==y and i not in m and j not in m:
print(i+1,j+1)
m.append(i)
m.append(j) | 7 | PYTHON3 |
#---------------------------------------------
import sys
# sys.stdin = open('../input.txt', 'r'); sys.stdout = open('../output.txt', 'w')
mod = 1000000007
get_arr = lambda: list(map(int, input().split()))
get_int = lambda: int(input())
get_ints = lambda: map(int, input().split())
get_str = lambda: input()
get_strs = lambda: input().split()
#--------------------------------------------
n = get_int()
s = get_str()
ans = int(s)
j = 0
for i in range(n//2, n):
if(j>3): break
if(s[i]=='0'): continue
ans = min(ans, int(s[:i]) + int(s[i:]))
j += 1
j = 0
for i in range(n//2, 0, -1):
if(j>3): break
if(s[i]=='0'): continue
ans = min(ans, int(s[:i]) + int(s[i:]))
j += 1
print(ans) | 8 | PYTHON3 |
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
return x & 0x0000007f
cmb=[[0 for i in range(51)] for j in range(51)]
cmb[0][0]=1
for i in range(51):
for j in range(51):
if i!=50:
cmb[i+1][j]+=cmb[i][j]
if j!=50 and i!=50:
cmb[i+1][j+1]+=cmb[i][j]
for i in range(1,51):
for j in range(2,51):
cmb[i][j]+=cmb[i][j-1]
import random
N,K,T,S=map(int,input().split())
a=list(map(int,input().split()))
must0=[i for i in range(18) if S>>i &1==0]
must1=[i for i in range(18) if T>>i &1==1]
A=[]
for val in a:
check=True
for j in must0:
check=check&(val>>j &1==0)
for j in must1:
check=check&(val>>j &1==1)
if check:
A.append(val)
if not A:
print(0)
exit()
bit=[]
for i in range(18):
if i not in must0 and i not in must1:
bit.append(i)
for i in range(len(A)):
temp=0
for j in range(len(bit)):
temp+=(A[i]>>bit[j] &1==1)*2**j
A[i]=temp
ans=0
n=len(bit)
data=[0]*(2**n)
pc=[popcount(i) for i in range(2**n)]
for i in range(2**n):
for a in A:
data[a&i]+=1
for a in A:
if data[a&i]:
ans+=cmb[data[a&i]][min(K,data[a&i])]*(-1)**pc[i]
data[a&i]=0
print(ans) | 0 | PYTHON3 |
for _ in range(int(input())):
l = int(input())
s = set(list(map(int,input().split())))
y = len(s)
print(y) | 7 | PYTHON3 |
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
print("YES" if (n == 1 or m == 1 or (n == 2 and m==2)) else "NO") | 7 | PYTHON3 |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
if k ** 2 <= n and n % 2 == k % 2:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
if(n%2!=0 and n!=1):
print("Ashishgup")
elif(n==1):
print("FastestFinger")
elif(n==2):
print("Ashishgup")
else:
even=0
while(n%2==0):
even+=1
n=n//2
if(n==1):
print("FastestFinger")
continue
odd=0
n1=int(n**(0.5))
for i in range(n1,1,-1):
if(n%i==0):
odd+=2
break
if(even==1 and odd == 0):
print("FastestFinger")
else:
print("Ashishgup")
| 9 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = [0] * (n + 1)
mx = 0
for i in range(n):
p[a[i]] = i + 1
for i in range(n):
print(max(0, p[b[i]] - mx), end = ' ')
mx = max(mx, p[b[i]])
| 8 | PYTHON3 |
a = list(map(int, input().split()))
x = a[0] * a[1] + a[3] * 2
y = a[0] * a[2] + a[4] * 2
if(x > y):
print("Second")
elif(y >x):
print("First")
else:
print("Friendship") | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.