solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
from math import *
import sys
input = sys.stdin.buffer.readline
a = int(input())
for x in range(a):
b,c,d = map(int,input().split())
if c == 0:
print(0)
elif c == b:
print(0)
else:
k = b//d
if c > k:
t = c-k
n = ceil(t/(d-1))
print(k-n)
else:
print(c)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e;
int main() {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
printf("%d", min(a, min(b, min(c / 2, min(d / 7, e / 4)))));
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 17;
int N, Q;
int main() {
ios_base::sync_with_stdio(false);
cin >> Q;
while (Q--) {
cin >> N;
long long mx;
cin >> mx;
long long diff = 0;
while (--N) {
long long x;
cin >> x;
mx = max(mx, x);
diff = max(diff, mx - x);
}
long long ans = 0;
while (diff) {
ans++;
diff >>= 1;
}
cout << ans << endl;
}
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 3e5 + 10;
int n, q, a[M], dp[M][21], last[21];
int main(int argc, char const *argv[]) {
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 0; i <= 20; i++) dp[n + 1][i] = n + 1, last[i] = n + 1;
for (int i = n; i >= 1; i--) {
for (int j = 0; j <= 20; j++) dp[i][j] = n + 1;
for (int j = 0; j <= 20; j++)
if ((a[i] >> j) & 1) {
dp[i][j] = i;
for (int k = 0; k <= 20; k++) dp[i][k] = min(dp[i][k], dp[last[j]][k]);
last[j] = i;
}
}
while (q--) {
int flag = 0, x, y;
scanf("%d%d", &x, &y);
for (int i = 0; i <= 20; i++)
if ((a[y] >> i) & 1 && dp[x][i] <= y) {
flag = 1;
break;
}
if (flag)
printf("Shi\n");
else
printf("Fou\n");
}
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dis[233333], dis2[233333], f[233333], dep[233333], hed[233333];
int a;
int x, y, k, n, m;
struct edge {
int f, to, val, nxt;
} e[233333 << 1];
void ADD_edge(int x, int y, int k) {
e[a].f = x;
e[a].nxt = hed[x];
e[a].to = y;
e[a].val = k;
hed[x] = a++;
}
void updata(int id, int k) {
if (id < n) {
dis2[e[id].to] = k;
}
int v = e[id].f;
e[id].val = k;
int tmp = 0x3f3f3f3f;
while (v != 1) {
for (int i = hed[v]; ~i; i = e[i].nxt) {
int w = e[i].to;
if (w == 1) tmp = e[i].val;
if (dep[w] < dep[v]) continue;
tmp = min(tmp, dis[w] + e[i].val);
}
if (tmp == dis[v]) {
break;
} else {
dis[v] = tmp;
v = f[v];
}
}
}
void dfs(int n) {
for (int i = hed[n]; ~i; i = e[i].nxt) {
int v = e[i].to;
if (dep[v] > 0) continue;
dep[v] = dep[n] + 1;
dis2[v] = e[i].val;
dfs(v);
dis[n] = min(dis[v] + e[i].val, dis[n]);
}
}
int quear(int x, int y) {
int ans = 0;
int v = y;
if (dep[x] <= dep[y]) {
while (dep[x] < dep[v]) {
ans += dis2[v];
v = f[v];
}
if (x == v) {
return ans;
}
}
while (v != 1) {
ans += dis2[v];
v = f[v];
}
return dis[x] + ans;
}
int main() {
a = 1;
cin >> n >> m;
memset((dis), (0x3f), sizeof(dis));
memset((hed), (-1), sizeof(hed));
memset((f), (-1), sizeof(f));
dis[1] = 0;
dep[1] = 1;
for (int(i) = 0; (i) < n - 1; (i)++) {
scanf("%d%d%d", &x, &y, &k);
f[y] = x;
ADD_edge(x, y, k);
}
for (int(i) = 0; (i) < n - 1; (i)++) {
scanf("%d%d%d", &x, &y, &k);
dis[x] = k;
ADD_edge(x, y, k);
}
dfs(1);
for (int(i) = 0; (i) < m; (i)++) {
scanf("%d%d%d", &x, &y, &k);
if (x == 1) {
updata(y, k);
} else {
printf("%d\n", quear(y, k));
}
}
}
| 2,100 | CPP |
#include <bits/stdc++.h>
int main() {
int i, n, a[100000], day = 0, max = 0, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] > max) {
t = a[i];
a[i] = max;
max = t;
}
if (max == i + 1)
day++;
else
continue;
}
printf("%d", day);
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n, m, sum = 0;
double x, y;
cin >> n >> m >> x >> y;
char a[n][m];
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) cin >> a[i][j];
}
if (n == 1 && m == 1) {
if (a[0][0] == '.')
cout << x << "\n";
else
cout << 0 << "\n";
} else if (m == 1) {
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
if (a[i][j] == '.') sum = sum + x;
}
}
cout << sum << "\n";
} else {
if (y / 2 < x) {
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
if (a[i][j] == '.' && j != m - 1) {
if (a[i][j + 1] == '.') {
sum = sum + y;
j++;
} else
sum = sum + x;
} else {
if (a[i][j] == '.') sum = sum + x;
}
}
}
cout << sum << "\n";
} else {
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
if (a[i][j] == '.') sum = sum + x;
}
}
cout << sum << "\n";
}
}
}
}
| 1,000 | CPP |
a = int(input())
b = list(map(int, input().split()))
for i in range(len(b)):
if b[i] % 2 != 0:
print(b[i])
else:
print(b[i] - 1) | 800 | PYTHON3 |
n = input()
num = list(map(int, input().split()))
prev = 0
count = 0
acount = 0
for i in num:
if i > prev:
acount += 1
elif acount > count:
count = acount
acount = 1
else:
acount=1
prev = i
if acount>count:
count = acount
print(count)
| 800 | PYTHON3 |
st = str(input())
if 'H' in st or 'Q' in st or '9' in st:
print("YES")
else:
print("NO") | 900 | PYTHON3 |
t = int(input())
has = {1:45, 2: 40, 3:45, 4: 40, 5: 25, 6:40, 7: 45, 8: 40, 9: 45}
for _ in range(t):
n, m = [int(x) for x in input().split()]
k = n//m
rec = k%10
digit = m%10
if digit == 0:
print(0)
continue
k = k//10
count = has[digit]*(k)
i = 1
while i <= rec:
count += (digit*i)%10
i += 1
print(count)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int m, n, ll[200005], rr[200005], Index[200005];
bool Useful[200005];
bool cmp(int x, int y) { return ll[x] < ll[y]; }
bool maximize(int &a, int b) {
if (a < b)
a = b;
else
return false;
return true;
}
int main() {
scanf("%d%d", &m, &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &ll[i], &rr[i]);
for (int i = 1; i <= n; i++) Index[i] = i, rr[i] += ll[i] - 1;
sort(Index + 1, Index + n + 1, cmp);
int pos = 1, Accepted = 1, Answer = n;
while (pos <= n) {
int Current = Accepted - 1, d = 0;
while (pos <= n && ll[Index[pos]] <= Accepted) {
if (maximize(Current, rr[Index[pos]])) d = Index[pos];
pos++;
}
if (d != 0) {
Useful[d] = true, Answer--;
}
Accepted = max(Current + 1, Accepted + 1);
}
cout << Answer << endl;
for (int i = 1; i <= n; i++)
if (!Useful[i]) printf("%d ", i);
printf("\n");
}
| 2,100 | CPP |
def intersect(x1,y1,x2,y2,x3,y3,x4,y4):
x,y,xi,yi=0,0,0,0
if (x3<=x2 and x4>=x1) and (y3<=y2 and y4>=y1):
x,xi=max(x1,x3),min(x2,x4)
y,yi=max(y1,y3),min(y2,y4)
return x,y,xi,yi
def bw(x,y,xi,yi):
b=0
w=0
l=xi-x+1
h=yi-y+1
b,w=(l*h)//2,(l*h)//2
if (l*h)&1:
if (x+y)&1:
b+=1
else:
w+=1
if x==0:
b,w=0,0
return b,w
for _ in range(int(input())):
n,m=map(int,input().split())
x1,y1,x2,y2=map(int,input().split())
x3,y3,x4,y4=map(int,input().split())
x1i,y1i,x2i,y2i=intersect(x1,y1,x2,y2,x3,y3,x4,y4)
b,w=bw(1,1,n,m)
bi,wi=bw(x1i,y1i,x2i,y2i)
b1,w1=bw(x1,y1,x2,y2)
b2,w2=bw(x3,y3,x4,y4)
dw=b1-bi-w2
db=-b1+bi+w2
print(w+dw,b+db) | 1,500 | PYTHON3 |
# from math import pow,sqrt
# result=[]
# for i in range(int(input())):
# n=int(input())
# ls=[int(x) for x in input().split()]
# count=0
# for i in range(n):
# for val in ls[i+1:]:
# value=val+ls[i]
# sqr=sqrt(value)
# if sqr-int(sqr)==0:
# count+=1
# else:
# cube = round(pow(value, 1. / 3.))
# if cube**3==value:
# count+=1
# result.append(count)
# for value in result:
# print(value)
#
#
'''SNAKE'''
n,m=[int(x) for x in input().split()]
count=m
for i in range(1,n+1):
for j in range(1,m+1):
if i%2!=0:
print('#',end='')
elif i%2==0:
if j==count:
print('#',end='')
if j==m:
if count==m:
count=1
else:
count=m
else:
print('.',end='')
print()
| 800 | PYTHON3 |
n = int(input())
data = list(map(int,input().split()))
print(max(0,n-data.count(max(data))-data.count(min(data))))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mo = 998244353;
long long jc[1000005], n, ans;
long long poww[1000005], powwn[1000005];
inline long long ksmm(long long x, long long p) {
long long res = 1;
while (p) {
if (p & 1) res = (res * x) % mo;
x = (x * x) % mo;
p >>= 1;
}
return res % mo;
}
inline long long inv(long long x) { return ksmm(x, mo - 2) % mo; }
inline long long ksm(long long x, long long p) {
if (p >= 0)
return ksmm(x, p) % mo;
else
return inv(ksmm(x, -p)) % mo;
}
inline long long C(long long x, long long n) {
return ((jc[n] * inv(jc[x])) % mo * inv(jc[n - x])) % mo;
}
signed main() {
scanf("%lld", &n);
n++;
n--;
jc[0] = 1;
jc[1] = 1;
for (register long long i = 2; i <= n; i++) jc[i] = (jc[i - 1] * i) % mo;
for (register long long i = 1; i <= n; i++) poww[i] = ksm(3, i) % mo;
powwn[0] = 1;
for (register long long i = 1; i <= n; i++)
powwn[i] = (powwn[i - 1] * poww[n]) % mo;
ans = 0;
for (register long long i = 1, sig = 1; i <= n; i++, sig = -sig) {
ans = (ans + C(i, n) * sig * poww[i] % mo * powwn[n - i]) % mo;
}
ans = (ans * 2) % mo;
ans = (ans + mo) % mo;
long long t = 0;
for (register long long i = 1, sig = -1; i <= n; i++, sig = -sig) {
t = (t + (C(i, n) * ksm(3, -i * n)) % mo * sig *
(ksm(((1 - ksm(3, -n + i) % mo) % mo + mo) % mo, n) - 1) %
mo) %
mo;
}
ans = ans + ((-1) * ksm(3, n * n + 1) * t) % mo;
ans = (ans % mo + mo) % mo;
printf("%lld", ans);
return 0;
}
| 2,500 | CPP |
length = list(map(int, input().split()))
Array = list(map(int, input().split()))
def countNeg(nums):
count = 0
for a in nums:
if(a<0):
count+=1
return count
coins = 0
Zeros = False
for a in Array:
if(a>1):
coins = coins+a-1
a = a-(a-1)
elif (a<-1):
coins = coins+(a+1)*-1
a = a+((a+1)*-1)
elif (a==0):
Zeros = True
coins = coins+1
a = 1
if(countNeg(Array)%2!=0 and not Zeros):
coins+=2
print(coins)
| 900 | PYTHON3 |
n = int(input())
rods = []
s = input()
for l in s.split():
rods.append(int(l))
rods = sorted(rods)
print(rods[-1] - sum(rods[:-1]) + 1)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MN = 1e5 + 10;
long long h[MN];
int pai[MN], k[MN];
void printAns(int pos) {
if (pos != -1) {
printAns(pai[pos]);
printf("%d ", pos);
}
}
int main() {
int n, d;
cin >> n >> d;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
k[i] = 1;
pai[i] = -1;
}
for (int i = 1; i <= n; ++i) {
for (int j = max(1, i - 200); j < i; ++j) {
if (abs(h[i] - h[j]) >= d && k[i] < k[j] + 1) {
k[i] = k[j] + 1;
pai[i] = j;
}
}
}
int ans = -1, pos;
for (int i = 1; i <= n; ++i) {
if (ans < k[i]) {
ans = k[i];
pos = i;
}
}
cout << ans << '\n';
printAns(pos);
cout << '\n';
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int N = 1e6 + 5;
int n, l[N], r[N], cnt[N], h;
void compress() {
map<int, int> mp;
for (int i = 0; i < n; ++i) mp[l[i]], mp[r[i]], mp[r[i] + 1];
for (auto& go : mp) go.second = h++;
for (int i = 0; i < n; ++i) l[i] = mp[l[i]], r[i] = mp[r[i]];
}
int spars[22][N], LG[N];
void build() {
LG[0] = -1;
for (int i = 0; i < h; ++i) {
LG[i + 1] = LG[i] + !(i & (i + 1));
spars[0][i] = cnt[i];
}
for (int lg = 1; (1 << lg) <= h; ++lg)
for (int i = 0; i + (1 << lg) <= h; ++i)
spars[lg][i] = min(spars[lg - 1][i], spars[lg - 1][i + (1 << (lg - 1))]);
}
int mn(int s, int e) {
int lg = LG[e - s + 1];
return min(spars[lg][s], spars[lg][e - (1 << lg) + 1]);
}
int tc = 0;
void init() {
h = 0;
memset(cnt, 0, sizeof cnt);
cout << ++tc << endl;
}
void gen(int m) {
n = rand() % m + 1;
for (int i = 0; i < n; ++i) {
l[i] = rand() % m;
r[i] = l[i] + rand() % m;
}
}
bool test(int l, int r) {
int c1 = 0, c2 = 0;
for (int i = 0; i < h; ++i) c1 += cnt[i] > 0;
for (int i = l; i <= r; ++i) --cnt[i];
for (int i = 0; i < h; ++i) c2 += cnt[i] > 0;
for (int i = l; i <= r; ++i) ++cnt[i];
return c1 == c2;
}
void check(int s, int e) {
if (test(s, e)) return;
cout << "WA\n";
cout << n << endl;
for (int i = 0; i < n; ++i) cout << l[i] << " " << r[i] << endl;
cout << "out : " << s << " " << e << endl;
for (int i = 0; i < h; ++i) cout << cnt[i] << " ";
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d%d", l + i, r + i);
compress();
for (int i = 0; i < n; ++i) {
++cnt[l[i]];
--cnt[r[i] + 1];
}
for (int i = 1; i < h; ++i) cnt[i] += cnt[i - 1];
build();
for (int i = 0; i < n; ++i)
if (mn(l[i], r[i]) > 1) {
return cout << i + 1, 0;
}
cout << -1;
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N, M;
int A[100001], B[100001];
long long ans = 0;
vector<int> sless[100001], smore[100001];
void del(int Y, int X) {
for (int i = 0; i < (int)sless[Y].size(); i++)
if (sless[Y][i] == X) {
sless[Y].erase(sless[Y].begin() + i);
return;
}
}
int main() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d%d", &A[i], &B[i]);
if (A[i] > B[i]) {
sless[A[i]].push_back(B[i]);
smore[B[i]].push_back(A[i]);
} else {
sless[B[i]].push_back(A[i]);
smore[A[i]].push_back(B[i]);
}
}
for (int i = 1; i <= N; i++)
ans += (long long)(sless[i].size()) * (long long)(smore[i].size());
int Q;
scanf("%d", &Q);
while (Q--) {
int X;
scanf("%d", &X);
printf("%I64d\n", ans);
ans -= (long long)(sless[X].size()) * (long long)(smore[X].size());
for (auto Y : smore[X]) {
ans -= smore[Y].size();
del(Y, X);
smore[Y].push_back(X);
sless[X].push_back(Y);
ans += sless[Y].size();
}
smore[X].clear();
}
printf("%I64d\n", ans);
return 0;
}
| 2,400 | CPP |
input()
s0=input()
s1=input()
if s0.count('1')!=s1.count('1'):
print(-1)
else:
m0=0
m1=0
v0=0
v1=0
for i,j in zip(s0,s1):
if i!=j:
v0+= 1 if i=='1' else -1
v1+= 1 if j=='1' else -1
m0=max(v0,m0)
m1=max(v1,m1)
print(m0+m1) | 2,100 | PYTHON3 |
n=input()
n=n.replace("WUB" , " ")
print(n) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long inv[2000005];
int main() {
inv[1] = 1ll;
for (int i = 2; i < 2000005; i++)
inv[i] = inv[mod % i] * 1ll * (mod - (mod / i)) % mod;
int n, m;
cin >> n >> m;
long long harmonic = 0ll;
for (int i = 1; i <= n; i++) (harmonic += inv[i]) %= mod;
long long ans = ((m * 1ll * harmonic) + 1ll) % mod;
ans = (ans * ((n * inv[m + 1]) % mod + 1ll) % mod) % mod;
cout << ans << endl;
}
| 3,000 | CPP |
if __name__ == '__main__':
S = input()
T = [0]*200
for e in S:
T[ord(e)] += 1
somme = 0
for i in T:
somme += i*i
print(somme)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100005, Maxk = 10005;
const long long inf = 1999999999999999999LL + 208;
int n, m, k;
long long h, f[Maxk];
bool flag[Maxn];
template <class T>
void read(T &v) {
char ch;
while (!isdigit(ch = getchar()))
;
v = ch - 48;
while (isdigit(ch = getchar())) v = v * 10 + ch - 48;
}
struct Treasure {
long long pos;
int val;
} a[Maxn];
struct info {
long long val;
int i;
info(long long val, int i) : val(val), i(i) {}
bool operator<(const info &rhs) const {
return val < rhs.val || (val == rhs.val && i > rhs.i);
}
bool operator>(const info &rhs) const { return val > rhs.val; }
};
priority_queue<info> H;
priority_queue<info, vector<info>, greater<info> > Q;
void predeal() {
for (int i = 1; i <= n; i++)
if (!flag[i] && a[i].val > 0 && a[i].pos >= f[a[i].pos % k])
flag[i] = 1, H.push(info(a[i].val, i));
}
void expand() {
long long e;
read(e);
for (int i = 0; i < k; i++)
if (f[i] < inf) Q.push(info(f[i], i));
while (!Q.empty()) {
info x = Q.top();
Q.pop();
int t = (x.i + e) % k;
if (x.val + e <= h && f[t] > x.val + e) Q.push(info(f[t] = x.val + e, t));
while (!Q.empty() && Q.top().val != f[Q.top().i]) Q.pop();
}
predeal();
}
int main() {
read(h);
read(n);
read(m);
read(k);
for (int i = 1; i <= n; i++) read(a[i].pos), read(a[i].val);
for (int i = 0; i < k; i++) f[i] = inf;
f[1] = 1;
predeal();
for (int i = 1, opx, x, y; i <= m; i++) {
read(opx);
if (opx == 1) expand();
if (opx == 2) {
read(x);
read(y);
a[x].val -= y;
if (a[x].pos >= f[a[x].pos % k]) H.push(info(a[x].val, x));
}
if (opx == 3) {
while (!H.empty() && H.top().val != a[H.top().i].val) H.pop();
if (H.empty())
puts("0");
else {
printf("%d\n", a[H.top().i].val);
a[H.top().i].val = 0;
}
}
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m = 1000000007) {
if (b == 0) return 1;
if (b == 1) return a;
long long res = power(a, b / 2, m);
res = (res * res) % m;
if (b & 1) res = (res * a) % m;
return res;
}
long long modinv(long long a, long long m = 1000000007) {
return power(a, m - 2, m);
}
long long add(long long a, long long b, long long m = 1000000007) {
long long c = (a + b);
if (c >= m) c -= m;
return c;
}
long long sub(long long a, long long b, long long m = 1000000007) {
long long c = (a - b);
if (c < 0) c += m;
return c;
}
long long mul(long long a, long long b, long long m = 1000000007) {
return (a * b) % m;
}
map<pair<long long, long long>, long long> pos_x, pos_y, vis;
pair<long long, long long> x[100005], y[100005];
long long sx, sy, ex, ey;
long long distanc(pair<long long, long long> p) {
return abs(p.second - ey) + abs(p.first - ex);
}
long long distance(pair<long long, long long> p1,
pair<long long, long long> p2) {
return min(abs(p1.second - p2.second), abs(p1.first - p2.first));
}
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
return a.second < b.second;
}
void solve() {
long long n, m, i;
cin >> n >> m;
cin >> sx >> sy >> ex >> ey;
pair<long long, long long> a[m];
for (i = 0; i < m; i++) {
cin >> a[i].first >> a[i].second;
x[i] = y[i] = a[i];
}
sort(x, x + m);
sort(y, y + m, comp);
priority_queue<pair<long long, pair<long long, long long> > > pq;
long long ans = abs(sx - ex) + abs(sy - ey);
for (i = 0; i < m; i++) {
pos_x[x[i]] = i;
pos_y[y[i]] = i;
long long dist = min(abs(x[i].first - sx), abs(x[i].second - sy));
pq.push({-dist, x[i]});
}
while (!pq.empty()) {
pair<long long, pair<long long, long long> > pp = pq.top();
pq.pop();
long long dist = abs(pp.first);
pair<long long, long long> p = pp.second;
if (dist > ans) break;
ans = min(ans, dist + distanc(p));
if (vis[p]) continue;
vis[p] = 1;
long long pos = pos_x[p];
if (pos > 0 && !vis[x[pos - 1]])
pq.push({-(dist + distance(x[pos - 1], x[pos])), x[pos - 1]});
if (pos < m - 1 && !vis[x[pos + 1]])
pq.push({-(dist + distance(x[pos + 1], x[pos])), x[pos + 1]});
pos = pos_y[p];
if (pos > 0 && !vis[y[pos - 1]])
pq.push({-(dist + distance(y[pos - 1], y[pos])), y[pos - 1]});
if (pos < m - 1 && !vis[y[pos + 1]])
pq.push({-(dist + distance(y[pos + 1], y[pos])), y[pos + 1]});
}
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
for (long long i = 1; i <= t; i++) {
solve();
}
return 0;
}
| 2,300 | CPP |
def main():
for _ in range(int(input())):
l=[int(x) for x in input().split()]
p=l[-1]
l=l[:-1]
l.sort()
dif=0
dif+=(l[2]-l[1])
dif+=(l[2]-l[0])
p-=dif
if p>=0 and p%3==0:
print("YES")
else:
print("NO")
main()
| 800 | PYTHON3 |
from sys import stdin
from math import ceil
n,k,m,d=map(int,stdin.readline().strip().split())
ans=0
for i in range(1,d+1):
low=1
high=m
while( high-low>1):
mid=(high+low)//2
y=mid*(i-1)*k
y+=mid
if y<=n:
low=mid
else:
high=mid
y=high*(i-1)*k
y+=high
if y<=n:
ans=max(ans,high*i)
else:
y=low*(i-1)*k
y+=low
if y<=n:
ans=max(ans,low*i)
print(ans)
| 2,000 | PYTHON3 |
import sys
def gcd(x, y):
while y:
x, y = y, x % y
return x
def lgcd(x):
result = x[0]
for a in x:
result = gcd(result, a)
return result
def check(result):
gcds = []
for i in range(len(result)):
row = result[i]
gcds.append(lgcd(row))
# print(row)
for j in range(len(result[0])):
x = []
for i in range(len(result)):
x.append(result[i][j])
# print(x)
gcds.append(lgcd(x))
print(gcds)
if (len(list(set(gcds))) - len(result) - len(result[0])) != 0:
print("ERRRRORRR", len(result), len(result[0]))
def solve(r, c):
if r == 1 and c == 1:
print(0)
elif r == 1:
print(" ".join(map(str, range(2, c + 2))))
elif c == 1:
for i in range(r):
print(i + 2)
else:
result = [[0 for _ in range(c)] for _ in range(r)]
result[0][0] = 2
used = []
if c < r:
for j in range(1, c):
result[0][j] = (j + 1) * 2
used.append((j + 1) * 2)
cur = 3
for i in range(1, r):
while cur in used:
cur += 1
result[i][0] = cur
cur += 1
else:
for j in range(1, r):
result[j][0] = (j + 1) * 2
used.append((j + 1) * 2)
cur = 3
for i in range(1, c):
while cur in used:
cur += 1
result[0][i] = cur
cur += 1
cur = 5
ipos, jpos = 2, 2
for i in range(1, r):
for j in range(1, c):
result[i][j] = result[i][0] * result[0][j]
#check(result)
#print(result)
for i in range(r):
print(" ".join(map(str, result[i])))
r, c = map(int, sys.stdin.readline().strip().split(' '))
solve(r, c)
#for r in range(1, 20):
# for c in range(1, 20):
# if r > 1 or c > 1:
# solve(r, c) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
int n, m;
int map[1010][1010];
int strpnt[1001000][2];
int q[1001000][2];
int qs, qe;
int stn;
int ans;
int gcd(int x, int y) {
if (y == 0) return x;
return gcd(y, x % y);
}
int main() {
int i, j, k, l, t;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &map[i + 1][j + 1]);
}
}
n += 2;
m += 2;
k = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (map[i + 1][j + 1] == 1) {
t = 0;
t += map[i][j + 1];
t += map[i + 1][j];
t += map[i + 1][j + 2];
t += map[i + 2][j + 1];
if (t == 1 || t == 3) {
k++;
}
if (t == 0) {
printf("-1");
return 0;
}
}
}
}
if (k != 0 && k != 2) {
printf("-1");
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (map[i + 1][j + 1] == 1) {
t = 0;
t += map[i][j + 1];
t += map[i + 1][j];
t += map[i + 1][j + 2];
t += map[i + 2][j + 1];
if (t != 2 || (!(((map[i][j + 1] == 1 && map[i + 2][j + 1] == 1) ||
(map[i + 1][j] == 1 && map[i + 1][j + 2] == 1))))) {
strpnt[stn][0] = i;
strpnt[stn][1] = j;
stn++;
}
}
}
}
if (stn < 2) {
printf("-1");
return 0;
}
for (i = 1; i < stn; i++) {
strpnt[i][0] -= strpnt[0][0];
if (strpnt[i][0] < 0) strpnt[i][0] = -strpnt[i][0];
strpnt[i][1] -= strpnt[0][1];
if (strpnt[i][1] < 0) strpnt[i][1] = -strpnt[i][1];
ans = gcd(strpnt[i][0], ans);
ans = gcd(strpnt[i][1], ans);
}
if (ans < 2) {
printf("-1");
return 0;
}
t = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (map[i][j] == 1) {
t = 1;
break;
}
}
if (t == 1) break;
}
qe = 1;
q[0][0] = i;
q[0][1] = j;
map[i][j] = 0;
for (qs = 0; qs < qe; qs++) {
if (map[q[qs][0] + 1][q[qs][1]] == 1) {
map[q[qs][0] + 1][q[qs][1]] = 0;
q[qe][0] = q[qs][0] + 1;
q[qe][1] = q[qs][1];
qe++;
}
if (map[q[qs][0] - 1][q[qs][1]] == 1) {
map[q[qs][0] - 1][q[qs][1]] = 0;
q[qe][0] = q[qs][0] - 1;
q[qe][1] = q[qs][1];
qe++;
}
if (map[q[qs][0]][q[qs][1] + 1] == 1) {
map[q[qs][0]][q[qs][1] + 1] = 0;
q[qe][0] = q[qs][0];
q[qe][1] = q[qs][1] + 1;
qe++;
}
if (map[q[qs][0]][q[qs][1] - 1] == 1) {
map[q[qs][0]][q[qs][1] - 1] = 0;
q[qe][0] = q[qs][0];
q[qe][1] = q[qs][1] - 1;
qe++;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (map[i][j] == 1) {
printf("-1");
return 0;
}
}
}
for (i = 2; i <= ans; i++) {
if (ans % i == 0) printf("%d ", i);
}
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 100;
const int md = 1000000007;
priority_queue<int, vector<int> > pq;
bool compare(int a, int b) { return a < b; }
int t;
long long a, b, n, s;
bool solve() {
long long c = 0, d = a, mid;
while (d - c > 1) {
mid = (c + d) / 2;
if (mid * n > s)
d = mid - 1;
else
c = mid;
}
if (b >= s - d * n and s - d * n >= 0) return 1;
if (b >= s - c * n and s - c * n >= 0) return 1;
return 0;
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%lld %lld %lld %lld", &a, &b, &n, &s);
if (solve())
printf("YES\n");
else
printf("NO\n");
}
}
| 1,000 | CPP |
#include <bits/stdc++.h>
int main() {
long long n, vb, vs;
scanf("%lld %lld %lld", &n, &vb, &vs);
std::vector<long long> x(n);
for (long long p = 0; p < n; p++) {
scanf("%lld", &x[p]);
}
long long xu, yu;
scanf("%lld %lld", &xu, &yu);
double mt(2e18);
long long index(0);
for (long long p = 1; p < n; p++) {
double time =
sqrt((x[p] - xu) * (x[p] - xu) + yu * yu) / vs + 1.0 * x[p] / vb;
if (time <= mt) {
mt = time;
index = p;
}
}
printf("%lld\n", index + 1);
return 0;
}
| 1,200 | CPP |
words = int(input())
for i in range(words):
word = input()
if len(word) <= 10:
print(word)
else:
print(word[0] + str(len(word[1:len(word)-1]))+word[-1]) | 800 | PYTHON3 |
n, m, a=map(int,input().split())
if (n%a==0):
x=n//a
else:
x=n//a+1
if (m%a==0):
y=m//a
else:
y=m//a+1
print(x*y) | 1,000 | PYTHON3 |
# import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
import math
def countSetBits(n):
count = 0
while (n):
count += n & 1
n >>= 1
return count
def bubble_sort(c):
n = len(c)
for i in range(n):
already_sorted = True
for j in range(n - i - 1):
if c[j][0] < c[j+1][0]:#it is according to the no of zeros
c[j][0], c[j+1][0] = c[j+1][0], c[j][0]
already_sorted = False
if(c[j][0]==c[j+1][0]):
if(c[j][1]>c[j+1][1]):#this is for frsts come find
c[j][1], c[j+1][1] = c[j+1][1], c[j][1]
if already_sorted:
break
return c
#use ord() for ascii
# def fun(l,r):
# if(l>r):
# return
# m=(l+r)//2
# c.append([l-r,m])
# # c[m]=(r-l,l)
# fun(l,m-1)
# fun(m+1,r)
def perform_bubble_sort(blist):
cmpcount, swapcount = 0, 0
blist=list(map(int,input().split()))
for j in range(len(blist)):
for i in range(1, len(blist)-j):
cmpcount += 1
if blist[i-1] > blist[i]:
swapcount += 1
blist[i-1], blist[i] = blist[i], blist[i-1]
print(swapcount)
def fun(l,c,d):
if(c==n):
return d
if(c%2==0):
d=max(fun(l[:-1],c+1,d+l[-1]),fun(l[1:],c+1,d+l[0]))
else:
d=min(fun(l[1:],c+1,d-l[0]),fun(l[:-1],c+1,d-l[-1]))
return d
t=int(input())
# t=1
while t:#a = [list(map(int, input().split())) for i in range(n)]
t-=1
# l=list(map(int,input().split()))
# a=[0 for i in range(n+1)]
x,y,n=map(int,input().split())
if(n%x==y):
print(n)
else:
k=(n%x)
a=0
if(k<y):
a=(n-x+abs(k-y))
else:
a=(n-abs(k-y))
print(a)
# print(((n-y)//x)*x)
# print(((n//x)+y)*x)
# N, S = map(int,input().split())
# A = list(map(int,input().split()))
# mod = 998244353
# dp = [[0 for j in range(S + 1)] for i in range(N + 1)]
# dp[0][0] = 1
# for i in range(N) :
# for j in range(S + 1) :
# dp[i + 1][j] += 2 * dp[i][j]
# dp[i + 1][j] %= mod
# if j + A[i] <= S :
# dp[i + 1][j + A[i]] += dp[i][j]
# dp[i + 1][j + A[i]] %= mod
# print(dp[N][S])
# stdout.flush()
# https://codeforces.com/contest/1320/problem/A
# https://codeforces.com/contest/431/problem/B
# a_dictionary = {"a": 1, "b": 2, "c": 3}
# max_key = max(a_dictionary, key=a_dictionary.get)
# a_dictionary = {"a": 1, "b": 2, "c": 3}
# all_values = a_dictionary.values()
# max_value = max(all_values)
# ans1=sorted(d.items(), key=lambda x:x[1], reverse=True)[0][1]
# n=int(input())
# a=0;b=0
# while(n%2==0):
# n//=2
# a+=1
# while(n%3==0):
# n//=3
# b+=1
# if(n>1):
# print(-1)
# elif(a>b):
# print(-1)
# else:
# print((b-a)+b) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
pair<int, int> start, end;
cin >> s;
start.first = s[0] - 'a' + 1;
start.second = s[1] - '0';
cin >> s;
end.first = s[0] - 'a' + 1;
end.second = s[1] - '0';
vector<string> ans;
int dem = 0;
while (start.first < end.first && start.second < end.second) {
dem++;
ans.push_back("RU");
start.first++;
start.second++;
}
while (start.first > end.first && start.second > end.second) {
dem++;
ans.push_back("LD");
start.first--;
start.second--;
}
while (start.first < end.first && start.second > end.second) {
dem++;
ans.push_back("RD");
start.first++;
start.second--;
}
while (start.first > end.first && start.second < end.second) {
dem++;
ans.push_back("LU");
start.first--;
start.second++;
}
while (start.first < end.first) {
ans.push_back("R");
dem++;
start.first++;
}
while (start.first > end.first) {
ans.push_back("L");
dem++;
start.first--;
}
while (start.second < end.second) {
ans.push_back("U");
dem++;
start.second++;
}
while (start.second > end.second) {
ans.push_back("D");
dem++;
start.second--;
}
cout << dem << "\n";
for (int i = 0; i < dem; ++i) cout << ans[i] << "\n";
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int par[100005], x[1000005], y[1000005], w[1000005], pos[1000005],
sizee[100005];
long long int fact(long long int n) {
if (n == 1 || n == 0) return 1;
return n * fact(n - 1);
}
int isPrime(long long int n) {
long long int i, j;
for (i = 2; i < sqrt(n) + 1; i++) {
if (n % i == 0) return 0;
}
return 1;
}
long long int modexpo(long long int x, long long int p) {
long long int res = 1;
x = x % 1000000007;
while (p) {
if (p % 2) res = res * x;
p >>= 1;
x = x * x % 1000000007;
res %= 1000000007;
}
return res;
}
long long int binSearch(long long int a[], long long int l, long long int h,
long long int x) {
long long int c = -1;
while (l <= h) {
long long int m = (l + h) / 2;
if (a[m] >= x) {
c = m;
h = m - 1;
} else
l = m + 1;
}
return c;
}
void pairsort(long long int a[], long long int b[], long long int n) {
pair<long long int, long long int> pairt[n];
for (long long int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (long long int i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
long long int mulmod(long long int a, long long int b) {
long long int res = 0;
a = a % 1000000007;
while (b > 0) {
if (b % 2 == 1) res = (res + a) % 1000000007;
a = (a * 2) % 1000000007;
b /= 2;
}
return res % 1000000007;
}
void init(long long int n) {
long long int i;
for (i = 0; i < n + 1; i++) {
par[i] = i;
sizee[i] = 1;
}
}
long long int root(long long int x) {
while (x != par[x]) {
par[x] = par[par[x]];
x = par[x];
}
return x;
}
void Union(long long int x, long long int y) {
long long int ra = root(x);
long long int rb = root(y);
if (ra == rb) return;
if (sizee[ra] < sizee[rb]) {
par[ra] = rb;
sizee[rb] += sizee[ra];
} else {
par[rb] = ra;
sizee[ra] += sizee[rb];
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, t, m, k = 1, i, j, l, f = 0, h = 0, sum = 0, ans = 0, s, b;
cin >> n >> m;
init(n + 1);
for (i = 0; i < m; i++) {
cin >> x[i] >> y[i] >> w[i];
pos[i] = i;
}
pairsort(w, pos, m);
k = 0;
if (m == n - 1) {
cout << 1000000000;
return 0;
}
for (i = 0; i < m; i++) {
if (pos[i] != 0 && root(x[pos[i]]) != root(y[pos[i]])) {
Union(x[pos[i]], y[pos[i]]);
sum += w[i];
k++;
if (k == n - 1) break;
}
}
long long int sum1 = 0;
init(n + 1);
Union(x[0], y[0]);
for (i = 0; i < m; i++) {
if (pos[i] == 0) j = i;
}
sum1 += w[j];
k = 1;
for (i = 0; i < m; i++) {
if (pos[i] != 0 && root(x[pos[i]]) != root(y[pos[i]])) {
Union(x[pos[i]], y[pos[i]]);
sum1 += w[i];
k++;
if (k == n - 1) break;
}
}
if (sum1 > sum)
cout << w[j] - (sum1 - sum);
else
cout << sum - sum1 + w[j];
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int f = 0;
cin >> s;
int x[5] = {}, c = 2, co = 0;
while (c--) {
x[0] = s.find("Danil");
if (x[0] > -1) {
f++;
co++;
if (co == 2) {
cout << "NO" << endl;
return 0;
}
s[x[0] + 1] = '0';
}
}
c = 2;
co = 0;
while (c--) {
x[1] = s.find("Olya");
if (x[1] > -1) {
f++;
co++;
if (co == 2) {
cout << "NO" << endl;
return 0;
}
s[x[1] + 1] = '0';
}
}
c = 2;
co = 0;
while (c--) {
x[2] = s.find("Slava");
if (x[2] > -1) {
f++;
co++;
if (co == 2) {
cout << "NO" << endl;
return 0;
}
s[x[2] + 1] = '0';
}
}
c = 2;
co = 0;
while (c--) {
x[3] = s.find("Ann");
if (x[3] > -1) {
f++;
co++;
if (co == 2) {
cout << "NO" << endl;
return 0;
}
s[x[3] + 1] = '0';
}
}
c = 2;
co = 0;
while (c--) {
x[4] = s.find("Nikita");
if (x[4] > -1) {
f++;
co++;
if (co == 2) {
cout << "NO" << endl;
return 0;
}
s[x[4] + 1] = '0';
}
}
c = 0;
if (!f) {
for (int i = 0; i < 5; i++) {
if (x[i] == -1) c++;
}
} else
c = 4;
if (c == 4 && f == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimization("O3")
using namespace std;
int main() {
;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int N;
cin >> N;
long long int arr[N];
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
if (N == 1 || N == 2) {
cout << N << "\n";
return 0;
}
long long int ans = 2, cnt = 0;
for (int i = 2; i < N; i++) {
if (arr[i - 1] + arr[i - 2] == arr[i]) {
cnt++;
} else if (cnt > 0) {
ans = max(ans, cnt + 2);
cnt = 0;
}
}
if (cnt > 0) ans = max(ans, cnt + 2);
cout << ans << "\n";
return 0;
}
| 1,100 | CPP |
import sys
import math
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
one = [i + 1 for i in range(n) if a[i] == 1]
two = [i + 1 for i in range(n) if a[i] == 2]
thr = [i + 1 for i in range(n) if a[i] == 3]
ans = min(len(one), len(two), len(thr))
print(ans)
for i in range(ans):
print(one[-1], two[-1], thr[-1])
one.pop()
two.pop()
thr.pop()
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct aaa {
int x, y, id;
} aa[1000001];
int n, m, now, a[1000001], ans[1000001], p[1001], pos[1001];
bool cmp(aaa a, aaa b) { return a.y < b.y; }
void add(int x, int id) {
int i;
for (i = 20; i >= 0; i--)
if (x & (1 << i)) {
if (!p[i]) {
p[i] = x;
pos[i] = id;
return;
}
if (pos[i] < id) swap(p[i], x), swap(pos[i], id);
x ^= p[i];
}
}
int query(int id) {
int i, sum = 0;
for (i = 20; i >= 0; i--)
if (pos[i] >= id && (sum ^ p[i]) > sum) sum ^= p[i];
return sum;
}
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d", &m);
for (i = 1; i <= m; i++) {
scanf("%d%d", &aa[i].x, &aa[i].y);
aa[i].id = i;
}
sort(aa + 1, aa + m + 1, cmp);
now = 1;
for (i = 1; i <= m; i++) {
while (now <= aa[i].y && now <= n) add(a[now], now), now++;
ans[aa[i].id] = query(aa[i].x);
}
for (i = 1; i <= m; i++) printf("%d\n", ans[i]);
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
void fakemain() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
long long n, k;
cin >> n >> k;
long long sum = 0;
map<long long, long long> m;
set<long long> s;
long long ans = LLONG_MAX;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
sum += x;
m[x]++;
if (m[x] >= k) ans = 0;
s.insert(x);
}
if (ans == 0) {
cout << 0 << "\n";
return;
}
long long cnt = 0;
long long pre = 0;
for (auto it : m) {
long long f = it.second;
long long num = it.first;
if (f >= k) {
ans = 0;
break;
}
if (cnt + f >= k) {
long long req = cnt * (num - 1) - pre;
req += (k - f);
ans = min(ans, req);
}
if (n - cnt >= k) {
long long req = (sum - pre - f * num) - (n - cnt - f) * (num + 1);
req += (k - f);
ans = min(ans, req);
}
long long req = cnt * (num - 1) - pre + (sum - pre - f * num) -
(n - cnt - f) * (num + 1);
req += (k - f);
ans = min(ans, req);
cnt += f;
pre += f * num;
}
cout << ans;
}
int main() { fakemain(); }
| 2,200 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long mod{998244353};
long long fact[1000001];
inline long long add(long long a, long long b) { return (a + b) % mod; }
inline long long mul(long long a, long long b) { return (a * b) % mod; }
inline long long binpow(long long a, long long n) {
long long res = 1;
while (n) {
if (n & 1) res = mul(res, a);
a = mul(a, a);
n >>= 1;
}
return res;
}
inline long long r(long long x) { return binpow(x, mod - 2); }
inline long long divi(long long a, long long b) { return mul(a, r(b)); }
inline long long C(long long n, long long k) {
return divi(divi(fact[n], fact[k]), fact[n - k]);
}
inline void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
signed main() {
fastio();
long long n, k;
cin >> n >> k;
fact[0] = 1;
for (long long i = 1; i <= n; i++) fact[i] = mul(fact[i - 1], i);
long long ans = 0;
for (long long mel = 1; mel <= n; mel++) {
long long lv = 1, rv = 1000001;
while (rv - lv > 1) {
long long mv = (lv + rv) >> 1;
if (mv * mel <= n)
lv = mv;
else
rv = mv;
}
if (lv < k) continue;
if (lv == 1) {
ans = add(ans, 1);
continue;
}
ans = add(ans, C(lv - 1, k - 1));
}
cout << ans;
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, x;
int i, j;
scanf("%d %d %d", &n, &l, &x);
int ant = 0;
int resp = 0;
int a, b;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
resp += (a - ant) / x;
ant = a + b;
}
resp += (l - ant) / x;
printf("%d\n", resp);
}
| 1,000 | CPP |
for t in range(int(input())):
n = int(input())
b = "11"
while n % int(b, 2):
b += "1"
print(n // int(b, 2))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, r;
int main() {
cin >> n >> r;
int ans = 0, Max = -1, mark = false;
for (int i = 1; i <= r; i++) {
int t = i, b = r, num = 0, cnt = 0;
while (t > 0 && b > 0) {
bool flag = false;
if (b > t) {
int c = b / t - 1;
num += c;
b -= t * c;
if (b > t) {
b -= t;
num++;
}
flag = true;
} else {
if (t > b) {
int c = t / b - 1;
num += c;
t -= b * c;
if (t > b) {
t -= b;
num++;
}
}
}
cnt++;
if (t == b) {
num++;
t -= b;
cnt++;
if (b == r) cnt--;
if (cnt > Max && (max(b, t) == 1 && min(b, t) == 0) && num == n) {
if (!flag)
mark = true;
else
mark = false;
Max = cnt;
ans = i;
}
}
}
}
if (Max == -1) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
string s;
int t = ans, b = r;
if (mark) swap(b, t);
while (t > 0 && b > 0) {
if (t >= b) {
t -= b;
s += 'T';
} else {
b -= t;
s += 'B';
}
}
reverse(s.begin(), s.end());
cout << n - Max << endl << s << endl;
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, mx = -1;
cin >> n >> s;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (s >= x + (y ? 1 : 0)) mx = max(mx, (100 - y) % 100);
}
cout << mx << endl;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979323846;
void debn(vector<int> a) {
for (auto v : a) cout << v << ' ';
cout << endl;
}
void debnn(vector<vector<int>> a) {
for (auto v : a) {
for (auto w : v) cout << w << ' ';
cout << endl;
}
}
long long powmod(long long x, long long y, long long mod) {
long long res = 1;
while (y) {
if (y & 1) res = res * x % mod;
y >>= 1;
x = x * x % mod;
}
return res;
}
int main() {
string s;
cin >> s;
int n = s.size();
vector<char> a;
int m = -1;
int ans = 0;
for (int i = 0; i < n; i++) {
if (m == -1) {
m++;
if (a.size() > m)
a[m] = s[i];
else
a.push_back(s[i]);
} else {
if (a[m] == s[i])
m--, ans++;
else {
m++;
if (a.size() > m)
a[m] = s[i];
else
a.push_back(s[i]);
}
}
}
if (ans & 1)
cout << "Yes";
else
cout << "No";
}
| 1,200 | CPP |
def main():
k = int(input())
if k == 0:
print (1)
else:
s = ''
while k>0:
if k >=2:
s += '8'
k-=2
else:
s += '4'
k-=1
if len(s)>=19:
s = '-1'
break
print (s)
if __name__ == '__main__':
main()
| 1,200 | PYTHON3 |
n, m = map(int, input().split(" "))
counter = 0
for i in range(1, m+1):
no = i % 5
counter += (n+(i % 5))//5
print(counter)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
string s, t;
int dp[1001][1001][11][2];
int rec(int i, int j, int cnt, int check) {
int x = dp[i][j][cnt][check];
if (cnt == k) return 0;
if (x != -1) return x;
if (i == n || j == m) return -10000;
int ret = 0;
if (s[i] == t[j]) {
ret = max(ret, rec(i + 1, j + 1, cnt, 1) + 1);
ret = max(ret, rec(i + 1, j + 1, cnt + 1, 0) + 1);
}
if (check == 1) {
ret = max(ret, rec(i + 1, j, cnt + 1, 0));
ret = max(ret, rec(i, j + 1, cnt + 1, 0));
} else if (check == 0) {
ret = max(ret, rec(i + 1, j, cnt, 0));
ret = max(ret, rec(i, j + 1, cnt, 0));
}
return dp[i][j][cnt][check] = ret;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
cin >> s >> t;
memset(dp, -1, sizeof(dp));
printf("%d\n", rec(0, 0, 0, 0));
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int x, i, j;
string a[2][2];
string b = "week";
string c = "month";
string s;
cin >> x;
for (i = 0; i < 1; i++) {
for (j = 0; j < 2; j++) cin >> a[i][j];
}
s = a[0][1];
if (s == b) {
if (x == 5 || x == 6) {
cout << "53" << endl;
return;
}
cout << "52" << endl;
return;
} else {
if (x >= 1 && x <= 29) {
cout << "12" << endl;
return;
}
if (x <= 30) {
cout << "11" << endl;
return;
}
cout << "7" << endl;
return;
}
}
int main() { solve(); }
| 900 | CPP |
def Game(n, s):
mishka = 0
chris = 0
for i in range(n):
if s[i][0] > s[i][1]:
mishka = mishka + 1
elif s[i][0] < s[i][1]:
chris = chris + 1
if mishka > chris:
return "Mishka"
elif mishka < chris:
return "Chris"
else:
return "Friendship is magic!^^"
x = int(input())
r = []
for i in range(x):
s = [int(n) for n in input().split()]
r.append(s)
print(Game(x, r)) | 800 | PYTHON3 |
n=int(input())
A=[int(i) for i in input().split(" ")]
for i in range(n):
for j in range(n-1):
if A[j]>A[j+1]:
print(j+1,j+2)
A[j],A[j+1]=A[j+1],A[j]
| 1,100 | PYTHON3 |
#include<bits/stdc++.h>
#define ll long long
#define test_case(t) for(int z=1;z<=t;z++)
#define print_case printf("Case %d: ",z)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff front
#define fi first
#define ss second
#define pll pair< ll, ll >
#define mpp(a,b,c) mp(mp(a,b),c)
#define mp make_pair
#define clr(x) memset(x,0,sizeof(x));
// Have to comment out the following lines befor submitting, they are for debugging.
#define _GLIBCXX_DEBUG // Iterator safety; out-of-bounds access for Containers, etc.
#pragma GCC optimize "trapv" // abort() on (signed) integer overflow.
using namespace std;
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
bool is_palindrom(string a){
string b = a;
reverse(a.begin(), a.end());
if(a == b)
return true;
else
return false;
}
int main()
{
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif */
fast;
ll t;
cin >> t;
while(t--){
ll n, input;
cin >> n;
string s;
cin >> s;
if(is_palindrom(s)){
ll cnt = 0;
for(ll i = 0; i < n; i++){
if(s[i] == '0')
cnt++;
}
if(cnt%2){
if(cnt == 1)
cout << "BOB";
else
cout << "ALICE";
}
else{
cout << "BOB";
}
cout << "\n";
continue;
}
ll c_eq = 0, c_un = 0;
for(ll i = 0, j = n-1; i < j; i++, j--){
if(s[i] == '0' && s[j] == '0')
c_eq++;
if(s[i] != s[j])
c_un++;
}
if(n%2){
if(s[n/2]=='0' && c_un == 1 && c_eq == 0){
cout << "DRAW" << "\n";
continue;
}
cout << "ALICE" << "\n";
}
else
cout << "ALICE" << "\n";
}
return 0;
}
| 1,900 | CPP |
t=int(input())
for i in range(t):
a,b,n=map(int,input().split())
c=a^b
A=[a,b,c]
print(A[n%3])
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long double r, v, ep, pi, frst, lst, mid, d, tmp, res;
long long c, n;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> r >> v;
ep = powl(10, -8);
pi = 2 * asinl(1);
for (int i = 1; i <= n; i++) {
cin >> frst >> lst;
d = lst - frst;
c = d / (2 * pi * r);
d -= res = c * 2 * pi * r;
res /= v;
frst = 0;
lst = (pi * r) / v;
for (int i = 1; i <= 100; i++) {
if (lst - frst <= ep) break;
mid = (lst + frst) / 2;
tmp = 2 * ((v * mid) + (r * sinl((v * mid) / r)));
if (tmp < d) {
frst = mid;
} else {
lst = mid;
}
}
res += 2 * frst;
cout << fixed << setprecision(15) << res << "\n";
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int ar[n * m][2];
int c = 0;
for (int i = 0; i < n; i++) {
if (i % 2 != 0) {
for (int j = 0; j < m; j++) {
ar[c][0] = i + 1;
ar[c][1] = j + 1;
c++;
}
} else {
for (int j = m - 1; j >= 0; j--) {
ar[c][0] = i + 1;
ar[c][1] = j + 1;
c++;
}
}
}
int val = (n * m) / k;
int rem = n * m - val * k;
int b[k];
for (int i = 0; i < k; i++) b[i] = val;
b[k - 1] += rem;
int t = 0;
for (int i = 0; i < k; i++) {
cout << b[i] << " ";
for (int j = 0; j < b[i]; j++) {
cout << ar[t][0] << " " << ar[t][1] << " ";
t++;
}
cout << "\n";
}
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N6 = 1e6 + 6, N3 = 1e3 + 6, oo = 1e9 + 9, base = 1e9 + 7;
const long long ool = 1e18 + 9;
int n, m, cmove, a[N6];
bool s;
int res;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
scanf("%d%d", &n, &m);
bool pos = 0;
for (int i = 1; i <= m; ++i) {
int qt;
scanf("%d", &qt);
if (qt == 1) {
int x;
scanf("%d", &x);
cmove += x;
if (cmove > n) cmove -= n;
if (cmove < -n) cmove += n;
x = abs(x);
s ^= (x & 1);
} else {
if (!s)
res++;
else
res--;
s ^= 1;
if (res == n) res = 0;
if (res == -n) res = 0;
}
}
for (int i = 1; i <= n; ++i) {
if (i & 1) {
int x = i + res;
if (x <= 0) x += n;
if (x > n) x -= n;
a[x] = i;
} else {
int x = i - res;
if (x <= 0) x += n;
if (x > n) x -= n;
a[x] = i;
}
}
if (cmove < 0) {
for (int i = 1 - cmove; i <= n; ++i) printf("%d ", a[i]);
for (int i = 1; i <= (1 - cmove) - 1; ++i) printf("%d ", a[i]);
} else {
for (int i = n - cmove + 1; i <= n; ++i) printf("%d ", a[i]);
for (int i = 1; i <= n - cmove; ++i) printf("%d ", a[i]);
}
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tst = 1, t;
string a, b;
cin >> a >> b;
int alen = a.size();
int blen = b.size();
long long int cnt = 0, j;
for (long long int i = 0; i < alen; i++) {
for (j = 0; j < blen; j++) {
if (a[i + j] != b[j]) break;
}
if (j == blen) {
cnt++;
i = i + blen - 1;
}
}
printf("%lld\n", cnt);
return 0;
}
| 1,200 | CPP |
l, r, x, y, k = map(int, input().split())
low_ex, high_ex = x * k, y * k
if high_ex < l or low_ex > r:
print('NO')
else:
low = l // k * k
up = r // k * k + k
a = low
b = low // k
ok = 0
while a <= up:
if x <= b and b <= y and l <= a and a <= r:
ok = 1
a += k
b += 1
if ok == 1:
print('YES')
else:
print('NO') | 1,200 | PYTHON3 |
H, L = map(int, input().split())
print((((L**2)/H) + H)/2 - H)
| 1,000 | PYTHON3 |
t=int(input())
while t:
n,m=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=list(set(a).intersection(b))
if len(c)==0:
print("NO")
else:
print("YES")
print(1,c[0])
t-=1 | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '7') n += pow(2, s.length() - i - 1);
}
cout << n + pow(2, s.length()) - 1 << endl;
return 0;
}
| 1,100 | CPP |
#!/usr/bin/env python3
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def get_str():
return input().decode().strip()
def rint():
return map(int, input().split())
def oint():
return int(input())
t = oint()
for _ in range(t):
n = oint()
a = list(rint())
a.sort(reverse=True)
print(*a) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int64_t numerator, denominator;
std::cin >> numerator >> denominator;
int64_t resistors_counter = 0;
while (numerator && denominator) {
if (numerator > denominator) {
resistors_counter += numerator / denominator;
numerator %= denominator;
} else {
resistors_counter += denominator / numerator;
denominator %= numerator;
}
}
std::cout << resistors_counter;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
const int INF = 1000000000;
const int MOD = INF + 7;
pair<int, int> operator-(pair<int, int> i1, pair<int, int> i2) {
return pair<int, int>(i1.first - i2.first, i1.second - i2.second);
}
pair<int, int> operator+(pair<int, int> i1, pair<int, int> i2) {
return pair<int, int>(i1.first + i2.first, i1.second + i2.second);
}
pair<int, int> maior(pair<int, int> i1, pair<int, int> i2) {
pair<int, int> c1 = i1, c2 = i2;
int dm = min(i1.first, i2.first), tm = min(i1.second, i2.second);
i1.first -= dm, i2.first -= dm;
i1.second -= tm, i2.second -= tm;
if (i1.first == 0 && i1.second == 0) return c2;
if (i2.first == 0 && i2.second == 0) return c1;
if (i1.first == 0) swap(i1, i2), swap(c1, c2);
int dois = i1.first - i2.first, tres = i2.second - i1.second;
if (tres >= (log(2.) / log(3.)) * dois) return c2;
return c1;
}
pair<int, int> linha[MAXN][MAXN];
pair<int, int> coluna[MAXN][MAXN];
int CE[MAXN][MAXN], CD[MAXN][MAXN];
int CC[MAXN][MAXN], CB[MAXN][MAXN];
int mat[MAXN][MAXN];
int allright[MAXN][MAXN];
pair<int, int> solve(int n) {
memset(CE, 0, sizeof CE);
memset(CD, 0, sizeof CD);
memset(CB, 0, sizeof CB);
memset(CC, 0, sizeof CC);
for (int i = 0; i < n + 1; i++)
for (int j = 0; j < n + 1; j++)
linha[i][j] = coluna[i][j] = pair<int, int>(0, 0);
for (int i = 0; i < n + 1; i++)
linha[i][0] = pair<int, int>(0, 0), CE[i][0] = CD[i][n + 1] = 0;
for (int i = 0; i < n + 1; i++)
coluna[0][i] = pair<int, int>(0, 0), CC[0][i] = CB[n + 1][i] = 0;
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
int c = mat[i - 1][j - 1];
CC[i][j] = CC[i - 1][j] + 1;
if (c == 0) CC[i][j] = 0;
}
}
for (int i = n; i >= 0; i--) {
for (int j = 1; j < n + 1; j++) {
int c = mat[i - 1][j - 1];
CB[i][j] = CB[i + 1][j] + 1;
if (c == 0) CB[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
int c = mat[i - 1][j - 1];
CE[i][j] = CE[i][j - 1] + 1;
if (c == 0) CE[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = n; j >= 0; j--) {
int c = mat[i - 1][j - 1];
CD[i][j] = CD[i][j + 1] + 1;
if (c == 0) CD[i][j] = 0;
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
int c = mat[i - 1][j - 1];
linha[i][j] = linha[i][j - 1];
coluna[i][j] = coluna[i - 1][j];
if (c == 2) {
linha[i][j].first++;
coluna[i][j].first++;
} else if (c == 3) {
linha[i][j].second++;
coluna[i][j].second++;
}
}
}
pair<int, int> max1;
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
int mm = min(min(CD[i][j], CE[i][j]), min(CC[i][j], CB[i][j]));
mm--;
pair<int, int> aux = linha[i][j + mm] - linha[i][j - mm - 1] +
coluna[i + mm][j] - coluna[i - mm - 1][j];
if (!allright[i - 1][j - 1]) continue;
int c = mat[i - 1][j - 1];
if (c == 0) continue;
if (c == 2) aux.first--;
if (c == 3) aux.second--;
max1 = maior(max1, aux);
}
}
return max1;
}
string inp[MAXN];
int main() {
int n;
while (cin >> n) {
for (int i = 0; i < n; i++) cin >> inp[i];
int tudozero = 0;
memset(allright, 0, sizeof allright);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (inp[i][j] != '0') tudozero = 1;
mat[i][j] = inp[i][j] - '0';
allright[i][j] = 1;
}
}
long long ans = 1;
if (tudozero == 0) ans = 0;
pair<int, int> r1 = solve(n);
memset(allright, 0, sizeof allright);
for (int i = 0; i < MAXN; i++)
for (int j = 0; j < MAXN; j++) mat[i][j] = 1;
for (int i = 0; i < n; i++) {
int idx1 = i + (-1), idx2 = (-1) - i + n - 1;
if (idx1 < 0 || idx1 >= 2 * n - 1) continue;
if (idx2 < 0 || idx2 >= 2 * n - 1) continue;
mat[idx1][idx2] = 0;
}
for (int i = 0; i < n; i++) {
int idx1 = i + (n), idx2 = (n)-i + n - 1;
if (idx1 < 0 || idx1 >= 2 * n - 1) continue;
if (idx2 < 0 || idx2 >= 2 * n - 1) continue;
mat[idx1][idx2] = 0;
}
for (int i = 0; i < n; i++) {
int idx1 = (-1) + (i), idx2 = (i) - (-1) + n - 1;
if (idx1 < 0 || idx1 >= 2 * n - 1) continue;
if (idx2 < 0 || idx2 >= 2 * n - 1) continue;
mat[idx1][idx2] = 0;
}
for (int i = 0; i < n; i++) {
int idx1 = (n) + (i), idx2 = (i) - (n) + n - 1;
if (idx1 < 0 || idx1 >= 2 * n - 1) continue;
if (idx2 < 0 || idx2 >= 2 * n - 1) continue;
mat[idx1][idx2] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int idx1 = i + j, idx2 = j - i + n - 1;
mat[idx1][idx2] = inp[i][j] - '0';
allright[idx1][idx2] = 1;
}
}
pair<int, int> r2 = solve(2 * n - 1);
r1 = maior(r1, r2);
for (int i = 0; i < r1.first; i++) {
ans *= 2;
ans %= MOD;
}
for (int i = 0; i < r1.second; i++) {
ans *= 3;
ans %= MOD;
}
cout << ans << endl;
}
}
| 2,300 | CPP |
x, y, z = map(int,input().split())
lst = [x,y,z]
lst.sort()
print(lst[2]-lst[0])
| 800 | PYTHON3 |
T = int(input())
for _ in range(T):
a1, K = map(int, input().split())
ans = a1
an = a1
endFlag = False
for i in range(K-1):
digits = []
while (an > 0):
digits.append(an % 10)
an //= 10
if min(digits) == 0:
endFlag = True
ans = ans + max(digits) * min(digits)
an = ans
if endFlag:
break
print(ans) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
else
return gcd(m % n, n);
}
int main() {
int n;
string s;
cin >> n >> s;
string s1 = "";
string s2 = "";
for (int i = 0; i < n / 2; i++) {
s1 += "rb";
s2 += "br";
}
if (n % 2 == 1) {
s1 += "r";
s2 += "b";
}
int x = 0;
int y = 0;
for (int i = 0; i < n; i++) {
if (s[i] != s1[i]) {
if (s[i] == 'r')
x++;
else
y++;
}
}
int x1 = 0;
int y1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] != s2[i]) {
if (s[i] == 'r')
x1++;
else
y1++;
}
}
cout << min(max(x, y), max(x1, y1)) << endl;
}
| 1,400 | CPP |
from math import *
x, y, z = map(int ,input().split())
tempa = ceil(x/z)
tempb = ceil(y/z)
print(tempa * tempb, "\n")
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int modulo(int a, int b, int c) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y) % c;
}
y = (y * y) % c;
b /= 2;
}
return x % c;
}
long long modulo(long long a, long long b, long long c) {
long long x = 0, y = a % c;
while (b > 0) {
if (b % 2 == 1) {
x = (x + y) % c;
}
y = (y * 2) % c;
b /= 2;
}
return x % c;
}
int a[200000];
int one[200000];
int zero[200000];
int main() {
int i, j, n, c = 0;
n = 200000;
long long val = 0, val2 = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) val += c;
if (a[i] == 1) c++;
}
c = 0;
for (i = n - 1; i >= 0; i--) {
if (a[i] == 1) val2 += c;
if (a[i] == 0) c++;
}
cout << min(val, val2) << endl;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(false);
long long x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
long long diffx, diffy;
diffx = x2 - x1;
diffy = y2 - y1;
long long n;
cin >> n;
vector<pair<long long, long long>> w(n);
string s;
cin >> s;
vector<pair<long long, long long>> summ(n + 1);
pair<long long, long long> curr = {0, 0};
summ[0] = {0, 0};
for (long long i = 0; i < n; i++) {
if (s[i] == 'D') {
w[i] = {0, -1};
}
if (s[i] == 'U') {
w[i] = {0, 1};
}
if (s[i] == 'L') {
w[i] = {-1, 0};
}
if (s[i] == 'R') {
w[i] = {1, 0};
}
curr.first += w[i].first;
curr.second += w[i].second;
summ[i + 1] = curr;
}
long long ans = 1e15;
for (long long i = 0; i <= n; i++) {
long long l = -1;
long long r = 1e9;
while (l < r - 1) {
long long m = (l + r) / 2;
if (abs(diffx - summ[n].first * m - summ[i].first) +
abs(diffy - summ[n].second * m - summ[i].second) - n * m - i >
0) {
l = m;
} else {
r = m;
}
}
for (long long j = max(l - 20, (long long)0); j < l + 20; j++) {
if (abs(diffx - summ[n].first * j - summ[i].first) +
abs(diffy - summ[n].second * j - summ[i].second) - n * j - i <=
0) {
ans = min(ans, i + n * j);
}
}
}
if (ans == 1e15) {
ans = -1;
}
cout << ans;
}
| 1,900 | CPP |
for s in[*open(0)][1:]:n,k=map(int,s.split());print(0--n//k*k//n) | 1,000 | PYTHON3 |
ln = int(input())
strg = str(input())
strg = strg.lower()
if (len(set(strg)) == 26):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 10000007;
const long long phi = 9988440;
long long n, a[60], dp[60][60], t;
long long dfs(int id, int pos, int lim, int num, int zero) {
if (pos == 0) return (!zero) && (num == id);
if (dp[pos][num] != -1 && !lim) return dp[pos][num];
int MAX = lim ? a[pos] : 1;
long long res = 0;
for (int i = 0; i <= MAX; i++) {
res += dfs(id, pos - 1, lim && (i == MAX), num + i, zero & (i == 0));
}
if (!lim) dp[pos][num] = res;
return res;
}
long long fans = 0;
long long fp(long long x, long long y) {
long long res = 1;
while (y) {
if (y & 1) res = res * x;
x = x * x;
y >>= 1;
}
return res;
}
void get(long long x) {
int cnt = 0;
while (x) {
a[++cnt] = x & 1;
x >>= 1;
}
memset(dp, -1, sizeof(dp));
int aim = log2(t) + 1;
fans = dfs(aim, cnt, 1, 0, 1);
if (aim == 1) fans--;
printf("%lld\n", fans);
}
int main() {
scanf("%lld%lld", &n, &t);
n++;
if (fp(2, log2(t)) == t) {
get(n);
} else {
printf("0\n");
return 0;
}
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
int IT_MAX = 1 << 19;
const long long MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
const double ERR = 1e-8;
int u[3050];
int oin[3050];
int ch[5050];
int in[5050];
vector<pair<int, int> > Vu[5050];
int val[5050];
int mx[5050][5050];
int sum[5050];
int rsum[5050];
int ans[5050];
int main() {
int N, i, j, k, l;
scanf("%d", &N);
for (i = 1; i <= N; i++) scanf("%d", &oin[i]);
for (i = 1; i <= N; i++) ch[i] = i;
sort(ch + 1, ch + N + 1, [](int a, int b) { return oin[a] < oin[b]; });
for (i = 1; i <= N; i++) in[i] = oin[ch[i]];
int X = N;
for (i = 0; i < X; i++) val[i] = in[i + 1] - in[i];
for (i = 0; i < X; i++) {
mx[i][i] = i;
for (j = i + 1; j < X; j++) {
mx[i][j] = mx[i][j - 1];
if (val[j] > val[mx[i][j]]) mx[i][j] = j;
}
}
for (i = 1; i <= X; i++) sum[i] = sum[i - 1] + 1;
for (i = 1; i <= X; i++)
for (j = sum[i - 1] + 1; j <= sum[i]; j++) rsum[j] = i;
rsum[sum[X] + 1] = X + 1;
int mx1 = -1, mx2 = -1, mx3 = -1;
int a1 = -1, a2 = -1, a3 = -1;
for (i = X; i >= 1; i--) {
for (j = i - 1; j >= 2; j--) {
int c1 = sum[X] - sum[i - 1], c2 = sum[i - 1] - sum[j - 1];
if (c1 * 2 < c2 || c2 * 2 < c1) continue;
int st = 0, en = INF;
st = max(st, (c1 + 1) / 2);
st = max(st, (c2 + 1) / 2);
en = min(en, c1 * 2);
en = min(en, c2 * 2);
en = min(en, sum[j - 1]);
if (st > en) continue;
int st2 = sum[j - 1] - en, en2 = sum[j - 1] - st;
int st3 = rsum[st2], en3 = rsum[en2 + 1] - 1;
if (st3 > en3) continue;
k = mx[st3][en3];
int m1 = val[i - 1], m2 = val[j - 1], m3 = val[k];
if (make_pair(mx1, pair<int, int>(mx2, mx3)) <
make_pair(m1, pair<int, int>(m2, m3))) {
a1 = i;
a2 = j;
a3 = k + 1;
mx1 = m1;
mx2 = m2;
mx3 = m3;
}
}
}
for (i = a1; i <= X; i++) ans[ch[i]] = 1;
for (i = a2; i < a1; i++) ans[ch[i]] = 2;
for (i = a3; i < a2; i++) ans[ch[i]] = 3;
for (i = 1; i < a3; i++) ans[ch[i]] = -1;
for (i = 1; i <= N; i++) printf("%d ", ans[i]);
return !printf("\n");
}
| 2,300 | CPP |
for t in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
pos=n-1
while(pos>0 and l[pos-1]>=l[pos]):
pos-=1
while(pos>0 and l[pos-1]<=l[pos]):
pos-=1
print(pos) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
static constexpr int MAXDELTA = 4000;
static constexpr int64_t MOD = 1000000007;
int64_t dp[MAXDELTA][MAXDELTA];
int main() {
int n, m;
std::cin >> n >> m;
int givenBalance = 0;
int minBalance = 0;
for (int i = 0; i < m; ++i) {
char c;
std::cin >> c;
if (c == ')')
--givenBalance;
else
++givenBalance;
minBalance = std::min(minBalance, givenBalance);
}
minBalance *= -1;
const int delta = n - m;
dp[0][0] = 1;
for (int i = 1; i <= delta; ++i) {
for (int j = 0; j <= i; ++j) {
dp[i][j] += dp[i - 1][j + 1];
if (j > 0) dp[i][j] += dp[i - 1][j - 1];
while (dp[i][j] >= MOD) dp[i][j] -= MOD;
}
}
int64_t ans = 0;
for (int i = 0; i <= delta; ++i) {
for (int j = minBalance; j <= i; ++j) {
if (j + givenBalance < MAXDELTA) {
ans += (dp[i][j] * dp[delta - i][j + givenBalance]) % MOD;
while (ans >= MOD) ans -= MOD;
}
}
}
std::cout << ans << std::endl;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int flag = 0;
char s[6][6];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> s[i][j];
for (int i = 0; i < 4; i++) {
if (flag) break;
for (int j = 0; j < 4; j++) {
if (s[i][j] == 'x' && s[i][j + 1] == 'x' &&
(s[i][j + 2] == '.' || s[i][j - 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i][j + 1] == '.' && s[i][j + 2] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j] == 'x' &&
(s[i + 2][j] == '.' || s[i - 1][j] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j] == '.' && s[i + 2][j] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j + 1] == 'x' &&
(s[i + 2][j + 2] == '.' || s[i - 1][j - 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j + 1] == '.' &&
s[i + 2][j + 2] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j - 1] == 'x' &&
(s[i + 2][j - 2] == '.' || s[i - 1][j + 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j - 1] == '.' &&
s[i + 2][j - 2] == 'x') {
cout << "YES";
flag = 1;
break;
}
}
}
if (!flag) cout << "NO";
return 0;
}
| 1,100 | CPP |
def inp():
return (int(input()))
t = inp()
nu = []
for i in range(0, t):
nu.append(inp())
for n in nu:
r=[]
if(n%4!=0):
print("NO")
else:
print("YES")
for i in range(1,int(n/2+1)):
r.append(i*2)
for i in range(1,int(n/2)):
r.append(i*2-1)
r.append(int((n/2*(4+(n/2-1)*2))/2-((n/2-1)*(2+(n/2-2)*2))/2))
print(*r, sep=' ')
| 800 | PYTHON3 |
s = input()
res = s.split('WUB')
res = [i for i in res if i]
print(" ".join(res)) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct yts {
long long x, y;
int id;
} q[1010], e[20];
yts operator-(yts x, yts y) { return (yts){x.x - y.x, x.y - y.y, 0}; }
int n, m, k;
int pre[20][1010];
int Q[1010], size[1 << 10];
bool vis[1010];
struct QQ {
long long len;
int id;
} que[1010];
bool cmp(QQ a, QQ b) { return a.len < b.len; }
long long cross(yts a, yts b) { return a.x * b.y - a.y * b.x; }
long long dianji(yts a, yts b) { return a.x * b.x + a.y * b.y; }
long long sqr(long long x) { return x * x; }
void get_pre(yts a[], yts b[]) {
for (int s = 1; s <= k; s++) {
for (int i = 1; i <= n; i++)
que[i] = (QQ){sqr(a[s].x - b[i].x) + sqr(a[s].y - b[i].y), i};
sort(que + 1, que + n + 1, cmp);
for (int i = 1; i <= n; i++) {
int x = que[i].id;
pre[s][x] = -1;
for (int j = 1; j < i; j++)
if (i != j && cross(b[x] - a[s], b[que[j].id] - a[s]) == 0 &&
dianji(b[x] - a[s], b[que[j].id] - a[s]) > 0)
pre[s][x] = que[j].id;
}
}
}
bool dfs(int S, int l, int r) {
if (r - l + 1 > k - size[S]) return 0;
if (l > r) return 1;
int L = l, R = r;
for (int i = 1; i <= k; i++)
if (!(S & (1 << (i - 1)))) {
int x = Q[l];
while (pre[i][x] != -1) {
if (!vis[pre[i][x]]) Q[++r] = pre[i][x], vis[pre[i][x]] = 1;
x = pre[i][x];
}
if (dfs(S | (1 << (i - 1)), l + 1, r)) return 1;
l = L;
while (r > R) vis[Q[r--]] = 0;
r = R;
}
return 0;
}
int main() {
scanf("%d%d", &k, &n);
for (int i = 1; i <= k; i++)
scanf("%I64d%I64d", &e[i].x, &e[i].y), e[i].id = i;
for (int i = 1; i <= n; i++)
scanf("%I64d%I64d", &q[i].x, &q[i].y), q[i].id = i;
for (int i = 1; i < 1 << k; i++) size[i] = size[i - (i & (-i))] + 1;
get_pre(e, q);
int ans = 0;
for (int i = 1; i <= n; i++) {
memset(vis, 0, sizeof(vis));
Q[1] = i;
if (dfs(0, 1, 1)) ans++;
}
printf("%d\n", ans);
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1000;
const int LMAX = 1000;
list<int> lst[LMAX + 1];
int L;
char path[LMAX + 1];
char ans[NMAX][LMAX + 1];
void dfs(int dep) {
int i;
if (!lst[dep].empty()) {
i = lst[dep].back();
lst[dep].pop_back();
path[dep] = '\0';
strcpy(ans[i], path);
if (dep == L)
while (L != 0 && lst[L].empty()) L--;
return;
}
path[dep] = '0';
dfs(dep + 1);
if (L > dep) {
path[dep] = '1';
dfs(dep + 1);
}
}
bool solve() {
dfs(0);
return L == 0;
}
int main() {
int n, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &j);
lst[j].push_back(i);
if (j > L) L = j;
}
if (solve()) {
puts("YES");
for (i = 0; i < n; i++) puts(ans[i]);
} else {
puts("NO");
}
return 0;
}
| 1,900 | CPP |
n = int(input())
seta = ((n + 1) * n) // 2
if seta % 2 == 0:
print(0)
else:
print(1)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long lmao(long long len, long long ind) {
if (len == 1) return 0;
long long bse = len / 4;
long long res = 0;
if (ind / bse == 0) {
res = 0;
res += lmao(len / 4, ind % bse);
} else if (ind / bse == 1) {
res = 2 * bse;
res += lmao(len / 4, ind % bse);
} else if (ind / bse == 2) {
res = 3 * bse;
res += lmao(len / 4, ind % bse);
} else if (ind / bse == 3) {
res = 1 * bse;
res += lmao(len / 4, ind % bse);
}
return res;
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
long long n;
cin >> n;
--n;
long long trip = n / 3;
long long len = 1;
while (trip - len >= 0) {
trip -= len;
len *= 4;
}
long long a[3];
a[0] = len + trip;
a[1] = 2 * len + lmao(len, trip);
a[2] = a[0] ^ a[1];
cout << a[n % 3] << '\n';
}
}
| 2,200 | CPP |
n=input()
i=0
ans=0
count=1
while i<len(n)-1:
temp=n[i]
if count>=7:
break
if n[i+1]==temp:
count=count+1
i=i+1
else:
count=1
i=i+1
if count>=7:
print("YES")
else:
print("NO")
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3fffffff;
const long long mod = 1000000007;
const int maxn = 20 + 10;
long long get(long long x) {
if (x == 0) return 0;
if (x == 1) return 1;
long long ans = 0;
long long t1 = x;
int cnt = 0;
while (t1) cnt++, t1 /= 2;
long long t = 4;
long long p = (x + 1) / 2;
if (p & 1) ans = 1;
for (int i = 2; i < cnt + 1; i++) {
long long p = (x + 1) % t;
if (p > t / 2) {
p -= t / 2;
if (p & 1) ans |= 1ll << (i - 1);
}
t *= 2;
}
return ans;
}
long long get1(long long x) {
long long ans = 0;
for (long long i = 1; i <= x; i++) ans ^= i;
return ans;
}
int main() {
int n;
scanf("%d", &n);
long long ans = 0;
while (n--) {
long long a, b;
scanf("%lld%lld", &a, &b);
ans ^= get(a - 1) ^ get(b + a - 1);
}
if (ans)
puts("tolik");
else
puts("bolik");
return 0;
}
| 2,000 | CPP |
from sys import stdin
input=lambda : stdin.readline().strip()
lin=lambda :list(map(int,input().split()))
iin=lambda :int(input())
main=lambda :map(int,input().split())
from math import ceil,sqrt,factorial,log
from collections import deque
from bisect import bisect_left
def gcd(a,b):
a,b=max(a,b),min(a,b)
while a%b!=0:
a,b=b,a%b
return b
mod=998244353
def solve(we):
n=int(input())
l=lin()
ma=0
d={}
for i in range(n):
if l[i] in d:
d[l[i]].append(i+1)
else:
d[l[i]]=[i+1]
ma=max(ma,len(d[l[i]]))
if len(d)==1:
print("NO")
else:
print("YES")
t=0
for i in d:
if t==0:
x=d[i].pop()
x1=i
elif t==1:
y=d[i].pop()
y1=i
else:
break
t+=1
print(x,y)
for i in d:
if i==x1:
for j in d[i]:
print(y,j)
else:
for j in d[i]:
print(x,j)
qwe=1
qwe=int(input())
for _ in range(qwe):
solve(_+1) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
struct line {
line(int dx_, int dy_, int X_, int Y_)
: dx(dx_), dy(dy_), X(X_), Y(Y_), ind(cnt++) {
if (dx < 0) {
dx *= -1;
dy *= -1;
}
}
static int cnt;
int dx, dy, X, Y, ind;
};
int line::cnt = 0;
bool operator==(const line& a, const line& b) {
if (!a.dx) return !b.dx;
if (!a.dy) return !b.dy;
if (!b.dx) return !a.dx;
if (!b.dy) return !a.dy;
return ((long long)a.dx * (long long)b.dy ==
(long long)b.dx * (long long)a.dy);
}
bool operator<(const line& a, const line& b) {
if (a == b) return false;
if (!a.dx) return true;
if (!b.dx) return false;
if (!a.dy) return true;
if (!b.dy) return false;
return ((long double)a.dx / (long double)a.dy) <
((long double)b.dx / (long double)b.dy);
}
bool same(const line& a, const line& b) {
int x1 = a.X, x2 = b.X, y1 = a.Y, y2 = b.Y;
if (!(a == b)) return false;
return line(x2 - x1, y2 - y1, x1, y1) == a;
}
struct sline : public line {
sline(line* rhs) : line(*rhs) {}
};
bool operator==(const sline& a, const sline& b) { return same(a, b); }
bool operator<(const sline& a, const sline& b) {
if (a == b) return false;
if (!a.dy && !b.dy) return a.Y < b.Y;
return ((long double)a.X -
((long double)a.dx / (long double)a.dy) * (long double)a.Y) <
((long double)b.X -
((long double)b.dx / (long double)b.dy) * (long double)b.Y);
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int n;
std::cin >> n;
std::vector<int> x(n), y(n);
for (int i = 0; i < n; ++i) std::cin >> x[i] >> y[i];
std::vector<line> a;
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
a.push_back(line(x[i] - x[j], y[i] - y[j], x[i], y[i]));
std::sort(a.begin(), a.end());
std::vector<int> num;
int ALL = 0;
for (int i = 0; i < a.size();) {
int j = i;
while (j + 1 < a.size() && a[j + 1] == a[i]) ++j;
std::set<sline> curnum;
for (int k = i; k <= j; ++k) curnum.insert(sline(&a[k]));
num.push_back(curnum.size());
ALL += curnum.size();
i = j + 1;
}
long long ans = 0;
for (int i = 0; i < num.size(); ++i)
ans += (long long)num[i] * ((long long)ALL - (long long)num[i]);
std::cout << ans / 2LL << std::endl;
char I;
std::cin >> I;
}
| 1,900 | CPP |
testCases = int(input())
for _ in range(testCases):
n = int(input())
ar = list(input())
flags = [[],[]]
count = 0
for idx, b in enumerate(ar):
b = int(b)
if not b and flags[1]:
ar[idx] = flags[1][0]
temp = flags[1].pop(0)
flags[0].append(temp)
elif b and flags[0]:
ar[idx] = flags[0][0]
temp = flags[0].pop(0)
flags[1].append(temp)
else:
count += 1
ar[idx] = count
flags[b].append(count)
print(count)
print(*ar) | 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int len, now, dp[MAXN][2];
char S[MAXN], T[MAXN];
int main() {
int i;
scanf("%s", S + 1);
len = strlen(S + 1);
for (i = 1; i <= len; i++) {
dp[i][1] = dp[i - 1][1];
dp[i][0] = dp[i - 1][0];
if (S[i] == '1')
dp[i][1] = max(dp[i - 1][1] + 1, dp[i - 1][0] + 1);
else
dp[i][0] = dp[i - 1][0] + 1;
}
if (dp[len][0] >= dp[len][1]) {
for (i = 1; i <= len; i++) printf("%c", S[i]);
return 0;
}
now = dp[len][1] - dp[len][0];
for (i = len; i >= 1; i--) {
if (S[i] == '0')
T[i] = '0';
else {
if (dp[i][1] - dp[i][0] == now) {
T[i] = '0';
now--;
} else
T[i] = '1';
}
}
for (i = 1; i <= len; i++) printf("%c", T[i]);
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 500;
int n;
bool ask(int a1, int b1, int a2, int b2) {
cout << "? " << a1 << " " << b1 << " " << a2 << " " << b2 << endl;
string answer;
cin >> answer;
return (answer == "YES");
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
string firstHalf;
{
int a = 1, b = 1;
for (int step = 1; step <= n - 1; step++) {
if (a < n && ask(a + 1, b, n, n) == true) {
firstHalf += "D";
a++;
} else {
firstHalf += "R";
b++;
}
}
}
string secondHalf;
{
int a = n, b = n;
for (int step = 1; step <= n - 1; step++) {
if (b > 1 && ask(1, 1, a, b - 1) == true) {
secondHalf += "R";
b--;
} else {
secondHalf += "D";
a--;
}
}
reverse(secondHalf.begin(), secondHalf.end());
}
cout << "! " << firstHalf << secondHalf << endl;
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
long long M = 1000000007;
vector<long long> fac(300001);
vector<long long> ifac(300001);
long long mpow(long long x, long long n) {
long long ans = 1;
while (n != 0) {
if (n & 1) ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
long long comb(long long a, long long b) {
if (a == 0 && b == 0) return 1;
if (a < b || a < 0) return 0;
long long tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
long long modinv(long long a) {
long long b = M, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= M;
if (u < 0) u += M;
return u;
}
vector<vector<long long>> mul(vector<vector<long long>> a,
vector<vector<long long>> b, int n) {
int i, j, k, t;
vector<vector<long long>> c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
t = 0;
for (k = 0; k < n; k++) t = (t + a[i][k] * b[k][j] % M) % M;
c[i].push_back(t);
}
}
return c;
}
template <typename Monoid>
struct SegmentTree {
int sz;
vector<Monoid> seg;
const Monoid M1;
SegmentTree(int n, const Monoid &M1) : M1(M1) {
sz = 1;
while (sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) L = f(L, seg[a++]);
if (b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid value(const int &k) const { return seg[k + sz]; }
Monoid f(Monoid a, Monoid b) { return a + b; }
};
int main() {
int n, m, p, i, j;
cin >> n >> m;
p = 1;
while (1) {
if (n * m == 0) break;
if (n == 1) {
if (m % 2 == 0) {
for (i = 0; i < m / 2; i++) {
printf("%d %d\n", p, p + i);
printf("%d %d\n", p, p + m - i - 1);
}
} else {
for (i = 0; i < m / 2; i++) {
printf("%d %d\n", p, p + i);
printf("%d %d\n", p, p + m - i - 1);
}
printf("%d %d\n", p, p + m / 2);
}
break;
}
if (m == 1) {
if (n % 2 == 0) {
for (i = 0; i < n / 2; i++) {
printf("%d %d\n", p + i, p);
printf("%d %d\n", p + n - i - 1, p);
}
} else {
for (i = 0; i < n / 2; i++) {
printf("%d %d\n", p + i, p);
printf("%d %d\n", p + n - i - 1, p);
}
printf("%d %d\n", p + n / 2, p);
}
break;
}
for (i = 0; i < n; i++) {
printf("%d %d\n", p + i, p);
printf("%d %d\n", p + n - i - 1, p + m - 1);
}
for (i = 0; i < m - 2; i++) {
printf("%d %d\n", p, p + 1 + i);
printf("%d %d\n", p + n - 1, p + m - i - 2);
}
n -= 2;
m -= 2;
p++;
}
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
double x[2005], y[2005];
double d[2005];
double eps = 1e-11;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
x[i] = 1.0 * a * c / (a * a + b * b);
y[i] = 1.0 * b * c / (a * a + b * b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
if (abs(x[i] - x[j]) <= eps) {
if (abs(y[i] - y[j]) > eps)
d[j] = 214748364.0;
else
d[j] = -214748364.0;
} else
d[j] = 1.0 * (y[i] - y[j]) / (x[i] - x[j]);
}
sort(d + 1, d + i);
d[0] = -214748364.0;
int cnt = 1;
for (int j = 1; j < i; j++) {
if (d[j] == -214748364.0)
ans += (i - j - 1);
else if (abs(d[j] - d[j - 1]) > eps) {
ans += cnt * (cnt - 1) / 2;
cnt = 1;
} else
cnt++;
}
ans += cnt * (cnt - 1) / 2;
}
printf("%d\n", ans);
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n, a;
cin >> n >> a;
if (a % 2) a = n - a + 1;
int ans = 1;
ans += (n - a) / 2;
cout << ans;
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
int prime[400000], mount[400000];
int main(int argc, char** argv) {
int n, i = 1, k = 0, a = 0, b = 1, m, max = 0, w = 1, p = 0, c = 0;
scanf("%d", &n);
if (n == 1) {
printf("1 0");
return 0;
}
while (n != 1) {
for (i = 2; i <= n; i++) {
if (n % i == 0) {
if (i == prime[k]) {
mount[k]++;
} else {
k++;
prime[k] = i;
mount[k]++;
}
n = n / i;
break;
}
}
}
for (i = 1; i <= k; i++) {
b = b * prime[i];
}
for (i = 1; i <= k; i++) {
if (mount[i] > max) {
max = mount[i];
}
}
if (max == 1) {
printf("%d 0", b);
return 0;
}
while (1) {
p++;
w = w * 2;
if (w >= max) {
break;
}
}
a = p;
for (i = 1; i <= k; i++) {
c = c + w - mount[i];
}
if (c != 0) {
a++;
}
printf("%d %d", b, a);
return 0;
}
| 1,500 | CPP |
n,k=map(int,input().split())
l=n-n//2
print(2*k-1) if k<=l else print(2*(k-l)) | 900 | PYTHON3 |
#include <bits/stdc++.h>
const int M = 1e6 + 5;
int n, d[305], u[M], v[M], nd, du[1005], m, sum;
inline void push(int a, int b) {
u[++m] = a;
v[m] = b;
}
inline void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
for (int i = 1; i <= n; i++) {
if (i > (n - i + 1)) break;
for (int a = d[i - 1] + 1; a <= d[i]; a++)
for (int b = a + 1; b <= d[n - i + 1] + 1; b++) push(a, b);
}
printf("%d\n", m);
for (int i = 1; i <= m; i++) printf("%d %d\n", u[i], v[i]);
}
int main() { solve(); }
| 2,500 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.