solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
from sys import stdout
a,b,n=map(int,input().split())
c=0
co=0
temp=str(a)
f=0
for i in range(0,10):
if int(temp+str(i))%b==0:
temp=temp+str(i)
f=1
break
if f==0:
print(-1)
else:
for i in range(n-1):
temp+="0"
stdout.write(temp) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int maxn = 35, maxx = 55;
int dp[maxn][maxn][maxn * maxn];
int main() {
for (int i = 0; i < maxn; i++) {
for (int j = 0; j < maxn; j++)
for (int o = 0; o < maxx; o++) dp[i][j][o] = 1000000000;
}
for (int i = 0; i < maxn; i++) {
for (int j = 0; j < maxn; j++) {
dp[i][j][0] = 0;
dp[i][j][i * j] = 0;
}
}
for (int i = 1; i < maxn; i++) {
for (int j = 1; j < maxn; j++) {
int mxx = min(i * j, 50);
for (int k = 1; k <= mxx; k++) {
for (int h = 1; h < i; h++) {
for (int a = 1; a <= k; a++) {
dp[i][j][k] =
min(dp[i][j][k], dp[h][j][a] + j * j + dp[i - h][j][k - a]);
}
}
for (int z = 1; z < j; z++) {
for (int a = 1; a <= k; a++) {
dp[i][j][k] =
min(dp[i][j][k], dp[i][z][a] + i * i + dp[i][j - z][k - a]);
}
}
}
}
}
int T;
scanf("%d", &T);
while (T--) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", dp[a][b][c]);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
static void print(const unordered_map<int, pair<int, int>> &a) {
for (auto &e : a) {
cout << "id: " << e.first << " " << e.second.first << ", "
<< e.second.second << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
unordered_map<int, pair<int, int>> s;
s.reserve(m);
for (int i = 0; i < m; ++i) {
pair<int, int> temp;
int a, b, c;
cin >> a >> b >> c;
if (s.count(a)) {
s[a].first += c;
} else {
s[a] = {c, 0};
}
if (s.count(b)) {
s[b].second += c;
} else {
s[b] = {0, c};
}
}
uint64_t deb = 0;
for (const auto &e : s) {
auto v = e.second;
if (v.first > v.second) {
deb += v.first - v.second;
}
}
cout << deb << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int d[1000005];
struct stree {
long long sum;
long long mx;
} sts[300002 * 4];
long long a[1000005];
void pushup(int root) {
sts[root].sum = sts[root << 1].sum + sts[root << 1 | 1].sum;
sts[root].mx = max(sts[root << 1].mx, sts[root << 1 | 1].mx);
}
void init() {
for (int i = 1; i <= 1000000; i++)
for (int j = i; j <= 1000000; j += i) d[j]++;
}
void build(int l, int r, int root) {
if (l == r) {
sts[root].sum = sts[root].mx = a[l];
} else {
int mid = (l + r) >> 1;
build(l, mid, root << 1);
build(mid + 1, r, root << 1 | 1);
pushup(root);
}
}
void update(int nowl, int nowr, int ul, int ur, int root) {
if (nowl == nowr) {
sts[root].mx = sts[root].sum = d[sts[root].sum];
return;
}
if (ul <= nowl && ur >= nowr && sts[root].mx <= 2) return;
int mid = (nowl + nowr) >> 1;
if (ul <= mid) update(nowl, mid, ul, ur, root << 1);
if (ur > mid) update(mid + 1, nowr, ul, ur, root << 1 | 1);
pushup(root);
}
long long query(int nowl, int nowr, int ql, int qr, int root) {
if (ql <= nowl && qr >= nowr) {
return sts[root].sum;
} else {
int mid = (nowl + nowr) >> 1;
long long ans = 0;
if (ql <= mid) ans += query(nowl, mid, ql, qr, root << 1);
if (qr > mid) ans += query(mid + 1, nowr, ql, qr, root << 1 | 1);
return ans;
}
}
void op();
int main() {
init();
int n, m;
int t, l, r;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
build(1, n, 1);
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &t, &l, &r);
if (t == 1) {
update(1, n, l, r, 1);
} else {
printf("%I64d\n", query(1, n, l, r, 1));
}
}
}
void sp(int t) {
for (int i = 1; i <= t; i++) printf(" ");
}
void op() {
int pow2[10] = {1, 2, 4, 8, 16, 32};
int n = 16;
printf("\n///////////\n");
for (int i = 1; i <= 31; i++) {
if (i == pow2[0]) sp(15);
if (i == pow2[1]) sp(7);
if (i == pow2[2]) sp(3);
if (i == pow2[3]) sp(1);
if (i > pow2[1] && i < pow2[2]) sp(15);
if (i > pow2[2] && i < pow2[3]) sp(7);
if (i > pow2[3] && i < pow2[4]) sp(3);
if (i > pow2[4] && i < pow2[5]) sp(1);
printf("%d", sts[i].mx);
if ((i == pow2[1] - 1) || (i == pow2[2] - 1) || (i == pow2[3] - 1) ||
(i == pow2[4] - 1))
printf("\n");
}
printf("\n\n///////////\n");
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100, M = 100;
int main() {
int n, m;
cin >> n >> m;
int sl[N][M], sr[N][M], bounds[M] = {0};
for (int i = 0; i < n; ++i) {
int k, l, r;
cin >> k;
for (int p = 0; p < k; ++p) {
cin >> l >> r;
for (int j = l - 1; j < r; ++j) {
sl[i][j] = l - 1;
sr[i][j] = r;
}
}
}
vector<vector<int> > dp(m, vector<int>(m));
for (int dist = 2; dist <= m; ++dist) {
for (int l = 0; l <= m - dist; ++l) {
int r = l + dist - 1, d = 0;
for (int i = 0; i < n; ++i) {
bounds[sr[i][l]]++;
bounds[sl[i][r]]--;
}
for (int i = l + 1; i < r; ++i) {
d += bounds[i];
dp[l][r] = max(dp[l][r], dp[l][i] + dp[i][r] + d * d);
}
memset(bounds, 0, sizeof(bounds));
}
}
dp[0][m - 1] += n * n;
int nn = n;
for (int i = 0; i < nn; ++i)
if (sr[i][0] == m) --n;
dp[0][m - 1] += n * n;
cout << dp[0][m - 1] << '\n';
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, x, days, extra, start, ans;
cin >> n >> x;
long long a[2 * n], c[2 * n], d[2 * n];
for (i = 0; i < n; i++) cin >> a[i], a[n + i] = a[i];
c[0] = a[0];
d[0] = (a[0] * (a[0] + 1)) / 2;
for (i = 1; i < 2 * n; i++)
c[i] = c[i - 1] + a[i], d[i] = d[i - 1] + (a[i] * (a[i] + 1)) / 2;
ans = -1;
for (i = n; i < 2 * n; i++) {
start = lower_bound(c, c + 2 * n, c[i] - x + 1) - c;
days = (c[i] - c[start - 1]) - x;
extra = (a[start] * (a[start] + 1) / 2) - (days * (days + 1) / 2);
ans = max(ans, d[i] - d[start] + extra);
}
cout << ans;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long int s = 0;
for (int i = 0; i < n / 2; i++) {
long long int x = pow((arr[i] + arr[n - 1 - i]), 2);
s += x;
}
cout << s << endl;
return 0;
}
| 9 | CPP |
word_order = []
sorted_word_order = []
for i in range(2):
word_order.append(input().lower())
sorted_word_order = sorted(word_order)
if word_order[0] != word_order[1]:
if word_order[0] == sorted_word_order[0]:
print(-1)
else:
print(1)
else:
print(0)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
printf("%d %d\n", (n + 1) / 36, (n + 1) % 36 / 3);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a, b, w, x, c;
bool ok(long long t) {
long long l = c - t;
long long num = max(0ll, (1ll * t * x - b + w - 1) / w);
long long r = a - num;
return l <= r;
}
int main() {
cin >> a >> b >> w >> x >> c;
long long l = 0, r = 1e15 + 5;
while (l < r) {
long long mid = l + (r - l) / 2;
if (ok(mid))
r = mid;
else
l = mid + 1;
}
cout << r << endl;
return 0;
}
| 8 | CPP |
#include <iostream>
#include <string>
using namespace std;
int main(){
string x, y, z;
while(cin >> x >> y >> z){
int xi = 0, yi = 0, zi = 0;
char ch = y[yi++];
string res;
while(zi < z.size()){
if(ch == z[zi]){
++zi;
ch = x[xi++];
}
else{
res += ch;
ch = y[yi++];
}
}
res += ch;
res += y.substr(yi);
cout << res << '\n';
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x1, x2;
scanf("%d %d %d", &n, &x1, &x2);
int tt, tp;
scanf("%d %d", &tt, &tp);
int idx, pt;
scanf("%d %d", &idx, &pt);
int pp = (x1 < x2) ? 1 : -1;
int flag = false;
for (int i = 1; i <= 1000007; i++) {
if (x1 == idx && pp == pt) flag = true;
if (i % tp == 0) x1 += pp;
if (i % tt == 0) idx += pt;
if (idx == n && pt == 1) pt = -1;
if (idx == 0 && pt == -1) pt = 1;
if (x1 == x2 || (idx == x2 && flag)) {
printf("%d\n", i);
break;
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
vector<pair<int, int> > g[maxn];
pair<int, int> pre[maxn];
int c[maxn], rt;
long long w[maxn];
bool vis[maxn], id[maxn];
bool dfs(int u, int fa, bool tp) {
if (vis[u]) {
if (tp != id[u] && !rt) {
rt = u;
return true;
} else
return false;
}
vis[u] = 1;
id[u] = tp;
bool fg = 0;
for (auto e : g[u]) {
int v = e.first;
if (v == fa) continue;
if (dfs(v, u, tp ^ 1)) {
pre[u] = e;
fg = u != rt;
}
}
return fg;
}
long long solve(int u, int fa) {
if (vis[u]) return 0;
vis[u] = 1;
long long d = 0;
for (auto e : g[u]) {
int v = e.first;
d += w[e.second] = solve(v, u);
}
return c[u] - d;
}
int main() {
int n, m, u, v, i;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &c[i]);
for (i = 0; i < m; i++) {
scanf("%d%d", &u, &v);
g[u].push_back(pair<int, int>(v, i));
g[v].push_back(pair<int, int>(u, i));
}
dfs(1, 0, 1);
memset(vis, 0, sizeof(vis));
if (!rt) {
long long x = solve(1, 0);
if (x) return puts("NO");
puts("YES");
for (i = 0; i < m; i++) printf("%lld\n", w[i]);
} else {
long long x = solve(rt, 0);
if (abs(x) & 1) return puts("NO");
x /= 2;
pair<int, int> e = pre[rt];
while (true) {
w[e.second] += x;
if (e.first == rt) break;
x *= -1;
e = pre[e.first];
}
puts("YES");
for (i = 0; i < m; i++) printf("%lld\n", w[i]);
}
return 0;
}
| 10 | CPP |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#define curr(P, i) P[(i) % P.size()]
#define next(P, i) P[(i+1) % P.size()]
#define prev(P, i) P[(i+P.size()-1) % P.size()]
#define Next(a,i) ((i)+1)%(a).size()
#define Curr(a,i) (i)%(a).size()
#define Prev(a, i) (i+a.size()-1) % a.size()
using namespace std;
int main(void){
int n,m,x,dp[101][101];
vector<int>a;
cin >> n;
while(n--){
a.clear();
for(int i=0;i<101;i++)
for(int j=0;j<101;j++)dp[i][j]=0;
cin >> m;
for(int i=0;i<m;i++){
cin >> x;
a.push_back(x);
}
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
for(int k=0;k<i;k++){
dp[Curr(a,j)][Curr(a,i)]=max(dp[j][i],dp[Curr(a,j)][Curr(a,k)]+dp[Next(a,j+k)][Prev(a,i-k)]+abs(curr(a,j)-next(a,j+k)));
}
}
}
int ans=0;
for(int i=0;i<m;i++)
for(int j=0;j<m;j++)
ans=max(ans,dp[i][j]);
cout << ans << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long x = 2 * k + 1;
long long y = n / x, r = n % x;
if (r != 0)
y++;
else
r = 2 * k;
cout << y << endl;
for (long long i = 1 + r / 2; i <= n; i += x) cout << i << " ";
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n],dist[n],cnt[n];
for(int i=0;i<n;i++){
cin>>a[i];
dist[i] = a[i] - (i+1);
}
sort(dist,dist + n);
int p = (dist[n/2]+dist[(n-1)/2])/2;
long long ans = 0;
for(int i=0;i<n;i++){
// ans += abs(a[i] - (p + (i+1)));
ans += abs(dist[i]-p);
}
cout << ans << endl;
}
| 0 | CPP |
from math import gcd
n=int(input())
arr=list(map(int,input().split()))
gcds=[0 for i in range(n)]
gcds[n-1]=arr[n-1]
for i in range(n-2,-1,-1):
gcds[i]=gcd(gcds[i+1],arr[i])
curr=0
for i in range(n-1):
curr=gcd(curr,(arr[i]*gcds[i+1])//gcd(arr[i],gcds[i+1]))
print(curr)
| 7 | PYTHON3 |
#include <iostream>
#include <vector>
using namespace std;
#define MAX 1299710
int main (){
bool pr[MAX];
int a;
vector <int> prl;
for(int i=0;i<MAX;i++) pr[i]=true;
pr[0]=false;
pr[1]=false;
for(int i=0;i*i<MAX;i++){
if(pr[i]){
for(int j=i*i;j<=MAX;j=j+i){
pr[j]=false;
}
}
}
for(int i=0,j=0;i<100000;j++){
if(pr[j]==true){
prl.push_back(j);
i++;
}
}
while(cin>>a){
if(a==0)break;
if(pr[a]){
cout << 0 <<endl;
}
else{
auto ansitr=lower_bound(prl.begin(),prl.end(),a);
cout<< *ansitr - *(ansitr-1) <<endl;
}
}
} | 0 | CPP |
#include<stdio.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n%m)
printf("1\n");
else
printf("0\n");
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, d = 1;
cin >> n >> m;
a = n / 2;
for (int i = 0; i < m; i++) {
cout << a << " " << a + d << "\n";
a--;
d += 2;
if (n % 2 == 0 && (d == n / 2 || d == n / 2 + 1)) d++;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
Point inline operator-(const Point &p) const {
return Point(x - p.x, y - p.y);
}
long long inline operator*(const Point &p) const {
return 1ll * x * p.y - 1ll * y * p.x;
}
friend bool inline operator<(const Point &a, const Point &b) {
bool ia = a.y > 0 || (a.y == 0 && a.x >= 0);
bool ib = b.y > 0 || (b.y == 0 && b.x >= 0);
if (ia != ib) return ia;
return a * b > 0;
}
friend bool inline operator==(const Point &a, const Point &b) {
return !((a < b) && (b < a));
}
};
template <typename tp, int siz>
struct Fenwick {
tp dt[siz + 5];
void init() {
for (int i = 0; i < (siz + 5); ++i) dt[i] = tp();
}
Fenwick() { init(); }
void inline add(int a, tp x) {
for (++a; a < siz + 5; a += a & -a) dt[a] += x;
}
tp inline sum(int a) {
tp res = 0;
for (++a; a; a -= a & -a) res += dt[a];
return res;
}
tp inline sum(int l, int r) { return sum(r) - sum(l - 1); }
};
Fenwick<int, 100005> bit;
int T;
vector<Point> vs[100005];
vector<int> ids[100005];
map<Point, int> id;
set<int> pos[300005];
vector<pair<pair<int, int>, int> > ps;
int is;
int ans[300005];
int main() {
scanf("%d", &T);
for (int t = 1; t <= (T); ++t) {
int n;
scanf("%d", &n);
vector<Point> pt;
while (n--) {
int x, y;
scanf("%d%d", &x, &y);
pt.emplace_back(x, y);
}
for (int i = 0; i < (((int)(pt).size())); ++i)
vs[t].push_back(pt[(i + 1) % ((int)(pt).size())] - pt[i]);
}
for (int t = 1; t <= (T); ++t)
for (int i = 0; i < (((int)(vs[t]).size())); ++i) {
auto p = vs[t][i];
int &ID = id[p];
if (!ID) ID = ++is;
ids[t].push_back(ID);
}
for (int t = 1; t <= (T); ++t)
for (int i = 0; i < (((int)(vs[t]).size())); ++i) pos[ids[t][i]].insert(t);
scanf("%d", &T);
for (int t = 0; t < (T); ++t) {
int l, r;
scanf("%d%d", &l, &r);
ps.emplace_back(make_pair(l, r), t);
}
sort((ps).begin(), (ps).end());
for (int i = 1; i <= (is); ++i) bit.add(*pos[i].begin(), 1);
int lpos = 1;
for (auto it = (ps).begin(); it != (ps).end(); ++it) {
int l = it->first.first, r = it->first.second;
while (lpos < l) {
for (int j = 0; j < (((int)(ids[lpos]).size())); ++j) {
int id = ids[lpos][j];
bit.add(lpos, -1);
auto itr = pos[id].upper_bound(lpos);
if (itr != pos[id].end()) bit.add(*itr, 1);
}
++lpos;
}
ans[it->second] = bit.sum(r);
}
for (int i = 0; i < (T); ++i) printf("%d\n", ans[i]);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
const int MAXN = (int)5e5 + 10;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
char str[20];
int a[11];
int main() {
while (scanf("%s", str) != EOF) {
memset(a, 0, sizeof(a));
for (int i = 0; i < strlen(str); i++) {
int index = str[i] - '0';
a[index]++;
}
int sum1 = 1000, sum2 = 1000, sum3 = 1000, sum4 = 1000;
if (a[0] >= 2) {
sum1 = 0;
int flag = 0;
int len = strlen(str);
for (int i = len - 1; i >= 0; i--) {
int num = str[i] - '0';
if (num == 0 && flag == 0) {
sum1 += len - 1 - i;
flag = 1;
} else if (num == 0 && flag == 1) {
sum1 += len - 2 - i;
break;
}
}
}
if (a[2] != 0 && a[5] != 0) {
sum2 = 0;
int len = strlen(str);
int flag2 = 0;
int flag5 = 0;
int index0 = -1;
int index2 = -1;
int index5 = -1;
for (int i = len - 1; i >= 0; i--) {
int num = str[i] - '0';
if (num == 5 && flag5 == 0) {
sum2 += len - 1 - i;
flag5 = 1;
index5 = i;
} else if (num == 2 && flag2 == 0) {
if (flag5 == 0) {
sum2++;
}
sum2 += len - 2 - i;
flag2 = 1;
index2 = i;
}
if (flag2 == 1 && flag5 == 1) {
break;
}
}
if (a[0] > 0) {
for (int i = 0; i < len; i++) {
int num = str[i] - '0';
if (num != 0 && i != index5 && i != index2) {
index0 = i;
break;
}
}
if (index0 > index2 && index0 < index5 ||
index0 < index2 && index0 > index5) {
sum2 += (index0 - 1);
} else if (index0 > index2 && index0 > index5) {
sum2 += (index0 - 2);
}
}
}
if (a[5] != 0 && a[0] != 0) {
sum3 = 0;
int len = strlen(str);
int flag5 = 0;
int index5 = -1;
int flag0 = 0;
int index0 = -1;
int index = -1;
for (int i = len - 1; i >= 0; i--) {
int num = str[i] - '0';
if (num == 0 && flag0 == 0) {
sum3 += len - 1 - i;
flag0 = 1;
index0 = i;
} else if (num == 5 && flag5 == 0) {
if (flag0 == 0) {
sum3++;
}
sum3 += len - 2 - i;
flag5 = 1;
index5 = i;
}
if (flag0 == 1 && flag5 == 1) {
break;
}
}
if (a[0] > 1) {
for (int i = 0; i < len; i++) {
int num = str[i] - '0';
if (num != 0 && i != index5 && i != index0) {
index = i;
break;
}
}
if (index > index0 && index < index5 ||
index < index0 && index > index5) {
sum3 += (index - 1);
} else if (index > index0 && index > index5) {
sum3 += (index - 2);
}
}
}
if (a[7] != 0 && a[5] != 0) {
sum4 = 0;
int len = strlen(str);
int flag7 = 0;
int flag5 = 0;
int index0 = -1;
int index5 = -1;
int index7 = -1;
for (int i = len - 1; i >= 0; i--) {
int num = str[i] - '0';
if (num == 5 && flag5 == 0) {
sum4 += len - 1 - i;
flag5 = 1;
index5 = i;
} else if (num == 7 && flag7 == 0) {
if (flag5 == 0) {
sum4++;
}
sum4 += len - 2 - i;
flag7 = 1;
index7 = i;
}
if (flag7 == 1 && flag5 == 1) {
break;
}
}
if (a[0] > 0) {
for (int i = 0; i < len; i++) {
int num = str[i] - '0';
if (num != 0 && i != index5 && i != index7) {
index0 = i;
break;
}
}
if (index0 > index7 && index0 < index5 ||
index0 < index7 && index0 > index5) {
sum4 += (index0 - 1);
} else if (index0 > index7 && index0 > index5) {
sum4 += (index0 - 2);
}
}
}
if (sum1 == 1000 && sum2 == 1000 && sum3 == 1000 && sum4 == 1000) {
printf("-1\n");
} else {
int minn = 0;
minn = min(sum1, min(sum2, min(sum3, sum4)));
printf("%d\n", minn);
}
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b;
string s;
long long dx = 0, dy = 0, nx = 0, ny = 0;
bool isOk() {
long long k1, k2;
if (dx == 0) {
if (nx != a) return false;
if (dy == 0) {
if (ny == b) return true;
return false;
}
k2 = (b - ny) / dy;
if (k2 * dy == b - ny && k2 >= 0) return true;
return false;
}
if (dy == 0) {
if (ny != dy) return false;
k1 = (a - nx) / dx;
if (k1 * dx == a - nx && k1 >= 0) return true;
return false;
}
k1 = (a - nx) / dx;
k2 = (b - ny) / dy;
if (k1 == k2 && k1 * dx == a - nx && k2 * dy == b - ny && k1 >= 0)
return true;
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> a >> b;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R') dx++;
if (s[i] == 'L') dx--;
if (s[i] == 'U') dy++;
if (s[i] == 'D') dy--;
}
if (isOk()) {
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'R') nx++;
if (s[i] == 'L') nx--;
if (s[i] == 'U') ny++;
if (s[i] == 'D') ny--;
if (isOk()) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 1;
ans += (n * (n + 1) / 2) * 6;
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int a[1000 + 1][1000 + 1];
int origr[1000 + 1], origc[1000 + 1];
void swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
}
int main() {
int i, j;
int n, m, k;
int x, y;
char c;
scanf("%d %d %d", &n, &m, &k);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) scanf("%d", &a[i][j]);
for (i = 1; i <= n; i++) origr[i] = i;
for (i = 1; i <= m; i++) origc[i] = i;
for (i = 0; i < k; i++) {
do c = getchar();
while (c != 'c' && c != 'r' && c != 'g');
scanf("%d %d", &x, &y);
if (c == 'c')
swap(&origc[x], &origc[y]);
else if (c == 'r')
swap(&origr[x], &origr[y]);
else if (c == 'g')
printf("%d\n", a[origr[x]][origc[y]]);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
T &minn(T &a, T b) {
if (b < a) a = b;
return a;
}
template <class T>
T &maxx(T &a, T b) {
if (a < b) a = b;
return a;
}
int &madd(int &a, int b) {
a += b;
if (a >= 1000000007) a -= 1000000007;
return a;
}
int &msub(int &a, int b) {
a -= b;
if (a < 0) a += 1000000007;
return a;
}
int &mmult(int &a, int b) { return a = (long long)a * b % 1000000007; }
int mdiv(long long a, long long b, long long m) {
a = (a % m + m) % m;
b = (b % m + m) % m;
if (a % b == 0) return a / b;
return (a + m * mdiv(-a, m, b)) / b;
}
int n, m, q;
int A[1012];
int main() {
int i, j, k;
char c;
int a, d;
int b;
int ts;
for (ts = 1; scanf("%"
"d",
&(a)) > 0;
++ts) {
scanf(
"%"
"d",
&(b));
scanf(
"%"
"d",
&(q));
for (; q--;) {
int l, t, m;
scanf(
"%"
"d",
&(l));
scanf(
"%"
"d",
&(t));
scanf(
"%"
"d",
&(m));
--l;
i = l;
if (a + (long long)l * b > t)
printf(
"%"
"d",
(-1)),
printf("\n"), firstout = 1;
else {
j = (t - a) / b;
if (j + 1 - l > m) {
k = j;
double x =
(sqrt(((2. * a + 2. * b * l - b) * (2. * a + 2. * b * l - b)) +
8. * b * t * m) -
(2. * a + 2. * b * l - b)) /
2. / b;
j = l + (int)x;
for (; (long long)a * (j - i + 1) +
(long long)(j - i + 1) *
((long long)l * b + (long long)(l + j - i) * b) / 2 >
(long long)t * m;)
--j;
minn(j, k);
}
printf((firstout) ? "%"
"d"
: " %"
"d",
(j + 1)),
firstout = 0;
printf("\n"), firstout = 1;
}
}
}
return 0;
}
| 7 | CPP |
t = int(input())
dva = [2**i for i in range(31)]
for i in range(t):
n = int(input())
a = dva[n] + sum(dva[1:n//2])
b = sum(dva[n//2:n])
print(abs(a-b))
| 7 | PYTHON3 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define debug(x) cerr << #x << " = " << (x) << endl;
#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 3000100
ll fac[SIZE];
ll inv[SIZE];
ll factorial(int n,int M){
ll ret=1;
if(n<=1) return 1;
return fac[n];
for(int i=1;i<=n;i++){
ret = (ret*i)%M;
}
return ret;
}
ll power(int k,int n,int M){
if(n==0) return 1;
if(n==1) return (ll)k;
ll ret = power(k,n/2,M);
ret=(ret*ret)%M;
if(n%2==1)
ret=(ret*k)%M;
return ret;
}
void factorial_init(int n){
fac[0] = 1;
for(int i=1;i<=n;i++) fac[i] = (i * fac[i-1])%mod;
inv[n] = power(fac[n],mod-2,mod);
for(int i=n;i>=1;i--) inv[i-1] = (i*inv[i])%mod;
}
//nCm nPm nHm (mod M)
/*Combination*/
int C(int n,int m,int M){
if(n<m) return 0;
if(m==0 || n==m) return 1;
ll chi = factorial(n,M);
ll mot = (inv[m] * inv[n-m])%M;
ll ret = (chi*mot)%M;
return (int)ret;
}
/*Combination with Repetitions*/
int H(int n,int m,int M){
if(n==0 && m==0) return 1;
return C(n+m-1,m,M);
}
bool solve(){
int a,b,c,sx,sy;
scanf("%d%d%d%d%d",&a,&b,&c,&sx,&sy);
if(a +b + c == 0) return false;
if(sx < sy){
swap(sx,sy);
swap(a,b);
}
ll ans_sum = 0;
for(int i=sx-sy;i<=sx;i++){
int p = i;
int q = i - (sx-sy);
if(p < a || q < b || (a==0 && p>0) || (b==0 && q > 0)) continue;
ll ans = 1;
ans = (ans * C(p-1,a-1,mod))%mod;
ans = (ans * C(q-1,b-1,mod))%mod;
ans = (ans * C(sx-i+(c+b+a-1),c+b+a-1,mod))%mod;
ans_sum = (ans_sum + ans)%mod;
}
ans_sum = (ans_sum * factorial(a+b+c,mod))%mod;
ans_sum = (ans_sum * inv[a])%mod;
ans_sum = (ans_sum * inv[b])%mod;
ans_sum = (ans_sum * inv[c])%mod;
printf("%lld\n",ans_sum);
return true;
}
int main(){
factorial_init(3000000);
while(solve());
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mat[200][200];
int main() {
int n, k, ma = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n / k; ++i)
for (int j = 1; j <= k; ++j) scanf("%d", &mat[i][j]);
for (int j = 1; j <= k; ++j) {
int nr1 = 0, nr2 = 0;
for (int i = 1; i <= n / k; ++i)
if (mat[i][j] == 1)
nr1++;
else
nr2++;
if (nr1 > nr2)
ma += nr2;
else
ma += nr1;
}
printf("%d", ma);
return 0;
}
| 7 | CPP |
n=int(input())
for _ in range(0,n):
x=input()
ans=""
ans+=x[0]
ans+=x[1]
for i in range(3,len(x),2):
ans+=x[i]
print(ans)
| 7 | PYTHON3 |
import math
from sys import stdin
users = []
traffic = 0
for line in stdin:
#line = input()
if line[0] == '+':
users.append(line[1:])
if line[0] == '-':
users.remove(line[1:])
if line == '\n':
break
loc = None
for i in range(0, len(line)):
if line[i] == ':':
loc = i
size = len(line) - loc - 2
traffic += size * len(users)
print(traffic)
| 7 | PYTHON3 |
def magnets(l):
groups=1
for i in range(0,len(l)-1):
if l[i][1]==l[i+1][0]:
groups+=1
else:
groups+=0
return groups
n=int(input())
l=[]
for i in range(0,n):
a=input()
l.append(a)
print(magnets(l)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
for (long long i = 0; i < n; i++) {
if (s[i] > t[i]) {
cout << -1 << endl;
return;
}
if (s[i] == t[i]) {
s[i] = t[i] = 'z';
}
}
if (s == t) {
cout << 0 << endl;
return;
}
long long ans = 0;
for (long long i = 0; i < 20; i++) {
char c = 'a' + i;
char m = 'z';
for (long long j = 0; j < n; j++) {
if (s[j] == c && t[j] < m) {
m = t[j];
}
}
if (m == 'z') {
continue;
}
for (long long j = 0; j < n; j++) {
if (s[j] == c) {
s[j] = m;
if (s[j] == t[j]) {
s[j] = t[j] = 'z';
}
}
}
ans++;
if (s == t) {
break;
}
}
cout << ans << endl;
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
}
| 7 | CPP |
n = int(input())
a = []
for i in range(n):
a.append(input())
a.sort(key=len)
i = 0
b = []
while True and i < n - 1:
if a[i+1].count(a[i]) < 1:
print('NO')
exit()
i += 1
print('YES')
for i in a:
print(i) | 8 | PYTHON3 |
'''
A. Team Olympiad
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value ti:
ti = 1, if the i-th child is good at programming,
ti = 2, if the i-th child is good at maths,
ti = 3, if the i-th child is good at PE
Each child happens to be good at exactly one of these three subjects.
The Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.
What is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?
Input
The first line contains integer n (1 ≤ n ≤ 5000) — the number of children in the school. The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 3), where ti describes the skill of the i-th child.
Output
In the first line output integer w — the largest possible number of teams.
Then print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team. You can print both the teams, and the numbers in the triplets in any order. The children are numbered from 1 to n in the order of their appearance in the input. Each child must participate in no more than one team. If there are several solutions, print any of them.
If no teams can be compiled, print the only line with value w equal to 0.
Examples
inputCopy
7
1 3 1 3 2 1 2
outputCopy
2
3 5 2
6 7 4
inputCopy
4
2 1 1 2
outputCopy
0
'''
def index(a_list, value):
try:
return a_list.index(value)
except ValueError:
return -1
n = int(input())
arr = list(map(int, input().split()))
if (index(arr, 1) == -1 or index(arr, 2) == -1 or index(arr, 3) == -1):
print(0)
else:
ans = [[], [], []]
for i in range(n):
if (arr[i] == 1):
ans[0].append(i + 1)
elif (arr[i] == 2):
ans[1].append(i + 1)
else:
ans[2].append(i + 1)
a = min(len(ans[0]), len(ans[1]), len(ans[2]))
print(a)
for i in range(a):
print(ans[0][i], ans[1][i], ans[2][i]) | 7 | PYTHON3 |
n,a,b,c=map(int, input().split())
arr = [-1e9]*8085
arr[0] = 0
parts = [a,b,c]
for i in range(1,n+1):
list_prob = [(arr[i-j]+1) for j in parts if arr[i-j]>=0]
if list_prob:
max_dp = max(list_prob)
arr[i] = max_dp
print(arr[n] if arr[n]>=0 else 0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a, sum, t, n;
int main() {
scanf("%d", &t);
while (t--) {
int ans = 0;
sum = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
if (a == 0) ++ans, a = 1;
sum += a;
}
if (sum == 0) ++ans;
printf("%d\n", ans);
}
return 0;
}
| 7 | CPP |
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int a[100001];
int main() {
int n,q,k,cnt=0;
cin>>n;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
cin>>q;
while(q--){
scanf("%d",&k);
if(*lower_bound(a,a+n,k)==k) cnt++;
}
cout<<cnt<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N = 1e7 + 7;
long long d[N], n, a, b;
const long long inf = 2e16;
int main() {
cin >> n >> a >> b;
d[0] = 0;
d[1] = a;
for (int i = 2; i <= n; i++)
if (i & 1)
d[i] = min(d[i - 1] + a, d[(i + 1) / 2] + a + b);
else
d[i] = min(d[i - 1] + a, d[i / 2] + b);
cout << d[n];
return 0;
}
| 11 | CPP |
from collections import defaultdict
t = int(input())
for ii in range(t):
n = int(input())
a = list(reversed(list(map(int, input().split(' ')))))
m = defaultdict(int)
res = 0
for i in range(len(a)):
s = str(bin(a[i])[2:])
res += m[len(s)]
m[len(s)] += 1
print(res)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
const int INF = 1e9 + 1;
const double PI = acos(-1.0);
const double EPS = 1e-9;
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
template <class T>
void deb_array(T *arr, int length) {
for (int i = 0; i < length; i++) {
cout << arr[i] << ' ';
}
cout << '\n';
}
const int maxn = 2e5 + 5;
vector<int> ret[maxn];
int v[maxn], cnt = 1, n;
int bs(int x) {
if (x > v[1]) {
return 1;
} else if (x < v[cnt]) {
return cnt + 1;
}
int big = 1, small = cnt;
while (small - big != 1) {
int med = (big + small) >> 1;
if (v[med] > x) {
big = med;
} else {
small = med;
}
}
return small;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
v[cnt] = a[1];
ret[cnt].push_back(v[cnt]);
for (int i = 2; i <= n; i++) {
int index = bs(a[i]);
if (index > cnt) {
cnt++;
}
v[index] = a[i];
ret[index].push_back(v[index]);
}
for (int i = 1; i < maxn; i++) {
if (ret[i].empty())
break;
else {
for (int r : ret[i]) {
cout << r << ' ';
}
cout << '\n';
}
}
return 0;
}
| 8 | CPP |
#include "bits/stdc++.h"
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1286
using namespace std;
#define ll long long
int n, m, k;
void dfs(int now, int Sum,map<int,int>& M) {
if (now == n) {
M[max(Sum - k, 1)]++;
return;
}
else {
for (int i = 1; i <= m;i++) {
dfs(now + 1, Sum + i, M);
}
}
return;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
while (cin >> n >> m >> k) {
if (n == 0 && m == 0 && k == 0)break;
map<int, int> M;
dfs(0, 0, M);
double ans = 0;
for (auto it = M.begin();it != M.end();it++) {
//cout << it->first << " " << it->second << endl;
ans += ((double)it->first) / (double)pow(m,n) *(it->second);
}
cout << fixed << setprecision(10) << ans << endl;
}
} | 0 | CPP |
#include <stdio.h>
#include <string.h>
#include <vector>
int n, b[200005], dp[200005], cnt, M[200005 << 2], q, x, y;
std::vector<int> v[200005];
void modify(int cur, int l, int r, int pos, int num) {
M[cur] = std::min(M[cur], num);
if (l == r) return;
int mid = l + r >> 1;
if (pos <= mid) modify(cur << 1, l, mid, pos, num);
else modify(cur << 1 | 1, mid + 1, r, pos, num);
}
int query(int cur, int l, int r, int L, int R) {
if (L <= l && R >= r) return M[cur];
int mid = l + r >> 1, ans = 0x3f3f3f3f;
if (L <= mid) ans = std::min(ans, query(cur << 1, l, mid, L, R));
if (R > mid) ans = std::min(ans, query(cur << 1 | 1, mid + 1, r, L, R));
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &b[i]), cnt += b[i] == 0;
scanf("%d", &q);
for (int i = 1; i <= q; i++) scanf("%d%d", &x, &y), v[x].push_back(y);
memset(M, 0x3f, sizeof M); memset(dp, 0x3f, sizeof dp);
dp[0] = 0; modify(1, 0, n, 0, 0);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < v[i].size(); j++)
modify(1, 0, n, v[i][j], dp[v[i][j]] = std::min(dp[v[i][j]], query(1, 0, n, i - 1, v[i][j])));
modify(1, 0, n, i, dp[i] = std::min(dp[i], dp[i - 1] + (b[i] ? 1 : -1)));
}
printf("%d\n", dp[n] + cnt);
return 0;
} | 0 | CPP |
for _ in range(int(input())):
n=input()
leni=len(n)
p = n[0]
ans = int(p)-1
if leni==4:
fans=ans*10+10
print(fans)
elif leni==3:
fans=ans*10+6
print(fans)
elif leni==2:
fans=ans*10+3
print(fans)
else:
fans=ans*10+1
print(fans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
const int INF = 0x3f3f3f3f;
struct UF_union {
int par[MAXN], siz[MAXN], n;
void init(int a) {
n = a;
for (int i = 0; i < MAXN; i++) {
par[i] = i;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void merge(int u, int v) {
int a = find(u);
int b = find(v);
if (siz[a] > siz[b]) swap(a, b);
par[a] = b;
siz[b] += siz[a];
}
};
vector<int> inp[MAXN];
int lang[MAXN];
int main() {
UF_union uf;
int n, m;
scanf("%d%d", &n, &m);
uf.init(n);
int ans = 0;
int chosen = -1;
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
while (k--) {
int x;
scanf("%d", &x);
inp[i].push_back(x);
chosen = x;
}
if (inp[i].size() != 0) lang[i] = inp[i][0];
for (int j = 0; j < (int)inp[i].size() - 1; j++)
uf.merge(inp[i][j], inp[i][j + 1]);
}
if (chosen == -1) return !printf("%d\n", n);
for (int i = 1; i <= n; i++) {
if (lang[i] == 0) {
ans++;
lang[i] = chosen;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) continue;
if (!uf.same(lang[i], lang[j])) {
ans++;
uf.merge(lang[i], lang[j]);
}
}
}
printf("%d\n", ans);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec) is >> v;
return is;
}
template <typename T>
void dout(string name, T arg) {
cerr << arg << endl;
}
template <typename T1, typename... T2>
void dout(string names, T1 arg, T2... args) {
cerr << arg << " | ";
dout(names.substr(names.find(',') + 2), args...);
}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int mx = 1e6 + 5;
const int INF = 1000000007;
long long power(long long x, long long y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = (res * x) % 1000000007;
y >>= 1;
x = (x * x) % 1000000007;
}
return (res % 1000000007);
}
void solve() {
long long n;
cin >> n;
vector<pair<long long, long long>> ref;
vector<long long> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
long long temp;
cin >> temp;
ref.push_back({arr[i], temp});
}
sort((ref).rbegin(), (ref).rend());
long long ans = ref[0].first;
long long sum = ref[0].second;
for (int i = 1; i < n; i++) {
if (sum <= ref[i].first) {
ans = min(ans, ref[i].first);
sum += ref[i].second;
} else {
ans = min(ans, sum);
break;
}
}
ans = min(ans, sum);
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("AAtest.in.txt");
string s, s1, s2;
long long n;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cin >> s;
for (int(i) = (0); ((i)) < ((s.size())); ((i))++)
if (s[i] != 'a') n++;
if (n % 2) {
cout << ":(";
return 0;
}
n /= 2;
int m = n;
int i = 0;
for (int(i) = (0); ((i)) < ((s.size())); ((i))++) {
if (m and s[i] != 'a') {
s1 += s[i];
m--;
} else if (s[i] != 'a')
s2 += s[i];
}
if (s1 != s2) {
cout << ":(";
return 0;
}
m = 0;
for (int(i) = (0); ((i)) < ((s.size())); ((i))++) {
if (s[i] != 'a') m++;
if (m > n and s[i] == 'a') {
cout << ":(";
return 0;
}
}
while (n or s[i] == 'a') {
cout << s[i];
if (s[i] != 'a') n--;
i++;
}
}
| 8 | CPP |
inf =10**100
n = int(input())
cost=list(map(int,input().split()))
s=[]
for i in range(n):
u=input()
s.append(u)
r=[i[::-1] for i in s]
dp=[[ inf, inf] for j in range(n)]
dp[0] = [0,cost[0]]
for i in range(1,n):
if s[i] >= s[i-1]:
dp[i][0] = min(dp[i][0], dp[i-1][0])
if s[i] >= r[i-1]:
dp[i][0] = min(dp[i][0] , dp[i-1][1])
if r[i] >= s[i-1]:
dp[i][1] = min(dp[i][1] , dp[i-1][0]+cost[i])
if r[i] >= r[i-1]:
dp[i][1] = min(dp[i][1] , dp[i-1][1]+cost[i])
if min(dp[-1]) == inf:
print(-1)
else:
print(min(dp[-1]))
| 9 | PYTHON3 |
n,k = list(map(int,input().split()))
for i in range(n):
for j in range(n):
if j == i:
print(k,end=' ')
else:
print(0,end=' ')
print() | 7 | PYTHON3 |
n = input()
n = str(n.count('4') + n.count('7'))
if n.count('4') + n.count('7') == len(n):
print('YES')
else:
print('NO') | 7 | PYTHON3 |
def main():
n = int(input())
problems = [int(i) for i in input().split()]
all_problems = sum(problems)
now_problems = problems[0]
i = 0
while now_problems < (all_problems + 1) // 2:
i += 1
now_problems += problems[i]
print(i + 1)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
int a[10], ans;
int cnt(int x) {
int ret = 0;
while (x) {
ret += a[x % 10];
x /= 10;
}
return ret != 0;
}
int main() {
int n;
while (scanf("%d", &n) != EOF) {
ans = 0;
memset(a, 0, sizeof(a));
for (int i = n; i; i /= 10) a[i % 10] = 1;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans += cnt(i);
if (i * i != n) ans += cnt(n / i);
}
}
printf("%d\n", ans);
}
return 0;
}
| 8 | CPP |
num = int(input())
if num%2==0:
print(8, num-8)
else:
print(9, num-9)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long i, j, cnt = 0;
string s;
long long ar[105];
long long dp[105][105][105];
long long dfs(int l, int r, int k) {
int i;
if (l > r) return 0;
if (l == r) return ar[k];
if (~dp[l][r][k]) return dp[l][r][k];
dp[l][r][k] = dfs(l, r - 1, 0) + ar[k];
for (i = l; i < r; i++) {
if (s[i] == s[r])
dp[l][r][k] = max(dp[l][r][k], dfs(i + 1, r - 1, 0) + dfs(l, i, k + 1));
}
return dp[l][r][k];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> s;
for (i = 0; i < n; i++) cin >> ar[i];
memset(dp, 0xff, sizeof(dp));
cout << dfs(0, n - 1, 0) << endl;
return ~~(0 ^ 0 ^ 0);
}
| 11 | CPP |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <sstream>
using namespace std;
typedef unsigned int ui;
int main(){
int Q;
double c[7];
for(int i = 0 ; i < 7 ; i++){
c[i] = pow(0.5,i+1);
}
cin >> Q;
while(Q--){
ui s;
scanf("%x" ,&s);
ui integer = (s & 0x7fffffff) >> 7;
ui decimal = (s & 0x0000007f);
double d = 0;
for(int i = 0 ; i < 7 ; i++){
if((1 << i) & decimal)
d += c[6-i];
}
char str[10];
sprintf(str,"%.7f" ,d);
int pos = -1;
for(int i = 8 ; i >= 0 ; i--){
if(str[i] != '0' && str[i] != '.'){
pos = i;
break;
}
}
if((s >> 31) & 1) cout << '-';
cout << integer << '.';
if(pos == -1) cout << '0' << endl;
else{
for(int i = 2 ; i <= pos ; i++){
cout << str[i];
}
cout << endl;
}
}
return 0;
} | 0 | CPP |
def do():
conv = dict()
conv["0"] = "0"
conv["1"] = "1"
conv["2"] = "5"
conv["3"] = "xxxxxx"
conv["4"] = "xxxxxx"
conv["5"] = "2"
conv["6"] = "xxxxxx"
conv["7"] = "xxxxxx"
conv["8"] = "8"
conv["9"] = "xxxxxx"
def isitok(curtime):
curtime %= maxtime
h, m = curtime // maxm, curtime % maxm
#print(h, m)
hstr = "{:02}".format(h)
mstr = "{:02}".format(m)
newm = conv[hstr[1]] + conv[hstr[0]]
newh = conv[mstr[1]] + conv[mstr[0]]
#print(newh, newh)
if newm.find("x") != -1 or newh.find("x") != -1:
return False
if int(newh) >= maxh or int(newm) >= maxm:
return False
return True
maxh, maxm = map(int, input().split())
s = input().split(":")
h, m = int(s[0]), int(s[1])
curtime = (maxm * h) + m
maxtime = maxh * maxm
#print(curtime, maxtime)
while True:
if isitok(curtime):
h, m = curtime // maxm, curtime % maxm
print("{:02}".format(h)+":"+"{:02}".format(m))
break
curtime += 1
curtime %= maxtime
q = int(input())
for _ in range(q):
do()
#print("--")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
const int kN = 61 + 5;
int m, a[kN];
bool f[kN][kN][kN * (kN - 1) / 2];
bool ok(int i, int j, int k) {
if (i < 0 || i > m || j < 0 || j > 61 || k < 0 || k > 61 * 30) return false;
if ((j - 1) * j / 2 > k) return false;
return true;
}
int main() {
scanf("%d", &m);
for (int i = 1; i <= m; ++i) scanf("%d", a + i);
std::sort(a + 1, a + m + 1);
f[0][0][0] = true;
for (int i = 0; i <= m; ++i) {
for (int j = 0; j <= 61; ++j) {
for (int k = j * (j - 1) / 2; k <= 61 * 60 / 2; ++k) {
if (!f[i][j][k]) continue;
if (ok(i + 1, j + 1, k + a[i + 1]))
f[i + 1][j + 1][k + a[i + 1]] = true;
if (i && ok(i, j + 1, k + a[i])) f[i][j + 1][k + a[i]] = true;
}
}
}
bool flag = false;
int i = m, j, k;
for (j = m; j <= 61; ++j) {
if (f[i][j][j * (j - 1) / 2]) {
k = j * (j - 1) / 2;
flag = true;
break;
}
}
if (!flag) return puts("=("), 0;
std::vector<std::pair<int, int>> deg;
while (j) {
if (ok(i, j - 1, k - a[i]) && f[i][j - 1][k - a[i]]) {
deg.emplace_back(a[i], j - 1);
k -= a[i];
j--;
continue;
} else if (ok(i - 1, j - 1, k - a[i]) && f[i - 1][j - 1][k - a[i]]) {
deg.emplace_back(a[i], j - 1);
k -= a[i];
j--;
i--;
}
}
int n = deg.size();
std::vector<std::vector<int>> graph(n, std::vector<int>(n));
while (true) {
std::sort(deg.begin(), deg.end());
if (deg.empty()) break;
int d, id;
std::tie(d, id) = deg.back();
deg.pop_back();
assert(d <= deg.size());
for (int i = 0; i < d; ++i) {
graph[id][deg[i].second] = 1;
}
for (int i = d; i < deg.size(); ++i) {
graph[deg[i].second][id] = 1;
deg[i].first--;
}
}
printf("%d\n", n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) printf("%d", graph[i][j]);
puts("");
}
}
| 10 | CPP |
n=int(input())
count=0
for i in range(n):
i=input()
if i=="Tetrahedron":
count+=4
if i=="Cube":
count+=6
if i =="Octahedron" :
count+=8
if i=="Dodecahedron":
count+=12
if i=="Icosahedron":
count+=20
print(count)
| 7 | PYTHON3 |
a=str(input())
c=[]
b=[int(i) for i in a.split()]
for i in b:
if i not in c:
c.append(i)
print(len(b)-len(c)) | 7 | PYTHON3 |
// this code is moriizumi's code
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin >> n, n) {
vector<string> a(n); FOR(i,0,n) cin >> a[i];
int maxi = 1e9+2, mini = -1e9-2;
FOR(i,0,n) {
if (a[i][0] == 'x') {
if(i > 0) {
if(a[i-1][0] == 'x') {
maxi = -1e9, mini = 1e9;
break;
}
if(i % 2) mini = max(mini, stoi(a[i-1]) + 1);
else maxi = min(maxi, stoi(a[i-1]) - 1);
}
if(i < n - 1) {
if(a[i+1][0] == 'x') {
maxi = -1e9, mini = 1e9;
break;
}
if(i % 2) mini = max(mini, stoi(a[i+1]) + 1);
else maxi = min(maxi, stoi(a[i+1]) - 1);
}
} else {
int p = stoi(a[i]);
if(i > 0 && a[i-1][0] != 'x') {
int q = stoi(a[i-1]);
if((i % 2 && p <= q) || (!(i % 2) && p >= q)) {
maxi = -1e9, mini = 1e9;
break;
}
}
}
}
if(maxi < mini) cout << "none" << endl;
else if(maxi > mini) cout << "ambiguous" << endl;
else cout << maxi << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
const int N = 1e6 + 50;
int n, m, w[N], c[N], s[N];
bool vis[N];
std::vector<std::pair<int, int> > G[N];
template <int T>
struct fast_io {
char p[T], q[T], *p1, *p2, *q1, *q2;
fast_io() {
p1 = p2 = p;
q1 = q, q2 = q + T;
}
inline char gc() {
return p1 == p2 && (p2 = (p1 = p) + fread(p, 1, T, stdin), p1 == p2)
? EOF
: *p1++;
}
inline void pc(char c) {
if (q1 == q2) q2 = (q1 = q) + fwrite(q, 1, T, stdout);
*q1++ = c;
}
~fast_io() { fwrite(q, 1, q1 - q, stdout); }
};
fast_io<1 << 20> io;
inline int64_t read() {
int64_t res = 0, neg = 1;
char ch;
do {
ch = io.gc();
if (ch == '-') neg = -1;
} while (ch < 48 || ch > 57);
do res = res * 10 + ch - 48, ch = io.gc();
while (ch >= 48 && ch <= 57);
return res * neg;
}
inline void put(int64_t x) {
if (x < 0) io.pc('-'), x = -x;
if (x >= 10) put(x / 10);
io.pc(48 + x % 10);
}
inline void output(int64_t x, char ch = ' ') {
put(x);
io.pc(ch);
}
int main() {
n = read(), m = read();
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
if (u < v) std::swap(u, v);
G[u].emplace_back(v, i);
w[i] = 1;
++s[u], ++s[v];
}
for (int x = 1; x <= n; ++x) {
for (auto &[y, i] : G[x]) {
if (!c[y]) {
++c[y];
--w[i];
--s[x];
}
vis[s[y]] = true;
}
int &cur = s[x];
for (auto &[y, i] : G[x]) {
if (!vis[cur]) break;
--c[y];
++w[i];
++cur;
}
for (auto &[y, i] : G[x]) vis[s[y]] = false;
}
std::vector<int> res;
for (int i = 1; i <= n; ++i)
if (c[i]) res.push_back(i);
printf("%d\n", res.size());
for (int x : res) printf("%d ", x);
putchar('\n');
for (int x = 1; x <= n; ++x)
for (auto &[y, i] : G[x]) printf("%d %d %d\n", x, y, w[i]);
return 0;
}
| 21 | CPP |
first = input().split(' ')
day = int(input())
tmp = []
tmp.append(first[0] + ' ' + first[1])
while day:
second = input().split(' ')
if (first[0] == second[0]):
tmp.append(first[1] + ' ' + second[1])
else:
tmp.append(first[0] + ' ' + second[1])
first = tmp[-1].split(' ')
day -= 1
for i in tmp:
print(i) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
st = input()
length = len(st)-2
if (length <= 8):
print(st)
else:
print(st[0] + str(length) + st[length + 1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int P = 107;
pair<unsigned long long, int> operator+(
const pair<unsigned long long, int> &first, const char &second) {
return make_pair(first.first * P + second, first.second + 1);
}
pair<unsigned long long, int> S[205], H[2005];
char A[1000005], B[205];
int ans[2005], a[2005];
int main() {
gets(A);
gets(B);
int L1 = strlen(A);
int L2 = strlen(B);
int n;
scanf("%d", &n);
for (int i = 0; i < L1; i++) H[i % n] = H[i % n] + (A[i] - 32);
int lmin = H[n - 1].second ? H[n - 1].second : H[0].second,
lmax = H[0].second;
int lef = (L2 - 1) / lmax + 1, rig = L2 / lmin;
ans[0] = 2;
for (int i = lef; i <= rig; i++) {
for (int j = 0; j < i; j++) S[j].first = S[j].second = 0;
for (int j = 0; j < L2; j++) S[j % i] = S[j % i] + (B[j] - 32);
int j = n - 1, now = i - 1;
memset(a, 0, sizeof(a));
for (; j + 1 && now + 1; j--)
if (H[j] == S[now]) now--, a[j] = 1;
if (now + 1) continue;
for (int j = 0; j < n; j++)
if (a[j] != ans[j]) {
if (a[j] > ans[j]) goto fail;
break;
}
for (int j = 0; j < n; j++) ans[j] = a[j];
fail:;
}
if (ans[0] == 2) return puts("0"), 0;
for (int i = 0; i < n; i++) printf("%d", ans[i]);
puts("");
}
| 11 | CPP |
n=int(input())
a=0
b=0
c=0
for i in range(n):
x,y,z=[int(i) for i in input().split()]
a+=x
b+=y
c+=z
if a==0 and b==0 and c==0:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
inp = input().split("+")
lis = [int(i) for i in inp]
lis.sort()
print(lis[0],end='',sep='')
for i in range(1,len(lis)):
print("+",lis[i],end='',sep='')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dig[11], ans, len;
void f(long long n) {
len = 0;
while (n) {
dig[++len] = n % 10;
n /= 10;
}
}
void judge(int x) {
bool f = 0;
while (x) {
int xx = x % 10;
for (int i = 1; i <= len; i++) {
if (xx == dig[i]) {
ans++;
f = 1;
break;
}
}
x /= 10;
if (f == 1) break;
}
}
int main() {
long long n;
cin >> n;
f(n);
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
judge(i);
if (i * i != n) {
judge(n / i);
}
}
}
cout << ans << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[123];
int n;
bool check(int u) { return n <= (u * u + 1) / 2; }
int main() {
while (~scanf("%d", &n)) {
if (n == 1)
cout << 1 << endl;
else if (n == 2)
cout << 3 << endl;
else if (n == 3)
cout << 5 << endl;
else {
for (int i = 3;; i += 2) {
if (check(i)) {
cout << i << endl;
break;
}
}
}
}
return 0;
}
| 7 | CPP |
from decimal import *
getcontext().prec = 30
T = int(input())
o = []
for i in range(T):
h, c, t = input().split()
h = int(h)
c = int(c)
t = int(t)
s = (h + c) / 2
if t >= h:
o.append(1)
elif t <= s:
o.append(2)
else:
i = (h - t) / (2 * t - (h + c))
#print(i)
if i == int(i):
i = int(i)
o.append(2 * i + 1)
else:
i = Decimal(int(i))
h = Decimal(h)
c = Decimal(c)
t = Decimal(t)
prev = ((i+1) * h + i * c) / (2 * i + 1)
i += 1
cur = ((i+1) * h + i * c) / (2 * i + 1)
#print(prev, cur, t)
#print(abs(cur - t), abs(prev - t))
if abs(cur - t) >= abs(prev - t):
o.append((i - 1) * 2 + 1)
else:
o.append(i * 2 + 1)
for i in range(T):
print(o[ i ])
#'499981', found: '499979'
# 999977 17 499998
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dir1[8][2] = {1, 2, 2, 1, 2, -1, 1, -2, -1, 2, -2, 1, -1, -2, -2, -1};
int dir2[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int dir3[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
bool Isleap(int year) {
if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) return true;
return false;
}
bool isPrime(int x) {
if (x == 1)
return false;
else if (x == 2)
return true;
for (int i = 2; i <= sqrt(x * 1.0); ++i) {
if (x % i == 0) return false;
}
return true;
}
int sqr(int x) { return x * x; }
int ti[120];
int main() {
int n;
while (~scanf("%d%*c", &n)) {
int hh, mm;
string s1, s;
for (int i = 1; i <= n; ++i) {
scanf("[%d:%d", &hh, &mm);
cin >> s1;
getline(cin, s);
if (hh == 12) hh = 0;
if (s1[0] == 'a')
ti[i] = mm + hh * 60;
else
ti[i] = mm + hh * 60 + 12 * 60;
}
int ans = 0, cnt = 0;
for (int i = 2; i <= n; ++i) {
if (ti[i] == ti[i - 1]) {
cnt++;
} else
cnt = 0;
if (cnt == 10) {
cnt = 0;
ans++;
}
if (ti[i] < ti[i - 1]) ans++;
}
printf("%d\n", ans + 1);
}
return 0;
}
| 10 | CPP |
z,zz=input,lambda:list(map(int,z().split()))
zzz=lambda:[int(i) for i in stdin.readline().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f
from bisect import bisect as bs
from bisect import bisect_left as bsl
from itertools import accumulate as ac
def lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))
def prime(x):
p=ceil(x**.5)+1
for i in range(2,p):
if (x%i==0 and x!=2) or x==0:return 0
return 1
def dfs(u,visit,graph):
visit[u]=True
for i in graph[u]:
if not visit[i]:
dfs(i,visit,graph)
###########################---Test-Case---#################################
"""
"""
###########################---START-CODING---##############################
l=z()
p=[0]
for i in range(len(l)-1):
if l[i]==l[i+1]:
p.append(1+p[-1])
else:
p.append(p[-1])
ans=[]
for _ in range(int(z())):
l,r=zz()
l-=1
r-=1
ans.append((p[r]-p[l]))
print('\n'.join(str(i) for i in ans))
| 8 | PYTHON3 |
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <queue>
using namespace std;
const int maxn=185+5;
int n,m;
char s[maxn][maxn];
int dp[maxn][maxn][maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i=1;i<=n;++i)
scanf("%s",s[i]+1);
for (int i=1;i<=n;++i)
for (int j=m;j>=1;--j){
dp[i][j][j]=s[i][j]==s[i-1][j]?dp[i-1][j][j]+1:1;
for (int k=j+1;k<=m;++k)
dp[i][j][k]=s[i][k]==s[i][k-1]?min(dp[i][j][k-1],dp[i][j+1][k]):0;
}
if (dp[n][1][m]==n) return puts("0"),0;
for (int depth=1;;++depth){
for (int i=n;i>=1;--i){
for (int j=1;j<=m;++j){
vector<int>tmp(m+1);
for (int k=j+1,p=j;k<=m;++k){
while(p+2<k&&dp[i][j][p]>dp[i][p+1][k]&&dp[i][j][p+1]>dp[i][p+2][k]) ++p;
tmp[k]=max(tmp[k],min(dp[i][j][p],dp[i][p+1][k]));
if (p+2<=k) tmp[k]=max(tmp[k],min(dp[i][j][p+1],dp[i][p+2][k]));
}
for (int k=j;k<=m;++k)
dp[i][j][k]=max(dp[i-dp[i][j][k]][j][k]+dp[i][j][k],tmp[k]);
}
}
if (dp[n][1][m]==n){printf("%d\n",depth);break;}
}
} | 0 | CPP |
n=int(input())
testStr=input()
ones=testStr.count("1")
zeroes=testStr.count("0")
print(abs(ones-zeroes))
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; int M; cin >> N >> M;
//
int tim=1900*M+100*(N-M);
cout << tim*(1<<M) << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << " " << H; dbg_out(T...); }
#ifdef SMIE
#define debug(args...) cerr << "(" << #args << "):", dbg_out(args)
#else
#define debug(args...)
#endif
int main() {
ios_base::sync_with_stdio(false); //don't mix C and C++ input output
cin.tie(NULL); //remove line for interactive problem
int tests;
cin >> tests;
while (tests-- > 0) {
int n;
vector<int> points;
cin >> n;
for (int i = 0; i < n; i++) {
int cur;
cin >> cur;
points.emplace_back(cur);
}
set<int> areas;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
areas.emplace(points[i] - points[j]);
}
}
cout << areas.size() << '\n';
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
vector<long long> v;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n, i, j, maxx = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
maxx = max(maxx, a[i]);
}
long long l;
for (i = 1; i <= n; i++) {
l = maxx - a[i];
if (l > 0) {
v.push_back(l);
}
}
if (v.size() == 1) {
cout << 1 << " " << v[0] << endl;
return 0;
}
int len = v.size();
long long minn, ans = 0;
minn = gcd(v[0], v[1]);
for (i = 1; i < len - 1; i++) {
minn = min(gcd(v[i], v[i + 1]), minn);
}
for (i = 0; i < len; i++) {
ans += (v[i] / minn);
}
cout << ans << " " << minn;
return 0;
}
| 10 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans1 = a[0]
for i in range(0, n):
if ans1 % a[i] != 0:
print(ans1, a[i])
break
else:
if i and a[i] == a[i - 1]:
print(ans1, a[i])
break | 8 | PYTHON3 |
a=input().lower()
b=input().lower()
for i in range(len(a)):
if a[i] < b[i]:
print(-1)
break
elif a[i] > b[i]:
print(1)
break
else:
if i==len(a)-1:
print(0)
break
else:
continue
| 7 | PYTHON3 |
n = int(input())
a = [int(a_i) for a_i in input().split()]
max_ones = 0
for i in range(n):
for j in range(i, n):
temp = sum(a) - a[i:j+1].count(1) + a[i:j+1].count(0)
if max_ones < temp:
max_ones = temp
print(max_ones) | 7 | PYTHON3 |
stations = int(input())
ab = [list(map(int,input().split())) for _ in range(stations)]
diff_array = [ab[i][1]-ab[i][0] for i in range(len(ab))]
max_cap = 0
running_cap = 0
for i in range(len(diff_array)):
running_cap += diff_array[i]
if running_cap > max_cap:
max_cap = running_cap
print(max_cap)
| 7 | PYTHON3 |
# cook your dish here
t=int(input())
for i in range(t):
a,b,c=map(int,input().split())
if(a==b and b==c):
print(0)
else:
x=abs(a-b)+abs(b-c)+abs(c-a)-4
print(max(0,x)) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
x = [bin(int(i))[2:] for i in input().split()]
l = x[0]
r = x[1]
if(len(l) != len(r)):
if( '1' * len(r) == r):
print(int(r,2))
else:
print(int('1'*(len(r) - 1), 2))
else:
j = 0
while(j < len(r) and l[j] == r[j]):
j+=1
#print(l,j)
if( '1' * len(r[j:]) == r[j:]):
print(int(r,2))
else:
print(int(r[:j]+'0'+'1'*(len(r[j:]) - 1), 2)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += max(0, a[j] - j / i);
}
if (sum >= m) {
cout << i << endl;
return 0;
}
}
cout << "-1";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-6;
const int MAX_N = 305;
char s[MAX_N][MAX_N];
bool vist[MAX_N][MAX_N];
int n;
bool Solve() {
char x = s[0][0], o = s[0][1];
if (x == o) {
return false;
}
int l = 0, r = n - 1;
for (int i = 0; i < n; i++) {
if (s[i][l] != x || s[i][r] != x) {
return false;
}
vist[i][l] = true;
vist[i][r] = true;
l++, r--;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (!vist[i][j] && s[i][j] != o) {
return false;
}
}
}
return true;
}
int main() {
while (cin >> n) {
memset(vist, 0, sizeof(vist));
for (int i = 0; i < n; i++) {
cin >> s[i];
}
if (Solve()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 251234;
bool path;
int n, k, m, dep[maxn], f[maxn], lim;
vector<int> G[maxn], back[maxn], leaves;
void dfs(int u, int p) {
bool lv = true;
f[u] = p;
dep[u] = dep[p] + 1;
if (dep[u] >= lim) {
path = true;
puts("PATH");
printf("%d\n", dep[u]);
printf("%d ", u);
return;
}
for (int v : G[u]) {
if (dep[v]) {
if (v != p) back[u].emplace_back(v);
continue;
}
lv = false;
dfs(v, u);
if (path) {
printf("%d ", u);
return;
}
}
if (lv) leaves.emplace_back(u);
}
bool check(int lv, int par) {
if ((dep[lv] - dep[par] + 1) % 3 == 0) return false;
printf("%d\n", dep[lv] - dep[par] + 1);
for (int u = lv; u != par; u = f[u]) printf("%d ", u);
printf("%d\n", par);
return true;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
lim = n / k + (n % k > 0);
while (m--) {
int u, v;
scanf("%d%d", &u, &v);
G[u].emplace_back(v);
G[v].emplace_back(u);
}
dfs(1, 0);
if (path) return 0;
puts("CYCLES");
assert(leaves.size() >= k);
for (int(i) = (0); (i) <= ((k)-1); (i)++) {
int u = leaves[i];
assert(back[u].size() >= 2);
int p = back[u][0], q = back[u][1];
if (dep[p] > dep[q]) swap(p, q);
if (check(u, p)) continue;
if (check(u, q)) continue;
printf("%d\n", dep[q] - dep[p] + 2);
printf("%d ", u);
for (int v = q; v != p; v = f[v]) printf("%d ", v);
printf("%d\n", p);
}
}
| 11 | CPP |
#include <stdio.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, m, f[64][64];
void rec(int x, int y) {
if (f[x][y] == 0) return ;
f[x][y] = 0;
rep (i, 3) rep (j, 3) rec(x+i-1, y+j-1);
}
int main() {
for (;;) {
scanf("%d%d", &m, &n);
if (n == 0) return 0;
memset(f, 0, sizeof(f));
rep (i, n) rep (j, m) scanf("%d", f[i+1]+j+1);
int c = 0;
rep (i, n) rep (j, m) if (f[i+1][j+1]) c++, rec(i+1, j+1);
printf("%d\n", c);
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, pair<int, int> > > edges;
vector<pair<int, int> > g[100005];
long long D[100005], P[100005];
bool vis[100005];
int p[100005];
int root(int a) { return p[a] == a ? a : (p[a] = root(p[a])); }
void merge(int a, int b) {
a = root(a), b = root(b);
if (a != b) p[a] = b;
}
int main() {
memset(D, -1, sizeof(D));
int n, m, k;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) p[i] = i;
for (int i = 1; i <= m; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
g[a].push_back(pair<int, int>(b, c));
g[b].push_back(pair<int, int>(a, c));
}
priority_queue<pair<long long, int> > pq;
scanf("%d", &k);
for (int i = 1; i <= k; i++) {
int x;
scanf("%d", &x);
vis[x] = 1;
D[x] = 0;
P[x] = x;
pq.push(pair<long long, int>(0, x));
}
while (!pq.empty()) {
int u = pq.top().second;
long long val = -pq.top().first;
pq.pop();
if (val != D[u]) continue;
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i].first, w = g[u][i].second;
if (D[v] == -1 || D[v] > D[u] + w) {
D[v] = D[u] + w;
P[v] = P[u];
pq.push(pair<long long, int>(-D[v], v));
}
}
}
long long ans = 0;
for (int u = 1; u <= n; u++) {
for (int j = 0; j < g[u].size(); j++) {
int v = g[u][j].first, w = g[u][j].second;
edges.push_back(pair<long long, pair<int, int> >(
w + D[u] + D[v], pair<int, int>(P[u], P[v])));
}
}
sort(edges.begin(), edges.end());
for (int i = 0; i < edges.size(); i++) {
long long w = edges[i].first, u = edges[i].second.first,
v = edges[i].second.second;
if (root(u) == root(v)) continue;
ans += w;
merge(u, v);
}
if (!vis[1]) ans += D[1];
printf("%lld\n", ans);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
vector<long long> adj[100001];
long long vis[100001] = {0};
map<pair<long long, long long>, long long> flag;
long long cycles = 0;
void dfs(long long node, long long par) {
vis[node] = 1;
for (auto child : adj[node]) {
if (vis[child] == 0) {
dfs(child, node);
} else {
if (child != par) {
if (flag[{node, child}] == 0 && flag[{child, node}] == 0) {
cycles++;
flag[{child, node}] = 1;
}
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, k;
cin >> n >> k;
map<pair<long long, long long>, long long> ctr;
long long ans = 0;
for (long long i = 0; i < (k); i++) {
long long x, y;
cin >> x >> y;
if (ctr[{x, y}] == 1 || ctr[{y, x}] == 1) {
ans++;
} else {
adj[x].push_back(y);
adj[y].push_back(x);
ctr[{x, y}] = 1;
}
}
for (long long i = (1); i <= (n); i++) {
if (vis[i] == 0) {
dfs(i, -1);
}
}
cout << ans + cycles << "\n";
return 0;
}
| 10 | CPP |
from fractions import gcd
for _ in range(int(input())):
n, m = map(int, input().split())
if gcd(n, m) == 1:
print('Finite')
else:
print('Infinite')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> vs;
long long int n, m, b, k, x1[200010], x2[200010], z, c, s = 0, ans, ab, ac, d,
a;
string j, t;
char e;
int main() {
cin >> n;
for (int r = 0; r < n; r++) {
cin >> x1[r];
}
for (int r = 1; r < n - 1; r++) {
if (x1[r - 1] == 1 && x1[r + 1] == 1 && x1[r] == 0) {
vs.push_back(make_pair(r - 1, r + 1));
}
}
for (int r = 1; r < vs.size(); r++) {
if (vs[r - 1].second == vs[r].first) {
c++;
r++;
}
}
cout << vs.size() - c;
return 0;
}
| 8 | CPP |
import re
print(len(re.search('A\w*Z',input()).group(0))) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> rows[26], cols[26];
char board[2010][2010];
int ovr, ovc;
array<int, 4> ans[26];
void solve() {
int n, m, big = -1;
cin >> n >> m;
for (int i = 0; i < 26; i++) {
rows[i].clear();
cols[i].clear();
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> board[i][j];
if (board[i][j] == '.') continue;
rows[board[i][j] - 'a'].insert(i);
cols[board[i][j] - 'a'].insert(j);
big = max(big, board[i][j] - 'a');
}
}
if (big == -1) {
cout << "YES\n";
cout << "0\n";
return;
}
for (int i = 0; i < 26; i++) {
if (cols[i].size() > 1 && rows[i].size() > 1) {
cout << "NO\n";
return;
}
if (cols[i].size() > 0 && rows[i].size() > 0) {
ovr = *(rows[i].begin());
ovc = *(cols[i].begin());
}
}
for (int c = 0; c <= big; c++) {
if (rows[c].empty()) {
ans[c] = {ovr, ovc, ovr, ovc};
continue;
}
if (rows[c].size() == 1) {
int x = *(rows[c].begin());
int l, r;
for (int i = 1; i <= m; i++) {
if (board[x][i] == 'a' + c) {
l = i;
break;
}
}
for (int i = m; i >= 1; i--) {
if (board[x][i] == 'a' + c) {
r = i;
break;
}
}
for (int k = l; k <= r; k++) {
if (board[x][k] - 'a' < c) {
cout << "NO\n";
return;
}
}
ans[c] = {x, l, x, r};
} else {
int x = *(cols[c].begin());
int l, r;
for (int i = 1; i <= n; i++) {
if (board[i][x] == 'a' + c) {
l = i;
break;
}
}
for (int i = n; i >= 1; i--) {
if (board[i][x] == 'a' + c) {
r = i;
break;
}
}
for (int k = l; k <= r; k++) {
if (board[k][x] - 'a' < c) {
cout << "NO\n";
return;
}
}
ans[c] = {l, x, r, x};
}
}
cout << "YES\n";
cout << big + 1 << '\n';
for (int i = 0; i <= big; i++) {
for (int j = 0; j < 4; j++) cout << ans[i][j] << " ";
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d;
cin >> d;
while (d--) solve();
}
| 11 | CPP |
def wieght(w):
if w%2==0 and w!=2 and w!=1:
return "YES"
else:
return"NO"
w=int(input())
print(wieght(w)) | 7 | PYTHON3 |
t = int(input())
for y in range(t):
s = input()
ct = 0
n = dict()
e = dict()
w = dict()
ss = dict()
x,y = 0,0
for i in s:
dx,dy = x,y
if i == 'N':
dx += 1
if (x,y) in ss or (dx,dy) in n:
ct += 1
else:
ct += 5
n[(dx,dy)] = 1
if i == 'E':
dy += 1
if (x,y) in w or (dx,dy) in e:
ct += 1
else:
ct += 5
e[(dx,dy)] = 1
if i == 'W':
dy -= 1
if (x,y) in e or (dx,dy) in w:
ct += 1
else:
ct += 5
w[(dx,dy)] = 1
if i == 'S':
dx -= 1
if (x,y) in n or (dx,dy) in ss:
ct += 1
else:
ct += 5
ss[(dx,dy)] = 1
x = dx
y = dy
print(ct)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string S;
cin>>S;
int L=0;
int D=0;
for(int i=0;i<N;i++){
if(S.at(i)=='('){
L++;
}
else L--;
D=min(D,L);
}
for(int i=D;i<0;i++){
cout<<"(";
}
cout<<S;
for(int i=0;i<L-D;i++){
cout<<")";
}
cout<<endl;
return 0;
}
| 0 | CPP |
class Tree:
def __init__(self):
self.root = None
def insert(self, key):
z = Node(key)
y = None # x?????????????´????????????°
# z???parent???????´?
x = self.root
while x:
y = x
if z.key < x.key:
x = x.left
else:
x = x.right
z.parent = y
# z??????????????´??????????´?
if y is None:
self.root = z
elif z.key < y.key:
y.left = z
else:
y.right = z
def find(self, key):
x = self.root
while x and key != x.key:
if key < x.key:
x = x.left
else:
x = x.right
return x
def getSuccessor(self, x):
if x.right is not None:
return self.getMinimum(x.right)
y = x.parent
while y and x == y.right:
x = y
y = y.parent
return y
def getMinimum(self, x):
while x.left is not None:
x = x.left
return x
def delete(self, key):
#??????????±????y???????´?
z = self.find(key)
if z.left is None or z.right is None:
y = z
else:
y = self.getSuccessor(z)
# y??????x????????????
if y.left is not None:
x = y.left
else:
x = y.right
if x is not None:
x.parent = y.parent
if y.parent is None:
self.root = x
elif y == y.parent.left:
y.parent.left = x
else:
y.parent.right = x
if y != z:
z.key = y.key
def show(self):
print(" ", end="")
print(*list(map(str, self.root.inwalk())))
print(" ", end="")
print(*list(map(str, self.root.prewalk())))
class Node:
def __init__(self, key):
self.key = key
self.parent = self.left = self.right = None
def prewalk(self):
nodeList = [self.key]
if self.left:
nodeList += self.left.prewalk()
if self.right:
nodeList += self.right.prewalk()
return nodeList
def inwalk(self):
nodeList = []
if self.left:
nodeList += self.left.inwalk()
nodeList += [self.key]
if self.right:
nodeList += self.right.inwalk()
return nodeList
tree = Tree()
n = int(input())
for i in range(n):
cmd = list(input().split())
if cmd[0] == 'insert':
tree.insert(int(cmd[1]))
elif cmd[0] == 'find':
if tree.find(int(cmd[1])):
print("yes")
else:
print("no")
elif cmd[0] == 'print':
tree.show()
elif cmd[0] == 'delete':
tree.delete(int(cmd[1])) | 0 | PYTHON3 |
import sys
input = sys.stdin.readline
t = int(input())
for i in range(t):
x,y,a,b = map(int,input().split())
ans = 0
if x != a and y != b:
ans += 2
ans += abs(x-a) + abs(y-b)
print(ans) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
srcstr=input()
resstr=""
if len(srcstr)>10:
resstr+=srcstr[0]
resstr+=str(len(srcstr)-2)
resstr+=srcstr[len(srcstr)-1]
else:
resstr=srcstr
print(resstr)
| 7 | PYTHON3 |
Subsets and Splits