solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
s=input()
print(700+100*int(s.count("o")))
| 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a, b;
cin >> a >> b;
bitset <32> bita(a), bitb(b);
cout << (bita & bitb) << endl;
cout << (bita | bitb) << endl;
cout << (bita ^ bitb) << endl;
return 0;
}
| 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
ll _power(ll a, int b)//计算a^b;
{
ll ans=1, res=a;
while(b){
if(b&1) ans=ans*res%mod;
res=res*res%mod;
b>>=1;
}
return ans%mod;
}
ll n,a,b;
ll C(ll xx,ll yy){
ll up=1,down=1;
for(int i=n;i>=xx-yy+1;i--)up=up*i%mod;
for(int i=1;i<=yy;i++)down=down*i%mod;
return up*_power(down,mod-2)%mod;
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>a>>b;
cout<<(_power(2,n)-1+mod-C(n,a)-C(n,b)+mod)%mod<<endl; //有多少个减号加多少个mod
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)5e3 + 5;
struct TSpecial {
int city, k, p;
TSpecial() {}
TSpecial(int city, int k, int p) : city(city), k(k), p(p) {}
bool operator<(const TSpecial& op) const {
if (p != op.p) return p < op.p;
if (k != op.k) return k < op.k;
return city < op.city;
}
} x[N];
int n, m, w, q;
int vis[N];
vector<int> g[N];
int main() {
scanf("%d %d", &n, &m);
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);
}
scanf("%d", &w);
for (int i = 1; i <= w; i++) scanf("%d %d %d", &x[i].city, &x[i].k, &x[i].p);
sort(x + 1, x + 1 + w);
scanf("%d", &q);
while (q--) {
int gg, r, a;
scanf("%d %d %d", &gg, &r, &a);
memset(vis, -1, sizeof vis);
vis[gg] = 0;
queue<int> q;
q.push(gg);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
if (vis[v] == -1) {
vis[v] = vis[u] + 1;
q.push(v);
}
}
}
vector<pair<int, int> > v;
int left = 0, right = n + 1, mid, ans = -1;
while (left <= right) {
v.clear();
mid = 2;
mid = (left + right) >> 1;
for (int i = 1; i <= w; i++)
if (vis[x[i].city] <= mid && vis[x[i].city] != -1)
v.push_back(make_pair(x[i].p, x[i].k));
int has = 0;
long long tmp = 0;
bool ok = false;
for (int i = 0; i < v.size(); i++) {
int pp = v[i].first;
int kk = v[i].second;
int x = min(kk, r - has);
tmp += 1LL * x * pp;
has += x;
if (has >= r && tmp <= a) {
ok = true;
break;
}
}
if (ok) {
ans = mid;
right = mid - 1;
} else
left = mid + 1;
}
printf("%d\n", ans);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void re(int& x);
template <class T, class... Ts>
void re(T& t, Ts&... ts);
void pr(int x);
void pr(const char* x);
void ps();
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts);
int e, s, n, m;
int query[210000];
pair<int, int> sta[210000];
vector<pair<int, int> > ev;
pair<int, int> ans[210000];
int has[10];
void solve() {
re(e, s, n, m);
for (int i = 0; i < (n); ++i) re(sta[i].first, sta[i].second);
for (int i = 0; i < (m); ++i) re(query[i]);
for (int i = 0; i < (n); ++i) {
ev.emplace_back(max(-e, -sta[i].second - s), sta[i].first);
ev.emplace_back(max(-e, -sta[i].second), -sta[i].first);
}
for (int i = 0; i < (m); ++i) {
ev.emplace_back(max(-e, -query[i] - s), i + 200);
}
sort((ev).begin(), (ev).end());
pair<int, int> cur = {0, 0};
int la = -e;
for (pair<int, int> p : ev) {
if (p.first != la) {
if (has[3]) {
} else if (has[2] && cur.first != -1)
cur.second += (p.first - la);
else if (has[1] && cur.first != -1)
cur.first += (p.first - la);
else
cur = {-1, -1};
}
la = p.first;
if (p.second < 200) {
if (p.second < 0)
has[(-p.second)]--;
else
has[p.second]++;
} else {
ans[p.second - 200] = cur;
}
}
for (int i = 0; i < (m); ++i) ps(ans[i].first, ans[i].second);
}
int main() { solve(); }
void re(int& x) { scanf("%d", &x); }
template <class T, class... Ts>
void re(T& t, Ts&... ts) {
re(t);
re(ts...);
}
void pr(int x) { printf("%d", x); }
void pr(const char* x) { printf("%s", x); }
void ps() { pr("\n"); }
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
pr(t);
if (sizeof...(ts)) pr(" ");
ps(ts...);
}
| 11 | CPP |
t=int(input())
for _ in range(t):
n1,n2=map(int,input().split())
if(n1%n2==0):
print("0")
else:
n=n1//n2
n3=n2*(n+1)
print(n3-n1)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
vector<pair<long long, long long>> Left;
vector<pair<long long, long long>> Right;
void print_vector(const vector<pair<long long, long long>> &v) {
for (auto el : v) {
cout << el.first << " " << el.second << endl;
}
}
void load() {
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(a);
}
}
void init_sums(const vector<int> &v, vector<pair<long long, long long>> *sums) {
long long sum_even = 0;
long long sum_odd = 0;
(*sums).push_back(make_pair(sum_even, sum_odd));
for (int i = 1; i < v.size(); ++i) {
if (i % 2 == 0) {
sum_even = (*sums)[i - 1].first + v[i - 1];
sum_odd = (*sums)[i - 1].second;
} else {
sum_even = (*sums)[i - 1].first;
sum_odd = (*sums)[i - 1].second + v[i - 1];
}
(*sums).push_back(make_pair(sum_even, sum_odd));
}
}
void init() {
vector<int> v_cpy(v);
init_sums(v_cpy, &Left);
reverse(v_cpy.begin(), v_cpy.end());
init_sums(v_cpy, &Right);
reverse(Right.begin(), Right.end());
}
bool is_good(int candy_idx) {
long long sum_even, sum_odd;
if ((n - 1) % 2 == 0) {
sum_even = Left[candy_idx].first + Right[candy_idx].second;
sum_odd = Left[candy_idx].second + Right[candy_idx].first;
} else {
sum_even = Left[candy_idx].first + Right[candy_idx].first;
sum_odd = Left[candy_idx].second + Right[candy_idx].second;
}
return sum_even == sum_odd;
}
void solve() {
init();
int sol = 0;
for (int i = 0; i < v.size(); ++i) {
if (is_good(i)) {
sol++;
}
}
cout << sol << endl;
}
int main() {
load();
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void check() { cout << endl << "Checked!" << endl; }
inline void intialize() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout.tie(0);
}
int main() {
intialize();
int n, i, j, k, ma = -1, ans = 1;
cin >> n;
int arr[n];
for (i = 0; i < n; ++i) {
cin >> arr[i];
if (arr[i] > ma) {
ma = arr[i];
}
}
int temp;
for (i = 0; i < n; ++i) {
if (arr[i] == ma) {
temp = 1;
for (j = i + 1; j < n; ++j) {
if (arr[j] == ma)
temp++;
else
break;
}
ans = max(ans, temp);
i = j;
}
}
cout << ans << endl;
}
| 7 | CPP |
n = int(input())
arr = input().split()
arr = list(arr)
m = [0] * 100000
ans = [0] * 100000
for i in range(n):
m[int(arr[i]) - 1] += int(arr[i])
ans[0],ans[1],ans[2] = m[0],m[1],m[2] + m[0]
for i in range(3,len(ans)):
ans[i] = max(ans[i - 2],ans[i - 3]) + m[i]
print(max(ans[99998], ans[99999]))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct people {
int t;
int x;
int c;
} a[100005];
int m, n, w[100005], ti, te, sl;
bool sorted_by_t(people a, people b) { return a.t < b.t; }
bool sorted_by_x(people a, people b) { return a.x < b.x; }
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].t, &a[i].x), a[i].c = i;
sort(a + 1, a + n + 1, sorted_by_t);
ti = 0;
for (int i = 1; i <= n; i += m) {
int j = min(i + m - 1, n);
ti = max(ti, a[j].t);
sort(a + i, a + j + 1, sorted_by_x);
a[i - 1].x = 0;
sl = -2;
te = 0;
for (int z = i; z <= j; z++) {
if (a[z].x == a[z - 1].x) {
w[a[z].c] = te;
sl++;
} else {
ti += a[z].x - a[z - 1].x;
ti += 1 + sl / 2;
te = ti;
w[a[z].c] = te;
sl = 1;
}
}
ti += a[j].x + 1 + sl / 2;
}
for (int i = 1; i <= n; i++) printf("%d ", w[i]);
return 0;
}
| 9 | CPP |
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.buffer.readline
def read_int_n():
return list(map(int, input().split()))
def slv(N, S, A):
M = 998244353
ans = 0
dp = [0] * (S+1)
for a in A:
dp[0] += 1
ndp = [0] * (S+1)
for j in range(S+1):
ndp[j] += dp[j]
ndp[j] %= M
if j+a <= S:
ndp[j+a] += dp[j]
ndp[j+a] %= M
dp = ndp
ans += dp[S]
ans %= M
return ans
def main():
N, S = read_int_n()
A = read_int_n()
print(slv(N, S, A))
if __name__ == '__main__':
main()
| 0 | PYTHON3 |
class SWAG():
__slots__='unit','f','fold_r','fold_l','data_r','data_l'
def __init__(self,unit,f,data):
self.unit=unit
self.f=f
self.construct(data)
def construct(self,data):
self.fold_r=[self.unit]
self.fold_l=[self.unit]
self.data_r=[]
self.data_l=[]
sep=len(data)//2
for t in data[sep+1:]:
self.append(t)
for t in data[sep::-1]:
self.appendleft(t)
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.construct(self.data_l[::-1])
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.construct(self.data_r)
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=map(int,open(0).read().split())
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min,p[:k-1])
s_max=SWAG(0,max,p[1:k])
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print(x+f) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long parse(string &s, int base) {
long long v = 0;
for (int i = 0; i < s.size(); i++) {
v *= base;
v += (s[i] > '9') ? (s[i] - 'A' + 10) : (s[i] - '0');
}
return v;
}
string toBase(long long v, int base) {
if (v == 0) return "0";
string res;
while (v > 0) {
int c = (v % base);
res = (char)(c > 9 ? (c - 10 + 'A') : (c + '0')) + res;
v /= base;
}
return res;
}
string toRoman(long long v) {
static string P[] = {"I", "IV", "V", "IX", "X", "XL", "L",
"XC", "C", "CD", "D", "CM", "M"};
static long long Pr[] = {1, 4, 5, 9, 10, 40, 50,
90, 100, 400, 500, 900, 1000};
string res;
while (v > 0) {
for (int i = 12; i >= 0; i--)
if (v >= Pr[i]) {
v -= Pr[i];
res += P[i];
break;
}
}
return res;
}
int main() {
int a;
string b, c;
cin >> a >> b >> c;
long long C = parse(c, a);
if (b == "R") {
cout << toRoman(C);
} else {
cout << toBase(C, parse(b, 10));
}
return 0;
}
| 9 | CPP |
for _ in range(int(input())):
n,k = map(int,input().split())
ai = list(map(int,input().split()))
bi = list(map(int,input().split()))
cnt = 0
for i in range(len(ai)):
if min(ai) < max(bi) and cnt != k:
ind1 = ai.index(min(ai))
ind2 = bi.index(max(bi))
ai[ind1],bi[ind2] = bi[ind2],ai[ind1]
bi.pop(ind2)
cnt += 1
print(sum(ai)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dp[1024][2];
int s[1024];
int n;
int cnt;
int f(int idx, int md) {
if (md && idx == cnt - 1) return 0;
if (dp[idx][md] != -1) return dp[idx][md];
int r;
if (md) {
r = f(idx + 1, 1) + 2;
if (idx + 1 < cnt) {
r = min(r, f(idx + 1, 1) + (s[idx + 1] - s[idx]));
}
} else {
r = f(idx, 1) + 1;
}
return dp[idx][md] = r;
}
int main() {
cin >> n;
int t, prev = -1;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
cin >> t;
if (t == 1) {
s[cnt++] = i;
}
}
if (cnt == 0)
cout << 0 << endl;
else
cout << f(0, 0) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
set<long long> horizontal;
set<long long> vertical;
long long n, m, answer;
cin >> n >> m;
for (int i = 0; i < m; i++) {
long long x, y;
cin >> x >> y;
horizontal.insert(x);
vertical.insert(y);
answer = (n - horizontal.size()) * (n - vertical.size());
cout << answer << " ";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string o;
int x;
char a;
int l = -2000000000, h = 2000000000;
while (n--) {
cin >> o >> x >> a;
if (a == 'Y') {
if (o == ">") {
l = max(l, x + 1);
}
if (o == ">=") {
l = max(l, x);
}
if (o == "<") {
h = min(h, x - 1);
}
if (o == "<=") {
h = min(h, x);
}
} else {
if (o == "<") {
l = max(l, x);
}
if (o == "<=") {
l = max(l, x + 1);
}
if (o == ">") {
h = min(h, x);
}
if (o == ">=") {
h = min(h, x - 1);
}
}
}
if (l > h)
cout << "Impossible" << endl;
else
cout << l << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int dp[1100][1100];
int pre[1100][1100];
char s1[1100], s2[1100];
int cal(int i, int j);
void print(int i, int j);
int main() {
int i, j, k, l, test, t = 1;
scanf("%s", s1 + 1);
scanf("%s", s2 + 1);
k = strlen(s1 + 1);
l = strlen(s2 + 1);
memset(dp, -1, sizeof(dp));
printf("%d\n", cal(k, l));
print(k, l);
return 0;
}
void print(int i, int j) {
if (i == 0 && j == 0) return;
if (s1[i] == s2[j]) {
print(i - 1, j - 1);
} else if (pre[i][j] == 2) {
printf("INSERT %d %c\n", i + 1, s2[j]);
print(i, j - 1);
} else if (pre[i][j] == 1) {
printf("DELETE %d\n", i);
print(i - 1, j);
} else {
printf("REPLACE %d %c\n", i, s2[j]);
print(i - 1, j - 1);
}
}
int cal(int i, int j) {
if (i == 0 && j == 0) return 0;
if (dp[i][j] != -1) return dp[i][j];
if (i == 0) {
pre[i][j] = 2;
return dp[i][j] = cal(i, j - 1) + 1;
}
if (j == 0) {
pre[i][j] = 1;
return dp[i][j] = cal(i - 1, j) + 1;
}
if (s1[i] == s2[j]) {
pre[i][j] = 0;
return dp[i][j] = cal(i - 1, j - 1);
}
int ret = 0, ret1;
ret = cal(i - 1, j) + 1;
pre[i][j] = 1;
ret1 = cal(i, j - 1) + 1;
if (ret1 < ret) {
ret = ret1;
pre[i][j] = 2;
}
ret1 = cal(i - 1, j - 1) + 1;
if (ret1 < ret) {
ret = ret1;
pre[i][j] = 0;
}
return dp[i][j] = ret;
}
| 10 | CPP |
n=int(input())
if n%2==0:
print(-1)
else:
a=[]
b=[]
c=[]
for i in range(n):
a.append(i)
if i==0:
b.append(n-1)
else:
b.append(i-1)
c.append((a[i]+b[i])%n)
print(*a)
print(*b)
print(*c) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxd = 10, maxl = 18, maxs = 81, BLEN = 5, BMSK = 31, maxv = 32175,
maxv2 = 191791;
int htot, cnt[maxv], inc[maxv][maxd + 1], sub[maxv][maxd + 1], ptot,
pos[maxl + 1][maxv];
map<long long, int> Hash;
long long bit[maxd + 1], c[2][maxl + 1];
long long seq[maxv], f[maxv2][maxd + 1][maxd - 1];
bitset<maxs + 1> vis[maxd + 1];
inline int getID(long long msk) {
map<long long, int>::iterator it = Hash.find(msk);
if (it != Hash.end()) return it->second;
seq[htot] = msk;
return Hash[msk] = htot++;
}
void dfs(int dep, int cnt, int sum, long long msk) {
if (dep == maxd) {
for (int i = sum >> 1; i >= 0; --i)
if (vis[dep - 1].test(i)) {
int dif = sum - i - i;
if (dif > 1) {
int idx = getID(msk);
pos[0][idx] = idx;
f[idx][maxd - 1][dif - 1] = 1;
}
break;
}
return;
}
vis[dep] = vis[dep - 1];
dfs(dep + 1, cnt, sum, msk);
while (cnt < maxl) {
vis[dep] |= vis[dep] << dep;
dfs(dep + 1, ++cnt, sum += dep, msk += bit[dep]);
}
}
long long solve(long long lim, int dif) {
if (dif >= maxd - 1) return lim;
char dig[maxl + 3];
int len = sprintf(dig, "%lld", lim), hidx = getID(0), part = 0;
long long ret = lim;
for (int i = 0; i < len; ++i) {
dig[i] -= '0';
if (!dif) {
int odd = dig[i] >> 1, even = (dig[i] + 1) >> 1;
ret -= c[part][len - 1 - i] * odd + c[part ^ 1][len - 1 - i] * even;
part ^= dig[i] & 1;
}
if (hidx >= 0) {
if (len - i > maxl) {
for (int j = 0; j < dig[i]; ++j) {
int hidx2 = inc[hidx][j];
if (hidx2 >= 0) {
int pidx = pos[len - i - 1][hidx2];
if (pidx >= 0) ret -= f[pidx][maxd - 1][dif];
}
}
} else if (dig[i]) {
int pidx = pos[len - i][hidx];
if (pidx >= 0) ret -= f[pidx][dig[i] - 1][dif];
}
hidx = inc[hidx][dig[i]];
}
}
return ret;
}
int main() {
bit[1] = 1;
for (int i = 2; i < maxd; ++i) bit[i] = bit[i - 1] << BLEN;
c[0][0] = 1;
for (int i = 0; i < maxl; ++i) {
int odd = maxd >> 1, even = (maxd + 1) >> 1;
c[0][i + 1] = c[0][i] * even + c[1][i] * odd;
c[1][i + 1] = c[0][i] * odd + c[1][i] * even;
}
memset(inc, -1, sizeof inc);
memset(sub, -1, sizeof sub);
memset(pos, -1, sizeof pos);
vis[0].set(0);
dfs(1, 0, 0, 0);
ptot = htot;
for (int i = 0; i < htot; ++i) {
long long msk = seq[i], tmp = msk;
inc[i][0] = sub[i][0] = i;
for (int j = 1; j < maxd; ++j, tmp >>= BLEN) {
int rem = tmp & BMSK;
if (!rem) continue;
cnt[i] += rem;
int idx = getID(msk - bit[j]);
inc[idx][j] = i;
sub[i][j] = idx;
}
}
for (int i = 0; i <= maxl; ++i) {
for (int hidx = 0; hidx < htot; ++hidx) {
int pidx = pos[i][hidx];
if (pidx < 0) continue;
for (int k = 1; k < maxd; ++k)
for (int d = 1; d < maxd - 1; ++d) f[pidx][k][d] += f[pidx][k - 1][d];
if (i + cnt[hidx] < maxl) {
int pidx2 = pos[i + 1][hidx];
if (pidx2 < 0) pos[i + 1][hidx] = pidx2 = ptot++;
for (int d = 0; d < maxd - 1; ++d)
f[pidx2][0][d] += f[pidx][maxd - 1][d];
}
for (int k = 1; k < maxd; ++k) {
int hidx2 = sub[hidx][k];
if (hidx2 < 0) continue;
int pidx2 = pos[i + 1][hidx2];
if (pidx2 < 0) pos[i + 1][hidx2] = pidx2 = ptot++;
for (int d = 1; d < maxd - 1; ++d)
f[pidx2][k][d] += f[pidx][maxd - 1][d];
}
for (int k = 0; k < maxd; ++k) {
for (int d = 1; d < maxd - 1; d += 2) f[pidx][k][0] += f[pidx][k][d];
for (int d = maxd - 2; d > 1; --d) f[pidx][k][d - 1] += f[pidx][k][d];
}
}
}
int t;
scanf("%d", &t);
for (int Case = 1; Case <= t; ++Case) {
long long L, R;
int k;
scanf("%lld%lld%d", &L, &R, &k);
printf("%lld\n", solve(R + 1, k) - solve(L, k));
}
return 0;
}
| 12 | CPP |
n = int(input())
a = list(input().split(' '))
a = list(int(x) for x in a)
res = sum(a)/2
cur = 0
for i in range(n):
cur += a[i]
if cur >= res:
print(i + 1)
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
const double E = 2.7182818284590452354;
const struct _ {
ios_base::Init i;
_() {
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
} _;
template <class I>
inline void in(I A, I B) {
while (A != B) {
cin >> *A;
++A;
}
}
template <class I>
inline void out(I A, I B, char D = ' ') {
if (A != B) {
cout << *A;
while (++A != B) {
cout << D << *A;
}
}
cout << '\n';
}
template <class T>
inline T sq(const T& X) {
return X * X;
}
template <class T>
inline T power(T X, int Y) {
assert(Y >= 0 && !(X == 0 && Y == 0));
T R = (Y & 1) ? X : 1;
while (Y >>= 1) {
X *= X;
if (Y & 1) R *= X;
}
return R;
}
string arr[100005];
int main() {
int n;
cin >> n;
in(arr, arr + n);
string a;
a.reserve(500000);
for (int i = 0; i < n; i++) {
a += "<3";
a += arr[i];
}
a += "<3";
string b;
cin >> b;
int j = 0;
for (int i = 0; i < static_cast<int>((b).size()); i++) {
if (j < static_cast<int>((a).size()) && a[j] == b[i]) {
j++;
}
}
cout << (j == static_cast<int>((a).size()) ? "yes" : "no") << '\n';
}
| 8 | CPP |
import math
t=int(input())
for i in range(t):
n=int(input())
a=math.sqrt(n)
b=int(a)
x=2*b-1
if a!=b:
c=n-b**2
if c<=b:
x+=1
else:
x+=2
print(x-1) | 9 | PYTHON3 |
n = int(input())
count = 0
d = []
while count < n :
s = int(input())
d.append(s)
count +=1
for x in d :
if x == 0 :
print (0)
elif x %2 == 0 :
b = (x//2)-1
print (b)
else :
b = (x//2)
print (b)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long arr[1002][1002];
bool visited[1002][1002];
long long dx[4] = {0, 0, 1, -1};
long long dy[4] = {1, -1, 0, 0};
void bfs(long long u, long long v) {
arr[u][v] = -1;
for (long long i = 1; i <= 1000; i++) {
if (arr[u][i] == 2) {
arr[u][i] = -1;
bfs(u, i);
}
if (arr[i][v] == 2) {
arr[i][v] = -1;
bfs(i, v);
}
}
}
int main() {
long long n;
memset(visited, 0, sizeof visited);
memset(arr, 0, sizeof arr);
cin >> n;
long long t, u, v;
vector<pair<long long, long long> > vv;
for (long long i = 0; i < n; i++) {
scanf("%lld %lld", &u, &v);
arr[u][v] = 2;
vv.push_back(make_pair(u, v));
}
long long cnt = 0, cnt2 = 0;
sort(vv.begin(), vv.end());
for (long long i = 0; i < n; i++) {
u = vv[i].first;
v = vv[i].second;
if (arr[u][v] == 2) {
cnt++;
bfs(u, v);
}
}
cout << cnt - 1 << endl;
return 0;
}
| 9 | CPP |
num_cases = int(input())
for _ in range(num_cases):
n_candies = int(input())
candies = [int(x) for x in input().split(' ')]
moves = 0
left_size = 0
right_size = 0
prev = 0
side = 0 # 1 if right
while len(candies) > 0:
curr = 0
while curr <= prev and len(candies) > 0:
if side == 0: # consume from the left
c = candies.pop(0)
left_size += c
curr += c
else:
c = candies.pop()
right_size += c
curr += c
prev = curr
side = 1 if side == 0 else 0 # switch sides
moves += 1
print('%d %d %d' % (moves, left_size, right_size)) | 10 | PYTHON3 |
inputLine = input()
myList = inputLine.split(" ")
initial = int(myList[0])
period = int(myList[1])
day = 0
while initial != 0:
initial -= 1
day += 1
if day % period == 0:
initial += 1
print(day) | 7 | PYTHON3 |
s=input();n=len(s)
def f(i,t,k):
if k>n-i:return 0
a=max(t,int(s[i]));i+=1;
return(f(i,9,k)+(a-1)*f(i,9,k-1)+f(i,t,k-1)if k-1 else a+(n-i)*9)if a else f(i,t,k)
print(f(0,0,int(input()))) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
string s;
cin >> s;
ll a = 0;
for (char c : s) a += c - '0';
if (a % 9 == 0) printf("Yes\n");
else printf("No\n");
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long i, j, k, l = 0, m, n;
cin >> n >> k;
long long ara[n];
for (i = 0; i < n; i++) cin >> ara[i];
sort(ara, ara + n);
for (i = 0; i < n; i++) {
if (ara[i] <= ara[0] + k)
continue;
else if ((ara[i] > ara[0] + k) && ara[i] - k <= ara[0] + k)
continue;
else {
cout << -1 << endl;
l++;
break;
}
}
if (l == 0) cout << ara[0] + k << endl;
}
return 0;
}
| 8 | CPP |
matrix=[]
for i in range(5):
s=list(map(int,input().split()))
matrix.append(s)
x=0
y=0
for i in range(5):
for j in range(5):
if matrix[i][j]==1:
x=i
y=j
break
print(abs(x-2)+abs(y-2)) | 7 | PYTHON3 |
t=int(input())
while(t>0):
t-=1
l,r=map(int,input().split())
if l*2>r:
print(-1,-1)
else:
print(l,l*2) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
long long a, b, c;
cin >> a >> b >> c;
cout << ((a + b + c) / 2) << endl;
}
return 0;
}
| 7 | CPP |
T = int(input())
for t in range(T):
n = int(input())
s = list(input())
k = 0
switched = [1]*n
for i in range(n):
for j in range(n-1,i,-1):
if ord(s[i]) > ord(s[j]):
s[i], s[j] = s[j], s[i]
k += switched[i]+switched[j]
switched[i], switched[j] = 0, 0
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T>
void _W(const T &x) {
cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
_W(x.first);
putchar(' ');
_W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
template <class T, class... U>
void DEBUG(const T &head, const U &...tail) {}
int MOD = 1e9 + 7;
void ADD(int64_t &x, int64_t v) {
x = (x + v) % MOD;
if (x < 0) x += MOD;
}
const int SIZE = 4e5 + 10;
int a[SIZE], num[SIZE];
double s[SIZE], _tmp[SIZE][2];
void push(int id) {
if (_tmp[id] == 0) return;
_tmp[id * 2][0] *= _tmp[id][0];
_tmp[id * 2][1] = _tmp[id * 2][1] * _tmp[id][0] + _tmp[id][1];
s[id * 2] = _tmp[id][0] * s[id * 2] + _tmp[id][1] * num[id * 2];
_tmp[id * 2 + 1][0] *= _tmp[id][0];
_tmp[id * 2 + 1][1] = _tmp[id * 2 + 1][1] * _tmp[id][0] + _tmp[id][1];
s[id * 2 + 1] = _tmp[id][0] * s[id * 2 + 1] + _tmp[id][1] * num[id * 2 + 1];
_tmp[id][0] = 1;
_tmp[id][1] = 0;
}
void pull(int id) { s[id] = s[id * 2] + s[id * 2 + 1]; }
void init(int L, int R, int id) {
_tmp[id][0] = 1;
_tmp[id][1] = 0;
if (L == R) {
s[id] = a[L];
num[id] = 1;
return;
}
int mm = (L + R) / 2;
init(L, mm, id * 2);
init(mm + 1, R, id * 2 + 1);
num[id] = num[id * 2] + num[id * 2 + 1];
pull(id);
}
double qq(int L, int R, int id, int ll, int rr) {
if (R < ll || L > rr) return 0;
if (L >= ll && R <= rr) return s[id];
int mm = (L + R) / 2;
push(id);
return qq(L, mm, id * 2, ll, rr) + qq(mm + 1, R, id * 2 + 1, ll, rr);
}
double c1, c2;
void ins(int L, int R, int id, int ll, int rr) {
if (R < ll || L > rr) return;
if (L >= ll && R <= rr) {
s[id] = s[id] * c1 + c2 * num[id];
_tmp[id][0] *= c1;
_tmp[id][1] = _tmp[id][1] * c1 + c2;
return;
}
int mm = (L + R) / 2;
push(id);
ins(L, mm, id * 2, ll, rr);
ins(mm + 1, R, id * 2 + 1, ll, rr);
pull(id);
}
int main() {
int n, q;
R(n, q);
for (int i = (1); i <= (n); ++i) R(a[i]);
init(1, n, 1);
while (q--) {
int ty;
R(ty);
if (ty == 1) {
int l1, r1, l2, r2;
R(l1, r1, l2, r2);
int n1 = r1 - l1 + 1;
int n2 = r2 - l2 + 1;
double v1 = qq(1, n, 1, l1, r1);
double v2 = qq(1, n, 1, l2, r2);
c1 = (n1 - 1.) / n1;
c2 = v2 / ((int64_t)n1 * n2);
ins(1, n, 1, l1, r1);
c1 = (n2 - 1.) / n2;
c2 = v1 / ((int64_t)n1 * n2);
ins(1, n, 1, l2, r2);
} else {
int l, r;
R(l, r);
printf("%.9f\n", qq(1, n, 1, l, r));
}
}
return 0;
}
| 11 | CPP |
a = input()
s=''
if a[0].isupper():
s+=a[0]
else:
s+=a[0].upper()
s+=a[1:]
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const signed inf = 1000000100;
const long long inf64 = 1ll * inf * inf;
const long long mod = 1e9 + 7;
mt19937 rng(0);
void run() {
long long n;
cin >> n;
vector<long long> a(2 * n);
for (auto &i : a) cin >> i;
vector<long long> odd, even;
for (long long i = 0; i < n * 2; ++i) {
if (a[i] % 2)
odd.push_back(i + 1);
else
even.push_back(i + 1);
}
long long del1, del2;
if (odd.size() % 2) {
del1 = even[0];
del2 = odd[0];
} else {
if (odd.size() > 1) {
del1 = odd[0];
del2 = odd[1];
} else {
del1 = even[0];
del2 = even[1];
}
}
while (odd.size()) {
if (odd[odd.size() - 1] == del1 || odd[odd.size() - 1] == del2)
break;
else {
cout << odd[odd.size() - 1] << ' ';
odd.pop_back();
cout << odd[odd.size() - 1] << '\n';
odd.pop_back();
}
}
while (even.size()) {
if (even[even.size() - 1] == del1 || even[even.size() - 1] == del2)
break;
else {
cout << even[even.size() - 1] << ' ';
even.pop_back();
cout << even[even.size() - 1] << '\n';
even.pop_back();
}
}
}
signed main() {
iostream::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) {
run();
cout.flush();
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
struct cp {
double x, y;
cp(double xx = 0.0, double yy = 0.0) { x = xx, y = yy; }
cp operator+(const cp &b) const { return cp(x + b.x, y + b.y); }
cp operator-(const cp &b) const { return cp(x - b.x, y - b.y); }
cp operator*(const cp &b) const {
return cp(x * b.x - y * b.y, x * b.y + y * b.x);
}
} a[N], b[N];
int rev[N], lim = 1, l, n, m, ans[6][6][N], f[6];
char s[N], t[N];
void swap(int &a, int &b) { a ^= b, b ^= a, a ^= b; }
void FFT(cp *a, int typ) {
for (int i = 0; i < lim; i++)
if (i < rev[i]) swap(a[i], a[rev[i]]);
for (int i = 1; i < lim; i <<= 1) {
cp wn(cos(3.1415926535897932384626433832795 / i),
typ * sin(3.1415926535897932384626433832795 / i));
for (int j = 0; j < lim; j += i << 1) {
cp w(1.0, 0.0);
for (int k = 0; k < i; k++, w = w * wn) {
cp x = a[j + k], y = w * a[i + j + k];
a[j + k] = x + y;
a[i + j + k] = x - y;
}
}
}
}
void solve(int x, int y) {
for (int i = 0; i < lim; i++) a[i].x = a[i].y = b[i].x = b[i].y = 0;
for (int i = 0; i < n; i++) a[i].x = (s[i] == x + 'a');
for (int i = 0; i < m; i++) b[i].x = (t[m - i - 1] == y + 'a');
FFT(a, 1);
FFT(b, 1);
for (int i = 0; i < lim; i++) a[i] = a[i] * b[i];
FFT(a, -1);
for (int i = 0; i < lim; i++) ans[x][y][i] = (int)(a[i].x / lim + 0.5);
}
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
int main() {
scanf("%s%s", s, t);
n = strlen(s), m = strlen(t);
while (n + m >= lim) lim <<= 1, l++;
for (int i = 0; i < lim; i++)
rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (l - 1));
for (int i = 0; i < 6; i++)
for (int j = 0; j < 6; j++) solve(i, j);
for (int i = m - 1; i < n; i++) {
for (int j = 0; j < 6; j++) f[j] = j;
for (int j = 0; j < 6; j++)
for (int k = 0; k < 6; k++)
if (ans[j][k][i]) f[find(j)] = find(k);
int res = 0;
for (int j = 0; j < 6; j++) res += (f[j] != j);
printf("%d ", res);
}
return 0;
}
| 15 | CPP |
i2 = input().split()
i1 = input().split()
i=0
#while i<len(i1):
# i1[i]=int(i1[i])
# i=i+1
aa=i1.count('1')
b=i1.count('2')
c=i1.count('3')
g=min(aa,b,c)
print (g)
t=0
while t<g:
r=i1.index('1')
i1[r]=5
r2=i1.index('2')
i1[r2]=5
r3=i1.index('3')
i1[r3]=5
print (r+1,r2+1,r3+1)
t=t+1 | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sat Nov 16 21:19:05 2019
@author: LV
"""
n = int(input())
s = [int(x) for x in input()]
l = [int(x) for x in input()]
length = []
for i in range(n):
m = abs(s[i] - l[i])
length.append(min(m, 10 - m))
print(sum(length)) | 7 | PYTHON3 |
#In The Name of GOD#
n = int(input()); cnt = 0
while n:
p, q = map(int, input().split())
cnt += (q-p >= 2)
n-=1
print(cnt) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
char a[27][27];
int dp[27][27] = {{}};
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] == '0') {
dp[i][j] = 4;
int r = i;
int mc = m;
while (r < n && a[r][j] == '0') {
int c = j;
while (c < mc && a[r][c] == '0') {
dp[i][j] = max(dp[i][j], 2 * (r - i + c - j + 2));
c++;
}
mc = c;
r++;
}
}
}
}
int out = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
out = max(out, dp[i][j]);
}
}
cout << out << "\n";
return 0;
}
| 8 | CPP |
def Solution():
n = int(input())
c = {}
edges = []
f, l = 0, n-2
for i in range(n-1):
u, v = map(int, input().split())
edges.append((u,v))
c.setdefault(u, 0)
c.setdefault(v, 0)
c[u] += 1
c[v] += 1
for i in edges:
if(c[i[0]]==1 or c[i[1]]==1):
print(f)
f += 1
else:
print(l)
l -= 1
if __name__ == "__main__":
Solution()
| 9 | PYTHON3 |
t = int(input())
for test in range(t):
c = int(input())
if c%2 == 0:
print(c//2)
else:
print((c+1)//2) | 7 | PYTHON3 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
cout << (int)s.rfind('Z') - (int)s.find('A') + 1 << endl;
return 0;
}
| 0 | CPP |
t=int(input())
for q in range(t):
n=int(input())
ch=""
for i in range(1,n+1):
ch+=str(i)+" "
print(n)
print(ch)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
long long k;
cin >> n >> k;
vector<int> x(n), c(n);
for (int i = (0); i < (n); ++i) cin >> x[i];
int a;
cin >> a;
for (int i = (0); i < (n); ++i) cin >> c[i];
priority_queue<int, vector<int>, greater<int> > que;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
que.emplace(c[i]);
if (k < x[i]) {
while (k < x[i] && !que.empty()) {
ans += que.top();
que.pop();
k += a;
}
if (k < x[i]) {
cout << -1 << '\n';
return 0;
}
}
}
cout << ans << '\n';
return 0;
}
| 12 | CPP |
def fr(x):
y = str(x)
t = 10 * int(y[y.index('.') + 1:])
if t < 5:
return int(x)
elif t >= 5:
return int(x+1)
for m in range(int(input().strip())):
n,k = map(int,input().strip().split())
j = ((8*k + 1)**0.5 - 1)/2
j = fr(j)
x = (n - 2) - j + 1
lowerBound = ((j*(j - 1))//2) + 1
y = (n - 2 - x) - (k - lowerBound )
z = n - 2 - x - y
s = 'a'*x + 'b' + 'a'*y + 'b' + 'a'*z
print(s) | 8 | PYTHON3 |
#include <iostream>
using namespace std;
int main() {
long long n, c;
cin >> n >> c;
long long x[n], v[n], dp[n + 1], result = 0;
dp[0] = 0;
for (long long i = 0; cin >> x[i] >> v[i]; i++) {
}
for (long long i = 0, sum = 0; i < n; i++) {
sum += v[i];
dp[i + 1] = max(dp[i], sum - x[i]);
}
result = max(result, dp[n]);
for (long long i = n - 1, sum = 0; i > 0; i--) {
sum += v[i];
result = max(result, sum - 2 * (c - x[i]) + dp[i]);
}
dp[n] = 0;
for (long long i = n - 1, sum = 0; i >= 0; i--) {
sum += v[i];
dp[i] = max(dp[i + 1], sum - c + x[i]);
}
result = max(result, dp[0]);
for (long long i = 0, sum = 0; i < n; i++) {
sum += v[i];
result = max(result, sum - 2 * x[i] + dp[i + 1]);
}
cout << result;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n - 1; i += 1) {
long long cnt, sum;
cin >> cnt >> sum;
long long val = sum / cnt;
long long rem = sum % cnt;
cout << val * val * (cnt - rem) + rem * (val + 1) * (val + 1) << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-10;
int main() {
string str, input = "";
while (cin >> str) {
input += str;
}
stack<string> st;
vector<int> res;
int index = 0;
while (index < input.size()) {
if (input[index] == '<') {
int i = input.find(">", index);
string tag = input.substr(index, i - index + 1);
if (tag == "</table>") {
res.push_back(0);
bool f = true;
while (f) {
if (st.top() == "<td>")
res[res.size() - 1]++;
else if (st.top() == "<table>")
f = false;
st.pop();
}
} else {
st.push(tag);
}
index += i - index + 1;
} else
index++;
}
sort(res.begin(), res.end(), greater<int>());
for (int i = res.size() - 1; i >= 0; i--) {
cout << res[i];
if (i != 0) cout << " ";
}
return 0;
}
| 8 | CPP |
h, w = map(int, input().split())
s = [['.'] * (w+2)]
for i in range(h):
tmp = list(input())
tmp.insert(0, '.')
tmp.append('.')
s.append(tmp)
ans = 'Yes'
for i in range(1, h):
for j in range(1, w):
if s[i][j] == '#' and s[i][j+1] != '#' and s[i+1][j] != '#' and s[i][j-1] != '#' and s[i-1][j] != '#':
ans = 'No'
print(ans) | 0 | PYTHON3 |
import math
t = int(input())
for hatt in range(t):
n = int(input())
lim = int(math.sqrt(n))+2
i = 2
while i<lim and (n%i!=0):
i+=1
if(n%i==0):
a = n//i
b = n-a
print(a,b)
else:
print(1,n-1) | 8 | PYTHON3 |
def f(l,k):
l2 = [k-l[i] for i in range(len(l))]
return sum(l2) > sum(l)
n = int(input())
l = [int(x) for x in input().split()]
st = max(l)
for k in range(st,100000000):
if f(l,k):
print(k)
break | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Apr 3 15:16:34 2020
@author: SOUVIK PAN
"""
n,m = map(int,input().split())
kn=(n-m+1)*(n-m)//2
a=n//m
km= m*a*(a-1)//2 + a*(n%m)
print(km,kn) | 8 | PYTHON3 |
n=int(input())
for i in range(n):
s=input()
c=[]
if(len(s)<=10):
print(s)
else:
print(s[0],end="")
print(len(s)-2,end="")
print(s[-1])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int digits1[10] = {0}, digits2[10] = {0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, c;
cin >> n >> m >> c;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
long sum = 0;
int x = -(n - m + 2);
for (int i = 0; i < n; i++) {
if (i < m) sum += b[i];
x++;
if (x >= 0) sum -= b[x];
a[i] = (a[i] + sum) % c;
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
cout << "\n";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1005];
int msk[1005];
int main() {
int n;
ignore = scanf("%d", &n);
for (int i = 0; i < n; i++) {
char buf[5];
ignore = scanf(" %d %s", a + i, buf);
int m = strlen(buf);
for (int j = 0; j < m; j++) {
msk[i] |= (1 << (buf[j] - 'A'));
}
}
int mnA = 10000000, mnB = 10000000, mnC = 10000000;
for (int i = 0; i < n; i++) {
if (msk[i] & 1) {
mnA = min(mnA, a[i]);
}
if (msk[i] & 2) {
mnB = min(mnB, a[i]);
}
if (msk[i] & 4) {
mnC = min(mnC, a[i]);
}
}
if (mnA == 10000000 || mnB == 10000000 || mnC == 10000000) {
printf("-1");
return 0;
}
int ans = mnA + mnB + mnC;
for (int i = 0; i < n; i++) {
if (msk[i] == 7) {
ans = min(ans, a[i]);
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if ((msk[i] | msk[j]) == 7) {
ans = min(ans, a[i] + a[j]);
}
}
}
printf("%d", ans);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
const int mx = 1e3 + 6;
const int mm = (1 << 16) - 1;
const int INF = 0x3f3f3f3f;
int n, a[4], st[mx];
char s[4][mx];
int d[mx][mm + 6];
vector<int> mark[4];
int main() {
scanf("%d", &n);
for (int i = 0; i < 4; i++) scanf("%d", &a[i]);
for (int i = 0; i < 4; i++) scanf("%s", s[i]);
for (int j = 0; j < n; j++)
for (int i = 0; i < 4; i++) st[j] |= (s[i][j] == '*') << i;
memset(d, 0x3f, sizeof(d));
int S = 0;
for (int i = 0; i < 4; i++) S |= st[i] << (i * 4);
d[0][S] = 0;
for (int i = 1; i <= 4; i++) {
for (int j = 0; j <= 4 - i; j++) {
mark[i - 1].push_back(mm);
int& SS = mark[i - 1].back();
for (int k = j; k < j + i; k++)
for (int g = 0; g < i; g++) SS ^= 1 << (g * 4 + k);
}
}
for (int i = 0; i < n; i++) {
for (int j = mm; j >= 0; j--) {
if (d[i][j] == INF) continue;
if (!(j & 15)) {
int SS = j >> 4 | (st[i + 4] << 12);
d[i + 1][SS] = min(d[i][j], d[i + 1][SS]);
}
for (int k = 1; k <= 4 && k + i <= n; k++)
for (auto p : mark[k - 1])
d[i][j & p] = min(d[i][j & p], d[i][j] + a[k - 1]);
}
}
printf("%d\n", d[n][0]);
}
| 12 | CPP |
s = input()
t = input()
c = s
j = 0
for i in range(1, len(s)+1):
if t[-i] != 'a':
c = chr(ord(t[-i])-1)
j = len(s)-i
break
c = t[:j] + c + t[j+1:]
if c[:j+1] != s[:j+1]:
print(c)
else:
c = t
j = 0
for i in range(1, len(s)+1):
if s[-i] != 'z':
c = chr(ord(s[-i])+1)
j = len(s)-i
break
c = s[:j] + c + s[j+1:]
print("No such string" if c[:j+1] == t[:j+1] else c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int idx;
int degree;
int xorsum;
Node() {}
Node(int i1, int d1, int x1) {
idx = i1;
degree = d1;
xorsum = x1;
}
bool operator<(const Node& y) const { return degree > y.degree; }
};
int n;
const int MAXN = (1 << 17) + 1010;
int deg[MAXN];
int xorsum[MAXN];
bool vis[MAXN];
vector<pair<int, int> > vec;
priority_queue<Node> que;
int main() {
scanf("%d", &n);
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
scanf("%d%d", °[i], &xorsum[i]);
if (deg[i] != 0) {
que.push(Node(i, deg[i], xorsum[i]));
}
}
while (!que.empty()) {
Node cur = que.top();
que.pop();
if (vis[cur.idx]) continue;
vis[cur.idx] = true;
int y = xorsum[cur.idx];
if (deg[cur.idx] < 1) continue;
vec.push_back(make_pair(cur.idx, y));
if (!vis[y]) {
deg[y]--;
xorsum[y] ^= cur.idx;
}
if (deg[y] >= 1 && !vis[y]) {
que.push(Node(y, deg[y], xorsum[y]));
}
}
printf("%d\n", vec.size());
for (int i = 0, sz = vec.size(); i < sz; i++) {
printf("%d %d\n", vec[i].first, vec[i].second);
}
}
| 9 | CPP |
from math import ceil,sqrt
n=int(input())
print(ceil(2*sqrt(n)))
| 8 | PYTHON3 |
def solve(n, m, a):
if n == 0:
return 0, 1
if n == 1:
return a[0], 1
d = (a[1]-a[0]) % m
if d < 0: d += m
st = set(a)
cnt = 0
for v in a:
cnt += ((v + d) % m) in st
cnt = n-cnt
d = (d * pow(cnt, m-2, m)) % m
now = a[0]
while (now + m - d) % m in st:
now = (now + m - d) % m
for i in range(n):
if (now + i*d) % m not in st:
return -1, -1
return now, d
m, n = map(int, input().split())
a = list(map(int, input().split()))
if n * 2 > m:
st = set(a)
b = [i for i in range(m) if i not in st]
f, d = solve(len(b), m, b)
f = (f + d * (m-n)) % m
else:
f, d = solve(n, m, a)
if f < 0 or d < 0:
print(-1)
else:
print(f, d)
# Made By Mostafa_Khaled | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int t, n;
string A[10];
map<string, int> Count;
int main() {
cin >> t;
for (; t > 0; t--) {
cin >> n;
Count.clear();
int times = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
Count[A[i]]++;
}
for (int i = 0; i < n; i++)
if (Count[A[i]] > 1) {
Count[A[i]]--;
for (int j = 0; j <= 9; j++) {
A[i][0] = j + '0';
if (Count[A[i]] == 0) {
Count[A[i]]++;
break;
}
}
times++;
}
cout << times << endl;
for (int i = 0; i < n; i++) cout << A[i] << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
using namespace std;
int N;
vector<int> G[200001];
int par[200001],dep[200001],num[200001];
void makegraph(){
string s;
cin>>s;
int v=-1;
for(char c:s){
if(c=='('){
if(v>=0) G[v].pb(N),dep[N]=dep[v]+1;
par[N]=v;
v=N;
N++;
}else{
num[v]=1;
for(int u:G[v]) num[v]+=num[u];
v=par[v];
}
}
}
bool dfs(int v,int w,int s){
if(G[v].size()==0&&G[w].size()==2) return false;
if(G[v].size()==0&&G[w].size()==0) return true;
if(G[v].size()==2&&G[w].size()==2) return dfs(G[v][0],G[w][0],s)&&dfs(G[v][1],G[w][1],s);
return dfs(v,s,s);
}
bool ok(int v){
return dfs(0,v,v);
}
int main(){
BEGIN_STACK_EXTEND(128*1024*1024);
makegraph();
vector<int> ds;
int v=0;
rep(i,N) if(dep[i]>dep[v]) v=i;
v=par[v];
while(v>=0){
if((N-1)%(num[v]-1)==0){
if(ok(v)) ds.pb(num[v]-1);
}
v=par[v];
}
int K=ds.size();
int dp[161]={};
rep(i,K) dp[i]=1e9;
dp[0]=0;
rep(i,K){
rep(j,i){
if(ds[i]%ds[j]==0){
chmin(dp[i],dp[j]+ds[i]/ds[j]-1);
}
}
}
cout<<dp[K-1]<<endl;
END_STACK_EXTEND;
} | 0 | CPP |
n=int(input())
l=[]
T=[list(map(int,input().split())) for _ in range(n-1)]
for i in range(n-1):
t=0
for c,s,f in T[i:]:
t=max(t,s+f*max(0,(t-s-1)//f+1))+c
l.append(t)
l.append(0)
for x in l:
print(x)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 25;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int sum = 0;
int a[2 * n];
for (int i = (0), _b = (2 * n); i < (_b); ++i) {
double x;
cin >> x;
int y = ((int)(x * 1000 + 0.5)) % 1000;
sum += y;
a[i] = (y) ? 1000 : 0;
}
sort(a, a + 2 * n);
int lo = 0, hi = 0;
for (int i = (0), _b = (n); i < (_b); ++i) lo += a[i];
for (int i = (0), _b = (n); i < (_b); ++i) hi += a[i + n];
int ans = 1 << 30;
for (int x = lo; x <= hi; x += 1000) ans = min(ans, abs(x - sum));
printf("%.3f\n", ans / 1000.0);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const double eps = 1e-9;
const long long mod = 1e9 + 7;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch<'0' | ch> '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
void Out(int aa) {
if (aa > 9) Out(aa / 10);
putchar(aa % 10 + '0');
}
const int MAXN = 10000;
const int MAXM = 100000;
struct Edge {
int to, next, cap, flow, cost;
} edge[MAXM];
int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;
void init(int n) {
N = n;
tol = 0;
memset(head, -1, sizeof(head));
}
void add(int u, int v, int cap, int cost) {
edge[tol].to = v;
edge[tol].cap = cap;
edge[tol].cost = cost;
edge[tol].flow = 0;
edge[tol].next = head[u];
head[u] = tol++;
edge[tol].to = u;
edge[tol].cap = 0;
edge[tol].cost = -cost;
edge[tol].flow = 0;
edge[tol].next = head[v];
head[v] = tol++;
}
bool spfa(int s, int t) {
queue<int> q;
for (int i = 0; i < N; i++) {
dis[i] = INF;
vis[i] = false;
pre[i] = -1;
}
dis[s] = 0;
vis[s] = true;
q.push(s);
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = false;
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost) {
dis[v] = dis[u] + edge[i].cost;
pre[v] = i;
if (!vis[v]) {
vis[v] = true;
q.push(v);
}
}
}
}
if (pre[t] == -1)
return false;
else
return true;
}
int minCostMaxflow(int s, int t, int &cost) {
int flow = 0;
cost = 0;
while (spfa(s, t)) {
int Min = INF;
for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to]) {
if (Min > edge[i].cap - edge[i].flow) Min = edge[i].cap - edge[i].flow;
}
for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to]) {
edge[i].flow += Min;
edge[i ^ 1].flow -= Min;
cost += edge[i].cost * Min;
}
flow += Min;
}
return flow;
}
int a[3010], b[3010];
int main() {
init(10000);
int n = read(), p = read(), q = read();
int s = 0, p1 = n + 1, p2 = n + 2, t = n + 3;
add(p1, t, p, 0);
add(p2, t, q, 0);
for (int i = 1; i <= n; i++) {
a[i] = read();
add(s, i, 1, 0);
add(i, p1, 1, -a[i]);
}
for (int i = 1; i <= n; i++) {
b[i] = read();
add(i, p2, 1, -b[i]);
}
int cost;
int f = minCostMaxflow(s, t, cost);
printf("%d\n", -cost);
vector<int> a1, a2;
for (int i = 1; i <= n; i++) {
for (int j = head[i]; j != -1; j = edge[j].next) {
int v = edge[j].to;
if (edge[j].flow == 0) continue;
if (v == p1) a1.push_back(i);
if (v == p2) a2.push_back(i);
}
}
for (int i = 0; i < a1.size(); i++) printf("%d ", a1[i]);
puts("");
for (int i = 0; i < a2.size(); i++) printf("%d ", a2[i]);
puts("");
return 0;
}
| 15 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<pair<long long int, long long int>, long long int> m;
long long int lca(long long int x, long long int y) {
long long int ans;
while (y > 1) {
long long int a = x;
while (a > 1) {
if (a == y) {
ans = a;
return ans;
}
a = a / 2;
}
y /= 2;
}
return 1;
}
int main() {
long long int n, q, x, y, w;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &q, &x, &y);
if (q == 1) {
scanf("%lld", &w);
long long int parent = lca(x, y);
long long int a = x;
long long int b = y;
while (a > parent) {
m[make_pair(a, a / 2)] += w;
a = a / 2;
}
while (b > parent) {
m[make_pair(b, b / 2)] += w;
b = b / 2;
}
} else {
long long int ans = 0;
long long int parent = lca(x, y);
long long int a = x;
long long int b = y;
while (a > parent) {
ans += m[make_pair(a, a / 2)];
a = a / 2;
}
while (b > parent) {
ans += m[make_pair(b, b / 2)];
b = b / 2;
}
printf("%lld\n", ans);
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
long long gi() {
long long x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) f ^= ch == '-', ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int n, fa[200010], ch[200010][2], siz[200010], _siz[200010], W[200010],
MX[200010];
bool rev[200010];
bool isrt(int x) { return ch[fa[x]][0] != x && ch[fa[x]][1] != x; }
void upd(int x) {
if (!x) return;
siz[x] = siz[ch[x][0]] + siz[ch[x][1]] + (x <= n) + _siz[x];
MX[x] = x;
if (W[MX[ch[x][0]]] > W[MX[x]]) MX[x] = MX[ch[x][0]];
if (W[MX[ch[x][1]]] > W[MX[x]]) MX[x] = MX[ch[x][1]];
}
void Rev(int x) {
if (x) rev[x] ^= 1, std::swap(ch[x][0], ch[x][1]);
}
void down(int x) {
if (x && rev[x]) Rev(ch[x][0]), Rev(ch[x][1]), rev[x] = 0;
}
void rotate(int x) {
int y = fa[x], z = fa[y], o = x == ch[y][1];
fa[x] = z;
if (!isrt(y)) ch[z][y == ch[z][1]] = x;
ch[y][o] = ch[x][!o], fa[ch[x][!o]] = y;
fa[y] = x, ch[x][!o] = y;
upd(y);
}
void Down(int x) {
if (!x) return;
if (!isrt(x)) Down(fa[x]);
down(x);
}
void splay(int x) {
Down(x);
int y, z;
while (!isrt(x)) {
y = fa[x], z = fa[y];
if (!isrt(y)) rotate(((x == ch[y][0]) ^ (y == ch[z][0])) ? x : y);
rotate(x);
}
upd(x);
}
void access(int x) {
for (int y = 0; x; x = fa[y = x])
splay(x), _siz[x] -= siz[y] - siz[ch[x][1]], ch[x][1] = y, upd(x);
}
int find(int x) {
access(x);
splay(x);
while (ch[x][0]) down(x), x = ch[x][0];
return splay(x), x;
}
void makert(int x) { access(x), splay(x), Rev(x); }
void link(int x, int y) {
makert(x), makert(y);
fa[x] = y, _siz[y] += siz[x], upd(x);
}
void cut(int x, int y) {
makert(x), access(y), splay(y), fa[x] = ch[y][0] = 0;
upd(y);
}
std::priority_queue<std::pair<int, int>> E, del;
int eA[200010], eB[200010], stk[100010], tp;
int main() {
n = gi();
int m = gi(), a, b, c, cp = n;
for (int i = 1; i <= n; ++i) siz[i] = 1, MX[i] = i;
for (int i = 1; i < n; ++i) stk[++tp] = i + n;
while (m--) {
a = gi(), b = gi(), c = gi();
if (find(a) != find(b)) {
int x = stk[tp--];
W[x] = c;
siz[x] = _siz[x] = 0;
makert(a), makert(b);
cp -= (siz[a] & 1) + (siz[b] & 1) - (siz[a] + siz[b] & 1);
link(eA[x] = a, x), link(eB[x] = b, x);
E.push({c, x});
} else {
makert(a), access(b), splay(b);
int p = MX[b];
if (W[p] > c) {
cut(p, eA[p]);
cut(p, eB[p]);
del.push({W[p], p});
W[p] = c;
link(p, eA[p] = a), link(p, eB[p] = b);
E.push({W[p], p});
}
}
if (cp)
puts("-1");
else {
while (1) {
while (!E.empty() && !del.empty() && E.top() == del.top())
E.pop(), del.pop();
int x = E.top().second;
a = eA[x], b = eB[x];
cut(x, a), cut(x, b);
makert(a);
if (siz[a] & 1) {
link(x, a), link(x, b);
break;
}
E.pop();
stk[++tp] = x;
}
printf("%d\n", E.top().first);
}
}
return 0;
}
| 11 | CPP |
'''
* Author : Ayushman Chahar #
* About : IT Junior #
* Insti : VIT, Vellore #
'''
import os
import sys
# from collections import *
# from itertools import *
# from math import *
# from queue import *
# from heapq import *
# from bisect import *
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
readint = lambda: int(sys.stdin.readline().rstrip("\r\n"))
readints = lambda: map(int, sys.stdin.readline().rstrip("\r\n").split())
readstr = lambda: sys.stdin.readline().rstrip("\r\n")
readstrs = lambda: map(str, sys.stdin.readline().rstrip("\r\n").split())
readarri = lambda: [int(_) for _ in sys.stdin.readline().rstrip("\r\n").split()]
readarrs = lambda: [str(_) for _ in sys.stdin.readline().rstrip("\r\n").split()]
def solve():
n = readint()
sumArr = sum(readarri())
cnt = 0
for i in range(1, 6):
sumArr += i
reM = sumArr % (n + 1) - 1
if (reM != 0):
# print(sumArr)
cnt += 1
sumArr -= i
print(cnt)
def main():
t = 1
# t = readint()
for _ in range(t):
# print("Case #" + str(_ + 1) + ": ", end="")
solve()
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main() {
int n,m,data[100],ndata[100]={0};cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;cin>>a>>b;
ndata[a-1]++;ndata[b-1]++;
}
for(int i=0;i<n;i++){
cout<<ndata[i]<<endl;
}
} | 0 | CPP |
n=int(input())
l=[int(d) for d in str(n)]
c=0
for i in l:
if i==7 or i==4:
c+=1
if c==7 or c==4:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
n=int(input())
seq=input()
itr=0
count1=0
count2=0
for i in seq:
if(i=='('):
count1=count1+1
else:
count2=count2+1
if(count1!=count2):
print(-1)
else:
ans=0
i=0
while(i<n):
count1=0
count2=0
if(seq[i]=='(' ):
# print(i)
count1=count1+1
i=i+1
while(count1!=0 and i<n):
if(seq[i]=='('):
count1=count1+1
else:
count1=count1-1
i=i+1
# i=i+1
else:
length=1
count2=count2+1
i=i+1
while(count2!=0 and i<n):
if(seq[i]==')'):
count2=count2+1
else:
count2=count2-1
i=i+1
length=length+1
ans=ans+length
# print(ans,i)
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, m, i, j, mn = 0, mx = 0;
cin >> n >> m;
vector<long long> a(m), b(m);
for (i = 0; i < m; i++) {
cin >> a[i];
b[i] = a[i];
}
for (i = 0; i < n; i++) {
sort(a.begin(), a.end());
for (j = 0; j < m; j++) {
if (a[j] > 0) {
mn += a[j];
a[j]--;
break;
}
}
}
for (i = 0; i < n; i++) {
sort(b.begin(), b.end());
mx += b[m - 1];
b[m - 1]--;
}
cout << mx << " " << mn << endl;
return 0;
}
| 8 | CPP |
for i in range(int(input())):
x1,y1,x2,y2=(map(int,input().split()))
if x1==x2 or y1==y2:
print(abs(x1-x2)+abs(y1-y2))
else:
print(abs(x1-x2)+abs(y1-y2)+2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long num = 0;
while (n > k) {
if (n % k == 0) {
n = n / k;
num++;
} else {
long long x = n % k;
n = n - x;
num += x;
}
}
if (n == k) {
if (n == 1) {
num++;
} else {
num += 2;
}
} else {
num += n;
}
cout << num << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, l, m, p;
vector<int> le;
long long re;
int main() {
scanf("%d%d%d", &n, &k, &l);
m = n * k;
le.resize(m);
for (int i = (0); i < (m); i++) scanf("%d", &le[i]);
sort(le.begin(), le.end());
p = 0;
while (p < m && (le[p] - le[0] <= l)) p++;
if (p < n) {
printf("0");
return 0;
}
re = le[0];
int cp = 0, del = 1;
while (cp + k < p - n + del) {
cp += k;
del++;
re += le[cp];
}
for (int i = (p - 1); i >= (p - n + del); i--) re += le[i];
printf("%lld", re);
return 0;
}
| 9 | CPP |
n,m,p=map(int,input().split(" "))
l=[]
l.append(n)
l.append(m)
def mcd(a,b):
while(b!=0):
aux=a%b
a=b
b=aux
return a
ps=0
signo=1
while(p!=0):
p-=mcd(l[ps],p)
ps=ps+signo
signo=-1*signo
print(ps+signo) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
bool p[500010];
long long cnt[3], a[200010];
void sieve() {
memset(p, 1, sizeof p);
v.push_back(2);
for (long long i = 3; i <= 500005; i += 2) {
if (p[i]) {
v.push_back(i);
for (long long j = i * i; j <= 500005; j += 2 * i) {
p[j] = 0;
}
}
}
}
int main() {
sieve();
long long n, x;
scanf("%lld", &n);
for (long long i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
cnt[a[i]]++;
}
long long j = 0, sum = 0;
for (long long i = 1; i <= n; i++) {
if (cnt[1] > 0) {
if (sum + 1 == v[j]) {
sum += 1;
cout << "1 ";
cnt[1]--;
j++;
continue;
}
}
if (cnt[2] > 0) {
if (sum + 2 == v[j]) {
sum += 2;
j++;
cout << "2 ";
cnt[2]--;
continue;
}
}
if (cnt[2] > 0) {
sum += 2;
if (sum > v[j]) {
j++;
}
cout << "2 ";
cnt[2]--;
continue;
}
if (cnt[1] > 0) {
sum++;
if (sum > v[j]) {
j++;
}
cout << "1 ";
cnt[1]--;
continue;
}
}
}
| 7 | CPP |
import math
t = int(input())
for x in range(t):
n,k = map(int,input().split())
n-=2
l1 = (math.sqrt(1+8*k)-1)/2
l = math.floor(l1)
ans = ['a']*(n+2)
d = k - (l*(l+1)/2)
#print(l,d)
if( d== 0):
ans[n-l+1] = 'b'
ans[n-l+2] = 'b'
else:
ans[n-l] = 'b'
ans[n+2 - int(d)] = 'b'
print(''.join(ans))
| 8 | PYTHON3 |
WORD = input()
WORD=WORD.lower()
g='aoyeui'
for lol in g:
WORD=WORD.replace(lol,'')
wordlist=list(WORD)
wordstr='.'.join(wordlist)
print('.'+wordstr) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
const int N = 1e6 + 10, mod = 998244353;
const double eps = 1e-7;
inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
inline int mul(int a, int b) { return (ll)a * b % mod; }
int n;
string s;
ll fact[1000001], inv[1000001];// mod inv = n ^ mod-2
ll FastPower(int a, int b)
{
if(b == 0)
return 1;
ll res = FastPower(a, b/2);
if(b%2)
return res * res % mod * a % mod;
return res * res % mod;
}
ll nCk(int n, int k)
{
if(n < k)
return 0;
return fact[n] * inv[k] % mod * inv[n-k] % mod;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
fact[0] = 1;
inv[0] = FastPower(1, mod-2);
for(int i=1; i<=1000000; ++i)
{
fact[i] = fact[i-1] * i % mod;
inv[i] = FastPower(fact[i], mod-2);
}
int t;
cin >> t;
while(t--)
{
cin >> n >> s;
vector<int> a;
for(int i=0; i<n; ++i){
if(i < n-1 && s[i] == '1' && s[i+1] == '1'){
a.push_back(2);
++i;
continue;
}
a.push_back(s[i]-'0');
}
n = a.size();
ll ans = 1;
int space = 0, nof2 = 0;
for(int i=0; i<n; ++i){
//cout << a[i] << ' ';
nof2 += a[i] == 2;
space += a[i] == 0;
}
ans = nCk(nof2+space, space);
cout << ans << '\n';
}
} | 10 | CPP |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n),a(n);
for(int i=0; i<n; i++) {
cin >> b[i];
}
for(int i=0; i<n; i++) {
for(int j=b.size()-1; j>=0; j--) {
if(b[j]==j+1) {
a[i]=b[j];
b.erase(b.begin()+j);
break;
}
}
}
if(a[n-1]!=1) {
cout << -1 << endl;
}
else {
for(int i=n-1; i>=0; i--) {
cout << a[i] << endl;
}
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
const int N=201000;
int nxt[N][10],s[N];
ll dp[N];
int solve(VI c) {
bool ss=0;
rep(i,0,SZ(c)-1) if (c[i]==c[i+1]) ss=1;
if (!ss) return 1;
int n=SZ(c);
rep(i,0,n) s[i+1]=(s[i]+(c[i]?1:2))%3;
rep(j,0,3) nxt[n][j]=n+1;
per(i,0,n) {
rep(j,0,3) nxt[i][j]=nxt[i+1][j];
nxt[i][s[i+1]]=i+1;
}
dp[0]=1;
ll ans=0;
rep(i,1,n+1) dp[i]=0;
rep(i,0,n+1) {
rep(j,1,3) {
int p=nxt[i][(s[i]+j)%3];
if (p<=n) {
dp[p]=(dp[p]+dp[i])%mod;
}
}
if (i>0&&s[i]==s[n]) ans=(ans+dp[i])%mod;
}
// printf("%lld\n",ans);
return ans;
}
char ss[N];
//int M=10;
int main() {
scanf("%s",ss);
int n=strlen(ss);
VI c;
rep(i,0,n) c.pb(ss[i]-'a');
printf("%d\n",solve(c));
/*
rep(S,0,(1<<M)) {
VI c;
rep(i,0,M) c.pb((S>>i)&1);
set<VI> w;
queue<VI> q;
q.push(c);
w.insert(c);
while (!q.empty()) {
VI cc=q.front(); q.pop();
rep(i,0,SZ(cc)-1) if (cc[i]==cc[i+1]) {
VI dd=cc; dd.erase(dd.begin()+i);
dd[i]^=1;
if (!w.count(dd)) w.insert(dd),q.push(dd);
}
}
rep(i,0,M) printf("%c",'a'+c[i]); printf(" %d\n",SZ(w));
assert(SZ(w)==solve(c));
}*/
}
| 0 | CPP |
a=input()
d=''
for i in a:
if i=='=':d+='0'
else:d+=i
d=d.split('^')
b=0
c=0
for i in range(1,len(d[0])+1):
b+=i*int(d[0][-i])
for i in range(len(d[1])):
c+=(i+1)*int(d[1][i])
if b==c:print('balance')
elif b>c:print('left')
else:print('right') | 7 | PYTHON3 |
IN=lambda:list(map(int,input().split()))
k,a,b=IN()
if b-a<=2 or k<a+1:
print(k+1)
else:
print(a+((k+1-a)//2)*(b-a)+(k+1-a)%2) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1), eps = 1e-8;
const int maxn = 1 << 17;
const int N = 1e3 + 10, M = 1e6 + 7, mod = 998244353;
int n;
int a[N][N];
int main() {
cin >> n;
if (n <= 2) {
cout << -1;
return 0;
}
a[1][1] = 4;
a[1][2] = 9;
a[1][3] = 3;
a[2][1] = 6;
a[2][2] = 1;
a[2][3] = 5;
a[3][1] = 8;
a[3][2] = 7;
a[3][3] = 2;
if (n == 3) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}
int now = 0;
int m = 4;
for (int i = 1; i <= m; i++) a[i][m] = now--;
for (int i = m - 1; i >= 1; i--) a[m][i] = now--;
swap(a[1][m], a[2][m]);
m = 5;
while (m <= n) {
if (m % 2 == 0) {
for (int i = 1; i <= m; i++) a[i][m] = now--;
for (int i = m - 1; i >= 1; i--) a[m][i] = now--;
} else {
for (int i = 1; i <= m; i++) a[m][i] = now--;
for (int i = m - 1; i >= 1; i--) a[i][m] = now--;
}
m++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
printf("%d ", a[i][j] - now);
}
printf("\n");
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
multiset<long long> s;
int n, k;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k;
int a, b;
for (int i = 0; i < k; i++) s.insert(0);
for (int i = 0; i < n; i++) {
cin >> a >> b;
long long x = *s.begin();
x = max(x, 1ll * a) + b;
cout << x << endl;
s.erase(s.begin());
s.insert(x);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h;
cin >> n >> h;
int x;
int answer = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x <= h)
answer++;
else
answer += 2;
}
cout << answer;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e6;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
int n;
cin >> n;
vector<int> res;
for (int i = max(0, n - 9 * 9); i <= n; ++i) {
int s = 0;
for (int j = i; j; j /= 10) s += j % 10;
if (i + s == n) res.push_back(i);
}
cout << res.size() << '\n';
copy(res.begin(), res.end(), ostream_iterator<int>(cout, "\n"));
return 0;
}
| 7 | CPP |
n = int(input())
def fon(num):
a = 1
b = num - 1
return [a,b]
for i in range(n):
s = int(input())
print(*fon(s))
| 7 | PYTHON3 |
d = int(input())
n = int(input())
a = list(map(int, input().split()))
counter = 0
for i in range(n-1):
counter += d-a[i]
print(counter)
# Codeforcesian
# ♥
| 8 | PYTHON3 |
t = int(input())
p = 0
c = 0
for _ in range(t):
i = int(input())
if i != p:
c +=1
p = i
print(c) | 7 | PYTHON3 |
n,k,l,c,d,p,nl,np=map(int, input().split())
drink=(k*l)//nl
slices=c*d
salt=p//np
print(min(drink,slices,salt)//n)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int const lim = 2e5 + 3;
int const MLOG = 20;
long long st[6 * lim + 3], lazy[6 * lim + 3], a[lim + 3], dp[lim + 3];
vector<pair<int, long long> > rang[lim + 3];
void push(int i, int j, int index) {
st[index] += lazy[index];
if (i != j)
lazy[index * 2 + 1] += lazy[index], lazy[index * 2 + 2] += lazy[index];
lazy[index] = 0;
}
void update(int i, int j, int index, int l, int r, long long val) {
push(i, j, index);
if (i > r || j < l) return;
if (i >= l && j <= r) {
lazy[index] += val;
push(i, j, index);
return;
}
int mid = (i + j) / 2;
update(i, mid, index * 2 + 1, l, r, val);
update(mid + 1, j, index * 2 + 2, l, r, val);
st[index] = max(st[index * 2 + 1], st[index * 2 + 2]);
}
long long get(int i, int j, int index, int l, int r) {
push(i, j, index);
if (i > r || j < l) return 0;
if (i >= l && j <= r) return st[index];
int mid = (i + j) / 2;
return max(get(i, mid, index * 2 + 1, l, r),
get(mid + 1, j, index * 2 + 2, l, r));
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), a[i] += a[i - 1];
for (int i = 0; i < m; i++) {
int u, v;
long long w;
scanf("%d%d%lld", &u, &v, &w);
rang[v].push_back(make_pair(u, w));
}
dp[0] = 0;
for (int i = 1; i <= n; i++) {
update(1, n, 0, i, i, dp[i - 1] + a[i - 1]);
for (int j = 0; j < rang[i].size(); j++) {
int u = rang[i][j].first;
long long w = rang[i][j].second;
update(1, n, 0, 1, u, w);
}
dp[i] = max(dp[i - 1], get(1, n, 0, 1, i) - a[i]);
}
cout << dp[n] << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2 * int(1e9);
const long long INFll = 1ll * INF * INF;
const int MOD = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a.begin(), a.end());
int ans = INF;
for (int i = n / 2; i < n; ++i) ans = min(ans, a[i] - a[i - n / 2]);
cout << ans;
if (0) cerr << "\nTIME = " << clock() << "\n";
return 0;
}
| 9 | CPP |
n,Y=map(int,input().split())
for x in range(-~n):
for y in range(-~n-x):
if x*10+y*5+(n-x-y)==Y//1000:print(x,y,n-x-y);exit()
print(*[-1]*3) | 0 | PYTHON3 |
n,m,x,y,*a=map(int,open(0).read().split())
X,Y=max(a[:n]),min(a[n:])
print("No War" if X<y and x<Y and X<Y else "War") | 0 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
z = 0
for i in range(0,n,3):
x += a[i]
for j in range(1,n,3):
y += a[j]
for k in range(2,n,3):
z += a[k]
if max(x,y,z) == x:
print('chest')
elif max(x,y,z) == y:
print('biceps')
else:
print('back') | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.