solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
for s in[*open(0)][2::2]:a=sorted(map(int,s.split()));s=sum(a);print(*(['YES']+a[::2*(s<0)-1],['NO'])[s==0]) | 900 | PYTHON3 |
# coding: utf-8
s = input()
ans = 0
while s.find('bear') != -1:
index = s.find('bear')
ans += (index+1)*(len(s)-index-4+1)
s = s[index+1:]
print(ans)
| 1,200 | PYTHON3 |
t = int(input())
cnt = 0
while (cnt < t):
cnt += 1
n = int(input())
p = [int(i) for i in input().split()]
lens = []
mx = -1
local_max = []
for i in range(2 * n):
if p[i] > mx:
mx = p[i]
local_max.append(i + 1)
local_max.append(2 * n + 1)
for i in range(1, len(local_max)):
lens.append(local_max[i] - local_max[i - 1])
dp = [0] * (n + 1)
dp[0] = 1
lens.sort()
for i in range(len(lens)):
a = [0] * (n + 1)
for j in range(lens[i], n + 1):
if dp[j] == 0 and dp[j - lens[i]] == 1 and a[j - lens[i]] == 0:
a[j] += 1
dp[j] = 1
print('YES' if dp[n] else 'NO')
| 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.length();
if (!s[n - 1] & 1) {
for (int i = 0; i < n; i++) {
if (s[i] % 2 == 0 && s[i] < s[n - 1]) {
swap(s[i], s[n - 1]);
break;
}
}
cout << s << endl;
} else {
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] % 2 == 0) count++;
}
if (count == 0)
cout << "-1";
else {
for (int i = 0; i < n; i++) {
if (s[i] % 2 == 0) {
count--;
if (count == 0)
swap(s[i], s[n - 1]);
else if (s[i] < s[n - 1]) {
swap(s[i], s[n - 1]);
break;
}
}
}
cout << s << endl;
}
}
}
| 1,300 | CPP |
def shortstring(s):
return s[0]+str(len(s)-2)+s[-1] if len(s)>10 else s
n=int(input())
for _ in range(n):
print(shortstring(input()))
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int psb[26], tmp[26];
char c[101010], d[4];
int main() {
int n, i, j, st = 26, ans = 0;
scanf("%d", &n);
for (i = 0; i < 26; i++) psb[i] = 1;
for (i = 0; i < n - 1; i++) {
scanf("%s %s", &d, &c);
if (d[0] == '.') {
for (j = 0; j < strlen(c); j++) psb[c[j] - 'a'] = 0;
} else if (d[0] == '!') {
if (st == 1) ans++;
for (j = 0; j < 26; j++) tmp[j] = 0;
for (j = 0; j < strlen(c); j++) tmp[c[j] - 'a'] = 1;
for (j = 0; j < 26; j++) psb[j] = psb[j] & tmp[j];
} else {
if (st == 1) ans++;
psb[c[0] - 'a'] = 0;
}
st = 0;
for (j = 0; j < 26; j++) st += psb[j];
}
scanf("%s %s", &d, &c);
printf("%d", ans);
}
| 1,600 | CPP |
for t in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
l.sort()
flag=0
for j in range(n-1,-1,-1):
if l[j]<=j+1:
flag=1
print(j+2)
break
if flag==0:
print(1) | 1,000 | PYTHON3 |
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
bool b = 0;
for (int i = 0; i <= 11; ++i) {
if (n % 11 == 0) {
cout << "yes";
b = 1;
break;
}
n -= 111;
if (n < 0)
break;
}
if (!b)
cout << "no";
cout << endl;
}
} | 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> ma;
void primeFactors(int n) {
while (n % 2 == 0) {
ma.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
ma.push_back(i);
n = n / i;
}
}
if (n > 2) {
ma.push_back(n);
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int x, y, z = 1;
cin >> x >> y;
primeFactors(x);
if (ma.size() < y) {
cout << -1;
exit(0);
}
for (int i = 0; i <= ma.size() - y; i++) z *= ma[i];
if (z != 1) cout << z << ' ';
for (int i = ma.size() - y + 1; i < ma.size(); i++) cout << ma[i] << ' ';
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000, mod = 1000000009, P = 1145141, invP = 154020336, C = 30;
int pw[2][N + 9];
void Get_pw() {
pw[0][0] = pw[1][0] = 1;
for (int i = 1; i <= N; ++i) {
pw[0][i] = (long long)pw[0][i - 1] * P % mod;
pw[1][i] = (long long)pw[1][i - 1] * invP % mod;
}
}
struct str {
int x, n;
str() { x = n = 0; }
str(int X, int N = 1) {
x = X;
n = N;
}
bool operator==(const str &p) const { return x == p.x && n == p.n; }
str operator+(const str &p) const {
return str((x + (long long)p.x * pw[0][n]) % mod, n + p.n);
}
str operator-(const str &p) const {
return str((long long)(x - p.x + mod) * pw[1][p.n] % mod, n - p.n);
}
};
int n, m, a[N + 9];
void into() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
}
struct tree {
int flag;
str vl, vr;
tree() {}
tree(int x) {
flag = 0;
x > 0 ? vr = str(x) : vl = str(-x);
}
} tr[N * 4 + 9];
str Query_h0(int p, int k) {
if (!p) return str();
if (p == tr[k].vl.n) return tr[k].vl;
int ls = k << 1, rs = k << 1 | 1;
if (p <= tr[ls].vl.n) return Query_h0(p, ls);
return tr[ls].vl + (Query_h0(p - tr[ls].vl.n + tr[ls].vr.n, rs) - tr[ls].vr);
}
str Query_h1(int p, int k) {
if (!p) return str();
if (p == tr[k].vr.n) return tr[k].vr;
int ls = k << 1, rs = k << 1 | 1;
if (p <= tr[rs].vr.n) return Query_h1(p, rs);
return tr[rs].vr + (Query_h1(p - tr[rs].vr.n + tr[rs].vl.n, ls) - tr[rs].vl);
}
void Pushup(int k) {
int ls = k << 1, rs = k << 1 | 1;
if (tr[ls].flag || tr[rs].flag) {
tr[k].flag = 1;
return;
}
tr[k].flag = 0;
tr[k].vl = tr[ls].vl;
tr[k].vr = tr[rs].vr;
tr[ls].vr.n <= tr[rs].vl.n
? tr[ls].vr == Query_h0(tr[ls].vr.n, rs)
? tr[k].vl = tr[k].vl + (tr[rs].vl - tr[ls].vr)
: tr[k].flag = 1
: tr[rs].vl == Query_h1(tr[rs].vl.n, ls)
? tr[k].vr = tr[k].vr + (tr[ls].vr - tr[rs].vl)
: tr[k].flag = 1;
}
void Build(int l, int r, int k) {
if (l == r) {
tr[k] = tree(a[l]);
return;
}
int mid = l + r >> 1;
Build(l, mid, k << 1);
Build(mid + 1, r, k << 1 | 1);
Pushup(k);
}
void Change(int p, int v, int l, int r, int k) {
if (l == r) {
tr[k] = tree(v);
return;
}
int mid = l + r >> 1;
p <= mid ? Change(p, v, l, mid, k << 1)
: Change(p, v, mid + 1, r, k << 1 | 1);
Pushup(k);
}
int sta[C * 2 + 9], cst;
void Query_sta(int L, int R, int l, int r, int k) {
if (L <= l && R >= r) {
sta[++cst] = k;
return;
}
int mid = l + r >> 1;
if (L <= mid) Query_sta(L, R, l, mid, k << 1);
if (R > mid) Query_sta(L, R, mid + 1, r, k << 1 | 1);
}
str now[C * 2 + 9];
str Query_h(int p, int k) {
if (!p) return str();
if (p == now[k].n) return now[k];
if (p <= tr[sta[k]].vr.n) return Query_h1(p, sta[k]);
return tr[sta[k]].vr +
(Query_h(p - tr[sta[k]].vr.n + tr[sta[k]].vl.n, k - 1) -
tr[sta[k]].vl);
}
bool Query_ans(int L, int R) {
cst = 0;
Query_sta(L, R, 1, n, 1);
for (int i = 1; i <= cst; ++i) {
int k = sta[i];
if (tr[k].flag) return 0;
if (now[i - 1].n < tr[k].vl.n) return 0;
if (tr[k].vl == Query_h(tr[k].vl.n, i - 1))
now[i] = tr[k].vr + (now[i - 1] - tr[k].vl);
else
return 0;
}
return !now[cst].n;
}
void work() {
Get_pw();
Build(1, n, 1);
}
void outo() {
int cq;
scanf("%d", &cq);
for (; cq--;) {
int opt, x, y;
scanf("%d%d%d", &opt, &x, &y);
if (opt == 1)
Change(x, y, 1, n, 1);
else
puts(Query_ans(x, y) ? "Yes" : "No");
}
}
int main() {
into();
work();
outo();
return 0;
}
| 3,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 123;
inline int get_type(char ch) {
switch (ch) {
case 'A':
return 0;
case 'T':
return 1;
case 'G':
return 2;
case 'C':
return 3;
}
}
template <int N>
class SEGMENT_TREE {
private:
struct node {
int sum[4];
} t[N * 4];
void pushup(int x) {
for (int i = 0; i < 4; i++)
t[x].sum[i] = t[x << 1].sum[i] + t[x << 1 | 1].sum[i];
}
public:
void update(int x, int l, int r, int p, int type) {
if (l == r) {
memset(t[x].sum, 0, sizeof t[x].sum);
t[x].sum[type] = 1;
return;
}
int md = l + r >> 1;
if (p <= md)
update(x << 1, l, md, p, type);
else
update(x << 1 | 1, md + 1, r, p, type);
pushup(x);
}
int query(int x, int l, int r, int L, int R, int type) {
if (l >= L && r <= R) {
return t[x].sum[type];
}
int md = l + r >> 1;
if (L <= md && R > md)
return query(x << 1, l, md, L, R, type) +
query(x << 1 | 1, md + 1, r, L, R, type);
else if (L <= md)
return query(x << 1, l, md, L, R, type);
else
return query(x << 1 | 1, md + 1, r, L, R, type);
}
};
SEGMENT_TREE<N> tree[10];
char s[N];
int n;
void update(int pos, int type) {
pos--;
for (int d = 1; d <= 10; d++) {
int true_pos = (pos % d) * (n / d) + min(pos % d, n % d) + pos / d + 1;
tree[d - 1].update(1, 1, n, true_pos, type);
}
}
int query(int l, int r, char foo[]) {
l--;
r--;
int d = strlen(foo), res = 0, tot = 0;
for (int i = 0; i < d; i++) {
int L = l / d, R = r / d;
while (L * d + i < l) L++;
while (R * d + i > r) R--;
L = L + tot + 1;
R = R + tot + 1;
int type = get_type(foo[((i - l) % d + d) % d]);
if (L <= R) res += tree[d - 1].query(1, 1, n, L, R, type);
tot += n / d + (i < n % d);
}
return res;
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) update(i, get_type(s[i]));
int q;
scanf("%d", &q);
while (q--) {
int tp, l, r;
char foo[20];
scanf("%d %d", &tp, &l);
if (tp == 1) {
scanf("%s", foo);
update(l, get_type(foo[0]));
} else {
scanf("%d %s", &r, foo);
printf("%d\n", query(l, r, foo));
}
}
return 0;
}
| 2,100 | CPP |
s=input()
s=s.replace(' ','')
l=len(s)-2
w=['A','E','I','O','U','Y','a','e','i','o','u','y']
f=0
for i in w:
if(i==s[l]):
f=0
break
else:
f=1
if(f==0):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t, x;
cin >> t;
for (int i = 0; i < t; i++) {
string s;
cin >> s >> x;
bool possible = true;
for (int j = 0; j < s.size(); j++) {
if (s[j] == '1') {
possible = false;
if (j > x - 1) {
if (j < 2 * x or s[j - 2 * x] == '1') possible = true;
}
if (j < s.size() - x) {
if (j > (int)s.size() - 2 * x - 1 or s[j + 2 * x] == '1')
possible = true;
}
if (!possible) {
break;
}
}
}
if (!possible) {
cout << -1 << "\n";
} else {
for (int j = 0; j < s.size(); j++) {
if ((j > x - 1 and s[j - x] == '0') or
(j < s.size() - x and s[j + x] == '0')) {
cout << 0;
} else {
cout << 1;
}
}
cout << "\n";
}
}
}
| 1,500 | CPP |
a, b, c, d = list(map(int,input().split()))
b -= a
c -= d
arr = []
k = True
if b >= 0 and c >=0:
if a == 0 and b == 0 and c==1:
print("YES")
arr.append(2)
for i in range (d):
arr.append(3)
arr.append(2)
print(*arr,sep = " ")
k = False
elif d == 0 and c == 0 and b == 1:
print("YES")
arr.append(1)
for i in range (a):
arr.append(0)
arr.append(1)
print(*arr, sep = " ")
k = False
elif b == c and k:
print("YES")
if b == 0:
for i in range (a):
arr.append(0)
arr.append(1)
for i in range (d):
arr.append(2)
arr.append(3)
else:
for i in range (a):
arr.append(1)
arr.append(0)
for i in range(b):
arr.append(1)
arr.append(2)
for i in range (d):
arr.append(3)
arr.append(2)
print(*arr, sep = " ")
elif c - b == 1 and k:
print("YES")
if a > 0:
for i in range (a - 1):
arr.append(0)
arr.append(1)
arr.append(0)
arr.append(1)
arr.append(2)
else:
arr.append(2)
for i in range (c - 1):
arr.append(1)
arr.append(2)
for i in range (d):
arr.append(3)
arr.append(2)
print(*arr, sep = " ")
elif b - c == 1 and k:
print("YES")
for i in range (a):
arr.append(1)
arr.append(0)
for i in range (b - 1):
arr.append(1)
arr.append(2)
arr.append(1)
if d > 0:
arr.append(2)
for i in range (d - 1):
arr.append(3)
arr.append(2)
arr.append(3)
print(*arr, sep = " ")
else:
print ("NO")
else:
if b == -1 and d == 0 and c == 0:
print("YES")
for i in range (a-1):
arr.append(0)
arr.append(1)
arr.append(0)
print(*arr,sep = " ")
elif a == 0 and b == 0 and c == -1:
print("YES")
for i in range (d-1):
arr.append(3)
arr.append(2)
arr.append(3)
print(*arr,sep = " ")
else:
print("NO") | 1,900 | PYTHON3 |
a=input()
b=input()
c=input()
if len(c)!=len(a)+len(b):
print('NO')
else:
find=True
i=0
while i<len(a):
if a[i] in c:
st=c.find(a[i])
c=c[:st]+c[st+1:]
i=i+1
else:
print('NO')
find=False
break
while find==True:
i=0
while i<len(b):
if b[i] in c:
stt=c.find(b[i])
c=c[:stt]+c[stt+1:]
i=i+1
else:
print('NO')
find=False
break
if len(c)==0:
print('YES')
break | 800 | PYTHON3 |
import math
t=int(input())
for _ in range(t):
n,d=map(int,input().split())
for i in range(n):
flag=0
if(i+math.ceil(d/(i+1))<=n):
flag=1
break
if flag==1:
print("YES")
else:
print("NO") | 1,100 | PYTHON3 |
n = input()
k = 0
for i in n:
if int(i) == 4 or int(i) == 7:
k+=1
if k == 4 or k == 7:
print('YES')
else:
print('NO')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
map<string, string> mp;
int main() {
int n, m;
string a, b;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
mp[b + ";"] = a;
}
for (int i = 1; i <= m; i++) {
cin >> a >> b;
cout << a << " " << b << " #" << mp[b] << endl;
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long act(0), ans(0);
cin >> s;
for (int i(s.size() - 1); i >= 0; i--) {
if (s[i] == 'a')
ans = (ans + act) % 1000000007, act = 2 * act % 1000000007;
else
act++;
}
cout << ans;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, mod;
const int maxn = 410;
int ans[maxn];
int dp[maxn];
int fac[maxn];
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
if (x < 0) x += mod;
}
int ho[maxn];
int DP[maxn][maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> q >> mod;
dp[1] = fac[1] = 1;
for (int i = 2; i <= 400; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
for (int i = 2; i <= 400; i++) {
dp[i] = fac[i];
for (int j = 1; j < i; j++) add(dp[i], -1LL * dp[j] * fac[i - j] % mod);
}
for (int i = 4; i <= 400; i++) {
for (int j = 1; j < i; j++) add(ho[i], 1LL * dp[j] * fac[i - j] % mod);
add(ho[i], ho[i]);
}
ans[4] = 2;
DP[4][4] = 1;
DP[0][0] = 1;
for (int i = 1; i <= 400; i++) {
DP[i][i] = 1;
for (int j = 1; j < i; j++) {
for (int k = 1; k <= i - j + 1; k++)
add(DP[i][j], 1LL * fac[k] * DP[i - k][j - 1] % mod);
}
}
for (int i = 5; i <= 400; i++) {
ans[i] = fac[i];
add(ans[i], -ho[i]);
for (int j = 4; j < i; j++) add(ans[i], -1LL * DP[i][j] * ans[j] % mod);
}
while (q--) {
int x;
cin >> x;
if (x == 1)
cout << 1 << '\n';
else if (x == 2)
cout << 2 << '\n';
else if (x == 3)
cout << 0 << '\n';
else
cout << ans[x] << '\n';
}
}
| 2,600 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("trapv")
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " : " << a << endl;
err(++it, args...);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
;
int cas;
cin >> cas;
while (cas--) {
int n, k;
cin >> n >> k;
vector<pair<int, int> > v(n);
for (long long int i = 0; i < (n); ++i) {
cin >> v[i].first;
v[i].second = i;
}
sort((v).begin(), (v).end());
int cnt = 1;
for (long long int i = 0; i < ((int)(v).size() - 1); ++i) {
if (v[i].second + 1 != v[i + 1].second) cnt++;
}
if (cnt <= k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| 1,100 | CPP |
inp=input
li=list
iinp=lambda : int(inp())
ent=lambda : map(int,inp().split())
lient=lambda : [int(i) for i in inp().split()]
li0= lambda x: [0 for i in range(x)]
n=iinp()
din=lient()
res=0
maxi=max(din)
for i in din: res+=maxi-i
print(res) | 800 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
lis=list(map(int,input().split()))
num=[0 for i in range(51)]
l1=[]
for i in lis:
if num[i]==0:
l1.append(i)
num[i]=1
print(*l1) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int cnt_test;
int n, m;
int a[200001], b[200001];
int idx[200001];
set<int> st;
long long ans;
template <typename T>
inline T read() {
T x = 0;
T multiplier = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') {
multiplier = -1;
}
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch & 15);
ch = getchar();
}
return x * multiplier;
}
int main() {
cnt_test = read<int>();
while (cnt_test--) {
st.clear();
n = read<int>(), m = read<int>();
for (int i = 1; i <= n; i++) {
a[i] = read<int>();
idx[a[i]] = i;
}
for (int i = 1; i <= m; i++) {
b[i] = read<int>();
st.insert(b[i]);
}
ans = 1;
for (int i = 1; i <= m; i++) {
int cnt = 0;
st.erase(b[i]);
if (idx[b[i]] > 1 && st.count(a[idx[b[i]] - 1]) == 0) {
cnt++;
}
if (idx[b[i]] < n && st.count(a[idx[b[i]] + 1]) == 0) {
cnt++;
}
(ans *= cnt) %= MOD;
}
printf("%lld\n", ans);
}
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T>
inline void chkmax(T &x, T y) {
if (x < y) x = y;
}
template <typename T>
inline void chkmin(T &x, T y) {
if (x > y) x = y;
}
inline int read() {
int x = 0;
char c = getchar();
while (c < 48) c = getchar();
while (c > 47) x = x * 10 + (c ^ 48), c = getchar();
return x;
}
int n, m, g1, g2, s1, s2;
int dis[55][55];
bool isg[55], iss[55], isb[55];
int mn[55], mx[55];
long long dp[55][55];
void solve() {
cin >> n >> m;
for (int i = (1), iend = (n); i <= iend; ++i)
for (int j = (1), jend = (n); j <= jend; ++j) {
dis[i][j] = i == j ? 0 : 1e9;
}
for (int i = (1), iend = (m); i <= iend; ++i) {
int u = read(), v = read();
dis[u][v] = dis[v][u] = read();
}
for (int k = (1), kend = (n); k <= kend; ++k)
for (int i = (1), iend = (n); i <= iend; ++i)
for (int j = (1), jend = (n); j <= jend; ++j) {
chkmin(dis[i][j], dis[i][k] + dis[k][j]);
}
memset(mn, 0x3f, sizeof mn);
memset(mx, -0x3f, sizeof mx);
for (int i = (1), iend = (n); i <= iend; ++i)
for (int j = (1), jend = (n); j <= jend; ++j)
if (i != j) {
dis[i][j] = dis[i][j] * 50 + i;
chkmin(mn[i], dis[i][j]), chkmax(mx[i], dis[i][j]);
}
long long ans = 0;
cin >> g1 >> g2 >> s1 >> s2;
for (int i = (1), iend = (n); i <= iend; ++i)
for (int j = (1), jend = (n); j <= jend; ++j)
if (i != j && mn[i] < mx[j]) {
for (int k = (1), kend = (n); k <= kend; ++k) {
isg[k] = mn[k]<mn[i], isb[k] = mx[k]> mx[j], iss[k] = 0;
for (int p = (1), pend = (n); p <= pend; ++p)
if (dis[k][p] > mn[i] && dis[k][p] < mx[j]) {
iss[k] = 1;
break;
}
}
isg[i] = 1, iss[i] = isb[i] = 0;
isb[j] = 1, isg[j] = iss[j] = 0;
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
for (int k = (1), kend = (n); k <= kend; ++k)
for (int p = (g2), pend = (0); p >= pend; --p)
for (int q = (s2), qend = (0); q >= qend; --q) {
if (!isb[k]) dp[p][q] = 0;
if (isg[k] && p) dp[p][q] += dp[p - 1][q];
if (iss[k] && q) dp[p][q] += dp[p][q - 1];
}
for (int p = (g1), pend = (g2); p <= pend; ++p)
for (int q = (s1), qend = (s2); q <= qend; ++q) ans += dp[p][q];
}
cout << ans << endl;
}
signed main() {
solve();
return 0;
}
| 2,400 | CPP |
n, m = input().split()
n = int(n)
m = int(m)
S_mn = n * m
S_p = 2*1
count = int(S_mn / S_p)
print(count)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void setTest() {
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
}
void closeTest() {
fclose(stdin);
fclose(stdout);
}
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.second == b.second) return a.first > b.first;
return a.second > b.second;
}
int solve() {
string st;
cin >> st;
int ans = 0;
for (int i = 0; i < st.length(); i++) {
if (st[i] == 'L') {
int cnt = 1;
int j = i + 1;
while (st[j] == 'L') j++, cnt++;
ans = max(ans, cnt);
i = j;
}
}
return ans + 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
for (int i = 0; i < t; i++) {
cout << solve() << endl;
}
return 0;
}
| 1,100 | CPP |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
#New Imports
def solution():
n,k = map(int,input().split())
a = list(map(int,input().split()))
val = len(set(a))
if k == 1:
if val == 1:
print(1)
else:
print(-1)
return
if val <= k:
print(1)
return
ans = 1
val -= k
val1 = val/(k-1)
if val1 != int(val1):
val1 = int(val1) + 1
else:
val1 = int(val1)
ans += val1
print(ans)
def main():
testcases = 1
testcases = int(input())
for _ in range(testcases):
solution()
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | 1,400 | PYTHON3 |
n=int(input())
ans=0
for k in range(n):
tot=0
l=input().split()
for i in range(3):
if l[i]=='1':
tot+=1
if tot>=2:
ans+=1
print(ans)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string L, R;
int cnt[10], ans;
int dfs(int now, int lf, int rf) {
if (now == (int)L.size()) {
return true;
}
if (lf == 0) {
if (rf == 0) {
for (int i = 0; i < 10; i++) {
if (cnt[i] == 0) continue;
--cnt[i];
if (dfs(now + 1, 0, 0)) {
++cnt[i];
return true;
}
++cnt[i];
}
} else {
for (int i = 0; i <= R[now] - '0'; i++) {
if (cnt[i] == 0) continue;
--cnt[i];
if (dfs(now + 1, 0, (i == R[now] - '0'))) {
++cnt[i];
return true;
}
++cnt[i];
}
}
} else {
if (rf == 0) {
for (int i = L[now] - '0'; i < 10; i++) {
if (cnt[i] == 0) continue;
--cnt[i];
if (dfs(now + 1, (i == L[now] - '0'), 0)) {
++cnt[i];
return true;
}
++cnt[i];
}
} else {
for (int i = L[now] - '0'; i <= R[now] - '0'; i++) {
if (cnt[i] == 0) continue;
--cnt[i];
if (dfs(now + 1, (i == L[now] - '0'), (i == R[now] - '0'))) {
++cnt[i];
return true;
}
++cnt[i];
}
}
}
return false;
}
void go(int num, int sum) {
if (num == 10) {
int tmp = cnt[0];
cnt[0] = sum;
if (dfs(0, 1, 1)) ++ans;
cnt[0] = tmp;
return;
}
for (int i = 0; i <= sum; i++) {
int tmp = cnt[num];
cnt[num] = i;
go(num + 1, sum - i);
cnt[num] = tmp;
}
}
int main() {
cin >> L >> R;
while ((int)L.size() < (int)R.size()) {
L.insert(L.begin(), '0');
}
go(1, (int)R.size());
cout << ans;
}
| 2,700 | CPP |
a=int(input())
dp=[[0 for i in range(a)] for i in range(a)]
count=1
for i in range(a):
for j in range(a):
if(i%2==0):
dp[j][i]=count
count+=1
else:
dp[a-j-1][i]=count
count+=1
for i in range(len(dp)):
x=dp[i]
print(' '.join(map(str,x)))
| 1,300 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
sum = 0
count = 0
for i in range(n):
if l[i] > 0:
sum += l[i]
if sum > 0 and l[i]< 0:
sum += l[i]
elif sum <= 0 and l[i]< 0:
count += 1
print(count)
| 800 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = sum(a)
b = sorted(b)
c = b[-1] + b[-2]
if s <= c:
print("YES")
else:
print("NO") | 900 | PYTHON3 |
a=input().strip()
if a.isupper():
print(a.lower())
elif a[0].islower() and (not a[1:] or a[1:].isupper()):
print(a.capitalize())
else:
print(a)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> mp;
void lucky(long long cur) {
if (cur > 1000000000) {
return;
}
lucky((cur * 10) + 4);
lucky((cur * 10) + 7);
mp.push_back(cur);
}
int main() {
long long X;
cin >> X;
lucky(0);
sort(mp.begin(), mp.end());
for (long long i = 0; i < mp.size(); i++) {
if (mp[i] == X) {
cout << i << endl;
break;
}
}
return 0;
}
| 1,100 | CPP |
t=int(input())
for i in range(t):
a,b,c=[int(i) for i in input().split()]
joker=int(a/c)
if joker>=b:
print(b)
else:
maha=0
for i in range(joker+1):
for j in range(i):
if j+i<=b and i+(c-1)*j>=b:
if i-j>maha:
maha=i-j
print(maha) | 1,000 | PYTHON3 |
from math import gcd
from bisect import *
class Point:
def __init__(self, x, y):
self.x, self.y = x, y
def __repr__(self):
return 'Point' + repr((self.x, self.y))
def __add__(self, val):
return Point(self.x + val.x, self.y + val.y)
def __sub__(self, val):
return Point(self.x - val.x, self.y - val.y)
def __mul__(self, ratio):
return Point(self.x * ratio, self.y * ratio)
@staticmethod
def det(A, B):
return A.x * B.y - A.y * B.x
@staticmethod
def dot(A, B):
return A.x * B.x + A.y * B.y
def onSegment(self, A, B):
if self.det(B-A, self-A) != 0:
return False
if self.dot(B-A, self-A) < 0:
return False
if self.dot(A-B, self-B) < 0:
return False
return True
def intPoints(x1, y1, x2, y2):
dx, dy = abs(x2 - x1), abs(y2 - y1)
return gcd(dx, dy) + 1
def crosspoint(L1, L2):
A, B = Point(L1[0], L1[1]), Point(L1[2], L1[3])
C, D = Point(L2[0], L2[1]), Point(L2[2], L2[3])
S1, S2 = Point.det(C-A, D-A), Point.det(C-D, B-A)
delta = (B - A) * S1
if S2 == 0 or delta.x % S2 != 0 or delta.y % S2 != 0:
return None
delta.x = delta.x // S2
delta.y = delta.y // S2
P = A + delta
if not P.onSegment(A, B) or not P.onSegment(C, D):
return None
return (P.x, P.y)
'''
while True:
x1, y1, x2, y2 = map(int, input().split())
A, B = Point(x1, y1), Point(x2, y2)
x1, y1, x2, y2 = map(int, input().split())
C, D = Point(x1, y1), Point(x2, y2)
print(crosspoint(A, B, C, D))
'''
n = int(input())
lines = [ tuple(int(z) for z in input().split()) \
for i in range(n) ]
count = dict()
for i in range(n):
for j in range(i):
P = crosspoint(lines[i], lines[j])
if P == None:
continue
if not P in count:
count[P] = 1
else:
count[P] += 1
answer = sum(intPoints(*L) for L in lines)
tri = [ x*(x+1)//2 for x in range(n+1) ]
for z in count:
k = bisect_right(tri, count[z])
answer -= k - 1;
print(answer)
| 2,400 | PYTHON3 |
N,K=map(int,input().split())
arr=[list(input()) for _ in range(N)]
dp=[[False]*(K+1) for _ in range(N+1)]
dp[0][0]=True
costs=[[] for _ in range(2**7)]
digits=["1110111","0010010","1011101","1011011","0111010","1101011","1101111","1010010","1111111","1111011"]
for i in range(2**7):
bits=format(i,'b')
if len(bits)!=7:
bits='0'*(7-len(bits))+bits
for digit in digits:
tmp=0
for j in range(7):
if bits[j]=='0' and digit[j]=='1':
tmp+=1
elif bits[j]=='1' and digit[j]=='0':
break
else:
costs[i].append(tmp)
for i in range(2**7):
costs[i]=list(set(costs[i]))
for i in range(N):
tmp=0
for k in range(7):
if arr[N-i-1][k]=='1':
tmp+=2**(6-k)
for j in range(K,-1,-1):
for c in costs[tmp]:
if j-c>=0 and dp[i][j-c]==True:
dp[i+1][j]=True
ans=''
for i in range(N):
for j in range(9,-1,-1):
cost=0
for k in range(7):
if arr[i][k]=='0' and digits[j][k]=='1':
cost+=1
elif arr[i][k]=='1' and digits[j][k]=='0':
break
else:
if K-cost>=0 and dp[N-i-1][K-cost]==True:
ans+=str(j)
K-=cost
break
else:
print(-1)
break
else:
print(ans) | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
cout << min(n, m) + 1 << '\n';
for (int i = 0; i <= min(n, m); ++i)
cout << i << ' ' << min(n, m) - i << '\n';
}
| 1,500 | CPP |
#include <bits/stdc++.h>
int main() {
int n, p, q, check;
std::cin >> n;
int count = 0;
while (n--) {
std::cin >> p >> q;
check = (q - p);
if (check >= 2) {
count++;
}
}
std::cout << count << "\n";
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n, c0, c1, h, cnt0 = 0, cnt1 = 0;
string s;
cin >> n >> c0 >> c1 >> h >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
cnt0++;
else
cnt1++;
}
cout << min({h * cnt0 + c1 * n, h * cnt1 + c0 * n, cnt1 * c1 + cnt0 * c0})
<< endl;
}
return 0;
}
| 800 | CPP |
def fact(a, b) :
ans = 0
while a % b == 0 :
ans += 1
a //= b
return ans
def fact_remove(a, b) :
c = a*b
while c % 2 == 0 : c //= 2
while c % 3 == 0 : c //= 3
return c
a1,b1 = map(int, input().split(' '))
a2,b2 = map(int, input().split(' '))
if fact_remove(a1, b1) != fact_remove(a2, b2) :
print(-1)
else :
ans = [0, 0, 0, 0]
c1 = a1*b1
c2 = a2*b2
k1 = fact(c1, 3)
k2 = fact(c2, 3)
if k1 > k2 :
ans[1] = k1 - k2
c1 /= 3**ans[1]
c1 *= 2**ans[1]
elif k1 < k2 :
ans[3] = k2 - k1
c2 /= 3**ans[3]
c2 *= 2**ans[3]
k1 = fact(c1, 2)
k2 = fact(c2, 2)
if k1 > k2 :
ans[0] = k1 - k2
c1 /= 2**ans[0]
elif k1 < k2 :
ans[2] = k2 - k1
c2 /= 2**ans[2]
if c1 != c2 :
print(-1)
else :
print(sum(ans))
while a1%3 == 0 and ans[1] > 0 :
a1 //= 3
a1 *= 2
ans[1] -= 1
while a1%2 == 0 and ans[0] > 0 :
a1 //= 2
ans[0] -= 1
while b1%3 == 0 and ans[1] > 0 :
b1 //= 3
b1 *= 2
ans[1] -= 1
while b1%2 == 0 and ans[0] > 0 :
b1 //= 2
ans[0] -= 1
while a2%3 == 0 and ans[3] > 0 :
a2 //= 3
a2 *= 2
ans[3] -= 1
while a2%2 == 0 and ans[2] > 0 :
a2 //= 2
ans[2] -= 1
while b2%3 == 0 and ans[3] > 0 :
b2 //= 3
b2 *= 2
ans[3] -= 1
while b2%2 == 0 and ans[2] > 0 :
b2 //= 2
ans[2] -= 1
print(a1, b1)
print(a2, b2)
| 1,900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, tot;
long long x = 0;
string s;
int main() {
cin >> s;
long long punct = 0, lng = 0, arond = 0, nxt = 0, lngpunct = 0;
long long tip1 = 0, tip2 = 0, tip3 = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '.') {
punct = i;
lngpunct = tip3;
arond = 0;
} else if (s[i] == '@') {
if (punct - i - 1 == tip2 && tip2) {
arond = i;
nxt = punct;
}
}
if (isalpha(s[i]) && nxt && arond - i - 1 == tip1) tot += lngpunct;
if (isalnum(s[i]) || s[i] == '_') {
tip1++;
} else {
tip1 = 0;
}
if (isalnum(s[i])) {
tip2++;
} else {
tip2 = 0;
}
if (isalpha(s[i])) {
tip3++;
} else {
tip3 = 0;
}
}
cout << tot;
return 0;
}
| 1,900 | CPP |
n,a,b,c = map(int, input().split())
holder = [0]*8002
holder[a] = holder[b] = holder[c] = 1
for i in range(1, n):
for j in [a,b,c]:
if holder[i] > 0:
holder[i+j] = max(holder[i]+1, holder[i+j])
print(holder[n]) | 1,300 | PYTHON3 |
if __name__=='__main__':
t=int(input())
for i in range(t):
n=int(input())
if n%2==0:
print((n-1)//2)
else:
print(n//2)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long pre[10000];
long long gcd(long long a, long long b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
long long cal(long long n, long long r) {
long long i, j, k, s, g, d;
for (i = 0; i <= n; i++) {
pre[i] = i;
}
for (i = 0; i <= r; i++) pre[i] = 1;
for (i = 1; i <= n - r; i++) {
d = i;
for (j = r + 1; j <= n; j++) {
g = gcd(pre[j], d);
pre[j] /= g;
d /= g;
if (d == 1) break;
}
}
s = 1;
for (i = 1; i <= n; i++) {
s *= pre[i];
}
return s;
}
int main() {
long long i, j, k, s, d, r, m, n, t;
cin >> n >> m >> t;
s = n + m;
long long wg, wog, w1, w2, w3, w0;
wg = cal(s, t);
if (n < t)
wog = 0;
else
wog = cal(n, t);
if (m >= t)
w0 = cal(m, t);
else
w0 = 0;
if (m >= t - 1)
w1 = cal(n, 1) * cal(m, t - 1);
else
w1 = 0;
if (m >= t - 2)
w2 = cal(n, 2) * cal(m, t - 2);
else
w2 = 0;
if (m >= t - 3)
w3 = cal(n, 3) * cal(m, t - 3);
else
w3 = 0;
cout << wg - (wog + w1 + w2 + w3 + w0) << endl;
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int check(long long n, int k) {
if (n == 0 && k == 0) return 1;
int a;
int* b = new int[10];
for (int i = 0; i < 10; i++) b[i] = 0;
while (n != 0) {
a = n % 10;
b[a]++;
n = n / 10;
}
for (int i = 0; i <= k; i++) {
if (b[i] == 0) return 0;
}
return 1;
}
int main() {
int n, k;
cin >> n >> k;
long long* arr = new long long[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
count += check(arr[i], k);
}
cout << count;
return 0;
}
| 1,100 | CPP |
n, x = [int(i) for i in input().split()]
a = 0
for i in range(n):
d = input().split()
if d[0] == "-":
if x >= int(d[1]):
x -= int(d[1])
else:
a += 1
else:
x += int(d[1])
print(x, a)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, b, c;
cin >> a >> b >> c;
if (c % 3 == 2) {
cout << (a ^ b) << endl;
} else if (c % 3 == 0) {
cout << (a) << endl;
} else {
cout << b << endl;
}
}
return 0;
}
| 900 | CPP |
from math import sqrt
ax,ay,bx,by,cx,cy = [int(i) for i in input().split()]
if (ax-bx)**2+(ay-by)**2 != (bx-cx)**2+(by-cy)**2:
print("No")
elif abs((ax-bx)*(bx-cx)+((ay-by)*(by-cy)))**2== ((ax-bx)**2+(ay-by)**2)* ((bx-cx)**2+(by-cy)**2):
print("No")
else:
print("Yes") | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100050;
const int maxnode = 800050;
const int sigma_size = 26;
int n;
int ans[maxn];
int res;
char cc[maxn * 10];
int stka[maxn], stkb[maxn];
int ta, tb;
struct Trie {
vector<int> vv[maxnode][2];
int ch[maxnode][sigma_size];
int sz;
Trie() {
sz = 1;
memset(ch[0], 0, sizeof ch[0]);
}
int idx(char c) { return c - 'a'; }
void _insert(char s[], int ki, int id) {
int u = 0, len = strlen(s);
for (int i = 0; i < len; i++) {
int c = idx(s[i]);
if (!ch[u][c]) {
memset(ch[sz], 0, sizeof ch[sz]);
vv[sz][0].clear();
vv[sz][1].clear();
ch[u][c] = sz++;
}
u = ch[u][c];
}
vv[u][ki].push_back(id);
}
} root;
void dfs(int p, int dd, int x, int y) {
for (int i = 0; i < root.vv[p][0].size(); i++) stka[ta++] = root.vv[p][0][i];
for (int i = 0; i < root.vv[p][1].size(); i++) stkb[tb++] = root.vv[p][1][i];
for (int i = 0; i < 26; i++) {
if (root.ch[p][i] != 0) dfs(root.ch[p][i], dd + 1, ta, tb);
}
while (ta > x && tb > y) {
res += dd;
int u = stka[--ta];
int v = stkb[--tb];
ans[u] = v;
}
}
int main() {
scanf("%d", &n);
res = 0;
for (int i = 0; i < n; i++) scanf("%s", cc), root._insert(cc, 0, i);
for (int i = 0; i < n; i++) scanf("%s", cc), root._insert(cc, 1, i);
ta = tb = 0;
dfs(0, 0, ta, tb);
printf("%d\n", res);
for (int i = 0; i < n; i++) printf("%d %d\n", i + 1, ans[i] + 1);
return 0;
}
| 2,300 | CPP |
import math
for _ in range(int(input())):
n, k = map(int, input().split())
x = int(math.ceil(k/(n-1)))
ans = n*(x-1)+k-((n-1)*(x-1))
print(ans) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<long long> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
long long Alice = 0, first = 0, second = 0;
for (int s = 2; s <= m * 2; s++) {
int Aa_max = 0;
int a_min = max(1, s - m);
vector<int> doubles;
vector<pair<int, int>> p;
for (int i = 0; i < n; i++) {
int w = v[i] % s;
Aa_max = max(Aa_max, min(w, s - w - 1));
doubles.push_back(w / 2);
p.emplace_back(w, 1);
}
sort(doubles.rbegin(), doubles.rend());
int doubles_a = doubles[0], doubles_b = doubles[0];
if (n > 1) {
Aa_max = max(Aa_max, doubles[1]);
doubles_a = doubles[1];
}
Alice += max(0, Aa_max + 1 - a_min);
p.emplace_back(doubles_a, 0);
p.emplace_back(doubles_b, 0);
p.emplace_back(s / 2, 0);
sort(p.begin(), p.end());
int pref = 0, last = 0;
for (auto pair : p) {
int i = pair.first;
last = max(last, max(Aa_max + 1, a_min) - 1);
if (i > last) {
int v = 2 * (i - last) - (i * 2 == s);
if (pref % 2 != n % 2) {
first += v;
} else {
if (i >= doubles_a && i <= doubles_b)
Alice += v / 2;
else
second += v;
}
}
if (i == s / 2) break;
last = i;
pref += pair.second;
}
}
cout << Alice << ' ' << Alice << ' ' << first << ' ' << second << endl;
}
| 3,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int w[105][105];
long long a[105], b[105], e[105][105];
long long gcd(long long a, long long b) {
while (b) b ^= a ^= b ^= a %= b;
return a;
}
int main() {
ios_base::sync_with_stdio(0);
int n, m, i, j, mx = 0;
bool f = 1;
long long x;
cin >> n >> m;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j) {
cin >> w[i][j];
mx = max(mx, w[i][j]);
}
a[0] = 0;
for (i = 0; i < m; ++i) b[i] = w[0][i];
for (i = 1; i < n; ++i) a[i] = w[i][0] - b[0];
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j) {
x = a[i] + b[j] - w[i][j];
e[i][j] = x < 0 ? -x : x;
if (x != 0) f = 0;
}
if (f) {
cout << "YES\n" << ++mx << '\n';
for (i = 0; i < n; ++i) {
while (a[i] < 0) a[i] += mx;
cout << a[i] << ' ';
}
cout << '\n';
for (i = 0; i < m; ++i) {
while (b[i] < 0) b[i] += mx;
cout << b[i] << ' ';
}
cout << '\n';
} else {
x = -1;
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j)
if (e[i][j]) {
if (x != -1)
x = gcd(x, e[i][j]);
else
x = e[i][j];
}
f = 1;
for (i = 0; i < n && f; ++i)
for (j = 0; j < m && f; ++j)
if (w[i][j] >= x) f = 0;
if (f) {
cout << "YES\n" << x << '\n';
for (i = 0; i < n; ++i) {
while (a[i] < 0) a[i] += x;
cout << a[i] << ' ';
}
cout << '\n';
for (i = 0; i < m; ++i) {
while (b[i] < 0) b[i] += x;
cout << b[i] << ' ';
}
cout << '\n';
} else
cout << "NO\n";
}
return 0;
}
| 2,200 | CPP |
def nearly_lucky_number(string):
lucky_digits = 0
for letter in string:
if letter == '4' or letter == '7':
lucky_digits += 1
return lucky_digits == 4 or lucky_digits == 7
print("YES" if nearly_lucky_number(input()) else "NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<long long> c(n);
for (long long& x : c) scanf("%lld", &x);
vector<int> id(k);
for (int& x : id) scanf("%d", &x), --x;
sort(id.begin(), id.end());
long long sum = accumulate(c.begin(), c.end(), 0LL);
long long ans = 0;
for (int x : id) {
sum -= c[x];
ans += c[x] * sum;
}
for (int i = 0; i < n; ++i) {
int j = (i + 1) % n;
if (binary_search(id.begin(), id.end(), i) == false &&
binary_search(id.begin(), id.end(), j) == false) {
ans += c[i] * c[j];
}
}
printf("%lld\n", ans);
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const double esp = 1e-6, pi = acos(-1);
const int N = 1e6 + 10, INF = 0x3f3f3f3f, mod = 1e9 + 7;
long long in() {
long long x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
return x * f;
}
int a[N];
int work() {
int n = in(), s = in();
if (s < 2 * n) return 0 * puts("NO");
puts("YES");
for (int i = 1; i < n; i++) cout << 1 << " ";
cout << s - n + 1 << endl;
cout << n << endl;
return 0;
}
int main() {
work();
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[15];
int b = 0;
memset(a, 0, sizeof(a));
scanf("%s", a);
int lo = strlen(a);
if (a[lo - 1] > '5') {
if (lo > 1)
a[lo - 2]++;
else {
b = 1;
}
}
a[lo - 1] = '0';
for (int i = lo; i >= 0; i--) {
if (a[i] > '9') {
if (i == 0) {
b = 1;
a[0] -= 10;
break;
}
a[i - 1]++;
a[i] -= 10;
}
}
if (b) printf("%d", b);
printf("%s", a);
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], n, m, k;
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int ans = 0;
for (int i = 0, j = 0; i < n; i++) {
b[j] = a[i];
if (i < k - 1 || b[j] - b[j - k + 1] >= m)
j++;
else
ans++;
}
cout << ans << endl;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dp[2000][2001];
int last[2000];
string s, p;
int calc(int i) {
int j = p.size() - 1;
for (; i >= 0; i--) {
if (s[i] == p[j]) j--;
if (j < 0) return i;
}
return -1;
}
int main() {
cin >> s >> p;
int N = s.size();
int M = p.size();
for (int i = 0; i < s.size(); i++) last[i] = calc(i);
for (int i = 0; i < s.size(); i++) {
for (int x = 0; x <= s.size(); x++) {
dp[i][x] = -1;
if (x > (i + 1)) continue;
if (((i + 1 - last[i] - M) <= x) && ((i + 1 - M) >= x)) dp[i][x] = 1;
if ((last[i] > 0) && (((i + 1 - last[i]) - M) <= x) &&
(dp[last[i] - 1][x - ((i + 1 - last[i]) - M)] > -1))
dp[i][x] = 1 + dp[last[i] - 1][x - ((i + 1 - last[i]) - M)];
else
dp[i][x] = max(dp[i][x], 0);
if (i > 0) dp[i][x] = max(dp[i][x], dp[i - 1][x]);
}
}
for (int x = 0; x <= s.size(); x++) cout << dp[s.size() - 1][x] << " ";
return 0;
}
| 2,200 | CPP |
c = int(input())
print('YES' if c % 2 == 0 and c > 2 else 'NO') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const bool print = false;
const int MAXN = 14111000;
int prme[MAXN];
int zl[MAXN];
void sito(int n) {
for (int i = 2; i <= n; i++) {
if (prme[i] != 0) continue;
prme[i] = i;
for (int j = 2 * i; j <= n; j += i)
if (prme[j] == 0) prme[j] = i;
}
}
int sumanp[MAXN];
int sumapr[MAXN];
int main() {
int n;
scanf("%d", &n);
if (n <= 3) {
puts("0");
return 0;
}
sito(n + 2);
long long pary = (((long long)n) * ((long long)n - 1LL)) / 2LL;
long long zera = 1;
for (int i = ((n / 2) + 1); i <= (n); i++) {
if (prme[i] == i) zera++;
}
if (print) printf("ZERA %lld\n", zera);
long long parzer =
(zera * ((long long)n - 1LL)) - (zera * (zera - 1LL)) / 2LL;
long long parjed = 0;
for (int i = (2); i <= (n); i++) {
int i1 = i, zl = 0;
int pop = 1;
while (i1 > 1) {
zl++;
if (prme[i1] == pop) {
pop = -1;
break;
}
pop = prme[i1];
i1 /= prme[i1];
}
if (pop == -1) continue;
int zn = (zl % 2 == 1) ? 1 : -1;
long long wyrazy = n / i;
long long parlok = (wyrazy * (wyrazy - 1LL)) / 2LL;
if (print) printf("%d %d:: %lld %lld\n", i, zn, wyrazy, parlok);
parjed += parlok * zn;
}
long long partrzy = 0;
long long par3pr = 0;
for (int i = (2); i <= (n); i++) {
if (prme[i] == i) {
if (i > n / 2) continue;
sumapr[prme[i]]++;
} else
sumanp[prme[i]]++;
}
for (int i = (2); i <= (n); i++)
sumanp[i] += sumanp[i - 1], sumapr[i] += sumapr[i - 1];
for (int i = (2); i <= (n); i++) {
if (prme[i] == i && i <= n / 2) {
if (print) printf("PRME %d\n", i);
partrzy += sumanp[n] - sumanp[n / i];
par3pr += sumapr[n] - sumapr[max(i, n / i)];
if (print)
printf("%lld:: %lld %lld, %lld %lld\n", (long long)n / i,
(long long)sumanp[n], (long long)sumanp[n / i],
(long long)sumapr[n], (long long)sumapr[max(i, n / i)]);
}
}
partrzy += par3pr;
long long pardwa = pary - parzer - parjed - partrzy;
if (print)
printf("0 %lld\n1 %lld\n2 %lld\n3 %lld\n", parzer, parjed, pardwa, partrzy);
printf("%lld\n", parjed + 2LL * pardwa + 3LL * partrzy);
}
| 2,700 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
long long ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
a = abs(a);
b = abs(b);
return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
T t = 1;
return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
T t = 1;
return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
T t = 1;
return (a & (~(t << i)));
}
inline long long getnum() {
char c = getchar();
long long num, sign = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') sign = -1;
for (num = 0; c >= '0' && c <= '9';) {
c -= '0';
num = num * 10 + c;
c = getchar();
}
return num * sign;
}
inline long long power(long long a, long long b) {
long long multiply = 1;
for (int i = (0); i < (b); i++) {
multiply *= a;
}
return multiply;
}
int n, k, p[100005], out[300];
int main() {
ios_base::sync_with_stdio(0);
int test, cases = 1;
memset(out, -1, sizeof(out));
cin >> n >> k;
for (int i = (1); i < (n + 1); i++) cin >> p[i];
for (int i = (1); i < (n + 1); i++) {
if (out[p[i]] != -1)
cout << out[p[i]] << " ";
else {
int last = -1;
for (int j = (0); j < (p[i]); j++)
if (out[j] != -1) last = j;
if (last == -1) {
out[p[i]] = max(0, p[i] - k + 1);
cout << out[p[i]] << " ";
for (int j = (out[p[i]]); j < (p[i]); j++) out[j] = out[p[i]];
} else {
if (out[last] + k - 1 >= p[i]) {
for (int j = (last + 1); j < (p[i] + 1); j++) out[j] = out[last];
} else {
int beg = max(p[i] - k + 1, last + 1);
for (int j = (beg); j < (p[i] + 1); j++)
out[j] = max(last + 1, p[i] - k + 1);
}
cout << out[p[i]] << " ";
}
}
}
cout << "\n";
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[55][55];
int main(void) {
int n;
scanf("%d", &n);
for (int i = (0); i < (n); ++i) {
scanf("%s", a[i]);
for (int j = (0); j < (n); ++j) a[i][j] -= '0';
}
int x1 = n, y1 = n, x2 = 0, y2 = 0;
for (int i = (0); i < (n); ++i)
for (int j = (0); j < (n); ++j) {
if (a[i][j] == 4) {
x1 = min(x1, i);
x2 = max(x2, i);
y1 = min(y1, j);
y2 = max(y2, j);
}
}
if (x1 <= x2 && y1 <= y2) {
bool ok = true;
for (int x = (x1); x < (x2 + 1); ++x)
for (int y = (y1); y < (y2 + 1); ++y) ok &= a[x][y] == 4;
for (int x = (x1); x < (x2 + 1); ++x) {
ok &= (y1 == 0 || a[x][y1 - 1] == 2);
ok &= (y2 == n - 1 || a[x][y2 + 1] == 2);
}
for (int y = (y1); y < (y2 + 1); ++y) {
ok &= (x1 == 0 || a[x1 - 1][y] == 2);
ok &= (x2 == n - 1 || a[x2 + 1][y] == 2);
}
ok &= (x1 == 0 || y1 == 0 || a[x1 - 1][y1 - 1] == 1);
ok &= (x1 == 0 || y2 == n - 1 || a[x1 - 1][y2 + 1] == 1);
ok &= (x2 == n - 1 || y1 == 0 || a[x2 + 1][y1 - 1] == 1);
ok &= (x2 == n - 1 || y2 == n - 1 || a[x2 + 1][y2 + 1] == 1);
for (int i = (0); i < (n); ++i)
for (int j = (0); j < (n); ++j)
if (i < x1 - 1 || i > x2 + 1 || j < y1 - 1 || j > y2 + 1)
ok &= a[i][j] == 0;
if (ok) {
puts("Yes");
return 0;
}
}
puts("No");
return 0;
}
| 1,700 | CPP |
x = int(input())
st = input()
rooms = [0 for _ in range(10)]
for ltr in st:
if ltr == 'L':
x=0
while(rooms[x]==1):
x+=1
rooms[x]=1
elif ltr =='R':
x=9
while(rooms[x]==1):
x-=1
rooms[x]=1
else:
rooms[int(ltr)]=0
print ("".join(str(x) for x in rooms)) | 800 | PYTHON3 |
t = int(input())
k = [[] for i in range(t)]
for j in range(t):
n = int(input())
a = [int(x) for x in input().split()]
i = 0
while i < len(a) - 1:
if a[i] in a[(i + 1):len(a)]:
k[j].append(a[i])
i += 1
for i in k:
print(*i)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
string str;
cin >> str;
int i = 0;
while (n--) {
if ((str[i] == 'a' && str[i + 1] == 'b') ||
(str[i] == 'b' && str[i + 1] == 'a')) {
cout << i + 1 << " " << i + 2 << endl;
break;
}
if ((str[i] == 'a' && str[i + 1] == 'a') ||
(str[i] == 'b' && str[i + 1] == 'b')) {
i++;
} else {
cout << -1 << " " << -1 << endl;
break;
}
}
}
}
| 800 | CPP |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n;
int a[N];
int d[N];
int main(){
ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 1; i <= n; i ++){
cin >> a[i];
if(i > 1) d[i] = (a[i - 1] < a[i]);
}
int mx = 0, cnt = 0;
for(int l = 2, r = 2; l <= n; l = r = r + 1){
int o = d[l];
while(r + 1 <= n && d[r + 1] == o) r ++;
int len = r - l + 2;
if(len > mx){
mx = len;
cnt = 1;
}else if(mx == len){
cnt ++;
}
}
if(cnt != 2 || (mx % 2) == 0){
cout << "0\n";
}else{
int res = 0;
for(int i = 3; i <= n; i ++){
if(d[i - 1] == 1 && d[i] == 0){
int l = i - 1, r = i;
while(l > 2 && d[l - 1] == 1) l --;
while(r < n && d[r + 1] == 0) r ++;
if(((i - 1) - (l - 1) + 1) == mx && (r - (i - 1) + 1) == mx){
res = 1;
}
}
if(res == 1) break;
}
cout << res << "\n";
}
}
| 1,900 | CPP |
n = int(input())
numbers = list(map(int, input().split(" ")))
no_dict = {}
for ind, i in enumerate(numbers):
if i in no_dict:
no_dict[i].append(ind + 1)
else:
no_dict[i] = [ind + 1]
fin_list = []
for item in sorted(no_dict):
length = len(no_dict[item])
if length == 1:
fin_list.append((item, 0))
continue
d = no_dict[item][1] - no_dict[item][0]
# print("my d " ,d)
flag = True
for i in range(2 , len(no_dict[item])):
if no_dict[item][i] - no_dict[item][i-1] != d:
flag = False
break
if flag:
fin_list.append((item, d))
# print("dict " , no_dict)
print(len(fin_list))
for tuple in fin_list:
print(tuple[0], tuple[1])
| 1,300 | PYTHON3 |
import sys
import math
inp = sys.stdin.read()
lines = inp.splitlines()
a = list(map(int, lines[0].split()))
b = list(map(int, lines[1].split()))
n = int(lines[2])
cups = sum(a)
medals = sum(b)
if math.ceil(cups/5) + math.ceil(medals/10) > n:
print("NO")
else:
print("YES")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> matchboxes[21];
bool CMP(const pair<long long, long long> &a,
const pair<long long, long long> &b);
int main() {
long long n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> matchboxes[i].first >> matchboxes[i].second;
}
sort(matchboxes, matchboxes + m, CMP);
int i = 0, max = 0, n2 = n;
while (n2 != 0 and i < n) {
if (n2 >= matchboxes[i].first) {
max += matchboxes[i].first * matchboxes[i].second;
n2 -= matchboxes[i].first;
} else {
max += n2 * matchboxes[i].second;
n2 -= n2;
}
i++;
}
cout << max << endl;
return 0;
}
bool CMP(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.second > b.second;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
long long ans = 0;
long long sum = 0, prod = 0;
long long i = 0;
while (1) {
sum += 2;
prod += i;
if (sum + 3 * prod > n) break;
if ((n - sum + 3 * prod) % 3 == 0) ans++;
i++;
}
cout << ans << "\n";
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
cout << n - 1 << endl;
for (int i = 0; i < n - 1; i++) {
int temp = arr[i], tempat = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < temp) {
temp = arr[j];
tempat = j;
}
}
swap(arr[i], arr[tempat]);
cout << i << ' ' << tempat << ' ' << endl;
}
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxv = 1e9;
int a[50000];
map<int, int> cnt;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int Max = 0;
for (int i = 1; i <= n; ++i) {
cnt[a[i]]++;
Max = max(Max, cnt[a[i]]);
}
cout << Max;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
long long x1, y1;
long long gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
long long modInverse(long long a, long long m) {
long long x, y;
long long g = gcdExtended(a, m, &x, &y);
if (g != 1)
return -1;
else {
long long res = (x % m + m) % m;
return res;
}
}
long long fast(long long x) {
if (x == 0) return 1;
if (x == 1) return 2;
long long y = fast(x / 2);
if (x % 2 == 0) {
return y * y;
}
return y * y * 2;
}
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool win(vector<vector<vector<int>>> &dp, vector<vector<pair<int, int>>> &graph,
int x, int y, int curr) {
if (dp[x][y][curr] != 0) {
if (dp[x][y][curr] == 1) return true;
return false;
}
for (auto p : graph[x]) {
if (p.second >= curr && !win(dp, graph, y, p.first, p.second)) {
dp[x][y][curr] = 1;
return true;
}
}
dp[x][y][curr] = -1;
return false;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<pair<int, int>>> graph(n, vector<pair<int, int>>());
for (int i = 0; i < m; i++) {
int u, v;
char w;
cin >> u >> v >> w;
graph[u - 1].push_back(make_pair(v - 1, w - 'a'));
}
vector<string> sol(n, string(n, 'C'));
vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>(26, 0)));
for (int i = 0; i < n; i++) {
sol[i][i] = 'B';
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (sol[i][j] != 'C') continue;
if (win(dp, graph, i, j, 0)) {
sol[i][j] = 'A';
} else {
sol[i][j] = 'B';
}
}
}
for (int i = 0; i < n; i++) {
cout << sol[i] << endl;
}
return 0;
}
| 1,700 | CPP |
for _ in range(int(input())):
n, m = map(int, input().split())
matrix = [input() for _ in range(n)]
ans = 0
ans += matrix[-1][:-1].count('D')
ans += [row[-1] for row in matrix[:-1]].count('R')
print(ans)
| 800 | PYTHON3 |
t = int(input())
for i in range(t):
n, x, m = [int(x) for x in input().split()]
prev_left = -1
prev_right = -1
for j in range(m):
left, right = [int(x) for x in input().split()]
if left <= x <= right and prev_right == -1 and prev_left == -1:
prev_left = left
prev_right = right
else:
if prev_left <= left <= prev_right or prev_left <= right <= prev_right or left <= prev_left <= right or left <= prev_right <= right:
prev_left = min(prev_left, left)
prev_right = max(prev_right, right)
print(prev_right - prev_left + 1)
| 1,300 | PYTHON3 |
from collections import defaultdict
k = int(input())
for _ in range(k):
n = int(input())
s = list(input())
t = list(input())
p = False
if n == 1:
if s[0] != t[0]:
print('NO')
else:
print('YES')
else:
r = []
for i in range(n):
if s[i] != t[i]:
r.append(i)
if len(r) == 0:
print('YES')
continue
if len(r) != 2:
print('NO')
continue
else:
c = s[r[0]]
s[r[0]] = t[r[1]]
t[r[1]] = c
j = 0
while j < n and not p:
if s[j] != t[j]:
print('NO')
p = True
break
j += 1
if not p:
print('YES')
p = True
| 1,000 | PYTHON3 |
peso = int(input())
division = peso%2
if (peso == 2):
print ("NO")
elif (division == 0):
print ("YES")
else:
print ("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long a[N];
int n, fa[N], sum, ans[N];
int mp[N];
int find(int x) {
if (x == fa[x]) {
return x;
}
return fa[x] = find(fa[x]);
}
void merge(int x, int y) {
int fx = find(x);
int fy = find(y);
if (fx == fy) return;
fa[fx] = fy;
}
int main() {
cin.sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
fa[i] = i;
cin >> a[i];
for (int j = 1; j < i; j++) {
if (a[i] * a[j] > 0)
if ((long long)sqrt(a[i] * a[j]) * (long long)sqrt(a[i] * a[j]) ==
a[i] * a[j])
merge(i, j);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) mp[j] = 0;
sum = 0;
for (int j = i; j <= n; j++) {
if (!a[j])
++ans[max(sum, 1)];
else {
if (!mp[fa[j]]) ++sum;
mp[fa[j]] = true;
++ans[sum];
}
}
}
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
return 0;
}
| 2,100 | CPP |
from pprint import pprint
import sys
input = sys.stdin.readline
q = int(input())
import bisect
for _ in range(q):
n = int(input())
data = list(map(int, input().split()))
datb = list(map(int, input().split()))
datc = []
indmin = []
indplus = []
for i in range(n):
if data[i] == 1:
indplus.append(i)
elif data[i] == -1:
indmin.append(i)
f = True
for i in range(n-1, -1, -1):
d = datb[i] - data[i]
if d == 0:
continue
elif d > 0:
ind = bisect.bisect_left(indplus, i)
if ind == 0:
f = False
elif d < 0:
ind = bisect.bisect_left(indmin, i)
if ind == 0:
f = False
print("YES" if f else "NO")
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
bool Fin;
using namespace std;
template <class T>
inline void read(T &x) {
Fin = 0;
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
if (ch == EOF) return;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
Fin = 1;
}
const int N = 200005;
const double eps = 1e-10;
struct bz {
double t;
double vv;
bz() { t = vv = 0.0; }
bz(double x, double y) { t = x, vv = y; }
bool operator<(const bz &p) const { return t < p.t; }
};
int n, q1 = 0, q2 = 0;
bz v[N], qwq1[N], qwq2[N];
double T, ans, ans1, ans2, tot1, tot2, s1, s2;
int main() {
cin >> n >> T;
for (int i = 1; i <= n; i++) scanf("%lf", &v[i].vv);
for (int i = 1; i <= n; i++) scanf("%lf", &v[i].t);
sort(v + 1, v + n + 1);
for (int i = 1; i <= n; i++) {
if (((T - v[i].t) > 0 ? (T - v[i].t) : (T - v[i].t) * (-1)) < eps)
ans += v[i].vv;
else if (v[i].t < T)
qwq1[++q1] = bz(v[i].t - T, v[i].vv);
else
qwq2[++q2] = bz(v[i].t - T, v[i].vv);
}
for (int i = 1; i <= q1; i++)
tot1 += qwq1[i].t * qwq1[i].vv, s1 += qwq1[i].vv;
for (int i = 1; i <= q2; i++)
tot2 += qwq2[i].t * qwq2[i].vv, s2 += qwq2[i].vv;
ans1 = ans + s1, ans2 = ans + s2;
for (int i = 1; i <= q2; i++) {
if (tot1 >= (-1) * qwq2[i].t * qwq2[i].vv) {
ans1 += ((tot1 / qwq2[i].t) > 0 ? (tot1 / qwq2[i].t)
: (tot1 / qwq2[i].t) * (-1));
tot1 = 0.0;
break;
} else {
ans1 += qwq2[i].vv;
tot1 += qwq2[i].t * qwq2[i].vv;
}
}
for (int i = q1; i >= 1; i--) {
if (tot2 + qwq1[i].t * qwq1[i].vv <= 0) {
ans2 += ((tot2 / qwq1[i].t) > 0 ? (tot2 / qwq1[i].t)
: (tot2 / qwq1[i].t) * (-1));
tot2 = 0.0;
break;
} else
tot2 += qwq1[i].t * qwq1[i].vv, ans2 += qwq1[i].vv;
}
if (tot2 == 0.0) {
if (tot1 == 0.0) {
if (ans1 > ans2)
printf("%.10lf\n", ans1);
else
printf("%.10lf\n", ans2);
} else
printf("%.10lf\n", ans2);
} else
printf("%.10lf\n", ans1);
}
| 2,000 | CPP |
l, n = map(int, input().split())
arr = [int(x) for x in input().split()]
arr.sort()
if n == 0:
ans = arr[0] - 1
elif n < l and arr[n - 1] == arr[n]:
ans = -1
else:
ans = arr[n-1]
if ans == -1 or ans < 1 or ans > 1000000000:
print(-1)
else:
print(ans)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mems(p) memset(p,-1,sizeof(p))
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vvd = vector<vector<double>>;
using vvc = vector<vector<char>>;
using vvpi = vector<vector<pi>>;
using vvpl = vector<vector<pl>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvd = vector<vector<vector<double>>>;
using vvvc = vector<vector<vector<char>>>;
using vvvpi = vector<vector<vector<pi>>>;
using vvvpl = vector<vector<vector<pl>>>;
const int mxN = 8e5 + 100;
const ll MOD = 1e9 + 7;
void fast()
{ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
vl factorial;
ll expo(ll x, ll exp, ll mod = MOD) {
if (exp <= 0) return 1;
ll tmp = (x*x) % mod;
if (exp%2) {
return (expo(tmp, exp/2, mod) * x) % mod;
}
return (expo(tmp, exp/2, mod)) % mod;
}
ll choice(ll n, ll r, ll mod = MOD) {
if (n < r) return 0;
ll numer = factorial[n];
ll denom = (factorial[r] * factorial[n-r]) % mod;
return numer * expo(denom, mod - 2, mod) % mod;
}
ll phi(ll n) {
ll result = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
}
if (n > 1)
result -= result / n;
return result;
}
int main() {
fast();
int t;
cin >> t;
while (t--) {
ll n;
cin >> n;
ll sum = 0;
for (int i = 0; i < n; ++i)
{
ll x;
cin >> x;
sum += x;
}
ll each = sum/n;
ll rem = sum - each*n;
ll ans = rem * (n-rem);
cout << ans << nl;
}
}
| 900 | CPP |
def M(a,b,k):
c=1
if(b>k):
print("NO")
else:
print("YES")
for i in range(a):
for x in range(a):
if(i%2==0):
if(x%2==0 and c<=b):
print("L", end='')
c+=1
else:
print("S", end='')
else:
if(x%2==1 and c<=b):
print("L", end='')
c+=1
else:
print("S", end='')
print()
if __name__=='__main__':
a,b=map(int,input().split())
if(a%2==0):
k=(a/2)*a
else:
n=(a//2)+1
m=(a//2)
k=(n*n)+(m*m)
M(a,b,k)
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
int p[100100], pt, boo[100100], ans, ma[10][10];
std::vector<int> v[10000][6];
void sol(int d) {
if (d == 6) {
ans++;
return;
}
int i, j, x = 0, y;
for (i = 1; i < d; i++) x = x * 10 + ma[d][i];
for (i = 0; i < v[x][6 - d].size(); i++) {
y = v[x][6 - d][i];
for (j = 5; j >= d; j--) {
ma[d][j] = ma[j][d] = y % 10;
y /= 10;
}
sol(d + 1);
}
}
int main() {
int i, j, k;
for (i = 0; i < 100000; i++) boo[i] = 0;
for (i = 3; i * i < 100000; i += 2)
if (!boo[i])
for (j = i * i; j < 100000; j += 2 * i) boo[j] = 1;
p[0] = 2;
pt = 1;
for (j = 3; j < 100000; j += 2)
if (!boo[j]) p[pt++] = j;
for (i = 0; i < pt; i++) {
v[p[i] / 10][1].push_back(p[i] % 10);
v[p[i] / 100][2].push_back(p[i] % 100);
v[p[i] / 1000][3].push_back(p[i] % 1000);
v[p[i] / 10000][4].push_back(p[i] % 10000);
}
int t, x, d, y;
scanf("%d", &t);
for (; t; t--) {
scanf("%d", &x);
d = 0;
for (y = x; y; y /= 10) d++;
for (i = 1; i <= 5; i++)
for (j = 1; j <= 5; j++) ma[i][j] = 0;
k = 0;
for (y = x; y; y /= 10) {
ma[5 - d + 1][5 - k] = ma[5 - k][5 - d + 1] = y % 10;
k++;
}
ans = 0;
d = 7 - d;
sol(d);
printf("%d\n", ans);
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, L;
int cx[1005], d[1005];
int pre[1005];
double f[1005];
double cost[1005][1005];
const double eps = 1e-7;
double calc(double kk) {
f[0] = 0;
for (int i = 1; i <= n; i++) {
f[i] = (int)1e9;
for (int j = 0; j < i; j++) {
double tmp = f[i];
f[i] = min(f[i], f[j] + cost[j][i] - ((double)d[i] * kk));
if (f[i] < tmp) {
pre[i] = j;
}
}
}
return f[n];
}
void print(int id) {
if (!id) return;
print(pre[id]);
printf("%d ", id);
}
int main() {
scanf("%d%d", &n, &L);
for (int i = 1; i <= n; i++) {
scanf("%d%d", cx + i, d + i);
}
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
cost[i][j] = sqrt(abs((cx[j] - cx[i]) - L));
}
}
double L = 0, R = 1e6;
while (abs(R - L) >= eps) {
double mid = (R + L) / 2.0;
if (calc(mid) + eps < 0) {
R = mid;
} else {
L = mid;
}
}
double mid = (L + R) / 2.0;
calc(mid);
print(n);
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e6 + 5;
long long a[MAXN];
long long b[MAXN];
long long dw[MAXN];
vector<long long> conn[MAXN];
long long dist[MAXN];
long long pre[MAXN];
long long vv[MAXN];
signed main() {
cin.tie(0)->sync_with_stdio(0);
long long n;
cin >> n;
for (long long i = 1; i <= n; i++) cin >> a[i];
for (long long i = 0; i <= n; i++) conn[i].clear();
for (long long i = 1; i <= n; i++) {
cin >> b[i], b[i] += i;
conn[b[i]].push_back(i);
}
set<long long> rem;
for (long long i = 0; i < n; i++) rem.insert(i);
memset(dist, -1, sizeof dist);
queue<long long> bfs;
bfs.push(n);
dist[n] = 0;
while (!bfs.empty()) {
long long u = bfs.front();
bfs.pop();
while (true) {
auto it = rem.upper_bound(u);
if (it == rem.begin()) break;
long long jmp = *prev(it);
if (u - jmp > a[u]) break;
long long v = b[jmp];
for (long long j : conn[v]) rem.erase(j);
if (dist[v] == -1) {
bfs.push(v);
dist[v] = dist[u] + 1;
pre[v] = u;
vv[v] = jmp;
}
if (v == 0) goto after;
}
}
after:
cout << dist[0] << '\n';
if (dist[0] == -1) return 0;
vector<long long> ans;
long long cur = 0;
while (cur != n) {
ans.push_back(vv[cur]);
cur = pre[cur];
}
reverse(ans.begin(), ans.end());
for (long long i : ans) cout << i << ' ';
cout << '\n';
}
| 1,900 | CPP |
n=int(input())
l=[[1]*n]*n
for i in range(1,n):
for j in range(1,n):
l[i][j]=l[i-1][j]+l[i][j-1]
print(l[n-1][n-1]) | 800 | PYTHON3 |
str = input()
str_set = set(str)
if len(str_set) % 2 == 0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 800 | PYTHON3 |
n = int(input())
for i in range(n):
a,b=list(map(int,input().split()))
c = 0
st=[]
for j in range(a):
s = (c+ord("a"))
st.append(chr(s))
c = (c+1)%b
for k in range(len(st)):
print(st[k],end="")
print("\n")
a = [] | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, t;
cin >> n;
long long int p[n], m[n];
for (long long int i = 0; i < n; i++) {
cin >> p[i];
m[i] = p[i];
}
sort(m, m + n, greater<int>());
for (long long int i = 0; i < n; i++) {
if (m[0] == p[i]) {
t = i + 1;
break;
}
}
cout << t << " " << m[1];
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int flag[1000009];
long long int a[1000009];
int main() {
long long int i, j, k, q, m, sum, p, t, x, y, n;
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i];
if (n == 1) {
cout << "+";
exit(0);
}
sum = a[n];
flag[n] = 1;
for (i = n - 1; i >= 1; i--) {
if (sum >= 0) {
flag[i] = -1;
sum = sum - a[i];
} else {
flag[i] = 1;
sum = sum + a[i];
}
}
if (sum < 0) {
for (i = 1; i <= n; i++) flag[i] *= -1;
}
for (i = 1; i <= n; i++) {
if (flag[i] == 1)
cout << "+";
else
cout << "-";
}
}
| 1,900 | CPP |
#include <bits/stdc++.h>
const int Maxn = 100005;
int n, m, q, nowtime;
std::vector<int> g[Maxn];
bool vis[Maxn];
int start[Maxn], finish[Maxn];
int lev[Maxn], dep[17][Maxn];
inline bool is_ancestor(int u, int v) {
return start[u] <= start[v] && finish[v] <= finish[u];
}
void dfs(int u) {
start[u] = ++nowtime;
vis[u] = 1;
dep[0][u] = u;
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i];
if (vis[v] && lev[v] < lev[dep[0][u]])
dep[0][u] = v;
else if (!vis[v]) {
lev[v] = lev[u] + 1;
dfs(v);
}
}
finish[u] = nowtime;
}
int work(int u, int v) {
int ans = 0;
if (!is_ancestor(u, v)) {
for (int i = 16; i >= 0; --i) {
if (!is_ancestor(dep[i][u], v)) {
u = dep[i][u];
ans += (1 << i);
}
}
u = dep[0][u];
ans++;
}
if (!is_ancestor(v, u)) {
for (int i = 16; i >= 0; --i) {
if (!is_ancestor(dep[i][v], u)) {
v = dep[i][v];
ans += (1 << i);
}
}
v = dep[0][v];
ans++;
}
return ans;
}
void lca_init() {
dfs(1);
for (int i = 1; i <= 16; ++i)
for (int j = 1; j <= n; ++j) dep[i][j] = dep[i - 1][dep[i - 1][j]];
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int u, v; m--;) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
lca_init();
for (int u, v; q--;) {
scanf("%d%d", &u, &v);
int ans1 = work(u, v), ans2 = work(v, u);
printf("%d\n", ans1 < ans2 ? ans1 : ans2);
}
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[110];
int main() {
int n, x, y;
cin >> n >> x >> y;
for (int i = 0; i < n; i++) cin >> a[i];
if (x > y) {
cout << n << endl;
return 0;
}
int cnt = 0;
for (int i = 0; i < n; i++)
if (x >= a[i]) cnt++;
cout << (cnt + 1) / 2 << endl;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m];
int best[n];
for (int i = 0; i < (n); i++)
for (int j = 0; j < (m); j++) cin >> a[i][j];
memset(best, 0, sizeof best);
for (int j = 0; j < (m); j++) {
for (int i = 0; i < n;) {
int s = i;
i++;
while (i < n && a[i - 1][j] <= a[i][j]) i++;
best[s] = max(i - 1, best[s]);
}
for (int i = (1); i < (n); i++)
if (a[i - 1][j] <= a[i][j]) best[i] = max(best[i], best[i - 1]);
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
l--, r--;
cout << (best[l] >= r ? "Yes" : "No") << endl;
}
return 0;
}
| 1,600 | CPP |
n,k=map(int,input().split())
ch1="."*n
if(k%2==0):
print("YES")
ch2="."+"#"*(k//2)+"."*(n-(k//2)-1)
ch3="."+"#"*(k//2)+"."*(n-(k//2)-1)
print(ch1)
print(ch2)
print(ch3)
print(ch1)
else:
if(k<=n-2):
print("YES")
ch2="."*((n-k)//2)+"#"*k+"."*((n-k)//2)
ch3=ch1
print(ch1)
print(ch2)
print(ch3)
print(ch1)
else:
print("YES")
p=k-n+2
ch2="."+"#"*(n-2)+"."
ch3="."+"#"*(p-1)+"."*(n-p-2)+"#"+"."
print(ch1)
print(ch2)
print(ch3)
print(ch1)
#na3n waldikom lkalb | 1,600 | PYTHON3 |
s=int(input())
for i in range(s):
p=int(input())
a=[int(i) for i in input().split()]
for i in range(len(a)):
a[i]=abs(a[i])
for i in range(p):
if(i%2==0):
a[i]*=-1
for i in a:
print(i,end=" ")
print() | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:128777216")
const int null = 0;
using namespace std;
template <class T>
int size(const T &a) {
return int(a.size());
}
template <class T>
T abs(const T &a) {
return (a < 0 ? -a : a);
}
template <class T>
T sqr(const T &a) {
return a * a;
}
const int max_n = 2001;
int a[max_n][max_n];
typedef bool bool2d[max_n][max_n];
bool2d was, was2, was3;
int n, m;
struct Pos {
int r, c;
void init(int r, int c) {
this->r = r;
this->c = c;
}
} q[max_n * max_n], q1[max_n * max_n], q2[max_n * max_n];
void bfs(int i, int j, Pos *q, bool2d &was, int &u) {
q[0].init(i, j);
was[i][j] = true;
u = 1;
for (int d = 0; d < u; d++) {
int i = q[d].r, j = q[d].c;
for (int di = -1; di <= 1; di++) {
for (int dj = -1; dj <= 1; dj++) {
int r = i + di, c = j + dj;
if (r >= 0 && c >= 0 && r < n && c < m) {
if (!was[r][c]) {
q[u++].init(r, c);
was[r][c] = true;
}
}
}
}
}
}
int bfs2(int i, int j, int dist) {
q2[0].init(i, j);
was2[i][j] = true;
int u = 1;
for (int i = 0, d = 0; i < dist; i++) {
int cu = u;
for (; d < cu; d++) {
int i = q2[d].r, j = q2[d].c;
for (int di = -1; di <= 1; di++) {
for (int dj = -1; dj <= 1; dj++) {
int r = i + di, c = j + dj;
if (r >= 0 && c >= 0 && r < n && c < m) {
if (!was2[r][c]) {
if (u == 90) {
for (int i = 0; i < u; i++) {
was2[q2[i].r][q2[i].c] = false;
}
return 1;
}
q2[u++].init(r, c);
was2[r][c] = true;
}
}
}
}
}
}
for (int i = 0; i < u; i++) {
was2[q2[i].r][q2[i].c] = false;
}
return 0;
}
vector<int> res;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
if (!a[i][j]) {
was[i][j] = was2[i][j] = was3[i][j] = true;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] && !was[i][j]) {
int u;
bfs(i, j, q, was, u);
for (int i = 0; i < u; i++) {
int r = q[i].r, c = q[i].c;
if (bfs2(r, c, 10)) {
was3[r][c] = true;
}
}
int cur = 0;
for (int i = 0; i < u; i++) {
int r = q[i].r, c = q[i].c;
if (!was3[r][c]) {
int q = 0;
bfs(r, c, q1, was3, q);
cur++;
}
}
res.push_back(cur);
}
}
}
printf("%d\n", res.size());
sort(res.begin(), res.end());
for (int i = 0; i < res.size(); i++) {
printf("%d ", res[i]);
}
return 0;
}
| 2,200 | CPP |
n,m,x,y=map(int,input().split())
sx=[]
sy=[]
sx.append(x)
sy.append(y)
j=1
for i in range(x,n+1):
if j==1:
for j in range(1,m+1):
if i==x and j==y:
continue
else:
sx.append(i)
sy.append(j)
elif j==m:
for j in range(m,0,-1):
if i==x and j==y:
continue
else:
sx.append(i)
sy.append(j)
z=j
for i in range(1,x):
if j==1:
for j in range(1,m+1):
if i==x and j==y:
continue
else:
sx.append(i)
sy.append(j)
elif j==m:
for j in range(m,0,-1):
if i==x and j==y:
continue
else:
sx.append(i)
sy.append(j)
for k in range(len(sx)):
print(sx[k],sy[k]) | 1,100 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.