solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
from math import sqrt
def dist(a,b):
return(sqrt(a**2+b**2))
def solve():
n=int(input())
d=[]
m=[]
for p in range(2*n):
a,b=map(int,input().split())
if a==0:
m.append(abs(b))
else:
d.append(abs(a))
d.sort()
m.sort()
ans=0
for x in range(n):
ans+=dist(d[x],m[x])
print(ans)
for _ in range(int(input())):
solve() | 7 | PYTHON3 |
#include <iostream>
using namespace std;
const int N = 10000100;
bool a[N];
void make_table(){
fill(a, a+N, true);
a[0] = false;
a[1] = false;
a[2] = true;
a[3] = true;
for(int i = 4;i < N;i+=2){
a[i] = false;
}
for(int i = 3;i < N;i += 2){
if (!a[i])continue;
for(int j = 2*i;j < N;j+=i){
a[j] = false;
}
}
}
int main(){
make_table();
int n;
cin >> n;
int ans = 0;
if (n <= 2){
ans = 0;
} else {
for(int i = 3;i <= n;i++){
if (a[i] && a[2 + i]){
ans++;
}
}
ans = ans * 2;
}
cout << ans << endl;
return 0;
}
| 0 | CPP |
def prime(n):
c=0
for i in range (2,int(pow(n,0.5))+1):
if(n%i==0):
c=1
break
if(c==0):
return 0
else:
return 1
for t in range (int(input())):
n=int(input())
if(n==2):
print("1 1")
print("1 1")
continue
elif(n==3):
print("1 1 1")
print("1 1 1")
print("1 1 1")
continue
if(prime(n)==0):
for i in range (n):
s="1 "
print(s*n)
else:
for i in range (n+1,200):
if(prime(i)==0):
r=i-n+1
if(prime(r)==1):
break
l1=[1]*n
for i in range (n):
l1[i]=r
print(*l1)
l1[i]=1
| 8 | PYTHON3 |
n = int(input())
v = []
for i in range(n):
p = list(map(int, input().split()))
m = p[0]
if i == 0:
v = p[1::]
else:
v1 = []
for a in range(1, len(p)):
for b in range(len(v)):
if v[b] == p[a]:
v1.append(v[b])
break
v = v1
v = sorted(v)
for i in range(len(v)):
print(v[i], end = ' ')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int read(void) {
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 f * x;
}
const int mod = 1e9 + 7;
int Len, ans;
int f[2][710][2];
long long mi10[710], num11[710];
char str[710];
long long calc(int digit) {
memset(f, 0, sizeof f);
f[0][0][1] = 1;
for (int i = 0; i < Len; ++i) {
memset(f[(i + 1) & 1], 0, sizeof f[(i + 1) & 1]);
for (int j = 0; j <= i; ++j) {
for (int l = 0; l < 10; ++l) {
(f[(i + 1) & 1][j + (l == digit)][0] +=
f[i & 1][j][0] * mi10[l > digit] % mod) %= mod;
if (l < str[i + 1] - '0')
(f[(i + 1) & 1][j + (l == digit)][0] +=
f[i & 1][j][1] * mi10[l > digit] % mod) %= mod;
if (l == str[i + 1] - '0')
(f[(i + 1) & 1][j + (l == digit)][1] +=
f[i & 1][j][1] * mi10[l > digit] % mod) %= mod;
}
}
}
long long temp = 0;
for (int i = 0; i <= Len; ++i) {
(temp += 1LL * (f[Len & 1][i][0] + f[Len & 1][i][1]) * num11[i] % mod *
digit % mod) %= mod;
}
return temp;
}
int main() {
mi10[0] = 1;
for (int i = 1; i <= 700; ++i) {
mi10[i] = mi10[i - 1] * 10 % mod;
num11[i] = (num11[i - 1] * 10 + 1) % mod;
}
scanf("%s", str + 1);
Len = strlen(str + 1);
for (int i = 1; i < 10; ++i) {
(ans += calc(i)) %= mod;
}
printf("%d\n", ans);
return 0;
}
| 13 | CPP |
s = input()
l = []
ans = "NO"
comb = ['ABC','ACB','BAC','BCA','CAB','CBA']
for i in comb:
if i in s:
ans = "YES"
break
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x0, x1, c = 0, first = 1, seq = 0;
cin >> n;
cin >> x0;
if (x0 == 1) ++c;
for (int i = 1; i < n; ++i) {
cin >> x1;
if (x1 == 1 || x0 == 1) {
++c;
}
x0 = x1;
}
if (x1 == 0 && c > 0) --c;
cout << c;
return 0;
}
| 8 | CPP |
num_soldiers = int(input())
soldiers_height = input()
soldiers_height = soldiers_height.split()
soldiers_height = [int(x) for x in soldiers_height]
biggest_height = soldiers_height[0]
smallest_height = soldiers_height[0]
for x in soldiers_height:
if x<smallest_height:
smallest_height = x
if x>biggest_height:
biggest_height = x
small_index = 0
big_index = soldiers_height.index(biggest_height)
for x in range(len(soldiers_height)):
if soldiers_height[x]==smallest_height:
small_index = x
swaps = big_index+(len(soldiers_height)-1) - small_index
if small_index<big_index:
swaps = swaps-1
print(swaps) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
os << "{";
for (auto e : v) os << e << ",";
return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
if (i) os << ",";
os << get<i>(t);
print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
os << "{";
print_tuple<0, tuple<Args...>, Args...>(os, t);
return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
cout << x;
if (suc == 1) cout << "\n";
if (suc == 2) cout << " ";
}
ll read() {
ll i;
cin >> i;
return i;
}
vi readvi(ll n, ll off = 0) {
vi v(n);
for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
return v;
}
pi readpi(ll off = 0) {
ll first, second;
cin >> first >> second;
return pi(first + off, second + off);
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
for (ll i = ll(0); i < ll(v.size()); i++)
print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
string s;
cin >> s;
return s;
}
template <class T>
T sq(const T& t) {
return t * t;
}
void yes(bool ex = true) {
cout << "YES"
<< "\n";
if (ex) exit(0);
}
void no(bool ex = true) {
cout << "NO"
<< "\n";
if (ex) exit(0);
}
void possible(bool ex = true) {
cout << "POSSIBLE"
<< "\n";
if (ex) exit(0);
}
void impossible(bool ex = true) {
cout << "IMPOSSIBLE"
<< "\n";
if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
for (ll i = ll(0); i < ll(ll(first.size())); i++)
swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
return lower_bound(v.begin(), v.end(), first) - v.begin();
}
vvc<ll> readGraph(ll n, ll m) {
vvc<ll> g(n);
for (ll i = ll(0); i < ll(m); i++) {
ll first, second;
cin >> first >> second;
first--;
second--;
g[first].push_back(second);
g[second].push_back(first);
}
return g;
}
vvc<ll> readTree(ll n) { return readGraph(n, n - 1); }
template <class d>
struct maxflow {
struct E {
ll to, rev;
d cap;
};
vvc<E> g;
vi itr, lv, q;
maxflow(ll n) : g(n), itr(n), lv(n), q(n) {}
pi ae(ll s, ll t, d c) {
g[s].push_back({t, (ll)g[t].size(), c});
g[t].push_back({s, (ll)g[s].size() - 1, 0});
return pi(s, ll(g[s].size()) - 1);
}
void bfs(ll s) {
fill(lv.begin(), lv.end(), -1);
lv[s] = 0;
ll l = 0, r = 0;
q[r++] = s;
while (l < r) {
ll v = q[l++];
for (auto e : g[v])
if (e.cap > 0 && lv[e.to] == -1) {
lv[e.to] = lv[v] + 1;
q[r++] = e.to;
}
}
}
d dfs(ll v, ll t, d f) {
if (v == t) return f;
d res = 0;
for (ll& i = itr[v]; i < (ll)g[v].size(); i++) {
E& e = g[v][i];
if (e.cap > 0 && lv[e.to] == lv[v] + 1) {
d first = dfs(e.to, t, min(f, e.cap));
if (first > 0) {
e.cap -= first;
g[e.to][e.rev].cap += first;
res += first;
f -= first;
if (f <= 0) break;
}
}
}
return res;
}
d calc(ll s, ll t, d mx = inf) {
d f = 0;
while (f < mx) {
bfs(s);
if (lv[t] == -1) return f;
fill(itr.begin(), itr.end(), 0);
f += dfs(s, t, mx - f);
}
return f;
}
};
void slv() {
ll n, m;
cin >> n >> m;
vvc<ll> first(n, vi(m));
for (ll i = ll(0); i < ll(n); i++) first[i] = readvi(m);
if (n * m == 1) {
no(0);
return;
}
{
for (ll i = ll(0); i < ll(n); i++)
for (ll j = ll(0); j < ll(m); j++) {
if (first[i][j] == 1) {
no(0);
return;
}
}
}
vvc<ll> idx(n, vi(m, -1));
ll cnt[2]{};
for (ll i = ll(0); i < ll(n); i++)
for (ll j = ll(0); j < ll(m); j++) {
ll p = (i + j) % 2;
idx[i][j] = cnt[p]++;
}
ll s = cnt[0] + cnt[1];
maxflow<ll> mf(s + 4);
vc<tuple<pi, pi, pi>> match;
vc<string> ans(n, string(m, '?'));
const ll dyx[]{-1, 0, 1, 0, -1};
const string dirstr = "URDL";
vvc<ll> vals(n, vi(m, -1));
for (ll i = ll(0); i < ll(n); i++)
for (ll j = ll(0); j < ll(m); j++) {
for (ll dir = ll(0); dir < ll(4); dir++) {
ll y = i + dyx[dir];
ll x = j + dyx[dir + 1];
if (inc(0, y, n - 1) && inc(0, x, m - 1)) {
if (first[y][x] < first[i][j]) {
ans[i][j] = dirstr[dir];
vals[i][j] = first[i][j] - first[y][x];
}
}
}
ll p = (i + j) % 2;
ll k = idx[i][j];
if (ans[i][j] == '?') {
if (p == 0) {
mf.ae(s + 1, k, 1);
} else {
mf.ae(cnt[0] + k, s + 3, 1);
}
} else {
if (p == 0) {
mf.ae(s, k, 1);
} else {
mf.ae(cnt[0] + k, s + 2, 1);
}
}
if (p == 0) {
for (ll dir = ll(0); dir < ll(4); dir++) {
ll y = i + dyx[dir];
ll x = j + dyx[dir + 1];
if (inc(0, y, n - 1) && inc(0, x, m - 1) &&
first[i][j] == first[y][x]) {
match.emplace_back(pi(i, j), pi(y, x),
mf.ae(k, cnt[0] + idx[y][x], 1));
}
}
}
}
mf.calc(s + 1, s + 3);
mf.calc(s + 1, s + 2);
mf.calc(s + 0, s + 3);
mf.calc(s + 0, s + 2);
for (auto z : match) {
pi fr, to, e;
tie(fr, to, e) = z;
if (mf.g[e.first][e.second].cap == 0) {
for (ll dir = ll(0); dir < ll(4); dir++) {
ll y = fr.first + dyx[dir];
ll x = fr.second + dyx[dir + 1];
if (pi(y, x) == to) {
ans[fr.first][fr.second] = dirstr[dir];
ans[to.first][to.second] = dirstr[dir ^ 2];
vals[fr.first][fr.second] = 1;
vals[to.first][to.second] = first[to.first][to.second] - 1;
}
}
}
}
for (ll i = ll(0); i < ll(n); i++)
for (ll j = ll(0); j < ll(m); j++)
if (ans[i][j] == '?') {
no(0);
return;
}
yes(0);
for (ll i = ll(0); i < ll(n); i++) print(vals[i]);
for (ll i = ll(0); i < ll(n); i++)
print(vc<char>(ans[i].begin(), ans[i].end()));
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
ll t;
cin >> t;
for (ll _ = ll(0); _ < ll(t); _++) slv();
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, x, y;
int h[51], to[101], ne[101], sz[51];
long double c[51][51], fac[51];
long double f[51][51], g[51], tp[51];
inline void link(int x, int y, int k) {
to[k] = y;
ne[k] = h[x];
h[x] = k;
}
inline void dfs(int i, int fa) {
sz[i] = 0, f[i][0] = 1;
for (int k = h[i]; k; k = ne[k]) {
if (to[k] == fa) continue;
dfs(to[k], i);
memset(g, 0, sizeof(g));
sz[to[k]]++;
for (int l1 = 0; l1 <= sz[to[k]]; l1++) {
for (int l2 = 1; l2 <= sz[to[k]]; l2++) {
if (l2 <= l1)
g[l1] += f[to[k]][l2 - 1] / 2;
else
g[l1] += f[to[k]][l1];
}
}
memset(tp, 0, sizeof(tp));
for (int l1 = 0; l1 <= sz[i]; l1++)
for (int l2 = 0; l2 <= sz[to[k]]; l2++)
tp[l1 + l2] += f[i][l1] * g[l2] * c[l1 + l2][l1] *
c[sz[i] - l1 + sz[to[k]] - l2][sz[i] - l1];
memcpy(f[i], tp, sizeof(tp));
sz[i] += sz[to[k]];
}
}
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> x >> y;
link(x, y, (i << 1) - 1);
link(y, x, i << 1);
}
fac[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i;
c[0][0] = 1;
for (int i = 1; i <= n; 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];
}
for (int i = 1; i <= n; i++) {
dfs(i, 0);
cout << fixed << setprecision(9) << f[i][n - 1] / fac[n - 1] << endl;
}
}
| 12 | CPP |
i=lambda:map(int,input().split())
n,k=i()
A=list(i())
print(sum(t>=A[k-1] and t>0 for t in A)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
vector<pair<long double, long long> > a;
long double diff(long double &a, long double &b) {
long double ans = abs(a - b);
if (ans > 180) ans = 360 - ans;
return ans;
}
void solve() {
long long n;
cin >> n;
long double x, y;
a.resize(n);
for (long long i = 0; i < n; i++) {
cin >> x >> y;
a[i].first = atan2(y, x) * 180 / pi;
a[i].second = i;
}
sort(a.begin(), a.end());
long long l = -1, r = -1;
long double mn = 200;
for (long long i = 0; i < n; i++) {
if (diff(a[i].first, a[(i + 1) % n].first) < mn) {
mn = diff(a[i].first, a[(i + 1) % n].first);
l = a[i].second + 1;
r = a[(i + 1) % n].second + 1;
}
}
cout << l << " " << r << '\n';
}
int32_t main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
;
long long tests = 1;
while (tests--) {
solve();
}
return 0;
}
| 9 | CPP |
k = int(input())
p = [['0'] * 100 for j in range(100)]
g = lambda n: n * (n * n - 1) // 6
i = n = 0
while g(n + 1) <= k: n += 1
while i < n + 1:
for j in range(i): p[i][j] = p[j][i] = '1'
i += 1
k -= g(n)
g = lambda n: n * n - n >> 1
while k:
n = 0
while g(n + 1) <= k: n += 1
for j in range(n): p[i][j] = p[j][i] = '1'
k -= g(n)
i += 1
print(i)
for j in range(i): print(''.join(p[j][:i])) | 9 | PYTHON3 |
n = int(input())
s = ["Sheldon", "Leonard", "Penny", "Rajesh", "Howard"]
while n>5:
n = int(n/2) - 2
print(s[n-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[100030], ii, r1, r2, n;
vector<int> v[100030];
void dfs(long long e, long long p) {
for (int i = 0; i < v[e].size(); i++) {
if (v[e][i] == p) continue;
a[v[e][i]] = e;
dfs(v[e][i], e);
}
}
int main() {
cin >> n >> r1 >> r2;
int ii = 1;
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
if (i + 1 == r1) ii++;
v[a[i]].push_back(ii);
v[ii].push_back(a[i]);
ii++;
}
dfs(r2, -1);
for (int i = 1; i <= n; i++) {
if (i == r2) continue;
cout << a[i] << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
using namespace std;
int main(){
int ans=0;
string s;
while(cin>>s){
rep(i,0,s.size()){
if(s[i]-'0'>=0 && s[i]-'0'<10){
rep(j,i,s.size()){
if(s[j]-'0'<0 || s[j]-'0'>=10 || j == s.size() - 1){
if(j==s.size()-1) j++;
ans+=atoi(s.substr(i,j-i).c_str());
//cout<<atoi(s.substr(i,j-i).c_str())<<endl;
i = j;
break;
}
}
}
}
}
o(ans);
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n, x;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
a[i] = abs(x);
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
int p = upper_bound(a + i, a + n, 2 * a[i]) - a;
sum += (p - i - 1);
}
cout << sum;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct cord {
int x, y;
};
bool cmp(cord a, cord b) {
return ((a.x < b.x) || ((a.x == b.x) && (a.y < b.y)));
}
int main() {
cord a, b, c;
cin >> a.x >> a.y;
cin >> b.x >> b.y;
cin >> c.x >> c.y;
cord mas[3];
int i, j, cx, cy;
mas[0] = a;
mas[1] = b;
mas[2] = c;
sort(mas, mas + 3, cmp);
cord curr;
vector<cord> res;
if ((mas[0].y <= mas[1].y) && (mas[1].y <= mas[2].y)) {
cx = mas[0].x;
cy = mas[0].y;
while (cy < mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy++;
}
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
while (cy < mas[2].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy++;
}
while (cx <= mas[2].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
if ((mas[0].y >= mas[1].y) && (mas[1].y >= mas[2].y)) {
cx = mas[0].x;
cy = mas[0].y;
while (cy > mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy--;
}
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
while (cy > mas[2].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy--;
}
while (cx <= mas[2].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
if ((mas[0].y <= mas[2].y) && (mas[2].y <= mas[1].y)) {
cx = mas[0].x;
cy = mas[0].y;
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
while (cy <= mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy++;
}
cx = mas[2].x;
cy = mas[2].y;
while (cx > mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx--;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
if ((mas[0].y >= mas[2].y) && (mas[0].y <= mas[1].y)) {
cx = mas[2].x;
cy = mas[2].y;
while (cx > mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx--;
}
while (cy <= mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy++;
}
cx = mas[0].x;
cy = mas[0].y;
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
if ((mas[0].y >= mas[2].y) && (mas[1].y <= mas[2].y)) {
cx = mas[0].x;
cy = mas[0].y;
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
while (cy >= mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy--;
}
cx = mas[2].x;
cy = mas[2].y;
while (cx > mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx--;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
if ((mas[0].y <= mas[2].y) && (mas[1].y <= mas[0].y)) {
cx = mas[2].x;
cy = mas[2].y;
while (cx > mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx--;
}
while (cy >= mas[1].y) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cy--;
}
cx = mas[0].x;
cy = mas[0].y;
while (cx < mas[1].x) {
curr.x = cx;
curr.y = cy;
res.push_back(curr);
cx++;
}
cout << res.size() << endl;
for (i = 0; i < res.size(); i++)
cout << res[i].x << " " << res[i].y << endl;
return 0;
}
}
| 9 | CPP |
numberOfForces = int(input())
x_vectors = 0
y_vectors = 0
z_vectors = 0
for x in range(numberOfForces):
forces = [int(f) for f in input().split()]
x_vectors += forces[0]
y_vectors += forces[1]
z_vectors += forces[2]
if x_vectors != 0 or y_vectors != 0 or z_vectors != 0:
print("NO")
else:
print("YES") | 7 | PYTHON3 |
# AGC079 D - Wall
h,w=map(int,input().split())
c=[list(map(int,input().split())) for i in range(10)]
a=[list(map(int,input().split())) for i in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j]=min(c[i][j],c[i][k]+c[k][j])
ans=0
for i in range(h):
for j in range(w):
if a[i][j]>=0:
ans+=c[a[i][j]][1]
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
if (n % 2 != k % 2) {
cout << "NO\n";
continue;
}
if (k * k <= n) {
cout << "YES\n";
} else
cout << "NO\n";
}
}
| 7 | CPP |
w1, w2, existuje = input(), input(), True
if w1.lower() == w2.lower():
print(0)
else:
for i in range(len(w1)):
if ord(w1[i].lower()) > ord(w2[i].lower()):
print(1)
break
elif ord(w1[i].lower()) < ord(w2[i].lower()):
print(-1)
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int maxn = 3001, dx[] = {-1, 0, 1, -1, 1, -1, 0, 1},
dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int r, c, n, fa[maxn * maxn * 2], ans;
bool vis[maxn][maxn * 2];
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
int main() {
scanf("%d%d%d", &r, &c, &n);
if (c == 1) {
puts("0");
return 0;
}
for (int i = 0; i < r * c * 2; ++i) fa[i] = i;
while (n--) {
int x, y;
bool flag = 0;
scanf("%d%d", &x, &y);
--x, --y;
for (int i = 0; i < 8; ++i) {
int x1 = x + dx[i], y1 = y + dy[i];
if (x1 < 0 || x1 >= r) continue;
if (y1 < 0) y1 = c * 2 - 1;
if (!vis[x1][y1]) continue;
for (int j = 0; j < 8; ++j) {
int x2 = x + dx[j], y2 = y + c + dy[j];
if (x2 < 0 || x2 >= r) continue;
if (y2 >= c * 2) y2 = 0;
if (!vis[x2][y2]) continue;
if (find(x1 * c * 2 + y1) == find(x2 * c * 2 + y2)) {
flag = 1;
break;
}
}
if (flag) break;
}
if (!flag) {
++ans;
for (int i = 0; i < 8; ++i) {
int x1 = x + dx[i], y1 = y + dy[i];
if (x1 < 0 || x1 >= r) continue;
if (y1 < 0) y1 = c * 2 - 1;
if (vis[x1][y1]) fa[find(x * c * 2 + y)] = find(x1 * c * 2 + y1);
}
for (int i = 0; i < 8; ++i) {
int x1 = x + dx[i], y1 = y + c + dy[i];
if (x1 < 0 || x1 >= r) continue;
if (y1 >= c * 2) y1 = 0;
if (vis[x1][y1]) fa[find(x * c * 2 + y + c)] = find(x1 * c * 2 + y1);
}
vis[x][y] = vis[x][y + c] = 1;
}
}
printf("%d\n", ans);
return 0;
}
| 10 | CPP |
import sys
from math import sqrt
inp = sys.stdin.readline
read = lambda: list(map(int, inp().split()))
def solve():
print("CHAT WITH HER!" if len(set(list(inp().strip())))%2 == 0 else "IGNORE HIM!")
# m, n = read()
# print((m*n) // 2)
# ans = ""
# for _ in range(int(inp())):
# s = inp().strip()
# ans += ((s[0]+str(len(s)-2)+s[-1]) if len(s) > 10 else s) + "\n"
# print(ans)
if __name__ == "__main__":
solve() | 7 | PYTHON3 |
n=int(input())
initial=0
max=0
for i in range(0,n):
a,b=input().split(" ")
a=int(a)
b=int(b)
initial-=a
initial+=b
if initial>max:
max=initial
print(max)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void sb(vector<int> &a, vector<int> &b) {
int d = a.size() - b.size();
for (int i = 0; i < (int)(b.size()); ++i) a[i + d] -= b[i];
}
void ad(vector<int> &a, vector<int> &b) {
int d = a.size() - b.size();
for (int i = 0; i < (int)(b.size()); ++i) a[i + d] += b[i];
}
void pr(vector<int> &p) {
printf("%d\n", (int)p.size() - 1);
for (int i = (int)p.size() - 1; i >= 0; --i) {
printf("%d", p[i]);
if (i) printf(" ");
}
printf("\n");
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(2, 0), b(1, 1);
a[0] = 1;
for (int i = 1; i < (int)(n); ++i) {
vector<int> c = a;
a.push_back(0);
bool ok = true;
for (int i = 0; i < (int)(b.size()); ++i)
if (b[i] >= 1 && a[i + 2] >= 1 || b[i] <= -1 && a[i + 2] <= -1) {
ok = false;
break;
}
if (!ok)
sb(a, b);
else
ad(a, b);
swap(c, b);
}
pr(a);
pr(b);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int order[maxn << 1];
int ans[maxn];
int main() {
int n, temp, ne = 0, fail = 0;
char s;
cin >> n;
stack<int> st;
for (int i = 0; i < 2 * n; i++) {
cin >> s;
if (s == '+') {
order[i] = -1;
st.push(ne++);
} else {
cin >> temp;
order[i] = temp;
if (st.empty()) {
fail = 1;
continue;
}
ans[st.top()] = temp;
st.pop();
}
}
if (fail) {
cout << "NO" << endl;
return 0;
}
priority_queue<int, vector<int>, greater<int> > que;
ne = 0;
for (int i = 0; i < 2 * n; i++) {
if (order[i] == -1) {
que.push(ans[ne++]);
} else {
if (order[i] != que.top()) {
cout << "NO" << endl;
return 0;
}
que.pop();
}
}
cout << "YES" << endl;
for (int i = 0; i < n; i++) cout << ans[i] << ' ';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, m;
cin >> n >> m;
vector<long long int> arr(m);
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
vector<long long int> temp;
temp = arr;
sort(temp.begin(), temp.end());
vector<long long int> ans(m);
long long int sum = 0;
for (int i = 0; i < m; i++) {
int ind = upper_bound(temp.begin(), temp.end(), arr[i]) - temp.begin();
ind -= 1;
long long int mm = temp[ind];
for (int k = ind; k >= 0; k--) {
if (ans[k] == 1 and temp[k] == mm) ind--;
}
ans[ind] = 1;
for (int j = 0; j < ind; j++) {
if (ans[j] == 1) sum += 1;
}
}
cout << sum << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) {
solve();
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 50005;
int n, m, q, MOD, a[N], b[N], c[N], fa[6 * N];
bool pw4[1000005];
int gcd(int a, int b) {
return !b ? a : gcd(b, a % b);
}
int find(int x) {
return !fa[x] ? x : fa[x] = find(fa[x]);
}
void link(int a, int b) {
if (find(a) != find(b)) fa[find(a)] = find(b);
}
int id(int a, int b, int c) {
return (a - 1) * 6 + b * 3 + c + 1;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> m >> q >> MOD;
int g = MOD;
for (int i = 1; i <= m; ++i)
cin >> a[i] >> b[i] >> c[i], g = gcd(g, abs(c[i] - c[1]));
MOD = gcd(3 * g, MOD);
int z = c[1] % g;
for (int i = 1; i <= m; ++i) {
int t = (c[i] - z) / g;
for (int p = 0; p < 2; ++p)
for (int q = 0; q < 3; ++q) {
link(id(a[i], p, q), id(b[i], !p, (2 * q + t) % 3));
link(id(b[i], p, q), id(a[i], !p, (2 * q + t) % 3));
}
}
for (int i = 0, pw = z; i <= MOD; ++i, pw = 4 * pw % MOD) pw4[pw] = true;
for (int s, t, r; q--;) {
cin >> s >> t >> r;
bool ans = false;
for (int p = 0; p < 2 && !ans; ++p)
for (int q = 0; q < 3 && !ans; ++q)
ans = find(id(s, p, q)) == find(id(t, 0, 0)) && pw4[(r + z + (3 - q) * g << p) % MOD];
cout << (ans ? "YES\n" : "NO\n");
}
}
| 0 | CPP |
# B
cnt = [0]*5
for _ in range(3):
a, b = map(int, input().split())
cnt[a] += 1
cnt[b] += 1
if max(cnt) == 3:
print("NO")
else:
print("YES") | 0 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
s=input()
i,j=0,n-1
flag=True
while(j<(2*n-1)):
s1=s[i:j+1]
#print(s1)
if list(s1).count('1')==n:
flag=False
break
i+=1
j+=1
if flag:
print('0'*n)
else:
print('1'*n)
'''
if all r ones then 1111
else 00000
'''
| 7 | PYTHON3 |
from collections import Counter
from collections import defaultdict
from collections import deque
import math
import heapq
import sys
import io, os
input = sys.stdin.readline
# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import *
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().strip().split()))
rls = lambda: list(map(str, input().split()))
n = int(input().strip())
a = rl()
s = list(set(a))
s.sort()
d = defaultdict(lambda: -1)
ans = []
prev = 0
for i in s:
d[i] = 1
f = 1
prev=-1
for i in range(0, n):
if ( i!=0 and a[i] != a[i - 1]):
ans.append(a[i - 1])
continue
while (1):
prev = prev + 1
# print(i,prev)
if (d[prev] == 1):
continue
else:
break
# print(i,prev)
ans.append(prev)
if (a[i] - prev > 1):
f = 0
break
if (f):
mx = 0
for i in range(0, n):
mx = max(ans[i], mx)
if (a[i] - mx > 1):
print(-1)
exit()
print(*ans)
else:
print(-1)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
set<int> skup;
map<int, int> cnt;
int n, k;
int a[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
cnt[a[i]]++;
if (cnt[a[i]] == 1)
skup.insert(a[i]);
else
skup.erase(a[i]);
if (i - k > 0) {
cnt[a[i - k]]--;
if (cnt[a[i - k]] == 1)
skup.insert(a[i - k]);
else
skup.erase(a[i - k]);
}
if (i - k >= 0) {
if (skup.empty())
puts("Nothing");
else
printf("%d\n", *skup.rbegin());
}
}
return 0;
}
| 11 | CPP |
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def solve():
n = mint()
x = list(mints())
x.sort()
r = 0
w = [0]*(n+2)
c = [0]*(n+2)
for i in x:
c[i] += 1
if w[i-1] == 0:
w[i-1] += 1
r += 1
elif w[i] == 0:
w[i] += 1
r += 1
elif w[i+1] == 0:
w[i+1] += 1
r += 1
rm = r
r = 0
w = [0]*(n+2)
for i in range(1,n+1):
v = c[i]
if v != 0:
if w[i+1] > 0:
pass
elif w[i] > 0:
pass
elif w[i-1] > 0:
pass
else:
w[i+1] += v
r += 1
print(r,rm)
#for i in range(mint()):
solve()
| 11 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
s=str(input())[:n]
if "8" in s:
if n-1-s.index("8")>=10:
print("YES")
else:
print("NO")
else:
print("NO")
| 7 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
x1 = 0
x2 = 0
for i in range(1, n//2):
x1 += 2**i
for j in range(n//2, n):
x2 += 2**j
x1 += 2**n
print(abs(x1 - x2)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int con[26][26];
char str1[maxn];
char str2[maxn];
char strans[maxn];
int main() {
scanf("%s%s", str1, str2);
memset(con, inf, sizeof(con));
for (int i = 0; i < 26; i++) con[i][i] = 0;
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
getchar();
char a, b;
int w;
scanf("%c %c %d", &a, &b, &w);
int num1 = a - 'a';
int num2 = b - 'a';
if (num1 == num2) continue;
con[num1][num2] = min(w, con[num1][num2]);
}
for (int k = 0; k < 26; k++) {
for (int i = 0; i < 26; i++)
for (int j = 0; j < 26; j++) {
con[i][j] = min(con[i][k] + con[k][j], con[i][j]);
}
}
int len = strlen(str1);
int len1 = strlen(str2);
if (len != len1) {
printf("-1\n");
return 0;
}
int ans = 0;
int ff = 1;
for (int i = 0; i < len; i++) {
int sum1 = inf;
int num1 = str1[i] - 'a';
int num2 = str2[i] - 'a';
for (int j = 0; j < 26; j++) {
if (con[num1][j] + con[num2][j] < sum1) {
sum1 = con[num1][j] + con[num2][j];
strans[i] = 'a' + j;
}
}
if (sum1 >= inf) {
ff = 0;
break;
}
ans += sum1;
}
strans[len] = '\n';
if (ff == 0)
printf("-1\n");
else {
printf("%d\n", ans);
printf("%s\n", strans);
}
return 0;
}
| 8 | CPP |
a,b,m=0,0,10**9+7
for i in input()[::-1]:
if i=='b':
b+=1
else:
a+=b
b=(b<<1)%m
print(a%m) | 10 | PYTHON3 |
for i in range(1,10001):
x=int(input())
if x==0:
break
print(f'Case {i}: {x}')
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char t[100][10010];
int ret[10000];
int findLeft(char *row, int pos) {
for (int i = pos; i >= 0; --i)
if (row[i] == '1') return i;
for (int i = m - 1; i > pos; --i)
if (row[i] == '1') return i;
return -1;
}
int findRight(char *row, int pos) {
for (int i = pos + 1; i < m; ++i)
if (row[i] == '1') return i;
for (int i = 0; i <= pos; ++i)
if (row[i] == '1') return i;
return -1;
}
void solveRow(int row, char *t) {
int left = findLeft(t, 0);
int right = findRight(t, 0);
if (left == -1) {
printf("-1");
exit(0);
}
for (int i = 0; i < m; ++i) {
if (right == i) {
left = right;
right = findRight(t, i);
}
int rightRet = (right - i + m) % m;
int leftRet = (i - left + m) % m;
ret[i] += rightRet < leftRet ? rightRet : leftRet;
}
}
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", t[i]);
}
for (int i = 0; i < n; ++i) solveRow(i, t[i]);
int rett = n * m;
for (int j = 0; j < m; ++j) {
rett = rett > ret[j] ? ret[j] : rett;
}
printf("%d\n", rett);
return 0;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while (t--)
{
int n,k,i,cunt=0;
cin>>n>>k;
if (n%2==1)
{
if (n/2<k)
{
cout<<"-1"<<endl;
continue;
}
}
else
{
if ((n/2)-1<k)
{
cout<<"-1"<<endl;
continue;
}
}
int a[n];
for (i=0;i<n;i++)
{
a[i]=i+1;
}
i=1;
while (cunt!=k)
{
int temp;
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
cunt++;
i+=2;
}
for (i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
}
}
| 7 | CPP |
from collections import defaultdict
n = int(input())
a = list(input())
x = defaultdict(lambda: "")
x["RR"] = "B"
x["GG"] = "R"
x["BB"] = "G"
x["BR"] = "G"
x["RB"] = "G"
x["GR"] = "B"
x["RG"] = "B"
x["BG"] = "R"
x["GB"] = "R"
x["G"] = "R"
x["B"] = "R"
x["R"] = "B"
ans = 0
for i in range(n-2):
if(a[i] == a[i+1]):
ans += 1
a[i+1] = x[a[i]+a[i+2]]
if(n > 1 and a[n-2] == a[n-1]):
ans += 1
a[n-1] = x[a[n-2]]
print(ans)
print(*a, sep="")
| 10 | PYTHON3 |
H,W,K=list(map(int,input().split()))
board = [list(input()) for i in range(H)]
ans = 0
for paint_h in range(2**H):
for paint_w in range(2**W):
cnt = 0
for i in range(H):
for j in range(W):
if (paint_h>>i)&1==0 and (paint_w>>j)&1==0:
if board[i][j]=='#':
cnt+=1
if cnt==K:
ans+=1
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream &operator<<(ostream &os, const pair<T, T> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, const pair<const T, T> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, const array<T, 3> &p) {
return os << "(" << p[0] << "," << p[1] << "," << p[2] << ")";
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &p) {
for (auto x : p) os << x << ' ';
return os;
}
const double EPS = 1e-9, PI = acos(-1);
const long long LINF = 0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7;
const long long INF = 0x3f3f3f3f, SZ = 2e5 + 20;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long q;
cin >> q;
while (q--) {
long long x, y, k;
cin >> x >> y >> k;
long long mini = min(x, y);
long long extra = abs(x - y);
if (max(x, y) > k) {
cout << -1 << '\n';
continue;
}
if (x == y) {
k -= x - mini;
k -= y - mini;
if ((mini & 1) == (k & 1))
cout << k << '\n';
else
cout << k - 2 << '\n';
} else {
if (((k - extra) & 1) == (mini & 1)) {
cout << k - extra + (extra & 1 ? extra - 1 : extra) << '\n';
} else {
if (extra & 1)
cout << k - 1 << '\n';
else
cout << k - 2 << '\n';
}
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 1000;
const long long INF64 = 1e18 + 1000;
const int N = 6 * 100 * 1000 + 100;
const int MOD = 1e9 + 7;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < int(n); ++i) {
cin >> a[i];
}
bool f = false;
for (int i = int(1); i < int(n); ++i) {
if (abs(a[i] - a[i - 1]) != 1 && abs(a[i] - a[i - 1]) != n - 1) {
f = true;
cout << "NO\n";
break;
}
}
if (f) continue;
cout << "YES\n";
}
}
| 7 | CPP |
for _ in range(int(input())):
count, hope = int(input()), input()
win = hope.count('2')
draw = count - win
if 0 < win < 3: print('NO')
else:
print('YES')
list_match = [[0 for j in range(count)] for i in range(count)]
for i in range(count):
for j in range(count):
if i == j:
list_match[i][j] = 'X'
elif hope[i] == '1' or hope[j] == '1':
list_match[i][j] = '='
list_match[j][i] = '='
else:
if '+' not in list_match[i] and list_match[i][j] == 0:
list_match[i][j] = '+'
list_match[j][i] = '-'
elif '+' not in list_match[j] and list_match[j][i] == 0:
list_match[i][j] = '-'
list_match[j][i] = '+'
elif list_match[i][j] == 0:
list_match[i][j] = '+'
list_match[j][i] = '-'
print(''.join(list_match[i]))
| 8 | PYTHON3 |
n = int(input())
x = 8 + n % 2
y = n - x
print(x, y)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 4e3 + 0.000001;
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(0);
string XML;
cin >> XML;
long long cnt = 0;
for (long long i = 0; i < XML.size(); i++) {
long long p = i + 1;
if (XML[p] == '/') {
cnt -= 2;
long long ans = cnt;
while (ans--) cout << " ";
cout << XML[p - 1] << XML[p] << XML[p + 1] << XML[p + 2];
cout << endl;
i = p + 2;
} else {
long long ans = cnt;
while (ans--) cout << " ";
cout << "<" << XML[p] << ">";
cout << endl;
cnt += 2;
i = p + 1;
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
if (n <= 3) {
printf("NO\n");
} else {
printf("YES\n");
if (n >= 24) {
if (!(n & 1)) {
int ones = 0;
for (int i = 25; i < n; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
++ones;
}
for (int i = 2; i < 24; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
++ones;
}
printf("%d * %d = %d\n", 1, 24, 24);
for (int i = 1; i < ones; ++i) {
printf("%d * %d = %d\n", 1, 1, 1);
}
printf("%d * %d = %d\n", 1, 24, 24);
} else {
int ones = 0;
for (int i = 1; i < 10; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
++ones;
}
printf("%d - %d = %d\n", 13, 11, 2);
printf("%d * %d = %d\n", 2, 12, 24);
for (int i = 14; i < n; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
++ones;
}
for (int i = 1; i <= ones; ++i) {
printf("%d * %d = %d\n", 1, 24, 24);
}
}
} else {
if (n == 4) {
printf("1 * 2 = 2\n2 * 3 = 6\n6 * 4 = 24\n");
}
if (n == 5) {
printf("5 + 1 = 6\n3 - 2 = 1\n1 * 6 = 6\n6 * 4 = 24\n");
}
if (n >= 6) {
if (!(n & 1)) {
printf("1 * 2 = 2\n2 * 3 = 6\n6 * 4 = 24\n");
for (int i = 5; i < n; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
printf("24 * 1 = 24\n");
}
} else {
printf("5 + 1 = 6\n3 - 2 = 1\n1 * 6 = 6\n6 * 4 = 24\n");
for (int i = 6; i < n; i += 2) {
printf("%d - %d = %d\n", i + 1, i, 1);
printf("24 * 1 = 24\n");
}
}
}
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
void stndrtn() {}
const bool flag = 0;
struct Segment {
int l, r, id;
};
void ma1n() {
int n;
cin >> n;
vector<Segment> a(n);
for (int i = 0; i < n; ++i) {
Segment& first = a[i];
cin >> first.l >> first.r, first.id = i;
}
sort(a.begin(), a.end(), [&](Segment& first, Segment& second) {
if (first.r == second.r) {
return first.l < second.l;
}
return first.r < second.r;
});
set<int> s;
vector<int> ans(n);
for (Segment& first : a) {
int l = first.l;
while (s.count(l)) {
l++;
}
s.insert(l);
ans[first.id] = l;
}
for (int first : ans) {
cout << first << " ";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr), stndrtn();
int ts = 1;
if (flag) {
cin >> ts;
}
while (ts--) {
ma1n();
}
return 0;
}
| 10 | CPP |
str=input("")
def solve(str):
str='a'+str
t=0
for i in range(1,len(str)):
p=str[i-1]
c=str[i]
f=abs(ord(p)-ord(c))
b=26-f
t=t+min(f,b)
return t
print(solve(str))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], ma = 0, ans = 0, count = 0, mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (ma < a[i]) ma = a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] == ma) {
count++;
mx = max(mx, count);
} else {
count = 0;
}
}
cout << mx;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long l[100500];
char c[100500];
long long mn[100500];
long long ff[100500];
int32_t main() {
std::iostream::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> l[i];
for (int i = 0; i < n; i++) cin >> c[i];
long long total_grass = 0;
long long total_water = 0;
bool waswater = false;
long long fl = 0;
long long ans = 0;
long long last_zero = -1;
for (int i = 0; i < n; i++) {
if (c[i] == 'W') waswater = true;
if (c[i] != 'L') {
fl += l[i];
ans += (c[i] == 'W' ? 3 : 5) * l[i];
} else {
if (fl >= l[i]) {
fl -= l[i];
if (fl == 0) {
last_zero = i;
}
ans += l[i];
} else {
ans += (waswater ? 3 : 5) * (l[i] - fl);
ans += l[i];
fl = 0;
last_zero = i;
}
}
ff[i] = mn[i] = fl;
}
for (int i = n - 2; i >= last_zero + 1; i--) mn[i] = min(mn[i + 1], mn[i]);
long long imp = 0;
for (int i = last_zero + 1; i < n; i++) {
if (c[i] != 'G') continue;
long long can = min(2 * l[i], mn[i] - imp);
can = min(can, ff[i] - imp);
if (can >= 0) {
imp += can;
ans -= 2 * can;
}
}
fl -= imp;
if (fl > 0) {
ans -= fl;
}
cout << ans;
return 0;
}
| 12 | CPP |
s = input()
for q in range(int(input())):
l, r, k = map(int, input().split())
l -= 1
k %= r - l
s = s[: l] + s[r - k: r] + s[l: r - k] + s[r:]
print(s)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int t, a, b, c, d;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d %d %d\n", b, c, c);
}
}
| 7 | CPP |
#include<stdio.h>
#include<math.h>
int main()
{
int n,a[]={0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
scanf("%d",&n);
printf("%d",a[n]);
return 0;
} | 0 | CPP |
n ,t = map(int,input().split())
l = map(int,input().split())
x = 0
for i in l :
if i == 86400:
x += 1
elif i <86400 and (86400-i)>0:
t = t - (86400-i)
x+=1
if t <=0:
break
print(x)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i,n) for(UL i=0; i<(n); i++)
int N;
vector<int> S[400001];
vector<int> T[400001];
vector<pair<int,int>> PU,PR,PD,PL;
int ans;
int intinf=1000000000;
void F(){
rep(x,400001){
if(S[x].empty() || T[x].empty()) continue;
sort(S[x].begin(),S[x].end()); sort(T[x].begin(),T[x].end());
T[x].push_back(intinf/5);
int q=0;
rep(p,S[x].size()){
while(T[x][q]<S[x][p]) q++;
ans=min(ans,(T[x][q]-S[x][p])*10);
}
}
rep(x,400001){ S[x].clear(); T[x].clear(); }
}
int main() {
ans=intinf;
scanf("%d",&N);
rep(i,N){
int x,y; char c;
scanf("%d%d %c",&x,&y,&c);
if(c=='U') PU.push_back({x,y});
if(c=='R') PR.push_back({x,y});
if(c=='D') PD.push_back({x,y});
if(c=='L') PL.push_back({x,y});
}
for(auto& p:PU) S[p.first].push_back(p.second);
for(auto& p:PD) T[p.first].push_back(p.second);
F();
for(auto& p:PR) S[p.second].push_back(p.first);
for(auto& p:PL) T[p.second].push_back(p.first);
F();
ans/=2; intinf/=2;
for(auto& p:PU) S[p.first+p.second].push_back(p.second);
for(auto& p:PR) T[p.first+p.second].push_back(p.second);
F();
for(auto& p:PU) S[p.first-p.second+200000].push_back(p.second);
for(auto& p:PL) T[p.first-p.second+200000].push_back(p.second);
F();
for(auto& p:PL) S[p.first+p.second].push_back(p.second);
for(auto& p:PD) T[p.first+p.second].push_back(p.second);
F();
for(auto& p:PR) S[p.first-p.second+200000].push_back(p.second);
for(auto& p:PD) T[p.first-p.second+200000].push_back(p.second);
F();
if(ans==intinf) cout<<"SAFE"<<endl;
else cout<<ans<<endl;
return 0;
}
| 0 | CPP |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)
ll f(int n)
{
if(n<0 || 2000<n) return 0;
return min(n+1, 2001-n);
}
int main()
{
int n;
while(cin >> n){
ll ans = 0;
rep(i, n+1){
ans += f(i) * f(n-i);
}
cout << ans << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t)) aux1 += m * x;
long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1;
aux2 *= cost;
ans += min(aux1, aux2);
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
def solve(arr,n):
if(arr[-1]>=arr[0]+arr[1]):
print(1,2,n)
return
print(-1)
t = int(input())
for _ in range(t):
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | 7 | PYTHON3 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
const int INF = 1e+8;
int n;
string add[10][10];
bool memo[10];
vector<string> ans;
int ans_len;
bool is_substring(const string &s, const string &t){
if( s.size() > t.size() ) return false;
for(int k = 0; k < t.size(); k++){
int cnt = 0;
for(int i = 0; i < s.size(); i++){
if( t.size() <= i + k ) break;
if( s[i] == t[i+k] ){
cnt++;
}else{
break;
}
}
if( cnt == s.size() ) return true;
}
return false;
}
string add_string(const string &s, const string &t){
for(int k = 0; k < s.size(); k++){
bool flag = true;
for(int i = k; i < s.size(); i++){
if( s[i] != t[i-k] ){
flag = false;
break;
}
}
if( flag ){
string res;
for(int i = s.size() - k; i < t.size(); i++){
res.push_back(t[i]);
}
return res;
}
}
return t;
}
void dfs(int k, string s, int prev){
if( k == n - 1 ){
//cout << s << endl;
if( s.size() < ans_len ){
ans.clear();
ans.push_back(s);
ans_len = s.size();
}else if( s.size() == ans_len ){
ans.push_back(s);
}
}else{
//cout << k << " " << s << endl;
if( s.size() > ans_len ) return ;
for(int i = 0; i < n; i++){
if( memo[i] ) continue;
memo[i] = true;
dfs(k + 1, s + add[prev][i], i);
memo[i] = false;
}
}
}
int main(){
while( cin >> n , n ){
// 初期化
ans.clear();
ans_len = INF;
for(int i = 0; i < n; i++){
memo[i] = false;
for(int j = 0; j < n; j++){
add[i][j] = "";
}
}
// 入力
vector<string> s(n);
for(int i = 0; i < n; i++) cin >> s[i];
// s[i]がs[j]の部分文字列になっていたらs[i]を取り除く
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if( i == j ) continue;
if( is_substring(s[i], s[j]) ){
s[i] = "";
}
}
}
vector<string> s_;
for(int i = 0; i < n; i++){
if( s[i] != "" ) s_.push_back(s[i]);
}
s = s_;
n = s.size();
// s[i]にどの文字列を連結したら s[i] と s[j] のSSSになるか求める
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if( i == j ) continue;
add[i][j] = add_string(s[i], s[j]);
}
}
// 全探索 O(n!)
for(int i = 0; i < n; i++){
memo[i] = true;
dfs(0, s[i], i);
memo[i] = false;
}
sort(ans.begin(), ans.end());
cout << ans[0] << endl;
}
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n; int m; int t; int p;
cin >> n >> m >> t >> p;
if(n==0&&m==0&&t==0&&p==0)break;
int dc[t][2];
int xy[p][2];
for(int i=0;i<t;i++){
cin>>dc[i][0]>>dc[i][1];
}
for(int i=0;i<p;i++){
cin>>xy[i][0]>>xy[i][1];
}
int kasanari[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
kasanari[i][j] = 1;
}
}
for(int i=0;i<t;i++){
int nw[n][m];
if(dc[i][0]==1){
for(int j=0;j<n;j++){
for(int k=0;k<m;k++){
if(dc[i][1]-j-1<0){
if(dc[i][1]+j>n-1){
nw[j][k] = 0;
}else{
nw[j][k] = kasanari[dc[i][1]+j][k];
}
}
else{
if(dc[i][1]+j>n-1){
nw[j][k] = kasanari[dc[i][1]-j-1][k];
}
else{nw[j][k] = kasanari[dc[i][1]-j-1][k] + kasanari[dc[i][1]+j][k];
}
}
}
}
}else{
for(int j=0;j<n;j++){
for(int k=0;k<m;k++){
if(dc[i][1]-k-1<0){
if(dc[i][1]+k>m-1){
nw[j][k] = 0;
}else{
nw[j][k] = kasanari[j][dc[i][1]+k];
}
}
else{
if(dc[i][1]+k>m-1){
nw[j][k] = kasanari[j][dc[i][1]-k-1];
}else{
nw[j][k] = kasanari[j][dc[i][1]-k-1] + kasanari[j][dc[i][1]+k];
}
}
}
}
}
for(int j=0;j<n;j++){
for(int k=0;k<m;k++){
kasanari[j][k] = nw[j][k];
}
}
}
for(int i=0;i<p;i++){
cout << kasanari[xy[i][0]][xy[i][1]] << endl;
}
}
}
| 0 | CPP |
'''
Online Python Interpreter.
Code, Compile, Run and Debug python program online.
Write your code in this editor and press "Run" button to execute it.
'''
'''
t = int(input())
while(t):
n = int(input())
s = n*(n+1) // 2
k = len(format(n, "b"))
s_pair = 2**k - 1
print(s - 2*s_pair)
t-=1
'''
'''
n = int(input())
string = str(n)
l = len(string)
new = ""
for i in range(l):
if i == 0 and string[0] == '9':
new = new + '9'
else:
if int(string[i]) > 4 :
new = new + str(9 - int(string[i]))
else:
new = new + string[i]
print(new)
'''
#print( n // 100 + (n % 100) // 20 + (n % 20) // 10 + (n % 10) //5 + (n % 5))
#print( format(n, "b") )
n = int(input())
string = str(n)
def is_lucky(n):
num = str(n)
t = len(num)
k = 0
for i in range(t):
if num[i] != '4' and num[i] != '7':
k+=1
if k == 0:
return True
else:
return False
ans = 'NO'
for i in range(4,n+1):
if is_lucky(i) :
if n % i == 0 :
ans = 'YES'
break
print(ans)
| 7 | PYTHON3 |
n = eval(input())
mkd = []
arr = input()
loc = 0
ans = 0
for x in arr:
if x =='x':
loc = loc + 1
if loc> 2:
ans = ans + 1
else:
loc = 0
print(ans)
| 8 | PYTHON3 |
input();s=[*map(int,input().split())];d=tuple(s);s.sort();print(*[d.index(i)+1for i in s]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100007, maxm = 200007, inf = 0x3f3f3f3f;
int n, m, s;
int cnt = 0;
int head[maxn], dis[maxn], num[maxn];
bool vis[maxn];
map<int, bool> h[maxn];
struct edge {
int next, to, val;
} e[maxm];
void addEdge(int from, int to, int val) {
e[++cnt].next = head[from];
e[cnt].val = val;
e[cnt].to = to;
head[from] = cnt;
}
inline int read() {
int s = 0, w = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
s = (s << 1) + (s << 3) + ch - '0', ch = getchar();
return s * w;
}
void write(int x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
return;
}
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
pq;
int main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) dis[i] = inf;
dis[1] = 0;
for (int i = 1; i <= m; i++) {
int x = read(), y = read(), val = read();
addEdge(x, y, val);
addEdge(y, x, val);
}
for (int i = 1; i <= n; i++) {
int k = read();
for (int j = 1; j <= k; j++) {
int r = read();
h[i][r] = true;
}
}
while (!pq.empty()) pq.pop();
pq.push(make_pair(0, 1));
while (!pq.empty()) {
pair<int, int> top = pq.top();
pq.pop();
int u = top.second, d = top.first;
if (vis[u] || dis[u] != d) continue;
vis[u] = true;
while (h[u][d] && u != n) d++;
dis[u] = d;
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to;
int rtd = e[i].val + dis[u];
if (rtd < dis[v]) dis[v] = rtd, pq.push(make_pair(rtd, v));
}
}
if (dis[n] == inf) dis[n] = -1;
printf("%d\n", dis[n]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,ans,u[20];
int c[20],p[20];
void dfs(int x) {
if (x>n) {
ll s=0; int a=0;
for (int i=1;i<=n;i++)
if (u[i]) s+=p[i]+c[i]*i*100,a+=c[i];
for (int i=n;i>=1;i--)
if (!u[i]&&s<m) {
if (s+(c[i]-1)*i*100<=m) s+=(c[i]-1)*i*100,a+=c[i]-1;
else {
int tmp=(m-s)/(i*100);
a+=tmp; s+=tmp*i*100;
}
}
if (s>=m) ans=min(ans,a);
return;
}
u[x]=1; dfs(x+1); u[x]=0; dfs(x+1);
}
int main() {
cin >> n >> m;
for (int i=1;i<=n;i++) cin >> c[i] >> p[i];
ans=1e9; dfs(1);
cout << ans << endl;
return 0;
} | 0 | CPP |
import sys
queries = int(sys.stdin.readline())
all_chars = [chr(code) for code in range(ord('a'),ord('z')+1)]
def findIdealKeyboard(text):
keyboard = ''
letters = 0
keyboard_pos = 0
text_pos = 0
while text_pos<len(text):
symbol = text[text_pos]
if not symbol in keyboard:
if keyboard_pos == 0:
keyboard = text[text_pos] + keyboard
elif keyboard_pos == len(keyboard)-1:
keyboard += text[text_pos]
keyboard_pos += 1
else:
return False
elif keyboard_pos > 0 and symbol == keyboard[keyboard_pos-1]:
keyboard_pos -= 1
elif keyboard_pos < len(keyboard)-1 and symbol == keyboard[keyboard_pos+1]:
keyboard_pos += 1
else:
return False
text_pos += 1
global all_chars
for char in all_chars:
if not char in keyboard:
keyboard += char
return keyboard
for query in range(queries):
text = sys.stdin.readline().strip()
keyboard = findIdealKeyboard(text)
if keyboard:
print('YES')
print(keyboard)
else:
print('NO') | 9 | PYTHON3 |
l = list(map(int, input().split()))
d = {}
for i in l:
d[i] = d.get(i, 0) + 1
if len(d) >= 4:
print('Alien')
elif len(d) == 3:
if [1,1,4] == sorted(d.values()):
print('Bear')
else:
print('Alien')
elif len(d) == 2:
if [2,4] == sorted(d.values()):
print('Elephant')
elif [1,5] == sorted(d.values()):
print('Bear')
else:
print('Alien')
else:
print('Elephant')
| 7 | PYTHON3 |
def inverso(t):
inverso_t = ''
quant_t = len(t)
for letra in range (quant_t-1, -1, -1):
inverso_t += t[letra]
if inverso_t == s:
return 'YES'
else:
return 'NO'
s = str(input(''))
t = str(input(''))
print(inverso(t))
| 7 | PYTHON3 |
#!/usr/bin/env python3
#Educational Codeforces Round 72 B
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
t = I()
for _ in range(t):
n,curx = LI()
lst = [LI() for _ in range(n)]
maxd = 0
for x,y in lst:
maxd = max(maxd,x)
lst = sorted(lst,key = lambda x:(x[0] - x[1]),reverse = True)
d,h = lst[0]
if curx - maxd <= 0:
print(1)
continue
if d - h <= 0:
print(-1)
continue
curx -= maxd
ans = math.ceil(curx/(d-h))+1
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s1 = "I hate that ";
string s2 = "I love that ";
string s3;
for (int i = 1; i < n + 1; i++) {
if (i % 2 != 0)
s3.append(s1);
else
s3.append(s2);
}
s3.erase(s3.length() - 5);
s3.append("it");
printf("%s\n", s3.c_str());
}
| 7 | CPP |
t=int(input())
for i in range(t):
n,p,k=map(int,input().split())
arr=list(map(int,input().split()))
arr=sorted(arr)
sume=[0 for i in range(n)]
x=0
for j in range(n):
sume[j]=arr[j]+sume[(j-1 if j<k-1 else j-k)]
for j in range(n):
if(sume[j]<=p):
x=j+1
print(x) | 8 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
rr = []
def f(s):
t = [int(c) for c in S()]
a = [t[ord(c) - ord('a')] if c in 'abcd' else c for c in s]
def ff(a):
if len(a) == 1:
return a[0]
l = len(a)
for i in range(l-4):
if a[i] == '[' and a[i+4] == ']':
op = a[i+1]
b = a[i+2]
c = a[i+3]
t = -1
if op == '+':
t = b | c
elif op == '*':
t = b & c
elif op == '^':
t = b ^ c
return ff(a[:i] + [t] + a[i+5:])
return -1
r = ff(a)
c = 0
for k in range(10000):
tt = [k//(10**i)%10 for i in range(4)]
aa = [tt[ord(c) - ord('a')] if c in 'abcd' else c for c in s]
kk = ff(aa)
if kk == r:
c += 1
return '{} {}'.format(r,c)
while 1:
n = S()
if n == '.':
break
rr.append(f(n))
return '\n'.join(map(str, rr))
print(main())
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) { \
cerr << ((hoge) ? "," : "") << x[hoge]; \
} \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[3 * N];
for (int i = 0; i < 3 * N; i++) cin >> A[i], A[i]--;
const int INF = INT_MAX / 10;
int dp[N][N];
int dp_max[N];
int dp_maxx = 0;
for (int i = 0; i < N; i++) fill(dp[i], dp[i] + N, -INF);
fill(dp_max, dp_max + N, -INF);
dp[A[0]][A[1]] = 0;
dp[A[1]][A[0]] = 0;
dp_max[A[0]] = 0;
dp_max[A[1]] = 0;
int ans = 0;
for (int i = 1; i < N; i++) {
int a = A[3 * i - 1], b = A[3 * i], c = A[3 * i + 1];
if (a == b && b == c) {
ans++;
continue;
}
vector<tuple<int, int, int>> upd;
for (int _ = 0; _ < 3; _++) {
int tmp = a;
a = b;
b = c;
c = tmp;
if (a == b) {
for (int k = 0; k < N; k++) {
upd.emplace_back(c, k, dp[a][k] + 1);
}
}
}
for (int _ = 0; _ < 3; _++) {
int tmp = a;
a = b;
b = c;
c = tmp;
for (int k = 0; k < N; k++) {
upd.emplace_back(a, k, dp_max[k]);
}
}
for (int _ = 0; _ < 3; _++) {
int tmp = a;
a = b;
b = c;
c = tmp;
upd.emplace_back(b, c, dp_maxx);
}
for (int _ = 0; _ < 3; _++) {
int tmp = a;
a = b;
b = c;
c = tmp;
upd.emplace_back(b, c, dp[a][a] + 1);
}
for (auto tmp : upd) {
int x, y, val;
tie(x, y, val) = tmp;
dp[x][y] = dp[y][x] = max(dp[x][y], val);
dp_max[x] = max(dp_max[x], dp[x][y]);
dp_max[y] = max(dp_max[y], dp[x][y]);
dp_maxx = max(dp_maxx, dp[x][y]);
}
}
int mx = 0;
for (int k = 0; k < N; k++) {
for (int l = 0; l < N; l++) {
int tmp = dp[k][l];
if (k == l && l == A[3 * N - 1]) tmp++;
mx = max(mx, tmp);
}
}
ans += mx;
cout << ans << endl;
return 0;
}
| 0 | CPP |
n = int(input())
P = [0] * n
for i in range(n):
a = input()
if len(a) == 1 and n == 1:
P[i] = 'YES'
break
elif len(a) == 1:
P[i] = 'YES'
continue
b = sorted(a)
for j in range(len(b) - 1):
if ord(b[j]) + 1 == ord(b[j + 1]):
P[i] = 'YES'
else:
P[i] = 'NO'
break
for i in range(n):
print(P[i])
| 7 | PYTHON3 |
n,y=map(int,input().split());r=range
for i in r(n+1):
for j in r(n-i+1):
if i*9+j*4+n==y/1000:print(i,j,n-i-j);exit()
print(-1,-1,-1) | 0 | PYTHON3 |
import bisect
n=int(input())
opens=0
closes=0
ls=[]
rs=[]
for _ in range(n):
s=input()
cnt1=0
cnt2=0
for i in range(len(s)):
if s[i]=='(':
cnt1+=1
else:
if cnt1==0:
cnt2+=1
else:
cnt1-=1
if cnt2==0:
opens+=cnt1
elif cnt1==0:
closes+=cnt2
else:
ls.append(cnt2)
rs.append(cnt1)
ls=sorted(ls)
rs=sorted(rs)
lefts=sum(ls)
rights=sum(rs)
if opens-closes!=lefts-rights:
print('No')
else:
flag=False
if len(ls)==0:
flag=True
for a in ls:
if opens<a or closes<a+(rights-lefts):
continue
pos=bisect.bisect_right(rs,a+(rights-lefts))
if pos!=0:
flag=True
break
for d in rs:
if opens<d+(lefts-rights) or closes<d:
continue
pos=bisect.bisect_right(ls,d+(lefts-rights))
if pos!=0:
flag=True
break
if flag==True:
print('Yes')
else:
print('No') | 0 | PYTHON3 |
t=int(input())
c=[]
for i in range(t):
n,x=input().split()
n,x=int(n),int(x)
a=[int(i) for i in input().split()]
odd=0
even=0
for d in a:
if d%2==0:
even+=1
else:
odd+=1
if even==0:
if x%2!=0 and odd>=x:
c.append("Yes")
else:
c.append("No")
elif odd==0:
c.append("No")
elif odd%2==0:
if odd-1+even>=x:
c.append("Yes")
else:
c.append("No")
else:
if odd+even>=x:
c.append("Yes")
else:
c.append("No")
for k in c:
print(k) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void pp(T v) {
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
cout << *it << ' ';
cout << endl;
}
template <class T>
void pp(T v, int n) {
for (int i = 0; i < (int)n; i++) cout << v[i] << ' ';
cout << endl;
}
const int INF = 1 << 28;
const double EPS = 1.0e-9;
static const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int g(const char c) {
if (isdigit(c)) return c - '0';
if (isupper(c)) return c - 'A' + 10;
if (islower(c)) return c - 'a' + 10;
return -1;
}
int f(const string s, const int b) {
int base = 1, num = 0;
for (int i = s.size() - 1; i >= 0; i--) {
int v = g(s[i]);
if (v >= b) return -1;
num += base * v;
base *= b;
if (num > 100) return -2;
}
return num;
}
int main(void) {
string line;
cin >> line;
replace((line).begin(), (line).end(), ':', ' ');
stringstream ss(line);
string a, b;
ss >> a >> b;
vector<int> ans;
for (int n = 2; n <= 102; n++) {
int av = f(a, n);
int bv = f(b, n);
if (av >= 0 && av <= 23) {
if (bv >= 0 && bv <= 59) {
if (n >= 100) {
cout << -1 << endl;
return 0;
}
ans.push_back(n);
}
}
}
if (ans.empty()) {
cout << 0 << endl;
} else {
pp(ans);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[55], p, sum;
double dp[55][55], c[55];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i), sum += a[i];
scanf("%d", &p);
c[0] = 1.0;
for (int i = 1; i <= n; i++) c[i] = c[i - 1] * i;
double ans = 0;
if (sum <= p)
ans = n;
else {
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = n; j > 0; j--)
for (int k = p; k >= a[i]; k--) dp[j][k] += dp[j - 1][k - a[i]];
}
for (int j = 1; j <= n; j++)
for (int k = 1; k <= p; k++) ans += dp[j][k] * c[j] * c[n - j];
ans /= c[n];
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
n=int(input())
l=[]
while n:
a,b=map(int,input().split())
l.append(a+b)
n-=1
print(max(l)) | 8 | PYTHON3 |
t = int(input())
l = list(map(int,input().split()))
l.sort()
l1=[]
l2=[]
for i in l:
if i%2==0:
l1.append(i)
else:
l2.append(i)
x = abs(len(l1)-len(l2))-1
if x==0:
print(x)
elif x >0 and len(l1)>len(l2):
print(sum(l1[:x]))
elif x >0 and len(l1)<len(l2):
print(sum(l2[:x]))
elif x <0 and len(l1)==len(l2):
print(0) | 8 | PYTHON3 |
#Took me long enuf, even tho I was going right past the right solution
query=int(input())
for _ in range(query):
x, a, b=map(int,input().split())
if x<=b*10:
print("YES") #If xis less then 'Lightning Strike', no need to use 'Void Absorption'
else:
for i in range(a):
m=x #'m' is used to store previous value of the boss's health
x=(x//2)+10 #"Void Absorption" is used to decrease boss health as much as possible until not possible, thath is previous health is same as new health, so the loop breaks
if x==m:
break
#Since "Lightning Strike" is still unused, finishing move is used with lighting
if x<=b*10:
print("YES") #If boss can be killed
else:
print("NO")
| 8 | PYTHON3 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,Q;
string S;
cin >> N >> S >> Q;
vector<int> k(Q);
for(int i=0;i<Q;i++){
cin >> k[i];
}
for(int j=0;j<Q;j++){
long long D=0,M=0,DM=0,DMC=0;
for(int i=0;i<N;i++){
if(S[i]=='D'){
D++;
}
if(S[i]=='M'){
DM+=D;
M++;
}
if(S[i]=='C'){
DMC+=DM;
}
if(i-k[j]+1>=0){
if(S[i-k[j]+1]=='D'){
D--;
DM-=M;
}if(S[i-k[j]+1]=='M'){
M--;
}
}
}
cout << DMC << endl;
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 100;
long long n, b[maxn], ans, s[2], sum;
int main() {
scanf("%lld", &n);
s[0] = 1;
for (long long i = 1; i <= n; ++i) {
long long x;
scanf("%lld", &x);
b[i] = __builtin_popcountll(x);
sum += b[i];
ans += s[sum % 2];
++s[sum % 2];
}
for (long long i = 1; i <= n; ++i) {
long long mx = 0;
sum = 0;
for (long long j = i; j <= min(n, i + 63 - 1); ++j) {
mx = max(mx, b[j]);
sum += b[j];
if (sum % 2 == 0 && mx > sum - mx) --ans;
}
}
printf("%lld\n", ans);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[210];
bool dfs(int sum, int k) {
if (sum == 1) return true;
if (k + 1 <= n && a[k + 1] == sum - 1) {
sum--;
dfs(sum, k + 1);
} else if (k - 1 >= 1 && a[k - 1] == sum - 1) {
sum--;
dfs(sum, k - 1);
} else if (k == n && a[1] == sum - 1) {
sum--;
dfs(sum, 1);
} else if (k == 1 && a[n] == sum - 1) {
sum--;
dfs(sum, n);
} else
return false;
}
int main() {
int q;
cin >> q;
while (q--) {
cin >> n;
int k = 0, k1 = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == n) k = i;
if (a[i] == 1) k1 = i;
}
if (k == 0 || k1 == 0) {
puts("NO");
continue;
}
if (dfs(n, k))
puts("YES");
else if (dfs(n, k1))
puts("YES");
else
puts("NO");
}
return 0;
}
| 7 | CPP |
from collections import Counter
n = int(input())
a = map(int, input().split())
c = Counter()
ans = 0
for x in a:
for i in range(1, 33):
ans += c[2 ** i - x]
c[x] += 1
print(ans)
| 8 | PYTHON3 |
_input_=input()
_input__=_input_.strip().split()
number_of_cards=int(_input__[0])
limit=int(_input__[1])
input_=input()
cards_found=input_.strip().split()
sum_=0
ans=0
for i in range (0,len(cards_found)):
sum_=sum_+int(cards_found[i])
if(sum_<0):
positive_sum=-sum_
else:
positive_sum=sum_
if(positive_sum==0):
ans=0
else:
if(positive_sum%limit==0):
ans=int(positive_sum/limit)
else:
ans=int(positive_sum/limit)+1
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::vector;
int main() {
int n;
cin >> n;
const long long mod = (long long)1e9 + 7LL;
const int maxn = 500;
int p[maxn];
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
long long rooted[maxn][maxn];
long long non_rooted[maxn][maxn];
for (int i = 0; i < n; ++i) {
rooted[i][i] = non_rooted[i][i] = 1;
}
for (int i = 0; i + 1 < n; ++i) {
rooted[i][i + 1] = 1;
non_rooted[i][i + 1] = (p[i] < p[i + 1] ? 2 : 1);
}
for (int sz = 3; sz <= n; ++sz) {
for (int left = 0; left + sz <= n; ++left) {
int right = left + sz - 1;
rooted[left][right] = rooted[left + 1][right];
for (int mid = left + 2; mid <= right; ++mid) {
if (p[left + 1] > p[mid]) {
continue;
}
rooted[left][right] +=
(rooted[left + 1][mid - 1] * non_rooted[mid][right]) % mod;
rooted[left][right] %= mod;
}
non_rooted[left][right] = rooted[left][right];
for (int mid = left + 1; mid <= right; ++mid) {
if (p[left] > p[mid]) {
continue;
}
non_rooted[left][right] +=
(rooted[left][mid - 1] * non_rooted[mid][right]) % mod;
non_rooted[left][right] %= mod;
}
}
}
cout << rooted[0][n - 1];
return 0;
}
| 12 | CPP |
l = list(map(int, input().split()))
l1 = list(map(int, input().split()))
n, h = l[0], l[1]
result = 0
for i in l1:
if i > h: result += 2
else: result += 1
print(result) | 7 | PYTHON3 |
while 1:
a, b = map(int, input().split())
if a == 0 and b == 0:
break
x = max(a, b)
y = min(a, b)
cnt = 0
while 1:
cnt += 1
tmp = x % y
x, y = y, tmp
if tmp == 0:
break
print(x, cnt)
| 0 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Jul 17 20:23:23 2020
@author: Host
"""
import random
for _ in range(int(input())):
x,y,z=map(int, input().split())
if max(x,y)==max(y,z)==max(z,x):
a=max(x,y)
b=sorted(list(set([x,y,z])))[0]
c=random.randint(1, min(x,y,z))
print("Yes")
print(a,b,c)
else:
print("No")
| 7 | PYTHON3 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
int ask(int l, int r) {
cout << "? " << l + 1 << ' ' << r + 1 << endl;
int res;
cin >> res;
return res - 1;
}
void solve() {
int n;
cin >> n;
int pos = ask(0, n - 1);
bool is_l = (pos == 0 ? 0 : (ask(0, pos) == pos));
if (is_l) {
int l = 0, r = pos - 1;
int m;
while (l <= r) {
m = l + (r - l) / 2;
if (ask(m, pos) == pos)
l = m + 1;
else
r = m - 1;
}
cout << "! " << r + 1 << endl;
}
else {
int l = pos + 1, r = n - 1;
int m;
while (l <= r) {
m = l + (r - l) / 2;
if (ask(pos, m) == pos)
r = m - 1;
else
l = m + 1;
}
cout << "! " << l + 1 << endl;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#if defined(_DEBUG)
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
int q = 1;
//cin >> q;
for (; q > 0; q--) {
solve();
//cout << endl;
}
} | 9 | CPP |
n=int(input())
for _ in range(n):
l,r=map(int,input().split())
ans=l
for i in range(65):
if ((ans&(1<<i))==0):
if ans+(1<<i) <= r:
ans=ans+(1<<i)
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
long long ans = 1;
while (b) {
if (b % 2) ans = ans * a % MOD;
a = a * a % MOD;
b /= 2;
}
return ans;
}
inline void getInt(int* p);
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
priority_queue<int> heap;
int n;
int k;
int a[maxn];
char s[maxn];
int main() {
getInt(&n);
getInt(&k);
for (int i = 1; i <= n; i++) {
getInt(&a[i]);
}
scanf("%s", s + 1);
long long ans = 0ll;
for (int i = 1; i <= n; i++) {
if (s[i] == s[i + 1]) {
heap.push(a[i]);
continue;
} else {
heap.push(a[i]);
for (int j = 0; j <= k - 1; j++) {
if (heap.empty()) {
break;
} else {
ans += 1ll * heap.top();
heap.pop();
}
}
while (!heap.empty()) {
heap.pop();
}
}
}
printf("%lld\n", ans);
return 0;
}
inline void getInt(int* p) {
char ch;
do {
ch = getchar();
} while (ch == ' ' || ch == '\n');
if (ch == '-') {
*p = -(getchar() - '0');
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 - ch + '0';
}
} else {
*p = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') {
*p = *p * 10 + ch - '0';
}
}
}
| 9 | CPP |
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
f = int(input())
output = 0
if e >= f:
output += min(a, d) * e
d -= min(a, d)
output += min(b, c, d) * f
elif e < f:
output += min(b, c, d) * f
d -= min(b, c, d)
output += min(a, d) * e
print(output) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1.0);
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int digarr[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int dxo[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dyo[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int alf = 26;
const int dig = 10;
const int two = 2;
const int th = 3;
const long long prost = 239;
const long long btc = 30;
const long double eps = 1e-10;
const long long INF = (long long)(1e18 + 239);
const int BIG = (int)(1e9 + 239);
const int MOD = 1e9 + 7;
const long long MOD2 = (long long)MOD * (long long)MOD;
mt19937 rnd(239);
const int M = (int)(2e5 + 239);
const int N = (int)(2e3 + 239);
const int L = 20;
const int T = (1 << 20) + 239;
const int B = 500;
const int X = 210;
struct MCMF {
struct Edge {
int to, fr;
long long c, f, p;
Edge() { fr = to = c = f = p = 0; }
Edge(int fr1, int to1, long long c1, long long p1) {
fr = fr1;
to = to1;
c = c1;
f = 0;
p = p1;
}
};
int n;
vector<Edge> e;
vector<vector<int> > v;
int s, f;
vector<int> pr;
vector<long long> dist;
vector<long long> pot;
MCMF() {}
MCMF(int nn, int ss, int ff) {
n = nn;
dist.resize(n);
v.resize(n);
pot.resize(n);
pr.resize(n);
for (int i = 0; i < n; i++) pot[i] = 0;
s = ss, f = ff;
}
inline int connect(int a, int b, long long c, long long p) {
int i = e.size();
e.push_back(Edge(a, b, c, p));
v[a].push_back(i);
e.push_back(Edge(b, a, 0, -p));
v[b].push_back(i + 1);
return i;
}
inline long long cost(int i) { return e[i].p + pot[e[i].fr] - pot[e[i].to]; }
inline void phase() {
for (int i = 0; i < n; i++) dist[i] = INF, pr[i] = -1;
dist[s] = 0;
set<pair<long long, int> > q;
for (int i = 0; i < n; i++) q.insert(make_pair(dist[i], i));
while (!q.empty()) {
int x = q.begin()->second;
q.erase(q.begin());
for (int i : v[x])
if (e[i].c > e[i].f && dist[e[i].to] > dist[x] + cost(i)) {
q.erase(make_pair(dist[e[i].to], e[i].to));
pr[e[i].to] = i;
dist[e[i].to] = dist[x] + cost(i);
q.insert(make_pair(dist[e[i].to], e[i].to));
}
}
if (dist[f] >= BIG) return;
int t = f;
long long w = INF;
vector<int> way;
while (t != s) {
way.push_back(t);
w = min(w, e[pr[t]].c - e[pr[t]].f);
t = e[pr[t]].fr;
}
way.push_back(s);
reverse(way.begin(), way.end());
t = f;
while (t != s) {
e[pr[t]].f += w;
e[pr[t] ^ 1].f -= w;
t = e[pr[t]].fr;
}
for (int i = 0; i < n; i++) pot[i] = dist[i];
phase();
}
inline void compute_fb() {
for (int i = 0; i < n; i++) pot[i] = 0;
for (int z = 0; z < n; z++)
for (Edge ee : e)
if (ee.c > 0) pot[ee.to] = min(pot[ee.to], pot[ee.fr] + ee.p);
}
inline void run() {
compute_fb();
phase();
}
inline long long gett() {
long long ans = 0;
for (Edge ee : e)
if (ee.c > 0) ans += ee.f * ee.p;
return ans;
}
inline int getsize() {
long long ans = 0;
for (int i : v[s])
if (e[i].c > 0) ans += e[i].f;
return ans;
}
};
int n1, n2, m, r, b;
string s1, s2;
int ri[X], bi[X];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n1 >> n2 >> m >> r >> b >> s1 >> s2;
MCMF gr = MCMF(n1 + n2 + 4, n1 + n2 + 2, n1 + n2 + 3);
int L = n1 + n2;
int R = n1 + n2 + 1;
int S = n1 + n2 + 2;
int F = n1 + n2 + 3;
for (int i = 0; i < m; i++) {
int s, f;
cin >> s >> f;
s--, f--;
ri[i] = gr.connect(s, f + n1, 1, r);
bi[i] = gr.connect(f + n1, s, 1, b);
}
int big = 2 * m + 10;
gr.connect(R, L, big, 0);
int need = 0;
for (int i = 0; i < n1; i++) {
if (s1[i] == 'U') {
gr.connect(i, R, big, 0);
gr.connect(L, i, big, 0);
continue;
}
need++;
if (s1[i] == 'B') {
gr.connect(i, R, big, 0);
gr.connect(i, F, 1, 0);
gr.connect(S, R, 1, 0);
} else {
gr.connect(L, i, big, 0);
gr.connect(L, F, 1, 0);
gr.connect(S, i, 1, 0);
}
}
for (int ii = 0; ii < n2; ii++) {
int i = ii + n1;
if (s2[ii] == 'U') {
gr.connect(i, R, big, 0);
gr.connect(L, i, big, 0);
continue;
}
need++;
if (s2[ii] == 'R') {
gr.connect(i, R, big, 0);
gr.connect(i, F, 1, 0);
gr.connect(S, R, 1, 0);
} else {
gr.connect(L, i, big, 0);
gr.connect(L, F, 1, 0);
gr.connect(S, i, 1, 0);
}
}
gr.run();
if (gr.getsize() != need) {
cout << "-1\n";
return 0;
}
cout << gr.gett() << "\n";
string ans = "";
for (int i = 0; i < m; i++) {
if (gr.e[ri[i]].f == 1)
ans += "R";
else if (gr.e[bi[i]].f == 1)
ans += "B";
else
ans += "U";
}
cout << ans << "\n";
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long OO = 1e18 + 1;
bool adj[21][21] = {};
long long ans;
bool visited[21] = {};
long long solve(long long st) {
if (visited[st]) return 0;
visited[st] = true;
long long rtn = 1;
for (long long i = 0; i < 20; i++)
if (adj[st][i] || adj[i][st]) rtn += solve(i);
return rtn;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long t;
cin >> t;
while (t--) {
memset(adj, false, sizeof adj);
memset(visited, false, sizeof visited);
long long n;
ans = 0;
cin >> n;
string a, b;
cin >> a >> b;
for (long long i = 0; i < n; i++) {
if (a[i] < b[i] && !adj[a[i] - 'a'][b[i] - 'a'])
adj[a[i] - 'a'][b[i] - 'a'] = true;
else if (a[i] > b[i]) {
ans = -1;
break;
}
}
if (ans == -1)
cout << -1 << '\n';
else {
for (int i = 0; i < 20; i++) ans += max(solve(i) - 1, (long long)0);
cout << ans << '\n';
}
}
return 0;
}
| 7 | CPP |
Subsets and Splits