solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
void solve() {
string name;
getline(cin, name);
for (long long int i = name.size() - 1; i >= 0; i--) {
if (name[i] >= 'A' && name[i] <= 'Z') {
if (name[i] == 'A' || name[i] == 'E' || name[i] == 'O' ||
name[i] == 'I' || name[i] == 'U' || name[i] == 'Y') {
cout << "YES";
return;
} else {
cout << "NO";
return;
}
}
if (name[i] >= 'a' && name[i] <= 'z') {
if (name[i] == 'a' || name[i] == 'e' || name[i] == 'o' ||
name[i] == 'i' || name[i] == 'u' || name[i] == 'y') {
cout << "YES";
return;
} else {
cout << "NO";
return;
}
}
}
}
signed main() {
long long int t = 1;
while (t--) {
solve();
cout << "\n";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[5005], b[5005];
short dp[5005][5005];
short posx[5005][5005], posy[5005][5005];
int main() {
scanf("%d%d", &n, &m);
scanf("%s", a + 1);
scanf("%s", b + 1);
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= m; ++j) dp[i][j] = -20000;
int ans = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
short x, y;
x = posx[i - 1][j - 1], y = posy[i - 1][j - 1];
if (a[i] == b[j]) dp[i][j] = max(2, dp[x][y] + x + y - i - j + 4);
posx[i][j] = i, posy[i][j] = j;
x = posx[i - 1][j], y = posy[i - 1][j];
if (dp[posx[i][j]][posy[i][j]] + posx[i][j] + posy[i][j] <
dp[x][y] + x + y) {
posx[i][j] = x;
posy[i][j] = y;
}
x = posx[i][j - 1], y = posy[i][j - 1];
if (dp[posx[i][j]][posy[i][j]] + posx[i][j] + posy[i][j] <
dp[x][y] + x + y) {
posx[i][j] = x;
posy[i][j] = y;
}
ans = max(ans, (int)dp[i][j]);
}
printf("%d\n", ans);
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
map<LL,int>num;
int n;
LL x,ans=0,sum=0;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&x);
sum+=x;
if(sum==0)ans++;
ans+=num[sum];
num[sum]++;
}
printf("%lld",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c *r) -> decltype(cerr << *r);
template <class c>
char dud(...);
struct muu {
template <class c>
muu &operator<<(const c &) {
return *this;
}
};
using pii = pair<int, int>;
using ld = long double;
using ll = long long;
const int maxn = 4 * 100007;
vector<int> v[maxn];
int oj[maxn];
int odl[maxn];
int finder(int x) {
if (oj[x] == x) return x;
return oj[x] = finder(oj[x]);
}
void unioner(int a, int b) {
a = finder(a), b = finder(b);
oj[a] = b;
}
int moj[maxn][20];
int mgl[maxn];
int pre[maxn], pos[maxn];
int zeit = 0;
void dfs(int a, int sk, int gl) {
moj[a][0] = sk;
mgl[a] = gl;
for (int i = 1; i < 20; i++) moj[a][i] = moj[moj[a][i - 1]][i - 1];
pre[a] = ++zeit;
for (auto it : v[a])
if (it != sk) dfs(it, a, gl + 1);
pos[a] = zeit;
}
bool isOj(int a, int b) { return pre[a] <= pre[b] && pos[b] <= pos[a]; }
int lca(int a, int b) {
if (isOj(a, b)) return a;
int ter = 19;
while (ter >= 0) {
if (isOj(moj[a][ter], b))
ter--;
else
a = moj[a][ter];
}
return moj[a][0];
}
int skacz(int a, int ile) {
for (int i = 1, ter = 0; i <= ile; i *= 2, ter++)
if ((i & ile)) a = moj[a][ter];
return a;
}
int main() {
int N, K, R;
scanf("%d%d%d", &N, &K, &R);
for (int i = 2; i <= N; i++) {
int a, b;
scanf("%d%d", &a, &b);
v[a].push_back(i + N);
v[i + N].push_back(b);
v[b].push_back(i + N);
v[i + N].push_back(a);
}
for (int i = 1; i <= 2 * N; i++) oj[i] = i;
queue<int> Q;
memset(odl, 107, sizeof(odl));
for (int i = 1; i <= R; i++) {
int a;
scanf("%d", &a);
Q.push(a);
odl[a] = 0;
}
while (!Q.empty()) {
int a = Q.front();
Q.pop();
if (odl[a] == K) continue;
for (auto it : v[a]) {
if (odl[it] > odl[a] + 1) {
odl[it] = odl[a] + 1;
Q.push(it);
}
unioner(a, it);
}
}
dfs(1, 1, 0);
int T;
scanf("%d", &T);
while (T--) {
int a, b;
scanf("%d%d", &a, &b);
int c = lca(a, b);
int odl = mgl[a] - mgl[c] + mgl[b] - mgl[c];
if (odl <= 2 * K)
printf("YES\n");
else {
int na;
if (mgl[a] - mgl[c] < K)
na = skacz(b, mgl[b] - mgl[c] - (K - (mgl[a] - mgl[c])));
else
na = skacz(a, K);
int nb;
if (mgl[b] - mgl[c] < K)
nb = skacz(a, mgl[a] - mgl[c] - (K - (mgl[b] - mgl[c])));
else
nb = skacz(b, K);
printf(finder(na) == finder(nb) ? "YES\n" : "NO\n");
}
}
return 0;
}
| 12 | CPP |
n = input()
s = list(input())
x = m = i = 0
for c in s:
if c == '-': i-=1
else: i+=1
x = min(x, i)
m = max(m, i)
print(i - x)
| 7 | PYTHON3 |
def main():
import sys
input = sys.stdin.readline
n, *abc = map(int, input().split())
query = []
for _ in [0] * n:
s = input()
query.append((ord(s[0]) - ord('A'), ord(s[1]) - ord('A')))
query.append((0, 1)) # 番兵
ans = ['A'] * n
for i in range(n):
a, b = query[i]
if abc[a] == 0 and abc[b] == 0:
print("No")
return
elif abc[a] == 0:
abc[a] += 1
abc[b] -= 1
ans[i] = chr(ord('A') + a)
elif abc[b] == 0:
abc[a] -= 1
abc[b] += 1
ans[i] = chr(ord('A') + b)
else:
if a in query[i+1]:
abc[a] += 1
abc[b] -= 1
ans[i] = chr(ord('A') + a)
else:
abc[a] -= 1
abc[b] += 1
ans[i] = chr(ord('A') + b)
print("Yes")
print(*ans, sep=('\n'))
main() | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 100 + 10;
constexpr int MOD = 1e6 + 3;
long long c, w, h, pw[N];
struct Mat {
long long mat[N][N], n, m;
Mat(int _n, int _m, bool f) {
n = _n;
m = _m;
for (int i = 0; i < _n; i++)
for (int j = 0; j < _m; j++) mat[i][j] = (i == j && f);
}
long long* operator[](int p) { return mat[p]; }
Mat operator*(Mat x) {
Mat res(n, x.m, 0);
for (int i = 0; i < n; i++)
for (int j = 0; j < x.m; j++)
for (int k = 0; k < m; k++)
res[i][j] = (res[i][j] + mat[i][k] * x[k][j]) % MOD;
return res;
}
Mat operator^(long long num) {
Mat res(n, m, 1);
Mat now = *this;
while (num) {
if (num & 1) res = res * now;
now = now * now;
num >>= 1;
}
return res;
}
} base(1, N - 1, 0), nxt(N - 1, N - 1, 0);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> c >> w >> h;
base[0][w + 1] = 1;
pw[0] = 1;
for (int i = 1; i < N; i++) pw[i] = (pw[i - 1] * h) % MOD;
for (int i = 1; i <= w; i++) nxt[i + 1][i] = 1;
for (int i = 1; i <= w + 1; i++) nxt[i][w + 1] = pw[w - i + 1];
base = base * (nxt ^ (c + 1));
cout << base[0][w + 1] << '\n';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 10;
vector<int> g[N];
int n, sz[N];
long long up[N], down[N];
int rt1 = 1, rt2 = 0;
void pre(int u, int p) {
sz[u] = 1;
for (auto v : g[u]) {
if (v == p) continue;
pre(v, u);
sz[u] += sz[v];
down[u] += down[v] + sz[v];
}
}
void dfs(int u, int p, int rt) {
if (p != u) {
up[u] = up[p] + (sz[rt] - sz[p]) + (down[p] - (down[u] + sz[u])) +
(sz[p] - sz[u]);
}
for (auto v : g[u]) {
if (v == p) continue;
dfs(v, u, rt);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
g[i].clear();
up[i] = down[i] = sz[i] = 0;
}
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
pre(1, 1);
dfs(1, 1, rt1);
long long ans = 0;
for (int i = 1; i <= n; i++) ans = max(ans, up[i] + down[i]);
cout << ans + n << endl;
}
| 11 | CPP |
import collections
from collections import defaultdict
import math
from math import gcd
from collections import Counter
def fun(a,ind):
i,j=ind-1,ind+1
while i>=0 and j<n and a[i]==a[j]:
i-=1
j+=1
if i<0 or j>=n:
return True
#def fun1(a,p,right):
# return (right+p) in
#for _ in range(1):
for _ in range(int(input())):
#n=int(input())
#n,m=[int(x) for x in input().split()]
#x1,x2,y1,y2,z1,z2=[int(c) for c in input().split()]
#a=[int(x) for x in input().split()]
s=input()
t=input()
n=len(t)
pivot=[0,n-1] #probable indices of t
for i in range(1,n-1):
if fun(t,i):
pivot.append(i)
ans = False
for ind in pivot:
right=t[:ind]
left=t[ind+1:]
#if len(right)>len(left):
temp = right
if len(right)<len(left):
temp = left[::-1]
#ans = ans or fun1(s,t[ind],right)
ans = ans or ((temp+t[ind]) in s)
if ans:
#print("temp",,len(temp))
#print(t[ind],s)
break
if ans:
print("YES")
else:
print("NO")
| 8 | PYTHON3 |
import sys
readline = sys.stdin.readline
H, W = map(int, readline().split())
G = [[1 if s == '#' else 0 for s in readline().strip()] for _ in range(H)]
DIREC = [(0, 1), (1, 0), (-1, 0), (0, -1)]
def calc():
zh = 0
for i in range(H):
cnt = 0
for j in range(W):
if G[i][j]:
if cnt == 0:
cnt = 1
continue
if cnt == 1:
continue
if cnt == 2:
return -1
else:
if cnt == 0:
continue
cnt = 2
if cnt == 0:
zh = 1
zw = 0
for j in range(W):
cnt = 0
for i in range(H):
if G[i][j]:
if cnt == 0:
cnt = 1
continue
if cnt == 1:
continue
if cnt == 2:
return -1
else:
if cnt == 0:
continue
cnt = 2
if cnt == 0:
zw = 1
if zw^zh:
return -1
ans = 0
used = set()
geta = W
for i in range(H):
for j in range(W):
if G[i][j] == 0:
continue
if (i*geta + j) in used:
continue
ans += 1
stack = [i*geta + j]
while stack:
nh, nw = divmod(stack.pop(), geta)
for dh, dw in DIREC:
fh, fw = nh+dh, nw+dw
if not 0 <= fh < H or not 0 <= fw < W:
continue
if not G[fh][fw]:
continue
vf = fh*geta + fw
if vf in used:
continue
stack.append(vf)
used.add(vf)
return ans
print(calc()) | 8 | PYTHON3 |
n,k=map(int,input().split())
a=[*range(1,n+1)]
print(*a[:n-k-1],*a[-1:-2-k:-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }
int main() {
cin.tie(NULL); ios::sync_with_stdio(false);
int n, c; cin >> n >> c;
V<> v(n), w(n); for (int i = 0; i < n; i++) cin >> v[i] >> w[i];
V<> dp(accumulate(v.begin(), v.end(), 0) + 1, 1e9);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = dp.size() - 1; j >= v[i]; j--) dp[j] = min(dp[j], dp[j - v[i]] + w[i]);
}
for (int j = dp.size() - 1; j >= 0; j--) if (dp[j] <= c) return cout << j << '\n', 0;
}
| 0 | CPP |
#include<iostream>
#include<sstream>
#include<string>
using namespace std;
int string_to_int(const string& str){
int n;
istringstream iss(str);
iss >> n;
return n;
}
bool solve(const string& s, const string& t){
if(t[0] == '0') return false;
int x = s.empty() ? 0 : string_to_int(s);
int y = string_to_int(t);
if(x > y) return false;
return (y-x)%2 == 0;
}
int main(){
int ans=0;
string str, s, t;
cin >> str;
for(int i=0; i<str.size(); ++i){
s = str.substr(0, i);
t = str.substr(i);
if(s.size() > t.size()) break;
if(solve(s, t)) ++ans;
}
cout << ans << endl;
return 0;
} | 0 | CPP |
n,k=map(int,input().strip().split())
scorelist=list(map(int,input().strip().split()))
excessCount=0
if(scorelist[k-1])>0:
for i in scorelist[k:]:
if(i<=0):
break
if i<scorelist[k-1]:
break
else:
excessCount+=1
else:
for i in reversed(scorelist[:k]):
if i>0:
break
else:
k-=1
print(k+excessCount) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, i;
int main() {
cin >> n;
while (n > 0) {
n = n >> 1;
i++;
}
cout << i << endl;
return 0;
}
| 7 | CPP |
A, B = input().split()
if A == B:
print('=')
else:
print('<>'[A>B::2]) | 0 | PYTHON3 |
# Pradnyesh Choudhari
# Sat Jul 18 22:32:48 2020
exec(int(input()) * 'print(1, int(input())-1);') | 7 | PYTHON3 |
import math
t = int(input())
for w in range(t):
a, b, c, d, k = [int(i) for i in input().split()]
if k - (math.ceil(a / c) + math.ceil(b / d)) > -1:
print(math.ceil(a / c), math.ceil(b / d))
else:
print(-1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int p, f;
cin >> p >> f;
int cnts, cntw;
cin >> cnts >> cntw;
int s, w;
cin >> s >> w;
int ans = 0;
if (s > w) {
swap(s, w);
swap(cnts, cntw);
}
for (int i = 0; i <= cnts; i++) {
int x = min(p / s, i);
int k = p - (x * s);
int y = min(k / w, cntw);
int nn = cnts - x, mm = cntw - y;
int pp = min(f / s, nn);
int l = f - (pp * s);
int qq = min(l / w, mm);
ans = max(ans, (x + y + pp + qq));
}
cout << ans << endl;
}
return 0;
}
| 8 | CPP |
#include<cstdio>
using namespace std;
int n, x, s;
int main(){
scanf("%d", &n); s=0;
for(int i=1; i<=n; i++){scanf("%d", &x); if(x&1)s++;}
if(s&1)printf("NO"); else printf("YES");
return 0;
} | 0 | CPP |
a = list(map(int, input().split()))
n = a[0]
f = a[1]
s = a[2]
a = []
for i in range(n):
a.append(i + 1)
count = 0
while len(a) != 2:
count += 1
size = len(a)
index = 0
temp = []
for i in range(0, size, 2):
index += 1
if (a[i] == f and a[i+1] == s) or (a[i] == s and a[i+1] == f):
print(count)
exit()
elif a[i] == f or a[i] == s:
temp.append(a[i])
else:
temp.append(a[i+1])
a = temp
print('Final!') | 8 | PYTHON3 |
s = input()
s = input()
c = 0
x = ""
for i in s:
if x == i:
c +=1
else:
x = i
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 700 + 10;
struct bint {
vector<int> a;
bint() {}
bint(int x) {
while (x) a.push_back(x % 10), x /= 10;
}
int size() { return a.size(); }
void norm() {
int dby = 0;
for (int i = 0; i < a.size(); i++) dby += a[i], a[i] = dby % 10, dby /= 10;
while (a.back() == 0) a.pop_back();
}
void print() {
for (int i = a.size() - 1; i >= 0; i--) cout << a[i];
}
};
bint operator+(bint a, bint b) {
int n = max(a.size(), b.size()) + 1;
a.a.resize(n);
b.a.resize(n);
bint res;
res.a.resize(n);
for (int i = 0; i < n; i++) res.a[i] = a.a[i] + b.a[i];
res.norm();
return res;
}
bint operator*(bint a, bint b) {
int n = a.size(), m = b.size();
bint res;
res.a.resize(n + m);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) res.a[i + j] += a.a[i] * b.a[j];
res.norm();
return res;
}
bool operator<(bint a, bint b) {
if (a.size() != b.size()) return a.size() < b.size();
for (int i = a.size() - 1; i >= 0; i--)
if (a.a[i] != b.a[i]) return a.a[i] < b.a[i];
return 0;
}
bool operator==(bint a, bint b) { return !(a < b) && !(b < a); }
int n;
vector<int> a[maxN], ch[maxN];
int f[maxN];
bint da[maxN], db[maxN], dc[maxN], dd[maxN];
bool cmp(int a, int b) {
bint l = max(da[b], dd[b]) * dc[a];
bint r = max(da[a], dd[a]) * dc[b];
if (l == r) return a < b;
return r < l;
}
void dfs(int v) {
f[v] = 1;
for (int i = 0; i < a[v].size(); i++)
if (!f[a[v][i]]) ch[v].push_back(a[v][i]), dfs(a[v][i]);
int n = ch[v].size();
sort(ch[v].begin(), ch[v].end(), cmp);
da[v] = db[v] = dc[v] = dd[v] = bint(1);
vector<bint> la, lc, ra;
la.push_back(bint(1));
lc.push_back(bint(1));
ra.push_back(bint(1));
for (int i = 0; i < n; i++) {
bint aa = max(da[ch[v][i]], dd[ch[v][i]]);
dc[v] = dc[v] * aa;
la.push_back(la.back() * aa);
lc.push_back(lc.back() * dc[ch[v][i]]);
}
for (int i = n - 1; i >= 0; i--)
ra.push_back(ra.back() * max(da[ch[v][i]], dd[ch[v][i]]));
for (int i = 0; i < n; i++)
dd[v] = max(dd[v], la[i] * max(db[ch[v][i]], dc[ch[v][i]]) * ra[n - i - 1]);
for (int i = 0; i <= n; i++) {
da[v] = max(da[v], lc[i] * ra[n - i] * bint(i + 1));
db[v] = max(db[v], lc[i] * ra[n - i] * bint(i + 2));
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
a[x].push_back(y);
a[y].push_back(x);
}
dfs(0);
bint res = max(da[0], dd[0]);
res.print();
cout << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
template <typename T>
void scan(T &x) {
x = 0;
bool _ = 0;
T c = getchar();
_ = c == 45;
c = _ ? getchar() : c;
while (c < 48 || c > 57) c = getchar();
for (; c < 48 || c > 57; c = getchar())
;
for (; c > 47 && c < 58; c = getchar()) x = (x << 3) + (x << 1) + (c & 15);
x = _ ? -x : x;
}
template <typename T>
void printn(T n) {
bool _ = 0;
_ = n < 0;
n = _ ? -n : n;
char snum[65];
int i = 0;
do {
snum[i++] = n % 10 + 48;
n /= 10;
} while (n);
--i;
if (_) putchar(45);
while (i >= 0) putchar(snum[i--]);
}
template <typename First, typename... Ints>
void scan(First &arg, Ints &...rest) {
scan(arg);
scan(rest...);
}
template <typename T>
void print(T n) {
printn(n);
putchar(10);
}
template <typename First, typename... Ints>
void print(First arg, Ints... rest) {
printn(arg);
putchar(32);
print(rest...);
}
template <typename... Args>
void printerr(Args... args) {}
using namespace std;
using ld = long double;
const int MM = 1e6 + 2;
const ld eps = 1e-9;
int n, k, d, cnt[MM], ans;
ld dp[MM];
char s[MM];
bool run(ld c) {
for (int i = 1; i <= n; i++) {
dp[i] = dp[i - 1] + s[i];
cnt[i] = cnt[i - 1];
int p = max(i - d, 0);
if (make_pair(dp[p] + c, cnt[p] + 1) < make_pair(dp[i], cnt[i])) {
dp[i] = dp[p] + c;
cnt[i] = cnt[p] + 1;
}
}
return cnt[n] <= k;
}
int main() {
scan(n, k, d);
for (int i = 1; i <= n; i++) s[i] = (getchar() <= 'Z');
ld l = 0, m, r = n + 2;
while (r - l > eps) {
m = (l + r) / 2;
if (run(m))
r = m;
else
l = m;
}
run(r);
ans = round(dp[n] - r * k);
for (int i = 1; i <= n; i++) s[i] ^= 1;
l = 0, r = n + 2;
while (r - l > eps) {
m = (l + r) / 2;
if (run(m))
r = m;
else
l = m;
}
run(r);
ans = min(ans, (int)round(dp[n] - r * k));
print(ans);
return 0;
}
| 12 | CPP |
#from itertools import *
#from math import *
#from bisect import *
#from collections import *
#from random import *
#from decimal import *
#from heapq import *
#from itertools import * # Things Change ....remember :)
import sys
input=sys.stdin.readline
def inp():
return int(input())
def st():
return input().rstrip('\n')
def lis():
return list(map(int,input().split()))
def ma():
return map(int,input().split())
t=inp()
while(t):
t-=1
n,k=ma()
a=lis()
a.sort()
cur=sum(a)-a[0]
if((cur+ a[0]) <=k):
print(0)
continue
z=sum(a)
suff=a[0]
ans=float('inf')
for i in range(n):
if(i):
suff+=a[n-i]
total=z-suff
total=k-total
ans1=total//(i+1)
ans=min(ans,max(0,a[0]-ans1)+i)
print(ans)
| 9 | PYTHON3 |
x = int(input())
for i in range(x):
y = str(input()).split(" ")
if (int(y[0]) > 1+int(y[1])+int(y[2])) or (int(y[1]) > 1+int(y[0])+int(y[2])) or (int(y[2]) > 1+int(y[1])+int(y[0])):
print("No")
else:
print("Yes")
| 7 | PYTHON3 |
def up(n,d):
for i in range(n):
print("*",end='')
for i in range(d):
print("D",end='')
for i in range(n):
print("*",end='')
print("")
n = int(input())
temp = 1
for i in range(n,0,-2):
up(i//2,temp)
temp+=2
temp-=4
for i in range(2,n,2):
up(i//2,temp)
temp-=2
| 7 | PYTHON3 |
n=list(input())
m=list(input())
if sorted(n)!=sorted(m):print('NO')
else:
s=0
for i in range(len(n)):
if n[i]!=m[i]:s=s+1
if s==2:print('YES')
else:print('NO') | 7 | PYTHON3 |
def resolve():
n = int(input())
xxyy = [list(map(str, input().split())) for _ in range(n)]
xxyy = sorted(xxyy, key=lambda x: (int(x[0]), int(x[1]), x[2], int(x[3]), x[4]))
for xy in xxyy:
print(*xy)
resolve()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
int a[510][510];
int main() {
int n;
scanf("%d", &n);
if (n <= 2) {
printf("-1\n");
return 0;
}
a[1][n - 1] = n * n;
for (int i = 1; i < n; i++) a[i][n] = n * n - i - 1;
a[n][n] = n * n - 1;
int now = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (!a[i][j]) a[i][j] = ++now;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int L[N], R[N], sum[N];
int main() {
int s, a, b, n, q;
scanf("%d%d%d%d", &s, &a, &b, &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", L + i, R + i);
sum[i] = sum[i - 1] + R[i] - L[i];
}
scanf("%d", &q);
while (q--) {
int x, y;
scanf("%d%d", &x, &y);
double ans = 0;
double ll = x - 1.0 * (x - a) * y / (y - s),
rr = x + 1.0 * (b - x) * y / (y - s);
int t1 = upper_bound(R + 1, R + 1 + n, ll) - R;
int t2 = lower_bound(L + 1, L + 1 + n, rr) - L - 1;
if (ll >= L[t1] && t1 <= n) ans -= ll - L[t1];
if (rr <= R[t2] && t2 >= 1) ans -= R[t2] - rr;
ans += sum[t2] - sum[t1 - 1];
printf("%lf\n", ans * (y - s) / y);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int i, j;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n;
cin >> n;
long long int max = 0;
for (i = 0; i < (n); i++) {
long long int x, y;
cin >> x >> y;
if (x + y > max) max = x + y;
}
cout << max;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 100000000000000007LL
#define ll long long
using namespace std;
int t[2019][2019], y[2019][2019];
signed main(){
int h,w;
cin>>h>>w;
vector<string> st(h);
for(int i=0;i<h;i++){
cin>>st[i];
}
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
if( st[i-1][j-1] == '.' ){
t[i][j] = t[i-1][j] + 1;
y[i][j] = y[i][j-1] + 1;
}
}
}
for(int i=h;i>=1;i--){
for(int j=w;j>=1;j--){
if( st[i-1][j-1] == '.' ){
t[i][j] = max( t[i][j], t[i+1][j] );
y[i][j] = max( y[i][j], y[i][j+1] );
}
}
}
int ans = 0;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
ans = max( ans, t[i][j] + y[i][j] - 1 );
}
}
cout<<ans<<endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (scanf("%d", &n) != EOF)
cout << n * (n + 1) / 2 + 1 << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) {
long long n;
cin >> n;
long long dp[2][n + 1];
dp[0][0] = 1;
dp[1][0] = 0;
for (long long i = 1; i <= n; i++) {
dp[0][i] = (3LL * dp[1][i - 1]) % 1000000007;
dp[1][i] = (2LL * dp[1][i - 1] + dp[0][i - 1]) % 1000000007;
}
cout << dp[0][n] % 1000000007 << endl;
}
}
| 11 | CPP |
import sys
s = ""
for line in sys.stdin:
s+=line
s=s.lower()
for str in list("abcdefghijklmnopqrstuvwxyz"):
print(*[str,":",s.count(str)])
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
for(int i = 0;i < h;i++)
{
string c;
cin >> c;
cout << c << endl << c << endl;
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct po {
int num, count;
} ss[400020];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int g = 0, s = 0, b = 0;
int n, k = 0;
scanf("%d", &n);
for (int i = 0; i <= n + 10; i++) {
ss[i].num = 0;
ss[i].count = 0;
}
int flag = 0;
scanf("%d", &ss[k].num);
ss[k].count++;
for (int i = 1; i < n; i++) {
int x;
scanf("%d", &x);
if (ss[k].num != x) {
if (flag == 0) {
flag++;
g = ss[k].count;
} else if (flag == 1) {
flag++;
s = s + ss[k].count;
if (g >= s) flag = 1;
} else if (flag == 2 && i <= n / 2) {
b = b + ss[k].count;
}
k++;
ss[k].num = x;
ss[k].count++;
} else
ss[k].count++;
}
if (g == 0 || s == 0 || b == 0 || g >= s || g >= b)
printf("0 0 0\n");
else
printf("%d %d %d\n", g, s, b);
}
}
| 7 | CPP |
num= int(input())
prob=0
solution=[str(input())for i in range(num)]
for j in solution :
if j.count('1')>=2 :
prob +=1
print(prob) | 7 | PYTHON3 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#define int long long
using namespace std;
const int maxn = 1e5+10;
const int mod = 1e9+7;
int read(){
int x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<3)+(x<<1)+c-48;c=getchar();}
return x*f;
}
int ksm(int x,int y){
int sum=1;
while(x){
if(x&1)sum=sum*y%mod;
y=y*y%mod;
x>>=1;
}
return sum;
}
int k,m,n;
int a[maxn];
int C[maxn];
signed main(){
n=read();k=read();
for(register int i=1;i<=n;i++)a[i]=read();
C[k-1]=1;
for(register int i=k;i<=n;i++){
C[i]=C[i-1]*i%mod*(ksm(mod-2,i-k+1))%mod;
}
sort(a+1,a+n+1);
int sum=0,ans=0;
for(register int i=n;i>=k;i--){
(ans=ans+C[i-1]*a[i]%mod)%=mod;
}
for(register int i=1;i+k-1<=n;i++){
(ans=ans-C[n-i]*a[i]%mod+mod)%=mod;
}
printf("%lld\n",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 2e9;
long long mpow(long long a, long long n) {
if (a == 0) return 1;
if (n == 0) return 1;
if (n == 1) return a;
if (n & 1) return mpow(a, n - 1) * a;
long long dop = mpow(a, n / 2);
return dop * dop;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
if (n <= 3) {
cout << 0;
return 0;
}
vector<long long> v(n + 1);
long long now = 0, mmax = 0;
for (long long c = 2; c < n; c++) {
long long can = (n / c * (c - 1));
can += max((n - c * (n / c) - 1), 0ll);
can -= (c - 1);
if (can > mmax) {
mmax = can;
now = c;
}
}
cout << now << " ";
for (long long c = 1; c < now; c++) {
cout << c << " ";
v[c] = 1;
}
cout << now + 1;
v[now + 1] = 1;
cout << endl;
long long last = now;
long long next = now + 2;
if (next % now == 0) next++;
while (next <= n - 1) {
vector<long long> dd;
long long t;
cin >> t;
for (long long c = t; c < t + last; c++) {
long long e = c;
if (e > n) e -= n;
if (v[e]) dd.push_back(e);
}
last = dd.size() + 1;
cout << last << " ";
for (auto i : dd) cout << i << " ";
cout << next << endl;
v[next] = 1;
next++;
if (next % now == 0) next++;
}
cin >> now;
cout << 0;
return 0;
}
| 12 | CPP |
N = int(input())
ans = []
# 偶数だったら対角、奇数だったらその一つ左を引く
for i in range(1, N + 1):
for j in range(1, N + 1):
if N % 2 == 0:
if i != j and i + j != N + 1:
if [j, i] not in ans:
ans.append([i, j])
else:
if i != j and i + j != N:
if [j, i] not in ans:
ans.append([i, j])
print(len(ans))
for i, j in ans:
print(i, j) | 0 | PYTHON3 |
# Author : devil9614 - Sujan Mukherjee
from __future__ import division, print_function
import os,sys
import math
import collections
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li(): return list(mi())
def dmain():
sys.setrecursionlimit(100000000)
threading.stack_size(40960000)
thread = threading.Thread(target=main)
thread.start()
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *,threading
#from itertools import permutations
#Copy 2D list m = [x[:] for x in mark] .. Avoid Using Deepcopy
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1]
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(n-r))
def binary_search(arr, low, high, x):
if high >= low:
mid = (high + low) // 2
if arr[mid] == x:
return mid
elif arr[mid] > x:
return binary_search(arr, low, mid - 1, x)
else:
return binary_search(arr, mid + 1, high, x)
else:
return -1
def ceil(x,y):
if x%y==0:
return x//y
else:
return x//y+1
def powerMod(x,y,p):
res = 1
x %= p
while y > 0:
if y&1:
res = (res*x)%p
y = y>>1
x = (x*x)%p
return res
def gcd(x, y):
while y:
x, y = y, x % y
return x
def isPrime(n) : # Check Prime Number or not
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
def read():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
def padded_bin_with_complement(x):
if x < 0:
return bin((2**16) - abs(x))[2:].zfill(16)
else:
return bin(x)[2:].zfill(16)
def binaryToDecimal(binary):
binary1 = binary
decimal, i, n = 0, 0, 0
while(binary != 0):
dec = binary % 10
decimal = decimal + dec * pow(2, i)
binary = binary//10
i += 1
print(decimal)
def CountFrequency(arr):
return collections.Counter(arr)
def pos(a):
b = [0]*len(a)
c = sorted(a)
for i in range(len(a)):
for j in range(len(a)):
if c[j] == a[i]:
b[i] = j
break
return b
def smallestDivisor(n):
# if divisible by 2
if (n % 2 == 0):
return 2
# iterate from 3 to sqrt(n)
i = 3
while(i * i <= n):
if (n % i == 0):
return i
i += 2
return n
def commonn(a,b,n):
c = []
for i in range(n):
if a[i] == b[i]:
c.append("-1")
else:
c.append(b[i])
return c
def main():
for _ in range(ii()):
n = ii()
a = li()
b = li()
c = sorted(a)
f = 0
# c.sort(reverse = True)
if a == c:
print("Yes")
# print(a)
# print(c)
continue
else:
if len(set(b)) == 2:
print("Yes")
else:
print("No")
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
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")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
#read()
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main(void) {
long long n, k;
cin >> n >> k;
long long temp = 1;
for (long long i = 1; i <= k; i++) temp *= 10;
cout << n * temp / gcd(temp, n);
}
| 7 | CPP |
#include<iostream>
#include<algorithm>
#include<map>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
int n;
pair<ll,int> p[300010],b[300010];
ll a[300010];
bool use[300010];
int main(){
cin.tie(0);
std::ios::sync_with_stdio(0);
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i].fs;
p[i] = make_pair(a[i],i);
b[i].sc = i;
use[i] = false;
}
sort(p,p+n); sort(b,b+n);
int ans = 0;
ll sum = 0;
int id = 0, num = 0;
for(int i=0;i<n;i++){
if(!use[b[i].sc]){
sum += a[b[i].sc];
use[b[i].sc] = true;
num++;
}
while(id < n && p[id].fs<=b[i].fs){
if(!use[p[id].sc]){
sum += p[id].fs;
use[p[id].sc] = true;
num++;
}
id++;
}
while(id<n){
if(!use[p[id].sc]){
if(sum+p[id].fs > (num+1)*b[i].fs)break;
sum += p[id].fs;
use[p[id].sc] = true;
num++;
}
id++;
}
if(sum <= num*b[i].fs)ans = max(ans,num);
sum -= a[b[i].sc]; num--;
}
cout << ans << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char c = getchar();
while ((c < '0' || c > '9') && (c != '-')) c = getchar();
if (c == '-') f = -1, c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * f;
}
const int N = 2e5 + 10;
int n, m, q, r[N], id[N], pos[N];
long long a[N];
unsigned long long ans[N];
vector<pair<int, int> > e[N];
pair<int, int> Q[N];
const long long inf = 1e15;
bool vis[N];
long long dis[N];
inline void dij() {
for (int i = (1); i <= (n); i++) dis[i] = inf;
priority_queue<pair<long long, long long> > q;
q.push(make_pair(0, 1)), dis[1] = 0;
while (!q.empty()) {
int u = q.top().second;
q.pop();
if (vis[u]) continue;
vis[u] = 1;
for (auto [v, w] : e[u])
if (dis[u] + w < dis[v]) {
dis[v] = dis[u] + w, q.push(make_pair(-dis[v], v));
}
}
}
int pre[N];
bool flag[N];
long long mn_mn[N << 2], mn_mx[N << 2], mn2_mn[N << 2], mn2_mx[N << 2],
tagmn2[N << 2], tagmn[N << 2];
unsigned long long v[N << 2], smn2[N << 2];
int mnpos[N << 2];
bool samemn[N << 2];
unordered_map<int, int> cnt2[N << 2];
int cnt[N << 2];
inline void Build(int u, int l, int r) {
mn_mn[u] = mn_mx[u] = mn2_mn[u] = mn2_mx[u] = inf;
samemn[u] = 1;
for (int i = (l); i <= (r); i++)
if (!flag[i]) ++cnt[u], ++cnt2[u][pre[i]];
if (l == r) return;
int mid = l + r >> 1;
Build(u << 1, l, mid), Build(u << 1 ^ 1, mid + 1, r);
}
inline unsigned long long recalc(int u) {
int t = cnt2[u][mnpos[u]];
unsigned long long ret = (unsigned long long)mn_mn[u] * (cnt[u] - t);
if (mn2_mn[u] != inf || mnpos[u] == 1)
ret += (unsigned long long)(mnpos[u] != 1 ? mn2_mn[u] : mn_mn[u]) * t;
return ret;
}
inline void updmn(int u, long long x, int y) {
if (y == mnpos[u]) {
mn_mn[u] = mn_mx[u] = tagmn[u] = x;
if (mnpos[u] == 1) smn2[u] = (unsigned long long)cnt2[u][mnpos[u]] * x;
v[u] = (unsigned long long)x * (cnt[u] - cnt2[u][mnpos[u]]) + smn2[u];
return;
}
mn2_mn[u] = mn2_mx[u] = mn_mn[u], tagmn2[u] = mn_mn[u];
samemn[u] = 1, mn_mn[u] = mn_mx[u] = x;
tagmn[u] = x, mnpos[u] = y, v[u] = recalc(u);
if (mn2_mn[u] != inf || mnpos[u] == 1)
smn2[u] =
(unsigned long long)(mnpos[u] != 1 ? mn2_mn[u] : mn_mn[u]) * cnt2[u][y];
else
smn2[u] = 0;
}
inline void updmn2(int u, long long x) {
mn2_mn[u] = mn2_mx[u] = x, tagmn2[u] = x;
if (mn2_mn[u] != inf || mnpos[u] == 1)
smn2[u] = (unsigned long long)(mnpos[u] != 1 ? mn2_mn[u] : mn_mn[u]) *
cnt2[u][mnpos[u]];
else
smn2[u] = 0;
v[u] = recalc(u);
}
inline void push_down(int u) {
if (tagmn[u])
updmn(u << 1, tagmn[u], mnpos[u]), updmn(u << 1 ^ 1, tagmn[u], mnpos[u]),
tagmn[u] = 0;
if (tagmn2[u])
updmn2(u << 1, tagmn2[u]), updmn2(u << 1 ^ 1, tagmn2[u]), tagmn2[u] = 0;
}
inline void push_up(int u) {
v[u] = v[u << 1] + v[u << 1 ^ 1];
mn_mn[u] = min(mn_mn[u << 1], mn_mn[u << 1 ^ 1]);
mn_mx[u] = max(mn_mx[u << 1], mn_mx[u << 1 ^ 1]);
mn2_mn[u] = min(mn2_mn[u << 1], mn2_mn[u << 1 ^ 1]);
mn2_mx[u] = max(mn2_mx[u << 1], mn2_mx[u << 1 ^ 1]);
samemn[u] = samemn[u << 1] & samemn[u << 1 ^ 1] &
(mn_mn[u << 1] == mn_mn[u << 1 ^ 1] &&
mnpos[u << 1] == mnpos[u << 1 ^ 1]);
if (samemn[u])
mnpos[u] = mnpos[u << 1], smn2[u] = smn2[u << 1] + smn2[u << 1 ^ 1];
else
smn2[u] = 0;
}
inline void update(int u, int l, int r, int ql, int qr, long long x, int y) {
if (mn2_mx[u] <= x) return;
if (l >= ql && r <= qr) {
if (samemn[u]) {
if (x < mn_mn[u] || (x == mn_mn[u] && y < mnpos[u])) {
updmn(u, x, y);
return;
} else if (mn2_mn[u] > x) {
updmn2(u, x);
return;
}
}
}
int mid = l + r >> 1;
push_down(u);
if (ql <= mid) update(u << 1, l, mid, ql, qr, x, y);
if (qr > mid) update(u << 1 ^ 1, mid + 1, r, ql, qr, x, y);
push_up(u);
}
inline long long Query(int u, int l, int r, int ql) {
if (l == r) return mn2_mn[u];
int mid = l + r >> 1;
push_down(u);
if (ql <= mid)
return Query(u << 1, l, mid, ql);
else
return Query(u << 1 ^ 1, mid + 1, r, ql);
}
inline void update(int x, long long y) {
if (r[x] < n) update(1, 1, n, r[x] + 1, n, y, x);
}
int main() {
n = read(), m = read(), q = read();
for (int i = (1); i <= (n); i++) a[i] = read();
for (int i = (1); i <= (m); i++) {
int x = read(), y = read(), z = read();
e[x].emplace_back(y, z), e[y].emplace_back(x, z);
}
dij();
for (int i = (1); i <= (n); i++) id[i] = i;
sort(id + 1, id + 1 + n, [=](int a, int b) { return dis[a] < dis[b]; });
for (int i = (1); i <= (n); i++) pos[id[i]] = i;
flag[1] = 1;
for (int i = (2); i <= (n); i++) {
for (auto [v, w] : e[id[i]])
if (dis[v] + w == dis[id[i]]) {
if (!pre[i])
pre[i] = pos[v];
else
flag[i] = 1;
}
}
r[n] = n;
for (int i = (n - 1); i >= (1); i--)
r[i] = dis[id[i]] == dis[id[i + 1]] ? r[i + 1] : i;
Build(1, 1, n);
for (int i = (1); i <= (q); i++) {
Q[i].first = read(), Q[i].second = read();
a[Q[i].first] += Q[i].second;
}
for (int i = (1); i <= (n); i++) update(i, a[id[i]]);
for (int i = (q); i >= (1); i--) {
ans[i] = v[1];
a[Q[i].first] -= Q[i].second;
update(pos[Q[i].first], a[Q[i].first]);
}
ans[0] = v[1];
for (int i = (0); i <= (q); i++) printf("%llu\n", ans[i]);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
vector<int> ans;
vector<long long> a;
int main() {
int n;
cin >> n;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i == n / i) {
ans.push_back(i);
} else {
ans.push_back(i);
ans.push_back(n / i);
}
}
}
for (int i = 0; i < ans.size(); i++) {
long long d = ans[i];
long long j = (n - 1) / d + 1;
long long las = 1 + 1LL * (j - 1) * d;
long long qq = (1 + las) * j / 2;
a.push_back(qq);
}
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
printf("%lld ", a[i]);
}
return 0;
}
| 9 | CPP |
from collections import deque
from math import ceil
import sys
input = sys.stdin.buffer.readline
def print(val):
sys.stdout.write(str(val) + '\n')
# for _ in range(int(input())):
n = int(input())
a = []
for i in range(n):
b, d = [int(i) for i in input().split()]
a.append((b,1))
a.append((d,-1))
a.sort()
mx = k = y = 0
for i in a:
k += i[1]
if k>mx:
y = i[0]
mx = k
sys.stdout.write(str(y)+' '+str(mx)+'\n') | 13 | PYTHON3 |
n = int(input())
array = [input() for x in range(n)]
count = 1
for i in range(1, len(array)):
if array[i] != array[i - 1]:
count += 1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 505;
const int MOD = 998244353;
int add(int a, int b) { return (a + b) % MOD; }
int mult(long long a, long long b) { return (a * b) % MOD; }
int subs(int a, int b) { return (a - b + MOD) % MOD; }
int dp[MX][MX][2];
int acum[MX][MX][2];
int dpRec[MX][MX][2];
bool used[MX][MX][2];
long long rec(long long m1, long long L, bool taken) {
if (L == 0) {
if (!taken)
return 0;
else
return 1;
}
if (used[m1][L][taken]) return dpRec[m1][L][taken];
used[m1][L][taken] = true;
long long ans = 0;
for (long long i = 1; i <= min(m1 - 1, L); i++) {
ans += rec(m1, L - i, taken);
ans %= MOD;
}
if (L - m1 >= 0) {
ans += rec(m1, L - m1, true);
ans %= MOD;
}
return dpRec[m1][L][taken] = ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
if (k == 1) {
cout << "0\n";
return 0;
}
for (int maxi = 1; maxi <= n; maxi++) {
dp[maxi][0][0] = 0;
dp[maxi][0][1] = 1;
}
for (int maxi = 1; maxi <= n; maxi++) {
acum[maxi][1][1] = 1;
for (int a = 1; a <= n; a++) {
for (int taken = 0; taken <= 1; taken++) {
int left = max(a - maxi + 1, 0);
dp[maxi][a][taken] =
subs(acum[maxi][a][taken], acum[maxi][left][taken]);
if (a - maxi >= 0) {
dp[maxi][a][taken] =
add(dp[maxi][a][taken], dp[maxi][a - maxi][true]);
}
acum[maxi][a + 1][taken] =
add(acum[maxi][a][taken], dp[maxi][a][taken]);
}
}
}
long long ans = 0;
for (long long maxi = 1; maxi <= n; maxi++) {
int t;
if (k % maxi == 0) {
t = k / maxi - 1;
} else {
t = k / maxi;
}
t = max(0, t);
t = min(t, n);
ans = add(ans, mult(dp[maxi][n][false], dp[t][n][true]));
}
cout << mult(ans, 2) << "\n";
return 0;
}
| 11 | CPP |
l=[100,20,10,5,1]
i=0
a=int(input())
r=0
while(a>0):
r+=a//l[i]
a-=l[i]*(a//l[i])
i+=1
print(r) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int h, r, ans, m;
scanf("%d", &r);
scanf("%d", &h);
m = h % r;
ans = 2 * (h / r);
ans += ((2 * m >= r) ? 2 : 1);
ans += ((2.0 * m >= (sqrt(3.0) * r)) ? 1 : 0);
printf("%d", ans);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void qmax(int &x, int y) {
if (x < y) x = y;
}
void qmin(int &x, int y) {
if (x > y) x = y;
}
inline int read() {
char s;
int k = 0, base = 1;
while ((s = getchar()) != '-' && s != EOF && !(isdigit(s)))
;
if (s == EOF) exit(0);
if (s == '-') base = -1, s = getchar();
while (isdigit(s)) {
k = k * 10 + (s ^ '0');
s = getchar();
}
return k * base;
}
inline void write(int x) {
static char cnt, num[15];
cnt = 0;
if (!x) {
putchar('0');
return;
}
for (; x; x /= 10) num[++cnt] = x % 10;
for (; cnt; putchar(num[cnt--] + 48))
;
}
const int maxn = 110;
const long long mod = 1e9 + 7;
long long dp[110][110][110];
long long g[110][110];
int n, id, po[maxn], ne[maxn * 2], to[maxn * 2], X, Y;
int sz[maxn];
void add(int x, int y) {
id++;
to[id] = y;
ne[id] = po[x];
po[x] = id;
}
void Mod(long long &x) {
if (x >= mod) x -= mod;
}
void f(int x, int Fa) {
sz[x] = 1;
dp[x][1][1] = 1;
for (int i = po[x]; i; i = ne[i]) {
if (Fa == to[i]) continue;
f(to[i], x);
memset(g, 0, sizeof(g));
for (int p = 1; p <= sz[x]; p++)
for (int k = 1; k <= (sz[x] - p + 1); k++)
if (dp[x][p][k] != 0) {
for (int q = 1; q <= sz[to[i]]; q++)
for (int s = 1; s <= sz[to[i]] - q + 1; s++) {
g[p + q][k] += dp[x][p][k] * dp[to[i]][q][s] % mod * s % mod;
Mod(g[p + q][k]);
g[p + q - 1][k + s] += dp[x][p][k] * dp[to[i]][q][s] % mod;
Mod(g[p + q - 1][k + s]);
}
}
sz[x] += sz[to[i]];
for (int p = 1; p <= sz[x]; p++)
for (int k = 1; k <= sz[x]; k++) dp[x][p][k] = g[p][k];
}
}
long long ans[maxn];
long long jie[maxn * 2], ny[maxn];
long long ksm(long long x, int y) {
if (y < 0) return 0;
long long sum = 1;
while (y) {
if (y & 1) sum = sum * x % mod;
x = x * x % mod;
y >>= 1;
}
return sum;
}
long long C(int y, int x) { return jie[y] * ny[x] % mod * ny[y - x] % mod; }
int main() {
n = read();
jie[0] = 1;
for (int i = 1; i < n; i++) {
X = read();
Y = read();
add(X, Y);
add(Y, X);
}
for (int i = 1; i <= n; i++) {
jie[i] = jie[i - 1] * i % mod;
ny[i] = ksm(jie[i], mod - 2);
}
ny[0] = ny[1];
f(1, 0);
ans[n - 1] = dp[1][1][n];
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= i + 1; j++)
ans[i] += dp[1][n - i][j] * j % mod, Mod(ans[i]);
ans[i] = ans[i] * ksm(n, n - i - 2) % mod;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1, cur = -1; j < n; j++, cur = -cur) {
ans[i] += (long long)cur * ans[j] * C(j, i) % mod;
ans[i] %= mod;
}
if (ans[i] < 0) ans[i] += mod;
printf("%lld ", ans[i]);
}
return 0;
}
| 10 | CPP |
import sys
input=sys.stdin.readline
n,z=map(int,input().split())
x=list(map(int,input().split()))
x.sort()
l=0;r=n//2+1
while r-l>1:
mid=(l+r)//2
ok=True
for i in range(mid):
ok&=(x[n-mid+i]-x[i]>=z)
if ok:
l=mid
else:
r=mid
print(l) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char arr[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> arr[i][j];
}
long long result = 0;
long long fact[101];
fact[0] = 0;
for (int i = 1; i < 100; i++) fact[i] = (i * (i - 1)) / 2;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) cnt += arr[i][j] == 'C' ? 1 : 0;
result += fact[cnt];
}
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) cnt += arr[j][i] == 'C' ? 1 : 0;
result += fact[cnt];
}
cout << result;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
num = 0
for i in range(n):
for j in range(i, n):
tmp = 0
for k in range(n):
if i <= k <= j:
if a[k] == 0:
tmp += 1
else:
if a[k] == 1:
tmp += 1
num = max(num, tmp)
print(num)
| 7 | PYTHON3 |
n, k = map(int,input().split())
a = list(map(int,input().split()))
a = list(filter(lambda x: k % x == 0, a))
print(k // max(a)) | 7 | PYTHON3 |
class Node:
def __init__(self,z):
self.key=z
self.left=None
self.right=None
def insert(z):
global root
if root==None:
root=Node(z)
else:
x=root
while True:
if z<x.key:
if x.left:
x=x.left
else:
x.left=Node(z)
break
else:
if x.right:
x=x.right
else:
x.right=Node(z)
break
def inorder(z):
if z==None:
return []
else:
return inorder(z.left)+[z.key]+inorder(z.right)
def preorder(z):
if z==None:
return []
else:
return [z.key]+preorder(z.left)+preorder(z.right)
root=None
n=int(input())
for _ in range(n):
p=input()
if p[0]=="i":
insert(int(p[7:]))
else:
print("",*inorder(root))
print("",*preorder(root))
| 0 | PYTHON3 |
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
num = -1
mino = int(1e18)
for i in range(k):
if mino > n % a[i]:
num = i + 1
mino = n % a[i]
print(num, n // a[num - 1]) | 8 | PYTHON3 |
s=str(input())
s2=str()
if (s[0].isupper()==1):
print(s)
else:
s2=s[0].upper()
for x in range(len(s)-1):
s2=s2+s[x+1]
print(s2)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,r;
cin >> a >> b >> r;
int u[b],v[b],d[b];
for(int i=0;i<b;i++)
{
cin >> u[i] >> v[i] >> d[i];
}
int dis[a];
for(int i=0;i<a;i++)
{
dis[i]=INT_MAX;
}
dis[r]=0;
for(int j=1;j<a;j++)
{
for(int i=0;i<b;i++)
{
if(dis[u[i]]!=INT_MAX)
{
if(dis[v[i]]>dis[u[i]]+d[i])
dis[v[i]]=dis[u[i]]+d[i];
}
}
}
int g=0;
for(int i=0;i<b;i++)
{
if(dis[u[i]]!=INT_MAX)
{
if(dis[v[i]]>dis[u[i]]+d[i])
{
g++;
}
}
}
if(g>0)
cout << "NEGATIVE CYCLE" << endl;
else
{
for(int i=0;i<a;i++)
{
if(dis[i]==INT_MAX)
cout << "INF" << endl;
else
cout << dis[i] << endl;
}
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100, inF = 1e6 + 10;
int n, k, u, v, c, maxi, a[N], sz[N];
bool ok;
vector<int> nei[N];
int get_sz(int v, int par = -1) {
for (int u : nei[v])
if (u != par) sz[v] += get_sz(u, v);
return ++sz[v];
}
int dfs(int v, int par = -1) {
int dp = (a[v] < c ? -inF : 1);
int mx1 = 0, mx2 = 0;
for (int u : nei[v])
if (u != par) {
int DP = dfs(u, v);
if (DP == sz[u])
dp += DP;
else {
mx2 = max(mx2, DP);
if (mx2 > mx1) swap(mx1, mx2);
}
}
ok |= (dp + mx1 + mx2) >= k;
if (a[v] < c) return 0;
return dp + mx1;
}
bool check() {
ok = false;
dfs(min_element(a, a + n) - a);
return ok;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
cin >> u >> v;
nei[--u].push_back(--v);
nei[v].push_back(u);
}
get_sz(min_element(a, a + n) - a);
int l = 0, r = inF;
while (r - l > 1) {
c = (l + r) >> 1;
if (check())
l = c;
else
r = c;
}
cout << l;
return 0;
}
| 11 | CPP |
import sys
for i in range(int(input())):
t = tuple([int(i) for i in input().split()])
if t[0] != t[2]:
print(f'{t[0]} {t[2]}')
else:
print(f'{t[0]} {t[0]+1}')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, same = 0;
cin >> n;
vector<int> v(n), vt, vtr;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] == v[0]) same++;
}
if (n <= 2 || same == n)
cout << -1 << endl;
else {
vt = v;
sort(vt.begin(), vt.end());
vtr = vt;
reverse(vtr.begin(), vtr.end());
for (int i = 1; i < n; i++) {
if (v[i] == v[i - 1]) continue;
swap(v[i], v[i - 1]);
if (v != vt && v != vtr) {
cout << i << " " << i + 1 << endl;
return 0;
}
swap(v[i], v[i - 1]);
}
}
if (!(n <= 2 || same == n)) cout << -1 << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long fastpow(long long a, long long b, long long mod) {
long long res = 1, base = a;
while (b) {
if (b & 1) res = res * base % mod;
base = base * base % mod;
b >>= 1;
}
return res;
}
int main() {
ios::sync_with_stdio(false);
long long n, m, l, r, mod = 998244353;
cin >> n >> m >> l >> r;
if (l == r) return cout << 1, 0;
if (n * m & 1) return cout << fastpow(r - l + 1, n * m, mod), 0;
cout << (fastpow(r - l + 1, n * m, mod) +
fastpow(((r - l + 1) & 1), n * m, mod)) *
fastpow(2, mod - 2, mod) % mod;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
cout << n << "\n";
}
return 0;
}
| 7 | CPP |
n,m=map(int,input().split())
import math
if n>=2*m or m>=2*n:
print(min(n,m))
else:
print(math.floor((n+m)/3))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const long long oo = 1e9;
const long long OO = 1e18;
const long double eps = 1e-9;
struct T {
long long p, c, i;
};
bool operator<(T a, T b) { return a.p < b.p; }
long long n, k;
T t[200000];
long long rep[200000];
long long C[200000];
signed main() {
fast_io();
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> t[i].p;
for (long long i = 0; i < n; i++) cin >> t[i].c, C[i] = t[i].c;
for (long long i = 0; i < n; i++) t[i].i = i;
sort(t, t + n);
priority_queue<long long, vector<long long>, greater<long long>> Q;
long long somme = 0;
for (long long i = 0; i < n; i++) {
rep[t[i].i] = somme + C[t[i].i];
if (k == 0) continue;
if (Q.size() < k)
Q.push(t[i].c), somme += t[i].c;
else {
if (Q.top() < t[i].c) {
somme -= Q.top();
somme += t[i].c;
Q.pop();
Q.push(t[i].c);
}
}
}
for (long long i = 0; i < n; i++) cout << rep[i] << " ";
cout << endl;
}
| 8 | CPP |
h,w = map(int,input().split())
f = lambda x:print('#'*x)
f(w+2)
for _ in range(h):
print('#'+input()+'#')
f(w+2) | 0 | PYTHON3 |
t = int(input())
for case in range(t):
n = int(input())
ans = n // 2
if n % 2 == 0: ans -= 1
print(ans)
| 7 | PYTHON3 |
s=input()
n=int(input())
t=True
a=str()
b=str()
for i in range(n):
q=input().split()
if(len(q)==1):
t=not t
continue
if(int(q[1])==1):
if(t):a=q[2]+a
else:b=b+q[2]
if(int(q[1])==2):
if(t):b=b+q[2]
else:a=q[2]+a
if(t):print(a+s+b)
else:print(b[::-1]+s[::-1]+a[::-1]) | 0 | PYTHON3 |
n,m = map(int,input().split())
print((n+m-1)//n)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s, s += '!';
int p = 0, mrka = 0, mrkb = 0, mrkc = 0;
while (s[p] == 'a') mrka++, p++;
if (!mrka) return cout << "NO", 0;
while (s[p] == 'b') mrkb++, p++;
if (!mrkb) return cout << "NO", 0;
while (s[p] == 'c') mrkc++, p++;
if ((mrkc != mrka && mrkc != mrkb) || s[p] != '!') return cout << "NO", 0;
cout << "YES";
return 0;
}
| 7 | CPP |
import math
n,m,a=map(float,input().split())
print((math.ceil(n/a)) * (math.ceil(m/a)))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool ok[1000000 + 1];
int primes[1000000 + 1];
int numprimes = 2;
void sieve(void) {
primes[0] = 2;
primes[1] = 3;
for (int z = 0; z <= 1000000; z++) ok[z] = false;
for (int x = 1; x <= 1000; x++) {
for (int y = 1; y <= 1000; y++) {
long int n = (4 * x * x) + (y * y);
if (n <= 1000000 && (n % 12 == 1 || n % 12 == 5)) ok[n] ^= true;
n = (3 * x * x) + (y * y);
if (n <= 1000000 && n % 12 == 7) ok[n] ^= true;
n = (3 * x * x) - (y * y);
if (x > y && n <= 1000000 && n % 12 == 11) ok[n] ^= true;
}
}
for (int r = 5; r <= 1000; r++)
if (ok[r])
for (int i = r * r; i < 1000000; i += r * r) ok[i] = false;
for (int a = 5; a < 1000000; a++) {
if (ok[a]) {
primes[numprimes++] = a;
}
}
}
int n_divisors(int n) {
int divisors = 1;
int i = 0, power;
{
for (; primes[i] * primes[i] <= n; ++i) {
power = 0;
while (!(n % primes[i])) {
n /= primes[i];
power++;
}
divisors *= power + 1;
}
}
if (n > 1) {
divisors *= 2;
}
return divisors;
}
int main() {
sieve();
int count = 0;
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
for (int i = 1; i <= a; i++)
for (int j = 1; j <= b; j++)
for (int k = 1; k <= c; k++) {
count += n_divisors(i * j * k);
if (count > 1073741824) count %= 1073741824;
}
cout << count << endl;
return 0;
}
| 8 | CPP |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,a,tmp;
int s[10],w[10];
string f[10],temp;
int t[10];
vector<int>ans;
int get_weight(int);
void swap_data(int);
void sort_data();
int main(){
while(cin>>n&&n!=0){
ans.clear();
for(int i=0;i<n;i++){
cin>>f[i];
cin>>w[i]>>s[i];
}
sort_data();
//for(int i=0;i<n;i++)cout<<f[i]<<' '<<w[i]<<' '<<s[i]<<endl;
//cout<<'='<<endl;
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(w[j]<w[j+1]){
swap_data(j);
a=get_weight(j+1);
if(a>s[j])swap_data(j);
}
}
}
}
for(int i=0;i<n;i++)cout<<f[i]<<endl;
}
return 0;
}
int get_weight(int x){
int res=0;
for(int i=x;i<n;i++)res+=w[i];
return res;
}
void swap_data(int x){
tmp=w[x];
w[x]=w[x+1];
w[x+1]=tmp;
tmp=s[x];
s[x]=s[x+1];
s[x+1]=tmp;
temp=f[x];
f[x]=f[x+1];
f[x+1]=temp;
}
void sort_data(){
for(int i=n-1;i>0;i--){
for(int j=0;j<i;j++){
if(s[j]<s[j+1])swap_data(j);
else if(s[j]==s[j+1]&&w[j]<w[j+1])swap_data(j);
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
const double eps = 1e-9;
const int int_inf = 2147483640;
const long long i64_inf = 9223372036854775800ll;
const double pi = acos(-1.0);
using namespace std;
bool mark[100500];
vector<int> g[100500];
int n, m, k;
int second, t;
int d[100500];
bool was[100500];
void dfs(int v, int ma) {
was[v] = 1;
for (int i = 0; i < (int)g[v].size(); i++) {
int to = g[v][i];
if (was[to]) continue;
if (d[v] < (ma >> 1)) {
if (d[to] <= (ma >> 1)) dfs(to, ma);
} else if (d[v] == (ma >> 1))
if (d[to] < (ma >> 1) || (d[to] == (ma >> 1) && (ma & 1))) dfs(to, ma);
}
}
bool can(int ma) {
memset(was, 0, sizeof was);
dfs(second, ma);
return was[t];
}
int solve() {
int l = 0;
int r = n + 1;
while (l != r - 1) {
int m = (l + r) >> 1;
if (can(m))
r = m;
else
l = m;
}
if (!can(r))
return -1;
else
return r;
}
int main() {
memset(mark, 0, sizeof mark);
cin >> n >> m >> k;
for (int i = 0; i < (int)k; i++) {
int u;
scanf("%d", &u);
--u;
mark[u] = 1;
}
for (int i = 0; i < (int)m; i++) {
int u, v;
scanf("%d%d", &u, &v);
v--;
u--;
g[u].push_back(v);
g[v].push_back(u);
}
cin >> second >> t;
second--;
t--;
mark[t] = 1;
queue<int> q;
for (int i = 0; i < (int)n; i++)
if (mark[i])
q.push(i), d[i] = 0;
else
d[i] = int_inf;
while (!q.empty()) {
int v = q.front();
q.pop();
for (int i = 0; i < (int)g[v].size(); i++) {
int to = g[v][i];
if (d[to] > d[v] + 1) d[to] = d[v] + 1, q.push(to);
}
}
cout << solve();
return 0;
}
| 11 | CPP |
n=int(input())
l=list(map(int,input().split()))
a=min(l.count(1),l.count(2),l.count(3))
print(a)
if(a!=0):
for i in range(a):
x=l.index(1)
y=l.index(2)
z=l.index(3)
l[x]=0
l[y]=0
l[z]=0
print(x+1,y+1,z+1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
if (n <= 1) {
return false;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
long long int n;
cin >> n;
for (long long int i = 2; i <= 1000000000; i++) {
if (isPrime(i) == false && isPrime(i + n) == false) {
cout << i + n << " " << i << endl;
break;
}
}
return 0;
}
| 7 | CPP |
# https://codeforces.com/contest/1433/problem/B
t = int(input())
polcok = []
for i in range(t):
_ = input()
s = input().split()
polcok.append(s)
def kereses2(polc):
count = 0
for i in polc[elso(polc):utolso(polc)]:
if i == "0":
count +=1
return count
def elso(polc):
var = 0
for index, item in enumerate(polc):
if item == "1":
return index
def utolso(polc):
for index, item in enumerate(polc[::-1]):
if item == "1":
return len(polc) - index -1
for polc in polcok:
print(kereses2(polc))
| 8 | PYTHON3 |
# http://codeforces.com/problemset/problem/877/A
def count_in(smstr):
friends = ['Danil', 'Olya', 'Slava', 'Ann', 'Nikita']
countm = 0
for x in friends:
countm += smstr.count(x)
return countm
def main():
inp = input()
f1 = count_in(inp)
if f1 == 1:
return "YES"
return "NO"
if __name__ == "__main__":
print(main())
# input()
| 7 | PYTHON3 |
def qw(n, l, r, reverse, otv, otv1, lis):
if n - l - r ==1:
if not reverse:
print(len(otv1))
index=0
for q in otv1:
print(q, end=' ')
for w in range(q):
print(otv[index], end=' ')
index+=1
print()
return 0
kol=0
for i in range(l):
otv.append(1)
kol+=1
t=[]
for i in range(len(lis)):
t.append((lis[i], i))
t.sort()
if not reverse:
ind=t[-1][1]
else:
ind=t[0][1]
if ind ==0 and l==0 and r==0:
return qw(n, 1, 0, not reverse, otv, otv1, lis[1:])
if ind ==0:
kol +=1
otv.append(len(lis))
l1=lis[1:]
if ind>0:
kol+=2
otv.append(ind)
otv.append(len(lis)-ind)
if ind == len(lis)-1:
l1=lis[:-1]
else:
l1=lis[ind+1:]+lis[:ind]
for i in range(r):
otv.append(1)
kol+=1
otv1.append(kol)
return qw(n, r+1, l, not reverse, otv, otv1, l1)
n = int(input())
l = list(map(int, input().split()))
qw(n, 0, 0, True, [], [], l)
qw(n, 0, 0, False, [], [], l) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
typedef pair< int, int > pii;
// L,U,R,D --- right:+1, left:-1
const int dx[4] = {-1,0,1,0};
const int dy[4] = {0,1,0,-1};
const int dc[2] = {-1,1};
int changeDirection(int f, int c) { return (f + dc[c] + 4) % 4; }
int W, H, pos_id[16][64];
string home_map[16];
int nextPos(int cx, int cy, int d) {
while (home_map[cy + dy[d]][cx + dx[d]] != '#') {
cx += dx[d];
cy += dy[d];
}
return pos_id[cy][cx];
}
/***************** solver ********************/
int trans[1024][4][2];
vector< int > trans_rev[1024][4][2];
int start_id, start_dir, goal_id, goal_dir;
vector< int > wall_dir_at_M, wall_dir_at_K;
void constructTransition() {
memset(trans, -1, sizeof(trans));
for_(i,0,1024) for_(j,0,4) for_(k,0,2) trans_rev[i][j][k] = vector< int >();
wall_dir_at_M = wall_dir_at_K = vector< int >();
int id = 1;
for_(y,0,H) for_(x,0,W) {
if (home_map[y][x] == 'K') pos_id[y][x] = 0;
if (home_map[y][x] == 'M') pos_id[y][x] = 1023;
if (home_map[y][x] == '.') pos_id[y][x] = id++;
}
for_(y,0,H) for_(x,0,W) {
if (home_map[y][x] == 'M' || home_map[y][x] == 'K') {
for_(d,0,4) {
int nx = x + dx[d], ny = y + dy[d];
if (home_map[ny][nx] == '#') {
if (home_map[y][x] == 'M') wall_dir_at_M.push_back(d);
if (home_map[y][x] == 'K') wall_dir_at_K.push_back(d);
continue;
}
if (home_map[y][x] == 'M') {
goal_id = nextPos(nx, ny, d);
goal_dir = d;
} else {
start_id = nextPos(nx, ny, d);
start_dir = d;
}
}
}
}
for_(y,0,H) for_(x,0,W) {
if (home_map[y][x] == '#') continue;
id = pos_id[y][x];
for_(f,0,4) for_(c,0,2) {
int nxt_dir = changeDirection(f, c);
int nxt_id = nextPos(x, y, nxt_dir);
trans[id][f][c] = nxt_id;
trans_rev[nxt_id][nxt_dir][c].push_back(id);
}
}
}
struct State {
int id, dir;
int rev_id, rev_dir;
};
bool visM[1024][4];
bool vis[1024][4][1024][4];
bool canReachMaster() {
memset(visM, 0, sizeof(visM));
queue< pii > que;
que.push(pii(start_id, start_dir));
visM[start_id][start_dir] = true;
while (!que.empty()) {
pii p = que.front(); que.pop();
if (p.first == 1023) return true;
for_(c,0,2) {
int nxt_id = trans[p.first][p.second][c], nxt_dir = changeDirection(p.second, c);
if (!visM[nxt_id][nxt_dir]) {
visM[nxt_id][nxt_dir] = true;
que.push(pii(nxt_id, nxt_dir));
}
}
}
return false;
}
bool canDo() {
memset(vis, 0, sizeof(vis));
queue< State > que;
for (int d : wall_dir_at_K) {
que.push(State{start_id, start_dir, 0, d});
vis[start_id][start_dir][0][d] = true;
}
while (!que.empty()) {
State s = que.front(); que.pop();
if (s.id == 1023 && s.rev_id == goal_id && s.rev_dir == goal_dir) return true;
for_(c,0,2) {
int nxt_id = trans[s.id][s.dir][c], nxt_dir = changeDirection(s.dir, c), nxt_rev_dir = changeDirection(s.rev_dir, c);
for (int nxt_rev_id : trans_rev[s.rev_id][s.rev_dir][1 - c]) {
if (!vis[nxt_id][nxt_dir][nxt_rev_id][nxt_rev_dir]) {
vis[nxt_id][nxt_dir][nxt_rev_id][nxt_rev_dir] = true;
que.push(State{nxt_id, nxt_dir, nxt_rev_id, nxt_rev_dir});
}
}
}
}
return false;
}
void solve() {
constructTransition();
if (canDo()) {
puts("He can accomplish his mission.");
} else {
if (canReachMaster()) puts("He cannot return to the kitchen.");
else puts("He cannot bring tea to his master.");
}
}
int main() {
while (1) {
cin >> W >> H;
if (H == 0) break;
for_(y,0,H) cin >> home_map[y];
solve();
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int ckmax(int &a, int b) { return a < b ? a = b, 1 : 0; }
inline int ckmin(int &a, int b) { return a > b ? a = b, 1 : 0; }
const int delta_x[] = {-1, 0, 0, 1};
const int delta_y[] = {0, -1, 1, 0};
int T, x[4], y[4], xx[4], yy[4], x_low[2], x_high[2], y_low[2], y_high[2], X[2],
Y[2];
void update_range(int &low, int &high, int dx, int x0, int max_t) {
if (dx < 0) {
low = max(low, x0 - max_t);
high = min(high, x0);
} else if (dx == 0) {
low = max(low, x0);
high = min(high, x0);
} else {
low = max(low, x0);
high = min(high, x0 + max_t);
}
}
pair<int, int> solve(int *low, int *high) {
int range_l = max(1, low[1] - high[0]);
int range_h = high[1] - low[0];
return {range_l, range_h};
}
bool check(int max_t) {
for (int d0 = 0; d0 < 4; ++d0)
for (int d1 = 0; d1 < 4; ++d1)
for (int d2 = 0; d2 < 4; ++d2)
for (int d3 = 0; d3 < 4; ++d3) {
int d[4] = {d0, d1, d2, d3};
vector<int> c(4);
iota(c.begin(), c.end(), 0);
do {
x_low[0] = x_low[1] = y_low[0] = y_low[1] = -1e9;
x_high[0] = x_high[1] = y_high[0] = y_high[1] = 1e9;
for (int i = 0; i < 4; ++i) {
int x_id = c[i] >> 1;
int y_id = c[i] & 1;
update_range(x_low[x_id], x_high[x_id], delta_x[d[i]], x[i],
max_t);
update_range(y_low[y_id], y_high[y_id], delta_y[d[i]], y[i],
max_t);
}
bool valid = 1;
valid &= x_low[0] <= x_high[0];
valid &= x_low[1] <= x_high[1];
valid &= y_low[0] <= y_high[0];
valid &= y_low[1] <= y_high[1];
if (!valid) continue;
auto range_x = solve(x_low, x_high);
auto range_y = solve(y_low, y_high);
if (max(range_x.first, range_y.first) <=
min(range_x.second, range_y.second)) {
int l = max(range_x.first, range_y.first);
X[0] = max(x_low[0], x_low[1] - l);
X[1] = X[0] + l;
Y[0] = max(y_low[0], y_low[1] - l);
Y[1] = Y[0] + l;
for (int i = 0; i < 4; ++i) {
int x_id = c[i] >> 1;
int y_id = c[i] & 1;
xx[i] = X[x_id];
yy[i] = Y[y_id];
}
return 1;
}
} while (next_permutation(c.begin(), c.end()));
}
return 0;
}
int main() {
scanf("%d", &T);
while (T--) {
for (int i = 0; i < 4; ++i) scanf("%d%d", x + i, y + i);
int l = -1, r = 1e9;
while (l + 1 < r) {
int m = (l + r) >> 1;
if (check(m))
r = m;
else
l = m;
}
if (check(r)) {
printf("%d\n", r);
for (int i = 0; i < 4; ++i) printf("%d %d\n", xx[i], yy[i]);
} else
puts("-1");
}
return 0;
}
| 10 | CPP |
n=int(input())
s=set()
for i in range(n):
a=input().strip()
if a in s:
s.remove(a)
else:
s.add(a)
print(len(s)) | 0 | PYTHON3 |
k, l, r, t, x, y = map(int, input().split())
if x == y:
if k+x <= r or k-x >= l:
print("Yes")
else:
print("No")
exit(0)
if x > y:
tot = t*(x-y)
if k - tot < l:
print("No")
elif k + y <= r:
print("Yes")
else:
if k - tot - y < l:
print("No")
else:
print("Yes")
exit(0)
# if t <= 1000030:
# cur = k
# for i in range(t):
# if cur + y <= r:
# cur += y
# cur -= x
# if cur < l:
# break
# if cur < l:
# print("No")
# else:
# print("Yes")
# exit(0)
# good = [0 for _ in range(x)]
# for i in range(x):
# smallest = x*(l//x) + i
# if smallest < l:
# smallest += x
# if smallest + y <= r:
# good[i] = 1
cur = k
poss = 1
mark = [0 for _ in range(x)]
moves = 0
while True:
pos = cur%x
if mark[pos] == 1:
break
reach = x*(l//x) + pos
if reach < l:
reach += x
reqd = (cur - reach) // x
moves += reqd
if moves >= t:
break
if reach + y > r:
poss = 0
break
mark[pos] = 1
cur = reach + y
if poss:
print("Yes")
else:
print("No") | 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long x;
const long long mod = 1500;
int main() {
scanf("%lld", &x);
long long y = mod - (x % mod);
printf("%lld\n", mod + 1);
long long a = y + (x + y) / mod;
for (int i = 1; i <= mod - 1; i++) printf("0 ");
printf("%lld %lld\n", -y, a);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("fast-math")
using namespace std;
struct InputReader {
char buf[1048576];
int p;
inline InputReader() { p = 1048576; }
inline void Flush() {
p = 0;
fread(buf, 1, 1048576, stdin);
}
inline char C() {
if (p >= 1048576) Flush();
return buf[p++];
}
inline char Readnum() {
char ch = C();
while (!isdigit(ch) && ch != '-') ch = C();
return ch;
}
inline void Readalpha(char &c) {
c = C();
while (!isalpha(c)) c = C();
}
int operator()() {
int ans = 0, fu = 1;
char ch = Readnum();
if (ch == '-') fu = -1, ch = C();
while (ch >= '0' && ch <= '9') {
ans = ans * 10 + ch - '0';
ch = C();
}
return ans * fu;
}
long long Readll() {
long long ans = 0LL, fu = 1LL;
char ch = Readnum();
if (ch == '-') fu = -1LL, ch = C();
while (ch >= '0' && ch <= '9') {
ans = ans * 10LL + ch - '0';
ch = C();
}
return ans * fu;
}
inline void Readstring(string &x) {
x.clear();
char ch = C();
while (!isdigit(ch) && !isalpha(ch) && ch != '#' && ch != '.') ch = C();
while (isdigit(ch) || isalpha(ch) || ch == '#' || ch == '.') {
x += ch;
ch = C();
}
}
inline void Readchstring(char s[]) {
int len = 0;
char ch = C();
while (!isdigit(ch) && !isalpha(ch)) ch = C();
while (isdigit(ch) || isalpha(ch)) {
s[len++] = ch;
ch = C();
}
s[len] = '\0';
}
inline void Specialread(char &c) {
c = C();
while (!isdigit(c) && !isalpha(c) && c != '#' && c != '.' && c != '=' &&
c != 'B')
c = C();
}
} In;
inline void Read(int &x) { x = In(); }
inline void Read(int &x, int &y) {
x = In();
y = In();
}
inline void Read(int &x1, int &x2, int &x3) {
x1 = In();
x2 = In();
x3 = In();
}
inline void Read(int &x1, int &x2, int &x3, int &x4) {
x1 = In();
x2 = In();
x3 = In();
x4 = In();
}
inline void Read(long long &x) { x = In.Readll(); }
inline void Read(long long &x, long long &y) {
x = In.Readll();
y = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3) {
x1 = In.Readll();
x2 = In.Readll();
x3 = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3, long long &x4) {
x1 = In.Readll();
x2 = In.Readll();
x3 = In.Readll();
x4 = In.Readll();
}
template <typename T>
void Read(T a[], int st, int ed) {
for (int(i) = (st); (i) <= (ed); ++(i)) Read(a[i]);
}
inline void FILEIO() {}
inline void FILEIO(string pname) {
freopen((pname + ".in").c_str(), "r", stdin);
freopen((pname + ".out").c_str(), "w", stdout);
}
inline void FILEIO_OICONTEST(string pname) {
freopen((pname + ".in").c_str(), "r", stdin);
freopen((pname + ".out").c_str(), "w", stdout);
}
void Printtime() {}
void END() {
Printtime();
exit(0);
}
template <typename T>
void END(T mes) {
cout << mes << endl;
END();
}
template <typename T>
void Print(T a[], int s, int t, char sp = ' ', char ed = '\n') {
if (s > t) return;
for (int i = s; i < t; i++) cout << a[i] << sp;
cout << a[t] << ed;
cout.flush();
}
template <typename T>
void Print(T a, int s = 0, int t = -1, char sp = ' ', char ed = '\n') {
if (t == -1) t = a.size() - 1;
for (int i = s; i <= t; i++) cout << a[i] << sp;
cout << ed;
cout.flush();
}
vector<int> Range(int l, int r) {
vector<int> ret{};
for (int(i) = (l); (i) <= (r); ++(i)) ret.push_back(i);
return ret;
}
mt19937 Rand(0xe38195e38293);
constexpr long double Eps = 1e-7;
constexpr long double PI = 3.14159265358979323846264338327950288419716939937510;
const int MAXN = 10010;
const int LOG = 16;
struct Point {
long double x, y;
inline long double Len() const { return sqrt(((x) * (x)) + ((y) * (y))); }
};
inline Point operator+(const Point &a, const Point &b) {
return {a.x + b.x, a.y + b.y};
}
inline Point operator-(const Point &a, const Point &b) {
return {a.x - b.x, a.y - b.y};
}
inline long double operator^(const Point &a, const Point &b) {
return a.x * b.x + a.y * b.y;
}
inline long double operator*(const Point &a, const Point &b) {
return a.x * b.y - a.y * b.x;
}
inline Point operator*(const Point &a, const long double &b) {
return {a.x * b, a.y * b};
}
inline Point operator/(const Point &a, const long double &b) {
return {a.x / b, a.y / b};
}
inline long double Dis(const Point &a, const Point &b) {
return sqrt(((a.x - b.x) * (a.x - b.x)) + ((a.y - b.y) * (a.y - b.y)));
}
inline long double Dis2(const Point &a, const Point &b) {
return ((a.x - b.x) * (a.x - b.x)) + ((a.y - b.y) * (a.y - b.y));
}
ostream &operator<<(ostream &out, const Point &p) {
out << p.x << " " << p.y << " ";
return out;
}
inline bool TurnLeft(const Point &a, const Point &b, const Point &c) {
return (b - a) * (c - b) > Eps;
}
inline bool TurnRight(const Point &a, const Point &b, const Point &c) {
return (b - a) * (c - b) < -Eps;
}
inline bool OnLine(const Point &p, const Point &a1, const Point &a2) {
return (fabs(((p - a1) * (a2 - p)) - (0)) <= Eps) and
((p - a1) ^ (a2 - p)) > -Eps;
}
inline bool Intersect(const Point &a, const Point &b, const Point &c,
const Point &d) {
if (OnLine(a, c, d) or OnLine(b, c, d)) return 1;
return (TurnRight(c, a, d) ^ TurnRight(c, b, d)) and
(TurnRight(a, c, b) ^ TurnRight(a, d, b));
}
inline Point InsPoint(const Point &p1, const Point &p2, const Point &p3,
const Point &p4) {
const long double dis = Dis(p1, p2);
long double d1 = fabs((p2 - p3) * (p3 - p1)) / dis;
long double d2 = fabs((p2 - p4) * (p4 - p1)) / dis;
long double ratio = d1 / (d1 + d2);
return (p4 - p3) * ratio + p3;
}
int n, q;
Point a[MAXN], o;
long double a_area;
long double cross_psum[MAXN];
inline int Next(const int &x) { return x == n ? 1 : x + 1; }
long double PolyArea(Point a[], int n) {
long double ans = 0;
for (int(i) = (2); (i) <= (n - 1); ++(i))
ans += (a[i] - a[1]) * (a[i + 1] - a[1]);
return fabs(ans) / 2;
}
int Crossed(const Point &d) {
if (Intersect(a[1], a[n], o, d)) return n;
const long double odlen = (d - o).Len();
const Point od_div_odlen = (d - o) / odlen;
auto GetPolarAngle = [=](const Point &p) {
const Point od = d - o, op = p - o;
long double h = fabs(od_div_odlen * op);
long double theta = h / op.Len();
if ((od ^ op) > 0) {
if (od * op > 0)
return theta;
else
return PI + PI - theta;
} else {
if (od * op > 0)
return PI - theta;
else
return theta + PI;
}
};
long double init_polar_angle = GetPolarAngle(a[1]);
int ans = 1;
for (int(i) = (LOG)-1; (i) >= 0; --(i)) {
int v = ans + (1 << i);
if (v >= n) continue;
if (GetPolarAngle(a[v]) > init_polar_angle) ans = v;
}
if (ans != 1 and Intersect(a[ans - 1], a[ans], o, d)) --ans;
return ans;
}
long double first(long double alpha) {
const long double sinres = sin(alpha), cosres = cos(alpha);
const long double MULT = 1e9;
Point d = o + Point{cosres * MULT, sinres * MULT};
Point nd = o - Point{cosres * MULT, sinres * MULT};
int ans_mult = 1;
if (TurnLeft(nd, a[1], d)) {
swap(d, nd);
ans_mult = -1;
}
int l = Crossed(nd);
int r = Crossed(d);
Point lins = InsPoint(a[l], a[Next(l)], o, nd);
Point rins = InsPoint(a[r], a[Next(r)], o, d);
r = Next(r);
long double area1 = cross_psum[l] +
(r == 1 ? 0 : cross_psum[n] - cross_psum[r]) +
fabs((a[l] - a[1]) * (a[r] - a[1])) / 2;
area1 += fabs((rins - lins) * (a[l] - lins)) / 2;
area1 += fabs((a[r] - a[l]) * (rins - a[l])) / 2;
long double area2 = a_area - area1;
return (area1 - area2) * ans_mult;
}
long double Solve() {
const long double allow_abs_delta = (5e-5) * a_area;
long double l = 0, r = PI, l_fres = first(l), r_fres = first(r);
long double ans = -1, min_abs_delta = ((long long)(0x3f3f3f3f3f3f3f3f));
if (fabs(l_fres) < allow_abs_delta) return l;
if (fabs(r_fres) < allow_abs_delta) return r;
for (int(_t) = 1; (_t) <= (50); ++(_t)) {
long double mid = (l + r) / 2;
long double mid_fres = first(mid);
if (fabs(mid_fres) < min_abs_delta) {
min_abs_delta = fabs(mid_fres);
ans = mid;
}
if (min_abs_delta <= allow_abs_delta) break;
if ((mid_fres > 0) == (l_fres > 0))
l = mid + Eps;
else
r = mid - Eps;
}
return ans;
}
int main() {
FILEIO();
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int(i) = 1; (i) <= (n); ++(i)) cin >> a[i].x >> a[i].y;
reverse(a + 1, a + 1 + n);
a_area = PolyArea(a, n);
for (int(i) = (3); (i) <= (n); ++(i)) {
cross_psum[i] =
cross_psum[i - 1] + fabs((a[i] - a[1]) * (a[i - 1] - a[1])) / 2;
}
for (int(qi) = 1; (qi) <= (q); ++(qi)) {
cin >> o.x >> o.y;
long double ans = Solve();
cout << setprecision(16) << fixed << ans << endl;
}
END();
}
| 13 | CPP |
from sys import stdin, stdout
from collections import defaultdict
t = int(stdin.readline())
while t>0:
n = int(stdin.readline())
a = list(map(int,stdin.readline().split()))
low, high = 1,n
ans = 1
while low<=high:
mid = (low+high)//2
valid = False
d = defaultdict(int)
for i in range(mid):
d[a[i]]+=1
if d[a[i]]==2:
valid=True
for i in range(mid,n+1):
d[a[i-mid]]-=1
if d[a[i-mid]]==0:
del d[a[i-mid]]
if i<len(a):
d[a[i]]+=1
if d[a[i]]==2:
valid=True
break
if valid:
ans = mid
high = mid-1
else:
low = mid+1
if ans==1:
ans = -1
stdout.write("{}\n".format(ans))
t-=1 | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 100001, logmax = 35;
int n, f[logmax][nmax], r[logmax][nmax];
long long s[logmax][nmax], k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> f[0][i];
for (int i = 0; i < n; i++) cin >> r[0][i], s[0][i] = r[0][i];
for (int i = 1; i < logmax; i++)
for (int j = 0; j < n; j++) {
f[i][j] = f[i - 1][f[i - 1][j]];
r[i][j] = min(r[i - 1][j], r[i - 1][f[i - 1][j]]);
s[i][j] = s[i - 1][j] + s[i - 1][f[i - 1][j]];
}
for (int ii = 0; ii < n; ii++) {
long long L = 0;
int R = 1000000000;
int x = ii;
for (int i = 0; i < logmax; i++)
if ((k >> i) & 1) {
L += s[i][x];
R = min(R, r[i][x]);
x = f[i][x];
}
cout << L << " " << R << endl;
}
}
| 11 | CPP |
a = input().split('+')
b = a.count('1')
c = a.count('2')
d = a.count('3')
t = ''
t = t+b*'1+'
t = t+c*'2+'
t = t+d*'3+'
print(t[:len(t)-1])
| 7 | PYTHON3 |
""" http://codeforces.com/problemset/problem/281/A """
s = input()
s = s[0].upper() + s[1:]
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 100000;
const int mod = 1e9 + 9;
int f[N];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
int main() {
int n, m, u, v;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) f[i] = i;
int now = 0;
for (int i = 0; i < m; i++) {
scanf("%d%d", &u, &v);
u--;
v--;
if (find(u) != find(v)) {
f[find(u)] = find(v);
} else {
now = (now * 2 + 1) % mod;
}
printf("%d\n", now);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, x, y, p;
void solve() {
int sum = 0, sum1 = 0, sum2 = 0, t;
for (int i = 1; i <= k; i++) {
scanf("%d", &t);
if (t >= y)
sum2++;
else
sum1++;
sum += t;
}
if (sum1 >= (n + 1) / 2) {
printf("-1");
return;
}
if (sum2 <= (n + 1) / 2) sum += ((n + 1) / 2 - sum2) * y;
sum += (min(n / 2, n - sum2) - sum1);
if (sum > x) {
printf("-1");
return;
}
for (int i = 1; i <= (n + 1) / 2 - sum2; i++) printf("%d ", y);
for (int i = 1; i <= min(n / 2, n - sum2) - sum1; i++)
printf(i == 1 ? "%d" : " %d", 1);
return;
}
int main() {
scanf("%d%d%d%d%d", &n, &k, &p, &x, &y);
solve();
return 0;
}
| 8 | CPP |
n=int(input())
s=set()
i=1
while(i<100000):
x=(i*(i+1))//2
s.add(x)
i=i+1
for i in s:
if(n-i in s):
print("YES")
exit()
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
//#define FILE_IO
int N, Q, ans;
int i, j, q, msk;
int cnt[3];
int val[1100005], dp[1100005], dp2[1100005];
int bts[1100005];
int B, b[25];
char s[1100005];
void bck0(int pas, int msk, int smn)
{
if(pas >= B)
{
ans += smn * dp[msk];
return;
}
bck0(pas + 1, msk, smn);
bck0(pas + 1, msk ^ (1 << b[pas]), -smn);
}
void bck1(int pas, int msk, int smn)
{
if(pas >= B)
{
ans += smn * dp2[msk];
return;
}
bck1(pas + 1, msk, smn);
bck1(pas + 1, msk ^ (1 << b[pas]), -smn);
}
void bckq(int pas, int msk)
{
if(pas >= B)
{
ans += val[msk];
return;
}
bckq(pas + 1, msk);
bckq(pas + 1, msk ^ (1 << b[pas]));
}
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d%d\n", &N, &Q);
scanf("%s\n", s);
for(i = 0; i < (1 << N); i++)
val[i] = dp[i] = dp2[i] = s[i] - '0';
for(j = 0; j < N; j++)
for(i = (1 << N) - 1; i >= 0; i--)
if( (i & (1 << j)) == 0 )
dp[i] += dp[i ^ (1 << j)];
for(j = 0; j < N; j++)
for(i = 0; i < (1 << N); i++)
if( (i & (1 << j)) != 0 )
dp2[i] += dp2[i ^ (1 << j)];
for(q = 1; q <= Q; q++)
{
scanf("%s\n", s);
reverse(s, s + N);
cnt[0] = cnt[1] = cnt[2] = 0;
for(j = 0; j < N; j++)
{
if(s[j] == '0') cnt[0]++;
else if(s[j] == '1') cnt[1]++;
else if(s[j] == '?') cnt[2]++;
}
if(cnt[0] < cnt[1] && cnt[0] < cnt[2])
{
msk = 0;
B = 0;
for(i = 0; i < N; i++)
{
if(s[i] == '1') msk |= (1 << i);
if(s[i] == '0') b[B++] = i;
}
ans = 0;
bck0(0, msk, 1);
printf("%d\n", ans);
}
else if(cnt[1] < cnt[2])
{
msk = 0;
B = 0;
for(i = 0; i < N; i++)
{
if(s[i] == '1')
{
msk |= (1 << i);
b[B++] = i;
}
if(s[i] == '?')
msk |= (1 << i);
}
ans = 0;
bck1(0, msk, 1);
printf("%d\n", ans);
}
else
{
msk = 0;
B = 0;
for(i = 0; i < N; i++)
{
if(s[i] == '?') b[B++] = i;
else msk |= ((s[i] - '0') << i);
}
ans = 0;
bckq(0, msk);
printf("%d\n", ans);
}
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
memset(arr, 0, sizeof(arr));
for (int i = 1; i < n + 1; i += 1) cin >> arr[i];
int s, f;
cin >> s >> f;
ll sum = 0;
ll t = 0;
int start = s, finish = f;
for (int i = 1; i <= n; i++) arr[i] += arr[i - 1];
for (int time = 1; time <= n; time++) {
ll q = 0;
if (s < f) {
q = arr[f - 1] - arr[s - 1];
} else {
q = arr[n] - arr[s - 1] + arr[f - 1];
}
if (q > sum) {
sum = q;
t = time;
}
s--;
f--;
if (s == 0) s = n;
if (f == 0) f = n;
}
cout << t << endl;
return 0;
}
| 9 | CPP |
# http://codeforces.com/problemset/problem/791/A
from typing import List
def solve(a: int, b: int) -> int:
# 1 <= a <= b <= 10
for i in range(100):
if a > b:
return i
a *= 3
b *= 2
assert False
def compare(user_answer: int, jury_answer: int) -> bool:
return user_answer == jury_answer
print(solve(*map(int, input().split()))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using lld = long double;
using ulli = unsigned long long int;
using pll = pair<lli, lli>;
using ttt = pair<lli, pll>;
using vttt = vector<ttt>;
using vll = vector<pll>;
using vl = vector<lli>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using cd = complex<lld>;
const double PI = acos(-1);
vector<int> z_function(string s) {
int n = (int)s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r) z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
}
return z;
}
vector<int> string_match(string s, string pat) {
auto cur = z_function(pat + "#" + s);
cur.erase(cur.begin(), cur.begin() + ((lli)(pat).size()) + 1);
return cur;
}
lli tre1[500010], tre2[500010];
lli get1(int x) {
lli res = 0;
for (x += 1; x > 0; x -= (x & (-x))) res += tre1[x];
return res;
}
void add1(int x, lli val) {
for (x += 1; x < 500010; x += (x & (-x))) tre1[x] += val;
}
lli get2(int x) {
lli res = 0;
for (x += 1; x > 0; x -= (x & (-x))) res += tre2[x];
return res;
}
void add2(int x, lli val) {
for (x += 1; x < 500010; x += (x & (-x))) tre2[x] += val;
}
void add1(int l, int r, lli val) {
add1(l, val);
add1(r + 1, -val);
}
lli get1(int l, int r) { return (l > r) ? 0 : get1(r) - get1(l - 1); }
void upd(lli x, lli val) {
add1(x, val);
add2(x, (x - 1) * val);
}
void upd(lli l, lli r, lli val) {
add1(l, val);
add1(r + 1, -val);
add2(l, (l - 1) * val);
}
lli query(lli x) { return x * get1(x) - get2(x); }
lli query(int l, int r) { return query(r) - query(l - 1); }
int tejas_919(int kkkk) {
lli n, m, k, q, u, v, temp = 0, ans = 0;
cin >> n >> m;
string a, b, s;
cin >> a >> b >> s;
auto pref = string_match(a, s);
reverse(b.begin(), b.end());
reverse(s.begin(), s.end());
auto suff = string_match(b, s);
reverse(suff.begin(), suff.end());
for (auto& x : suff) x = min((lli)x, m - 1);
for (auto& x : pref) x = min((lli)x, m - 1);
for (int i = n - 1; i >= 0; i--) {
upd(m - suff[i], 1);
if (i + m - 1 < n) upd(m - suff[i + m - 1], -1);
ans += query(pref[i]);
}
cout << ans << '\n';
return 0;
}
signed main() {
if (!0) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
cout << fixed << setprecision(10);
int t = 1;
for (int i = 0; i < t; i++) {
tejas_919(i + 1);
}
{};
if (0) system("pause");
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, c0, c1, h;
cin >> n >> c0 >> c1 >> h;
char s[1000];
cin >> s;
int count0 = 0, count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
count0++;
} else {
count1++;
}
}
if (c0 == c1) {
cout << n * c0 << endl;
} else {
if (c0 > c1) {
if (h + c1 <= c0) {
cout << (c1 * count1) + ((h + c1) * count0) << endl;
} else {
cout << c1 * count1 + c0 * count0 << endl;
}
} else {
if (h + c0 <= c1) {
cout << (c0 * count0) + ((h + c0) * count1) << endl;
} else {
cout << c1 * count1 + c0 * count0 << endl;
}
}
}
}
return 0;
}
| 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.