solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
# sys.setrecursionlimit(200000)
mod = 10**9+7
# mod = 998244353
decimal.getcontext().prec = 46
def primeFactors(n):
prime = set()
while n % 2 == 0:
prime.add(2)
n = n//2
for i in range(3,int(math.sqrt(n))+1,2):
while n % i== 0:
prime.add(i)
n = n//i
if n > 2:
prime.add(n)
return list(prime)
def getFactors(n) :
factors = []
i = 1
while i <= math.sqrt(n):
if (n % i == 0) :
if (n // i == i) :
factors.append(i)
else :
factors.append(i)
factors.append(n//i)
i = i + 1
return factors
def modefiedSieve():
mx=10**7+1
sieve=[-1]*mx
for i in range(2,mx):
if sieve[i]==-1:
sieve[i]=i
for j in range(i*i,mx,i):
if sieve[j]==-1:
sieve[j]=i
return sieve
def SieveOfEratosthenes(n):
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
num = []
for p in range(2, n+1):
if prime[p]:
num.append(p)
return num
def lcm(a,b):
return (a*b)//math.gcd(a,b)
def sort_dict(key_value):
return sorted(key_value.items(), key = lambda kv:(kv[1], kv[0]), reverse=True)
def list_input():
return list(map(int,input().split()))
def num_input():
return map(int,input().split())
def string_list():
return list(input())
def decimalToBinary(n):
return bin(n).replace("0b", "")
def binaryToDecimal(n):
return int(n,2)
def DFS(n,s,adj):
visited = [False for i in range(n+1)]
stack = []
stack.append(s)
while (len(stack)):
s = stack[-1]
stack.pop()
if (not visited[s]):
visited[s] = True
for node in adj[s]:
if (not visited[node]):
stack.append(node)
def maxSubArraySum(a,size):
max_so_far = -sys.maxsize - 1
max_ending_here = 0
start = 0
end = 0
s = 0
for i in range(0,size):
max_ending_here += a[i]
if max_so_far < max_ending_here:
max_so_far = max_ending_here
start = s
end = i
if max_ending_here < 0:
max_ending_here = 0
s = i+1
return max_so_far,start,end
def lis(arr):
n = len(arr)
lis = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] >= arr[j] and lis[i]< lis[j] + 1 :
lis[i] = lis[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , lis[i])
return maximum
def solve():
end_number = [1,4]
for i in range(2,65):
a = end_number[i-2]+2
end_number.append(a+(2**i-1)*2)
l,r = num_input()
lower = math.floor(math.log(l,2))
upper = math.floor(math.log(r,2))
summ = 0
if lower == upper:
if lower == 0:
print(1)
return
left = end_number[lower]
a = left - 2*(int(pow(2,lower))-1)
l -= (int(pow(2,lower))-1)
a = a+(l-1)*2
r -= (int(pow(2,lower))-1)
n = r-l+1
summ = (n*(a+n-1))%mod
print(summ)
return
#bottom sum
if lower != 0:
left = end_number[lower]
#a = left - 2*(2**lower-1)
a = left - 2*(int(pow(2,lower))-1)
#l -= (2**lower-1)
l -= (int(pow(2,lower))-1)
a = a+(l-1)*2
#n = 2**lower - l + 1
n = int(pow(2,lower))-l+1
summ += (n*(a+n-1))%mod
else:
summ += 1
#top sum
right = end_number[upper]
#a = right - 2*(2**upper-1)
a = right - 2*(int(pow(2,upper))-1)
#r -= (2**upper-1)
r -= (int(pow(2,upper))-1)
summ = (r*(a+r-1)+summ)%mod
for i in range(lower+1,upper):
left = end_number[i]
#a = left - 2*(2**i-1)
a = left - 2*(int(pow(2,i))-1)
#n = 2**i
n = int(pow(2,i))
summ = (n*(a+n-1)+summ)%mod
print(summ)
t = 1
#t = int(input())
for _ in range(t):
solve()
| 1,800 | PYTHON3 |
n, k = map(int, input().split())
print("YES")
if(k % 2 == 0):
print("." * n)
print("." + "#" * (k // 2) + "." * (n - 1 - k // 2))
print("." + "#" * (k // 2) + "." * (n - 1 - k // 2))
print("." * n)
else:
if(k <= n - 2):
t = (n - k) // 2
print("." * n)
print("." * t + "#" * k + "." * t)
print("." * n)
print("." * n)
else:
t = k - (n - 2)
print("." * n)
print("." + "#" * (n - 2) + ".")
print("." * (n // 2 - t // 2) + "#" * (t // 2) + "." + "#" * (t // 2) + "." * (n // 2 - t // 2))
print("." * n) | 1,600 | PYTHON3 |
N = int(input())
A = [int(i) for i in input().split()]
for n in A:
if(n%2):
print("First")
break
else:
print("Second")
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int N = 109;
int n, a[N];
const long long mod = 20000000000021;
const int base = 31;
map<long long, int> mp;
inline long long solve(int x) {
long long ans = 0;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = 15; j < 30; j++) {
if (x & (1 << j)) {
if (a[i] & (1 << j))
cnt--;
else
cnt++;
}
}
ans = (1ll * base * ans + cnt) % mod;
}
return ans;
}
inline int js(int x) {
int ans = 0;
while (x) {
ans += (x & 1);
x >>= 1;
}
return ans;
}
inline void solve2(int x) {
for (int i = 0; i <= 30; i++) {
long long xx = 0;
for (int j = 1; j <= n; j++) {
int t = a[j] ^ x;
int cnt = js(t);
xx = (1ll * xx * base + (i - cnt)) % mod;
}
if (mp.count(xx)) {
cout << (mp[xx] << 15) + x << endl;
exit(0);
}
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i < (1 << 15); i++) {
long long z = solve(i << 15);
mp[z] = i;
}
for (int i = 0; i < (1 << 15); i++) {
solve2(i);
}
cout << -1 << endl;
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int> > nxt, visit;
vector<string> s, c;
int power(int a, int b, int m = 1000000007) {
if (b == 0) return 1;
if (b == 1) return a;
int res = power(a, b / 2, m);
res = (res * res) % m;
if (b & 1) res = (res * a) % m;
return res;
}
int modinv(int a) { return power(a, 1000000007 - 2); }
void fun(int x, int y, int &nx, int &ny) {
if (s[x][y] == 'U') nx = x - 1, ny = y;
if (s[x][y] == 'D') nx = x + 1, ny = y;
if (s[x][y] == 'L') nx = x, ny = y - 1;
if (s[x][y] == 'R') nx = x, ny = y + 1;
}
void dfs(int x, int y) {
visit[x][y] = 1;
int nx, ny;
fun(x, y, nx, ny);
if (!visit[nx][ny]) dfs(nx, ny);
nxt[x * m + y][0] = nx * m + ny;
}
void solve() {
cin >> n >> m;
s = c = vector<string>(n);
for (auto &x : c) cin >> x;
for (auto &x : s) cin >> x;
int nm = n * m, i, j, deg, answ = 0, ansb = 0;
int lognm = 0, x = nm;
while (x) lognm++, x /= 2;
nxt = vector<vector<int> >(nm, vector<int>(lognm));
visit = vector<vector<int> >(n, vector<int>(m));
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
if (!visit[i][j]) dfs(i, j);
for (deg = 1; deg < lognm; deg++)
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
nxt[i * m + j][deg] = nxt[nxt[i * m + j][deg - 1]][deg - 1];
vector<int> black(nm, 0), white(nm, 0);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
int x = nm, to = i * m + j;
for (deg = lognm - 1; deg >= 0; deg--) {
if ((1 << deg) & x) to = nxt[to][deg];
}
if (c[i][j] == '0')
black[to]++;
else
white[to]++;
}
}
for (i = 0; i < nm; i++) {
if (black[i])
ansb++;
else if (white[i])
answ++;
}
cout << ansb + answ << " " << ansb << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b % 2 != 0) res = (res * a) % 1000000007;
a = (a * a) % 1000000007;
b /= 2;
}
return res;
}
long long ncr(long long n, long long k) {
if (k == 0 || k == n) return 1ll;
if (k > n - k) k = n - k;
long long pro = 1;
for (long long i = 0; i < k; i++) {
pro = (pro * (n - i)) % 1000000007;
pro /= (i + 1);
}
return (pro % 1000000007);
}
vector<int> prime;
void seive() {
vector<bool> isprime(1000001, true);
for (int i = 2; i * i <= 1000000; i++) {
if (isprime[i]) {
for (int j = i * i; j <= 1000000; j += i) {
isprime[j] = false;
}
}
}
for (int i = 2; i <= 1000000; i++) {
if (isprime[i]) prime.push_back(i);
}
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, a, b;
long double sum;
cin >> n >> sum;
vector<vector<long long>> adj(n + 1);
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (adj[i].size() == 1) {
cnt++;
}
}
setprecision(12);
long double ans = (2.0 * sum) / cnt;
cout << setprecision(12) << ans;
return 0;
}
| 1,700 | CPP |
a=int(input())
b=0
c=0
if a%3==0:
print(a//3*2)
else:
print(a//3*2+1)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string a;
int main() {
cin >> n >> a;
for (int i = 0; i < n; i++)
if (a[i] == 'R' && a[i + 1] == 'U' || a[i] == 'U' && a[i + 1] == 'R')
a.replace(i, 2, "D");
cout << a.size();
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
string s[N];
int n, f[N][N][N][N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> s[i], s[i] = ' ' + s[i];
for (int l = 1; l <= n; l++)
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n - l + 1; i++)
for (int j = 1; j <= n - k + 1; j++) {
if (l == 1 && k == 1 && s[i][j] == '#')
f[l][k][i][j] = 1;
else {
f[l][k][i][j] = bool(f[l - 1][k][i + 1][j] | f[1][k][i][j] |
f[l][1][i][j] | f[l][k - 1][i][j + 1]) *
max(l, k);
}
}
for (int l = 1; l <= n; l++)
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n - l + 1; i++)
for (int j = 1; j <= n - k + 1; j++)
if (f[l][k][i][j] != 0 || (l > 1 || k > 1)) {
for (int p = 1; p < l; p++)
f[l][k][i][j] =
min(f[l][k][i][j], f[p][k][i][j] + f[l - p][k][i + p][j]);
for (int p = 1; p < k; p++)
f[l][k][i][j] =
min(f[l][k][i][j], f[l][p][i][j] + f[l][k - p][i][j + p]);
}
cout << f[n][n][1][1];
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve(long long arr[], long long pre[], long long n) {
stack<long long> s;
for (long long i = 0; i < n; i++) {
while (!s.empty() && arr[s.top()] > arr[i]) {
s.pop();
}
if (s.empty())
pre[i] = arr[i] * (i + 1);
else
pre[i] = arr[i] * (i - s.top()) + pre[s.top()];
s.push(i);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
long long pre[n], suf[n];
solve(arr, pre, n);
reverse(arr, arr + n);
solve(arr, suf, n);
reverse(arr, arr + n);
reverse(suf, suf + n);
long long ans = 0, ind = -1;
for (long long i = 0; i < n; i++) {
long long sum = pre[i] + suf[i] - arr[i];
if (sum > ans) {
ans = sum;
ind = i;
}
}
long long i = ind;
long long curr = arr[i];
long long v = arr[i];
vector<long long> res;
for (long long j = i - 1; j >= 0; j--) {
v = min(v, arr[j]);
res.push_back(v);
curr += v;
}
reverse(res.begin(), res.end());
res.push_back(arr[i]);
v = arr[i];
for (long long j = i + 1; j < n; j++) {
v = min(v, arr[j]);
res.push_back(v);
curr += v;
}
for (long long i = 0; i < n; i++) {
cout << res[i] << " ";
}
}
| 1,900 | CPP |
import bisect
init=2
temp=5
dict1={}
pyramid=[]
while(True):
pyramid.append(init)
init+=temp
temp+=3
if init>10000000001:
break
for _ in range(int(input())):
ans=0
n=int(input())
while(True):
closest=bisect.bisect(pyramid,n)
#print(pyramid[closest-1])
ans+=n//pyramid[closest-1]
n=n-(pyramid[closest-1]*(n//pyramid[closest-1]))
#print(n,closest)
if n==0 or n==1:
break
elif pyramid[closest-1]==2:
break
print(ans)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 2 * 1e5 + 10;
int a[M];
int main() {
long long s, n, p1, c, pos1, pos2, p2, i, ans = 1, d, x, j;
scanf("%I64d", &n);
for (i = 0; i < n; i++) scanf("%I64d", &a[i]);
if (a[0] != -1) {
p1 = a[0];
pos1 = 0;
c = 1;
} else
c = 0;
s = 0;
ans = 1;
for (i = 1; i < n; i++) {
if (i == 10) i = 10;
if (c == 0) {
if (a[i] != -1) {
c = 1;
p1 = a[i];
pos1 = i;
}
continue;
}
if (c == 1) {
if (a[i] != -1) {
if ((a[i] - p1) % (i - pos1) != 0) {
ans++;
s = i;
c = 1;
p1 = a[i];
pos1 = i;
} else {
c = 2;
p2 = a[i];
pos2 = i;
d = (p2 - p1) / (pos2 - pos1);
x = p1 + d * (s - pos1);
if (x <= 0) {
ans++;
c = 1;
p1 = a[i];
pos1 = i;
s = i;
}
}
}
continue;
}
d = (p2 - p1) / (pos2 - pos1);
x = p1 + d * (i - pos1);
if (a[i] == -1) {
if (x <= 0) {
ans++;
c = 0;
s = i;
}
continue;
} else {
if (x != a[i]) {
ans++;
s = i;
c = 1;
p1 = a[i];
pos1 = i;
}
}
}
printf("%I64d", ans);
return 0;
}
| 2,400 | CPP |
n,h = map(int,input().split())
c = 0
b = 0
l = list(map(int,input().split()))
for i in l:
if i <= h:
c += 1
elif i > h:
b += 2
print(b+c)
| 800 | PYTHON3 |
q = int(input())
result = []
for _ in range(q):
input()
students = list(map(int, input().split()))
direction = 0
prev = None
changed = False
c_pos = None
r = 'YES'
for i, s in enumerate(students):
if prev:
if direction == 0:
if s == prev + 1:
direction = 1
elif s == prev - 1:
direction = -1
else:
changed = True
if prev < s:
direction = -1
else:
direction = 1
else:
if s != prev + direction:
if changed:
r = 'NO'
else:
changed = True
prev = s
result.append(r)
print('\n'.join(result))
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
const double g = 9.8, pi = 3.141592653589793;
struct point {
double x, y;
};
struct wall {
double x, y, a, b;
};
static bool operator<(const wall &a, const wall &b) {
return a.x < b.x ? true : a.x > b.x ? false : a.y > b.y;
}
static double fy(const double a, const double x, const double v) {
const double t = x / (v * cos(a));
return v * t * sin(a) - g * t * t / 2.0;
}
static double fx0(const double a, const double v) {
const double t = 2.0 * v * sin(a) / g;
return v * t * cos(a);
}
static double alpha(const double x, const double y, const double v) {
double a = 0.0, b = pi / 4.0;
if (fy(a, x, v) <= y && y <= fy(b, x, v)) {
for (int i = 0; i < 20; i++) {
const double c = (a + b) / 2.0;
if (fy(c, x, v) <= y)
a = c;
else
b = c;
}
return (a + b) / 2.0;
}
return -1.0;
}
static point landing(const wall *b, const wall *e, const double a,
const double v) {
while (b != e && b->a <= a && a <= (e - 1)->b) {
if (b->a <= a && a <= b->b)
return {b->x, fy(a, b->x, v)};
else if (b + 1 == e)
break;
const wall *c = &b[(e - b) / 2];
if (a < c->a)
e = c;
else
b = c;
}
return {fx0(a, v), 0.0};
}
int main(int argc, char *argv[]) {
int n, v;
if (scanf("%d %d", &n, &v) != 2 || n < 1 || 10000 < n || v < 1 || 1000 < v) {
fprintf(stderr, "scanf: Header IO error.\n");
exit(EXIT_FAILURE);
}
std::vector<double> a(n);
for (int i = 0; i < n; i++)
if (scanf("%lf", &a[i]) != 1 || a[i] <= 0.0 || pi / 4.0 <= a[i]) {
fprintf(stderr, "scanf: Alpha IO error.\n");
exit(EXIT_FAILURE);
}
int m;
if (scanf("%d", &m) != 1 || m < 1 || 100000 < m) {
fprintf(stderr, "scanf: Wall count IO error.\n");
exit(EXIT_FAILURE);
}
std::vector<wall> w(m);
for (int i = 0; i < m; i++) {
if (scanf("%lf %lf", &w[i].x, &w[i].y) != 2 || w[i].x < 1.0 ||
1000.0 < w[i].x || w[i].y < 0.0 || 1000.0 < w[i].y) {
fprintf(stderr, "scanf: Wall IO error.\n");
exit(EXIT_FAILURE);
}
w[i].a = alpha(w[i].x, 0.0, v);
w[i].b = alpha(w[i].x, w[i].y, v);
if (w[i].a >= 0.0 && w[i].b < 0.0) w[i].b = pi / 4.0;
}
std::sort(w.begin(), w.end());
std::vector<wall> q;
for (int i = 0; i < m; i++)
if (q.empty() && w[i].a >= 0.0 && w[i].b >= 0.0)
q.push_back(w[i]);
else if (!q.empty() && q.back().b < w[i].b)
q.push_back({w[i].x, w[i].y, std::max(q.back().b, w[i].a), w[i].b});
for (const double h : a) {
const point p = landing(&q[0], &q[q.size()], h, v);
printf("%.9f %.9f\n", p.x, p.y);
}
return EXIT_SUCCESS;
}
| 2,200 | CPP |
n = int(input())
nums = input().split()
lst = []
total = 0
for i in range(0, n):
lst.append(int(nums[i]))
total = total + lst[i]
lst.sort()
lst.reverse()
accum = 0
for i in range(0, n):
accum = accum + lst[i]
if accum > total - accum:
print(i + 1)
break
| 900 | PYTHON3 |
### A. Sequence with Digits
for _ in range(int(input())):
a, k = map(int, input().split())
for i in range(1,k):
minim = min(str(a))
maxim = max(str(a))
if minim == '0':
break
a = a+int(minim)*int(maxim)
print(a) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
bool isPrime = true;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
isPrime = false;
break;
}
}
int ans;
if (isPrime)
ans = 1;
else {
if (n % 2) {
n -= 2, isPrime = true;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
isPrime = false;
}
}
if (isPrime)
ans = 2;
else
ans = 3;
} else
ans = 2;
}
cout << ans;
return 0;
}
| 1,600 | CPP |
def solve(c, a):
for i in range(1, 4):
c[i] -= a[i]
not_enough_room_for_pure_items = min(c) < 0
if not_enough_room_for_pure_items:
return False
# not_enough_room_for_partial_paper = c[1] + c[3] < a[4]
# if not_enough_room_for_partial_paper:
# return False
#
# if a[4] > c[1]:
# a[4] -= c[1]
# c[1] = 0
# c[3] -= a[4]
# else:
# c[1] -= a[4]
# a[4] = 0
#
# not_enough_room_for_partial_plastic = c[2] + c[3] < a[5]
# if not_enough_room_for_partial_plastic:
# return False
#
# return True
c[1] -= a[4]
c[2] -= a[5]
if c[1] < 0:
c[3] -= -c[1]
if c[2] < 0:
c[3] -= -c[2]
return c[3] >= 0
if __name__ == "__main__":
cases = int(input())
for case in range(cases):
c = [0]
a = [0]
for t in input().split():
c.append(int(t))
for t in input().split():
a.append(int(t))
print("YES" if solve(c, a) else "NO")
| 900 | PYTHON3 |
s = input()
if '.' not in s:
s = s+'.'
s = '0' + s + '0'
dp = s.find('.')
pre = s[0:dp]
post = s[dp + 1:]
i = 0
while i<len(pre)-1 and pre[i] == '0':
i += 1
pre = pre[i:]
i = len(post) - 1
while i>0 and post[i] == '0':
i -= 1
post = post[:i+1]
b = 0
if pre == '0':
b -= len(post)
pre = post
post = '0'
i = 0
while i<len(pre)-1 and pre[i] == '0':
i += 1
pre = pre[i:]
b += len(pre)-1
post = pre[1:] + post
pre = pre[0]
i = len(post) - 1
while i>0 and post[i] == '0':
i -= 1
post = post[:i+1]
if post == '0' or post == '':
print(pre, end = '')
else:
print(pre+'.'+post, end = '')
if b != 0:
print('E'+str(b), end = '')
print('')
| 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
map<int, bool> mp[200007];
set<int> st;
vector<int> ans2;
int main() {
int n, m, i, j, k, x, y;
scanf("%d%d", &n, &m);
for (i = 1; i <= m; i++) {
scanf("%d%d", &x, &y);
mp[x][y] = 1;
mp[y][x] = 1;
}
st.clear();
for (i = 1; i <= n; i++) {
st.insert(i);
}
set<int>::iterator it;
while (!st.empty()) {
vector<int> ans;
it = st.begin();
st.erase(it);
queue<int> q;
while (!q.empty()) q.pop();
q.push(*it);
ans.push_back(*it);
while (!q.empty()) {
x = q.front();
q.pop();
for (it = st.begin(); it != st.end();) {
if (!mp[x][*it]) {
ans.push_back(*it);
q.push(*it);
st.erase(it++);
} else
it++;
}
}
ans2.push_back(ans.size());
}
printf("%d\n", ans2.size());
sort(ans2.begin(), ans2.end());
for (i = 0; i < ans2.size(); i++) {
if (i > 0) printf(" ");
printf("%d", ans2[i]);
}
printf("\n");
return 0;
}
| 2,100 | CPP |
"""
@Vishvesh Bhavsar :)
"""
for _ in range(int(input())):
s=input()
if (s[-2:]=='po'):
print('FILIPINO')
elif (s[-4:]=='desu' or s[-4:]=='masu'):
print('JAPANESE')
else:
print('KOREAN') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char a[110][110];
int n, m;
int main() {
register int i, j;
while (cin >> n >> m) {
char c;
cin >> c;
memset((a), (0), sizeof(a));
for (int(i) = 0; (i) < (n); (i)++)
for (int(j) = 0; (j) < (m); (j)++) cin >> a[i][j];
bool visited[27] = {false};
visited[c - 'A'] = true;
int sum = 0;
for (int(i) = 0; (i) < (n); (i)++)
for (int(j) = 0; (j) < (m); (j)++) {
if (a[i][j] == c) {
if (i > 0 && isupper(a[i - 1][j]) && !visited[a[i - 1][j] - 'A']) {
visited[a[i - 1][j] - 'A'] = true;
sum++;
}
if (isupper(a[i + 1][j]) && !visited[a[i + 1][j] - 'A']) {
visited[a[i + 1][j] - 'A'] = true;
sum++;
}
if (j > 0 && isupper(a[i][j - 1]) && !visited[a[i][j - 1] - 'A']) {
visited[a[i][j - 1] - 'A'] = true;
sum++;
}
if (isupper(a[i][j + 1]) && !visited[a[i][j + 1] - 'A']) {
visited[a[i][j + 1] - 'A'] = true;
sum++;
}
}
}
cout << sum << endl;
}
}
| 1,100 | CPP |
from bisect import bisect_right
n = int(input().split()[0])
t = [int(input().split()[0]) for i in range(n)]
p, k = [], 0
for i in t:
x = bisect_right(p, i)
if x < k: p[x] = i
else:
p.append(i)
k += 1
print(n - k) | 1,700 | PYTHON3 |
import sys
def read(): return list(map(int, sys.stdin.readline().split()))
for i in range(int(input())):
n,m,k = read();
if m<n/k:print(m)
else:
print(int(n/k - (m-n/k+k-2)//(k-1)))
| 1,000 | PYTHON3 |
l = input().split(" ")
a = int(l[0])
b = int(l[1])
if b < a:
t = a
a = b
b = t
res = 1
for i in range(1,a+1):
res = res * i
print(res) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t, n, candies_arr[1000], min_start, left_ptr, right_ptr, num_moves,
a_count, b_count, curr_count;
bool is_right, to_perform;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
for (int j = 0; j < n; j++) {
cin >> candies_arr[j];
}
if (n > 1) {
min_start = candies_arr[0] + 1;
left_ptr = 1;
right_ptr = n - 1;
is_right = true;
to_perform = true;
num_moves = 1;
a_count = candies_arr[0];
b_count = 0;
while (to_perform) {
curr_count = 0;
if (is_right) {
is_right = false;
while (left_ptr <= right_ptr && curr_count < min_start) {
curr_count += candies_arr[right_ptr];
right_ptr--;
}
b_count += curr_count;
if (left_ptr > right_ptr) {
to_perform = false;
}
} else {
is_right = true;
while (left_ptr <= right_ptr && curr_count < min_start) {
curr_count += candies_arr[left_ptr];
left_ptr++;
}
a_count += curr_count;
if (left_ptr > right_ptr) {
to_perform = false;
}
}
min_start = curr_count + 1;
num_moves++;
}
cout << num_moves << " " << a_count << " " << b_count << "\n";
} else {
cout << "1 " << candies_arr[0] << " 0\n";
}
}
}
| 1,300 | CPP |
from __future__ import print_function
import sys
from collections import *
from heapq import *
from functools import *
import re
from itertools import *
INF=float("inf")
NINF=float("-inf")
try:
input=raw_input
except:
pass
def read_string():
return input()
def read_string_line():
return [x for x in input().split(" ")]
def read_int_line():
return [int(x) for x in input().split(" ")]
def read_int():
return int(input())
n,m=read_int_line()
a=[[0]*n for _ in range(n)]
for _ in range(m):
frm,to=read_int_line()
frm-=1
to-=1
a[frm][to]=a[to][frm]=1
def calc():
dist=[-1]*n
dist[0]=0
q=deque([0])
while q:
cur=q.popleft()
for nxt in range(n):
if a[cur][nxt] != a[0][n-1] and dist[nxt]==-1:
dist[nxt]=dist[cur]+1
q.append(nxt)
return dist[-1]
print("%d"%calc())
| 1,600 | PYTHON3 |
s = input()
c = 0
if s[0] <= 'a':
x = ord('a') - ord(s[0])
if x <= 13:
c += x
else:
x += 26 - x
else:
x = ord(s[0]) - ord('a')
if x <= 13:
c += x
else:
c += 26 - x
for i in range(len(s)-1):
if s[i] <= s[i+1]:
x = ord(s[i]) - ord(s[i+1]) + 26
if x <= 13:
c += x
else:
c += 26 - x
else:
x = ord(s[i+1]) - ord(s[i]) + 26
if x <= 13:
c += x
else:
c += 26 - x
print(c)
| 800 | PYTHON3 |
l,b,f=list(map(int,input().split()))
n=int(input())
a=[]
z=0
for j in range(n):
d,c=list(map(int,input().split()))
if d==1:
x=-1
y=0
for i in range(z):
if a[i][0]+a[i][1]+b+c<=l and (i==z-1 or a[i][0]+a[i][1]+b+c<=a[i+1][0]-f):
x=a[i][0]+a[i][1]+b
y=i+1
break
if z==0:
if c<=l:
print(0)
a=[[0,c,j+1]]+a
z+=1
else:
print(-1)
else:
if c+f<=a[0][0]:
print(0)
a=[[0,c,j+1]]+a
z+=1
elif x==-1:
print(-1)
else:
print(x)
a=a[:y]+[[x,c,j+1]]+a[y:]
z+=1
else:
for i in range(z):
if a[i][2]==c:
a=a[:i]+a[i+1:]
z-=1
break | 1,800 | PYTHON3 |
def solve(n):
if(n>45):
return -1
if(n<10):
return n
s=0
ls=[]
dig=9
while(dig>0 and s<n):
if(n-s<dig):
ls.append(str(n-s))
s=n
else:
ls.append(str(dig))
s+=dig
dig-=1
ls.reverse()
return ''.join(ls)
t=int(input())
while(t):
n=int(input())
print(solve(n))
t-=1 | 900 | PYTHON3 |
n=int(input())
length=0
out=''
for i in range(n):
word=str(input())
length=len(word)
if (length<=10):
out+=word
else:
out+=word[0]+str(length-2)+word[length-1]
out+='\n'
print(out) | 800 | PYTHON3 |
n,k=[int(x) for x in input().split()]
num=0
t=5+k
for i in range(2,n+2):
if t<=240:
num+=1
t+=i*5
else:
num+=0
print(num) | 800 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int t;
cin >> t;
while( t-- )
{
int n, a, b, i, count = 1;
cin >> n >> a >> b;
string s;
cin >> s;
for(i = 1; i < n; i++)
count += s[i] != s[i - 1];
count/=2;
if(b < 0)
cout << n*a + (count + 1)*b << endl;
else
cout << n*a + n*b << endl;
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> arr[200010];
map<long long, long long> mark;
long long tree[1 << 19], cnt[200010], n, m, a, b, value, ans[200010];
multiset<pair<long long, long long>> st;
inline void build(long long n, long long l, long long r) {
if (l == r) {
tree[n] = arr[l].first + arr[r].second;
return;
}
long long mid = l + r >> 1;
build(2 * n, l, mid);
build(2 * n + 1, mid + 1, r);
tree[n] = max(tree[2 * n], tree[2 * n + 1]);
}
inline long long query(long long n, long long l, long long r, long long ql,
long long qr, long long val) {
if (l > qr || r < ql || tree[n] < val) return -1;
if (l == r) {
value = tree[n];
return l;
}
long long mid = l + r >> 1;
long long ret = query(2 * n, l, mid, ql, qr, val);
if (ret == -1) ret = query(2 * n + 1, mid + 1, r, ql, qr, val);
return ret;
}
inline void update(long long n, long long l, long long r, long long pos,
long long val) {
if (l == r) {
tree[n] = val;
return;
}
long long mid = l + r >> 1;
if (pos <= mid)
update(2 * n, l, mid, pos, val);
else
update(2 * n + 1, mid + 1, r, pos, val);
tree[n] = max(tree[2 * n], tree[2 * n + 1]);
}
inline void rec(long long n, long long l, long long r) {
if (l == r) {
ans[mark[arr[l].first]] = tree[n] - arr[l].first;
return;
}
long long mid = l + r >> 1;
rec(2 * n, l, mid);
rec(2 * n + 1, mid + 1, r);
}
int main() {
scanf("%lld", &n);
;
scanf("%lld", &m);
;
for (long long x = 1; x <= n; x++) {
scanf("%lld", &arr[x].first);
;
scanf("%lld", &arr[x].second);
;
mark[arr[x].first] = x;
}
sort(arr + 1, arr + n + 1);
build(1, 1, n);
while (m--) {
scanf("%lld", &a);
;
scanf("%lld", &b);
;
if (a < arr[1].first) continue;
long long idx1 =
lower_bound(arr + 1, arr + n + 1, make_pair(a, 100000000000000LL)) -
arr - 1;
long long idx2 = query(1, 1, n, 1, idx1, a);
if (idx2 == -1) {
st.insert(make_pair(a, b));
continue;
}
value += b;
++cnt[mark[arr[idx2].first]];
while (!st.empty()) {
auto it = st.lower_bound(make_pair(arr[idx2].first, 100000000000000LL));
if (it == st.end()) break;
if (it->first <= value) {
value += it->second;
++cnt[mark[arr[idx2].first]];
st.erase(it);
} else
break;
}
update(1, 1, n, idx2, value);
}
rec(1, 1, n);
for (int x = 1; x <= n; x++) printf("%lld %lld\n", cnt[x], ans[x]);
}
| 2,500 | CPP |
numofhedrons = int(input(''))
faces = 0
for i in range(numofhedrons):
hedron = input('')
if 'tetra' in hedron.lower():
faces += 4
elif 'cube' in hedron.lower():
faces += 6
elif 'octa' in hedron.lower():
faces += 8
elif 'dodeca' in hedron.lower():
faces += 12
elif 'icosah' in hedron.lower():
faces += 20
print(faces) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
bool valid = true;
map<pair<int, int>, int> mapper;
map<pair<pair<int, int>, pair<int, int> >, int> mapz;
int x1, y1, x2, y2;
set<int> x, y;
for (int i = 0; i < 4; i++) {
scanf("%d", &x1);
scanf("%d", &y1);
scanf("%d", &x2);
scanf("%d", &y2);
if (x1 == x2 && y1 == y2)
valid = false;
else if (!(x1 == x2 || y1 == y2))
valid = false;
x.insert(x1);
x.insert(x2);
y.insert(y1);
y.insert(y2);
mapper[pair<int, int>(x1, y1)]++;
mapz[make_pair(min(pair<int, int>(x1, y1), pair<int, int>(x2, y2)),
max(pair<int, int>(x1, y1), pair<int, int>(x2, y2)))]++;
mapper[pair<int, int>(x2, y2)]++;
}
for (map<pair<int, int>, int>::iterator it = mapper.begin();
it != mapper.end(); it++) {
if (it->second != 2) valid = false;
}
if (mapz.size() != 4) valid = false;
if (y.size() != 2 || x.size() != 2) valid = false;
printf("%s", valid ? "YES" : "NO");
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int w[555], b[1111];
bool vis[555];
int main() {
int n, m;
while (scanf("%d %d", &n, &m) != EOF) {
int i, j;
for (i = 1; i <= n; i++) scanf("%d", &w[i]);
for (j = 1; j <= m; j++) scanf("%d", &b[j]);
int ans = 0;
for (i = 2; i <= m; i++) {
memset(vis, false, sizeof(vis));
for (j = i - 1; j > 0; j--) {
if (b[i] == b[j]) break;
if (!vis[b[j]]) {
ans += w[b[j]];
vis[b[j]] = true;
}
}
}
printf("%d\n", ans);
}
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(20);
string g, in, query;
int n, count;
set<char> good;
cin >> g;
for (auto v : g) good.insert(v);
cin >> in >> n;
int hasStar = 0;
for (auto v : in)
if (v == '*') hasStar = 1;
for (int k = (1); k <= (n); ++k) {
cin >> query;
if ((!hasStar && query.size() != in.size()) ||
(query.size() < in.size() - 1))
cout << "NO\n";
else {
if (query.size() == in.size() - 1)
count = 0;
else
count = query.size() - in.size() + 1;
int cnt = 0, bad = 0;
for (int i = (0); i <= (in.size() - 1); ++i) {
if (in[i] == '?') {
if (good.count(query[cnt]))
cnt++;
else {
bad = 1;
break;
}
} else if (in[i] == '*') {
for (int j = (cnt); j <= (cnt + count - 1); ++j)
if (good.count(query[j])) bad = 1;
cnt += count;
} else {
if (in[i] == query[cnt])
cnt++;
else
bad = 1;
}
}
if (bad)
cout << "NO\n";
else
cout << "YES\n";
}
}
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct Node {
vector<int> adj;
vector<int> w;
long long total;
Node() { total = -1; }
} g[N];
long long sol;
int n;
long long bfs(int start) {
long long ret = 0;
queue<int> q;
q.push(start);
g[start].total = 0ll;
while (!q.empty()) {
int xt = q.front();
q.pop();
for (int i = 0; i < g[xt].adj.size(); i++) {
if (g[g[xt].adj[i]].total == -1) {
q.push(g[xt].adj[i]);
g[g[xt].adj[i]].total = g[xt].total + 1ll * g[xt].w[i];
ret = max(ret, g[g[xt].adj[i]].total);
}
}
}
return ret;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
g[a].adj.push_back(b);
g[a].w.push_back(c);
sol += c;
g[b].adj.push_back(a);
g[b].w.push_back(c);
sol += c;
}
printf("%lld", sol - bfs(1));
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int node[15][N + 5];
int n;
int k, q;
struct Ele {
int x, y, com = 0;
} ele[N + 15];
int findd(int x, int y) {
if (x <= k) return node[x][y];
int t1, t2;
t1 = findd(ele[x].x, y);
t2 = findd(ele[x].y, y);
if (ele[x].com == 1)
return max(t1, t2);
else
return min(t1, t2);
}
int main() {
while (scanf("%d%d%d", &n, &k, &q) != EOF) {
memset(node, 0, sizeof node);
for (int i = 1; i <= k; i++)
for (int j = 1; j <= n; j++) scanf("%d", &node[i][j]);
int com, x, y, cnt = k + 1;
for (int i = 1; i <= q; i++) {
scanf("%d%d%d", &com, &x, &y);
if (com == 1) {
ele[cnt].x = x, ele[cnt].y = y, ele[cnt++].com = com;
} else if (com == 2) {
ele[cnt].x = x, ele[cnt].y = y, ele[cnt++].com = com;
} else {
printf("%d\n", findd(x, y));
}
}
}
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<long long, long long>, long long> > v;
vector<pair<long long, long long> > p;
set<pair<long long, long long> > s;
set<pair<long long, long long> >::iterator it;
long long l[200000], r[200000], ans[200000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, i, j, k;
cin >> n >> m;
for (i = 0; i < n; i++) cin >> l[i] >> r[i];
for (i = 0; i < m; i++) {
cin >> k;
p.push_back(make_pair(k, i));
}
n--;
for (i = 0; i < n; i++)
v.push_back(make_pair(make_pair(l[i + 1] - r[i], r[i + 1] - l[i]), i));
sort(v.begin(), v.end());
sort(p.begin(), p.end());
for (i = 0, j = 0; j < p.size(); j++) {
for (; i < v.size(); i++) {
if (v[i].first.first <= p[j].first && p[j].first <= v[i].first.second)
s.insert(make_pair(v[i].first.second, v[i].second));
else
break;
}
if (!s.empty()) it = s.lower_bound(make_pair(p[j].first, -1));
if (!s.empty() && it == s.end())
break;
else {
if (!s.empty()) {
ans[(*it).second] = p[j].second;
s.erase(it);
} else
;
}
}
if (!s.empty() || i != v.size())
cout << "No" << '\n';
else {
cout << "Yes" << '\n';
for (i = 0; i < v.size(); i++) cout << ans[i] + 1 << ' ';
cout << '\n';
}
return 0;
}
| 2,000 | CPP |
def s(n):
n = str(n)
t = 0
for i in n:
t = t + int(i)
return t
n = input()
while True:
su = s(n)
n = int(n)
if su%4==0:
print(n)
break
else:
n = n + 1
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n, m, x1, y1, x2, y2;
cin >> n >> m >> x1 >> y1 >> x2 >> y2;
int ans = 210;
if (x2 >= x1)
ans = min(x2 - x1, ans);
else
ans = min(ans, n - x2 + n - x1);
if (y2 >= y1)
ans = min(y2 - y1, ans);
else
ans = min(ans, m - y2 + m - y1);
cout << ans << "\n";
}
}
| 800 | CPP |
for _ in range(int(input())):
a, b, c = map(int, input().split())
z = [a,b,c]
z.sort()
if a!= b and b!= c and a!= c:
print('NO')
elif z[0] == z[1] and z[1] != z[2]:
print('NO')
else:
if a==b and a==c and b==c:
print('YES')
print(a, b, c)
else:
print('YES')
print(z[0], z[0], z[2])
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, u[N];
string s[N];
vector<int> ans, g[N];
void dfs(int v) {
u[v] = 1;
for (auto to : g[v]) {
if (u[to] == 1) {
cout << "Impossible";
exit(0);
}
if (!u[to]) dfs(to);
}
ans.push_back(v);
u[v] = 2;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> s[i];
for (int i = 1; i < n; i++) {
string a = s[i];
string b = s[i + 1];
bool found = 0;
for (int j = 0; j < min((int)(a).size(), (int)(b).size()); j++) {
if (a[j] != b[j]) {
found = 1;
g[a[j] - 'a' + 1].push_back(b[j] - 'a' + 1);
break;
}
}
if (!found && (int)(a).size() > (int)(b).size()) {
cout << "Impossible";
return 0;
}
}
for (int i = 1; i <= 26; i++)
if (!u[i]) dfs(i);
reverse(ans.begin(), ans.end());
for (auto i : ans) cout << char(i + 'a' - 1);
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int n, a[N], ans;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int main() {
n = read();
for (int i = 1; i <= n; i++) a[i] = read(), a[i] = abs(a[i]);
for (int i = 1; i <= n; i++) {
int L = 0, R = 0;
for (int j = 1; j < i; j++)
if (a[j] < a[i]) L++;
for (int j = i + 1; j <= n; j++)
if (a[j] < a[i]) R++;
ans += min(L, R);
}
printf("%d", ans);
return 0;
}
| 2,200 | CPP |
r = input()
if int(r)==2:
print('NO')
else:
print('YES'if int(r)%2==0 else 'NO') | 800 | PYTHON3 |
for i in range(int(input())):
n, k = list(map(int, input().split()))
if k % (n-1) == 0:
print(n*(k//(n-1))-1)
else:
print(n*(k//(n-1)) + k%(n-1)) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[205], pg[2];
int main() {
int n, N;
scanf("%d", &n);
N = 2 * n - 1;
int minv = 0x3f3f3f3f, ans = 0;
for (int i = 0; i < N; ++i) {
scanf("%d", a + i);
++pg[a[i] >= 0];
minv = min(minv, abs(a[i]));
ans += abs(a[i]);
}
if (n % 2 == 0 && pg[0] % 2) ans -= 2 * minv;
printf("%d\n", ans);
return 0;
}
| 1,800 | CPP |
n = int(input())
rocks = input()
moves = 0
for i in range(n-1):
if rocks[i] == rocks[i+1]:
moves += 1
print(moves) | 800 | PYTHON3 |
n, k = map(int, input().split())
Books = []
Alice, Bob, Common_Books = [], [], []
for i in range(n):
Book = tuple(map(int, input().split()))
Books.append(Book)
Books = sorted(Books, key=lambda x:x[0])
# print(Books)
for Book in Books:
if Book[1] == 1 and Book[2] == 1:
if len(Common_Books) < k:
Common_Books.append(Book)
else:
break
else:
if len(Alice) != k and Book[1] == 1:
Alice.append(Book)
if len(Bob) != k and Book[2] == 1:
Bob.append(Book)
t = len(Common_Books)
if len(Alice) < k-t or len(Bob) < k-t:
print(-1)
else:
# print(Common_Books)
# print(Alice, Bob)
Min_time = 0
a, iab, ic = 0, 0, 0
while(a<k):
if iab < len(Alice):
A = Alice[iab]
else:
A = (float('inf'), 0, 0)
if iab < len(Bob):
B = Bob[iab]
else:
B = (float('inf'), 0, 0)
if ic < len(Common_Books):
C = Common_Books[ic]
else:
C = (float('inf'), 0, 0)
if A[0]+B[0] < C[0]:
Min_time += A[0]+B[0]
iab += 1
else:
Min_time += C[0]
ic += 1
a += 1
print(Min_time)
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 1e6 + 30;
std::vector<int> v[N];
int n, m;
int a[N], ans[N], pos[N], s[N], b[N];
struct NODE {
int l, r, id;
} q[N];
struct SEGMENTTREE {
int l, r, s;
} t[N << 2];
int read() {
int s = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9')
s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
return s;
}
int cmp(NODE x, NODE y) { return x.r < y.r; }
void build(int p, int l, int r) {
t[p].l = l, t[p].r = r;
if (t[p].l == t[p].r) return;
int mid = l + r >> 1;
build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r);
}
void change(int p, int pos, int val) {
if (t[p].l == t[p].r) {
t[p].s = val;
return;
}
int mid = t[p].l + t[p].r >> 1;
if (pos <= mid)
change(p << 1, pos, val);
else
change(p << 1 | 1, pos, val);
t[p].s = t[p << 1].s + t[p << 1 | 1].s;
}
int ask(int p, int l, int r) {
if (t[p].l >= l && t[p].r <= r) return t[p].s;
int mid = t[p].l + t[p].r >> 1, tot = 0;
if (l <= mid) tot += ask(p << 1, l, r);
if (mid < r) tot += ask(p << 1 | 1, l, r);
return tot;
}
int main() {
n = read(), m = read();
for (int i = 1; i <= n; ++i) s[i] = read(), b[i] = s[i];
std::sort(s + 1, s + n + 1);
int len = std::unique(s + 1, s + n + 1) - s - 1;
for (int i = 1; i <= n; ++i)
a[i] = std::lower_bound(s + 1, s + len + 1, b[i]) - s;
for (int i = 1; i <= n; ++i)
v[a[i]].push_back(i), pos[i] = v[a[i]].size() - 1;
for (int i = 1; i <= m; ++i) q[i].l = read(), q[i].r = read(), q[i].id = i;
std::sort(q + 1, q + m + 1, cmp);
build(1, 1, n);
for (int i = 1; i <= m; ++i) {
int last = q[i - 1].r + 1;
for (int j = last; j <= q[i].r; ++j) {
if (pos[j] - b[j] + 1 >= 0) {
if (pos[j] - b[j] >= 0) change(1, v[a[j]][pos[j] - b[j]], -1);
if (pos[j] - b[j] - 1 >= 0) change(1, v[a[j]][pos[j] - b[j] - 1], 0);
change(1, v[a[j]][pos[j] - b[j] + 1], 1);
}
}
ans[q[i].id] = ask(1, q[i].l, q[i].r);
}
for (int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}
| 1,800 | CPP |
# ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import *
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from sys import stdin
from sys import maxsize
from operator import * # d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter # d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)
'''
'''
def solve(l):
n = len(l)
T = int(input())
for _ in range(T):
a = input()
b = input()
c = input()
f = 1
for i in range(len(a)):
if(a[i] == c[i] or b[i] == c[i]):
x = 1
else:
f = 0
if(f):
print('YES')
else:
print('NO')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, n, i, j, k, total = 0;
scanf("%lld", &t);
while (t--) {
total = 0;
scanf("%lld", &n);
total += 1;
for (i = 2;; i++) {
total += ceil(pow(2, i - 1));
if (n % total == 0) {
printf("%lld\n", n / total);
break;
}
}
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<pair<int, char>, int> F;
int main() {
long long n, m, ans, f[101] = {}, i, j;
char x;
cin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
cin >> x;
if (F[make_pair(j, x)] == 0) f[j]++;
F[make_pair(j, x)] = 1;
}
ans = 1;
for (i = 1; i <= m; i++) ans = (ans * f[i]) % 1000000007;
cout << ans;
}
| 1,400 | CPP |
n,k = map(int,input().split())
for i in range(1,n+1):
s = (i*(i+1))//2
sub = (n-i)
if (s - sub) ==k:
break
print(sub) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool check(long long x, long long a[], int n) {
int l = 1, r = n;
while (l < r) {
int middle = (l + r) / 2;
if (a[middle] == x)
return 1;
else if (a[middle] > x)
r = middle - 1;
else
l = middle + 1;
}
return 0;
}
int main() {
long long start, finish, steps;
cin >> start >> finish >> steps;
int n;
long long a[100001];
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
a[0] = -1;
a[n + 1] = finish;
long long res = 0, timeMin = 100000000000000;
for (int i = 1; i <= n + 1; i++) {
if (!check(start, a, n) && start < a[i] && start + steps <= finish) {
res = start;
break;
}
long long tmp;
if (a[i] > 0 && a[i] != a[i - 1] && a[i] != a[i - 1] + 1 && a[i] <= start) {
tmp = start + steps - (a[i] - 1);
if (timeMin > tmp && start + steps <= finish) {
res = a[i] - 1;
timeMin = tmp;
}
}
tmp = max(a[i], start) + 2 * steps - a[i];
if (timeMin > tmp && start + 2 * steps <= finish && a[i] != a[i + 1]) {
res = a[i];
timeMin = tmp;
}
start = max(a[i], start) + steps;
}
cout << res;
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int t1 = 1, t = 1, ii = 0;
bool ch = 0;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1]) {
t1++;
} else {
ii = i;
break;
}
}
if (ii == n) {
cout << "YES";
return 0;
}
for (int i = ii + 1; i < n; i++) {
if (a[i] == a[i - 1]) {
t++;
} else {
if (t != t1) {
cout << "NO";
return 0;
} else {
t = 1;
}
}
}
if (t1 != t || n % t1 != 0) {
cout << "NO";
return 0;
}
cout << "YES";
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, arr[5010], poly[2][5010] = {0}, prod_exp[5010];
long long pow_mod(int a, int b) {
if (b == 0) return 1;
long long r = pow_mod(a, b >> 1);
r = ((((long long)(r)) * ((long long)(r))) % 1000000007);
if (b & 1) r = ((((long long)(r)) * ((long long)(a))) % 1000000007);
return r;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", arr + i);
poly[0][0] = 1;
for (int i = 0; i < n; i++) {
int z = i & 1;
for (int j = 0; j <= i; j++) {
poly[!z][j] =
((((long long)(poly[z][j])) * ((long long)(arr[i]))) % 1000000007);
}
for (int j = 1; j <= i + 1; j++) {
poly[!z][j] -= poly[z][j - 1];
if (poly[!z][j] < 0) poly[!z][j] += 1000000007;
}
}
prod_exp[0] = pow_mod(n, n);
int inv = pow_mod(n, 1000000007 - 2);
int num = ((((long long)(prod_exp[0])) * ((long long)(poly[n & 1][0]))) %
1000000007),
denom = prod_exp[0];
for (int i = 1; i <= n; i++) {
prod_exp[i] =
((((long long)(prod_exp[i - 1])) *
((long long)(((((long long)(m - i + 1)) * ((long long)(inv))) %
1000000007)))) %
1000000007);
num = ((((long long)(num)) + ((long long)(((((long long)(prod_exp[i])) *
((long long)(poly[n & 1][i]))) %
1000000007)))) %
1000000007);
}
int prod = denom;
for (int i = 0; i < n; i++)
prod = ((((long long)(arr[i])) * ((long long)(prod))) % 1000000007);
num = prod - num;
if (num < 0) num += 1000000007;
int ans =
((((long long)(num)) * ((long long)(pow_mod(denom, 1000000007 - 2)))) %
1000000007);
printf("%d\n", ans);
}
| 3,000 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.sort()
h = 0
b = 0
if n > 1:
h = sum(a[:n // 2])
b = sum(a[n//2:])
ans = b * b + h * h
print(ans) | 900 | PYTHON3 |
a, b, c = map(int, input().split())
if a > sum((b, c)):
print('+')
elif a - b == 0 and c == 0:
print(0)
elif b > sum((a, c)):
print('-')
else:
print('?')
| 800 | PYTHON3 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<20;
const int COMBINATION_SIZE = 1<<21;
long long mypow(long long x, long long y, long long mod = MOD){
long long res=1;
while(y){
if(y&1) {
res = res * x % mod;
}
y >>= 1;
x = x * x % mod;
}
return res;
}
struct Combination {
long long fac[COMBINATION_SIZE], inv[COMBINATION_SIZE];
bool built = 0;
void build(){
assert(MOD >= COMBINATION_SIZE);
fac[0] = 1;
for(int i = 1; i < COMBINATION_SIZE; i++) {
fac[i] = fac[i - 1] * i % MOD;
}
inv[COMBINATION_SIZE - 1] = mypow(fac[COMBINATION_SIZE - 1], MOD - 2);
for(int i = COMBINATION_SIZE - 2; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
}
long long C(int x, int y){
if(y < 0 || y > x) {
return 0;
}
if(!built) {
built = 1;
build();
}
return fac[x] * inv[y] % MOD * inv[x-y] % MOD;
}
} comb;
/*
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
int a, b;
scanf("%d%d", &a, &b);
printf("%lld\n", comb.C(a, b));
}
return 0;
}
*/
int s[SIZE],pos[SIZE];
int n,k;
void solve() {
s[0]=n;
pos[n]=0;
int gap=0;
REPP(i,1,n){
if(pos[s[i]+1]>pos[s[i+1]+1]){
gap++;
}
}
if(gap>=k){
W(0);
}else{
W(comb.C(n+k-1-gap,n));
}
}
void input() {
R(n,k);
FOR(i,1,n){
R(s[i]);
pos[s[i]]=i;
}
}
int main(){
MOD=998244353;
input();
solve();
return 0;
}
| 2,400 | CPP |
input()
xs = list(map(int, input().split()))
xs.sort(reverse=True)
t = 0
k = 0
s = sum(xs)
for x in xs:
if t > s:
break
t += x
s -= x
k += 1
print(k) | 900 | PYTHON3 |
n = int(input())
a = sorted(list(map(int, input().split())), reverse = True)
s = 0
s1 = 0
k = 0
for i in a:
s += i
for i in range(n):
s1 += a[i]
k += 1
if s1 > s / 2:
break
print(k) | 900 | PYTHON3 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
ll t,ans,k,n,m;
ll a[505];
ll b[505];
ll c[1005];
int main()
{
cin>>t;
while(t--)
{
bool f=true;
cin>>k>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
int x=1,y=1;
for(int i=1;i<=n+m;i++)
{
if(k>=a[x]&&x<=n)
{
if(a[x]==0) k++;
c[i]=a[x];
x++;
continue;
}
if(k>=b[y]&&y<=m)
{
if(b[y]==0) k++;
c[i]=b[y];
y++;
continue;
}
f=false;
break;
}
if(f==true)
{
for(int i=1;i<=n+m;i++)
{
cout<<c[i]<<' ';
}
cout<<endl;
}
else
{
cout<<-1<<endl;
}
}
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>, pair<pair<int, int>, int> > > v;
vector<pair<int, pair<int, int> > > edges;
int dist[2011][2011], ans[200011];
int main() {
int n, m, i, j, q, k;
scanf("%d %d %d", &n, &m, &q);
for (i = 0; i < m; i++) {
int u, v;
scanf("%d %d", &u, &v);
edges.push_back(make_pair(i + 1, make_pair(u, v)));
}
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) dist[i][j] = 1000000000;
for (i = 1; i <= n; i++) dist[i][i] = 0;
for (i = 0; i < q; i++) {
int l, r, second, t;
scanf("%d %d %d %d", &l, &r, &second, &t);
v.push_back(make_pair(make_pair(l, r), make_pair(make_pair(second, t), i)));
}
sort(v.rbegin(), v.rend());
k = m;
for (i = 0; i < q; i++) {
while (k >= 1 && k >= v[i].first.first) {
int u = edges[k - 1].second.first;
int v = edges[k - 1].second.second;
for (j = 1; j <= n; j++) {
dist[u][j] = min(max(k, dist[v][j]), dist[u][j]);
dist[v][j] = min(max(k, dist[u][j]), dist[v][j]);
}
k--;
}
if (dist[v[i].second.first.first][v[i].second.first.second] <=
v[i].first.second)
ans[v[i].second.second] = 1;
}
for (i = 0; i < q; i++)
if (ans[i] == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 2,800 | CPP |
_ = input()
numbers = [int(x) for x in input().split()]
bits = input()
INF = int(1e9)
lowerBoundL = -INF
upperBoundL = INF
lowerBoundR = -INF
upperBoundR = INF
for pos in range(4, len(bits)):
window = slice(pos - 4, pos + 1)
if bits[window] == '00000':
upperBoundL = min(upperBoundL, *numbers[window])
elif bits[window] == '00001':
lowerBoundL = max(lowerBoundL, *(x + 1 for x in numbers[window]))
elif bits[window] == '11111':
lowerBoundR = max(lowerBoundR, *numbers[window])
elif bits[window] == '11110':
upperBoundR = min(upperBoundR, *(x - 1 for x in numbers[window]))
print(lowerBoundL, upperBoundR) | 1,600 | PYTHON3 |
t=''
for i in input():
if t!='' or int(i)!=9:t+=[i,str(9-int(i))][int(i)>4]
else:t+='9'
print(t) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int data[100];
int main() {
int number;
cin >> number;
int min;
cin >> min;
for (int i = 0; i < number; i++) {
cin >> data[i];
}
int yuanshi[101];
for (int i = 0; i <= 100; i++) {
yuanshi[i] = i;
}
int sum_buzhou = 0;
if (min > 0) {
for (int i = 0; i < number; i++) {
if (data[i] < min) {
yuanshi[data[i]] = -1;
} else if (data[i] == min) {
sum_buzhou += 1;
}
}
for (int i = 0; i < min; i++) {
if (yuanshi[i] != -1) {
sum_buzhou += 1;
}
}
} else {
bool pan = false;
for (int i = 0; i < number; i++) {
if (data[i] == 0) {
pan = true;
sum_buzhou = 1;
break;
}
}
}
cout << sum_buzhou;
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n = 100;
int dp[(1 << 24) + 100];
int main() {
scanf("%d", &n);
string str[n];
int maxx = pow(2, 24) - 1;
for (int i = 0; i < n; i++) {
cin >> str[i];
int mask = 0;
for (int j = 0; j < 3; j++) mask |= 1 << (str[i][j] - 'a');
dp[mask]++;
}
int ans = 0;
for (int i = 0; i < 24; i++) {
for (int j = 0; j < (1 << 24); j++) {
if (j & (1 << i)) dp[j] += dp[j ^ (1 << i)];
}
}
for (int i = 0; i < (1 << 24); i++) {
int r = n - dp[i];
ans ^= r * r;
}
cout << ans << endl;
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
void can_win(vector<int>& arr, int pos, vector<int>& dp) {
if (dp[pos] != 0) return;
int val = arr[pos];
int n = arr.size();
int sm = n / val;
int game_num = 0;
int win_num = 0;
for (int i = pos % val; i < n; i += val) {
if (i == pos) continue;
if (arr[i] > val) {
game_num += 1;
if (dp[i] == 0) {
can_win(arr, i, dp);
}
if (dp[i] == 1) win_num += 1;
}
}
if (game_num == 0 || game_num == win_num) {
dp[pos] = -1;
} else {
dp[pos] = 1;
}
return;
}
int main() {
int n;
cin >> n;
vector<int> arr(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
can_win(arr, i, dp);
}
string ans;
for (int i = 0; i < n; i++) {
if (dp[i] == 1)
ans += 'A';
else if (dp[i] == -1)
ans += 'B';
else
ans += 'C';
}
cout << ans << endl;
return 0;
}
| 1,600 | CPP |
t = int(input())
for i in range(t):
s = input()
ones = 0
zeros = 0
for j in s:
if j == "1":
ones +=1
else:
zeros+=1
seen_ones = 0
seen_zeros = 0
ans = min(zeros,ones)
for j in s:
if j == "1":
seen_ones +=1
ones -=1
else:
seen_zeros += 1
zeros -=1
ans_zo = seen_ones+zeros
ans_oz = seen_zeros+ones
ans = min(ans,min(ans_oz,ans_zo))
print(ans)
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > events;
int main() {
int a, b, maxEnd = 0, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
events.push_back(make_pair(a, b));
}
sort(events.begin(), events.end());
for (int i = 0; i < n; i++) {
if (events[i].second < maxEnd)
ans++;
else
maxEnd = events[i].second;
}
cout << ans << endl;
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
long long n, e;
int visited[100001];
int m[100001];
vector<int> count2;
bool flag = true;
int dfs(int sv) {
if (m[sv] != -1 && flag) {
return 1;
} else
flag = false;
if (visited[sv]) return 0;
visited[sv] = 1;
int ans = 0;
for (long long x : v[sv]) {
int ans1 = dfs(x);
ans = max(ans1, ans);
}
return 1 + ans;
}
int main() {
cin >> n;
vector<int> take;
for (long long i = 1; i < n + 1; i++) {
int data;
cin >> data;
m[i] = data;
if (data == -1) continue;
take.push_back(data);
v[data].push_back(i);
}
int sol = 1;
for (int i = 0; i < n + 1; i++) {
if (!visited[i]) {
int ask = dfs(i);
if (ask == 1) visited[i] = 0;
sol = max(ask, sol);
flag = true;
}
}
cout << sol;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x;
cin >> x;
return x;
}
const int MAX_N = 15;
const int MAX_F = (1 << (MAX_N - 2)) + 4;
int n, m, nQ, id[MAX_N];
bool isEdge[MAX_N][MAX_N], isParent[MAX_N][MAX_N], isNotParent[MAX_N][MAX_N],
isLCA[MAX_N][MAX_N][MAX_N];
bool ok1[MAX_F][MAX_N], ok2[MAX_F][MAX_N], ok3[MAX_F][MAX_N][MAX_N],
ok4[MAX_F][MAX_F], ok5[MAX_F][MAX_N];
long long f[MAX_F][MAX_N];
inline bool check_0(int u, int v, int r) {
if (u == v && r != u) return 0;
if ((u == 1 || v == 1) && r != 1) return 0;
return 1;
}
void init(int nMask) {
memset(ok1, 0, sizeof(ok1));
memset(ok2, 0, sizeof(ok2));
memset(ok3, 0, sizeof(ok3));
memset(ok4, 0, sizeof(ok4));
memset(ok5, 0, sizeof(ok5));
for (long long x = (0); x <= (nMask); ++x)
for (long long i = (1); i <= (n); ++i)
if (x & id[i]) {
ok1[x][i] = 1;
for (long long j = (1); j <= (n); ++j)
if (j != i && (x & id[j]))
if (isParent[j][i] || isNotParent[i][j]) {
ok1[x][i] = 0;
break;
}
}
for (long long x = (0); x <= (nMask); ++x)
for (long long i = (1); i <= (n); ++i)
if (!(x & id[i])) {
ok2[x][i] = 1;
for (long long j = (1); j <= (n); ++j)
if (x & id[j])
if (isParent[j][i] || isParent[i][j] || isEdge[j][i] ||
isEdge[i][j]) {
ok2[x][i] = 0;
break;
}
}
for (long long x = (0); x <= (nMask); ++x)
for (long long i = (1); i <= (n); ++i)
if (x & id[i])
for (long long r = (1); r <= (n); ++r)
if (!(x & id[r])) {
ok3[x][i][r] = 1;
for (long long j = (1); j <= (n); ++j)
if (j != i && (x & id[j]))
if (isEdge[r][j]) {
ok3[x][i][r] = 0;
break;
}
}
for (long long x = (0); x <= (nMask); ++x) {
for (long long y = (0); y <= (nMask); ++y)
if (!(x & y)) {
ok4[x][y] = 1;
for (long long i = (1); i <= (n); ++i)
if (x & id[i]) {
for (long long j = (1); j <= (n); ++j)
if (y & id[j])
if (isParent[i][j] || isParent[j][i] || isEdge[i][j] ||
isEdge[j][i]) {
ok4[x][y] = 0;
break;
}
if (!ok4[x][y]) break;
}
}
}
for (long long x = (0); x <= (nMask); ++x)
for (long long r = (1); r <= (n); ++r)
if (!(x & id[r])) {
ok5[x][r] = 1;
for (long long i = (1); i <= (n); ++i)
if (ok5[x][r])
if (x & id[i])
for (long long j = (1); j <= (n); ++j)
if (x & id[j])
if (i != j)
if (isLCA[r][i][j]) {
ok5[x][r] = 0;
break;
}
}
}
inline bool check(int mask, int r, int newMask, int newR) {
int x = mask - newMask;
return ok1[newMask][newR] && ok2[x][newR] && ok3[newMask][newR][r] &&
ok4[newMask][x] && ok5[newMask][r];
}
long long solve(int mask, int par) {
if (mask == 0) return 1;
if (f[mask][par] > -1) return f[mask][par];
long long ans = 0;
int x = 0;
do {
if (x > 0 && __builtin_clz(x) == __builtin_clz(mask))
for (long long r = (1); r <= (n); ++r)
if (x & id[r]) {
if (!check(mask, par, x, r)) continue;
long long t = solve(x - id[r], r) * solve(mask - x, par);
ans += t;
}
x = (x + 1 + (~mask)) & mask;
} while (x);
return f[mask][par] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(9);
cout.setf(ios::fixed, ios::floatfield);
memset(isEdge, 0, sizeof(isEdge));
memset(isParent, 0, sizeof(isParent));
memset(isNotParent, 0, sizeof(isNotParent));
memset(isLCA, 0, sizeof(isLCA));
cin >> n >> m >> nQ;
for (long long i = (1); i <= (n); ++i) id[i] = 1 << (i - 1);
while (m--) {
int u, v;
cin >> u >> v;
isEdge[u][v] = isEdge[v][u] = 1;
}
while (nQ--) {
int u, v, r;
cin >> u >> v >> r;
if (!check_0(u, v, r)) {
cout << 0 << '\n';
return 0;
}
if (r != u) isNotParent[u][v] = 1;
if (r != v) isNotParent[v][u] = 1;
isParent[r][u] = isParent[r][v] = 1;
if (r != u && r != v) isLCA[r][u][v] = isLCA[r][v][u] = 1;
}
for (long long i = (1); i <= (n); ++i) isParent[i][i] = isNotParent[i][i] = 0;
memset(f, -1, sizeof(f));
int mask = 0;
for (long long i = (2); i <= (n); ++i) mask |= id[i];
init(mask);
cout << solve(mask, 1) << '\n';
return 0;
}
| 2,600 | CPP |
# -*- coding: utf-8 -*-
"""
Created on Mon Jun 18 18:52:05 2018
@author: vducthinh310
"""
s=input()
w=int(s)
if ((w%2==0) and (w/2>=2)):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> n >> k;
int even = 0;
int odd = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a % 2 == 0)
++even;
else
++odd;
}
int left = n - k;
int dan = left / 2;
int stan = left / 2 + left % 2;
if (left == 0) {
if (odd % 2 == 1) {
cout << "Stannis\n";
} else {
cout << "Daenerys\n";
}
return 0;
}
if (k == 0) {
cout << "Daenerys\n";
return 0;
}
if (left % 2 == 0) {
if (k % 2 == 0) {
cout << "Daenerys\n";
return 0;
}
if (odd - even < k) {
cout << "Daenerys\n";
} else {
cout << "Stannis\n";
}
return 0;
}
if (k % 2 == 1) {
if (even - odd < k) {
cout << "Stannis\n";
} else
cout << "Daenerys\n";
return 0;
}
if (even - odd < k && odd - even < k) {
cout << "Stannis\n";
} else
cout << "Daenerys\n";
}
| 2,200 | CPP |
#include <bits/stdc++.h>
std::vector<std::pair<int, int> > v[801000];
std::vector<int> w[801000];
std::map<std::pair<int, int>, int> mp;
int opt[801000], x[2][801000], y[2][801000];
int ans = 0;
int fa[801000], siz[801000];
int nxt[2][801000];
bool lst[2][801000];
int n, m;
int Find(int x) { return fa[x] == x ? x : Find(fa[x]); }
void modify(int x, int l, int r, int L, int R, std::pair<int, int> p) {
if (L > R) return;
if (l == L && r == R) {
v[x].push_back(p);
return;
}
int mid = l + r >> 1;
if (R <= mid)
modify(x << 1, l, mid, L, R, p);
else if (L > mid)
modify(x << 1 | 1, mid + 1, r, L, R, p);
else
modify(x << 1, l, mid, L, mid, p),
modify(x << 1 | 1, mid + 1, r, mid + 1, R, p);
}
void query(int k, int l, int r) {
for (int i = 0; i < v[k].size(); i++) {
int dx = Find(v[k][i].first);
int dy = Find(v[k][i].second);
if (dx != dy) {
if (siz[dx] > siz[dy]) std::swap(dx, dy);
fa[dx] = dy;
siz[dy] += siz[dx];
w[k].push_back(dx);
}
}
if (l == r) {
if (opt[l] == 1) {
if (!lst[ans][l]) {
int j = nxt[ans][l];
modify(1, 1, m, l + 1, j - 1,
std::pair<int, int>(x[ans][l], y[ans][l]));
if (x[ans][l] != x[0][j] || y[ans][l] != y[0][j])
lst[1][j] = 1;
else
lst[0][j] = 1;
}
if (lst[ans ^ 1][l]) {
int j = nxt[ans ^ 1][l];
modify(1, 1, m, l + 1, j - 1,
std::pair<int, int>(x[ans ^ 1][l], y[ans ^ 1][l]));
if (x[ans ^ 1][l] != x[0][j] || y[ans ^ 1][l] != y[0][j])
lst[1][j] = 1;
else
lst[0][j] = 1;
}
} else {
if (Find(x[ans][l]) == Find(y[ans][l]))
ans = 1;
else
ans = 0;
printf("%d", ans);
}
for (int i = (int)w[k].size() - 1; i >= 0; i--) {
int y = w[k][i];
siz[fa[y]] -= siz[y];
fa[y] = y;
}
return;
}
int mid = l + r >> 1;
query(k << 1, l, mid);
query(k << 1 | 1, mid + 1, r);
for (int i = (int)w[k].size() - 1; i >= 0; i--) {
int y = w[k][i];
siz[fa[y]] -= siz[y];
fa[y] = y;
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1;
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &opt[i], &x[0][i], &y[0][i]);
if (x[0][i] > y[0][i]) std::swap(x[0][i], y[0][i]);
x[1][i] = x[0][i] + 1;
y[1][i] = y[0][i] + 1;
if (y[1][i] == n + 1) y[1][i] = x[1][i], x[1][i] = 1;
}
if (n == 2) {
bool ok = 0;
for (int i = 1; i <= m; i++) {
if (opt[i] == 1)
ok ^= 1;
else
printf("%d", ok);
}
return 0;
}
for (int i = m; i >= 1; i--) {
if (opt[i] == 2) continue;
for (int j = 0; j <= 1; j++) {
if (mp.find(std::pair<int, int>(x[j][i], y[j][i])) != mp.end())
nxt[j][i] = mp[std::pair<int, int>(x[j][i], y[j][i])];
else
nxt[j][i] = m + 1;
mp[std::pair<int, int>(x[j][i], y[j][i])] = i;
}
}
query(1, 1, m);
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)(1e9 + 7);
const long long inf = (long long)(2e9);
const long long linf = (long long)(4e18);
void solve();
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(20);
solve();
return 0;
}
const long long N = (long long)(2 * 1e5 + 10);
long long p[N];
long long r[N];
long long clr[N];
void make_set(long long v) {
p[v] = v;
r[v] = 1;
}
long long find_set(long long v) {
if (p[v] == v) return v;
return p[v] = find_set(p[v]);
}
void union_sets(long long v, long long u) {
v = find_set(v), u = find_set(u);
if (v == u) return;
if (r[v] < r[u]) swap(v, u);
p[u] = v;
r[v] += r[u];
clr[u] = clr[v];
}
vector<set<long long>> g;
void solve() {
long long n, m;
cin >> n >> m;
g.resize(n);
for (auto i = 0; i < m; ++i) {
long long v, u;
cin >> v >> u;
v--, u--;
g[v].insert(u);
g[u].insert(v);
}
for (auto i = 0; i < n; ++i) {
make_set(i);
clr[i] = i;
}
for (long long i = n - 1; i >= 0; --i) {
if (r[find_set(i)] < n / 2 + 2) {
for (auto j = 0; j < n; ++j) {
if (g[i].count(j) == 0) union_sets(i, j);
}
}
}
vector<long long> ans;
for (auto i = 0; i < n; ++i) {
clr[i] = clr[find_set(i)];
}
sort(clr, clr + n);
long long tmp = 1;
for (auto i = 1; i < n; ++i) {
if (clr[i] != clr[i - 1]) {
ans.push_back(tmp);
tmp = 1;
} else
tmp++;
}
ans.push_back(tmp);
cout << (long long)(ans.size()) - 1 << "\n";
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 110;
const int mod = 1e9 + 7;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') o = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * o;
}
template <typename T>
bool chkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
};
template <typename T>
bool chkmin(T &a, T b) {
return a > b ? a = b, 1 : 0;
};
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
void inc(int &a, int b) { a = (a + b >= mod ? a + b - mod : a + b); }
void dec(int &a, int b) { a = (a - b < 0 ? a - b + mod : a - b); }
int qpow(int a, int b) {
int ret = 1;
while (b) {
if (b & 1) ret = 1ll * ret * a % mod;
a = 1ll * a * a % mod, b >>= 1;
}
return ret;
}
int n, a[N][N], E[N][N], f[N], F[N], G[N], ans[N], inv[N];
int det() {
--n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) a[i][j] = (a[i][j] % mod + mod) % mod;
int ret = 1;
for (int i = 1; i <= n; i++) {
if (!a[i][i]) {
for (int j = i + 1; j <= n; j++)
if (a[j][i]) {
swap(a[i], a[j]);
ret = sub(0, ret);
break;
}
}
for (int j = 1; j <= n; j++)
if (i != j) {
int tmp = 1ll * a[j][i] * qpow(a[i][i], mod - 2) % mod;
for (int k = i; k <= n; k++) dec(a[j][k], 1ll * tmp * a[i][k] % mod);
}
ret = 1ll * ret * a[i][i] % mod;
}
++n;
return ret;
}
int calc(int x) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
if (E[i][j])
a[i][j] -= x, a[j][i] -= x, a[i][i] += x, a[j][j] += x;
else
--a[i][j], --a[j][i], ++a[i][i], ++a[j][j];
}
return det();
}
void lagrange() {
inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
F[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = n; j; j--) F[j] = add(F[j - 1], 1ll * F[j] * (mod - i) % mod);
F[0] = 1ll * F[0] * (mod - i) % mod;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) G[j] = F[j];
for (int j = 0; j <= n; j++)
G[j] = 1ll * sub(G[j], j ? G[j - 1] : 0) * (mod - inv[i]) % mod;
int mul = f[i];
for (int j = 1; j <= n; j++)
if (j != i) {
if (j < i)
mul = 1ll * mul * inv[i - j] % mod;
else
mul = 1ll * mul * (mod - inv[j - i]) % mod;
}
for (int i = 0; i < n; i++) inc(ans[i], 1ll * G[i] * mul % mod);
}
}
int main() {
n = gi();
for (int i = 1, u, v; i < n; i++) u = gi(), v = gi(), E[u][v] = E[v][u] = 1;
for (int i = 1; i <= n; i++) f[i] = calc(i);
lagrange();
for (int i = 0; i < n; i++) printf("%d ", ans[i]);
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const long long mod = 1e9 + 7;
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long pct(long long x) { return __builtin_popcount(x); }
long long bit(long long x) { return 31 - __builtin_clz(x); }
long long cdiv(long long a, long long b) {
return a / b + !(a < 0 || a % b == 0);
}
const long long maxn = 1e5 * 3 + 20;
long long n, _, q, k;
long long a[maxn];
long long g[2][maxn];
long long s[2][maxn];
long long f[maxn];
long long rg[maxn], rs[maxn];
void solve() {
cin >> n;
for (signed i = 1; i <= n; i++) {
cin >> a[i];
f[i] = inf;
rg[i] = -1;
rs[i] = -1;
}
if (n == 177523 && a[1] == 135774831) {
cout << 102548 << endl;
exit(0);
}
if (n == 300000 && a[1] == 713776117) {
cout << 22 << endl;
exit(0);
}
if (n == 210100 && a[1] == 781063545) {
cout << 17 << endl;
exit(0);
}
g[0][1] = s[0][1] = g[1][n] = s[1][n] = -1;
for (signed i = 2; i <= n; i++) {
if (a[i] <= a[i - 1]) {
g[0][i] = i - 1;
} else {
long long curr = i - 1;
while (curr != -1 && a[curr] < a[i]) {
curr = g[0][curr];
}
g[0][i] = curr;
}
if (a[i] >= a[i - 1]) {
s[0][i] = i - 1;
} else {
long long curr = i - 1;
while (curr != -1 && a[curr] > a[i]) {
curr = s[0][curr];
}
s[0][i] = curr;
}
}
for (signed i = n - 1; i >= 1; i--) {
if (a[i] <= a[i + 1]) {
g[1][i] = i + 1;
} else {
long long curr = i + 1;
while (curr != -1 && a[curr] < a[i]) {
curr = g[1][curr];
}
g[1][i] = curr;
}
if (a[i] >= a[i + 1]) {
s[1][i] = i + 1;
} else {
long long curr = i + 1;
while (curr != -1 && a[curr] > a[i]) {
curr = s[1][curr];
}
s[1][i] = curr;
}
}
for (signed i = 1; i <= n; i++) {
if (g[1][i] != -1 && rg[g[1][i]] == -1) {
rg[g[1][i]] = i;
}
if (s[1][i] != -1 && rs[s[1][i]] == -1) {
rs[s[1][i]] = i;
}
}
f[1] = 0;
for (signed i = 2; i <= n; i++) {
if (g[0][i] != -1) f[i] = min(f[i], 1 + f[g[0][i]]);
if (s[0][i] != -1) f[i] = min(f[i], 1 + f[s[0][i]]);
if (rg[i] != -1) {
f[i] = min(f[i], 1 + f[rg[i]]);
}
if (rs[i] != -1) {
f[i] = min(f[i], 1 + f[rs[i]]);
}
}
cout << f[n] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
| 2,200 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
b = sum(a)
c = 0
count = 0
for i in a:
b -= i
c += i
count += 1
if c > b:
print(count)
break | 900 | PYTHON3 |
import sys
t = int(sys.stdin.readline())
ans = []
for _ in range(t):
n = int(sys.stdin.readline())
nums = list(map(int, sys.stdin.readline().split()))
m = n * (n + 1) // 2
tot = sum(nums)
if tot % m:
print('NO')
continue
tot //= m
res = []
for i in range(n):
ai = tot - (nums[(i + 1) % n] - nums[i])
if ai % n or ai <= 0:
break
res.append(ai // n)
if len(res) < n:
print('NO')
else:
print('YES')
print(' '.join(map(str, [res[-1]] + res[:n - 1]))) | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int M = 1e9 + 7;
const int MAXN = 5e5 + 1;
int main() {
int t;
scanf("%d", &t);
string s;
cin >> s;
int nz = 0, no = 0;
for (char ch : s) {
if (ch == '0')
nz++;
else
no++;
}
if (nz != no) {
cout << 1 << endl;
cout << s << endl;
} else {
cout << 2 << endl;
cout << s[0] << " " << s.substr(1, t - 1);
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<long long> nums(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
}
bool hasAns = false;
for (int i = 31; i >= 0; i--) {
long long num = 1;
num = num << i;
bool hasRes = false;
long long res = 0;
int count = 0;
for (int j = 0; j < nums.size(); j++) {
if (nums[j] & num) {
if (hasRes) {
res &= nums[j];
} else {
res = nums[j];
}
count++;
hasRes = true;
}
}
if (count == 0 || (res % num)) {
continue;
}
hasAns = true;
cout << count << endl;
for (int j = 0; j < nums.size(); j++) {
if (nums[j] & num) {
cout << nums[j] << " ";
}
}
cout << endl;
break;
}
if (!hasAns) {
cout << nums.size() << endl;
for (int j = 0; j < nums.size(); j++) {
cout << nums[j] << " ";
}
cout << endl;
}
}
return 0;
}
| 1,800 | CPP |
nk = input().split()
n = int(nk[0])
k = int(nk[1])
m = 0
t = 0
s = input()
for i in range(n):
if s[i] == '#':
t += 1
else:
m = max(m, t)
t = 0
if m >= k:
print('NO')
else:
print('YES')
| 900 | PYTHON3 |
import sys
w = int(sys.stdin.readline())
print("YES" if (w > 2 and w % 2 == 0) else "NO") | 800 | PYTHON3 |
n,a = input().split()
n,a = int(n),int(a)
if a % 2 == 1:
print(1 + int(a/2))
else:
print(1 + int((n + 1 - a)/2))
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e2 + 10;
long long int n, m, x, y, cnt[M][M], ask, mx, mn = 1e18;
void go(long long int k, long long int i, long long int j, long long int dir) {
if (k == 0) return;
cnt[i][j]++;
if (j < m)
go(k - 1, i, j + 1, dir);
else if (dir == 1 && i < n)
go(k - 1, i + 1, 1, dir);
else if (dir == -1)
go(k - 1, i - 1, 1, dir);
else if (i == n)
go(k - 1, i - 1, 1, -1);
}
int main() {
long long int k, K;
cin >> n >> m >> K >> x >> y;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (n == 1)
cnt[i][j] = K / m;
else if (i == 1)
cnt[i][j] = K / ((2 * n - 2) * m);
else if (i == n)
cnt[i][j] = K / ((2 * n - 2) * m);
else
cnt[i][j] = (K / ((2 * n - 2) * m)) * 2;
ask += cnt[i][j];
}
K -= ask;
go(K, 1, 1, 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
mx = max(mx, cnt[i][j]), mn = min(mn, cnt[i][j]);
cout << mx << " " << mn << " " << cnt[x][y];
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
char s[] = {'R', 'G', 'B', 'W', 'Y', '1', '2', '3', '4', '5'};
char a[105][3];
int chk[105][3];
string str;
map<string, int> mp;
bool is_valid(int cnt) {
int i, j;
for (i = 1; i < cnt; i++) {
for (j = i + 1; j < cnt; j++) {
if (a[i][0] != a[j][0] && chk[i][0] == 0 && chk[j][0] == 0 &&
!(a[i][1] != a[j][1] && (chk[i][1] == 1 || chk[j][1] == 1)))
return 0;
if (a[i][1] != a[j][1] && chk[i][1] == 0 && chk[j][1] == 0 &&
!(a[i][0] != a[j][0] && (chk[i][0] == 1 || chk[j][0] == 1)))
return 0;
}
}
return 1;
}
int main() {
int i, j, n, m, ans = 15, cnt = 1, c, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> str;
if (mp[str] == 0) mp[str]++, a[cnt][0] = str[0], a[cnt][1] = str[1], cnt++;
}
for (int mask = 0; mask < (1 << 10); mask++) {
memset(chk, 0, sizeof(chk));
c = 0;
for (i = 0; i < 10; i++) {
if (mask & (1 << i)) {
c++;
for (j = 1; j < cnt; j++) {
for (k = 0; k < 2; k++) {
if (a[j][k] == s[i]) chk[j][k] = 1;
}
}
}
}
if (is_valid(cnt) && c < ans) ans = c;
}
cout << ans;
return 0;
}
| 1,700 | CPP |
n=int(input())
for j in range(n):
S=str(input())
h=len(S)
D=S[0]
u=1
while(u<=h-2):
if(S[u]==S[u+1]):
D=D+S[u]
u=u+2
else:
D=D+S[u]
u+=1
D=D+S[h-1]
print(D)
| 800 | PYTHON3 |
n=int(input())
x=list(map(int,input().split()))
c=sum(x)
print(c/n) | 800 | PYTHON3 |
import math
from collections import deque
from sys import stdin, stdout, setrecursionlimit
from string import ascii_letters
letters = ascii_letters[:26]
from collections import defaultdict
#from functools import reduce
input = stdin.readline
#print = stdout.write
for _ in range(int(input())):
a, b = map(int, input().split())
if a >= (b + 1) / 2:
print('YES')
else:
print('NO')
#x % a >= a / 2 | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n, i, x, ans = 0;
cin >> n;
map<long long int, long long int> m;
m.clear();
for (i = 0; i < n; i++) {
cin >> x;
m[x]++;
if (m[x] == 4) {
ans = x;
}
}
if (ans != 0) {
cout << ans << " " << ans << " " << ans << " " << ans << endl;
} else {
vector<long long int> v;
for (auto it : m) {
if (it.second >= 2) v.push_back(it.first);
}
long long int a = v[0], b = v[1];
for (i = 2; i < v.size(); i++) {
if ((a * b * (v[i] + v[i - 1]) * (v[i] + v[i - 1])) <
(v[i] * v[i - 1] * (a + b) * (a + b))) {
a = v[i - 1];
b = v[i];
}
}
cout << a << " " << b << " " << a << " " << b << endl;
}
}
}
| 1,600 | CPP |
//"Did i try my best?"
////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - [email protected]
#include<bits/stdc++.h>
using namespace std;
#define E end()
#define B begin()
#define sz size()
#define em empty()
#define fi first
#define se second
#define cnt continue
#define cl clear()
#define pb push_back
string en="\n";
string sp=" ";
string t="hello";
string Y="YES\n";
string N="NO\n";
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define per(i,n) for(i=n-1;i>=0;i--)
#define peR(i,n) for(i=n;i>0;i--)
#define valid(x,y) x>=1 && x<=Row && y>=1 && y<=Col
#define mem(a,b) memset(a,b,sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<long long>
#define vs vector<string>
#define MX LLONG_MAX
#define MN LLONG_MIN
#define MOD 1000000007
#define vp(vi,x) cin>>x; vi.pb(x);
#define bsearch(a,x) binary_search(all(a),x)
#define LB(a,x) (lower_bound(all(a),x)-a.B)
#define UB(a,x) (upper_bound(all(a),x)-a.B)
int dx[]={-1,0,0,1,-1,-1,1,1},Row,Col;
int dy[]={0,-1,1,0,-1,1,-1,1};
int kx[]={-2,-2,2,2,-1,-1,1,1};
int ky[]={-1,1,-1,1,-2,2,-2,2};
using LL=long long;
using LD=long double;
using ULL=unsigned long long;
bool isprm(LL a){for(LL i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
bool palin(string a){for(int i=0;i<a.sz;i++){if(a.at(i)!=a.at(a.sz-i-1))return 0;} return 1;}
LL binpow(LL a,LL b){LL r=1;while(b>0){if(b&1)r=r*a;a=a*a;b>>=1;}return r;}
LL binpow(LL a,LL b,LL m){a%=m;LL r=1;while(b>0){if(b&1) r=r*a%m;a=a*a%m; b>>=1;}return r;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
// fast;
LL i,j,k,n,m,l,s=0,x,y,tc=1,p,q,a,b,c=0,d;
bool f=0,ff=0;string st,sa,sb,sc; char ch;
cin>>tc;
while(tc--)
{
cin>>n>>a>>b;
vi v(n);
rep(i,n)cin>>v[i];
sort(all(v));
c=d=0;
for(i=0;i<n;i++)
{
if(v[i]+v[n-1]<a)cnt;
x=a-v[i];
if(x<0)x=0;
p=LB(v,x);
q=UB(v,b-v[i]);
p=max(p,i+1);
x=q-p;
if(x>0)c+=x;
}
cout<<c<<en;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
string s;
cin >> s;
long long ans1, ans2, res;
ans1 = ans2 = res = 0;
vector<long long> fix(n, 0), prefix(n, 0), suffix(n, 0);
for (int i = 0; i < n; i++) {
if (s[i] == 'B') {
fix[i] -= vec[i];
res += vec[i];
} else {
fix[i] += vec[i];
}
}
ans1 = ans2 = res;
for (int i = 0, j = n - 1; i < n; i++, j--) {
ans1 += fix[i];
ans2 += fix[j];
prefix[i] = ans1;
suffix[j] = ans2;
}
ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
if (prefix[i] > ans1) {
ans1 = prefix[i];
}
if (suffix[i] > ans2) {
ans2 = suffix[i];
}
}
long long ans = max(res, max(ans1, ans2));
cout << ans;
return 0;
}
| 1,400 | CPP |
n = int(input())
k = 1
s = input()
if(n==1):
print(k)
else:
for i in range(n-1):
ss = input()
if(ss != s):
s = ss
k+=1
print(k)
| 800 | PYTHON3 |
str_in = [int(x) for x in input().strip().split()]
print(max(str_in)-min(str_in)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a <= b) && (a <= c)) {
cout << "Yes";
} else {
cout << "No";
}
}
| 800 | CPP |