solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<sstream>
#include<iostream>
using namespace std;
int ans[15][1<<11];
int n,s;
int dfs(int sum,int B,int depth){
ans[depth][sum]++;
int bit_cnt = 0;
int num = 0;
for(int i = 0;i < 10;i++){
if(B&(1<<i))continue;
num += dfs(sum + (depth+1)*i,B+(1<<i),depth+1);
}
return num;
}
int main(){
dfs(0,0,0);
while(cin>>n>>s){
cout<<ans[n][s]<<endl;
}
return 0;
} | 0 | CPP |
t=int(input())
for i in range(t):
n=int(input())
a=sorted(list(map(int,input().split())))
c=[]
for j in range(len(a)-1):
d=a[j+1]-a[j]
c.append(d)
print(min(c))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
long long maxx, maxy;
void judge(long long x, long long y) {
if (x * y > maxx * maxy) {
maxx = x;
maxy = y;
return;
}
if ((x * y == maxx * maxy) && (x > maxx)) {
maxx = x;
maxy = y;
return;
}
}
int main() {
long long s;
long long i;
long long x, y;
long long left, right;
long long m, n;
double f;
maxx = maxy = 1;
scanf("%I64d %I64d", &m, &n);
s = 1;
while (s <= m) {
f = 0.8 * s;
left = f;
if (f != left) left++;
right = 1.25 * s;
if (left > n) break;
if (right <= n) {
x = s;
y = right;
judge(x, y);
} else {
x = s;
y = n;
judge(x, y);
}
s *= 2;
}
s = 1;
while (s <= n) {
f = 0.8 * s;
left = f;
if (f != left) left++;
right = 1.25 * s;
if (left > m) break;
if (right <= m) {
x = right;
y = s;
judge(x, y);
} else {
x = m;
y = s;
judge(x, y);
}
s *= 2;
}
printf("%I64d %I64d\n", maxx, maxy);
return 0;
}
| 8 | CPP |
#include <iostream>
using namespace std;
int main() {
int n, k, x, y;
cin >> n >> k >> x >> y;
cout << (n < k ? n * x : k * x + (n - k) * y) << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int k;
string x;
cin >> k >> x;
sort(x.begin(), x.end());
int sum = 0;
for (int i = 0; i < x.length(); i++) sum += (x[i] - '0');
int ans = 0;
for (int i = 0; i < x.length(); i++) {
if (sum >= k) break;
sum -= (x[i] - '0');
sum += 9;
ans++;
}
printf("%d\n", ans);
return 0;
}
| 8 | CPP |
s = input()
l = {"H","Q","9"}
flag = 0
for i in s:
if i in l:
print("YES")
flag = 1
break
if flag == 0:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mx2 = 505;
const int mx3 = 1005;
const int mx5 = 300005;
const int mx6 = 800005;
int _toggle(int N, int pos) { return N = N ^ (1 << pos); }
int _set(int N, int pos) { return N = N | (1 << pos); }
int _reset(int N, int pos) { return N = N & ~(1 << pos); }
bool _check(int N, int pos) { return (bool)(N & (1 << pos)); }
bool _upper(char a) { return a >= 'A' && a <= 'Z'; }
bool _lower(char a) { return a >= 'a' && a <= 'z'; }
bool _digit(char a) { return a >= '0' && a <= '9'; }
int dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a;
long long w = 0, b = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
int x = a / 2, y = (a + 1) / 2;
if (i & 1) {
w += y, b += x;
} else {
w += x, b += y;
}
}
cout << min(w, b) << '\n';
}
| 8 | CPP |
######### utils
def read_ints():
return [int(i) for i in input().strip().split()]
def solve():
#solves one test case
pass
def main():
t = int(input())
for i in range(t):
seen = [-1,-1,-1]
best = 200001
s = input()
for idx , i in enumerate(s):
# print(idx, i , seen)
num = int(i)
seen[num-1] = idx
if min(seen) > -1:
best = min(best, max(seen) - min(seen) + 1 )
if best == 200001:
print(0)
else:
print(best)
if __name__ == '__main__':
main()
| 8 | PYTHON3 |
import math
def getBelong(id: int, pos: int) -> int:
global n, m, Lcm
pos -= 1
if id == 1:
return pos * m // Lcm
return pos * n // Lcm
n, m, q = map(int, input().split())
Gcd = math.gcd(n, m)
Lcm = n // Gcd * m
while q:
q -= 1
a, b, c, d = map(int, input().split())
print('YES' if getBelong(a, b) == getBelong(c, d) else 'NO')
| 9 | PYTHON3 |
def solve():
n = int(input())
coins = input().split(" ")
coins = [int(i) for i in coins]
coins.sort()
leftOvers = sum(coins)
coinsTaken = 0
myCoins = 0
for i in range(len(coins) - 1, -1, -1):
if myCoins <= leftOvers:
myCoins += coins[i]
leftOvers -= coins[i]
coinsTaken += 1
else:
break
return coinsTaken
def main():
print(solve())
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#include<cstdio>
typedef long long LL;
const int N=1e5+8;
int A[N],op[N],n,nxt[N],nx;
LL ans,now,suf[N];char s[4];
int main(){
scanf("%d%d",&n,A+1),ans=A[1];
for(int i=2;i<=n;++i)scanf("%s%d",s,A+i),ans+=A[i]*((op[i]=*s=='-')?-1:1);
for(int i=n;i;--i){
suf[i]=suf[i+1]+A[i];
if(op[i])nxt[i]=nx,nx=i;
}
now=A[1];
for(int i=2;i<=n;++i){
if(op[i]&&nxt[i]){
LL nw=now-suf[i]+2*suf[nxt[i]];
if(nw>ans)ans=nw;
}
now+=A[i]*(op[i]?-1:1);
}
printf("%lld\n",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
class Solution {
int n;
vector<int> k;
vector<set<int>> s;
vector<vector<int>> dp, need;
bool in(int v, set<int> s) { return s.find(v) != s.end(); }
void dfs(int p, int i) {
if (dp[p][i] != -1) return;
dp[p][i] = 0;
int vp = 3 - p;
for (int v : s[vp]) {
int ni = (i - v + n) % n;
if (ni != 0 && dp[vp][ni] != 1) {
dp[vp][ni] = 1;
for (int u : s[p]) {
int y = (ni - u + n) % n;
need[p][y]--;
if (need[p][y] == 0) dfs(p, y);
}
}
}
}
public:
void sol() {
cin >> n;
k = vector<int>(3);
s = vector<set<int>>(3);
cin >> k[1];
for (int i = 0; i < k[1]; i++) {
int v;
cin >> v;
s[1].insert(v);
}
cin >> k[2];
for (int i = 0; i < k[2]; i++) {
int v;
cin >> v;
s[2].insert(v);
}
dp = vector<vector<int>>(3, vector<int>(n, -1));
need = vector<vector<int>>(3);
need[1] = vector<int>(n, k[1]);
need[2] = vector<int>(n, k[2]);
dfs(1, 0);
dfs(2, 0);
for (int p = 1; p <= 2; p++) {
for (int i = 1; i <= n - 1; i++) {
switch (dp[p][i]) {
case 1: {
cout << "Win ";
break;
}
case 0: {
cout << "Lose ";
break;
}
case -1: {
cout << "Loop ";
break;
}
}
}
cout << endl;
}
}
};
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
Solution s;
s.sol();
return 0;
}
| 7 | CPP |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S = readline().rstrip().decode('utf-8')
def solve_partial(S):
INF = 10**18
"""
・Sは1から始まり、1で終わる
・Sは00を含まない
・したがって、Sは1,01に分解可能
・残る最小個数を調べるdp。これは、1, 101111,111101 の3種を数えることと同じ
・a, b0cccc, dddd0e として、「現在の1がどれであるか -> 最小個数」でdp
・個数はa,b,eのときに数える
"""
S = S.replace('01','2')
a,b,c,d,e = 1,1,INF,0,INF
for x in S[1:]:
if x == '1':
a2 = min(a,c,e)+1
c2 = c
d2 = min(a,c,d,e)
e2 = INF
else:
a2 = min(a,c,e)+1
c2 = a
d2 = min(a,c,e)
e2 = d+1
a,c,d,e = a2,c2,d2,e2
return len(S)-min(a,c,e)
answer = 0
for x in S.split('00'):
x = x.strip('0')
if x:
answer += solve_partial(x)
print(answer) | 0 | PYTHON3 |
n,k=map(int,input().split())
a=list(map(int,input().split()))
count=0
for i in range(n):
if a[i]>=a[k-1] and a[i]>0:
count=count+1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400005;
const int MAXM = 2000005;
struct Ed {
int u, v, c, t, id;
bool operator<(const Ed &p) const { return t < p.t; }
} ed[MAXN];
struct Edge {
int to;
int nxt;
} edge[MAXM];
int n, m, cc, scc, id, idf;
int first[MAXN];
int dfn[MAXN];
int low[MAXN];
int bel[MAXN];
int de[MAXN];
int mark[MAXN];
bool vis[MAXN];
queue<int> Q;
stack<int> S;
vector<int> ans;
vector<int> e[MAXN];
vector<int> sc[MAXN];
map<int, int> deg[MAXN];
void addE(int u, int v) {
edge[++id] = (Edge){v, first[u]};
first[u] = id;
}
void add(int u, bool U, int v, bool V) {
addE(u << 1 | U, v << 1 | V);
addE(v << 1 | !V, u << 1 | !U);
}
void dfs(int u) {
dfn[u] = low[u] = ++idf;
vis[u] = 1;
S.push(u);
for (int i = first[u]; i; i = edge[i].nxt) {
if (!dfn[edge[i].to]) {
dfs(edge[i].to);
low[u] = min(low[u], low[edge[i].to]);
} else if (vis[edge[i].to])
low[u] = min(low[u], dfn[edge[i].to]);
}
if (low[u] == dfn[u]) {
scc++;
while (S.top() != u) {
bel[S.top()] = scc;
vis[S.top()] = 0;
S.pop();
}
bel[u] = scc;
vis[u] = 0;
S.pop();
}
}
bool two_sat() {
memset(dfn, 0, sizeof(dfn));
idf = scc = 0;
for (int i = 2; i <= (cc << 1 | 1); i++)
if (!dfn[i]) dfs(i);
for (int i = 1; i <= cc; i++)
if (bel[i << 1] == bel[i << 1 | 1]) return 0;
return 1;
}
void buildgraph() {
for (int i = 1; i <= n; i++) deg[i].clear();
for (int i = 1; i <= m; i++) {
e[ed[i].u].push_back(i);
e[ed[i].v].push_back(i);
int &u = deg[ed[i].u][ed[i].c];
if (!u)
u = i;
else
add(u, 0, i, 1);
int &v = deg[ed[i].v][ed[i].c];
if (!v)
v = i;
else
add(v, 0, i, 1);
}
cc = m;
for (int i = 1; i <= n; i++) {
if (!e[i].size()) continue;
int p = e[i][0];
for (int j = 1; j < e[i].size(); j++) {
int u = e[i][j], v = ++cc;
add(p, 1, v, 1);
add(u, 1, v, 1);
add(p, 1, u, 0);
p = v;
}
}
}
bool check(int v) {
int tmp = id;
for (int i = m; i >= 1 && ed[i].t > v; i--) addE(i << 1 | 1, i << 1);
bool res = two_sat();
id = tmp;
for (int i = m; i >= 1 && ed[i].t > v; i--)
first[i << 1 | 1] = edge[first[i << 1 | 1]].nxt;
return res;
}
void construct(int v) {
for (int i = m; i >= 1 && ed[i].t > v; i--) addE(i << 1 | 1, i << 1);
two_sat();
for (int i = 1; i <= (cc << 1 | 1); i++) sc[bel[i]].push_back(i);
for (int i = 1; i <= scc; i++) e[i].clear();
for (int i = 1; i <= (cc << 1 | 1); i++)
for (int j = first[i]; j; j = edge[j].nxt)
if (bel[i] != bel[edge[j].to]) {
e[bel[edge[j].to]].push_back(bel[i]);
de[bel[i]]++;
}
memset(mark, -1, sizeof(mark));
for (int i = 1; i <= scc; i++)
if (!de[i]) Q.push(i);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
if (mark[u] == -1) mark[u] = 1;
for (int i = 0; i < sc[u].size(); i++)
mark[bel[sc[u][i] ^ 1]] = mark[u] ^ 1;
for (int i = 0; i < e[u].size(); i++)
if (!--de[e[u][i]]) Q.push(e[u][i]);
}
for (int i = 1; i <= m; i++)
if (mark[bel[i << 1 | 1]]) ans.push_back(i);
printf("%d\n", (int)ans.size());
for (int i = 0; i < ans.size(); i++) printf("%d ", ed[ans[i]].id);
printf("\n");
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d%d%d", &ed[i].u, &ed[i].v, &ed[i].c, &ed[i].t);
ed[i].id = i;
if (++deg[ed[i].u][ed[i].c] > 2 || ++deg[ed[i].v][ed[i].c] > 2) {
puts("No");
return 0;
}
}
sort(ed + 1, ed + m + 1);
buildgraph();
if (!check(1000000000)) {
puts("No");
return 0;
}
puts("Yes");
int low = 0, high = 1000000000;
while (low < high) {
int mid = low + high >> 1;
if (check(mid))
high = mid;
else
low = mid + 1;
}
printf("%d ", low);
construct(low);
return 0;
}
| 10 | CPP |
a=int(input())
b=int(input())
mini=1000000
for i in range(min(a,b),max(a,b)+1):
mini=min(mini,(((i-min(a,b))*(i-min(a,b)+1))//2)+((max(a,b)-i)*(max(a,b)-i+1))//2)
print(mini) | 7 | PYTHON3 |
read = lambda: map(int, input().split())
n = int(input())
N = 1001
b = [0] * 3000
c = [0] * 3000
for i in range(n):
x, y = read()
b[x - y + N] += 1
c[y + x] += 1
f = lambda x: x * (x - 1) // 2
ans = sum(f(i) for i in b) + sum(f(i) for i in c)
print(ans)
| 8 | PYTHON3 |
N = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
if sum(A) < sum(B) :
print(-1)
exit()
les = 0
ans = 0
Over = []
for i in range(N) :
Over.append(A[i]-B[i])
if A[i] < B[i] :
les += B[i] - A[i]
ans += 1
Over.sort(reverse = True)
for ov in Over :
if les <= 0 :
print(ans)
break
les -= ov
ans += 1
| 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a;
cin>>a;
long long b = sqrt(a);
cout<<b*b;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
const int N = 200 + 5;
int n, k;
int id[N];
std::queue<int> q;
std::map<int, bool> map;
void print() {
if (q.empty()) return;
int t = q.front();
q.pop();
print();
printf("%d ", t);
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &id[i]);
for (int i = 1; i <= n; i++) {
if (map[id[i]]) continue;
if (q.size() == k) {
map[q.front()] = 0;
q.pop();
}
q.push(id[i]);
map[id[i]] = 1;
}
printf("%d\n", q.size());
print();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = int64_t;
using pii = pair<int, int>;
using ull = uint64_t;
ll a[100100];
ll X[100100], Y[100100];
ll gcd(ll a, ll b, ll& x, ll& y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
if (n == 1) {
cout << "1 1" << endl;
cout << -a[0] << endl;
cout << "1 1" << endl;
cout << 0 << endl;
cout << "1 1" << endl;
cout << 0 << endl;
return 0;
}
for (int i = 1; i < n; ++i) {
gcd(n, n - 1, X[i], Y[i]);
X[i] *= -a[i];
Y[i] *= -a[i];
}
cout << 1 << " " << n << endl;
cout << 0;
for (int i = 1; i < n; ++i) cout << ' ' << X[i] * n;
cout << endl;
cout << "1 1" << endl;
cout << -a[0] << endl;
cout << 2 << " " << n << endl;
for (int i = 1; i < n; ++i) {
if (i > 1) cout << ' ';
cout << Y[i] * (n - 1);
}
cout << endl;
}
| 7 | CPP |
n = int(input())
s1 = input()
s2 = input()
qtd = 0
for n1, n2 in zip(s1,s2):
n1 = int(n1)
n2 = int(n2)
qtd += min(abs(n1-n2), 10 - abs(n1-n2))
print(qtd)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<string> v;
for (int i = 0; i < n - 2; i++) {
string str;
cin >> str;
v.push_back(str);
}
string ans = v[0];
for (int i = 1; i < n - 2; i++) {
string s1 = v[i];
int sizeofans = ans.size();
if (s1[0] == ans[sizeofans - 1]) {
ans += s1[1];
} else {
ans += s1;
}
}
int k = n - ans.size();
while (k--) {
ans += 'a';
}
std::cout << ans << std::endl;
}
return 0;
}
| 8 | CPP |
#include <iostream>
using namespace std;
int N,M;
int a[2005], b[2005];
long long int c[2005];
long long int dis[1005];
int main(void) {
cin >> N>>M;
int tmp1; long long int tmp2;
for (int i = 1; i <= M; i++) {
cin >> tmp1; a[i] = tmp1;
cin >> tmp1; b[i] = tmp1;
cin >> tmp2; c[i] = tmp2;
}
for (int i = 1; i <= N; i++) {
dis[i] = -10000000000002;
}
dis[1] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (dis[b[j]] < dis[a[j]] + c[j]) { dis[b[j]] = dis[a[j]] + c[j]; }
}
}
long long int save = dis[N];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (dis[b[j]] < dis[a[j]] + c[j]) { dis[b[j]] = dis[a[j]] + c[j]; }
}
}
if (save!=dis[N]) { cout << "inf" << endl; }
else { cout << dis[N] << endl; }
//system("pause");
return 0;
} | 0 | CPP |
from sys import stdin
for j in range(int(stdin.readline())):
a = input()
s = 0
for x in a:
s += int(x)
if s == 0 or s == len(a):
print(a)
else:
for i in range(2*len(a)):
if i%2 == 0:
print(1,end = "")
else:
print(0, end = "")
print("")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 326, INF = 1e6;
int N, take[maxN], frq[maxN];
string t, s[maxN];
struct Flow {
int cap[maxN][maxN], cost[maxN][maxN];
int from[maxN], minD[maxN];
bool visited[maxN];
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
pq;
Flow() {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
cap[i][j] = 0;
}
}
inline void addEdge(int u, int v, int c, int f) {
cap[u][v] = f;
cap[v][u] = 0;
cost[u][v] = c;
cost[v][u] = -c;
}
inline bool SP(int s, int t) {
pq = priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>();
fill(minD, minD + maxN, INF);
fill(from, from + maxN, -1);
fill(visited, visited + maxN, false);
minD[s] = 0;
pq.push({0, s});
while (pq.size()) {
auto [d, u] = pq.top();
visited[u] = true;
pq.pop();
for (int i = 1; i < maxN; i++) {
if (!visited[i] && cap[u][i] > 0 && cost[u][i] + d < minD[i]) {
minD[i] = cost[u][i] + d;
pq.push({minD[i], i});
from[i] = u;
}
}
}
return from[t] != -1;
}
inline pair<int, int> upd(int s, int t) {
int c = t, minF = INF, len = 0;
while (c != s) {
len += cost[from[c]][c];
minF = min(minF, cap[from[c]][c]);
c = from[c];
}
c = t;
while (c != s) {
cap[from[c]][c] -= minF;
cap[c][from[c]] += minF;
c = from[c];
}
return {minF, minF * len};
}
inline pair<int, int> run(int s, int t) {
pair<int, int> ret = {0, 0};
while (SP(s, t)) {
pair<int, int> x = upd(s, t);
ret.first += x.first;
ret.second += x.second;
}
return ret;
}
} flow;
int main() {
cin >> t;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> s[i] >> take[i];
}
flow = Flow();
fill(frq, frq + 26, 0);
for (char c : t) frq[c - 'a']++;
for (int i = 0; i < 26; i++) {
flow.addEdge(N + 2 + i, N + 28, 0, frq[i]);
}
for (int i = 0; i < N; i++) {
fill(frq, frq + 26, 0);
for (char c : s[i]) frq[c - 'a']++;
for (int j = 0; j < 26; j++) {
flow.addEdge(i + 2, N + 2 + j, 0, frq[j]);
}
flow.addEdge(1, i + 2, i + 1, take[i]);
}
pair<int, int> r = flow.run(1, N + 28);
if (r.first != t.length()) {
cout << -1 << endl;
return 0;
}
cout << r.second << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 7;
long long t[N][N];
long long n, m, h, w;
int main() {
cin >> n >> m >> h >> w;
long long ps = n * m * 500;
for (int i = h; i <= n; i += h) {
for (int j = w; j <= m; j += w) {
t[i][j] = -1 * (h * w - 1) * 500 - 1;
ps += t[i][j] - 500;
}
}
if (ps > 0) {
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (!t[i][j])
t[i][j] = 500;
cout << t[i][j] << " ";
}
cout << endl;
}
}
else
cout << "No";
return 0;
}
| 0 | CPP |
n = int(input())
s = input()
k = 0
for i in range(0,n-1):
if(s[i] == s[i+1]):
k+=1
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, dp[100100], dp2[100010], cntq[100100], cnta[100100], cntb[100010];
string str;
int solve(int pos) {
if (pos >= str.size() || pos + m > str.size()) return 0;
if (dp[pos] != -1) return dp[pos];
int a = cnta[pos] - cnta[pos + m + (m & 1)];
int b = cntb[pos + 1] - cntb[pos + m + 1 - (m & 1)];
int op = 0;
if (a == (m + 1) / 2 && b == m / 2) op = max(op, 1 + solve(pos + m));
op = max(op, solve(pos + 1));
return dp[pos] = op;
}
int sol2(int pos) {
if (pos >= str.size() || pos + m > str.size()) return 0;
if (dp2[pos] != -1) return dp2[pos];
int a = cnta[pos] - cnta[pos + m + (m & 1)];
int b = cntb[pos + 1] - cntb[pos + m + 1 - (m & 1)];
int c = cntq[pos] - cntq[pos + m];
int get0 = solve(pos + 1), get1 = 0, ok = 0;
if (a == (m + 1) / 2 && b == m / 2) ok = 1;
if (ok && 1 + solve(pos + m) > solve(pos + 1)) {
return dp2[pos] = c + sol2(pos + m);
} else {
dp2[pos] = sol2(pos + 1);
if (ok) dp2[pos] = min(dp2[pos], c + sol2(pos + m));
return dp2[pos];
}
}
int main() {
cin >> n >> str >> m;
str = "0" + str;
for (int i = n; i >= 1; i--) {
if (str[i] == '?') {
cntq[i] = cntq[i + 1] + 1;
cnta[i] = cnta[i + 2] + 1, cntb[i] = cntb[i + 2] + 1;
} else {
cntq[i] = cntq[i + 1];
if (str[i] == 'a')
cnta[i] = cnta[i + 2] + 1, cntb[i] = cntb[i + 2];
else
cntb[i] = cntb[i + 2] + 1, cnta[i] = cnta[i + 2];
}
}
memset(dp, -1, sizeof(dp));
memset(dp2, -1, sizeof(dp2));
cout << sol2(1) << endl;
}
| 11 | CPP |
s=input()
flag=0
n=len(s)
for i in range(n):
if(s[i]=='h' and flag==0):
flag=1
elif(s[i]=='e' and flag==1):
flag=2
elif(s[i]=='l' and flag==2):
flag=3
elif(s[i]=='l' and flag==3):
flag=4
elif(s[i]=='o' and flag==4):
flag=5
# print(flag)
if flag==5:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e) {
cout << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
int arr[110];
int main() {
int n;
int x;
cin >> n;
for (__typeof(0) i = (0); i < n; i++) cin >> arr[i];
int m = -1;
for (__typeof(0) i = (0); i < n; i++) {
m = max(arr[i], m);
int p = arr[i];
for (__typeof(i + 1) j = (i + 1); j < n; j++) {
p ^= arr[j];
m = max(p, m);
}
}
cout << m << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
b = b / 2;
c = c / 4;
int ans = min(c, min(a, b));
cout << ans * 7;
return 0;
}
| 7 | CPP |
# @uthor : Kaleab Asfaw
from sys import stdin, stdout
# Fast IO
def input():
a = stdin.readline()
if a[-1] == "\n": a = a[:-1]
return a
def print(*argv, end="\n", sep=" "):
n = len(argv)
for i in range(n):
if i == n-1: stdout.write(str(argv[i]))
else: stdout.write(str(argv[i]) + sep)
stdout.write(end)
# Others
mod = 10**9+7
def lcm(x, y):
from math import gcd
return (x * y) / (gcd(x, y))
def comb(lst, x):
from itertools import combination as c
return list(comb(lst, x))
def fact(x, mod=mod):
ans = 1
for i in range(1, x+1): ans = (ans * i) % mod
return ans
def arr2D(n, m, default=0):
lst = []
for i in range(n): temp = [default] * m; lst.append(temp)
return lst
def sortDictV(x):
return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}
# Remember to Add BS
def solve(a, b, x, y, n):
n2 = n
d1 = a-x
d2 = b-y
a1, b1 = a, b
if d1 >= n:
a -= n
else:
a = x
n -= d1
b = max(y, b-n)
if d2 >= n2:
b1 -= n2
else:
b1 = y
n2 -= d2
a1 = max(x, a1-n2)
return min(a1*b1, a*b)
for _ in range(int(input())): # Multicase
a, b, x, y, n = list(map(int, input().split()))
print(solve(a, b, x, y, n)) | 8 | PYTHON3 |
#from sys import stdin, setrecursionlimit as srl
#from threading import stack_size, Thread
#srl(int(1e9)+7)
#stack_size(int(1e8))
def solve():
t = int ( input () )
for _ in range ( t ) :
n=int(input())
w=list(map(int,input().split()))
val=[0 for i in range(2*n+1)]
d={}
for i in range(n+1):
d[i]=0
for i in w:
d[i]+=1
for i in range(2*n+1):
for j in range(n+1):
if i-j==j:
try:
val[i]+=d[j]
except:
pass
else:
try:
val[i]+=min(d[j],d[i-j])
except:
pass
print(max(val)//2)
#Thread(target=solve).start()
solve() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char* sdbg, TH h) {
cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char* sdbg, TH h, TA... t) {
while (*sdbg != ',') {
cerr << *sdbg++;
}
cerr << "=" << h << ",";
_dbg(sdbg + 1, t...);
}
template <class C>
void mini(C& a4, C b4) {
a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
a4 = max(a4, b4);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class A, class B, class C>
struct Triple {
A first;
B second;
C third;
bool operator<(const Triple& t) const {
if (first != t.first) return first < t.first;
if (second != t.second) return second < t.second;
return third < t.third;
}
};
template <class T>
void ResizeVec(T&, vector<long long>) {}
template <class T>
void ResizeVec(vector<T>& vec, vector<long long> sz) {
vec.resize(sz[0]);
sz.erase(sz.begin());
if (sz.empty()) {
return;
}
for (T& v : vec) {
ResizeVec(v, sz);
}
}
template <class A, class B, class C>
ostream& operator<<(ostream& out, Triple<A, B, C> t) {
return out << "(" << t.first << ", " << t.second << ", " << t.third << ")";
}
template <class T>
ostream& operator<<(ostream& out, vector<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class T>
ostream& operator<<(ostream& out, set<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class L, class R>
ostream& operator<<(ostream& out, map<L, R> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
if (0) cout << fixed << setprecision(10);
cin.tie(0);
long long k;
cin >> k;
vector<long long> pow10(8);
pow10[0] = 1;
vector<long long> f(6);
for (long long i = 0; i < (6); ++i) {
cin >> f[i];
pow10[i + 1] = 10 * pow10[i];
}
vector<pair<long long, long long> > items;
for (long long i = 0; i < (6); ++i) {
items.push_back({f[i] * pow10[5 - i], i});
}
sort((items).begin(), (items).end());
(items);
const long long M = 1e6 + 5;
vector<long long> dp(M, -(long long)1e18);
dp[0] = 0;
for (auto item : items) {
long long step = 3 * pow10[item.second];
vector<long long> drz;
vector<long long> puste;
long long max_steps = 3 * (k - 1);
long long B = -1;
for (long long rem = 0; rem < (step); ++rem) {
drz.clear();
for (long long j = 0; j * step + rem < M; j++) {
drz.push_back(dp[j * step + rem] - j * f[item.second]);
}
if (B == -1) {
B = 1;
while (B <= ((long long)(drz).size()) + 5) {
B *= 2;
}
puste.resize(B);
}
drz.insert(drz.begin(), (puste).begin(), (puste).end());
drz.resize(2 * B + 5);
for (long long i = (B - 1); i >= (1); --i) {
drz[i] = max(drz[2 * i], drz[2 * i + 1]);
}
function<long long(long long, long long)> Read = [&](long long a,
long long b) {
a += B;
b += B;
long long res = max(drz[a], drz[b]);
while (a / 2 != b / 2) {
if (a % 2 == 0) {
maxi(res, drz[a + 1]);
}
if (b % 2 == 1) {
maxi(res, drz[b - 1]);
}
a /= 2;
b /= 2;
}
return res;
};
for (long long j = 0; j * step + rem < M; j++) {
maxi(dp[j * step + rem],
Read(max(0ll, j - max_steps), j) + j * f[item.second]);
}
}
}
long long q;
cin >> q;
for (long long _ = (1); _ <= (q); ++_) {
long long sum;
cin >> sum;
vector<long long> dig(6);
long long best = 0;
for (long long last = 0; last < (sum + 1); ++last) {
long long tmp = last;
long long here = 0;
for (long long i = 0; i < (6); ++i) {
dig[i] = tmp % 10;
tmp /= 10;
if (dig[i] % 3 == 0) {
here += dig[i] / 3 * f[i];
}
}
maxi(best, here + dp[sum - last]);
}
cout << best << "\n";
}
return 0;
}
| 13 | CPP |
n, k = map(int, input().split())
p = list(map(int, input().split()))
res = 0
for a in p:
if a > 0 and a >= p[k-1]:
res += 1
print(res)
| 7 | PYTHON3 |
n = int(input())
colors = input()
last = colors[0]
number_remove = 0
for i in range(1,n):
if colors[i] == last:
number_remove += 1
continue
else:
last = colors[i]
print(number_remove) | 7 | PYTHON3 |
n, m = input().split()
num = sorted([int(x) for x in input().split()])
ans = num[int(m) - 1] - num[0]
for i in range(int(m) - int(n) + 1):
ans = min(ans, num[i + int(n) - 1] - num[i])
print(ans) | 7 | PYTHON3 |
t = int(input())
for i in range(t):
s = str(input())
ans = 0
tmp = 0
for j in range(len(s)):
if s[j] == "L":
tmp += 1
else:
ans = max(tmp, ans)
tmp = 0
print(max(ans, tmp) + 1) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = atan(1.0) * 4.0;
const long long int M = 1e9 + 7;
const long long int INF = 1e18;
const long double EPS = 0.0000001;
bool cmp(pair<string, int> a, pair<string, int> b) {
return a.second > b.second;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int n, m, a, cnt;
cin >> n >> m;
map<int, int> make_pair;
for (int i = 0; i < m; i++) {
cin >> a;
make_pair[a]++;
}
if (n > m) {
cout << 0 << "\n";
return 0;
} else {
if (make_pair.size() == 1)
cout << m / n << "\n";
else if (make_pair.size() == m)
cout << 1 << "\n";
else {
vector<int> v;
for (auto x : make_pair) v.push_back(x.second);
sort(v.begin(), v.end());
int mx = 0;
for (int i = 0; i < v.size(); i++) {
cnt = 0;
for (int j = i; j < v.size(); j++) {
cnt += (v[j] / v[i]);
}
if (cnt >= n) mx = max(mx, v[i]);
}
for (int i = 1; i <= v[v.size() - 1]; i++) {
cnt = 0;
for (int j = 0; j < v.size(); j++) {
cnt += v[j] / i;
}
if (cnt >= n) mx = max(mx, i);
}
mx = max(mx, v[v.size() - 1] / n);
if (n <= m) cout << max(mx, 1) << "\n";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmin(T& a, const T& b) {
return a > b ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
const int N = 1 << 17;
int sz[N], ch[N], pos[N], p[N], in[N], c = 1, timer = 0;
vector<int> g[N] = {{0}}, z[N];
int lo, hi, k;
struct T {
int n;
vector<vector<int>> t;
vector<int> nodes;
T() {}
void insert(int v) { nodes.emplace_back(v); }
void init() {
n = int((nodes).size());
int sz = 1;
while (sz < n) sz <<= 1;
t.resize(2 * sz);
build(1, 0, n);
}
void build(int v, int l, int r) {
if (r - l == 1) return void(t[v] = z[nodes[l]]);
int m = l + r >> 1;
build(v << 1 | 0, l, m);
build(v << 1 | 1, m, r);
t[v].resize(int((t[v << 1 | 0]).size()) + int((t[v << 1 | 1]).size()));
merge(begin(t[v << 1 | 0]), end(t[v << 1 | 0]), begin(t[v << 1 | 1]),
end(t[v << 1 | 1]), begin(t[v]));
}
void query(vector<int>& z, int v, int l, int r) {
if (r <= lo || hi <= l) return;
if (lo <= l && r <= hi) {
if (int((t[v]).size()) < k)
z = {begin(t[v]), end(t[v])};
else
z = {begin(t[v]), begin(t[v]) + k};
return;
}
vector<int> zl, zr;
int m = l + r >> 1;
query(zl, v << 1 | 0, l, m);
query(zr, v << 1 | 1, m, r);
z.resize(int((zl).size()) + int((zr).size()));
merge(begin(zl), end(zl), begin(zr), end(zr), begin(z));
if (k < int((z).size())) z.resize(k);
}
vector<int> query(int l, int r) {
if (l > r) swap(l, r);
lo = l;
hi = r + 1;
vector<int> z;
query(z, 1, 0, n);
return z;
}
} t[N];
void dfs_init(int u = 0, int a = 0) {
sz[u] = 1;
p[u] = a;
g[u].erase(find(begin(g[u]), end(g[u]), a));
for (auto& v : g[u]) {
dfs_init(v, u);
sz[u] += sz[v];
if (sz[g[u][0]] < sz[v]) swap(v, g[u][0]);
}
}
void dfs_hld(int u = 0) {
in[u] = ++timer;
for (auto& v : g[u]) {
if (v != g[u][0])
ch[v] = c++;
else {
ch[v] = ch[u];
pos[v] = pos[u] + 1;
}
t[ch[v]].insert(v);
dfs_hld(v);
}
}
int head(int u) { return t[ch[u]].nodes[0]; }
int ancestor(int u, int v) { return in[u] <= in[v] && in[v] < in[u] + sz[u]; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, q;
cin >> n >> m >> q;
for (auto i = (1); i < (n); ++i) {
int u, v;
cin >> u >> v;
--u;
--v;
g[u].emplace_back(v);
g[v].emplace_back(u);
}
t[0].insert(0);
dfs_init();
dfs_hld();
for (auto i = (0); i < (m); ++i) {
int x;
cin >> x;
z[--x].emplace_back(i + 1);
}
for (auto i = (0); i < (c); ++i) t[i].init();
while (q--) {
int u, v;
cin >> u >> v >> k;
--u;
--v;
vector<int> x, z;
while (ch[u] != ch[v]) {
if (!ancestor(head(u), v)) {
z = t[ch[u]].query(pos[head(u)], pos[u]);
u = p[head(u)];
} else {
assert(!ancestor(head(v), u));
z = t[ch[v]].query(pos[head(v)], pos[v]);
v = p[head(v)];
}
x.insert(end(x), begin(z), end(z));
}
z = t[ch[u]].query(pos[u], pos[v]);
x.insert(end(x), begin(z), end(z));
sort(begin(x), end(x));
if (k < int((x).size())) x.resize(k);
cout << int((x).size()) << ' ';
for (auto& z : x) cout << z << ' ';
cout << '\n';
}
}
| 9 | CPP |
#include<cstdio>
#include<cstring>
using namespace std;
char s[4];
int main()
{
fread(s,1,sizeof s,stdin);
if(!strcmp(s,"YAKI"))
puts("Yes");
else
puts("No");
} | 0 | CPP |
#include<bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define x first
#define y second
#define iter iterator
#define riter reverse_iterator
#define y1 Lorem_ipsum_
#define tm dolor_sit_amet_
using namespace std;
inline int read()
{
int x = 0,f = 1; char ch = getchar();
for(;!isdigit(ch);ch=getchar()) {if(ch=='-') f = -1;}
for(; isdigit(ch);ch=getchar()) {x = x*10+ch-48;}
return x*f;
}
const int mxN = 5000;
const llong P = 1e9+7;
llong f[mxN+3][2],g[mxN+3][2],h[mxN+3][2];
int n,A,B;
void updsum(llong &x,llong y) {x+=y-P,x+=(x>>31)&P;}
int main()
{
n = read(),A = read(),B = read(); if(A>B) {swap(A,B);}
g[0][0] = 1ll;
for(int i=1; i<=n; i++)
{
for(int j=A; j<=i; j++)
{
updsum(g[i][0],g[i-j][1]);
}
for(int j=1; j<=i; j++)
{
updsum(g[i][1],g[i-j][0]);
}
}
for(int i=1; i<=n; i++)
{
if(i<A) {f[i][0] = 1ll;}
if(i<B) {f[i][1] = (g[i][0]+g[i][1])%P;}
for(int j=1; j<i&&j<B; j++)
{
updsum(f[i][1],f[i-j][0]*g[j][1]%P);
}
for(int j=1; j<i&&j<A; j++)
{
updsum(f[i][0],f[i-j][1]);
}
}
llong tot = 1ll,ans = f[n][0];
for(int i=1; i<=n; i++) {tot = tot*2ll%P;}
for(int i=1; i<B; i++)
{
updsum(ans,f[n-i][0]*(g[i][0]+g[i][1])%P);
}
printf("%lld\n",(tot-ans+P)%P);
return 0;
} | 0 | CPP |
w = input()
print([w,w.swapcase()][w[1:].upper() == w[1:]])
| 7 | PYTHON3 |
from sys import stdin, exit
def find_lucky(n, cur):
if cur == '' or int(cur) <= n:
if cur != '' and n % int(cur) == 0:
print('YES')
exit()
find_lucky(n, cur + '4')
find_lucky(n, '4' + cur)
find_lucky(n, '7' + cur)
find_lucky(n, cur + '7')
n = int(stdin.readline().rstrip())
find_lucky(n, '')
print('NO')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<long long int> v[30];
for (long long int i = 0; i < s.size(); i++) v[s[i] - 'a'].push_back(i + 1);
cin >> n;
for (char i = 'a'; i <= 'z'; i++) sort(v[i - 'a'].begin(), v[i - 'a'].end());
for (long long int i = 0; i < n; i++) {
map<char, long long int> mp;
cin >> s;
for (long long int i = 0; i < s.size(); i++) mp[s[i]]++;
for (char i = 'a'; i <= 'z'; i++) {
if (v[i - 'a'].size() and mp[i]) {
ans = max(ans, v[i - 'a'][mp[i] - 1]);
}
}
cout << ans << endl;
ans = 0;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 100005;
vector<pair<long long int, long long int> > adj[N];
set<pair<long long int, long long int> > ver[N];
set<long long int> odd[N];
long long int par[N];
long long int n, m, q, c;
void init() {
for (long long int i = 1; i <= n; i++) {
par[i] = i;
for (auto j : adj[i]) odd[i].insert(j.first);
}
}
long long int find(long long int v) {
if (v == par[v]) return v;
return par[v] = find(par[v]);
}
void merge(long long int a, long long int b) {
a = find(a);
b = find(b);
if (a != b) {
if (odd[a].size() < odd[b].size()) swap(a, b);
for (auto i : odd[b]) odd[a].insert(i);
odd[b].clear();
par[b] = a;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> n >> m >> c >> q;
for (long long int i = 0; i < m; i++) {
long long int x, y, z;
cin >> x >> y >> z;
adj[x].push_back({y, z});
adj[y].push_back({x, z});
}
init();
for (long long int i = 1; i <= n; i++) {
for (auto j : adj[i]) ver[i].insert({j.second, j.first});
set<pair<long long int, long long int> >::iterator it1, it2;
for (it1 = ver[i].begin(); it1 != ver[i].end();) {
it2 = it1;
it2++;
pair<long long int, long long int> p = *it1;
while (it2 != ver[i].end()) {
pair<long long int, long long int> q = *it2;
if (p.first != q.first) break;
merge(p.second, q.second);
it2++;
}
it1 = it2;
}
}
while (q--) {
char ch;
cin >> ch;
if (ch == '+') {
long long int x, y, z;
cin >> x >> y >> z;
pair<long long int, long long int> p;
if (ver[x].upper_bound({z, -1}) != ver[x].end()) {
p = *(ver[x].upper_bound({z, -1}));
if (p.first == z) merge(y, p.second);
}
if (ver[y].upper_bound({z, -1}) != ver[y].end()) {
p = *(ver[y].upper_bound({z, -1}));
if (p.first == z) merge(x, p.second);
}
ver[x].insert({z, y});
ver[y].insert({z, x});
long long int a = find(x);
long long int b = find(y);
odd[a].insert(y);
odd[b].insert(x);
} else {
long long int x, y;
cin >> x >> y;
long long int a = find(x), b = find(y);
if (a == b || odd[a].find(y) != odd[a].end())
cout << "Yes\n";
else
cout << "No\n";
}
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 1000000007;
const int MM = 998244353;
template <typename T, typename U>
static inline void amin(T &x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T &x, U y) {
if (x < y) x = y;
}
const int N = 105;
vector<int> dx = {1, -1, 0, 0}, dy = {0, 0, 1, -1};
int can[N][N][26];
int _runtimeTerror_() {
int n, m, k;
cin >> n >> m >> k;
vector<vector<char>> ans(n, vector<char>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
for (int k = 0; k < 26; ++k) can[i][j][k] = 0;
auto assign = [&](int x, int y, int c) {
ans[x][y] = char(c + 'a');
for (int i = 0; i < 4; ++i) {
int u = x + dx[i], v = y + dy[i];
if (u >= 0 && u < n && v >= 0 && v < m) can[u][v][c] = 1;
}
};
auto get = [&](vector<pair<pair<int, int>, pair<int, int>>> &a) {
for (auto &[u, v] : a) {
vector<int> cant(26, 0);
auto [x, y] = u;
auto [xx, yy] = v;
for (int i = 0; i < 26; ++i) cant[i] = can[x][y][i] || can[xx][yy][i];
for (int i = 0; i < 26; ++i) {
if (cant[i] == 0) {
assign(x, y, i);
assign(xx, yy, i);
break;
}
}
}
};
vector<pair<pair<int, int>, pair<int, int>>> a;
if (n % 2 == 0 && m % 2 == 0) {
if (k % 2 == 0) {
cout << "YES\n";
for (int i = 0; i < n; i += 2) {
for (int j = 0; j < m; j += 2) {
if (k == 0) {
a.push_back({{i, j}, {i + 1, j}});
a.push_back({{i, j + 1}, {i + 1, j + 1}});
} else {
k -= 2;
a.push_back({{i, j}, {i, j + 1}});
a.push_back({{i + 1, j}, {i + 1, j + 1}});
}
}
}
} else {
cout << "NO\n";
return 0;
}
} else if (n % 2 == 1 && m % 2 == 0) {
k -= m / 2;
if (k >= 0 && k % 2 == 0) {
for (int j = 0; j < m; j += 2) {
a.push_back({{n - 1, j}, {n - 1, j + 1}});
}
for (int i = 0; i < n - 1; i += 2) {
for (int j = 0; j < m; j += 2) {
if (k == 0) {
a.push_back({{i, j}, {i + 1, j}});
a.push_back({{i, j + 1}, {i + 1, j + 1}});
} else {
k -= 2;
a.push_back({{i, j}, {i, j + 1}});
a.push_back({{i + 1, j}, {i + 1, j + 1}});
}
}
}
cout << "YES\n";
} else {
cout << "NO\n";
return 0;
}
} else if (n % 2 == 0 && m % 2 == 1) {
if (k % 2 == 0 && k <= n * m / 2 - n / 2) {
cout << "YES\n";
for (int i = 0; i < n; i += 2) a.push_back({{i, m - 1}, {i + 1, m - 1}});
for (int i = 0; i < n; i += 2) {
for (int j = 0; j < m - 1; j += 2) {
if (k == 0) {
a.push_back({{i, j}, {i + 1, j}});
a.push_back({{i, j + 1}, {i + 1, j + 1}});
} else {
k -= 2;
a.push_back({{i, j}, {i, j + 1}});
a.push_back({{i + 1, j}, {i + 1, j + 1}});
}
}
}
} else {
cout << "NO\n";
return 0;
}
}
get(a);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) cout << ans[i][j];
cout << "\n";
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
cin >> TESTS;
while (TESTS--) _runtimeTerror_();
return 0;
}
| 10 | CPP |
import math
n = int(input())
c = sorted(list(map(int, input().split())),reverse=True)
a = 0
for i in range(n):
a += c[i]*(i+2)
a = a%(10**9+7)
a = (a*pow(2,2*n-2,10**9+7))%(10**9+7)
print(a) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int at[200010];
struct Event {
int x, y, flag;
Event() {}
Event(int x0, int y0, int flag0) : x(x0), y(y0), flag(flag0) {}
} pp[1000010];
int qq;
bool cmp(Event a, Event b) {
if (a.y == b.y) return a.flag < b.flag;
return a.y < b.y;
}
int sum[200010 << 2];
void pushup(int rt) { sum[rt] = sum[rt << 1] + sum[rt << 1 | 1]; }
void update(int p, int add, int l, int r, int rt) {
if (l == r) {
sum[rt] += add;
return;
}
int m = (l + r) / 2;
if (p <= m)
update(p, add, l, m, rt << 1);
else
update(p, add, m + 1, r, rt << 1 | 1);
pushup(rt);
}
int query(int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) return sum[rt];
int m = (l + r) / 2;
int ret = 0;
if (L <= m) ret += query(L, R, l, m, rt << 1);
if (R > m) ret += query(L, R, m + 1, r, rt << 1 | 1);
return ret;
}
struct Edge {
int v, next;
} edge[3000010];
int head[200010];
int pos;
void insert(int x, int y) {
edge[pos].v = y;
edge[pos].next = head[x];
head[x] = pos++;
}
int ans[200010];
int main() {
int n, m;
scanf("%d %d", &n, &m);
memset(at, -1, sizeof(at));
for (int i = 1; i <= n; i++) {
int s;
scanf("%d", &s);
at[s] = i;
}
memset(head, 0, sizeof(head));
pos = 1;
qq = 0;
for (int i = 1; i <= n; i++) {
int x = at[i];
if (x == -1) continue;
for (int j = i; j <= n; j += i) {
int y = at[j];
if (y != -1) {
int xx = x;
int yy = y;
if (xx > yy) swap(xx, yy);
insert(yy, xx);
}
}
}
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d %d", &x, &y);
pp[qq++] = Event(x, y, i);
}
sort(pp, pp + qq, cmp);
memset(sum, 0, sizeof(sum));
int j = 0;
for (int i = 0; i < qq; i++) {
while (j <= pp[i].y) {
for (int k = head[j]; k; k = edge[k].next) {
int v = edge[k].v;
update(v, 1, 1, n, 1);
}
j++;
}
ans[pp[i].flag] = query(pp[i].x, n, 1, n, 1);
}
for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
return 0;
}
| 10 | CPP |
import sys
from sys import stdin, stdout
input, print = stdin.readline, stdout.write
from collections import OrderedDict, defaultdict
from bisect import bisect_left
import math
from math import gcd, sqrt, floor, ceil
from string import ascii_lowercase
# n = int(input())
n, q = [int(x) for x in input().split()]
s = input()
hsh = defaultdict(list)
for c in ascii_lowercase:
hsh[c] = [0]
li = hsh[c]
for i in range(n):
li.append(li[-1])
if s[i] == c:
li[-1] += 1
# for c in ascii_lowercase:
# print(str(hsh[c]))
# print('\n')
for Q in range(q):
l, r = [int(x) for x in input().split()]
res = 0
i = 1
for c in ascii_lowercase:
li = hsh[c]
res += i * int(li[r] - li[l - 1])
i += 1
print(str(res) + "\n")
# a = [*map(int, input().split())]
# mat = [[0]*n]*m
# print(' '.join(map(str, arr)))
# print(str(res))
print('\n') | 8 | PYTHON3 |
n, k = [int(p) for p in input().split()]
th = [int(p) for p in input().split()]
aw = [int(p) for p in input().split()]
try:
i = aw.index(0)
except ValueError:
print(sum(th))
exit()
j = i + k
arr = [sum(th[:k])]
exSum = []
s = 0
for i in range(k):
if aw[i]:
s += th[i]
exSum.append(s)
total = 0
for i in range(1, len(th)-k+1):
curr = arr[-1]
curr -= th[i-1]
curr += th[i+k-1]
arr.append(curr)
s = exSum[-1]
if aw[i-1] == 1:
s -= th[i-1]
if aw[i+k-1] == 1:
s += th[i+k-1]
exSum.append(s)
index, m = None, 0
for i in range(len(arr)):
prev = m
m = max(m, abs(arr[i] - exSum[i]))
if prev != m:
index = i
for i in range(index):
if aw[i]:
total += th[i]
for i in range(index+k, len(th)):
if aw[i]:
total += th[i]
print(total + arr[index])
| 8 | PYTHON3 |
from math import radians, cos, sin, ceil, floor
g = 90
x = y = 0
while 1:
d, a = map(int, input().split(","))
if d == 0:
break
t = radians(g)
x += cos(t) * d
y += sin(t) * d
g -= a
x = floor(x) if x > 0 else ceil(x)
y = floor(y) if y > 0 else ceil(y)
print("%d" % x)
print("%d" % y)
| 0 | PYTHON3 |
ch=input()
print(''.join('.'+x for x in ch.lower() if x not in'aeyoui'))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, d = 0, e = 0;
cin >> n;
string s, s1, s2;
cin >> s;
s1.assign(s.begin(), s.begin() + n);
s2.assign(s.begin() + n, s.end());
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end());
for (i = 0; i < n; i++) {
if (s1[0] < s2[0]) {
if (s1[i] > s2[i] || s1[i] == s2[i]) {
cout << "NO";
c++;
break;
}
} else if (s1[0] > s2[0]) {
if (s1[i] < s2[i] || s1[i] == s2[i]) {
cout << "NO";
d++;
break;
}
} else {
cout << "NO";
e++;
break;
}
}
if (c == 0 && d == 0 && e == 0) cout << "YES";
}
| 8 | CPP |
#include <iostream>
using namespace std;
int main(){
int data1[55];
int data2[100];
for(int i=0;i<55;i++){
data1[i]=i*i*i;
}
for(int i=0;i<100;i++){
data2[i]=i*(i+1)*(i+2)/6;
}
while(1){
int n;
cin >> n;
if(n==0) break;
int max=-1;
int tmp;
for(int i=0;i<55;i++){
if(data1[i]>n) break;
for(int j=0;j<100;j++){
tmp=data1[i]+data2[j];
if(tmp>n) break;
if(max<tmp) max=tmp;
}
}
cout << max << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<string> grid;
inline bool can(int x, int y) {
bool res = false;
if (x == n and (3 * y) == m) {
vector<set<char> > mat(3);
for (int i = int(0); i < int(n); i++) {
for (int j = int(0); j < int(m); j++) {
mat[j / y].insert(grid[i][j]);
}
}
if (mat[0].size() == 1 and mat[1].size() == 1 and mat[2].size() == 1) {
set<char> chars;
for (int i = int(0); i < int(3); i++) {
chars.insert(*mat[i].begin());
}
if (chars.size() == 3) {
res = true;
}
}
}
if ((3 * x) == n and y == m) {
vector<set<char> > mat(3);
for (int i = int(0); i < int(n); i++) {
for (int j = int(0); j < int(m); j++) {
mat[i / x].insert(grid[i][j]);
}
}
if (mat[0].size() == 1 and mat[1].size() == 1 and mat[2].size() == 1) {
set<char> chars;
for (int i = int(0); i < int(3); i++) {
chars.insert(*mat[i].begin());
}
if (chars.size() == 3) {
res = true;
}
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = int(0); i < int(n); i++) {
string s;
cin >> s;
grid.push_back(s);
}
bool ans = false;
for (int i = int(1); i < int(n + 1); i++) {
for (int j = int(1); j < int(m + 1); j++) {
if (can(i, j)) {
ans = true;
}
}
}
cout << (ans ? "YES" : "NO") << "\n";
return 0;
}
| 8 | CPP |
#
# ~oisín~ Python3 Template
#
import sys
import math
import statistics
import datetime
import collections
def F(n):
if n == 1:
return 0
return 2*n*n-4*n+2+F(n-2)
def main():
ans = [0, 0, 0]
for i in range(3, 500001):
if i%2 == 0:
ans.append(0)
else:
ans.append(2*i*i-4*i+2+ans[i-2])
t = int(input())
for _ in range(t):
n = int(input())
print(ans[n])
if __name__ == '__main__':
main()
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 4) {
cout << "NO" << endl;
return 0;
}
int num;
cout << "YES" << endl;
if (n & 1) {
cout << "3 + 4 = 7" << endl;
cout << "7 + 5 = 12" << endl;
num = 6;
} else {
cout << "3 * 4 = 12" << endl;
num = 5;
}
cout << "1 * 2 = 2" << endl;
cout << "2 * 12 = 24" << endl;
for (int i = num; i < n; i += 2) {
cout << i + 1 << " - " << i << " = 1" << endl;
cout << "1 * 24 = 24" << endl;
}
}
| 7 | CPP |
#include <iostream>
#include <cmath>
int main(){
int num;
std::cin >> num; //dataset
double xa,ya,ra;
double xb,yb,rb;
for(int i=0; i<num; ++i){
std::cin >> xa >> ya >> ra >> xb >> yb >> rb;
double length; //a-b length;
length = hypot(std::abs(xa-xb), std::abs(ya-yb));
if(length > ra+rb){
std::cout << 0 << std::endl;
}else if(length + rb < ra){
std::cout << 2 << std::endl;
}else if(length + ra < rb){
std::cout << -2 << std::endl;
}else{
std::cout << 1 << std::endl;
}
}
return 0;
} | 0 | CPP |
s = input()
mn = set('aeiou')
k = 0
for i in s:
if ('0' <= i <= '9'):
if (int(i) % 2 == 1):
k += 1
else:
if i in mn:
k += 1
print(k)
| 7 | PYTHON3 |
import io, sys, atexit, os
import math as ma
from sys import exit
from decimal import Decimal as dec
from itertools import permutations
from itertools import combinations
def li():
return list(map(int, sys.stdin.readline().split()))
def num():
return map(int, sys.stdin.readline().split())
def nu():
return int(input())
def find_gcd(x, y):
while (y):
x, y = y, x % y
return x
def lcm(x, y):
gg = find_gcd(x, y)
return (x * y // gg)
def check(a,b,n):
if(ma.ceil(b/(a+1))+a<=n):
return True
else:
return False
mm=1000000007
def solve():
t = nu()
for tt in range(t):
a,b=num()
ss=0
cc=0
while(ss*10+9<=b):
ss=ss*10+9
cc=cc+1
print(a*cc)
if __name__ == "__main__":
solve() | 8 | PYTHON3 |
def dis(a, b, c):
return abs(a - b) + abs(a - c) + abs(b - c)
for _ in range(int(input())):
ls = list(map(int, input().split()))
ls.sort()
s = set(ls)
if len(s) == 1:
print("0")
continue
elif len(s) == 2:
if ls[0] == ls[1]:
ls[0] += 1
ls[1] += 1
if ls[0] == ls[2]:
print(dis(ls[0], ls[0], ls[2]))
continue
else:
print(dis(ls[0], ls[0], ls[2] - 1))
continue
else:
ls[1] -= 1
ls[2] -= 1
if ls[0] == ls[1]:
print(dis(ls[0], ls[1], ls[1]))
continue
else:
print(dis(ls[0] + 1, ls[1], ls[1]))
continue
else:
print(dis(ls[0] + 1, ls[1], ls[2] - 1))
| 7 | PYTHON3 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon May 21 22:31:07 2018
@author: thomas
"""
n=int(input())
integer_numbers=input()
init_position=[int(x)-1 for x in integer_numbers.split()]
#we consider 2 cases: all Black or all White
init_position.sort()
sum_B=0
for i in range(len(init_position)):
sum_B+=abs(init_position[i]-2*i)
sum_W=0
for i in range(len(init_position)):
sum_W+=abs(init_position[i]-2*i-1)
print(min(sum_B, sum_W)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, n, m, k, s = 0, f = 1;
cin >> n >> m >> k;
vector<int> v;
for (i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end(), greater<int>());
if (m <= k) f = 2;
if (f != 2) {
for (i = 0; i < n; i++) {
k--;
s += v[i];
if (k + s >= m) {
f = 0;
break;
}
}
}
if (f == 2)
cout << "0";
else if (f == 1)
cout << "-1";
else
cout << i + 1;
return 0;
}
| 7 | CPP |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <stack>
#define N 1000006
#define ls(x) x << 1
#define rs(x) x << 1 | 1
using namespace std;
struct edge{
int to, nxt;
}e[N];
struct flag{
int pl, id;
friend bool operator < (flag a, flag b){
return a.pl < b.pl;
}
}x[N];
int n, cnt, ans, tot, num;
int rkx[N], rky[N], fir[N], dfn[N], low[N], co[N];
bool vis[N];
stack < int > st;
int read();
bool cmp(flag, flag);
void build(int ,int ,int);
bool check(int);
void link(int ,int ,int ,int ,int ,int);
void add(int ,int);
void tarjan(int);
int main(){
n = read();n <<= 1;int l = 0, r = 0;
for(int i = 0; i < n; ++i) x[i].pl = read(), x[i].id = i, r = max(r, x[i].pl);
sort(x, x + n);
for(int i = 0; i < n; ++i) rkx[x[i].id] = i;
while(l <= r){
int mid = (l + r) >> 1;
if(check(mid)) ans = mid, l = mid + 1;
else r = mid - 1;
}
cout << ans << endl;
return 0;
}
int read(){
int x = 0;char ch = getchar();
for(; !isdigit(ch); ch = getchar());
for(; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ 48);
return x;
}
void add(int u,int v){
e[++cnt].to = v;e[cnt].nxt = fir[u];fir[u] = cnt;
return ;
}
void build(int pos,int l,int r){
if(pos != 1) add(pos >> 1, pos);
if(l == r){
rky[l] = pos;return ;
}
int mid = (l + r) >> 1;
build(ls(pos), l, mid);build(rs(pos), mid + 1, r);
return ;
}
void link(int pos,int l,int r,int nl,int nr, int d){
if(nl > nr) return ;
if(l >= nl && r <= nr){
add(d, pos); return ;
}
int mid = (l + r) >> 1;
if(mid >= nl) link(ls(pos), l, mid, nl, nr, d);
if(mid < nr) link(rs(pos), mid + 1, r, nl, nr, d);
return ;
}
bool check(int p){
num = tot = cnt = 0;
memset(fir, 0, sizeof fir);memset(vis, false, sizeof vis);memset(dfn, 0, sizeof dfn);
build(1, 0, (n << 1) - 1);
for(int i = 0; i < n; ++i){
add(rky[i], rky[rkx[x[i].id ^ 1] + n]); add(rky[i + n], rky[rkx[x[i].id ^ 1]]);
int l = upper_bound(x, x + n, (flag){x[i].pl - p, 0}) - x;
int r = lower_bound(x, x + n, (flag){x[i].pl + p, 0}) - x - 1;
if(l > r) continue;
link(1, 0, (n << 1) - 1, l + n, i + n - 1, rky[i]);
link(1, 0, (n << 1) -1, i + n + 1, r + n, rky[i]);
}
for(int i = 0; i < (n << 1); ++i)
if(!dfn[rky[i]]) tarjan(rky[i]);
for(int i = 0; i < n; ++i)
if(co[rky[i]] == co[rky[i + n]]) return false;
return true;
}
void tarjan(int u){
low[u] = dfn[u] = ++tot;vis[u] = true;st.push(u);
for(int i = fir[u]; i; i = e[i].nxt){
int v = e[i].to;
if(!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);
else if(vis[v]) low[u] = min(low[u], low[v]);
}
if(low[u] == dfn[u]){
++num;
do{
co[u] = num;
u = st.top(); st.pop();vis[u] = false;
}while(dfn[u] != low[u] && !st.empty());
}
return ;
}
| 0 | CPP |
n=int(input())
n=n%4
if n==1:
print((2+3+4+1)%5)
if n==2:
print((1+4+9+6)%5)
if n==3:
print((7+4+8+1)%5)
if n==0:
print((1+6+1+6)%5) | 8 | PYTHON3 |
# https://codeforces.com/problemset/submission/263/78499690
# note: it doesn't work if the matrix have any '1' number
i = j = 0
while(True):
row = list(map(int, input().split()))
try:
j = row.index(1)
break
except: pass
i += 1
print(abs(i-2) + abs(j-2))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int mx = 1e5 + 10;
using namespace std;
char c;
string s;
int x[mx], y[mx], z[mx], n, a, b, k;
int main() {
x[0] = y[0] = z[0] = 0;
cin >> s;
for (int i = 0; i < (int)s.size(); i++) {
c = s[i];
k = i + 1;
x[k] = x[k - 1];
y[k] = y[k - 1];
z[k] = z[k - 1];
if (c == 'x')
x[k]++;
else if (c == 'y')
y[k]++;
else
z[k]++;
}
scanf("%d", &n);
while (n--) {
scanf("%d%d", &a, &b);
int nx = x[b] - x[a - 1], ny = y[b] - y[a - 1], nz = z[b] - z[a - 1];
if (nz == ny && nx == ny)
printf("YES\n");
else {
if (b - a < 2 || (ny + 1 == nx && (nz == ny || nx == nz)) ||
(nz + 1 == ny && (nx == ny || nx == nz)) ||
(nx + 1 == nz && (nx == ny || ny == nz)))
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
void solve();
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
int mylog2(long long x) {
for (int i = 1; i < 61; i++) {
if ((x >> i) == 0) return i - 1;
}
return -1;
}
void solve() {
int n;
cin >> n;
vector<vector<long long> > groups(60, vector<long long>());
for (int i = 0; i < n; i++) {
long long b;
cin >> b;
groups[mylog2(b)].push_back(b);
}
long long cur = 0;
vector<long long> ans(n);
for (int i = 0; i < n; i++) {
int j;
for (j = 0; j < 60; j++) {
if (!groups[j].empty() && (cur ^ groups[j].back()) > cur) {
cur ^= groups[j].back();
ans[i] = groups[j].back();
groups[j].pop_back();
break;
}
}
if (j == 60) {
cout << "No";
return;
}
}
cout << "Yes" << endl;
for (int i = 0; i < n; i++) {
cout << ans[i] << ' ';
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::set;
using std::swap;
using std::vector;
void TaskA() {
vector<char> first;
vector<char> second;
char a;
int f, s;
for (int i = 0; i < 4; i++) {
cin >> a;
first.push_back(a);
if (a == 'A') f = i;
}
swap(first[2], first[3]);
if (f == 2)
f = 3;
else if (f == 3)
f = 2;
for (int i = 0; i < 4; i++) {
cin >> a;
second.push_back(a);
if (a == 'A') s = i;
}
swap(second[2], second[3]);
if (s == 2)
s = 3;
else if (s == 3)
s = 2;
if (first[(f + 1) % 4] == 'X') f = (f + 1) % 4;
if (second[(s + 1) % 4] == 'X') s = (s + 1) % 4;
if (first[(f + 1) % 4] == second[(s + 1) % 4])
cout << "YES";
else
cout << "NO";
}
int main() {
TaskA();
return 0;
}
| 7 | CPP |
def nod(a,b):
while a*b!=0:
if a>b:
a%=b
else:
b%=a
return a+b
n,m=map(int,input().split())
l=[int(j) for j in input().split()]
p=[int(j) for j in input().split()]
nd=l[1]-l[0]
ans=-1
for i in range(2,n):
nd=nod(nd,l[i]-l[i-1])
for i in range(m):
if nd%p[i]==0:
ans=i
break
if ans==-1:
print('NO')
else:
print('YES')
print(l[0],ans+1)
| 9 | PYTHON3 |
import sys,string
s = input().strip()
k = int(input())
a = list(map(int, sys.stdin.readline().split()))
ma = max(a)
ls = len(s)
ans = ma * sum(range(ls+1,ls+k+1))
d = {i:j for i,j in zip(string.ascii_lowercase,a)}
ans += sum([(i+1)*d[j] for i,j in enumerate(s)])
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100 * 100 * 10 + 10;
const int maxS = 3 * maxN;
int a[maxS];
int p[maxS];
int b[maxN][3];
inline void smin(int& a, int& b) { a = p[a] > p[b] ? swap(a, b), a : a; }
int main() {
int n;
cin >> n;
for (int i = 0; i < 3 * n; i++) {
cin >> a[i];
p[a[i]] = i;
}
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++) cin >> b[i][j];
int k;
cin >> k;
for (int i = 0; i < n; i++) {
smin(b[i][0], b[i][1]);
smin(b[i][0], b[i][2]);
if (k == b[i][1] || k == b[i][2]) {
for (int j = 1; j <= 3 * n; j++)
if (j != k) cout << j << ' ';
cout << endl;
break;
}
if (k != b[i][0]) continue;
vector<int> curr;
for (int j = 0; j <= i; j++)
for (int x = 0; x < 3; x++)
if (!(j == i && x == 0)) curr.push_back(b[j][x]);
sort(curr.begin(), curr.end());
for (int j = i + 1; j < n; j++)
for (int x = 0; x < 3; x++) curr.push_back(b[j][x]);
int ind = max(find(curr.begin(), curr.end(), b[i][1]),
find(curr.begin(), curr.end(), b[i][2])) -
curr.begin();
sort(curr.begin() + ind + 1, curr.end());
copy(curr.begin(), curr.end(), ostream_iterator<int>(cout, " "));
cout << endl;
break;
}
}
| 10 | CPP |
n=int(input())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
z=[0]*n
a=0
b=0
c=0
d=0
for i in range(n):
a=a+abs(x[i]-y[i])
b=b+(x[i]-y[i])**2
c=c+abs(x[i]-y[i])**3
z[i]=abs(x[i]-y[i])
print(f'{a:.10f}')
b=b**(1/2)
print(f'{b:.10f}')
c=c**(1/3)
print(f'{c:.10f}')
print(f'{max(z):.10f}')
| 0 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,m = LI()
if m % n != 0:
return -1
k = m // n
r = 0
while k > 1:
if k % 2 == 0:
k //= 2
r += 1
elif k % 3 == 0:
k //= 3
r += 1
else:
return -1
if k == 1:
return r
return -1
print(main())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
const int INF = 1e9;
const int MAXN = int(5e5 + 7);
int n, m, x, y, d[3][1007][1007], dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1},
ans = INF;
char c[1007][1007];
set<pair<int, pair<int, int> > > q;
inline void bfs(char c1, int id) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (c[i][j] == c1) {
d[id][i][j] = 0;
q.insert(make_pair(0, make_pair(i, j)));
} else
d[id][i][j] = INF;
while (!q.empty()) {
x = q.begin()->second.first;
y = q.begin()->second.second;
q.erase(q.begin());
for (int i = 0; i < 4; i++) {
int tox = x + dx[i], toy = y + dy[i];
if (tox > 0 && toy > 0 && tox <= n && toy <= m && c[tox][toy] != '#') {
int w = 0;
if (c[tox][toy] == '.') w = 1;
if (d[id][tox][toy] > d[id][x][y] + w) {
q.erase(make_pair(d[id][tox][toy], make_pair(tox, toy)));
d[id][tox][toy] = d[id][x][y] + w;
q.insert(make_pair(d[id][tox][toy], make_pair(tox, toy)));
}
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> c[i][j];
for (int i = 1; i <= 3; i++) bfs('0' + i, i - 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (c[i][j] != '#') {
if (d[0][i][j] != INF && d[1][i][j] != INF && d[2][i][j] != INF) {
int cur = d[0][i][j] + d[1][i][j] + d[2][i][j];
if (c[i][j] == '.') cur -= 2;
ans = min(ans, cur);
}
}
if (ans > INF / 2)
cout << -1;
else
cout << ans;
return 0;
}
| 9 | CPP |
from math import gcd
n, k = map(int, input().split())
a, b = map(int, input().split())
l = n * k
x, y = 10 ** 18, -1
for i in range(n):
end = i * k + b + 1
start = a + 1
ll = (end - start)
if ll < 0:
ll += l
gg = l // gcd(ll, l)
x = min(x, gg)
y = max(y, gg)
end = (i + 1) * k - b + 1
ll = (end - start)
if ll < 0:
ll += l
gg = l // gcd(ll, l)
x = min(x, gg)
y = max(y, gg)
print(x, y)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char str[100010];
scanf("%d", &n);
scanf("%s", str);
sort(str, str + n);
printf("%s\n", str);
return 0;
}
| 9 | CPP |
a,b,c = map(int,input().split())
bb=0
while bb<=c:
if (c-bb)%a == 0:
print('Yes')
exit()
bb+=b
print('No') | 7 | PYTHON3 |
c = [int(x) for x in input().split()]
n, m = (int(x) for x in input().split())
a = b = 0
for x in input().split():
x = int(x)
a += min(x * c[0], c[1])
for x in input().split():
x = int(x)
b += min(x * c[0], c[1])
print(min(c[3], min(c[2], a) + min(c[2], b))) | 8 | PYTHON3 |
n = int(input())
mas = list(map(int, input().split()))
mas = set(mas)
if 0 in mas:
print(len(mas) - 1)
else:
print(len(mas)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int num[10005];
int main() {
int n;
while (cin >> n) {
memset(num, 0, sizeof(num));
int t = n - 1;
long long path = 0;
while (t--) {
int a, b;
cin >> a >> b;
num[a]++;
num[b]++;
}
for (int i = 1; i <= n; ++i) {
path += num[i] * (num[i] - 1);
}
cout << path / 2 << endl;
}
return 0;
}
| 12 | CPP |
class UnionFind:
def __init__(self, n):
self.n = n
self.UF = [i for i in range(n)]
def union(self,x,y):
px = self.find(x)
py = self.find(y)
self.UF[px] = py
def find(self, x):
if self.UF[x] == x:
return x
self.UF[x] = self.find(self.UF[x])
return self.UF[x]
n,m = [int(x) for x in input().split()]
UF = UnionFind(n)
for _ in range(m):
a,b = [int(x) for x in input().split()]
a -= 1
b -= 1
UF.union(a,b)
ANS = []
for i in range(n):
if UF.find(i) != UF.find(0):
ANS.append((0,i))
UF.union(i, 0)
print(len(ANS))
| 0 | PYTHON3 |
import math
from sys import exit as ex
# A function to print all prime factors of
# a given number n
def pf(n):
l=[]
# Print the number of two's that divide n
while n % 2 == 0:
l.append(2)
n = n //2
# n must be odd at this point
# so a skip of 2 ( i = i + 2) can be used
for i in range(3,int(math.sqrt(n))+1,2):
# while i divides n , print i ad divide n
while n % i== 0:
l.append(i),
n = n // i
# Condition if n is a prime
# number greater than 2
if n > 2:
l.append(n)
return (set(l))
n=int(input())
a,b=map(int,input().split())
x=pf(a)
x=list(x.union(pf(b)))
dp=[1 for i in range(len(x))]
for i in range(n-1):
a,b=map(int,input().split())
t=False
for j in range(len(x)):
if a%x[j]==0 or b%x[j]==0:
dp[j]+=1
for i in range(len(dp)):
if dp[i]==n:
print(x[i])
ex()
print(-1)
ex()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, h;
int sumall = 0;
int sumother = 0;
int sumsame = 0;
int main() {
scanf("%d %d %d", &n, &m, &h);
int in;
for (int i = 0; i < m; i++) {
scanf("%d", &in);
sumall += in;
if (i == h - 1) {
sumsame = in - 1;
} else {
sumother += in;
}
}
if (sumall < n) {
printf("-1.0\n");
return 0;
}
if (sumsame == 0) {
printf("0.0\n");
return 0;
} else {
if (sumall == n) {
printf("1.0\n");
return 0;
}
}
double sol = 1;
int p = sumother, q = sumall - 1;
for (int i = 0; i < n - 1; i++) {
sol *= ((double)p / (double)q);
p--;
q--;
}
printf("%.9lf\n", (double)1.0 - sol);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010, Mo = 998244353;
int g[N];
inline int Pow(int x, int y) {
int ret = 1;
while (y) {
if (y & 1) ret = 1LL * ret * x % Mo;
x = 1LL * x * x % Mo, y >>= 1;
}
return ret;
}
int main() {
int n, ans = 0;
cin >> n;
g[0] = 1;
for (int i = 1; i <= n; i++)
g[i] = 1LL * g[i - 1] * Pow(i, Mo - 2) % Mo * (n - i + 1) % Mo;
for (int i = 1, t = 1; i <= n; i++, t = -t)
ans = (ans + 1LL * t * g[i] * Pow(3, (1LL * n * (n - i) + i) % (Mo - 1))) %
Mo;
for (int i = 1, t = 1; i <= n; i++, t = -t)
ans = (ans + 1LL * t * g[i] *
(3LL * Pow(Pow(3, n - i) - 1, n) +
1LL * (Pow(3, i) - 3) *
Pow(3, 1LL * (n - i) * n % (Mo - 1)) % Mo)) %
Mo;
cout << (ans + Mo) % Mo;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100050;
stack<char> s;
char str[maxn];
int main() {
int i, j, len;
gets(str);
len = strlen(str);
if (len % 2) {
printf("NO\n");
return 0;
}
s.push(str[0]);
for (i = 1; i < len; i++) {
if (s.empty() || s.top() != str[i])
s.push(str[i]);
else if (s.top() == str[i])
s.pop();
}
if (s.empty())
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize("unroll-loops")
using namespace std;
//using namespace __gnu_pbds;
#define pb push_back
#define F first
#define S second
#define ll long long
#define ld double long
#define ull unsigned long long
//#define endl '\n'
const ll N = 3e5 + 36;
const ll M = 1e3 + 36;
const ll INF = 1e18 + 7;
const ll MOD = 1e9 + 7;
const ll MOD1 = 888888901;
const ll MOD2 = 999988901;
const ll X[8] = {1, -1, 2, 2, -2, -2, 1, -1};
const ll Y[8] = {2, 2, 1, -1, 1, -1, -2, -2};
const ld PI = 3.14159265358979323846;
const ld EPS = 1e-10;
//tree < pair < string, int >, null_type, less < pair < string, int > >, rb_tree_tag, tree_order_statistics_node_update > a;
//mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
mt19937 gen(991281);
ll a[N];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif // LOCAL
int t;
cin >> t;
while (t--){
string s;
cin >> s;
bool f = 0;
for (int i(0); i < 8; ++i){
string now = "";
for (int j(0); j < int(s.size()); ++j){
if (i & (1 << int(s[j] - 'A'))){
now += '(';
} else {
now += ')';
}
}
int sum = 0;
for (int j(0); j < int(s.size()); ++j){
if (now[j] == '('){
++sum;
} else {
--sum;
}
if (sum < 0){
break;
}
}
if (sum == 0){
f = 1;
break;
}
}
if (f){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| 7 | CPP |
n = int(input())
bills = 0
def count(n,b):
if n>=100:
b += n//100
n = n%100
return (count(n,b))
elif n>=20:
b += n//20
n = n%20
return (count(n,b))
elif n>=10:
b += n//10
n = n%10
return (count(n,b))
elif n>=5:
b += n//5
n = n%5
return (count(n,b))
elif n>=1:
b += n
n =0
return (count(n,b))
else:
return b
print(count(n,bills))
| 7 | PYTHON3 |
def func(s, pat1, pat2):
if len(s) < 4:
return False
i1 = s.find(pat1)
i2 = s.rfind(pat2)
if i1 == -1 or i2 == -1:
return False
if max(i1 - i2, i2 - i1) > 1:
return True
return False
s = input()
if func(s, 'AB', 'BA') or func(s, 'BA' , 'AB'):
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int T, n, isdag[1100000], siz[1100000], maxx = 1 << 20;
int num, reach[30], ans, vis[30];
string a, b;
void dfs(int u) {
vis[u] = 1;
for (int i = 0; i < 20; i++) {
if (((reach[u] & (1 << i)) || (reach[i] & (1 << u))) && !vis[i]) dfs(i);
}
return;
}
int main() {
for (int i = 0; i < maxx; i++)
for (int j = 0; j <= 19; j++)
if ((i | (1 << j)) != i) siz[i | (1 << j)] = siz[i] + 1;
isdag[0] = 1;
scanf("%d", &T);
while (T--) {
memset(reach, 0, sizeof(reach));
memset(vis, 0, sizeof(vis));
ans = 0;
num = 0;
scanf("%d", &n);
cin >> a >> b;
for (int i = 0; i < n; i++) reach[a[i] - 'a'] |= 1 << (b[i] - 'a');
for (int i = 0; i < 20; i++) {
if (!vis[i]) dfs(i), num++;
}
for (int i = 1; i < maxx; i++) {
if (isdag[i]) isdag[i] = 0;
for (int j = 0; j < 20; j++) {
int qwq = i ^ (1 << j);
if ((i & (1 << j))) isdag[i] |= isdag[qwq] & (!(reach[j] & qwq));
}
if (isdag[i]) ans = max(ans, siz[i]);
}
printf("%d\n", 40 - num - ans);
}
return 0;
}
| 7 | CPP |
t = int(input())
for i in range(t):
l =int(input())
c = [int(i) for i in input().split()]
o = [int(i) for i in input().split()]
cm = min(c)
om = min(o)
steps = 0
for i in range(l):
ca = c[i]-cm
oa = o[i]-om
steps+=min(ca,oa)+abs(ca-oa)
print(steps)
| 8 | PYTHON3 |
s1 = input()
s2 = input()
if(not len(s1) == len(s2)):
print("NO")
exit()
i = 0
j =len(s1)-1
while i<j+1 and s1[i] == s2[i]:
i += 1
while j>=0 and s1[j] == s2[j]:
j -= 1
s1 = list(s1)
s1[i],s1[j] = s1[j],s1[i]
if(s1 == list(s2)):
print("YES")
else:
print('NO') | 7 | PYTHON3 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)
#define MEMSET(v, h) memset((v), h, sizeof(v))
struct FenwickTree {
static const int SIZE = 500000;
int tree[SIZE + 10];
FenwickTree() { memset(tree, 0, sizeof(tree)); }
void add(int index, int value) {
for (index += 3; index < SIZE + 1; index += (index & -index)) {
tree[index] += value;
}
}
int sum(int index) {
int ret = 0;
for (index += 3; index > 0; index -= (index & -index)) {
ret += tree[index];
}
return ret;
}
};
int q, lim;
int seq[500000];
map<int, int> mapto;
FenwickTree ftree;
int FindIndex(int index) {
int left = 0;
int right = 410000;
while (left != right) {
int mid = (left + right) / 2;
if (ftree.sum(mid) >= index) {
right = mid;
} else {
left = mid + 1;
}
}
return left;
}
int main() {
while (scanf("%d %d", &q, &lim), q|lim) {
ftree = FenwickTree();
mapto.clear();
int head = 0;
REP(i, q) {
int type, x;
scanf("%d %d", &type, &x);
if (type == 0) {
mapto[x] = head;
ftree.add(head, 1);
if (ftree.sum(head) > lim) {
int index = FindIndex(1);
//cout << "Delete:" << index << endl;
assert(ftree.sum(index) - ftree.sum(index - 1) == 1);
ftree.add(index, -1);
}
seq[head++] = x;
} else if (type == 1) {
int index = FindIndex(x);
ftree.add(index, -1);
} else if (type == 2) {
int index = FindIndex(x);
printf("%d\n", seq[index]);
} else if (type == 3) {
int index = mapto[x];
ftree.add(index, -1);
}
}
puts("end");
}
} | 0 | CPP |
n = int(input())
seq = []
for _ in range(n):
seq.append(int(input()))
# print(seq)
get = False
for i in range(2**n):
tmp = bin(i)[2:][::-1]
while len(tmp) < n:
tmp += "0"
ans = 0
for j in range(len(tmp)):
k = tmp[j]
if k == "0":
ans -= seq[j]
else:
ans += seq[j]
ans %= 360
# print(ans)
if ans == 0:
get = True
break
if get:
print("YES")
else:
print("NO")
| 8 | PYTHON3 |
import bisect
n,k = map(int, input().split())
arr = list(map(int, input().split()))
v = arr[k-1]
print(sum(i>=v and i>0 for i in arr)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int t, n;
string s;
int ans[20];
int main ()
{
cin >> t;
while (t--) {
cin >> n;
if (n > 45) {
puts("-1");
} else {
int pos = 0;
for (int i = 9; i >= 1; --i) {
if (n > i) {
ans[pos++] = i;
n -= i;
} else if (n == i) {
ans[pos++] = i;
break;
}
}
for (int i = pos - 1; i >= 0; --i) {
cout << ans[i];
}
cout << endl;
}
}
return 0;
} | 9 | CPP |
import sys
H, W = map(int,input().split())
if H % 3 == 0 or W % 3 == 0:
print(0)
sys.exit()
def solve(p, q):
r = int(p / 2)
s = int(q / 3)
a, b, c = p*s, r*(q-s), (p-r)*(q-s)
ans = max(a, b, c) - min(a, b, c)
a, b, c = p*(s+1), r*(q-s-1), (p-r)*(q-s-1)
ans = min(ans, max(a, b, c) - min(a, b, c))
return ans
ans = min(W, H, solve(H, W), solve(W, H))
print(ans) | 0 | PYTHON3 |
###DO NOT KNOW THE ANSWER...I AM REALLY SAD###
query=int(input())
for _ in range(query):
n=int(input())
c3=c2=0 #Counts how many times the number can be divided by 3 and 2
#n=2**c2*3**c3
#if needs to be made c3=0; n=2**(c2-c3)*3**0
while(n%3==0):
n//=3
c3+=1
while(n%2==0):
n//=2
c2+=1
if c2>c3: #if c2>c3 then there will be no 6 left to divide, only 2 can be mutiplied, if c2>c3 division by 2 is implied
print(-1)
elif n!=1: #if not n==1
print(-1)
else:
print(c3+(c3-c2)) #c3-c2 means how many times 2 is to be multiplied
# Video ref: https://www.youtube.com/watch?v=ekxYAYio9Xg
#Video 2: https://www.youtube.com/watch?v=sPl79SlXwRc | 8 | PYTHON3 |
Subsets and Splits