solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long p = 1e9 + 7;
long long n, m, i, j, ans, f[1000010], jc[1000010];
int main() {
scanf("%lld%lld", &n, &m);
jc[0] = 1;
for (i = 1; i <= n; i++) jc[i] = jc[i - 1] * m % p;
f[0] = 1;
for (i = 1; i <= n; i++) {
ans = (ans + jc[n - i] * f[i - 1] % p * m % p) % p;
f[i] = f[i - 1] * (m + m - 1) % p;
}
printf("%lld", (ans + jc[n]) % p);
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }
int main() {
cin.tie(NULL); ios::sync_with_stdio(false);
int n; cin >> n;
V<> a(n); for (int i = 0; i < n; i++) cin >> a[i];
V<> b(30);
for (int i = 0; i < n; i++) b[__builtin_ctz(a[i])] = 1;
int xora = 0; for (int i = 0; i < n; i++) xora ^= a[i];
int res = 0;
for (int i = 30 - 1; i >= 0; i--) {
if (xora & 1 << i) {
if (b[i]) {
xora ^= (1 << i) - 1;
res++;
} else {
res = -1;
break;
}
}
}
cout << res << '\n';
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, k;
cin >> s >> k;
int sz = s.size();
for (int i = 0; i < sz; i++) {
if (s[i] == k[i])
cout << 0;
else
cout << 1;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inff = 0x3f3f3f3f3f3f3f3f;
int n, q, m, a[200008], x, y, z, b;
struct as {
int l, r, v;
} s[200008];
int main() {
cin.tie(0);
cout.tie(0);
cin >> n >> q >> m;
for (int i(1); i <= (n); ++i) scanf("%d", &a[i]);
for (int i(1); i <= (q); ++i)
scanf("%d", &s[i].v), scanf("%d", &s[i].l), scanf("%d", &s[i].r);
for (int j(1); j <= (m); ++j) {
scanf("%d", &b);
for (int i(q); i >= (1); --i) {
if (b >= s[i].l && b <= s[i].r) {
if (s[i].v == 1) {
b--;
if (b < s[i].l) b = s[i].r;
} else
b = s[i].l + s[i].r - b;
}
}
cout << a[b] << " ";
}
return 0;
}
| 10 | CPP |
x = input()
if any(l_num in x for l_num in "12356890") :
x = int(x)
if (x%4 == 0 or x%7 == 0 or x%74 == 0 or x%47 == 0 or x%77 == 0 or x%44 == 0 or x%477 == 0 or x%744 == 0 or x%777 == 0 or x%747== 0 or x%774== 0 or x%444==0 or x%447== 0 or x%474 == 0 or x%444== 0) :
print("YES")
else:
print("NO")
else:
print("YES") | 7 | PYTHON3 |
students, size_of_team = [int(x) for x in input().split(' ')]
ratings = [int(x) for x in input().split(' ')]
d = {}
res = []
for i in range(students):
if d.get(ratings[i], None) is None:
res.append(ratings[i])
d[ratings[i]] = i + 1
else:
continue
if len(res) >= size_of_team:
print("YES")
res_str = ""
for i in range(size_of_team):
res_str += str(d[res[i]]) + " "
print(res_str)
else:
print("NO") | 7 | PYTHON3 |
numButton = int(input())
button = list(map(int,input().split()))
if numButton == 1:
if button[0] == 1:
print("YES")
else:
print("NO")
exit()
count = 0
for i in range(0, numButton):
if button[i] == 0:
count += 1
if count == 1:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll A[100100];
void solve(ll s)
{
ll ans=0,S=0;
int l=0,r=-1;
while(true)
{
while(r<n&&S<=s)
S+=A[++r];
//
if(r>=n) break;
while(S>s)
{
//printf("%d %d %lld\n",r,l,S);
ans+=r-l;
S-=A[l++];
}
}
while(l<n)
ans+=n-(l++);
printf("%lld\n",ans);
}
int main()
{
int q,ma=0;
scanf("%d%d",&n,&q);
for(int i=0;i<n;i++)
scanf("%lld",&A[i]);
for(int i=0;i<q;i++)
{
ll s;
scanf("%lld",&s);
solve(s);
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
int a[N];
int s[N << 2];
void build(int k, int l, int r) {
if (l == r) {
s[k] = a[l];
return;
}
int mid = l + r >> 1;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
s[k] = min(s[k << 1], s[k << 1 | 1]);
}
int ask(int k, int l, int r, int x, int y, int v) {
if (l == r) {
if (s[k] < v) {
return l;
} else
return -1;
}
int mid = l + r >> 1;
if (y > mid && s[k << 1 | 1] < v) {
return ask(k << 1 | 1, mid + 1, r, x, y, v);
} else if (x <= mid) {
return ask(k << 1, l, mid, x, y, v);
}
return -1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
build(1, 1, n);
int tt;
for (int i = 1; i <= n; i++) {
tt = ask(1, 1, n, i + 1, n, a[i]);
if (tt >= 0) {
printf("%d ", tt - i - 1);
} else
printf("-1 ");
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[4];
int d[4];
bool check() {
float avg, av, ar;
avg = (a[0] + a[1] + a[2] + a[3]) / 4.0;
av = a[3] - a[0];
ar = (a[2] + a[1]) / 2.0;
if (avg == av && avg == ar && a[0] > 0 && a[1] > 0 && a[2] > 0 && a[3] > 0)
return true;
else
return false;
}
bool checks() {
float avg, av, ar;
avg = (d[0] + d[1] + d[2] + d[3]) / 4.0;
av = d[3] - d[0];
ar = (d[2] + d[1]) / 2.0;
if (avg == av && av == ar && d[0] > 0 && d[1] > 0 && d[2] > 0 && d[3] > 0)
return true;
else
return false;
}
int main() {
int n;
cin >> n;
int s = 4 - n;
if (s == 4) {
cout << "YES" << endl << 1 << endl << 1 << endl << 3 << endl << 3;
return 0;
}
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
if (s == 1) {
a[3] = a[0] * 3;
if (check())
cout << "YES" << endl << a[3];
else {
d[0] = a[0];
d[1] = a[1];
d[2] = a[2];
int b = 2 * a[2] - 2 * a[0] - a[1];
int c = (2 * d[2] - d[0] - d[1]) / 2;
a[3] = b;
sort(a, a + 4);
if (check()) {
cout << "YES" << endl << b;
return 0;
} else {
d[3] = c;
sort(d, d + 4);
if (checks()) {
cout << "YES" << endl << c;
return 0;
} else
cout << "NO";
}
}
}
if (s == 2) {
a[3] = 3 * a[0];
int b = (a[3] - a[0]) * 2;
a[2] = b - a[1];
if (check()) {
cout << "YES" << endl << a[2] << endl << a[3];
return 0;
} else
cout << "NO";
}
if (s == 3) {
a[3] = a[0] * 3;
a[2] = a[3];
a[1] = a[0];
if (check()) {
cout << "YES" << endl << a[1] << endl << a[2] << endl << a[3];
return 0;
} else
cout << "NO";
}
if (s == 0) {
if (check()) {
cout << "YES";
return 0;
} else
cout << "NO";
}
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
using i64 = long long int;
const int INF = 1e9;
struct Edge{
int from, to, cost;
};
struct Node{
int n, cost, ticket;
bool operator<(const Node &obj)const{
return cost > obj.cost;
}
};
int mini[2][102];
int main(){
int n, m;
while(cin >> n >> m, n != 0){
vector<Edge> graph[102];
for(int i=0;i<m;++i){
int a, b, c;
cin >> a >> b >> c;
graph[a].push_back((Edge){a, b, c});
graph[b].push_back((Edge){b, a, c});
}
for(int i=0;i<2;++i){
for(int j=1;j<=n;++j)
mini[i][j] = INF;
}
mini[0][1] = 0;
priority_queue<Node> que;
que.push((Node){1, 0, 0});
while(!que.empty()){
Node curr = que.top(); que.pop();
if(curr.n == n){
cout << curr.cost << endl;
break;
}
for(auto e : graph[curr.n]){
int newcost = curr.cost + e.cost;
if(newcost < mini[curr.ticket][e.to]){
mini[curr.ticket][e.to] = newcost;
que.push((Node){e.to, newcost, curr.ticket});
}
if(curr.ticket == 0){
for(auto ee : graph[e.to]){
if(curr.cost < mini[1][ee.to]){
mini[1][ee.to] = curr.cost;
que.push((Node){ee.to, curr.cost, 1});
}
}
}
}
}
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, revb;
int main() {
cin >> a >> b;
while (b > 0) {
revb *= 10;
revb += (b % 10);
b /= 10;
}
cout << a + revb;
return 0;
}
| 8 | CPP |
#include <iostream>
#include <queue>
using namespace std;
int main(){
int m;
int n;
int c;
int f;
int g;
int h;
int i;
int j;
int k;
while(cin >>m){
if(m==0){break;}
int a[m];
int b[m];
c=0;
while(c<m){
cin >>a[c];
cin >>b[c];
c=c+1;}
cin >>n;
int d[n];
int e[n];
c=0;
while(c<n){
cin >>d[c];
cin >>e[c];
c=c+1;}
c=0;
while(c<n){
k=0;
f=d[c]-a[0];
g=e[c]-b[0];
h=1;
while(h<m){
j=0;
i=0;
while(i<n){
if(a[h]+f==d[i]&&b[h]+g==e[i]){j=1; break;}
i=i+1;}
if(j==0){k=1; break;}
h=h+1;}
if(k==0){cout <<f<<" "<<g<<endl; break;}
c=c+1;}
}} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL n, k;
cin >> n >> k;
int c = 1;
if (k % 2 != 0)
;
else
while (k % 2 == 0) {
k /= 2;
c++;
}
cout << c;
}
| 8 | CPP |
def main():
t = int(input())
for tt in range(t):
n = int(input())
l = list(map(int, input().split()))
l.sort()
t = []
if n % 2:
t.append(l[n // 2])
for i in range(n // 2):
t.append(l[n // 2 - i - 1])
t.append(l[(n + 1) // 2 + i])
print(*t)
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, t, k, c, d;
string s;
cin >> t;
while (t--) {
cin >> n;
vector<long long> a, b, l, r;
for (int i = 0; i < n; i++) {
cin >> c;
a.push_back(c);
b.push_back(c);
}
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
for (int j = n - i - 1; j > -1; j--) {
if (i == 0 && j == n - i - 1 && a[j] == b[i]) {
break;
}
if (a[j] == b[i]) {
l.push_back(j + 1);
a.erase(a.begin() + j);
break;
}
}
}
cout << l.size() << endl;
for (auto x : l) {
cout << x << " " << n << " " << 1 << endl;
}
}
return 0;
}
| 8 | CPP |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
while(cin >> n && n!=0){
n=1000-n;
int sum=0;
int coin[]={500,100,50,10,5,1};
for(int i=0;i<6;i++)
while(n>=coin[i]){
sum++;
n-=coin[i];
}
cout << sum << endl;
}
return 0;
} | 0 | CPP |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a>b){swap(a,b);}
if(b>c){swap(c,b);}
if(a>b){swap(a,b);}
cout<<a<<" "<<c<<endl;
return 0;
}
| 0 | CPP |
import math
for i in range(5):
a=input()
if(a.find("1")!=-1):
print(abs( (4-a.find("1"))//2)+abs(i-2))
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, ta, tb, tc, f[80][80][80][2], a[80], b[80], c[80], sumv[80], sumk[80],
sumx[80];
char s[80];
int main() {
scanf("%d%s+1", &n, s + 1);
for (int i = 1; i <= n; i++) {
sumv[i] = sumv[i - 1] + (s[i] == 'V');
sumk[i] = sumk[i - 1] + (s[i] == 'K');
sumx[i] = sumx[i - 1] + (s[i] != 'V' && s[i] != 'K');
if (s[i] == 'V')
a[++ta] = i;
else if (s[i] == 'K')
b[++tb] = i;
else
c[++tc] = i;
}
memset(f, 0x7f, sizeof(f));
f[0][0][0][0] = 0;
for (int i = 0; i <= ta; i++)
for (int j = 0; j <= tb; j++)
for (int k = 0; k <= tc; k++) {
if (i < ta)
f[i + 1][j][k][1] =
min(f[i + 1][j][k][1], min(f[i][j][k][0], f[i][j][k][1]) +
abs(sumk[a[i + 1]] - j) +
abs(sumx[a[i + 1]] - k));
if (j < tb)
f[i][j + 1][k][0] =
min(f[i][j + 1][k][0], f[i][j][k][0] + abs(sumv[b[j + 1]] - i) +
abs(sumx[b[j + 1]] - k));
if (k < tc)
f[i][j][k + 1][0] =
min(f[i][j][k + 1][0], min(f[i][j][k][0], f[i][j][k][1]) +
abs(sumv[c[k + 1]] - i) +
abs(sumk[c[k + 1]] - j));
}
printf("%d\n", min(f[ta][tb][tc][0], f[ta][tb][tc][1]) / 2);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
string s;
int main() {
cin >> n >> m >> s;
if (m - 1 < n - m) {
while (m > 1) {
cout << "LEFT\n";
--m;
}
for (int i = 0; i < (int)(n); i++) {
cout << "PRINT " << s[i] << "\n";
if (i != n - 1) cout << "RIGHT\n";
}
} else {
while (m < n) {
cout << "RIGHT\n";
++m;
}
for (int i = 0; i < (int)(n); i++) {
cout << "PRINT " << s[n - 1 - i] << "\n";
if (i != n - 1) cout << "LEFT\n";
}
}
return 0;
}
| 7 | CPP |
n, x = map(int, input().split())
y = 0
for _ in range(n):
tp, d = input().split()
d = int(d)
if tp == '+':
x += d
elif x >= d:
x -= d
else:
y += 1
print(x, y)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[222222], b[222222], n;
bool check(int x) {
b[n] = a[n]>=x;
for (int i=1; i<n; i++) {
b[n+i] = a[n+i]>=x;
b[n-i] = a[n-i]>=x;
if (b[n+i]==b[n+i-1] || b[n-i]==b[n-i+1]) return b[n+i-1];
}
return b[1];
}
int main () {
scanf("%d", &n);
for (int i=1; i<=2*n+1; i++) {
scanf("%d", &a[i]);
}
int l = 1, r = 2*n-1, ans;
while (l<=r) {
int mid = (l+r)/2;
if (check(mid)) {
ans=mid;
l=mid+1;
} else {
r=mid-1;
}
}
printf("%d\n", ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
const int mod = 998244353, g = 3, _g = 332748118, maxn = 2e5 + 9;
inline int Pow(int base, int b) {
int ret(1);
while (b) {
if (b & 1) ret = 1ll * ret * base % mod;
base = 1ll * base * base % mod;
b >>= 1;
}
return ret;
}
int r[maxn], W[maxn];
inline int Fir(int n) {
int limit(1), len(0), up(n << 1);
while (limit < up) {
limit <<= 1;
++len;
}
for (int i = 0; i < limit; ++i)
r[i] = (r[i >> 1] >> 1) | ((i & 1) << len - 1);
return limit;
}
inline void NTT(int *a, int n, int type) {
for (int i = 0; i < n; ++i)
if (i < r[i]) std::swap(a[i], a[r[i]]);
for (int mid = 1; mid < n; mid <<= 1) {
int wn(Pow(type ? g : _g, (mod - 1) / (mid << 1)));
W[0] = 1;
for (int i = 1; i < mid; ++i) W[i] = 1ll * W[i - 1] * wn % mod;
for (int R = mid << 1, j = 0; j < n; j += R)
for (int k = 0; k < mid; ++k) {
int x(a[j + k]), y(1ll * W[k] * a[j + mid + k] % mod);
a[j + k] = 1ll * (x + y) % mod;
a[j + mid + k] = 1ll * (x - y + mod) % mod;
}
}
}
int T[maxn], F[maxn], H[maxn], fac[maxn], fav[maxn], tmp[maxn], sum[maxn],
B[maxn];
inline int Mul(int n, int *a, int *b, int *ans) {
int limit(Fir(n));
NTT(a, limit, 1);
NTT(b, limit, 1);
for (int i = 0; i < limit; ++i) ans[i] = 1ll * a[i] * b[i] % mod;
NTT(ans, limit, 0);
for (int i = ((n - 1) << 1) + 1; i < limit; ++i) a[i] = b[i] = 0;
return Pow(limit, mod - 2);
}
inline void Solve(int n, int *a) {
if (!n) {
a[0] = 1;
return;
}
if (n == 1) {
a[1] = 1;
return;
}
int len(n / 2);
Solve(len, a);
for (int i = 0; i <= len; ++i) {
F[i] = 1ll * Pow(len, i) * fav[i] % mod;
H[i] = 1ll * fac[i] * a[i] % mod;
}
std::reverse(H, H + len + 1);
int limit(Fir(len + 1));
NTT(F, limit, 1);
NTT(H, limit, 1);
for (int i = 0; i < limit; ++i) F[i] = 1ll * F[i] * H[i] % mod;
NTT(F, limit, 0);
int ty(Pow(limit, mod - 2));
for (int i = 0; i <= len; ++i)
tmp[i] = 1ll * F[len - i] * ty % mod * Pow(fac[i], mod - 2) % mod;
for (int i = (len << 1); i <= limit; ++i) F[i] = H[i] = 0;
int val(Mul(len + 1, a, tmp, B));
for (int i = 0; i <= (len << 1); ++i) a[i] = 1ll * B[i] * val % mod;
if (n & 1)
for (int i = n; i >= 1; --i)
a[i] = 1ll * (a[i - 1] + 1ll * (n - 1) * a[i] % mod) % mod;
}
int n, a, b, m;
int ans[maxn];
int main() {
scanf("%d%d%d", &n, &a, &b);
int val;
val = fac[0] = fac[1] = 1;
for (int i = 2; i <= n; ++i) val = fac[i] = 1ll * val * i % mod;
val = fav[n] = Pow(fac[n], mod - 2);
for (int i = n; i >= 1; --i) val = fav[i - 1] = 1ll * val * i % mod;
Solve(n - 1, ans);
n = a + b - 2;
m = a - 1;
printf("%d\n",
1ll * ans[n] * fac[n] % mod * fav[m] % mod * fav[n - m] % mod % mod);
}
| 13 | CPP |
#include <bits/stdc++.h>
const long long oo = 1e16;
using namespace std;
const int N = 1000005;
long long n, dp[N];
long long num(long long n) {
if (n == 0) return 0;
if (dp[n] != -1) return dp[n];
string s = to_string(n);
long long res = oo;
for (int i = 0; i < s.size(); i++)
if (s[i] != '0') res = min(res, 1 + num(n - (s[i] - '0')));
return dp[n] = res;
}
int main() {
cin >> n;
memset(dp, -1, sizeof(dp));
cout << num(n);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int ans = 0;
char last = ' ', ch = getchar();
while (ch < '0' || ch > '9') last = ch, ch = getchar();
while (ch >= '0' && ch <= '9') ans = ans * 10 + ch - '0', ch = getchar();
if (last == '-') ans = -ans;
return ans;
}
int main() {
int n = read(), ans = 0, r;
vector<pair<int, int>> v(n);
for (int(i) = (0); (i) < (n); ++i) v[i].first = read(), v[i].second = read();
sort(v.begin(), v.end());
r = v[0].second;
for (int(i) = (1); (i) < (n); ++i) {
if (r > v[i].second)
ans++;
else {
r = v[i].second;
}
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, head[2][5005], cnt[2], dis[5005], u[5005], v[5005], num[5005];
struct edge {
int to, next, cost;
} e[2][5005];
bool vis[3][5005];
queue<int> q;
template <typename T>
inline T read() {
T x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') w = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * w;
}
inline void adde(int u, int v, int w, int opt) {
e[opt][++cnt[opt]] = (edge){v, head[opt][u], w};
head[opt][u] = cnt[opt];
}
void bfs(int S, int op) {
q.push(S), vis[op][S] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v, i = head[op][u]; i; i = e[op][i].next) {
v = e[op][i].to;
if (vis[op][v]) continue;
q.push(v), vis[op][v] = 1;
}
}
}
void SPFA() {
memset(vis[0], 0, sizeof(vis[0]));
memset(dis, -0x3f, sizeof(dis));
q.push(1);
dis[1] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
vis[0][u] = 0;
for (int v, i = head[0][u]; i; i = e[0][i].next) {
v = e[0][i].to;
if (dis[v] < dis[u] + e[0][i].cost) {
dis[v] = dis[u] + e[0][i].cost;
if (!vis[0][v]) {
vis[0][v] = 1, num[v]++, q.push(v);
}
}
if (num[v] >= n) {
puts("No");
exit(0);
}
}
}
}
int main() {
n = read<int>(), m = read<int>();
for (int i = 1; i <= m; i++)
u[i] = read<int>(), v[i] = read<int>(), adde(u[i], v[i], 0, 0),
adde(v[i], u[i], 0, 1);
bfs(1, 0), bfs(n, 1);
memset(head, 0, sizeof(head)), cnt[0] = 0;
for (int i = 1; i <= n; i++)
if (vis[0][i] && vis[1][i]) vis[2][i] = 1;
for (int i = 1; i <= m; i++)
if (vis[2][u[i]] && vis[2][v[i]])
adde(u[i], v[i], 1, 0), adde(v[i], u[i], -2, 0);
SPFA();
puts("Yes");
for (int i = 1; i <= m; i++)
if (vis[2][u[i]] && vis[2][v[i]])
printf("%d\n", dis[v[i]] - dis[u[i]]);
else
printf("%d\n", 1);
return 0;
}
| 11 | CPP |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#define pb(in,tmp) in.push_back(tmp)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) loop(i,0,b)
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
using namespace std;
void bom(int x,int y,vector<string>&in){
in[x][y]='0';
loop(i,-3,4)
loop(j,-3,4){
if(i&&j)continue;
if(x+i>=0&&x+i<8&&y+j>=0&&y+j<8&&in[x+i][y+j]=='1')bom(x+i,y+j,in);
}
}
int main(){
int n;
cin>>n;
rep(i,n){
vector<string> in(8);
rep(j,8)cin>>in[j];
int x,y;
cin>>x>>y;
if(in[y-1][x-1]=='1')bom(y-1,x-1,in);
cout<<"Data "<<i+1<<":"<<endl;
rep(j,8)cout<<in[j]<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
char e = '\n';
const long long MOD = 1e9 + 7;
long long i, j, le;
int sv(int x) {
int n = 200000;
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p) prime[i] = false;
}
}
if (prime[x])
return 1;
else
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long n, c = 0;
string s;
cin >> n >> s;
string nst = "";
if (s.size() == 1)
cout << s << e;
else {
for (i = 0; i + n <= s.size(); i++) {
string st = s.substr(i, n);
nst += st[c];
c++;
}
cout << nst << e;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
long long c[N], x[N];
map<long long, long long> mp;
set<long long> e;
int main() {
long long n, k, a;
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> x[i];
cin >> a;
for (long long i = 0; i < n; i++) cin >> c[i];
long long ans = 0;
bool ok = true;
for (long long i = 0; i < n; i++) {
mp[c[i]]++;
e.insert(c[i]);
while (k < x[i]) {
if (!e.size()) {
ok = false;
break;
}
k += a;
ans += *e.begin();
mp[*e.begin()]--;
if (!mp[*e.begin()]) e.erase(e.begin());
}
if (!ok) break;
}
cout << (ok ? ans : -1) << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
int ans[maxn], a[maxn];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 3; i <= n; i++) a[i] = a[i - 1] + (i - 1) / 2;
if (m > a[n])
printf("-1\n");
else {
int j = 3;
ans[1] = 1;
ans[2] = 2;
while (m) {
if (m >= a[j] - a[j - 1]) {
ans[j] = j;
m -= a[j] - a[j - 1];
} else {
ans[j] = ans[j - 1] + ans[j - m * 2];
m = 0;
}
j++;
}
for (int i = j; i <= n; i++) ans[i] = ans[i - 1] + ans[j - 1] + 1;
for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
return 0;
}
| 11 | CPP |
[k, n, w] = map(int, input().split())
cost = k*((w*(1+w))/2)
if n < cost:
print(int(cost - n))
else:
print(0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n;
cin >> d;
int flag = 0;
std::vector<int> dirtyStairs;
for (int i = 1; i <= d; i++) {
int temp;
cin >> temp;
if (temp == 1 || temp == n) flag = 1;
dirtyStairs.push_back(temp);
}
if (flag == 1) {
cout << "NO" << endl;
return 0;
}
std::sort(dirtyStairs.begin(), dirtyStairs.end());
int consCount = 0;
for (int i = 0; i < d - 1; i++) {
if (abs(dirtyStairs[i] - dirtyStairs[i + 1]) == 1) {
consCount++;
if (consCount >= 2) {
cout << "NO" << endl;
return 0;
}
} else {
consCount = 0;
}
}
cout << "YES" << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int px[102] = {0}, py[102] = {0};
int main() {
long long int x, y, bx = 0, by = 0;
string s;
cin >> x >> y;
cin >> s;
for (long long int i = 1; i <= s.length(); i++) {
if (bx == x && by == y) {
cout << "Yes" << endl;
return 0;
}
if (s[i - 1] == 'U') {
by++;
}
if (s[i - 1] == 'D') {
by--;
}
if (s[i - 1] == 'L') {
bx--;
}
if (s[i - 1] == 'R') {
bx++;
}
px[i] = bx;
py[i] = by;
}
long long int flag = 0;
for (long long int i = 0; i <= s.length(); i++) {
long long int a = x - px[i];
long long int b = y - py[i];
long long int k = 0;
if (bx != 0) {
k = a / bx;
} else if (by != 0) {
k = b / by;
} else
k = 1;
if (k >= 0 && bx * k == a && k * by == b) {
flag = 1;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 7 | CPP |
import sys
input()
digits = list(sorted(set([int(x) for x in input().split()])))
if len(digits) > 3: print(-1)
elif len(digits) == 3:
if digits[2] - digits[1] == digits[1] - digits[0]: print(digits[2] - digits[1])
else: print(-1)
elif len(digits) == 2:
diff = digits[1] - digits[0]
print(diff if diff % 2 else diff // 2)
else: print(0) | 8 | PYTHON3 |
#include <bits/stdc++.h>
int mod = 1073741824;
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.length();
if (n < 26) {
cout << "-1" << endl;
} else {
int curr = -1;
for (int i = 0; i < n; i++) {
if (s[i] - 'a' == curr + 1) {
curr = curr + 1;
} else if (s[i] - 'a' == curr) {
s[i] = s[i] + 1;
curr = curr + 1;
} else if (s[i] - 'a' < curr) {
s[i] = 'a' + curr + 1;
curr = curr + 1;
}
if (curr == 25) {
break;
}
}
if (curr == 25) {
cout << s << endl;
} else {
cout << "-1" << endl;
}
}
}
| 9 | CPP |
import sys
from collections import defaultdict as dd
from collections import deque
def eprint(*args):
print(*args, file=sys.stderr)
pl=1
from math import *
import copy
#sys.setrecursionlimit(10**6)
if pl:
input=sys.stdin.readline
def li():
return [int(xxx) for xxx in input().split()]
def fi():
return int(input())
def si():
return list(input().rstrip())
def mi():
return map(int,input().split())
d=[]
from bisect import *
from itertools import permutations
from bisect import *
f=[0 for i in range(100)]
for i in range(1,100):
if i==1:
f[i]=1
else:
f[i]=2*f[i-1]+1
#print(f[:15])
def rec(n,k):
s=[]
while n!=0:
n,r=n//k,n%k
#print(n,r)
if r<0:
r-=k
n+=1
#print(s,n,r)
s.append(r)
return s
a,b,x,y=mi()
g=gcd(x,y)
x//=g
y//=g
l=1
r=10**10
ans=0
aa=[0,0]
while l<=r:
mid=(l+r)//2
#print(x*mid,y*mid)
if x*mid<=a and y*mid<=b:
ans=max(ans,x*y*mid**2)
aa=[x*mid,y*mid]
l=mid+1
else:
r=mid-1
print(*aa) | 9 | PYTHON3 |
p = int(input())
def f(x, p):
y = 1
for i in range(p - 2):
y = (y * x) % p
if y == 1: return False
return (y * x) % p == 1
print(sum(f(x, p) for x in range(1, p))) | 7 | PYTHON3 |
n,k=map(int,input().split())
s=k
ans=0
for i in range(1,n+1):
s+=i*5
if s<=240:
ans=i
else:
break
print(ans) | 7 | PYTHON3 |
for _ in range(int(input())):
x, y = map(int, input().strip().split())
if x>=y:print('YES')
else:
if x==1:print('NO')
elif x==2:
if y==3:print('YES')
else:print('NO')
elif x==3:print('NO')
else:print('YES') | 8 | PYTHON3 |
s1 = ''.join(input().split())
s2 = ''.join(input().split())
for i in s2:
if s2.count(i) > s1.count(i):
print("NO")
exit(0)
print("YES") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bitset<300000005> isp;
int main() {
int l, r;
while (scanf("%d %d", &l, &r) != EOF) {
int ret = 0, i, j;
isp.set();
isp[0] = isp[1] = 0;
for (i = 3; i * i <= r; i += 2)
if (isp[i])
for (j = i * i; j <= r; j += (i << 1)) isp[j] = 0;
for (i = (((l + 2) >> 2) << 2) + 1; i <= r; i += 4)
if (isp[i]) ret++;
ret += (l <= 2 && r >= 2);
printf("%d\n", ret);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long int rand(long long int x, long long int y) {
++y;
return (rng() % (y - x)) + x;
}
string to_string(char c) {
string second(1, c);
return second;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline long long int gcd(long long int a, long long int b) {
if (a > b) swap(a, b);
if (a == 0) return b;
return gcd(b % a, a);
}
long long int n, m, col[1002][1002];
char grid[1002][1002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (long long int i = 1; i < (long long int)n + 1; ++i) {
for (long long int j = 1; j < (long long int)m + 1; ++j) {
cin >> grid[i][j];
}
}
for (long long int j = 1; j < (long long int)m + 1; ++j) {
long long int p = 1;
for (long long int i = 1; i < (long long int)n + 1; ++i) {
if (p < i) p = i;
for (long long int k = p + 1; k < (long long int)n + 1; ++k) {
if (grid[k][j] != grid[i][j]) break;
p = k;
}
col[i][j] = p;
}
}
long long int ans = 0;
for (long long int i = 1; i < (long long int)n + 1; ++i) {
long long int p = 1;
for (long long int j = 1; j < (long long int)m + 1; ++j) {
if (p < j) p = j;
long long int p1 = i, p2 = col[i][j] + 1, p3 = col[p2][j] + 1;
if (p2 > n || p3 > n || (p2 - p1) != (p3 - p2) ||
(grid[p1][j] == grid[p2][j]) || (grid[p2][j] == grid[p3][j]))
continue;
long long int len = p2 - p1;
if (col[p3][j] - p3 + 1 < len) continue;
for (long long int k = p + 1; k < (long long int)m + 1; ++k) {
if (col[p1][j] != col[p1][k] || grid[p1][j] != grid[p1][k]) break;
if (col[p2][j] != col[p2][k] || grid[p2][j] != grid[p2][k]) break;
if (len > col[p3][k] - p3 + 1 || grid[p3][j] != grid[p3][k]) break;
p = k;
}
ans += (p - j + 1);
}
}
cout << ans;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010, M = 1e6 + 10, MOD = 1e9 + 7;
int n, Q, m, a[N], last[M], v[M], prm[M], inv[M], ans[N];
struct Query {
int l, r, id;
} ask[N];
bool cmp(Query x, Query y) { return x.r < y.r; }
void findprm(int k) {
for (int i = 2; i <= k; i++) {
if (!v[i]) {
v[i] = i;
prm[++m] = i;
}
for (int j = 1; j <= m; j++) {
if (1LL * prm[j] * i > k || v[i] < prm[j]) break;
v[prm[j] * i] = prm[j];
}
}
}
long long fpow(long long x, long long k, long long p) {
long long ans = 1;
for (; k; k >>= 1, x = x * x % p)
if (k & 1) ans = ans * x % p;
return ans;
}
struct Seg {
int l[N * 4], r[N * 4];
long long mul[N * 4];
void pushup(int x) { mul[x] = mul[x * 2] * mul[x * 2 + 1] % MOD; }
void build(int x, int ql, int qr) {
l[x] = ql;
r[x] = qr;
if (ql == qr) {
mul[x] = a[ql];
return;
}
int mid = (ql + qr) >> 1;
build(x * 2, ql, mid);
build(x * 2 + 1, mid + 1, qr);
pushup(x);
}
void update(int x, int k, int val) {
if (l[x] == k && r[x] == k) {
mul[x] = mul[x] * val % MOD;
return;
}
int mid = (l[x] + r[x]) >> 1;
if (k <= mid)
update(x * 2, k, val);
else
update(x * 2 + 1, k, val);
pushup(x);
}
long long query(int x, int ql, int qr) {
if (l[x] == ql && r[x] == qr) return mul[x];
int mid = (l[x] + r[x]) >> 1;
if (qr <= mid)
return query(x * 2, ql, qr);
else if (ql > mid)
return query(x * 2 + 1, ql, qr);
else
return query(x * 2, ql, mid) * query(x * 2 + 1, mid + 1, qr) % MOD;
}
} seg;
int main() {
findprm(M - 10);
inv[0] = 1;
for (int i = 1; i <= M - 10; i++) inv[i] = fpow(i, MOD - 2, MOD);
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
seg.build(1, 1, n);
scanf("%d", &Q);
for (int i = 1; i <= Q; i++) {
scanf("%d%d", &ask[i].l, &ask[i].r);
ask[i].id = i;
}
sort(ask + 1, ask + 1 + Q, cmp);
for (int i = 1, j = 1; i <= Q; i++) {
for (; j <= ask[i].r; j++)
for (int k = a[j]; k > 1;) {
int d = v[k];
if (last[d]) seg.update(1, last[d], d);
if (last[d]) seg.update(1, last[d], inv[d - 1]);
last[d] = j;
seg.update(1, j, inv[d]);
seg.update(1, j, d - 1);
while (k % d == 0) k /= d;
}
ans[ask[i].id] = seg.query(1, ask[i].l, ask[i].r);
}
for (int i = 1; i <= Q; i++) printf("%d\n", ans[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(339264);
const long long MOD = 998244353;
vector<string> guys = {"Anka", "Chapay", "Cleo", "Troll",
"Dracul", "Snowy", "Hexadecimal"};
pair<int, int> opt = {2e9 + 30, 0};
int smp = 0;
int cnt[3];
int gr[7];
void brute(int i, vector<vector<int>> &symp, long long a, long long b,
long long c) {
if (i == 7) {
if (cnt[0] > 0 && cnt[1] > 0 && cnt[2] > 0) {
long long x = a / cnt[0];
long long y = b / cnt[1];
long long z = c / cnt[2];
long long d = max(abs(x - y), max(abs(y - z), abs(x - z)));
if (d < opt.first) {
opt.first = d;
opt.second = smp;
} else if (d <= opt.first && opt.second < smp) {
opt.second = smp;
}
}
return;
}
for (int cl = 0; cl < 3; cl++) {
gr[i] = cl;
cnt[cl]++;
for (int j : symp[i]) {
if (gr[j] == gr[i]) {
smp++;
}
}
brute(i + 1, symp, a, b, c);
for (int j : symp[i]) {
if (gr[j] == gr[i]) {
smp--;
}
}
cnt[cl]--;
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cout << fixed << setprecision(20);
int n;
cin >> n;
vector<vector<int>> symp(7);
for (int i = 0; i < n; i++) {
string a, b, c;
cin >> a >> b >> c;
int p = find(guys.begin(), guys.end(), a) - guys.begin();
int q = find(guys.begin(), guys.end(), c) - guys.begin();
if (p > q) {
symp[p].push_back(q);
} else {
symp[q].push_back(p);
}
}
long long a, b, c;
cin >> a >> b >> c;
brute(0, symp, a, b, c);
cout << opt.first << " " << opt.second << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
map<string, int> G;
int n, e[40], m, q[40], H[(1 << 20) + 1];
int f[(1 << 16) + 1], ans = inf, A;
char s[100];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
e[i] = 1 << (i - 1);
q[i] = (1 << i) - 1;
scanf("%s", s);
G[s] = i;
}
H[0] = 0;
for (int i = 1; i <= q[n]; ++i) H[i] = H[i - (i & -i)] + 1;
scanf("%d", &m);
for (int i = 1, now, k; i <= m; ++i) {
scanf("%d", &k);
for (int j = 0; j <= q[n]; ++j) f[j] = inf;
f[0] = now = 0;
for (int j = 1, p; j <= k; ++j) {
scanf("%s", s);
p = G.count(s);
if (!p || (now & e[p = G[s]])) continue;
now = (now & q[p - 1]) | e[p];
for (int l = 0; l <= q[n]; ++l)
if ((l & e[p]) == 0 && f[l] < inf)
if (f[l | e[p]] > f[l] + H[l & (q[n] - q[p])])
f[l | e[p]] = f[l] + H[l & (q[n] - q[p])];
}
if (f[q[n]] < ans) {
ans = f[q[n]];
A = i;
}
}
if (ans >= inf)
puts("Brand new problem!");
else {
ans = n * (n - 1) / 2 - ans + 1;
printf("%d\n[:", A);
for (int i = 1; i <= ans; ++i) printf("|");
printf(":]\n");
}
return 0;
}
| 10 | CPP |
from collections import deque
dxy = [(1, 0), (0, 1), (-1, 0), (0, -1)]
while True:
W, H = map(int, input().split())
if W == 0 and H == 0:
break
sx = -1
sy = -1
mat = [[None for _ in range(W)] for _ in range(H)]
for i in range(H):
s = input()
for j in range(W):
if s[j] == "@":
sx = j
sy = i
mat[i][j] = s[j]
ans = 0
q = deque()
q.append((sx, sy))
while q:
(cx, cy) = q.popleft()
ans += 1
for dx, dy in dxy:
nx = cx + dx
ny = cy + dy
if 0 <= nx < W and 0 <= ny < H:
if mat[ny][nx] == ".":
mat[ny][nx] = "#"
q.append((nx, ny))
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10005;
bitset<maxn> ans;
int n, q, x, y, v;
struct segmentree {
bitset<maxn> s[maxn << 2];
vector<int> tag[maxn << 2];
inline void update(int u, int l, int r, int x, int y, int v) {
if (x <= l && y >= r) {
tag[u].push_back(v);
return;
} else {
int mid = (l + r) >> 1;
if (x <= mid) update(u << 1, l, mid, x, y, v);
if (y > mid) update(u << 1 | 1, mid + 1, r, x, y, v);
}
}
inline void dfs(int u, int l, int r) {
s[u].set(0);
s[u] |= s[u >> 1];
for (int i = 0; i < tag[u].size(); ++i) {
s[u] = s[u] | (s[u] << tag[u][i]);
}
if (l == r) {
ans |= s[u];
return;
} else {
int mid = (l + r) >> 1;
dfs(u << 1, l, mid);
dfs(u << 1 | 1, mid + 1, r);
}
}
} tree;
int main() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= q; ++i) {
scanf("%d%d%d", &x, &y, &v);
tree.update(1, 1, n, x, y, v);
}
tree.dfs(1, 1, n);
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (ans[i]) cnt++;
printf("%d\n", cnt);
for (int i = 1; i <= n; ++i)
if (ans[i]) printf("%d ", i);
printf("\n");
return 0;
}
| 11 | CPP |
// my code goes here
// HITESH VISHNOI MANIT SE HU
// <only constrains are imaginary but, I AM REAL.........>
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(a,b,n) for(ll a=b;a<n;a++)
#define readarr(arr,n) f(i,0,n) cin>>arr[i];
#define ll long long
#define pb push_back
#define go ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ms(a,i) memset(a,i,sizeof(a))
#define mod 1000000007 //1e9+7 ans%mod
#define w(t) int t; cin>>t; while(t--)
#define MOD 1e9+7
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define vi vector<int>
#define mp map<int,int>
#define pi pair<int,int>
#define inf 1e18
#define ff first
#define ss second
#define ps(x,y) fixed <<setprecision(y)<<x
#define yes cout <<"YES" << endl
#define no cout <<"NO" << endl
void pseudo()
{ go;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
long long hcf(long long a,long long b){
long long greater=a>b?a:b;
long long lesser=a<b?a:b;
return hcf(greater,lesser);
}
long long lcm(long long a,long long b){
return a*b/hcf(a,b);
}
int32_t main ()
{
pseudo() ;
w(t)
{
string s ;
cin >> s ;
int q =0;
int open=0,close=0 ;
bool flag = false ;
int n= s.size() ;
if (s[0]==')' or s[n-1] =='(')
flag=1 ;
else
{
f(i,0,n)
{
if(s[i]=='?') q++;
if(s[i]=='(') open++;
if(s[i]==')') close++;
}
int d = abs(open- close) ;
if (d==0 and q%2!=0)
flag=1 ;
else if (d!=0 and d!=q)
{
flag = 1;
}
}
if(flag) no ; else yes ;
}
return 0 ;
} | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
struct POINT {
int x, y, num;
POINT(int a, int b, int c) : x(a), y(b), num(c){};
};
vector<POINT> sector[1001][1001];
vector<int> perm;
bool cmp(const POINT &lhs, const POINT &rhs) {
if (lhs.x + lhs.y != rhs.x + rhs.y) return lhs.x + lhs.y < rhs.x + rhs.y;
return lhs.num < rhs.num;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
POINT p(x, y, i + 1);
sector[x / 1000][y / 1000].push_back(p);
}
for (int i = 0; i <= 1000; i++) {
if (i % 2 == 0) {
for (int j = 0; j <= 1000; j++) {
sort(sector[i][j].begin(), sector[i][j].end(), cmp);
for (auto u : sector[i][j]) perm.push_back(u.num);
}
} else {
for (int j = 1000; j >= 0; j--) {
sort(sector[i][j].begin(), sector[i][j].end(), cmp);
for (auto u : sector[i][j]) perm.push_back(u.num);
}
}
}
for (auto u : perm) cout << u << ' ';
return 0;
}
| 11 | CPP |
import queue
def permutation():
t = int(input())
for i in range(0, t):
num = int(input())
if (num < 4):
print("-1")
else:
plist = list()
odds = list()
evens = queue.Queue()
for j in range(1, num+1):
if(j % 2 == 0):
if(j == 2):
evens.put(4)
elif (j == 4):
evens.put(2)
else:
evens.put(j)
else:
odds.append(j)
while (len(odds) > 0):
plist.append(odds.pop())
while(not evens.empty()):
plist.append(evens.get())
for e in plist:
print(e, end = " ")
if __name__ == "__main__":
permutation() | 13 | PYTHON3 |
a = int(input())
b = list(input())
z = 0
o = 0
for t in range(0,a):
if(b[t] == '0'):
z+=1
if(b[t] == '1'):
o+=1
if(z > o):
print(z-o)
elif(z < o):
print(o-z)
else:
print(0)
| 7 | PYTHON3 |
k=int(input())
x=k//50
y=k%50
ans=[i+x for i in range(50)]
for i in range(y):
for j in range(50):
if ans[j]==x:
ans[j]+=50
else:
ans[j]-=1
for i in range(50):
ans[i]=str(ans[i])
print(50)
print(' '.join(ans)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996);
const int maxn = 1e5 + 5;
long long pow3(long long x) { return x * x * x; }
long long ans, ansx;
void solve(long long mx, long long cnt, long long num) {
if (mx == 0) {
if (cnt > ansx || cnt == ansx && ans < num) {
ansx = cnt, ans = num;
}
return;
}
long long i = 1;
while (pow3(i + 1) <= mx) ++i;
solve(mx - pow3(i), cnt + 1, num + pow3(i));
if (i > 1) {
solve(pow3(i) - 1 - pow3(i - 1), cnt + 1, num + pow3(i - 1));
}
}
int main() {
long long n;
while (~scanf("%I64d", &n)) {
ansx = ans = 0;
solve(n, 0, 0);
printf("%I64d %I64d\n", ansx, ans);
}
return 0;
}
| 8 | CPP |
import math
n = int(input())
out = math.factorial(2*n - 2)/(math.factorial(n - 1) ** 2)
print(int(out)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int MAX(int &a, int b) { return a = max(a, b); }
const int MIN(int &a, int b) { return a = min(a, b); }
int n, m, ct[21][21], dp[1 << 21], lowest[1 << 21], dist[1 << 21][21];
string second;
void read() { cin >> n >> m >> second; }
void solve() {
for (int i = 0; i < second.size() - 1; i++) {
ct[second[i] - 'a'][second[i + 1] - 'a']++;
ct[second[i + 1] - 'a'][second[i] - 'a']++;
}
for (int i = 0; i < (1 << 21); i++) {
dp[i] = (1e9 * 1) + 5;
}
dp[0] = 0;
for (int i = 1; i <= (1 << m) - 1; i++) {
for (int j = 0; j < 20; j++) {
if ((i >> j) & 1) {
lowest[i] = j;
break;
}
}
}
for (int i = 1; i <= (1 << m) - 1; i++) {
for (int j = 0; j < m; j++) {
int x = lowest[i];
dist[i][j] = dist[i ^ (1 << x)][j] + ct[j][x];
}
}
for (int i = 0; i < (1 << m); i++) {
for (int j = 0; j < m; j++) {
if ((i >> j) & 1) continue;
int pos = __builtin_popcount(i);
MIN(dp[i | (1 << j)],
dp[i] +
pos * (dist[i][j] - dist[((1 << m) - 1) ^ (i | (1 << j))][j]));
}
}
cout << dp[(1 << m) - 1] << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
read();
solve();
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, t, cnt = 0;
cin >> t;
while (t--) {
cin >> n >> k;
while (n > 0) {
if (n % k == 0) {
n /= k;
cnt++;
} else {
cnt += n % k;
n -= n % k;
}
}
cout << cnt << endl;
cnt = 0;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int x, a = 1, b, tmp;
vector<int> manf;
bool flg;
int main() {
getline(cin, s);
for (int i = 2; i < s.length(); i += 2) {
if (s[i] == '+')
a++;
else if (s[i] == '-')
b++;
else if (s[i] == '=') {
for (int j = i + 2; j < s.length(); j++) x = x * 10 + (s[j] - '0');
break;
}
}
if (a * x < x + b || a > x + b * x) {
cout << "Impossible";
return 0;
}
if (a - b > x) {
tmp = a - x;
for (int i = 0; i < b; i++) {
manf.push_back(min(x, tmp - b + i + 1));
tmp -= min(x, tmp - b + i + 1);
}
tmp = a - x;
} else {
tmp = b;
for (int i = 0; i < b; i++) manf.push_back(1);
}
tmp += x;
cout << "Possible" << endl;
for (int i = 0; i < s.length(); i += 2) {
if (s[i] == '?') {
if (flg) {
cout << manf.back() << " ";
manf.pop_back();
} else {
a--;
cout << min(x, tmp - a) << " ";
tmp -= min(x, tmp - a);
}
} else if (s[i] == '+') {
flg = 0;
cout << s[i] << " ";
} else if (s[i] == '-') {
flg = 1;
cout << s[i] << " ";
} else if (s[i] == '=') {
cout << "= " << x;
break;
}
}
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define int long
signed main(){
string s,t,u;
int a,b;
cin>>s>>t>>a>>b>>u;
if(s==u)--a;
else --b;
cout<<a<<" "<<b;
} | 0 | CPP |
# cook your dish here
n=int(input())
c=0
for i in range(n):
if (sum(list(map(int,input().split(" "))))>=2):
c=c+1
print(c) | 7 | PYTHON3 |
import traceback
import math
def main():
N = int(input())
nums = list(map(int, input().split()))
def get(n):
while n % 2 == 0 or n % 3 == 0:
if n % 2 == 0: n //= 2
if n % 3 == 0: n //= 3
return n
x = get(nums[0])
for i in range(1, N):
# print(nums[i], get(nums[i]))
if x != get(nums[i]):
return 'No'
return 'Yes'
try:
ans = main()
print(ans)
except Exception:
traceback.print_exc() | 7 | PYTHON3 |
h,m=input().split(':')
h=int(h)
m=int(m)
t=0
if(h//10==m%10 and h%10==m//10):
print(0)
else:
while(True):
m+=1
t+=1
if(m==60):
h+=1
m=0
if(h==24):
h=0
if(h//10==m%10 and h%10==m//10):
print(t)
break
| 7 | PYTHON3 |
a=input()
b=a[1:len(a)]
print(a[0].upper()+b) | 7 | PYTHON3 |
n = int(input())
lamps = list(input())
count=0
dict1 = { 'R':0, 'G':1, 'B':2}
dict2 = { 1:'B', 2:'G', 3:'R'}
i=1
while(i<n):
if(i==n-1 and lamps[i]==lamps[i-1]):
count+=1
if(lamps[i]=='R' or lamps[i]=='B'):
lamps[i]='G'
else: lamps[i]='R'
elif(lamps[i]==lamps[i-1]== lamps[i+1]):
count+=1
if(lamps[i]=='R' or lamps[i]=='B'):
lamps[i]='G'
else: lamps[i]='R'
elif(lamps[i]==lamps[i-1]):
count+=1
lamps[i] = dict2[ dict1[lamps[i]]+dict1[lamps[i+1]] ]
i+=1
print(count)
print(''.join(lamps) )
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n, m;
int a[maxn];
double ans;
double f[maxn][maxn];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
f[i][j] = a[i] > a[j], f[j][i] = a[j] > a[i];
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
if (x == y) continue;
for (int j = 1; j <= n; j++) {
if (j == x || j == y) continue;
f[j][x] = f[j][y] = (f[j][x] + f[j][y]) / 2.0;
f[x][j] = f[y][j] = (f[x][j] + f[y][j]) / 2.0;
}
f[x][y] = f[y][x] = 0.5;
}
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) ans += f[i][j];
printf("%lf", ans);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long powmod(long long a, long long b) {
long long tmp = 1;
a %= (1000000007);
for (; b; b >>= 1) {
if (b & 1) tmp = tmp * a % (1000000007);
a = a * a % (1000000007);
}
return tmp;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <class T>
inline void R(T &xx) {
xx = 0;
char ch = getchar();
bool F = 0;
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') F = 1, ch = getchar();
while (ch >= '0' && ch <= '9')
xx = xx + xx + (xx << 3) + ch - 48, ch = getchar();
if (F) xx = -xx;
}
template <class T>
inline void add(int &x, T y) {
for (x += y; x >= (1000000007); x -= (1000000007))
;
}
int n, top;
long long a, b, c, d, st[100111];
struct nod {
long long x, y;
inline bool operator<(const nod &b) const {
return (x == b.x) ? y > b.y : (x < b.x);
}
} p[100111];
int main() {
R(n);
R(a);
R(b);
R(c);
R(d);
for (int i = 1; i <= n; i++) {
long long x, y;
R(x), R(y);
p[i] = (nod){b * y - a * x, c * x - d * y};
}
sort(p + 1, p + 1 + n);
for (int i = 1; i <= n; i++)
if (p[i].x > 0 && p[i].y > 0) {
if (!top || p[i].y > st[top])
st[++top] = p[i].y;
else {
int l = 1, r = top, mid, ans;
while (l <= r) {
mid = l + r >> 1;
if (p[i].y <= st[mid])
r = mid - 1, ans = mid;
else
l = mid + 1;
}
st[ans] = p[i].y;
}
}
printf("%d\n", top);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
string a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int c = 0;
for (i = 1; i < n - 1; i++) {
for (j = 1; j < n - 1; j++) {
int p = i + 1;
int q = j + 1;
int r = i - 1;
int l = j - 1;
if (a[i][j] == 'X')
if ((a[i][j] == a[r][l]) && (a[r][l] == a[r][q]) &&
(a[r][q] == a[p][l]) && (a[p][l] == a[p][q]))
c++;
}
}
cout << c;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
scanf("%I64d", &x);
if (x < 0) x = -x;
long long i = 0;
while (i * (i + 1) / 2 < x) i++;
if ((x - i * (i + 1) / 2) & 1) {
if (i & 1)
printf("%I64d\n", i + 2);
else
printf("%I64d\n", i + 1);
} else
printf("%I64d\n", i);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using V = vector<T>;
int gcdex(int a, int b, int &x, int &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
int x1, y1;
int g = gcdex(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return g;
}
inline int ADD_MOD(int a, int b) { return (a + b) % 1000000007; }
inline int MUL_MOD(int a, int b) { return (int64_t(a) * b) % 1000000007; }
inline int SUB_MOD(int a, int b) { return a >= b ? a - b : a + 1000000007 - b; }
int DIV_MOD(int a, int b) {
int x, y;
gcdex(b, 1000000007, x, y);
int b1 = (x % 1000000007 + 1000000007) % 1000000007;
return MUL_MOD(a, b1);
}
const long double EPS = 1. / 1e9;
inline bool EPS_EQUAL(long double a, long double b) {
return abs(a - b) <= EPS;
}
inline bool EPS_LESS(long double a, long double b) { return b - a > EPS; }
inline bool EPS_GREATER(long double a, long double b) { return a - b > EPS; }
const int INF = 1e9;
const int64_t INF64 = 2e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(15);
string s;
cin >> s;
int chars[26] = {0};
for (int i = 0; i < s.length(); ++i) {
chars[s[i] - 'a']++;
}
int left = 0;
int right = 25;
while (left < right) {
if (chars[left] % 2 == 1) {
while (left < right && chars[right] % 2 == 0) {
--right;
}
if (left < right) {
chars[left]++;
chars[right]--;
}
}
++left;
}
char middle = -1;
for (int i = 0; i < 26; ++i) {
if (chars[i] % 2 == 1) {
middle = i;
}
for (int j = 0; j < chars[i] / 2; ++j) {
cout << (char)(i + 'a');
}
}
if (middle >= 0) {
cout << (char)(middle + 'a');
}
for (int i = 25; i >= 0; --i) {
for (int j = 0; j < chars[i] / 2; ++j) {
cout << (char)(i + 'a');
}
}
cout << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int main() {
int i, r = 0;
char s[110];
scanf("%s", s);
for (i = 0; s[i]; i++) {
if (s[i] == '/') {
while (s[i + 1] == '/') i++;
if (s[i + 1]) {
putchar('/');
r = 1;
}
} else {
putchar(s[i]);
r = 1;
}
}
if (r == 0) putchar('/');
puts("");
}
| 7 | CPP |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
e = LI()
d = defaultdict(int)
for i in e:
d[i] += 1
for i in d.values():
if i != 2:
print("no")
break
else:
print("yes")
return
#B
def B():
n = I()
a = LI()
a.sort()
ans = -float("inf")
for c in range(n):
for d in range(c):
m = a[c]-a[d]
for i in range(n)[::-1]:
if i != c and i != d:
e = i
break
for i in range(e)[::-1]:
if i != c and i != d:
b = i
break
ans = max(ans, (a[e]+a[b])/m)
print(ans)
return
#C
def C():
def gcd(a,b):
if a == 0:
return b
return gcd(b%a, a)
s = input()
n = len(s)
if s.count("(") == 0:
s = float(s)
b = 10**(n-2)
a = round(s*b)
g = gcd(a,b)
a //= g
b //= g
else:
n = s.find("(")
t = float(s[:n])
b = 10**(n-2)
a = round(t*b)
g = gcd(a,b)
a //= g
b //= g
l = (s.find("(")-s.find(".")-1)
s = s[n+1:-1]
m = len(s)
c = round(float(s))
d = (10**m-1)*10**l
g = gcd(c,d)
c //= g
d //= g
a = a*d+b*c
b = b*d
g = gcd(a,b)
a //= g
b //= g
print(str(a)+"/"+str(b))
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#I
def I_():
return
#J
def J():
return
#Solve
if __name__ == "__main__":
C()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 205;
int n, a[MX], res = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
n *= 2;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i += 2) {
for (int j = i + 1; j < n; j++) {
if (a[i] == a[j]) {
j--;
while (j > i) {
swap(a[j], a[j + 1]);
res++;
j--;
}
break;
}
}
}
cout << res << '\n';
return 0;
}
| 8 | CPP |
S=input()
A=S.count('4')+S.count('7')
if A==4 or A==7:
print('YES')
else:
print("NO") | 7 | PYTHON3 |
def f(l):
n,t = l #1e3-1e4; 2e9;
return n*(1.000000011**t)
l = list(map(int,input().split()))
print(f(l))
| 8 | PYTHON3 |
import os
import sys
from io import BytesIO, IOBase
# region fastio
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")
# ------------------------------
def RL(): return map(int, sys.stdin.readline().rstrip().split())
def RLL(): return list(map(int, sys.stdin.readline().rstrip().split()))
def N(): return int(input())
def comb(n, m): return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0
def perm(n, m): return factorial(n) // (factorial(n - m)) if n >= m else 0
def mdis(x1, y1, x2, y2): return abs(x1 - x2) + abs(y1 - y2)
def toord(c): return ord(c)-ord('a')
def lcm(a, b): return a*b//lcm(a, b)
mod = 998244353
INF = float('inf')
from math import factorial, sqrt, ceil, floor, gcd
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush
# ------------------------------
# f = open('../input.txt')
# sys.stdin = f
def main():
n = N()
arr = RLL()
q = N()
dic = defaultdict(int)
for i in arr:
dic[i]+=1
sq = 0
twos = 0
for i in dic:
sq+=dic[i]//4
twos+=dic[i]//2
for _ in range(q):
s = input().split()
x = int(s[1])
bsq = dic[x]//4
btw = dic[x]//2
if s[0]=='+':
dic[x]+=1
else:
dic[x]-=1
nbsq = dic[x]//4
nbtw = dic[x]//2
sq+=nbsq-bsq
twos+=nbtw-btw
if sq>1 or (sq>0 and twos-2>1):
# print(sq, twos)
print('YES')
else:
print("NO")
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char s[15][5];
int ff[5][15];
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < 4; i++)
for (int j = 0; j <= 9; j++) ff[i][j] = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 4; j++) ff[j][s[i][j] - '0']++;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int f = 0;
for (int k = 0; k < 4; k++)
if (s[i][k] != s[j][k]) f = 1;
if (!f) {
cnt++;
for (int r = 0; r <= 9; r++)
if (ff[0][r] == 0) {
ff[0][r] = 1;
s[i][0] = r + '0';
break;
}
}
}
}
cout << cnt << endl;
for (int i = 0; i < n; i++) cout << s[i] << endl;
}
return 0;
}
| 8 | CPP |
def tobase3(n):
ans = ""
for p in range(64, -1, -1):
c = 0
while 3 ** p <= n:
n -= 3 ** p
c += 1
ans += str(c)
return ans[::-1]
for _ in range(int(input())):
n = int(input())
on = n
r = tobase3(n)
# print(r)
b = 0
for i in range(65):
if r[i] == '2':
n += 3 ** i
r = tobase3(n)
r = "0" * i + r[i:]
n = int(r.rstrip("0")[::-1], 3)
print(n) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
const int INF = 2000000000;
struct Edge {
int from, to, cap, flow, index;
Edge(int from, int to, int cap, int flow, int index)
: from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
int N;
vector<vector<Edge>> G;
vector<Edge *> dad;
vector<int> Q;
Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
void AddEdge(int from, int to, int cap) {
G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
if (from == to) G[from].back().index++;
G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
}
long long BlockingFlow(int s, int t) {
fill(dad.begin(), dad.end(), (Edge *)NULL);
dad[s] = &G[0][0] - 1;
int head = 0, tail = 0;
Q[tail++] = s;
while (head < tail) {
int x = Q[head++];
for (int i = 0; i < G[x].size(); i++) {
Edge &e = G[x][i];
if (!dad[e.to] && e.cap - e.flow > 0) {
dad[e.to] = &G[x][i];
Q[tail++] = e.to;
}
}
}
if (!dad[t]) return 0;
long long totflow = 0;
for (int i = 0; i < G[t].size(); i++) {
Edge *start = &G[G[t][i].to][G[t][i].index];
int amt = INF;
for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
if (!e) {
amt = 0;
break;
}
amt = min(amt, e->cap - e->flow);
}
if (amt == 0) continue;
for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
e->flow += amt;
G[e->to][e->index].flow -= amt;
}
totflow += amt;
}
return totflow;
}
long long GetMaxFlow(int s, int t) {
long long totflow = 0;
while (long long flow = BlockingFlow(s, t)) totflow += flow;
return totflow;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, b, q;
cin >> n >> b >> q;
vector<pair<int, int>> v(q);
for (int i = 0; i < q; i++) cin >> v[i].first >> v[i].second;
v.push_back({0, 0});
v.push_back({b, n});
sort(v.begin(), v.end());
v.resize(distance(v.begin(), unique(v.begin(), v.end())));
for (int i = 1; i < v.size(); i++)
if (v[i].second < v[i - 1].second ||
v[i].second - v[i - 1].second > v[i].first - v[i - 1].first) {
cout << "unfair" << '\n';
return 0;
}
vector<pair<pair<int, int>, int>> rng;
for (int i = 1; i < v.size(); i++)
rng.push_back(
{{v[i - 1].first + 1, v[i].first}, v[i].second - v[i - 1].second});
Dinic mf(N);
int src = 1e5 - 10, sink = 1e5 - 9;
for (int i = 0; i < 5; i++) {
mf.AddEdge(src, i, n / 5);
for (int j = 0; j < rng.size(); j++) {
int cnt = 0;
for (int k = rng[j].first.first; k <= rng[j].first.second; k++) {
if (k % 5 != i) continue;
cnt++;
}
if (cnt) mf.AddEdge(i, j + 5, cnt);
}
}
for (int j = 0; j < rng.size(); j++)
mf.AddEdge(j + 5, j + 5 + rng.size(), rng[j].second),
mf.AddEdge(j + 5 + rng.size(), sink, INF);
if (mf.GetMaxFlow(src, sink) == n)
cout << "fair" << '\n';
else
cout << "unfair" << '\n';
return 0;
}
| 12 | CPP |
n = int(input())
sub = list(map(int,input().split()))
rs = sum(sub)
print(rs/n) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
double p;
int N;
struct edge {
int to;
double c;
edge(){}
edge(int to,double c):to(to),c(c){}
};
vector<edge> G[100005];
double AC = 0.0;
double solve( int id,int pr ){
double ret = 0.0f;
for( edge e : G[id] ) {
if( e.to == pr ) continue;
ret += ( e.c + solve( e.to, id ) ) * p;
}
ret += AC;
return ret;
}
int main() {
scanf("%lf",&p);
scanf("%d",&N);
for(int i=0;i<N-1;i++){
int x,y, c;
scanf("%d%d%d",&x,&y,&c); --x; --y;
G[x].emplace_back( y, (double)c );
G[y].emplace_back( x, (double)c );
}
AC = solve( 0, 0 );
AC = solve( 0, 0 );
printf("%.9lf\n",AC);
} | 0 | CPP |
q=lambda:map(int,input().split())
qi=lambda:int(input())
qs=lambda:input().split()
n,m=q()
a=[input() for i in range(n)]
c=[(x,y) for x in range(n) for y in range(m) if a[x][y]=='*']
x=[x+1 for x,y in c]
y=[y+1 for x,y in c]
print(*[i for i in set(x) if x.count(i)==1],*[i for i in set(y) if y.count(i)==1]) | 7 | PYTHON3 |
def solve1():
n = int(input())
print('1 ' * n)
if __name__ == '__main__':
for _ in range(int(input())):
solve1() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long v, p, k;
void solve() {
string A, B;
cin >> A >> B;
n = A.length();
int ans = 0;
for (long long i = 0; i < n - 1; i++) {
if (A[i] == '0' && B[i] == '0' && A[i + 1] == '0') {
ans++;
if (i + 2 < n)
if (B[i + 1] == '0' && B[i + 2] == '0' && A[i + 2] == '0') {
ans++;
i++;
}
i++;
} else if (A[i] == '0' && B[i] == '0' && B[i + 1] == '0') {
ans++;
if (i + 2 < n)
if (A[i + 1] == '0' && B[i + 2] == '0' && A[i + 2] == '0') {
ans++;
i++;
}
i++;
} else if (A[i + 1] == '0' && B[i + 1] == '0' && A[i] == '0') {
ans++;
i++;
} else if (A[i + 1] == '0' && B[i + 1] == '0' && B[i] == '0') {
ans++;
i++;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
for (long long a = 0; a < t; a++) {
solve();
}
return 0;
}
| 10 | CPP |
t = int(input())
while (t>0):
n = int(input())
print(" ".join(str(num) for num in range(1,n+1)))
t -= 1
| 7 | PYTHON3 |
t=int(input())
for i in range(t):
a,b=map(int,input().split())
if(a-b==0):
print(0)
elif(a>b):
if((a-b)%2==0):
print("1")
else:
print("2")
elif(b>a):
if((b-a)%2==0):
print("2")
else:
print("1")
| 7 | PYTHON3 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
ll n,a[maxn],ans;
map <ll,ll> p,C,V;
int main()
{
n=read(); rep(i,1,n) a[i]=read();
rep(i,1,n)
{
ll nw=1,res=1;
for(ll j=2;j*j*j<=a[i];j++)
{
if(a[i]%j==0)
{
int cnt=0;
while(a[i]%j==0) a[i]/=j,cnt++; cnt%=3;
if(cnt)
{
nw*=pow(j,cnt);
res*=pow(j,3-cnt);
}
}
}
ll tmp=a[i],q=sqrt(a[i]); nw*=a[i];
if(q*q==tmp) res*=q; else res*=a[i]*a[i];
p[nw]=res; C[nw]++;
}
for(map<ll,ll>::iterator it=p.begin();it!=p.end();it++)
{
pair <ll,ll> p2=*it;
if(V[p2.first]||V[p2.second]||p2.first==1) continue;
ans+=max(C[p2.first],C[p2.second]);
V[p2.first]=1; V[p2.second]=1;
}
cout<<ans+(C[1]>=1)<<endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
struct Linear_Basis {
long long basis[62];
int count = 0;
void clear() {
memset(basis, 0, sizeof basis);
count = 0;
}
void ins(long long x) {
if (!x) return;
for (int i = 60; i >= 0; i--) {
if (x & (1ll << i)) {
if (!basis[i]) {
basis[i] = x;
count++;
break;
}
x ^= basis[i];
}
}
}
} basis;
long long C[62][62];
long long pow2[62];
vector<pair<int, long long> > E[maxn];
bool used[maxn];
long long xorsum[maxn];
int n, m;
long long ans = 0;
int num[62][2];
void dfs(int u) {
for (int i = 0; i <= 60; i++) {
int bit = (xorsum[u] & (1ll << i)) != 0;
num[i][bit]++;
}
used[u] = 1;
for (auto e : E[u]) {
int v;
long long w;
tie(v, w) = e;
if (used[v]) {
basis.ins(xorsum[v] ^ xorsum[u] ^ w);
continue;
}
xorsum[v] = xorsum[u] ^ w;
dfs(v);
}
}
inline long long C2(int x) { return 1ll * x * (x - 1) / 2 % mod; }
void gao(int i) {
basis.clear();
memset(num, 0, sizeof num);
dfs(i);
int count = basis.count;
int N = num[0][0] + num[0][1];
for (int i = 0; i <= 60; i++) {
int cnt = 0;
for (int j = i; j <= 60; j++) {
if (basis.basis[j] & (1ll << i)) cnt++;
}
long long odd = 0, even = 0;
for (int j = 0; j <= cnt; j++) {
if (j & 1) {
(odd += C[cnt][j]) %= mod;
} else {
(even += C[cnt][j]) %= mod;
}
}
odd = odd * pow2[count - cnt] % mod;
even = even * pow2[count - cnt] % mod;
(ans += pow2[i] * odd % mod * (C2(num[i][0]) + C2(num[i][1])) % mod) %= mod;
(ans += pow2[i] * even % mod * num[i][0] % mod * num[i][1] % mod) %= mod;
}
}
int main() {
pow2[0] = 1;
for (int i = 1; i <= 60; i++) {
pow2[i] = pow2[i - 1] * 2 % mod;
}
C[0][0] = 1;
for (int i = 1; i <= 60; i++) {
C[i][0] = C[i][i] = 1;
for (int j = 1; j < i; j++) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int u, v;
long long w;
scanf("%d%d%lld", &u, &v, &w);
E[u].push_back(make_pair(v, w));
E[v].push_back(make_pair(u, w));
}
for (int i = 1; i <= n; i++) {
if (!used[i]) {
gao(i);
}
}
cout << ans << endl;
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, arr[100001], res = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (k != 0 && arr[i] < 0) {
arr[i] *= -1;
k--;
}
}
if (k % 2 == 0) {
for (int i = 0; i < n; i++) res += arr[i];
} else {
int mini = 1e8;
for (int i = 0; i < n; i++) {
if (arr[i] <= mini) mini = arr[i];
}
for (int i = 0; i < n; i++) {
if (arr[i] == mini) {
arr[i] *= -1;
break;
}
}
for (int i = 0; i < n; i++) res += arr[i];
}
cout << res << endl;
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
a, b = map(int, input().split())
curr = b - a
if curr == 0:
print(0)
elif curr % 2 != 0:
print("{}".format(1 if curr > 0 else 2))
else:
print("{}".format(1 if curr < 0 else 2)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long init = 1e9 + 7;
const long long N = 1e7 + 7;
vector<bool> isPrime(N);
vector<int> counts(N, 0);
vector<int> ans(N, 0);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, num, maxx = -1;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
counts[num]++;
maxx = max(num, maxx);
}
int exit;
for (int i = 2; i < N; i++) isPrime[i] = true;
for (int i = 2; i < N; i++) {
if (isPrime[i]) {
ans[i] += counts[i];
for (int j = 2 * i; j < N; j += i) {
isPrime[j] = false;
ans[i] += counts[j];
}
}
exit = i;
}
for (int i = 1; i < N; ++i) {
ans[i] += ans[i - 1];
}
int l, r, m;
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> l >> r;
if (l > 1e7) {
cout << "0" << endl;
} else if (r > 1e7) {
cout << ans[1e7] - ans[l - 1] << endl;
} else {
cout << ans[r] - ans[l - 1] << endl;
}
}
return 0;
}
| 9 | CPP |
def fsum(a,b):
aa = int(a)
bb = int(b)
if aa+bb >= 2:
return '0'
else:
return str(aa+bb)
n = input()
m = input()
lis = []
for i in range(len(n)):
lis.append(fsum(n[i],m[i]))
print(''.join(lis)) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 22 19:58:42 2017
@author: svpopo18
"""
n = input()
s = input()
d = ''
for i in range(len(n)):
if (n[i] == s[i] == '0') or (n[i] == s[i] == '1'):
d += '0'
else:
d += '1'
print(d)
| 7 | PYTHON3 |
c = int(input())
for i in range(c):
wrd = input()
l = len(wrd)
if l>10:
ans = wrd[0]+str(l-2)+wrd[l-1]
print(ans)
else:
print(wrd)
| 7 | PYTHON3 |
A,B,C=map(int,input().split())
K=int(input())
i=0
while i<K:
if A>=B:
B*=2
elif B>=C:
C*=2
i+=1
print('Yes' if A<B<C else 'No') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; ++i) cin >> a[i], sum += a[i];
vector<bitset<2001>> dp(1 << n);
dp[0][0] = 1;
for (int i = 0; i < (1 << n); ++i) {
for (int j = sum; j >= 0; j--)
if (dp[i][j] && j % k == 0) dp[i][j / k] = 1;
for (int add = 0; add < n; ++add) {
if (i & (1 << add)) continue;
dp[i | (1 << add)] |= (dp[i] << a[add]);
}
}
vector<int> b(n);
function<void(int, int)> restore = [&](int mask, int s) {
if (mask == 0 && s == 0) return;
for (int i = 0; i < n; ++i) {
if (!(mask & (1 << i))) continue;
if (s >= a[i] && dp[mask ^ (1 << i)][s - a[i]]) {
restore(mask ^ (1 << i), s - a[i]);
return;
}
}
for (int t = 1; t * s * k <= sum; ++t) {
if (dp[mask][t * s * k]) {
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) b[i] += t;
}
restore(mask, t * s * k);
return;
}
}
};
if (dp[(1 << n) - 1][1]) {
cout << "YES\n";
restore((1 << n) - 1, 1);
multiset<pair<int, int>> s;
for (int i = 0; i < n; ++i) s.insert(make_pair(-b[i], a[i]));
for (int i = 0; i < n - 1; ++i) {
auto x = s.begin();
s.erase(s.begin());
auto y = s.begin();
s.erase(s.begin());
int vx = x->second, vy = y->second, P = -x->first;
cout << vx << ' ' << vy << '\n';
int sum = (x->second + y->second);
int nrd = 0;
while (sum % k == 0) {
sum /= k;
nrd++;
}
s.insert(make_pair(-(P - nrd), sum));
}
} else {
cout << "NO\n";
}
}
| 13 | CPP |
#include <cstdlib>
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a<b)swap(a,b);
for(int i=0;i<a;i++)cout<<b;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<string> base;
map<string, vector<pair<string, int> > > mp;
map<string, vector<pair<string, int> > >::iterator it;
vector<pair<string, int> > solve(vector<pair<string, int> > v) {
vector<pair<string, int> > ans = v;
it = mp.begin();
while (it != mp.end()) {
int sum = 0;
for (int i = 0; i < (*it).second.size(); i++) {
int j;
for (j = 0; j < v.size(); j++)
if (v[j].first == (*it).second[i].first) {
if (v[j].second >= (*it).second[i].second)
v[j].second -= (*it).second[i].second, sum++;
break;
}
if (j == v.size()) break;
}
if (sum == (*it).second.size()) {
int j = 0;
while (j != v.size()) {
if (v[j].second == 0)
v.erase(v.begin() + j);
else
j++;
}
for (j = 0; j < v.size(); j++)
if (v[j].first == (*it).first) {
v[j].second++;
break;
}
if (j == v.size()) v.push_back(make_pair((*it).first, 1));
return v;
}
it++;
}
return ans;
}
char s[10000];
int main(void) {
int k, n, m, q, nn, kl;
scanf("%d%d%d%d", &k, &n, &m, &q);
for (int i = 0; i < n; i++) {
scanf("%s", &s);
base.push_back((string)s);
}
string a;
char ch;
scanf("%c", &ch);
for (int i = 0; i < m; i++) {
vector<pair<string, int> > temp;
string name;
gets(s);
a = (string)s;
int pos = a.find(":");
name = a.substr(0, pos);
a.erase(0, pos + 2);
pos = a.find(",");
while (pos != -1) {
string sub = a.substr(0, pos);
sscanf(sub.c_str(), "%s %d", &s, &kl);
temp.push_back(make_pair((string)s, kl));
a = a.substr(pos + 1);
pos = a.find(",");
}
sscanf(a.c_str(), "%s %d", &s, &kl);
temp.push_back(make_pair((string)s, kl));
mp[name] = temp;
}
vector<vector<pair<string, int> > > ans(k, vector<pair<string, int> >());
for (int i = 0; i < q; i++) {
scanf("%d %s", &nn, &s);
nn--;
string name = (string)s;
int j;
for (j = 0; j < ans[nn].size(); j++) {
if (ans[nn][j].first == name) {
ans[nn][j].second++;
break;
}
}
if (j == ans[nn].size()) ans[nn].push_back(make_pair(name, 1));
ans[nn] = solve(ans[nn]);
}
for (int i = 0; i < k; i++) {
printf("%d\n", ans[i].size());
sort(ans[i].begin(), ans[i].end());
for (int j = 0; j < ans[i].size(); j++)
printf("%s %d\n", ans[i][j].first.c_str(), ans[i][j].second);
}
return 0;
}
| 9 | CPP |
N = int(input())
S = input()
T = input()
for i in range(N + 1):
if S[i:] == T[: N - i]:
print(N + i)
break
| 0 | PYTHON3 |
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 5;
const LL P = -1e15;
struct XXX{
LL a, b, c;
}s[MAXN + 5];
priority_queue<LL, vector<LL>, greater<LL> >Pa, Pb;
LL A[MAXN + 5], B[MAXN + 5], C[MAXN + 5];
LL sumL[MAXN + 5], sumR[MAXN + 5];
LL Csum = 0, suma, sumb;
int AA, BB, CC, N;
bool cmp(XXX a, XXX b) { return a.c < b.c; }
int main()
{
scanf("%d %d %d", &AA, &BB, &CC);
N = AA + BB + CC;
for(int i = 1; i <= N; i++)
scanf("%lld %lld %lld", &A[i], &B[i], &C[i]);
for(int i = 1; i <= N; i++)
s[i].a = A[i] - C[i], s[i].b = B[i] - C[i], Csum += C[i], s[i].c = s[i].a - s[i].b;
stable_sort(s + 1, s + 1 + N, cmp);
for(int i = 1; i <= N; i++){
LL b = s[i].b;
if(i <= BB) sumb += s[i].b, Pb.push(b);
else if(b > Pb.top()){
LL a = Pb.top();
sumb -= a, sumb += b;
Pb.pop(), Pb.push(b);
}
sumL[i] = sumb;
}
for(int i = N; i >= 1; i--){
LL a = s[i].a;
if(i >= N - AA + 1) suma += a, Pa.push(a);
else if(a > Pa.top()){
LL b = Pa.top();
suma -= b, suma += a;
Pa.pop(), Pa.push(a);
}
sumR[i] = suma;
}
LL Max = P;
for(int i = BB; i <= N - AA; i++) Max = max(Max, sumL[i] + sumR[i + 1]);
printf("%lld\n", Max + Csum);
} | 0 | CPP |
from collections import defaultdict
for _ in range(int(input())):
n=int(input())
freq=defaultdict(lambda:0)
for x in range(n):
s=input()
for char in s:
freq[char]+=1
for key in freq:
if freq[key]%n!=0:
print('NO')
break
else:
print('YES')
| 7 | PYTHON3 |
Subsets and Splits