solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr1[n], arr2[n], cnt[6];
int inp;
for (int i = 1; i <= 5; i++) cnt[i] = 0;
for (int i = 0; i < n; i++) {
cin >> arr1[i];
cnt[arr1[i]]++;
}
for (int i = 0; i < n; i++) {
cin >> arr2[i];
cnt[arr2[i]]++;
}
int flag = 0;
for (int i = 1; i <= 5; i++) {
if ((cnt[i] % 2) != 0) {
flag = 1;
break;
}
}
if (flag == 1) {
cout << -1 << endl;
} else {
for (int i = 1; i <= 5; i++) cnt[i] = cnt[i] / 2;
int result = 0, cnt1[6];
for (int i = 1; i <= 5; i++) {
cnt1[i] = 0;
}
for (int i = 0; i < n; i++) {
cnt1[arr1[i]]++;
}
for (int i = 1; i <= 5; i++) {
if (cnt1[i] < cnt[i]) {
result += cnt[i] - cnt1[i];
}
}
cout << result << endl;
}
return 0;
}
| 7 | CPP |
a = []
for i in range(int(input())):
a.append(int(input()))
for i in a:
print((i-1)//2) | 7 | PYTHON3 |
w = int(input(""))
if w == 2:
print("NO")
else:
if w % 2 == 0:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N = 1000000007;
vector<vector<long long>> binom(5001, vector<long long>(5001));
void find_binom() {
for (int i = 0; i < binom.size(); ++i) {
for (int j = 0; j < binom[1].size(); ++j) {
if (j <= i) {
if (j == 0 || j == i) {
binom[i][j] = 1;
} else {
binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
binom[i][j] %= N;
}
}
}
}
}
int main() {
find_binom();
int n;
cin >> n;
string sl;
cin >> sl;
vector<vector<long long>> dt(30, vector<long long>(n));
for (int i = 0; i < n; ++i) {
int l = sl[i] - 'a';
for (int j = 0; j <= i; ++j) {
if (j == 0) {
dt[l][j] = 1;
} else {
dt[l][j] = 0;
for (int k = 0; k < 30; ++k) {
if (k != l) {
dt[l][j] += dt[k][j - 1];
}
}
}
dt[l][j] %= N;
}
}
long long res = 0;
for (int i = 0; i < 30; ++i) {
for (int j = 0; j < n; ++j) {
if (dt[i][j] > 0) {
res += dt[i][j] * binom[n - 1][j];
res %= N;
}
}
}
cout << res << "\n";
return 0;
}
| 10 | CPP |
n=int(input())
s=input()
ans=0
for i in range(1,n):
if(s[i-1]=='S' and s[i]=='F'):
ans+=1
if(s[i-1]=='F' and s[i]=='S'):
ans-=1
if(ans>0):
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
a , b = [ int(i) for i in input().split() ]
total = a + a // b
x = (a // b) + (a % b)
while (x >= b) :
if x == 1 :
break
y = x % b
x = x // b
total += x
x += y
print(total)
| 7 | PYTHON3 |
t=int(input())
for nbt in range(t):
n,k=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
nbc=len(set(a))-1
if k==1:
if nbc:
print(-1)
else:
print(1)
else:
print(1+max(0,(nbc-1)//(k-1))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char ch;
cin >> ch;
char s[110], s1[110];
cin >> s;
char c[] = {'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p',
'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';',
'z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/'};
if (ch == 'R') {
for (int i = 0; i < strlen(s); i++) {
for (int j = 0; j < 30; j++) {
if (s[i] == c[j]) {
s[i] = c[j - 1];
break;
}
}
}
} else if (ch == 'L') {
for (int i = 0; i < strlen(s); ++i) {
for (int j = 0; j < 30; ++j) {
if (s[i] == c[j]) {
s[i] = c[j + 1];
break;
}
}
}
}
cout << s;
return 0;
}
| 7 | CPP |
s=list(input())
p=[]
p=p+s
s.sort()
a=p.count('a')
b=p.count('b')
c=p.count('c')
if 'a' in p and 'b' in p and 'c' in p:
if (c==a or c==b ) and p==s:
print('YES')
else:
print('NO')
else:
print('NO') | 7 | PYTHON3 |
n,s=map(int,input().split())
ans=-1
for i in range(n):
x,y=map(int,input().split())
if x+y/100<=s:
ans=max(ans,[100-y, y][y==0])
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[1000005], b[1000005];
int n, i;
int c[1000005];
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
int cnt = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &b[i]);
if (a[i] != b[i]) cnt++;
}
if (cnt == 1) {
int p = 0;
for (i = 1; i <= n; i++) {
if (a[i] != b[i]) {
p = i;
}
}
memset(c, 0, sizeof(c));
for (i = 1; i <= n; i++)
if (i != p) c[a[i]]++;
for (i = 1; i <= n; i++)
if (c[i] == 0) a[p] = i;
for (i = 1; i <= n; i++) printf("%d ", a[i]);
} else {
int p1 = 0, p2 = 0;
int a1 = 0, b1 = 0, a2 = 0, b2 = 0;
int np1 = 0, np2 = 0;
for (i = 1; i <= n; i++)
if (a[i] != b[i]) {
if (!p1)
p1 = i, a1 = a[i], b1 = b[i];
else
p2 = i, a2 = a[i], b2 = b[i];
}
memset(c, 0, sizeof(c));
for (i = 1; i <= n; i++)
if (i != p1 && i != p2) c[a[i]]++;
for (i = 1; i <= n; i++)
if (c[i] == 0) {
if (!np1)
np1 = i;
else
np2 = i;
}
if ((np1 == a1 && np2 == b2) || (np1 == b1 && np2 == a2))
a[p1] = np1, a[p2] = np2;
else
a[p2] = np1, a[p1] = np2;
for (i = 1; i <= n; i++) printf("%d ", a[i]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[200005];
vector<int> g[200005];
int dis1[200005], dis2[200005];
bool vis[200005];
pair<int, int> A[200005];
int pmax[200005], smax[200005];
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= k; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
queue<int> q;
q.push(1);
dis1[1] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : g[u])
if (!dis1[v]) dis1[v] = dis1[u] + 1, q.push(v);
}
q.push(n);
dis2[n] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : g[u])
if (!dis2[v]) dis2[v] = dis2[u] + 1, q.push(v);
}
for (int i = 1; i <= n; ++i) dis1[i]--, dis2[i]--;
for (int i = 1; i <= k; ++i) A[i] = make_pair(dis2[a[i]] - dis1[a[i]], a[i]);
sort(A + 1, A + k + 1);
for (int i = 1; i <= k; ++i) pmax[i] = max(pmax[i - 1], dis2[A[i].second]);
for (int i = k; i >= 1; --i) smax[i] = max(smax[i + 1], dis1[A[i].second]);
int ans = 0;
for (int i = 1; i <= k; ++i) {
if (i > 1) ans = max(ans, dis1[A[i].second] + pmax[i - 1] + 1);
if (i < k) ans = max(ans, dis2[A[i].second] + smax[i + 1] + 1);
}
ans = min(ans, dis1[n]);
printf("%d\n", ans);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
void chmin(int &x, int y) {
x = min(x, y);
}
int popcount(int x) {
int res = 0;
while (x > 0) {
res++;
x &= x - 1;
}
return res;
}
int main() {
int N; cin >> N;
vector<int> A(N); rep(i, N) cin >> A[i];
vector<int> B(N); rep(i, N) cin >> B[i];
vector<vector<int>> dp(1 << N, vector<int>(N, INT_MAX));
dp[0][0] = 0;
auto f = [&](int i, int j) {
return abs(j - i) % 2 == 0 ? A[i] : B[i];
};
rep(i, 1 << N) rep(j, N) if (dp[i][j] != INT_MAX) {
int pos = popcount(i);
rep(k, N) if (~i >> k & 1) {
int cost = 0;
rep(l, N) if ((i >> l & 1) and k < l) cost++;
if (i == 0 or f(j, pos - 1) <= f(k, pos)) {
chmin(dp[i | 1 << k][k], dp[i][j] + cost);
}
}
}
int ans = INT_MAX;
rep(j, N) chmin(ans, dp[(1 << N) - 1][j]);
if (ans == INT_MAX) ans = -1;
cout << ans << endl;
} | 0 | CPP |
if __name__ == '__main__':
X = lambda: list(map(int, input().split()))
A = lambda: map(int, input().split())
B = lambda: int(input())
n = B()
a = X()
ans, mx = 0, -1
for i in range(n):
if not(a[i] <= mx + 1):
ans = i + 1
break
else:
mx = max(mx, a[i])
print(-1 if (not ans) else ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, i, key, x, len, a[111];
int main() {
scanf("%d", &n);
key = 1;
for (i = 1; i <= n; ++i) {
scanf("%d", &x);
if (x == key) a[++len] = 2000 + i, ++key;
}
printf("%d\n", len);
for (i = 1; i <= len; ++i) printf("%d ", a[i]);
printf("\n");
return 0;
}
| 8 | CPP |
from sys import stdin
class QueueNode(object):
def __init__(self,data,next=None):
self.data = data
self.next = next
class LinkList(object):
def __init__(self,head=None):
self.head = head
self.tail = head
#後ろに挿入する
def insert_q(self,data):
node = QueueNode(data)
if self.head is None:
self.head = node
self.tail = node
return
currentNode = self.tail
while True:
if currentNode.next is None:
currentNode.next = node
self.tail = node
break
currentNode = currentNode.next
#先頭を削除する
def delete_q(self):
if self.head is not None:
currentNode = self.head
self.head = currentNode.next
#先頭を表示する
def print_q(self):
if self.head is not None:
print(self.head.data)
if __name__ == '__main__':
qnum,loopnum = map(int,input().split(" "))
q = [LinkList() for i in range(qnum)]
for i in range(loopnum):
cmd = stdin.readline().strip().split()
t = int(cmd[1])
if cmd[0] == "0":
q[t].insert_q(int(cmd[2]))
elif cmd[0] == "1":
q[t].print_q()
else:
q[t].delete_q()
| 0 | PYTHON3 |
n = int(input(), 2)
rs, tmp = 0, 1
while tmp < n:
tmp *= 4
rs += 1
print(rs) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 2500000000;
const int inf = 123456789;
const double EPS = 1e-9;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
int double_cmp(double x, double y = 0, double tol = EPS) {
return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
int main() {
int d, l;
scanf("%d%d", &d, &l);
int x, y;
scanf("%d%d", &x, &y);
double res = (l - d) / (double)(x + y);
printf("%.8lf\n", res);
}
| 7 | CPP |
a=int(input())
ct=4
ans=1
for x in range(a):
ans+=ct*x
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[2100006];
long long int dprv[2100006];
long long int n;
long long int a, b;
long long int t;
long long int ans;
string s;
int main() {
ios_base::sync_with_stdio(0);
long long int i, j;
cin >> n >> a >> b >> t;
cin >> s;
for (i = 0; i < n; ++i) {
if (i > 0) dp[i] += dp[i - 1] + a;
dp[i] += (s[i] == 'w') * b;
dp[i]++;
}
for (i = 0; i < n; ++i) {
if (i > 0) dprv[i] += dprv[i - 1];
dprv[i] += a;
dprv[i] += (s[n - i - 1] == 'w') * b;
dprv[i]++;
}
for (i = 0; i < n; ++i)
if (dp[i] > t) break;
i--;
ans = i + 1;
if (ans == 0 || ans == n) {
cout << ans << endl;
return 0;
}
j = 0;
while (i >= 0 && dp[i] + a + dprv[0] > t) i--;
while (i >= 0) {
while (j < n && dp[i] + min((j + 1) * a, i * a) + dprv[j] <= t) j++;
j--;
if (i + j + 2 > ans) {
ans = i + j + 2;
}
i--;
}
cout << ans << endl;
}
| 10 | CPP |
from bisect import bisect_left
from collections import defaultdict as dd
N = int(input())
As = list(map(int, input().split()))
Es = dd(dict)
for _ in range(N-1):
f, t = map(int, input().split())
Es[f-1][t-1] = Es[t-1][f-1] = 1
INF = float('inf')
RET = 0
PROC = 1
stack = []
lismin = [INF] * N
anss = [INF] * N
visited = [False] * N
stack.append((RET, 0, INF))
stack.append((PROC, 0, 0))
while stack:
cmd, *v = stack.pop()
if cmd == RET:
i, backup = v
lismin[i] = backup
else:
node, i = v
lismin[i] = As[node]
anss[node] = bisect_left(lismin, INF)
visited[node] = True
for to in Es[node].keys():
if not visited[to]:
x = bisect_left(lismin, As[to])
stack.append((RET, x, lismin[x]))
stack.append((PROC, to, x))
for ans in anss:
print(ans)
| 0 | PYTHON3 |
from math import gcd
t, w, b = map(int, input().split())
g = gcd(w, b)
lcm = w * b // g
mn = min(w, b)
ans = mn * (t // lcm) - 1 + min(mn, t % lcm + 1)
g = gcd(ans, t)
print(str(ans // g) + "/" + str(t // g)) | 9 | PYTHON3 |
if __name__=="__main__":
present = [0 for i in range(26)]
n,k = map(int,input().split())
s = input()
k = list(map(str,input().split()))
for alp in k:
present[ord(alp)-ord("a")] = 1
len_list = list()
curr_cnt = 0
for i in range(n):
if(present[ord(s[i])-ord("a")] == 1):
curr_cnt += 1
else:
len_list.append(curr_cnt)
curr_cnt = 0
len_list.append(curr_cnt)
tot = 0
for val in len_list:
tot += (val*(val+1))//2
print (tot) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
int n;
double p, q;
double x[100005], y[100005];
double f(double a) {
double b = 1e100;
for (int i = 1; i <= n; ++i) b = min(b, (1.0 - a * x[i]) / y[i]);
return a * p + b * q;
}
int main() {
int i, j;
scanf("%d%lf%lf", &n, &p, &q);
for (i = 1; i <= n; ++i) scanf("%lf%lf", x + i, y + i);
double l = 0, r, m1, m2;
r = 1e100;
for (i = 1; i <= n; ++i) r = min(r, 1.0 / x[i]);
for (i = 1; i <= 50; ++i) {
m1 = (l + r) * 0.5;
m2 = (m1 + r) * 0.5;
if (f(m1) < f(m2))
l = m1;
else
r = m2;
}
printf("%.10lf\n", f(l));
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1, x2, y1, y2;
int x, y;
cin >> x1 >> y1 >> x2 >> y2 >> x >> y;
int dx = abs(x1 - x2), dy = abs(y1 - y2);
int modx = dx % x, mody = dy % y;
if (modx != 0 || mody != 0)
cout << "NO";
else {
if ((dx / x) % 2 == (dy / y) % 2)
cout << "YES";
else
cout << "NO";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum = 0, sum2 = 0, k = 0;
long long i, j;
cin >> n;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0, j = n - 1; i <= j; k++) {
if (a[i] >= a[j]) {
if (k % 2 == 0) {
sum += a[i];
} else
sum2 += a[i];
i++;
} else {
if (k % 2 == 0) {
sum += a[j];
} else
sum2 += a[j];
j--;
}
}
cout << sum << " " << sum2 << endl;
return 0;
}
| 7 | CPP |
// Problem : F - Three Variables Game
// Contest : AtCoder - AtCoder Beginner Contest 166
// URL : https://atcoder.jp/contests/abc166/tasks/abc166_f
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
int n, a[100], d[100005];
char c[100005][4];
inline void doit(int &x, int &y, bool choice) {
if (choice) --x, ++y; else ++x, --y;
}
void dfs(int x) {
if (x > n) { puts("Yes"); for (int i = 1; i <= n; ++i) putchar(c[i][d[i]]), putchar('\n'); exit(0); }
if (a[c[x][0]] != a[c[x][1]]) { d[x] = a[c[x][1]] < a[c[x][0]]; doit(a[c[x][0]], a[c[x][1]], d[x]); dfs(x + 1); }
else if (a[c[x][0]] != 0) {
d[x] = 0, ++a[c[x][0]], --a[c[x][1]];
dfs(x + 1);
d[x] = 1, --a[c[x][0]], --a[c[x][0]], ++a[c[x][1]], ++a[c[x][1]];
dfs(x + 1);
++a[c[x][0]], --a[c[x][1]];
}
}
int main() {
scanf("%d%d%d%d", &n, &a['A'], &a['B'], &a['C']);
for (int i = 1; i <= n; ++i) scanf("%s", c[i]);
dfs(1);
puts("No");
return 0;
} | 0 | CPP |
song = input().strip()
song = song.replace("144",".")
song = song.replace("14",".")
song = song.replace("1",".")
song = song.replace(".","")
if ""!=song:
print("NO")
else:
print("YES")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
int main() {
int n, m;
cin >> n >> m;
set<int> distances;
while (n--) {
string s;
cin >> s;
int dwarf_index = 0;
for (; dwarf_index < m; dwarf_index++) {
if (s[dwarf_index] == 'G') {
break;
}
}
int candy_index = dwarf_index + 1;
for (; candy_index < m; candy_index++) {
if (s[candy_index] == 'S') {
break;
}
}
if (candy_index == m) {
cout << -1;
return 0;
}
distances.insert(candy_index - dwarf_index);
}
cout << distances.size();
return 0;
}
| 8 | CPP |
n = int(input())
count = 0
count += n//100
n -= 100*(n//100)
count += n//20
n -= 20*(n//20)
count += n//10
n -= 10*(n//10)
count += n//5
n -= 5*(n//5)
count += n//1
n -= 1*(n//1)
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long n, m;
cin >> n >> m;
vector<vector<long long>> adj((size_t)n);
vector<pair<long long, long long>> all_edges;
vector<vector<long long>> edges_indexes((size_t)n,
vector<long long>((size_t)n, -1));
for (long long i = 0; i < m; i++) {
long long u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
adj[v].push_back(u);
edges_indexes[u][v] = all_edges.size();
edges_indexes[v][u] = all_edges.size();
all_edges.emplace_back(min(u, v), max(u, v));
}
vector<vector<vector<long long>>> a(
(size_t)n, vector<vector<long long>>(
(size_t)n, vector<long long>((size_t)1 << n, -2)));
auto restore_path = [&](long long x, long long y, long long add_mask) {
vector<long long> path;
y = a[x][y][add_mask], add_mask &= ~(1 << y);
for (; y >= 0; y = a[x][y][add_mask], add_mask &= ~(1 << y)) {
path.push_back(y);
}
reverse(path.begin(), path.end());
return path;
};
auto edge_shift = [&](long long edge_index) {
return edge_index < 64
? pair<long long, long long>{0, (long long)1 << edge_index}
: pair<long long, long long>{(long long)1 << (edge_index - 64),
0};
};
auto edges_or = [&](pair<long long, long long> x,
pair<long long, long long> y) {
return pair<long long, long long>{x.first | y.first, x.second | y.second};
};
auto edges_and = [&](pair<long long, long long> x,
pair<long long, long long> y) {
return pair<long long, long long>{x.first & y.first, x.second & y.second};
};
auto size = [&](long long x) {
return __builtin_popcount(x) + __builtin_popcount(x >> 32);
};
auto edges_size = [&](pair<long long, long long> x) {
return size(x.first) + size(x.second);
};
auto restore_edges = [&](long long x, long long y, long long add_mask) {
pair<long long, long long> edges;
vector<long long> path = restore_path(x, y, add_mask);
for (long long i = 0; i <= path.size(); i++) {
edges = edges_or(
edges, edge_shift(edges_indexes[i == 0 ? x : path[i - 1]]
[i == path.size() ? y : path[i]]));
}
return edges;
};
for (long long u = 0; u < n; u++) {
for (long long v : adj[u]) {
a[u][v][0] = -1;
}
}
for (long long add_mask = 0; add_mask < 1 << n; add_mask++) {
for (long long x = 0; x < n; x++) {
for (long long y = 0; y < n; y++) {
if ((add_mask & (1 << y)) == 0 && a[x][y][add_mask] != -2) {
pair<long long, long long> edges = restore_edges(x, y, add_mask);
for (long long z : adj[y]) {
if (edges_and(edges, edge_shift(edges_indexes[y][z])) ==
pair<long long, long long>{0, 0}) {
a[x][z][add_mask | (1 << y)] = y;
}
}
}
}
}
}
vector<pair<long long, long long>> b((size_t)1 << n, {-1, -1});
b[1] = {0, 0};
for (int mask = 0; mask < 1 << n; mask++) {
if (b[mask] != pair<long long, long long>{-1, -1}) {
for (int add_mask = mask ^ ((1 << n) - 1); add_mask > 0;
add_mask = (add_mask - 1) & (mask ^ ((1 << n) - 1))) {
if (edges_size(b[mask]) + size(add_mask) <
edges_size(b[mask | add_mask])) {
for (long long x = 0; x < n; x++) {
for (long long y = 0; y < n; y++) {
if ((mask & (1 << x)) != 0 && (mask & (1 << y)) != 0) {
if (a[x][y][add_mask] != -2 &&
edges_size(b[mask]) +
edges_size(restore_edges(x, y, add_mask)) <
edges_size(b[mask | add_mask])) {
b[mask | add_mask] =
edges_or(b[mask], restore_edges(x, y, add_mask));
}
}
}
}
}
}
}
}
cout << edges_size(b[(1 << n) - 1]) << endl;
for (long long i = 0; i < all_edges.size(); i++) {
if (edges_and(b[(1 << n) - 1], edge_shift(i)) !=
pair<long long, long long>{0, 0}) {
cout << all_edges[i].first + 1 << " " << all_edges[i].second + 1 << endl;
}
}
return 0;
}
| 12 | CPP |
n = int(input())
for i in range(n):
w = str(input())
if len(w) > 10:
print(w[0]+str(len(w)-2)+w[len(w)-1])
else:
print(w) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
vector<vector<int> > vec(100005);
map<int, int> mp;
bool vis[100005];
void flag(int node) {
if (vis[node]) return;
vis[node] = 1;
if (mp[node] == 1) {
if (vec[node].size())
for (long long c = 0; c < vec[node].size(); c++) {
if (mp[vec[node][c]] == 2) continue;
mp[vec[node][c]] = 2;
flag(vec[node][c]);
}
} else if (mp[node] == 2) {
if (vec[node].size())
for (long long c = 0; c < vec[node].size(); c++) {
if (mp[vec[node][c]] == 1) continue;
mp[vec[node][c]] = 1;
flag(vec[node][c]);
}
}
}
int main() {
int n;
cin >> n;
int x[n], z[n];
for (long long c = 0; c < n - 1; c++) {
cin >> x[c] >> z[c];
vec[x[c]].push_back(z[c]);
vec[z[c]].push_back(x[c]);
}
mp[x[0]] = 1;
flag(x[0]);
set<int> se1, se2;
vector<int> vec1, vec2;
for (long long c = 0; c < n + 1; c++) {
if (mp[c] == 1) {
se1.insert(c);
vec1.push_back(c);
} else if (mp[c] == 2)
se2.insert(c);
}
unsigned long long ans = 0, num;
for (long long c = 0; c < vec1.size(); c++) {
num = vec1[c];
if (vec[num].size() < se2.size()) {
ans += se2.size() - vec[num].size();
}
}
cout << ans << "\n";
return 0;
}
| 8 | CPP |
n,c = (int(i) for i in input().split())
a = []
a = [int(i) for i in input().split()]
s,m = 0,0
temp = a[0]
for i in range(len(a)):
m = a[i] - temp
if (m<=c):
s+=1
else:
s = 0
temp = a[i]
if (n!=1 and a[n-1]-a[n-2]<=c and s!=n):
s+=1
if (s!= 0):
print(s)
else:
print(1) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define N 1000000000
typedef long long int ll;
ll gcd(ll a,ll b){
if(b==0)return a;
else return gcd(b,a%b);
}
queue<ll> q;
vector<bool> prime(N+1,true);
void make(ll M){
prime[0]=prime[1]=false;
ll i;
for( i=2;i*i<=M+1;i++){
if(prime[i]){
ll j=2;
q.push(i);
while(i*j<M+1){
prime[i*j]=false;
j++;
}
}
}
/* for(;i<=M;i++){
if(prime[i])q.push(i);
}*/
return;
}
int main(){
ll a,b;
//cout<<"ok"<<endl;
cin>>a>>b;
//make(max(a,b));
//cout<<"ok"<<endl;
//cout<<b/gcd(a,b)<<endl;
ll c=b/gcd(a,b);
//cout<<c<<endl;
ll ans = 1;
ll ma = c;
for(ll i=2;i*i<=ma;i++){
if(c%i==0){
ans*=i;
while(c%i==0)c/=i;
}
}
/*while(!q.empty()){
ll d = q.front();
// cout<<d<<endl;
if(c%d==0){
while(c%d==0)c/=d;
ans*=d;
}
q.pop();
}*/
//cout<<ans<<' '<<c<<endl;
ans*=c;
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num = pow(10, 5);
int arr[num + 1];
arr[1] = INT_MAX;
for (int i = 2; i < num + 1; i++) {
long long int temp = 0;
int j = 0;
while (true) {
j++;
if (powl(i, j) > powl(10, 14)) {
break;
}
}
arr[i] = j;
}
int n;
cin >> n;
int targ[n];
for (int i = 0; i < n; i++) cin >> targ[i];
sort(targ, targ + n);
long long int mn = LONG_LONG_MAX;
for (int i = 1; i < num + 1; i++) {
if (arr[i] < n - 1) break;
long long int diff = 0;
for (int j = 0; j < n; j++) {
diff += abs(powl(i, j) - targ[j]);
}
mn = min(diff, mn);
}
cout << mn;
return 0;
}
| 8 | CPP |
import sys
sys.setrecursionlimit(100000)
n, m = [int(x) for x in sys.stdin.readline().strip().split()]
d = {i:[] for i in range(1,n+1)}
for j in range(m):
a, b = [int(x) for x in sys.stdin.readline().strip().split()]
d[a].append(b)
d[b].append(a)
trip = []
visited = [False]*(n+1)
flag = False
for i in range(1,n+1):
if not visited[i]:
stack = [i]
visited[i] = True
dis=0
pair = []
while stack:
k = stack.pop()
if len(d[k])>2:
flag = True
break
pair.append(k)
for j in d[k]:
if not visited[j]:
dis+=1
if dis>2:
flag = True
break
visited[j] = True
stack.append(j)
trip.append(pair)
if flag:
break
if flag:
break
if flag:
print(-1)
else:
pairs = []
ones = []
triplets = []
for i in trip:
l = len(i)
if l==3:
triplets.append(i)
elif l==2:
pairs.append(i)
else:
ones.append(i[0])
if len(ones)<len(pairs):
print(-1)
else:
for i in triplets:
print(i[0],i[1],i[2])
for i in range(len(pairs)):
print(ones.pop(0),pairs[i][0],pairs[i][1])
for i in range(0,len(ones),3):
print(ones[i],ones[i+1],ones[i+2]) | 8 | PYTHON3 |
from math import gcd
n = int(input())
x = list(map(int, input().split(" ")))
gcdt = gcd(x[0],x[1])
for i in range(n):
gcdt = gcd(gcdt,x[i])
print(gcdt*n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int max_tree[2000020] = {0};
void update(int i, int l, int r, int pos, int val) {
if (l == r)
max_tree[i] = val;
else {
int m = (l + r) >> 1;
if (pos <= m)
update(2 * i, l, m, pos, val);
else
update(2 * i + 1, m + 1, r, pos, val);
max_tree[i] = max(max_tree[2 * i], max_tree[2 * i + 1]);
}
}
int find(int i, int l, int r, int L, int R) {
if (l == L && r == R) return max_tree[i];
int m = (l + r) >> 1;
if (R <= m) return find(2 * i, l, m, L, R);
if (L > m) return find(2 * i + 1, m + 1, r, L, R);
return max(find(2 * i, l, m, L, m), find(2 * i + 1, m + 1, r, m + 1, R));
}
struct item {
item(int _x = 0, int _y = 0, int _z = 0) : x(_x), y(_y), z(_z){};
int x, y, z;
};
bool sortX(const item& a, const item& b) {
return a.x < b.x || a.x == b.x && a.y < b.y ||
a.x == b.x && a.y == b.y && a.z < b.z;
}
bool sortY(const item& a, const item& b) {
return a.y < b.y || a.y == b.y && a.x < b.x ||
a.x == b.x && a.y == b.y && a.z < b.z;
}
bool sortZ(const item& a, const item& b) {
return a.z < b.z || a.z == b.z && a.y < b.y ||
a.z == b.z && a.y == b.y && a.x < b.x;
}
item v[500002];
int main() {
int n;
scanf("%d", &n);
memset(max_tree, 0, sizeof(max_tree));
for (int i = 0; i < n; i++) scanf("%d", &v[i].x);
for (int i = 0; i < n; i++) scanf("%d", &v[i].y);
for (int i = 0; i < n; i++) scanf("%d", &v[i].z);
sort(v, v + n, sortZ);
int cur = 1, last = v[0].z;
v[0].z = cur;
for (int i = 1; i < n; i++) {
if (last != v[i].z) cur++;
last = v[i].z;
v[i].z = cur;
}
sort(v, v + n, sortY);
cur = 1, last = v[0].y;
v[0].y = cur;
for (int i = 1; i < n; i++) {
if (last != v[i].y) cur++;
last = v[i].y;
v[i].y = cur;
}
sort(v, v + n, sortX);
cur = 1, last = v[0].x;
v[0].x = cur;
for (int i = 1; i < n; i++) {
if (last != v[i].x) cur++;
last = v[i].x;
v[i].x = cur;
}
int cnt = 0, lx = v[n - 1].x;
for (int i = n - 1; i >= 0; i--) {
if (v[i].x != lx) {
for (int j = i + 1; j < n; j++) {
if (v[j].x != lx) break;
int cval = find(1, 0, 500002, v[j].y, v[j].y);
if (v[j].z > cval) update(1, 0, 500002, v[j].y, v[j].z);
}
lx = v[i].x;
}
int val = find(1, 0, 500002, v[i].y + 1, 500002);
if (val > v[i].z) cnt++;
}
printf("%d\n", cnt);
return 0;
}
| 10 | CPP |
def mi():
return map(int, input().split())
n = int(input())
old = [0]*n
new = [0]*n
for i in range(n):
old[i] = input()
for i in range(n):
new[i] = input()
old.sort()
new.sort()
cnt = 0
i = 0
while i<len(old):
if old[i] in new:
del(new[new.index(old[i])])
del(old[i])
else:
i+=1
for i in range(len(old)):
old[i] = sorted(list(old[i]))
new[i] = sorted(list(new[i]))
for j in range(len(old[i])):
if old[i][j]!=new[i][j]:
cnt+=1
print (cnt) | 7 | PYTHON3 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define N 600020
const int mod=200003;
const int G=2;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
typedef vector<int> poly;
int g[N],n,id[N],lim,cnt[N],tr[N];
ll ans;
void init(){
int now=1;
for(int i=0;i<mod-1;++i){
g[i]=now;
id[now]=i;
now=now*G%mod;
}
}
struct Complex{
double x,y;
Complex(double _x,double _y){x=_x,y=_y;} Complex(){x=y=0;}
Complex operator +(Complex b){
return Complex(x+b.x,y+b.y);
}
Complex operator -(Complex b){
return Complex(x-b.x,y-b.y);
}
Complex operator *(Complex b){
return Complex(x*b.x-y*b.y,x*b.y+y*b.x);
}
}f[N<<1];
void FFT(Complex *f,int flag,int n){
for(int i=0;i<n;i++){
if(i<tr[i])swap(f[i],f[tr[i]]);
}
for(int p=2;p<=n;p<<=1){
int len=(p>>1);
Complex wn(cos(2*PI/p),sin(2*PI/p));
if(!flag)wn.y*=-1;
for(int k=0;k<n;k+=p){
Complex buf(1,0);
for(int i=k;i<k+len;i++){
Complex tmp=buf*f[len+i];
f[len+i]=f[i]-tmp;
f[i]=f[i]+tmp;
buf=buf*wn;
}
}
}
}
int main(){
n=read();
init();
for(int i=1;i<=n;++i){
int x=read();
if(!x)continue;
++cnt[x];
}
for(int i=1;i<mod;++i){
f[id[i]].x=cnt[i];
}
lim=1;
while(lim<mod<<1)lim<<=1;
for(int i=0;i<lim;i++){
tr[i]=((tr[i>>1]>>1)|((i&1)?lim>>1:0));
}
FFT(f,1,lim);
for(int i=0;i<lim;++i){
f[i]=f[i]*f[i];
}
FFT(f,0,lim);
for(int i=0;i<mod<<1;++i){
ans+=(ll)(f[i].x/lim+0.49)*g[i%(mod-1)];
}
for(int i=1;i<mod;++i){
ans-=cnt[i]*(1LL*i*i%mod);
}
ans/=2;
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
int counter = 0;
for (int i = 0; i < n; i++) {
cin >> x;
int ccounter = 0;
for (int j = 1; j <= int(sqrt(x)); j++) {
if (x%j == 0) { ccounter++; }
}
if (ccounter == 1) { counter++; }
}
cout << counter << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, cnt1[3], cnt0[3], nxt[500010];
char s1[5000010], s2[5000010];
inline void getnext() {
int j = 0;
nxt[1] = 0;
for (int i = 2; i <= m; ++i) {
while (j && s2[j + 1] != s2[i]) j = nxt[j];
if (s2[j + 1] == s2[i]) ++j;
nxt[i] = j;
}
}
int main() {
scanf("%s", s1 + 1);
scanf("%s", s2 + 1);
n = strlen(s1 + 1);
m = strlen(s2 + 1);
getnext();
for (int i = 1; i <= n; ++i) {
if (s1[i] == '1')
cnt1[1]++;
else
cnt0[1]++;
}
for (int i = 1; i <= m; ++i) {
if (s2[i] == '1')
cnt1[2]++;
else
cnt0[2]++;
}
int ji = 0;
if (cnt1[2] != 0 && cnt0[2] != 0)
ji = min(cnt1[1] / cnt1[2], cnt0[1] / cnt0[2]);
else if (cnt1[2] == 0)
ji = cnt0[1] / cnt0[2];
else
ji = cnt1[1] / cnt1[2];
if (ji >= 1) {
cout << s2 + 1;
cnt1[1] -= cnt1[2];
cnt0[1] -= cnt0[2];
}
int gg = ji, qwq = nxt[m];
if (ji >= 1) {
while (1) {
int pd = 0;
for (int i = qwq + 1; i <= m; ++i) {
if (s2[i] == '1') {
if (cnt1[1] > 0) {
--cnt1[1];
printf("1");
} else {
pd = 1;
break;
}
} else {
if (cnt0[1] > 0) {
--cnt0[1];
printf("0");
} else {
pd = 1;
break;
}
}
}
if (pd) break;
}
}
for (int i = 1; i <= cnt1[1]; ++i) printf("1");
for (int i = 1; i <= cnt0[1]; ++i) printf("0");
printf("\n");
return 0;
}
| 10 | CPP |
S = input()
X = []
for i in range(len(S)-2):
X.append(abs(int(S[i:i+3])-753))
print(min(X)) | 0 | PYTHON3 |
x=int(input())
c=0
i=1
while i<=x:
if i%2==0:
if x%i==0:
c+=1
i+=1
if c>=2:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int vis[110][110];
int vis1[110];
struct node {
int x;
int y;
} a1[100010];
int main() {
int i, j, cot, n, m, k;
char c[5];
char a[110][110];
while (~scanf("%d%d%s", &n, &m, &c)) {
k = 0;
memset(vis, 0, sizeof(vis));
memset(vis1, 0, sizeof(vis1));
for (i = 0; i < n; i++) {
scanf("%s", a[i]);
for (j = 0; j < m; j++) {
if (a[i][j] == c[0]) {
a1[k].x = i;
a1[k].y = j;
vis[i][j] = 1;
vis1[a[i][j] - '0'] = 1;
k++;
}
}
}
cot = 0;
for (int k1 = 0; k1 < k; k1++) {
i = a1[k1].x;
j = a1[k1].y;
if (a[i + 1][j] != '.' && !vis1[a[i + 1][j] - '0'] && i + 1 < n) {
cot++;
vis1[a[i + 1][j] - '0'] = 1;
}
if (a[i - 1][j] != '.' && !vis1[a[i - 1][j] - '0'] && i - 1 >= 0) {
cot++;
vis1[a[i - 1][j] - '0'] = 1;
}
if (a[i][j + 1] != '.' && !vis1[a[i][j + 1] - '0'] && j + 1 < m) {
cot++;
vis1[a[i][j + 1] - '0'] = 1;
}
if (a[i][j - 1] != '.' && !vis1[a[i][j - 1] - '0'] && j - 1 >= 0) {
cot++;
vis1[a[i][j - 1] - '0'] = 1;
}
}
printf("%d\n", cot);
}
return 0;
}
| 8 | CPP |
sum = int(input().strip())
counter = 0
countertext = []
for i in range(sum):
code = input()
if code == "++X" or code == "X++":
counter += 1
else:
counter -= 1
print(counter) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int s, a, b, c;
cin >> s >> a >> b >> c;
long long int p = (s / c);
long long int q = (p / a) * b;
long long int ans = p + q;
cout << ans;
cout << endl;
}
}
| 7 | CPP |
n = int(input())
a = [int(i) for i in input().strip().split(' ')]
b = [int(i) for i in input().strip().split(' ')]
assert len(a) == len(b) == n
A = [0]*5
B = [0]*5
for i in range(n):
A[a[i]-1] = A[a[i]-1] + 1
B[b[i]-1] = B[b[i]-1] + 1
atob = 0
btoa = 0
badInput = False
for i in range(5):
if (A[i]+B[i])%2 != 0:
badInput = True
break
if A[i] >= B[i]:
atob = atob + (A[i]-B[i])//2
else:
btoa = btoa + (B[i]-A[i])//2
if badInput:
print(-1)
else:
assert btoa == atob
print(atob)
| 7 | PYTHON3 |
s=input()
n=len(s)//2
print("No"if s!=s[::-1]or s[:n]!=s[-n:]else"Yes") | 0 | PYTHON3 |
#include <bits/stdc++.h>
inline int gi() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
double e[310][3010], f[310][3010], F[3010], delta[3010];
int main() {
int n = gi(), m = gi();
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) e[j][i] = gi() / 1000.0;
for (int i = 1; i <= m; ++i) {
f[i][0] = 1;
for (int j = 1; j <= n; ++j) f[i][j] = f[i][j - 1] * (1 - e[i][j]);
delta[i] = 1 - f[i][n];
}
double ans = 0;
for (int yyb = 1; yyb <= n; ++yyb) {
int t = 0;
for (int i = 1; i <= m; ++i)
if (delta[i] > delta[t]) t = i;
ans += delta[t];
for (int j = 0; j <= n; ++j) F[j] = f[t][j];
f[t][0] = 0;
for (int j = 1; j <= n; ++j)
f[t][j] = f[t][j - 1] * (1 - e[t][j]) + F[j - 1] * e[t][j];
delta[t] -= f[t][n];
}
printf("%.12lf\n", ans);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
const int MOD = 1000000007;
int n, m, q;
char s[14];
int f[(1 << 12) + 10][(1 << 12) + 10], w[13], freq[(1 << 12) + 10];
int v[(1 << 12) + 10][100 * 14];
int main() {
cin >> n >> m >> q;
for (int i = 0; i < n; ++i) {
scanf("%d", &w[i]);
}
for (int i = 0; i < m; ++i) {
scanf("%s", s);
int val = 0;
for (int j = 0; j < n; ++j) {
val += (s[j] - '0') * (1 << j);
}
freq[val]++;
}
for (int msk = 0; msk < (1 << n); ++msk) {
for (int go = 0; go < (1 << n); ++go) {
for (int bit = 0; bit < n; ++bit) {
f[msk][go] += (((go & (1 << bit)) == (msk & (1 << bit))) * w[bit]);
}
}
}
for (int msk = 0; msk < (1 << n); ++msk) {
for (int go = 0; go < (1 << n); ++go) {
v[msk][f[msk][go]] += freq[go];
}
for (int j = 1; j <= 1300; ++j) {
v[msk][j] += v[msk][j - 1];
}
}
for (int k, i = 0; i < q; ++i) {
scanf("%s%d", s, &k);
int cur = 0;
for (int j = 0; j < n; ++j) {
cur += (1 << j) * (s[j] - '0');
}
printf("%d\n", v[cur][k]);
}
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define li long int
#define lli long long int
#define ld long double
void solve(){
li n;
cin>>n;
string s;
cin>>s;
if(s[n-4]=='2'&&s[n-3]=='0'&&s[n-2]=='2'&&s[n-1]=='0'){
cout<<"YES\n";
return;
}
if(s[0]=='2'&&s[n-3]=='0'&&s[n-2]=='2'&&s[n-1]=='0'){
cout<<"YES\n";
return;
}
if(s[0]=='2'&&s[1]=='0'&&s[n-2]=='2'&&s[n-1]=='0'){
cout<<"YES\n";
return;
}
if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[n-1]=='0'){
cout<<"YES\n";
return;
}
if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[3]=='0'){
cout<<"YES\n";
return;
}
else cout<<"NO\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
li t;
cin>>t;
while(t--){
solve();
}
return 0;
} | 8 | CPP |
def max_subarray(A):
max_ending_here = max_so_far = A[0]
for x in A[1:]:
max_ending_here = max(x, max_ending_here + x)
max_so_far = max(max_so_far, max_ending_here)
return max_so_far
n = int(input())
a = [int(v) for v in input().split()]
b = [abs(a[i]-a[i+1])*(-1)**i for i in range(n-1)]
print(max(max_subarray(b), max_subarray([-v for v in b])))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long i, j = 0, kk;
long long n;
cin >> n;
vector<long long> v(n);
for (i = 0; i < n; i++) cin >> v[i];
set<long long> s;
for (i = 0; i < n; i++) {
if (v[i] == -1) {
if (i != 0 && v[i - 1] != -1) s.insert(v[i - 1]);
if (i != n - 1 && v[i + 1] != -1) s.insert(v[i + 1]);
} else if (i != 0 && v[i - 1] != -1) {
j = max(j, abs(v[i] - v[i - 1]));
}
}
if (s.size() == 0) {
cout << j << " " << 0 << endl;
} else if (s.size() == 1) {
cout << j << " " << *s.begin() << endl;
} else {
long long y, x = *s.begin();
set<long long>::iterator it;
for (it = s.begin(); it != s.end(); it++) y = *it;
x = (x + y) / 2;
cout << max(j, y - x) << " " << x << endl;
}
}
}
| 8 | CPP |
n,m = map(int,input().split())
l = list(map(int,input().split()))
count = 0
for i in range(len(l)):
if i == 0:
count+=l[i] - 1
else:
if l[i] < l[i-1]:
count+=l[i] + n - l[i-1]
elif l[i] > l[i-1]:
count+=l[i] - l[i-1]
print(count)
| 8 | PYTHON3 |
summ = input()
lst = []
for i in summ:
if i != '+':
lst.append(i)
lst.sort()
print('+'.join(lst))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fill(vector<long long> &lps, string s) {
long long n = s.size();
long long i = 1, len = 0;
while (i < n) {
if (s[i] == s[len]) {
len++;
lps[i++] = len;
} else {
if (len != 0) {
len = lps[len - 1];
} else {
lps[i++] = len;
}
}
}
}
void mymain() {
string s;
cin >> s;
long long n = s.size();
vector<long long> lps(n, 0);
fill(lps, s);
if (lps[n - 1] == 0) {
cout << "Just a legend" << '\n';
return;
}
for (long long i = 0; i < n - 1; i++) {
if (lps[i] == lps[n - 1]) {
cout << s.substr(0, lps[i]) << '\n';
return;
}
}
if (lps[lps[n - 1] - 1] != 0) {
cout << s.substr(0, lps[lps[n - 1] - 1]) << '\n';
return;
}
cout << "Just a legend" << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long t = 1;
for (long long tt = 0; tt < t; tt++) {
mymain();
}
return 0;
}
| 10 | CPP |
a = []
for _ in range(4):
s = input()
a.append((len(s[2:]),s[0]))
a.sort()
flag1 = 0
flag2 = 0
if a[0][0] <= a[1][0]//2:
flag1 =1
if a[3][0] >= a[2][0]*2:
flag2 = 1
if flag1 and flag2:
print("C")
elif flag1:
print(a[0][1])
elif flag2:
print(a[3][1])
else:
print("C") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll mxr = 5e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unordered_set<int> mov;
int n, m;
cin >> n >> m;
char ar[m];
for (int i = 0; i < n; i++) {
int dw, cn;
for (int j = 0; j < m; j++) {
cin >> ar[j];
if (ar[j] == 'G')
dw = j;
else if (ar[j] == 'S')
cn = j;
}
if (cn < dw) {
cout << -1 << "\n";
return 0;
} else {
mov.insert(cn - dw);
}
}
cout << mov.size();
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n = int(input())
print(*([2]*n))
| 7 | PYTHON3 |
for _ in range(int(input())):
n=input()
s=len(n)
li=[]
for i in n:
if int(i)*(10**(s-1))!=0:
li.append(int(i)*(10**(s-1)))
s=s-1
print(len(li))
print(*li) | 7 | PYTHON3 |
l = list(map(int, input().split()))
m = max(l)
for i in range(len(l)):
l[i] = m - l[i]
p = []
for i in l:
if i != 0:
p.append(i)
print(*p) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
cout<<max(x-2*y,0)<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) return (a + b);
if (a > b) return (gcd(a % b, b));
return (gcd(b, b % a));
}
using namespace std;
string s;
int dp[1001];
int main() {
cin >> s;
int r = 1;
for (int i = (int)(0); i < (int)(s.length()); ++i) {
dp[i] = 1;
for (int j = (int)(0); j < (int)(i); ++j)
if (s[i] == s[j] && (i - j) % 2 == 1) dp[i] = dp[j] + 1;
r = max(dp[i], r);
}
cout << r << "\n";
return 0;
}
| 8 | CPP |
import os
import sys
import math
import collections
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
def get_int(): return int(input())
def get_ints(): return map(int, input().split())
def get_strs(): return input().split()
def get_float(): return float(input())
def get_floats(): return map(float, input().split())
def list_strs(): return list(input().split())
def list_ints(): return list(map(int, input().split()))
def list_floats(): return list(map(float, input.split()))
def post(x): print(x, end=' ')
T = int(input())
for t in range(1, T+1):
a,b = get_ints()
d = abs(a-b)
d = (d+9)//10
print(d) | 7 | PYTHON3 |
n = int(input())
w = list(map(int,input().strip().split()))[:n]
freq= {}
for i in w:
freq[i] = w.count(i)
key = 1
if key in freq.keys():
print("hard")
else:
print("easy")
| 7 | PYTHON3 |
n=int(input())
s=input()
l=len(s)
count1=0
count2=0
for i in range(l):
if s[i]=="A":
count1+=1
if s[i]=="D":
count2+=1
if (count1>count2):
print("Anton")
elif(count2>count1):
print("Danik")
else:
print("Friendship")
| 7 | PYTHON3 |
n=int(input())
if n>=0:
print (n)
else:
t=n
n=abs(n)
q=abs(n%10)
w=abs(n%100//10)
if q>=w:
if n//10==0:
print('0')
else:
print (-(n//10))
else:
if n//100*10+n%10==0:
print ('0')
else:
print (-(n//100*10+n%10)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
vector<int> l;
int one = 0;
int zero = 0;
int result = 0;
int taboo = 0;
for (int j = 0; j < m; j++) {
string s;
cin >> s;
if (s.size() % 2 != 0) {
result++;
taboo += s.size();
continue;
}
l.push_back(s.size());
for (int k = 0; k < s.size(); k++) {
if (s[k] == '0')
zero++;
else
one++;
}
}
sort(l.begin(), l.end());
for (int x : l) {
int mid = int(x / 2);
if (mid % 2 != 0)
if (zero > one)
mid++;
else
mid--;
if (zero >= one) {
while (zero >= mid + 2) mid += 2;
} else {
while (one >= x - mid + 2 && mid - 2 >= 0) mid -= 2;
}
if (zero >= mid && one >= x - mid) {
zero -= mid;
one -= x - mid;
result++;
} else if (zero < mid && one < x - mid &&
taboo >= mid - zero + x - mid - one) {
taboo -= mid - zero + x - mid - one;
zero -= mid;
one -= x - mid;
result++;
} else if (zero < mid && taboo >= mid - zero) {
zero -= mid;
one -= x - mid;
taboo -= mid - zero;
result++;
} else if (one < x - mid && taboo >= x - mid - one) {
zero -= mid;
one -= x - mid;
taboo -= x - mid - one;
result++;
} else
break;
}
cout << result << endl;
}
return 0;
}
| 8 | CPP |
n,k = map(int,input().split())
a=[x for x in map(int, input().split())]
number=a[k-1]
i=0
for p in a:
if p>=number:
if p>0:
i=i+1
print(i) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int leftt[2000000];
int rightt[2000000];
int N;
long long avi[2000000], arr[2000000];
void upd(long long v, int i) {
while (i <= N + 1) {
avi[i] += v;
i += (i & -i);
}
}
long long get(int i) {
long long f = 0;
while (i > 0) {
f += avi[i];
i -= (i & -i);
}
return f;
}
int main() {
cin >> N;
int i, j, flef = 0, lrigh = 0;
for (i = 1; i <= N; i++) {
cin >> j;
upd(1, i);
if (j == 1) {
rightt[i] = flef;
flef = i;
}
arr[i] = j;
}
for (i = N; i; i--) {
if (!arr[i]) {
leftt[i] = lrigh;
lrigh = i;
}
}
long long total = 0;
long long cant1 = 0, cant2 = 0;
while (lrigh || flef) {
if (lrigh && flef) {
cant1 = get(lrigh);
cant1--;
cant2 = get(N);
cant2 -= get(flef);
if (cant1 < cant2) {
total += cant1;
upd(-1, lrigh);
lrigh = leftt[lrigh];
} else {
total += cant2;
upd(-1, flef);
flef = rightt[flef];
}
} else if (lrigh) {
cant1 = get(lrigh);
cant1--;
total += cant1;
upd(-1, lrigh);
lrigh = leftt[lrigh];
} else {
cant2 = get(N);
cant2 -= get(flef);
total += cant2;
upd(-1, flef);
flef = rightt[flef];
}
}
cout << total << endl;
return 0;
}
| 7 | CPP |
number=input()
number=(int)(number)
if (number%2==0)and(number!=2):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MN = 2e5+5;
multiset<int> arr;
int n, i, j, ans;
signed main(){
for(scanf("%lld",&n),i=1;i<=n;i++){
int x; scanf("%lld",&x);
arr.insert(x);
}
while(arr.size()){
auto it = arr.end(); it--;
int cur = *it; arr.erase(it);
for(i=0;(1LL<<i)<=cur;i++){}
int rem = (1LL<<i)-cur;
if(arr.find(rem)!=arr.end()){
ans++;
arr.erase(arr.find(rem));
}
}
printf("%lld\n",ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[100005], cnt = 0, i, j, k, t, res = 0, cnt1 = 0, cnt2 = 0;
cin >> n >> k;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) {
if (a[i] <= k) {
cnt1++;
} else {
t = a[i] / (2 * k);
if (t == 0)
cnt2++;
else {
cnt2 = cnt2 + a[i] / (2 * k);
t = a[i] % (2 * k);
if (t != 0) {
if (t <= k)
cnt1++;
else
cnt2++;
}
}
}
}
res = cnt2 + (cnt1 + 1) / 2;
cout << res;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int ans[N], cas[N], num[N], a[N][2], tmp[N], sum[N];
int main() {
int n, m;
while (scanf("%d%d", &n, &m) != EOF) {
memset(tmp, 0, sizeof(tmp));
memset(sum, 0, sizeof(sum));
memset(cas, 0, sizeof(cas));
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
if (num[i] <= n) tmp[num[i]]++;
}
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a[i][0], &a[i][1]);
}
int len = 0;
for (int i = 1; i <= n; i++) {
if (tmp[i] >= i) ans[len++] = i;
}
for (int i = 0; i < len; i++) {
int val = ans[i];
sum[0] = 0;
sum[1] = (val == num[1]);
for (int j = 2; j <= n; j++) {
sum[j] = sum[j - 1] + (num[j] == val);
}
for (int j = 1; j <= m; j++) {
int x = a[j][0], y = a[j][1];
cas[j] += (val == sum[y] - sum[x - 1]);
}
}
for (int i = 1; i <= m; i++) {
printf("%d\n", cas[i]);
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int x, y;
int main() {
cin >> x >> y;
int X = (x > 0) ? x : -x;
int Y = (y > 0) ? y : -y;
if (x > 0) {
cout << 0 << " " << (y / Y) * (X + Y) << " " << (X + Y) << " " << 0;
} else {
cout << -(X + Y) << " " << 0 << " " << 0 << " " << (y / Y) * (X + Y);
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, i;
scanf("%d", &n);
vector<pair<int, int>> A;
A.reserve(n << 1);
for (int i = 1; i < 2 * n + 1; i += 2) {
scanf("%d", &d);
A.emplace_back(d, i);
}
sort(A.begin(), A.end(), greater<pair<int, int>>());
for (i = 0; i < n - 1; ++i) {
printf("%d %d\n", A[i].second, A[i + 1].second);
printf("%d %d\n", A[i].second + 1, A[i + A[i].first - 1].second);
if (i + A[i].first == A.size()) A.emplace_back(0, A[i].second + 1);
}
printf("%d %d\n", A[i].second + 1, A[i + A[i].first - 1].second);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MaxN = 1E5 + 10;
const long long INF = 1E9 + 7;
const long long MOD = 1000 * 1000 * 1000 + 7;
vector<pair<char, long long> > v;
bool cmp(pair<char, long long> a, pair<char, long long> b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
int32_t main() {
string second;
cin >> second;
for (long long i = 0; i < second.size(); ++i)
v.push_back(pair<char, long long>(second[i], i + 1));
sort(v.begin(), v.end(), cmp);
long long last_ind = 0;
for (long long i = 0; i < v.size(); ++i)
if (v[i].second > last_ind) {
cout << v[i].first;
last_ind = v[i].second;
}
}
| 7 | CPP |
s = input()
for i in range((len(s)-1)//2*2, 0, -2):
if s[0:i//2]==s[i//2:i]:
print(i)
break | 0 | PYTHON3 |
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
string _s;
unsigned _ix;
int token;
void next() {
while (_ix < _s.size() && isspace(_s[_ix])) _ix++;
if (_ix == _s.size()) {
token = 0;
return ;
}
if (!isdigit(_s[_ix])) {
token = _s[_ix++];
}
else {
int a = 0;
while (isdigit(_s[_ix])) a = a*10+(_s[_ix++]-'0');
token = -a-1;
}
}
typedef vector<int> T;
typedef vector<pair<int, T> > E;
void dump(const E& e) {
printf("E = ");
rep (k, e.size()) {
if (k) printf("+");
printf("(%d)", e[k].first);
rep (i, 26) if (e[k].second[i]) {
printf("%c^%d", i+'a', e[k].second[i]);
}
}
printf("\n");
}
E norm(const E& e) {
map<T, int> f;
rep (i, e.size()) f[e[i].second] += e[i].first;
E n;
for (map<T, int>::iterator it = f.begin(); it != f.end(); ++it) {
if (it->second) n.push_back(mp(it->second, it->first));
}
return n;
}
T mul(T l, const T& r) {
rep (i, 26) l[i] += r[i];
return l;
}
E mul(const E& l, const E& r) {
E e;
rep (i, l.size()) rep (j, r.size()) {
e.push_back(mp(l[i].first*r[j].first, mul(l[i].second, r[j].second)));
}
return e;
}
E expr(), term(), factor();
E expr() {
// printf("expr token = %d\n", token);
E a = term();
while (token == '+' || token == '-') {
const bool neg = token == '-';
next();
E b = term();
if (neg) rep (i, b.size()) b[i].first *= -1;
rep (i, b.size()) a.push_back(b[i]);
}
return norm(a);
}
E term() {
// printf("term token = %d\n", token);
E a = factor();
while (token < 0 || isalpha(token) || token == '(') {
E b = factor();
a = mul(a, b);
}
return a;
}
E factor() {
// printf("factor token = %d\n", token);
if (token < 0) {
const int a = -token-1;
next();
E e;
e.push_back(mp(a, T(26, 0)));
return e;
}
else if (isalpha(token)) {
const int a = token-'a';
int x = 1;
next();
if (token == '^') {
next();
bool neg = false;
if (token == '-') {
neg = true;
next();
}
x = -token-1;
if (neg) x = -x;
next();
}
T t(26, 0);
t[a] = x;
E e;
e.push_back(mp(1, t));
return e;
}
else {
assert(token == '(');
next();
E e = expr();
assert(token == ')');
next();
return e;
}
}
E parse(string s) {
_s = s;
_ix = 0;
next();
return expr();
}
int main() {
string s;
for (;;) {
getline(cin, s);
if (s[0] == '.') return 0;
E my = parse(s);
// dump(my);
for (;;) {
getline(cin, s);
if (s[0] == '.') break;
E your = parse(s);
// dump(your);
puts(my == your ? "yes" : "no");
}
puts(".");
}
} | 0 | CPP |
s=input()
s=set(s)
s.remove("{")
s.remove("}")
if( " " in s):
s.remove(" ")
if "," in s:
s.remove(",")
print(len(s))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long B, W;
double dp[1010][1010];
double rec(long long w, long long b) {
if (dp[w][b] != -1) return dp[w][b];
if (b == 0 && w > 0) return dp[w][b] = 1.0;
if (w == 0) return (dp[w][b] = 0.0);
if (b == 1) {
return (dp[w][b] = (double(w) / (double(w + b))));
}
double i = w, j = b;
dp[w][b] = (i / (i + j));
double aa, bb, temp;
aa = (i / (i + j - 2)) * rec(w - 1, b - 2);
if (b - 3 >= 0)
bb = ((j - 2) / (i + j - 2)) * rec(w, b - 3);
else
bb = 0;
temp = (j / (j + i));
temp *= ((j - 1) / (i + j - 1));
temp *= (aa + bb);
dp[w][b] += temp;
return dp[w][b];
}
inline void ReadInput(void) {
scanf("%I64d", &W);
scanf("%I64d", &B);
}
inline void solve(void) { printf("%.9lf\n", rec(W, B)); }
inline void Refresh(void) {
for (int i = 0; i < 1010; i++) {
for (int j = 0; j < 1010; j++) dp[i][j] = -1;
}
}
int main() {
ReadInput();
Refresh();
solve();
return 0;
}
| 10 | CPP |
from math import ceil
n, k = map(int, input().split())
ans = 0
if k>ceil(n/2):
k = k - ceil(n/2)
ans = 2*k
else:
ans = 2*k -1
print(ans)
| 7 | PYTHON3 |
def solve(l,a,b):
x, y = l / a, l / b
print(l * y / (x + y))
l = int(input())
a = int(input())
b = int(input())
solve(l,a,b)
| 7 | PYTHON3 |
def main():
l=[int(x) for x in input().rstrip().split(' ')]
s=set()
c=0
for i in l:
if i in s:
c+=1
else:
s.add(i)
print(c)
main() | 7 | PYTHON3 |
(n,m) = [int(i) for i in input().strip().split(' ')]
s = list(input().strip())
for _ in range(m):
(l,r,c1,c2) = [i for i in input().strip().split(' ')]
for i in range(int(l)-1, int(r)):
if s[i] == c1:
s[i] = c2
print(''.join(s))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int32_t main() {
long long n, m, k, ans = 0;
cin >> n >> m >> k;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
if (x == 1 or k <= 0)
m--;
else
k--;
}
cout << abs(min((long long)0, m)) << endl;
return false;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100100;
int N, M;
int x[MAX], y[MAX];
vector<int> adj[MAX];
bool bio[MAX];
map<int, int> flow[MAX];
map<int, int> prefix[MAX];
double angle[MAX];
vector<int> input_cycle() {
int n;
scanf("%d", &n);
vector<int> v;
for (int i = 0; i < (n); ++i) {
int x;
scanf("%d", &x);
v.push_back(x);
}
long long sum = 0;
for (int i = 0; i < (n); ++i) {
long long x1 = x[v[i]];
long long y1 = y[v[i]];
long long x2 = x[v[(i + 1) % n]];
long long y2 = y[v[(i + 1) % n]];
sum += x1 * y2 - x2 * y1;
}
if (sum < 0) reverse(v.begin(), v.end());
return v;
}
int dfs(int x) {
if (bio[x]) return 0;
bio[x] = true;
int ret = 1;
for (int y : adj[x]) {
int w = dfs(y);
if (w > 0) {
ret += w;
flow[y][x] = +w;
flow[x][y] = -w;
}
}
return ret;
}
double calc_angle(int p, int q) {
int xx = x[q] - x[p];
int yy = y[q] - y[p];
return atan2(yy, xx);
}
void precompute(int p) {
vector<int> &v = adj[p];
for (int q : v) angle[q] = calc_angle(p, q);
sort(v.begin(), v.end(), [](int a, int b) { return angle[a] < angle[b]; });
int sum = 0;
for (int q : v) {
sum += flow[p][q];
prefix[p][q] = sum;
}
}
int main() {
scanf("%d%d", &N, &M);
++N;
for (int i = 0; i < (M); ++i) {
int a, b;
scanf("%d%d", &a, &b);
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i = 1; i < N; ++i) scanf("%d%d", x + i, y + i);
int left = 1;
for (int i = 1; i < N; ++i)
if (x[i] < x[left]) left = i;
x[0] = x[left] - 1;
y[0] = y[left];
adj[0].push_back(left);
adj[left].push_back(0);
dfs(0);
for (int i = 0; i < (N); ++i) precompute(i);
int Q;
scanf("%d", &Q);
for (; Q; --Q) {
vector<int> cycle = input_cycle();
int n = cycle.size();
int ret = 0;
for (int i = 0; i < (n); ++i) {
int A = cycle[i];
int B = cycle[(i + 1) % n];
int C = cycle[(i + 2) % n];
if (calc_angle(B, A) < calc_angle(B, C))
ret += prefix[B][C] - prefix[B][A] - flow[B][C];
else
ret += 1 - (prefix[B][A] - prefix[B][C] + flow[B][C]);
}
printf("%d\n", ret);
}
return 0;
}
| 11 | CPP |
n,m=map(int,input().split())
s={}
st=False
for i in range(m):
x,y=map(int,input().split())
if i==0:
xx=x
yy=y
elif st==False:
if yy not in [x,y] and xx not in [x,y]:
xx2=x
yy2=y
st=True
try:
s[x].add(i)
except:
s[x]=set([i])
try:
s[y].add(i)
except:
s[y]=set([i])
stt="NO"
k=set(list(range(0,m)))
arr=[xx,yy]
if st:
arr.extend([xx2,yy2])
for i in arr:
if len(s[i])>=m/2:
for ii in arr:
if i==ii:
continue
if len(s[ii])>=m-len(s[i]):
if s[ii].union(s[i])==k:
stt="YES"
break
print(stt)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 15;
int n, a;
string solve() {
map<int, int> m;
cin >> n;
for (int i = 0, ggdem = n; i < ggdem; i++) cin >> a, m[a]++;
for (int i = 0, ggdem = 20; i < ggdem; i++) {
if ((1 << i) == 2048) {
if (m[1 << i]) return "YES";
return "NO";
}
while (m[1 << i] > 1) {
m[1 << i] -= 2;
m[1 << (i + 1)]++;
}
}
assert(0);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q;
cin >> q;
while (q--) cout << solve() << "\n";
}
| 7 | CPP |
#########################################################################################################\
#########################################################################################################
###################################The_Apurv_Rathore#####################################################
#########################################################################################################
#########################################################################################################
import sys,os,io
from sys import stdin
from math import log, gcd, ceil
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from bisect import bisect_left , bisect_right
import math
alphabets = list('abcdefghijklmnopqrstuvwxyz')
def isPrime(x):
for i in range(2,x):
if i*i>x:
break
if (x%i==0):
return False
return True
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def primeFactors(n):
l = []
while n % 2 == 0:
l.append(2)
n = n / 2
for i in range(3,int(math.sqrt(n))+1,2):
while n % i== 0:
l.append(int(i))
n = n / i
if n > 2:
l.append(n)
return list(set(l))
def power(x, y, p) :
res = 1
x = x % p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) :
res = (res * x) % p
y = y >> 1 # y = y/2
x = (x * x) % p
return res
def SieveOfEratosthenes(n):
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
return prime
def countdig(n):
c = 0
while (n > 0):
n //= 10
c += 1
return c
def si():
return input()
def prefix_sum(arr):
r = [0] * (len(arr)+1)
for i, el in enumerate(arr):
r[i+1] = r[i] + el
return r
def divideCeil(n,x):
if (n%x==0):
return n//x
return n//x+1
def ii():
return int(input())
def li():
return list(map(int,input().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
def power_set(L):
"""
L is a list.
The function returns the power set, but as a list of lists.
"""
cardinality=len(L)
n=2 ** cardinality
powerset = []
for i in range(n):
a=bin(i)[2:]
subset=[]
for j in range(len(a)):
if a[-j-1]=='1':
subset.append(L[j])
powerset.append(subset)
#the function could stop here closing with
#return powerset
powerset_orderred=[]
for k in range(cardinality+1):
for w in powerset:
if len(w)==k:
powerset_orderred.append(w)
return powerset_orderred
def fastPlrintNextLines(a):
# 12
# 3
# 1
#like this
#a is list of strings
print('\n'.join(map(str,a)))
#__________________________TEMPLATE__________________OVER_______________________________________________________
if(os.path.exists('input.txt')):
sys.stdin = open("input.txt","r") ; sys.stdout = open("output.txt","w")
else:
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
t = 1
# t = int(input())
for _ in range(t):
n,k = li()
a = li()
mi = 100000000
mv =1000000000000000000000000000000000
for i in range(k):
if n%a[i]<mv:
mv = n%a[i]
mi = i
print(mi+1,n//a[mi])
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
long long u[3333][3333];
long long S[123456];
long long dp[123456];
int main(){
long long n;
cin >> n;
for(long long i = 0; i < n; i++){
for(long long j = 0; j < n; j++){
cin >> u[i][j];
}
}
for(long long b = 0; b < (1 << n); b++){
for(long long i = 0; i < n; i++)
for(long long j = i; j < n; j++)
if(((1<<i)& b) && ((1<<j) &b)) S[b] += u[i][j];
}
for(long long b = 1; b < (1 << n); b++){
dp[b] = S[b];
for(long long j = b &(b - 1); j; j = b&(j - 1))
dp[b] = max(dp[b], dp[b ^ j] + S[j]);
}
cout << dp[(1 << n) - 1] << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 111111, A = 11111;
int a[N], cnt[A];
int n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
long long ans = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
if (k) {
for (int i = 1; i <= n; i++) {
cnt[a[i]]++;
}
for (unsigned int i = 0; i < A; i++) {
if (!cnt[i]) continue;
for (unsigned int j = 0; j < A; j++) {
if (!cnt[j]) continue;
long long add = cnt[i] * (long long)cnt[j];
if (__builtin_popcount(i ^ j) == k) {
ans += add;
}
}
}
ans >>= 1;
} else {
for (int i = n; i >= 1; i--) {
ans += cnt[a[i]];
cnt[a[i]]++;
}
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, c[100005], used[100005];
vector<int> g[100005], a[100005], ans;
void dfs(int v) {
ans.push_back(v);
c[v] = 1;
used[v] = 1;
for (int i = 0; i < g[v].size(); i++) {
int to = g[v][i];
if (used[to]) continue;
dfs(to);
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
while (k--) {
a[i].push_back(0);
scanf("%d", &a[i].back());
}
}
for (int i = 2; i <= n; i++) {
bool fnd = 0;
for (int j = 0; j < min(a[i - 1].size(), a[i].size()); j++)
if (a[i - 1][j] != a[i][j]) {
if (a[i][j] > a[i - 1][j])
g[a[i][j]].push_back(a[i - 1][j]);
else
c[a[i - 1][j]] = 1;
fnd = 1;
break;
}
if (a[i - 1].size() > a[i].size() && fnd == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = 1; i <= m; i++)
if (!used[i] && c[i]) dfs(i);
for (int i = 1; i <= n; i++)
for (int j = 0; j < a[i].size(); j++) a[i][j] -= c[a[i][j]] * m;
for (int i = 2; i <= n; i++)
for (int j = 0; j < min(a[i - 1].size(), a[i].size()); j++) {
if (a[i][j] > a[i - 1][j]) break;
if (a[i - 1][j] > a[i][j]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
cout << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<long long> a(n), b(n);
long long mi1 = LONG_LONG_MAX, mi2 = LONG_LONG_MAX, sum = 0ll;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[(i - 1 + n) % n]) {
mi1 = min(mi1, b[(i - 1 + n) % n]);
sum += (a[i] - b[(i - 1 + n) % n]);
} else {
mi2 = min(a[i], mi2);
}
}
cout << sum + min(mi1, mi2) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
for (int i = 0; i < t; i++) {
solve();
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (1LL << 58LL);
long long F[6];
long long fortune[10] = {0, 0, 0, 1, 0, 0, 2, 0, 0, 3};
long long ten[6] = {1, 10, 100, 1000, 10000, 100000};
long long dp[1000005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int K;
int N = 999999;
cin >> K;
for (int i = 0; i <= 5; i++) cin >> F[i];
fill(dp, dp + N + 1, -inf);
dp[0] = 0;
for (int d = 0; d <= 5; d++) {
long long left = 3 * (K - 1);
long long group = 1;
while (left > 0) {
group = min(group, left);
long long value = group * F[d];
long long weight = group * ten[d] * 3;
for (int i = N; i >= weight; i--)
dp[i] = max(dp[i], dp[i - weight] + value);
left -= group;
group *= 2;
}
}
for (int d = 0; d <= 5; d++) {
for (int i = N; i >= 0; i--) {
for (int b = 1; b <= 9; b++) {
int pre = i - ten[d] * b;
if (pre < 0) break;
dp[i] = max(dp[i], dp[pre] + fortune[b] * F[d]);
}
}
}
int Q;
cin >> Q;
while (Q--) {
int n;
cin >> n;
cout << dp[n] << "\n";
}
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int T = 1; T <= t; T++) {
int n;
cin >> n;
vector<int> as;
vector<string> strings;
vector<int> done;
for (int z = 0; z < n; z++) {
int bruh;
cin >> bruh;
as.push_back(bruh);
}
strings.push_back(
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
"a");
cout << strings[0] << "\n";
for (auto a : as) {
string last = strings[strings.size() - 1];
if (last[a] == 'z') {
last[a] = 'x';
} else {
last[a] = 'z';
}
strings.push_back(last);
cout << last << "\n";
}
}
}
| 7 | CPP |
a = list(input())
b = a[:3]
print(''.join(b)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a[100005] = {0};
long long n, k;
cin >> n;
for (long long i = 0; i < n; ++i) {
cin >> k;
a[k]++;
}
for (int i = 2; i < 100001; ++i) {
a[i] = max(a[i - 2] + i * a[i], a[i - 1]);
}
cout << a[100000] << endl;
}
| 9 | CPP |
Subsets and Splits