solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
import math
n,k=map(int,input().split())
if k>=math.ceil(n/2):
print(-1)
else:
print(n*k)
for i in range(1,n-k+1):
for j in range(i+1,i+k+1):
print(i,j)
x=i+1
for i in range(x,n+1):
c=0
for j in range(i+1,n+1):
print(i,j)
c+=1
j=1
for j in range(1,k-c+1):
print(i,j)
j+=1
| 7 | PYTHON3 |
#431A Black Square
entrada = str(input())
entrada = entrada.split()
s = str(input())
suma = 0
for second in s:
suma += int(entrada[int(second)-1])
print(suma) | 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
sum=0
for i in range(n,1,-2):
sum+=2*(i-1)*(i-1)
print(sum) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
string str;
cin >> str;
if (n <= 2)
cout << str;
else {
str[-1] = 'b';
cout << str[0];
for (i = 1; i < n; i++) {
if ((str[i] == str[i - 1]) && ((str[i] == 'a') || (str[i] == 'i') ||
(str[i] == 'u') || (str[i] == 'y')))
;
else if ((str[i] == 'e') || (str[i] == 'o')) {
if (((str[i - 2] != str[i - 1]) && (str[i - 1] == str[i]) &&
(str[i] != str[i + 1])) ||
((str[i] == str[i - 1]) && (str[i] != str[i + 1]) && (i == 1)))
cout << str[i];
else if (str[i] != str[i - 1])
cout << str[i];
} else
cout << str[i];
}
}
return 0;
}
| 17 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
int a, b, c;
while (cin >> a >> b >> c) {
bool used[10] = {};
used[a - 1] = used[b - 1] = used[c - 1] = true;
int cnt = 0;
for (int i = 0; i < 10; i++) {
cnt += (!used[i] && a + b + i + 1 <= 20);
}
cout << (cnt * 2 >= 7 ? "YES" : "NO") << endl;
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool checkMax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
template <typename T, typename... Args>
inline void checkMax(T &a, const Args... arg) {
checkMax(a, max(arg...));
}
template <class T>
inline bool checkMin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T, typename... Args>
inline void checkMin(T &a, const Args... arg) {
checkMin(a, min(arg...));
}
const int INF = 0x3f3f3f3f;
const long long llINF = 1e18;
const int MAXN = 1e5 + 5;
int n, K, len, top;
long long ans;
int a[MAXN], w[MAXN], head[MAXN], nxt[MAXN], st[MAXN];
long long pre[MAXN], suf[MAXN];
struct Edge {
int to, next;
} e[MAXN << 1];
void add_edge(int u, int v) {
e[++len] = (Edge){v, head[u]};
head[u] = len;
}
struct SegmentTree {
struct Tree {
int l, r;
long long mina, minb, ans, tag;
} tree[MAXN << 2];
void apply(int k, long long v) {
tree[k].tag += v;
tree[k].minb += v;
tree[k].ans -= v;
}
void pushdown(int k) {
if (tree[k].tag) {
apply(k << 1, tree[k].tag);
apply(k << 1 | 1, tree[k].tag);
tree[k].tag = 0;
}
}
long long calc(int k, long long pre) {
if (tree[k].l == tree[k].r) return tree[k].mina - pre;
pushdown(k);
if (pre > tree[k << 1].minb)
return min(calc(k << 1, pre), tree[k].ans);
else
return min(calc(k << 1 | 1, pre), tree[k << 1].mina - pre);
}
void update(int k) {
tree[k].mina = min(tree[k << 1].mina, tree[k << 1 | 1].mina);
tree[k].minb = min(tree[k << 1].minb, tree[k << 1 | 1].minb);
tree[k].ans = calc(k << 1 | 1, tree[k << 1].minb);
}
void build(int k, int l, int r) {
tree[k].l = l;
tree[k].r = r;
if (l == r) {
tree[k].mina = tree[k].minb = suf[r];
return;
}
int mid = (l + r) >> 1;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
update(k);
}
void modify(int k, int l, int r, long long v) {
if (tree[k].l >= l && tree[k].r <= r) {
apply(k, v);
return;
}
int mid = (tree[k].l + tree[k].r) >> 1;
pushdown(k);
if (l <= mid) modify(k << 1, l, r, v);
if (r > mid) modify(k << 1 | 1, l, r, v);
update(k);
}
long long findpos(int k, long long x) {
if (tree[k].l == tree[k].r) return tree[k].l;
return tree[k << 1 | 1].mina <= x ? findpos(k << 1 | 1, x)
: findpos(k << 1, x);
}
long long query(int k, long long &x) {
if (tree[k].l == tree[k].r) {
int res = tree[k].mina - x <= K ? tree[k].r : 0;
checkMin(x, tree[k].minb);
return res;
}
pushdown(k);
if (tree[k << 1].minb < x) {
if (tree[k].ans <= K) return query(k << 1 | 1, x = tree[k << 1].minb);
int res = query(k << 1, x);
checkMin(x, tree[k].minb);
return res;
} else {
long long res = tree[k << 1].mina <= K + x ? findpos(k << 1, K + x) : 0;
checkMax(res, query(k << 1 | 1, x));
return res;
}
}
} T;
void dfs(int u) {
st[++top] = u;
if (nxt[u] <= n) T.modify(1, nxt[u] - 1, n, pre[u] - pre[nxt[u]]);
if (u <= n) {
int l = 2, r = top - 1, res = 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (pre[st[mid]] - pre[u] > K)
res = mid, l = mid + 1;
else
r = mid - 1;
}
int maxr = st[res] - 1;
long long mn = llINF;
if (u > 1) T.modify(1, 1, u - 1, llINF);
T.modify(1, maxr, n, -llINF);
long long pos = T.query(1, mn);
if (u > 1) T.modify(1, 1, u - 1, -llINF);
T.modify(1, maxr, n, llINF);
checkMax(ans, pos - u + 1);
}
for (int i = head[u]; i != -1; i = e[i].next) dfs(e[i].to);
if (nxt[u] <= n) T.modify(1, nxt[u] - 1, n, pre[nxt[u]] - pre[u]);
top -= 1;
}
int main() {
memset(head, -1, sizeof(head));
scanf("%d%d", &n, &K);
for (int i = 1; i < n; i++) scanf("%d", &w[i]);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 2; i <= n; i++) {
pre[i] = pre[i - 1] + w[i - 1] - a[i - 1];
suf[i] = suf[i - 1] + w[i - 1] - a[i];
}
nxt[n + 1] = n + 1;
pre[n + 1] = llINF;
ans = 1;
for (int i = n; i >= 1; i--) {
while (top && pre[i] >= pre[st[top]]) top -= 1;
nxt[i] = top ? st[top] : n + 1;
st[++top] = i;
add_edge(nxt[i], i);
}
top = 0;
T.build(1, 1, n);
dfs(n + 1);
printf("%lld\n", ans);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define abs(x) ((x)>0?(x):-(x))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define ll long long
//#define file
using namespace std;
bool a[5001],b[5001];
int d1[5001],d2[5001],D[10001],n,N,i,j,k,l,s1,s2,ans,sum,tot;
char ch;
int main()
{
#ifdef file
freopen("AGC030E.in","r",stdin);
#endif
scanf("%d",&n);N=n/2;
fo(i,1,n) {ch=getchar();while (ch!='0' && ch!='1') ch=getchar(); a[i]=ch=='1';}
fo(i,1,n) {ch=getchar();while (ch!='0' && ch!='1') ch=getchar(); b[i]=ch=='1';}
fo(i,1,n-1)
{
if (a[i]==a[i+1]) d1[++s1]=i;
if (b[i]==b[i+1]) d2[++s2]=i;
}
if (!s1 && !s2) {if (a[1]==b[1]) printf("0\n"); else printf("%d\n",n);return 0;}
ans=2133333333;
fo(i,-N,N)
if ((a[1]^(i&1))==b[1] && abs(s2-(s1+i))<=N)
{
j=s2-(s1+i);
tot=sum=0;
fo(k,1,-i) sum+=d1[k];
fo(k,1,i) D[++tot]=0;
fo(k,1+max(-i,0),s1-max(-j,0)) D[++tot]=d1[k];
fo(k,1,-j) sum+=n-d1[s1-k+1];
fo(k,1,j) D[++tot]=n;
if (tot>s2) continue;
fo(k,1,tot) sum+=abs(D[k]-d2[k]);
ans=min(ans,sum);
}
printf("%d\n",ans);
fclose(stdin);
fclose(stdout);
return 0;
} | 0 | CPP |
__author__ = 'Andrey'
n = int(input())
k = n // 7
c = n % 7
print(2 * k + max(0, c - 5), 2 * k + min(c, 2)) | 7 | PYTHON3 |
def count_flats(n):
if n == 0:
return [0, 0, 0]
if n >= 7:
a = count_flats(n - 7)
if a is not None:
a[2] += 1
return a
if n >= 5:
a = count_flats(n - 5)
if a is not None:
a[1] += 1
return a
if n >= 3:
a = count_flats(n - 3)
if a is not None:
a[0] += 1
return a
return
for i in range(int(input())):
res = count_flats(int(input()))
if res is None:
print(-1)
else:
print(' '.join([str(i) for i in res]))
| 7 | PYTHON3 |
#for _ in range(int(input())):
#n= int(input())
li=list(map(int,input().strip().split()))
p=max(li)
li.remove(p)
print(p-li[0],p-li[1],p-li[2])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
const long long mod = 1e6 + 3;
int dx[5] = {0, 0, 0, 1, 1};
int dy[5] = {0, 0, 1, 1, 0};
string s[N];
long long pow_q(long long a, long long b) {
long long tmp = 1;
while (b > 0) {
if (b & 1) {
tmp *= a;
tmp %= mod;
}
a *= a;
a %= mod;
b >>= 1;
}
return tmp;
}
int main() {
int n, m, i, cnt = 0, j;
int flag = 1;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) cin >> s[i];
for (i = 0; i < n; i++) {
int now = -1;
for (j = 0; j < m; j++) {
if (s[i][j] >= '1' && s[i][j] <= '4') {
if (now == -1)
now = dx[s[i][j] - '0'];
else {
if (now != dx[s[i][j] - '0']) flag = 0;
}
}
if (now != -1) now = 1 - now;
}
if (now == -1) cnt++;
}
for (j = 0; j < m; j++) {
int now = -1;
for (i = 0; i < n; i++) {
if (s[i][j] >= '1' && s[i][j] <= '4') {
if (now == -1)
now = dy[s[i][j] - '0'];
else {
if (now != dy[s[i][j] - '0']) flag = 0;
}
}
if (now != -1) now = 1 - now;
}
if (now == -1) cnt++;
}
if (!flag)
printf("0\n");
else {
printf("%lld\n", pow_q(2, cnt));
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t = 1000001;
class myData {
public:
int v;
long long dist;
myData(int v, long long dist) : v(v), dist(dist) {}
};
long long exponentMod(int A, int B, int C) {
if (A == 0) return 0;
if (B == 0) return 1;
long y;
if (B % 2 == 0) {
y = exponentMod(A, B / 2, C);
y = (y * y) % C;
} else {
y = A % C;
y = (y * exponentMod(A, B - 1, C) % C) % C;
}
return (int)((y + C) % C);
}
int factorize(long long n) {
int j = 0;
int ans = 1;
for (long long i = 2; i * i <= n; ++i) {
while (n % i == 0) {
if (j != 0)
ans *= i;
else
j = 1;
n /= i;
}
}
if (n != 1) {
if (j == 1) ans *= n;
}
return ans;
}
map<long long, long long> bit;
int N = 2e5;
void update(long long i) {
for (; i <= N; i += i & (-i)) bit[i]++;
}
long long get(long long i) {
long long ans = 0;
for (; i > 0; i -= i & (-i)) ans += bit[i];
return ans;
}
int root[200005];
long long si[200005];
int id(int x) {
if (x == root[x]) return x;
return root[x] = id(root[x]);
}
int now;
long long ans[2001][2001];
bool sortByVal(const pair<int, set<int>> &a, const pair<int, set<int>> &b) {
return (a.second.size() > b.second.size());
}
int main() {
int n, m, k;
int t;
cin >> t;
while (t--) {
cin >> n >> m >> k;
if (n / k >= m) {
cout << m << endl;
} else {
int l = m - n / k;
if (l % (k - 1) == 0)
cout << n / k - (l / (k - 1)) << endl;
else
cout << n / k - (l / (k - 1) + 1) << endl;
}
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
vector<ll> ans;
void solve() {
int n;
cin >> n;
ll res = 0;
vector<ll> lefters[n], righters[n+1];
rep(i, n) {
ll k, l, r;
cin >> k >> l >> r;
k--;
res += min(l, r);
if (l > r) {
lefters[k].push_back(l - r);
} else {
righters[k+1].push_back(r - l);
}
}
priority_queue<ll, vector<ll>, greater<ll>> pql, pqr;
rep(i, n) {
for (ll val : lefters[i]) pql.push(val);
while ((ll)pql.size() > i + 1) pql.pop();
for (ll val : righters[n - i - 1]) pqr.push(val);
while ((ll)pqr.size() > i + 1) pqr.pop();
}
while (!pql.empty()) {
res += pql.top();
pql.pop();
}
while (!pqr.empty()) {
res += pqr.top();
pqr.pop();
}
ans.push_back(res);
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
for(ll a : ans){
cout << a << endl;
}
} | 0 | CPP |
# cook your dish here
t=int(input())
while t>0:
t=t-1
a=str(input())
n0=a.count('0')
n1=a.count('1')
if n0==0 or n1==0:
print(a)
else:
if n0>n1:
print('01'*(len(a)-1) + '0')
else:
print('10'*(len(a)-1) + '1')
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long d[510][510], sum[510];
int x[510];
int main() {
int n, i, j, a, b;
scanf("%d", &n);
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j) cin >> d[i][j];
for (i = 1; i <= n; ++i) scanf("%d", &x[i]);
for (i = n; i; --i) {
for (a = 1; a <= n; ++a) {
for (b = 1; b <= n; ++b) {
d[a][b] = min(d[a][b], d[a][x[i]] + d[x[i]][b]);
}
}
for (a = i; a <= n; ++a) {
for (b = i; b <= n; ++b) {
sum[i] += d[x[a]][x[b]];
}
}
}
for (i = 1; i < n; ++i) cout << sum[i] << " ";
cout << sum[i] << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool palindrom(string s) {
bool c = true;
for (int i = 0; i < s.size() / 2; i++)
if (s[i] != s[s.size() - i - 1]) {
c = false;
break;
}
return c;
}
int main() {
string s;
char c;
int t;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> s;
bool check;
check = false;
if (palindrom(s)) {
for (int j = 0; j < s.size() / 2; j++) {
c = s[j];
s[j] = s[j + 1];
s[j + 1] = c;
if (palindrom(s) == false) {
check = true;
break;
}
}
if (check)
cout << s << endl;
else
cout << -1 << endl;
} else
cout << s << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, q, cnt;
int A[100006], fa[100006];
vector<int> G[100006];
int head[100006], to[100006], nex[100006], wto[100006], dto[100006], ecn;
void ade(int u, int v, int w, int ww) {
to[++ecn] = v, nex[ecn] = head[u], head[u] = ecn, wto[ecn] = w, dto[ecn] = ww;
}
int mark[100006], black[100006];
void afs(int u, int f, int w, int d) {
cnt++;
if (mark[u]) {
if (f != -1) ade(f, u, w, d);
for (int& v : G[u]) afs(v, u, 0, 0);
} else {
if (!black[u]) ++w;
for (int& v : G[u]) afs(v, f, w, d + 1);
}
}
int pu[100006];
void rever(int u) {
cnt++;
if (!black[u]) return void(black[u] = 1);
++pu[u];
for (int i = head[u]; i; i = nex[i])
if (wto[i] + 1 <= pu[u]) rever(to[i]);
}
int cov[100006];
void cover(int u) {
cnt++;
black[u] = pu[u] = 0;
cov[u] = 1;
for (int i = head[u]; i; i = nex[i]) wto[i] = dto[i], cover(to[i]);
}
int re[100006];
void cfs(int u, int p, int cl) {
cnt++;
if (mark[u])
p = pu[u], cl |= cov[u];
else {
if (cl) black[u] = 0;
if (!black[u] && p) black[u] = 1, --p;
}
for (int v : G[u]) cfs(v, p, cl);
}
int op[100006], pt[100006];
int main() {
cin >> n >> q;
int blo = sqrt(q);
int u;
for (int i = (2), iend = (n); i <= iend; ++i)
scanf("%d", &u), fa[i] = u, G[u].push_back(i);
for (int i = (1), iend = (q); i <= iend; ++i) scanf("%d%d", op + i, pt + i);
int s = (q - 1) / blo + 1;
for (int i = (1), iend = (s); i <= iend; ++i) {
int l = (i - 1) * blo + 1, r = min(q, i * blo);
for (int i = (1), iend = (n); i <= iend; ++i)
mark[i] = cov[i] = pu[i] = head[i] = 0;
for (int i = (l), iend = (r); i <= iend; ++i) mark[pt[i]] = 1;
afs(1, -1, 0, 0);
for (int i = (l), iend = (r); i <= iend; ++i) {
if (op[i] == 1)
rever(pt[i]);
else if (op[i] == 2)
cover(pt[i]);
else
puts(black[pt[i]] ? "black" : "white");
}
cfs(1, 0, 0);
}
}
| 13 | CPP |
def max_sum(k2, k3, k5, k6):
sum = 0
num_of_256 = min(k5, k6, k2)
sum += 256 * num_of_256
k5 -= num_of_256
k6 -= num_of_256
k2 -= num_of_256
num_of_32 = min(k2, k3)
sum += 32 * num_of_32
k3 -= num_of_32
k2 -= num_of_32
return sum
user_input = input()
int_inputs = map(int, user_input.split(' ')[0:4])
print(max_sum(*int_inputs)) | 8 | PYTHON3 |
# cook your dish here
import string
n=int(input())
s=input()
s1=string.ascii_uppercase
d={}
for i in range(len(s1)):
d[s1[i]]=i+1
a=[]
for i in range(0,len(s)-3):
c=0
c+=min(abs(d[s[i]]-d['A']),26-abs(d[s[i]]-d['A']))
c+=min(abs(d[s[i+1]]-d['C']),26-abs(d[s[i+1]]-d['C']))
c+=min(abs(d[s[i+2]]-d['T']),26-abs(d[s[i+2]]-d['T']))
c+=min(abs(d[s[i+3]]-d['G']),26-abs(d[s[i+3]]-d['G']))
a.append(c)
print(min(a)) | 7 | PYTHON3 |
recipe = input()
k_lst = [int(x) for x in input().split(" ")]
p_lst = [int(x) for x in input().split(" ")]
r = int(input())
recipe_lst = [recipe.count('B'), recipe.count('S'), recipe.count('C')]
number , cost , test2 = 0 , 0 , 0
test = True
for i in range(3):
if recipe_lst[i] > 0:
test2 += 1
cost += recipe_lst[i] * p_lst[i]
def mk1():
global k_lst, number
for x in range(3):
k_lst[x] -= recipe_lst[x]
number += 1
while test:
if k_lst[0] >= recipe_lst[0] and k_lst[1] >= recipe_lst[1] and k_lst[2] >= recipe_lst[2] :
mk1()
else :
temp = 0
for j in range(3):
if k_lst[j] < recipe_lst[j] != 0:
if r >= (recipe_lst[j] - k_lst[j]) * p_lst[j] :
r = r - p_lst[j] * (recipe_lst[j] - k_lst[j])
k_lst[j] += (recipe_lst[j] - k_lst[j])
temp += 1
else:
test = False
break
if temp == test2:
mk1()
test = False
break
print(number + r//cost) | 9 | PYTHON3 |
import math
global prime
prime = [True for i in range(10**5+1)]
def SieveOfEratosthenes(n):
n2 = int(n)
# Create a boolean array
# "prime[0..n]" and initialize
# all entries it as true.
# A value in prime[i] will
# finally be false if i is
# Not a prime, else true.
p = 2
while (p * p <= n):
# If prime[p] is not
# changed, then it is a prime
if (prime[p] == True):
# Update all multiples of p
for i in range(p * p, int(math.sqrt(n))+10, p):
prime[i] = False
p += 1
# Print all prime numbers
def solve(n):
freq_max=0
max_dig = 0
max_prod =0
i=2
n2 = int(n)
# lol = int(math.sqrt(n2))
while (i*i<=n2):
# print(i)
if prime[i]:
n=int(n2)
if n%i==0 :
# print('hi',i)
freq=0
prod = 1
while n%i==0:
# print("hi2")
prod*=i
freq+=1
n/=i
if freq>freq_max :
freq_max=freq
max_dig = i
if n==1: break
i+=1
# print(max_dig,freq_max,n2)
if max_dig==0 :
print(1)
print(n2)
else:
if freq_max==1 :
if (n2//max_dig)%max_dig==0 :
print(2)
print(max_dig, n2//max_dig)
else:
print(1)
print(n2)
else:
z = int(freq_max)
print(z)
while (freq_max!=1):
print(max_dig,end=" ")
freq_max-=1
print(n2//(max_dig**(z-1)))
if __name__=="__main__":
T = int(input())
SieveOfEratosthenes(10**5+1)
for i in range(T):
global n
n = int(input())
solve(n) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long a, long long b, long long m) {
if (b == 0) return 1 % m;
long long x = bigmod(a, b / 2, m);
x = (x % m * x % m) % m;
if (b % 2) x = (x % m * a % m) % m;
return x;
}
int main() {
int n, p, ng, q = 0, l = 0;
cin >> n >> p;
int a[n + 2];
for (int i = 0; i < n; i++) cin >> a[i];
long long an = 0;
map<int, int> m;
m[0] = 1;
for (int i = 0; i < n; i++) {
if (a[i] < p)
l--;
else if (a[i] > p)
l++;
else {
q = 1;
}
if (q) {
an += m[l] + m[l - 1];
} else
m[l]++;
}
cout << an << endl;
}
| 11 | CPP |
import math
a,b,h,m = map(int,input().split())
t = 2*math.pi*(m/60 - (h + m/60)/12)
print(math.sqrt(a**2 + b**2 - 2*a*b*math.cos(t))) | 0 | PYTHON3 |
import bisect
t=int(input())
for _ in range(t):
n,s,k=map(int,input().split())
close=list(input().split())
close=[int(x) for x in close]
close=sorted(close)
index=bisect.bisect_left(close,s)
for i in range(1000000000):
if s+i<=n and s+i not in close:
print(i)
break
if s-i>=1 and s-i not in close:
print(i)
break
| 7 | PYTHON3 |
n = int(input())
l = set()
o = ''
for _ in range(n):
c = input().split()
if c[0] == 'insert':
l.add(c[1])
elif c[0] == 'find':
o += ('yes' if c[1] in l else 'no') + "\n"
print(o, end='')
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
long long p = 1;
while (n > 0) {
if (n & 1) {
p = p * a;
}
n >>= 1;
a *= a;
}
return p;
}
long long power(long long a, long long n, long long mod) {
long long p = 1;
while (n > 0) {
if (n & 1) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& p) {
os << "[ ";
for (T x : p) os << x << " ";
os << "]" << endl;
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& p) {
os << "{ ";
for (T x : p) os << x << " ";
os << "}" << endl;
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& p) {
os << "{ ";
for (T x : p) os << x << " ";
os << "}" << endl;
return os;
}
template <typename Tk, typename Tv>
ostream& operator<<(ostream& os, const map<Tk, Tv>& p) {
os << "{ ";
for (pair<Tk, Tv> x : p) os << x << " ";
os << "}" << endl;
return os;
}
template <typename Tk, typename Tv>
ostream& operator<<(ostream& os, const pair<Tk, Tv>& p) {
os << "{" << p.first << ',' << p.second << "}";
return os;
}
set<int> s;
map<int, int> ma;
int main() {
int i, j;
int q;
scanf("%d", &q);
while (q--) {
char c;
int id;
cin >> c;
if (c == 'L') {
scanf("%d", &id);
if (s.size() == 0) {
ma[id] = 0;
s.insert(0);
} else {
ma[id] = *(s.begin()) - 1;
s.insert(ma[id]);
}
} else if (c == 'R') {
scanf("%d", &id);
if (s.size() == 0) {
ma[id] = 0;
s.insert(0);
} else {
ma[id] = *(s.rbegin()) + 1;
s.insert(ma[id]);
}
} else {
scanf("%d", &id);
int lo = *(s.begin()), hi = *(s.rbegin());
printf("%d\n", min(ma[id] - lo, hi - ma[id]));
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long x, y, cost = 0, seg = 0;
string str;
cin >> n >> x >> y;
cin >> str;
for (int i = 0; i <= n - 1; i++) {
if (str[i] == '0' && (i == n - 1 || str[i + 1] == '1')) seg++;
}
cost = seg * y;
for (int i = 0; i < seg - 1; i++) {
long long c1 = cost - y + x;
if (c1 < cost) cost = c1;
}
cout << cost << "\n";
return 0;
}
| 7 | CPP |
for _ in ' '*int(input()):
input(); a=[int(x) for x in input().split()]
for a,b in zip(a,a[1:]):
if a<=b: a=0; break
print('NYOE S'[a==0::2]) | 7 | PYTHON3 |
rounds = eval(input())
nameAndScoreDict = {}
nameList = []
scoreList = []
#input
for i in range(rounds):
input1 = input().split()
nameList.append(input1[0])
scoreList.append(int(input1[1]))
#set keys of dictionary and set each key's value to 0
for i in nameList:
nameAndScoreDict[i] = 0
#find sum scores of each player
for i in range(rounds):
nameAndScoreDict[nameList[i]] += scoreList[i]
#find max
m = max(nameAndScoreDict.values())
#find winner
dictNameList = list(nameAndScoreDict.keys())[:]
for i in dictNameList:
if nameAndScoreDict[i] < m:
del nameAndScoreDict[i]
winnersList =list(nameAndScoreDict.keys())[:]
#reset each key's value to 0
for i in nameList:
nameAndScoreDict[i] = 0
#find sum scores of each player again to find who hit max first
for i in range(rounds):
nameAndScoreDict[nameList[i]] += scoreList[i]
if nameAndScoreDict[nameList[i]] >= m and nameList[i] in winnersList:
print(nameList[i])
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, string> > > a;
char str[15];
int main() {
int n, m;
scanf("%d%d", &n, &m);
a.resize(m + 5);
for (int i = 1; i <= n; i++) {
string s = "";
int num;
int score;
scanf("%s%d%d", str, &num, &score);
int len = strlen(str);
for (int i = 0; i < len; i++) s += str[i];
a[num].push_back(make_pair(score, s));
}
for (int i = 1; i <= m; i++) {
sort(a[i].begin(), a[i].end());
int num = a[i].size();
bool posi = true;
string max = a[i][num - 1].second, smax = a[i][num - 2].second;
if (num - 3 >= 0)
if (a[i][num - 3].first == a[i][num - 2].first) posi = false;
max = max + " " + smax;
if (posi) {
for (int i = 0; i < max.size(); i++) putchar(max[i]);
printf("\n");
} else
printf("?\n");
}
return 0;
}
| 8 | CPP |
t=int(input())
for i in range(t):
a,b,c,n=map(int,input().split())
d=n-(3*max(a,b,c)-a-b-c)
if d%3==0 and d>=0:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct seg {
int x, L, R;
seg* lf;
seg* rg;
bool del_lf, del_rg;
seg(int l, int r) {
L = l;
R = r;
x = 1e9;
del_lf = del_rg = true;
if (l == r) {
lf = rg = 0;
} else {
int m = (l + r) / 2;
lf = new seg(l, m);
rg = new seg(m + 1, r);
}
}
seg(seg* src) {
*this = *src;
del_lf = del_rg = false;
}
~seg() {
if (del_lf) delete lf;
if (del_rg) delete rg;
}
seg* update(int p, int t) {
int m = (L + R) / 2;
auto root = new seg(this);
if (L == p && p == R) {
root->x = min(root->x, t);
} else if (p <= m) {
root->del_lf = true;
root->lf = root->lf->update(p, t);
root->x = max(root->lf->x, root->rg->x);
} else {
root->del_rg = true;
root->rg = root->rg->update(p, t);
root->x = max(root->lf->x, root->rg->x);
}
return root;
}
int query(int l, int r) {
if (l <= L && R <= r) {
return x;
} else {
int m = (L + R) / 2;
if (r <= m)
return lf->query(l, r);
else if (m < l)
return rg->query(l, r);
else
return max(lf->query(l, r), rg->query(l, r));
}
}
};
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
vector<tuple<int, int, int>> a(k);
for (auto& [l, r, p] : a) cin >> l >> r >> p;
sort(a.begin(), a.end());
vector<seg*> roots(k + 1);
roots.back() = new seg(1, n);
for (int i = k - 1; i >= 0; --i) {
auto [l, r, p] = a[i];
roots[i] = roots[i + 1]->update(p, r);
}
while (m--) {
int l, r, x, y;
cin >> l >> r >> x >> y;
int version =
lower_bound(a.begin(), a.end(), make_tuple(x, 0, 0)) - a.begin();
bool ans = version < k ? roots[version]->query(l, r) <= y : false;
cout << (ans ? "yes" : "no") << endl;
}
for (auto root : roots) delete root;
}
| 12 | CPP |
a=list(map(int,input().split()))
c=list(map(int,input().split()))
b=a[1]
import collections
def f(A,k):
d=set()
ans=collections.deque([])
for i in range(len(A)):
if A[i] not in d:
ans.appendleft(A[i])
d.add(A[i])
#print(ans,d)
if len(ans)>k:
temp=ans.pop()
d.remove(temp)
return ([len(d),list(ans)])
def g(A):
str1=A[0]
str2=""
for i in A[1]:
str2=str2+str(i)+" "
return ([str1,str2])
temp=f(c,b)
temp2=g(temp)
print(temp2[0])
print(temp2[1]) | 8 | PYTHON3 |
# import sys
# sys.stdin=open('input.in','r')
# sys.stdout=open('output.out','w')
n=int(input())
x1=1
x2=2
k=0
for x in range(1,n+1):
if x==1 or x==2:
print('O',end='')
else:
k=x1+x2
if k==x:
print('O',end='')
x1=x2
x2=k
else:
print('o',end='')
#OOOoOooOooooOoo | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005, logN = 18;
int n, q, l, r, tim;
struct vec {
int x, y, num;
bool operator<(const vec &A) const { return x < A.x || x == A.x && y > A.y; }
} a[N];
inline long long calc(vec *a) { return a->x + 1LL * tim * a->y; }
inline long long cross(vec &a, vec &b, vec &c) {
return (long long)(b.x - a.x) * (c.y - a.y) -
(long long)(b.y - a.y) * (c.x - a.x);
}
vec mem[N * logN * 2], *newmem = mem;
struct data {
vec *st, *en;
} t[N * 4];
void build(int i, int beg, int end) {
t[i].st = newmem;
if (end - beg == 1) {
scanf("%d%d", &t[i].st->x, &t[i].st->y);
t[i].st->num = end;
newmem++;
t[i].en = newmem;
return;
}
int mid = beg + end >> 1;
build(i << 1, beg, mid);
build(i << 1 | 1, mid, end);
t[i].st = t[i].en = newmem;
for (vec *l = t[i << 1].st, *r = t[i << 1 | 1].st;
l < t[i << 1].en || r < t[i << 1 | 1].en;)
if (l < t[i << 1].en && (r == t[i << 1 | 1].en || *l < *r)) {
while (t[i].en - t[i].st > 1 && cross(t[i].en[-2], t[i].en[-1], *l) >= 0)
t[i].en--;
*t[i].en++ = *l++;
} else {
while (t[i].en - t[i].st > 1 && cross(t[i].en[-2], t[i].en[-1], *r) >= 0)
t[i].en--;
*t[i].en++ = *r++;
}
newmem = t[i].en;
}
vec *query(int i, int beg, int end) {
if (r <= beg || l >= end) return a;
if (l <= beg && r >= end) {
vec *a = t[i].st, *b = t[i].en - 1;
long long fa = calc(a), fb = calc(b);
while (b - a + 1 >= 3) {
vec *mid1 = a + (b - a + 1) / 3, *mid2 = b - (b - a + 1) / 3;
long long f1 = calc(mid1), f2 = calc(mid2);
if (fa <= f1 && f1 <= f2)
a = mid1, fa = f1;
else if (fb <= f2 && f2 <= f1)
b = mid2, fb = f2;
else
puts("Error");
}
vec *res = b;
for (; a < b; a++)
if (calc(res) < calc(a)) res = a;
return res;
}
int mid = beg + end >> 1;
vec *a = query(i << 1, beg, mid), *b = query(i << 1 | 1, mid, end);
return calc(a) > calc(b) ? a : b;
}
int main() {
scanf("%d%d", &n, &q);
build(1, 0, n);
while (q--) {
scanf("%d%d%d", &l, &r, &tim);
l--;
printf("%d\n", query(1, 0, n)->num);
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
string s, t;
cin >> s >> t;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) {
cnt++;
}
}
if (k < (n - cnt) / 2 + (n - cnt) % 2) {
cout << -1 << endl;
} else {
if (k <= (n - cnt)) {
int x = ((n - cnt) - k) * 2;
for (int i = 0; i < n; i++) {
if (s[i] == t[i])
cout << s[i];
else {
if (x) {
if (x % 2) {
cout << s[i];
x--;
} else
cout << t[i], x--;
} else {
for (int j = 0; j < 26; j++) {
char ch = j + 'a';
if (ch != s[i] && ch != t[i]) {
cout << ch;
break;
}
}
}
}
}
} else {
int x = k - (n - cnt);
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) {
if (x) {
for (int j = 0; j < 26; j++) {
char ch = j + 'a';
if (ch != s[i]) {
cout << ch;
break;
}
}
x--;
} else
cout << s[i];
} else {
for (int j = 0; j < 26; j++) {
char ch = j + 'a';
if (ch != s[i] && ch != t[i]) {
cout << ch;
break;
}
}
}
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1000006];
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n * k; i++) {
cin >> a[i];
}
int shift = n / 2;
long long sum = 0, cnt = 0;
vector<long long> v;
for (int i = 1; i <= n * k; i++) {
sum = 0, cnt = 0;
for (int j = i; j <= n * k; j = j + shift + 1) {
if (cnt <= k) {
cnt++;
sum += a[j];
}
}
if (cnt == k) {
v.push_back(sum);
}
}
cout << v[v.size() - shift - 1] << endl;
}
return 0;
}
| 8 | CPP |
n = int(input())
S = input().strip()
d = {}
for i in range(n-1):
cur = S[i:i+2]
d[cur] = d.get(cur, 0) + 1
ans = S[:2]
mmax = 1
for key, val in d.items():
if val > mmax:
mmax = val
ans = key
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<int> v[N];
int a[N], sum[N], st[N], le[N], ri[N];
int solver(int l, int r, int x) {
if (l >= r) {
return 0;
}
return lower_bound(v[x].begin(), v[x].end(), r) -
lower_bound(v[x].begin(), v[x].end(), l);
}
int main() {
int n, k;
cin >> n >> k;
v[0].push_back(0);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum[i + 1] = (sum[i] + a[i]) % k;
v[sum[i + 1]].push_back(i + 1);
}
int t = 0;
for (int i = 0; i < n; i++) {
while (t > 0 && a[st[t - 1]] < a[i]) {
t--;
}
le[i] = -1;
if (t) {
le[i] = st[t - 1];
}
st[t++] = i;
}
t = 0;
for (int i = n - 1; i >= 0; i--) {
while (t > 0 && a[st[t - 1]] <= a[i]) {
t--;
}
ri[i] = n;
if (t) {
ri[i] = st[t - 1];
}
st[t++] = i;
}
for (int i = 0; i < n; i++) {
a[i] %= k;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (i - le[i] < ri[i] - i) {
for (int j = i; j > le[i]; j--) {
if (j == i) {
ans += solver(i + 2, ri[i] + 1, (sum[j] + a[i]) % k);
} else {
ans += solver(i + 1, ri[i] + 1, (sum[j] + a[i]) % k);
}
}
} else {
for (int j = i + 1; j <= ri[i]; j++) {
if (j == i + 1) {
ans += solver(le[i] + 1, i, (sum[j] - a[i] + k) % k);
} else {
ans += solver(le[i] + 1, i + 1, (sum[j] - a[i] + k) % k);
}
}
}
}
cout << ans << endl;
}
| 12 | CPP |
from collections import Counter
n = int(input())
s = input()
count = Counter()
for i in range(n-1):
count[s[i:i+2]] += 1
print(count.most_common(1)[0][0]) | 8 | PYTHON3 |
n,k=map(int,input().split())
a = list(map(int,input().split()))
a.sort()
min_=float('inf')
for i in range(0,k-n+1):
if a[i+n-1]-a[i]<min_:
min_ = a[i+n-1]-a[i]
print(min_) | 7 | PYTHON3 |
numberOfInputs = int(input())
suffixes = ('desu', 'masu')
for i in range(0, numberOfInputs):
inputString = input()
if inputString.endswith(suffixes):
print("JAPANESE")
elif inputString.endswith("po"):
print("FILIPINO")
else:
print("KOREAN")
| 7 | PYTHON3 |
prog = input()
coms = {
">": "1000",
"<": "1001",
"+": "1010",
"-": "1011",
".": "1100",
",": "1101",
"[": "1110",
"]": "1111"
}
num = "0b"
for i in prog:
num += coms[i]
print(int(num, 2) % (10**6 + 3)) | 8 | PYTHON3 |
s=int(input())
if s>=1987 and s<2013:
print("2013")
else:
while(True):
s+=1
if len(set(str(s)))==4:
print(s)
break
| 7 | PYTHON3 |
M = 10 ** 9 + 7
array = [0] * 100010
array[0] = 1
array[1] = 1
def f(n):
if array[n] == 0:
array[n] = (f(n - 1) + f(n - 2)) % M
return array[n]
for i in range(1, 100010):
f(i)
a, b = map(int, input().split())
print (( (f(a)+f(b)-1)*2 ) % M) | 7 | PYTHON3 |
def cnt(n):
a = [0] * 10
c = 0
b = 0
while n != 0:
a[n % 10] += 1
if a[n % 10] == 1:
c += 1
n //= 10
b += 1
if b == c:
return True
else:
return False
n = int(input().strip())
i = 1
while not cnt(n + i):
i += 1
print(n + i) | 7 | PYTHON3 |
word=input()
upper=0
lower=0
for i in word:
if(ord(i)>=65 and ord(i)<=90):
upper+=1
else:
lower+=1
if(upper>lower):
word=word.upper()
else:
word=word.lower()
print(word) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
} p[100010];
bool cmp(node x, node y) {
if (x.a == y.a) return x.b < y.b;
return x.a < y.a;
}
int main() {
int n;
bool flag = false;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &p[i].a, &p[i].b);
}
sort(p + 1, p + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
if (p[i].b <= p[i - 1].b) {
flag = true;
break;
}
}
if (flag == true)
printf("Happy Alex\n");
else
printf("Poor Alex\n");
return 0;
}
| 7 | CPP |
t=int(input())
for i in range(t):
n=int(input())
a=list(map(int,input().split()))
c=0
for j in range(n):
if a[j]!=1:
if c%2==0:
print("First")
break
else:
print("Second")
break
else:
c=c+1
if c==n :
if c%2==0:
print("Second")
else:
print("First")
| 8 | PYTHON3 |
n = int( input() )
l, r = 0, 0
for i in range( n ):
x, y = list( map( int, input().split() ) )
if x < 0:
l += 1
else:
r += 1
if l >= n-1 or r >= n-1:
print( "Yes" )
else:
print( "No" )
| 7 | PYTHON3 |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
const int MN=2e5+5;
int n,m,a[MN],b[MN];
void update(int l,int r){l=max(l,1);r=min(r,n);b[l]++;b[r+1]--;}
int main(){
scanf("%d%d",&n,&m);
for(reg int i=1;i<=n;i++)scanf("%d",a+i);
while(m--){
for(reg int i=1;i<=n;i++)update(i-a[i],i+a[i]);
for(reg int i=1;i<=n;i++)b[i]+=b[i-1];
for(reg int i=1;i<=n;i++)a[i]=b[i],b[i]=0;
reg int flg=1;
for(reg int i=1;i<=n;i++)if(a[i]!=n)flg=0;
if(flg)break;
}
for(reg int i=1;i<=n;i++)printf("%d ",a[i]);
return 0;
} | 0 | CPP |
n=int(input())
for i in range(int(n**0.5),0,-1):
if n%i==0:
print(i+n//i-2)
exit()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int lstans, fa[200005], top = 0, sz[200005], n, Q;
struct abc {
int op, x, y, bg[2], ed[2], csx;
} q[200005];
vector<pair<int, int> > g[200005 << 2];
map<pair<int, int>, int> mmp;
struct qwq {
int u, v;
} st[200005 * 20];
int find(int x) { return fa[x] == x ? x : find(fa[x]); }
int trans(int x, int y) { return (x + y - 1) % n + 1; }
void merge(int x, int y) {
int u = find(x), v = find(y);
if (sz[u] < sz[v]) swap(u, v);
st[++top] = (qwq){u, v};
if (u != v) fa[v] = u, sz[u] += sz[v];
}
void undo(int lim) {
while (top > lim) {
int v = st[top].v, u = st[top].u;
sz[u] -= sz[v], fa[v] = v;
--top;
}
}
bool query(int x, int y) { return find(x) == find(y); }
void insert(int l, int r, int o, int L, int R, pair<int, int> x) {
if (L > R) return;
if (L == l && R == r) return g[o].push_back(x), void();
int mid = (l + r) >> 1;
if (R <= mid)
insert(l, mid, (o << 1), L, R, x);
else if (L > mid)
insert(mid + 1, r, ((o << 1) | 1), L, R, x);
else
insert(l, mid, (o << 1), L, mid, x),
insert(mid + 1, r, ((o << 1) | 1), mid + 1, R, x);
}
void solve(int l, int r, int o, int lstop) {
for (auto x : g[o]) merge(x.first, x.second);
int mid = (l + r) >> 1;
if (l == r) {
if (q[l].op == 2) {
int _x = trans(q[l].x, lstans), _y = trans(q[l].y, lstans);
if (_x > _y) swap(_x, _y);
if (query(_x, _y))
putchar('1'), lstans = 1;
else
putchar('0'), lstans = 0;
} else {
for (int i = (1); i >= (0); --i) {
if (lstans != i && q[l].csx) continue;
int _x = trans(q[l].x, i), _y = trans(q[l].y, i);
if (_x > _y) swap(_x, _y);
int tmp = mmp[make_pair(_x, _y)];
if (lstans == i) mmp[make_pair(_x, _y)] ^= 1, tmp ^= 1;
if (tmp) insert(1, Q, 1, q[l].bg[i], q[l].ed[i], make_pair(_x, _y));
}
}
} else {
solve(l, mid, (o << 1), top);
solve(mid + 1, r, ((o << 1) | 1), top);
}
undo(lstop);
}
int main() {
int x, y, _x, _y, op;
scanf("%d%d", &n, &Q);
for (int i = (1); i <= (n); ++i) fa[i] = i, sz[i] = 1;
for (int i = (1); i <= (Q); ++i) {
scanf("%d%d%d", &op, &x, &y);
q[i].op = op, q[i].x = x, q[i].y = y;
}
for (int i = (Q); i >= (1); --i) {
if (q[i].op == 2) continue;
for (int j = (0); j <= (1); ++j) {
_x = trans(q[i].x, j), _y = trans(q[i].y, j);
if (_x > _y) swap(_x, _y);
int tmp = mmp[make_pair(_x, _y)];
if (tmp && tmp != i)
q[i].ed[j] = tmp;
else {
if (tmp == i)
q[i].csx = 1, q[i].ed[j] = q[i].ed[j ^ 1];
else
q[i].ed[j] = Q;
}
q[i].bg[j] = i + 1, mmp[make_pair(_x, _y)] = i;
}
}
mmp.clear();
solve(1, Q, 1, 0);
}
| 12 | CPP |
n=int(input())
a=list(map(int,input().split()))
b=list()
for i in range(len(a)):
b.append(list(map(int,input().split())))
c=[]
for i in range(len(a)):
k=0
for item in b[i]:
k=k+5*item
k=k+a[i]*15
c.append(k)
print(min(c)) | 7 | PYTHON3 |
#!/usr/bin/env python3.7
n = int(input())
for _ in range(n):
a, b, c = input(), input(), input()
for x in zip(a, b, c):
xl = len(set(x))
if xl == 3:
print("NO")
break
elif xl == 2:
if x[0]==x[1]:
print("NO")
break
else:
print("YES")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
long long mod = 1e9 + 7;
vector<vector<int> > choose(N, vector<int>(N, -1));
void fillchoose(int n = N - 1) {
choose[1][0] = choose[1][1] = 1;
for (int i = 2; i <= n; ++i) {
choose[i][0] = choose[i][i] = 1;
for (int j = 1; j < i; ++j) {
choose[i][j] = (choose[i - 1][j - 1] + choose[i - 1][j]) % mod;
}
}
}
vector<long long> fac(N, 1);
void fillfac(int n = N - 1) {
for (long long i = 2; i <= n; ++i) {
fac[i] = (fac[i - 1] * i) % mod;
}
}
long long power(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a % mod;
long long res = power(a, b / 2);
long long res2 = (res * res) % mod;
return (res2 * (b % 2 == 0 ? 1 : a)) % mod;
}
vector<int> segsz;
int fp[N];
int main() {
int n, m;
cin >> n >> m;
fillchoose();
fillfac();
for (int i = 0; i < m; ++i) {
cin >> fp[i];
}
sort(fp, fp + m);
int r1 = fp[0] - 1;
int r2 = n - fp[m - 1];
for (int i = 1; i < m; ++i) {
if (fp[i] - fp[i - 1] > 1) segsz.push_back(fp[i] - fp[i - 1] - 1);
}
int t = n - m;
long long res = choose[t][r1];
t -= r1;
res = (res * choose[t][r2]) % mod;
t -= r2;
for (auto l : segsz) {
res = (res * choose[t][l]) % mod;
t -= l;
res = (res * power(2, l - 1)) % mod;
}
cout << res;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int mx1 = 0, mx2 = 0;
map<string, int> m;
while (cin >> s) ++m[s];
for (auto i : m) mx1 = max(mx1, i.second);
for (auto i : m) mx2 = max(mx2, (int)i.first.size());
for (auto i : m) {
if (i.second == mx1) cout << i.first << " ";
}
for (auto i : m) {
if ((int)i.first.size() == mx2) cout << i.first << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
char s[15];
char sub[15];
char ans[15];
int n;
void generate_sub(int x) {
int counter = 0;
for (int i = 0; i < n; ++i)
if (x & (1 << i)) sub[counter++] = s[i];
sub[counter] = 0;
}
bool pal() {
int i = 0, j = strlen(sub) - 1;
while (i <= j) {
if (sub[i] != sub[j]) return false;
++i;
--j;
}
return true;
}
int main(void) {
scanf("%s", s);
n = strlen(s);
ans[0] = 0;
for (int i = 0; i < (1 << n); ++i) {
generate_sub(i);
if (!pal()) continue;
if (strcmp(ans, sub) < 0) strcpy(ans, sub);
}
printf("%s", ans);
return 0;
}
| 7 | CPP |
n=int(input())
k=int(input())
c=1
for x in range(n):
c=min(c*2,c+k)
print(c) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char str[1000009];
int main(void) {
while (gets(str)) {
int state = 0, len = strlen(str);
vector<int> plus, sub;
for (int i = 0; str[i]; i++) {
if (!state && str[i] == '1' && str[i + 1] != '1')
plus.push_back(len - i - 1);
else if (!state && str[i] == '1' && str[i + 1] == '1') {
state = 1;
plus.push_back(len - i);
} else if (state == 1 && str[i] == '0') {
if (str[i + 1] == '1') {
state = 2;
sub.push_back(len - i - 1);
} else {
state = 0;
sub.push_back(len - i);
}
} else if (state == 2 && str[i] == '0') {
if (str[i + 1] == '1') {
sub.push_back(len - i - 1);
} else {
state = 0;
sub.push_back(len - i);
}
}
}
if (state) sub.push_back(0);
printf("%d\n", plus.size() + sub.size());
for (int i = 0; i < plus.size(); i++) printf("+2^%d\n", plus[i]);
for (int i = 0; i < sub.size(); i++) printf("-2^%d\n", sub[i]);
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
template <class T>
inline void ckmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void ckmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
using VI = vector<int>;
int main() {
std::ios::sync_with_stdio(false);
int n, k;
while (cin >> n >> k) {
vector<int> a(n, -1);
vector<int> b(n, -1);
for (int i = 0; i < (k); ++i) {
int p;
cin >> p;
--p;
if (a[p] < 0) a[p] = i;
b[p] = i;
}
int ret = 0;
for (int x = 0; x < (n); ++x)
for (int d = -1; d <= 1; d++) {
int y = x + d;
if (y < 0 || y >= n) continue;
if (a[x] < 0)
++ret;
else if (b[y] < a[x])
++ret;
}
printf("%d\n", ret);
break;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-12;
const int inf = 2000000000;
const long long int infLL = (long long int)2e18;
long long int MOD = 1000000007;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
return n | (1LL << i);
;
}
inline long long int resetBit(long long int n, long long int i) {
return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
a %= MOD;
(a < 0) && (a += MOD);
}
inline long long int modMul(long long int a, long long int b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a * b) % MOD;
}
inline long long int modAdd(long long int a, long long int b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a + b) % MOD;
}
inline long long int modSub(long long int a, long long int b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline long long int modPow(long long int b, long long int p) {
long long int r = 1LL;
while (p) {
if (p & 1) r = modMul(r, b);
b = modMul(b, b);
p >>= 1LL;
}
return r;
}
inline long long int modDiv(long long int a, long long int b) {
return modMul(a, modPow(b, MOD - 2));
}
bool comp(const pair<long long int, pair<long long int, long long int> > &p1,
const pair<long long int, pair<long long int, long long int> > &p2) {
return p1.first > p2.first;
}
bool comp1(const pair<long long int, long long int> &p1,
const pair<long long int, long long int> &p2) {
if (p1.first == p2.first) {
return p1.second > p2.second;
}
return p1.first < p2.first;
}
long long int converter(string a) {
long long int i, mul = 1, r, t, ans = 0LL;
if (a.length() == 0) return 0;
for (i = a.length() - 1; i >= 0; i--) {
t = a[i] - '0';
r = t % 10;
ans += (mul * r);
mul = mul * 10;
}
return ans;
}
int msb(unsigned x) {
union {
double a;
int b[2];
};
a = x;
return (b[1] >> 20) - 1023;
}
const int MAX = 10000005;
long long int cnt[MAX + 5], n, p[MAX + 5];
vector<long long int> prime;
void sieve() {
long long int i, j, x = sqrt(MAX) + 1;
for (i = 2; i < MAX; ++i) p[i] = i;
for (i = 2; i <= x; ++i)
if (p[i] == i) {
for (j = i * i; j < MAX; j += i) p[j] = min(p[j], i);
}
for (i = 2; i < MAX; ++i)
if (p[i] == i) prime.push_back(i);
}
bool oka(long long int now) {
for (int i = 0; i < prime.size(); ++i) {
long long int x = now, cur = 0;
if (cnt[prime[i]] != 0) {
while (1) {
if (x < prime[i]) break;
cur += (x / prime[i]);
x = x / prime[i];
}
if (cur < cnt[prime[i]]) return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int i, x;
sieve();
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> x;
cnt[x]++;
}
for (i = MAX - 1; i >= 2; --i) cnt[i] += cnt[i + 1];
for (i = MAX - 1; i >= 2; --i)
if (p[i] != i) {
cnt[p[i]] += cnt[i];
cnt[i / p[i]] += cnt[i];
}
long long int low = 1, high = (long long int)1e13, mid, ans = infLL;
while (low <= high) {
mid = (low + high) >> 1LL;
if (oka(mid) == true) {
ans = mid;
high = mid - 1;
} else
low = mid + 1;
}
cout << ans << '\n';
return 0;
}
| 11 | CPP |
n=int(input())
a=sorted([int(j) for j in input().split()])[::-1]
mod=10**9+7
ans=0
for i in range(n):
p=pow(4,n-1,mod)*(i+2)%mod
ans=(ans+p*a[i])%mod
print(ans) | 0 | PYTHON3 |
from bisect import bisect_left, bisect_right
Inf = int(1e18) + 7
def tuple_input(type):
return map(type, input().strip().split())
n, H = tuple_input(int)
lo, hi = 0, Inf
while lo < hi:
x = (lo + hi) // 2
if n < x * (x + 1) // 2:
hi = x
else:
lo = x + 1
h0 = min(H, lo - 1)
r = n - h0 * (h0 + 1) // 2
res1 = h0 + r // h0 + (1 if r % h0 else 0)
# print(f'res1: {res1}')
lo, hi = H, Inf
while lo < hi:
x = (lo + hi) // 2
m = x * x - H * (H - 1) // 2
if n < m:
hi = x
else:
lo = x + 1
hp = max(H + 1, lo - 1)
area = hp * hp - H * (H - 1) // 2
if area > n:
print(res1)
exit(0)
r = n - area
res2 = 2 * hp - H + r // hp + (1 if r % hp else 0)
print(min(res1, res2)) | 10 | PYTHON3 |
word = input()
ans = word[0].upper()
ans += word[1:]
print(ans) | 7 | PYTHON3 |
#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
L(const P& a, const P& b){ at(0)=a; at(1)=b; }
L(){}
};
namespace std{
bool operator < (const P& a, const P& b){
return (a.X!=b.X) ? a.X<b.X : a.Y<b.Y;
}
bool operator == (const P& a, const P& b){
return abs(a-b) < EPS;
}
}
double dot(P a, P b){
return (conj(a)*b).X;
}
double cross(P a, P b){
return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
b -= a;
c -= a;
if(cross(b,c) > EPS) return +1; //ccw
if(cross(b,c) < -EPS) return -1; //cw
if(dot(b,c) < -EPS) return +2; //c-a-b
if(abs(c)-abs(b) > EPS) return -2; //a-b-c
return 0; //a-c-b
}
bool isParallel(const P &a, const P &b){
return abs(cross(a,b)) < EPS;
}
bool isParallel(const L &a, const L &b){
return isParallel(a[1]-a[0], b[1]-b[0]);
}
bool intersectLS(const L& l, const L& s){
return cross(l[1]-l[0], s[0]-l[0])*
cross(l[1]-l[0], s[1]-l[0]) < EPS;
}
bool intersectSS(const L& a, const L& b){
return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&
( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );
}
bool intersectSP(const L& s, const P &p){
return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;
}
P crosspointLL(const L &l, const L &m) {
double A = cross(l[1]-l[0], m[1]-m[0]);
double B = cross(l[1]-l[0], l[1]-m[0]);
return m[0] + B/A *(m[1]-m[0]);
}
double L1distance(const P &a, const P &b){
return abs(b.X -a.X) +abs(b.Y -a.Y);
}
double L1distanceSP(const L &s, const P &p){
double ret = INF;
for(int i=0; i<2; i++){
L gl(p, p +P(i, 1-i));
if(!isParallel(s, gl) && intersectLS(gl, s)){
P cp = crosspointLL(s, L(p, p+P(i,1-i)));
ret = min(ret, abs(p -cp));
}
ret = min(ret, L1distance(p, s[i]));
}
return ret;
}
int in_poly(const P &p, const VP &poly){
int n = poly.size();
int ret = -1;
for(int i=0; i<n; i++){
P a = poly[i]-p;
P b = poly[(i+1)%n]-p;
if(a.Y > b.Y) swap(a,b);
if(intersectSP(L(a,b), P(0,0))) return 0;
if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = 1-ret;
}
return ret;
}
vector<L> arrangement(const vector<L> &e){
vector<VP> cp(e.size());
for(int i=0; i<(int)e.size(); i++){
for(int j=i+1; j<(int)e.size(); j++){
if(!isParallel(e[i], e[j]) && intersectSS(e[i], e[j])){
P cpij = crosspointLL(e[i], e[j]);
cp[i].push_back(cpij);
cp[j].push_back(cpij);
}
}
sort(cp[i].begin(), cp[i].end());
cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());
}
vector<L> ret;
for(int i=0; i<(int)e.size(); i++){
for(int j=0; j<(int)cp[i].size()-1; j++){
ret.push_back(L(cp[i][j], cp[i][j+1]));
}
}
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
int main(){
while(1){
int n,r;
cin >> n >> r;
if(n==0) break;
VP v(n);
for(int i=0; i<n; i++){
double x,y;
cin >> x >> y;
v[i] = P(x,y);
}
vector<VP> sq(n, VP(4));
for(int i=0; i<n; i++){
sq[i][0] = v[i] +P(r, 0);
sq[i][1] = v[i] +P(0, r);
sq[i][2] = v[i] +P(-r, 0);
sq[i][3] = v[i] +P(0, -r);
}
vector<L> l;
l.reserve(9*n);
for(int i=0; i<n; i++){
l.push_back(L(v[i], v[(i+1)%n]));
for(int j=0; j<4; j++){
l.push_back(L(sq[i][j], sq[(i+1)%n][j]));
l.push_back(L(sq[i][j], sq[i][(j+1)%4]));
}
}
vector<L> cand = arrangement(l);
double ans = 0;
for(int i=0; i<(int)cand.size(); i++){
bool rem = true;
for(int j=0; j<n; j++){
P mid = (cand[i][0] +cand[i][1])/2.0;
if(L1distanceSP(L(v[j], v[(j+1)%n]), mid) +EPS < r || in_poly(mid, v) == -1){
rem = false;
break;
}
}
if(rem){
ans += abs(cand[i][1] -cand[i][0]);
}
}
cout << fixed;
cout << setprecision(10);
cout << ans << endl;
}
return 0;
}
| 0 | CPP |
import sys
inputs = sys.stdin.read().split()
for i in range(1, len(inputs)):
if len(inputs[i]) > 10:
word = inputs[i]
print(f"{word[0]}{len(word)-2}{word[len(word) - 1]}")
else:
print(inputs[i])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, ans;
cin >> n >> m;
if (n <= 7 && n % 2 != 0 && (m == 7 || m == 6))
ans = 6;
else if (n == 2 && m == 1)
ans = 4;
else if (n <= 7 && n != 2 && n % 2 == 0 && (m == 7))
ans = 6;
else if (n > 7 && n % 2 != 0 && (m == 7))
ans = 6;
else if (n > 7 && n % 2 == 0 && (m == 7 || m == 6))
ans = 6;
else
ans = 5;
cout << ans << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxx = 200 + 300;
int mark[maxx][maxx];
vector<pair<int, int> > h_, t_;
vector<pair<int, int> > topol;
queue<pair<int, int> > q;
int dis[maxx][maxx];
int d[maxx][maxx];
int R;
void bfs(int, int);
void dfs(int, int);
int main() {
int h, t, n, m;
cin >> h >> t >> R;
cin >> n;
while (n--) {
int a, b;
cin >> a >> b;
h_.push_back(make_pair(a, b));
}
cin >> m;
while (m--) {
int a, b;
cin >> a >> b;
t_.push_back(make_pair(a, b));
}
bfs(h, t);
for (int i = 0; i < maxx; i++) {
fill(mark[i], mark[i] + maxx, 0);
fill(dis[i], dis[i] + maxx, 0);
}
dfs(h, t);
cout << "Zmey" << endl << dis[h][t] + 1 << endl;
}
void bfs(int hh, int tt) {
q.push(make_pair(hh, tt));
mark[hh][tt] = 1;
while (q.size()) {
hh = q.front().first;
tt = q.front().second;
q.pop();
if (!hh && !tt) {
cout << "Ivan" << endl << dis[0][0] << endl;
exit(0);
}
for (int i = 0; i < min((int)h_.size(), hh); i++)
if (!mark[hh - i - 1 + h_[i].first][tt + h_[i].second] &&
hh - i - 1 + h_[i].first + tt + h_[i].second <= R) {
q.push(make_pair(hh - i - 1 + h_[i].first, tt + h_[i].second));
mark[hh - i - 1 + h_[i].first][tt + h_[i].second] = 1;
dis[hh - i - 1 + h_[i].first][tt + h_[i].second] = dis[hh][tt] + 1;
}
for (int i = 0; i < min((int)t_.size(), tt); i++)
if (!mark[hh + t_[i].first][tt - i - 1 + t_[i].second] &&
hh + t_[i].first + tt - i - 1 + t_[i].second <= R) {
q.push(make_pair(hh + t_[i].first, tt - i - 1 + t_[i].second));
mark[hh + t_[i].first][tt - i - 1 + t_[i].second] = 1;
dis[hh + t_[i].first][tt - i - 1 + t_[i].second] = dis[hh][tt] + 1;
}
}
}
void dfs(int hh, int tt) {
mark[hh][tt] = 1;
for (int i = 0; i < min((int)h_.size(), hh); i++) {
if (hh - i - 1 + h_[i].first + tt + h_[i].second > R) continue;
if (mark[hh - i - 1 + h_[i].first][tt + h_[i].second] == 1) {
cout << "Draw" << endl;
exit(0);
} else if (!mark[hh - i - 1 + h_[i].first][tt + h_[i].second])
dfs(hh - i - 1 + h_[i].first, tt + h_[i].second);
dis[hh][tt] =
max(dis[hh][tt], dis[hh - i - 1 + h_[i].first][tt + h_[i].second] + 1);
}
for (int i = 0; i < min((int)t_.size(), tt); i++) {
if (hh + t_[i].first + tt - i - 1 + t_[i].second > R) continue;
if (mark[hh + t_[i].first][tt - i - 1 + t_[i].second] == 1) {
cout << "Draw" << endl;
exit(0);
} else if (!mark[hh + t_[i].first][tt - i - 1 + t_[i].second])
dfs(hh + t_[i].first, tt - i - 1 + t_[i].second);
dis[hh][tt] =
max(dis[hh][tt], dis[hh + t_[i].first][tt - i - 1 + t_[i].second] + 1);
}
mark[hh][tt] = 2;
topol.push_back(make_pair(hh, tt));
}
| 11 | CPP |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T, class S>
ostream &operator<<(ostream &o, const pair<T, S> &p) {
return o << '(' << p.first << ", " << p.second << ')';
}
template <template <class, class...> class T, class... A>
typename enable_if<!is_same<T<A...>, string>(), ostream &>::type operator<<(
ostream &o, T<A...> V) {
o << '[';
for (auto a : V) o << a << ", ";
return o << ']';
}
string grid[110];
long long int n, m, dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0};
bool used[110][110];
void dfs(long long int i, long long int j) {
used[i][j] = true;
for (long long int k = 0; k < 4; k++) {
long long int i2 = i + dx[k], j2 = j + dy[k];
if ((i2 >= 0 && j2 >= 0 && i2 < n && j2 < m) && !used[i2][j2] &&
grid[i2][j2] != '#')
dfs(i2, j2);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int tc;
cin >> tc;
while (tc--) {
cin >> n >> m;
for (long long int i = 0; i < n; i++) cin >> grid[i];
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < m; j++) used[i][j] = false;
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < m; j++)
if (grid[i][j] == 'B')
for (long long int k = 0; k < 4; k++) {
long long int i2 = i + dx[k], j2 = j + dy[k];
if ((i2 >= 0 && j2 >= 0 && i2 < n && j2 < m) && grid[i2][j2] == '.')
grid[i2][j2] = '#';
}
if (grid[n - 1][m - 1] != '#') dfs(n - 1, m - 1);
string ans = "Yes\n";
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < m; j++)
if (used[i][j] && grid[i][j] == 'B')
ans = "No\n";
else if (!used[i][j] && grid[i][j] == 'G')
ans = "No\n";
cout << ans;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans = 0;
long long int arr[10] = {0, 9, 99, 999, 9999,
99999, 999999, 9999999, 99999999, 999999999};
long long int N;
cin >> N;
int i;
for (i = 0; i < 10; i++) {
if (N < arr[i]) break;
}
int j;
for (j = 1; j < i; j++) ans += (j) * (arr[j] - arr[j - 1]);
ans += j * (N - arr[i - 1]);
cout << ans;
return 0;
}
| 8 | CPP |
t=int(input())
while(t>0):
n,x=map(int,input().split())
list=[int(i) for i in input().split()]
list.sort(reverse=True)
i,cnt,money=0,0,0
while(i<n):
if(list[i]>=x):
cnt+=1
money+=(list[i]-x)
elif(list[i]<x and x-list[i]>money):
break
else:
cnt+=1
money-=(x-list[i])
i+=1
print(cnt)
t-=1 | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < s.size(); i++) {
m[s[i]]++;
}
int r = 0;
int rr = 0;
for (char i = 'a'; i <= 'z'; i++) {
if (m[i] == 1)
rr++;
else if (m[i])
r++;
}
int ans = r + rr / 2;
if (ans) {
cout << ans << endl;
} else if (rr != 1) {
cout << "1\n";
} else
cout << "0\n";
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
| 8 | CPP |
from math import ceil
n,m=map(int,input().split())
c=list(map(int,input().split()))
for i in range(len(c)):
c[i]=ceil(c[i]/m)
t=max(c)
for i in range(n-1,-1,-1):
if c[i]==t:
break
print(i+1)
| 7 | PYTHON3 |
n=int(input());s=input()
b=0
w=s.count('.')
ans=w
for si in s:
b+=(si=='#')
w-=(si=='.')
ans=min(ans,b+w)
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long ABS(long long a) {
if (a >= 0) return a;
return -a;
}
int gcd(int a, int b) {
if (b > a) swap(a, b);
while (b) {
int buffer = a % b;
a = b;
b = buffer;
}
return a;
}
int n, m, x, y, a, b;
bool check(pair<int, int> a, pair<int, int> b) {
if (a.first >= 0 && a.first <= n)
if (a.second >= 0 && a.second <= m)
if (b.first >= 0 && b.first <= n)
if (b.second >= 0 && b.second <= m) return true;
return false;
}
void fun(pair<int, int> &point1, pair<int, int> &point2) {
if (point1.first < 0) {
int dist = -point1.first;
point1.first += dist;
point2.first += dist;
}
if (point1.first > n) {
int dist = point1.first - n;
point1.first -= dist;
point2.first -= dist;
}
if (point1.second < 0) {
int dist = -point1.second;
point1.second += dist;
point2.second += dist;
}
if (point1.second > m) {
int dist = point1.second - m;
point1.second -= dist;
point2.second -= dist;
}
}
int main() {
cin >> n >> m >> x >> y >> a >> b;
int buffer = gcd(a, b);
a /= buffer;
b /= buffer;
int k1 = n / a;
int k2 = m / b;
int k = min(k1, k2);
a *= k;
b *= k;
pair<int, int> center;
center.first = a >> 1;
center.second = b >> 1;
pair<int, int> point1 =
make_pair(x - center.first - a % 2, y - center.second - b % 2);
pair<int, int> point2 = make_pair(point1.first + a, point1.second + b);
while (!check(point1, point2)) {
fun(point1, point2);
fun(point2, point1);
}
cout << point1.first << " " << point1.second << " " << point2.first << " "
<< point2.second;
return 0;
}
| 10 | CPP |
n = int(input())
a1 = []
for k in range(n):
a1.append(input())
for a in a1:
if len(a) == 1:
print(-1)
elif a != a[::-1]:
print(a)
else:
a = list(a)
mid = (len(a) + 1) // 2
count = 0
for i in range(len(a)):
if a[i] != a[mid]:
temp = a[i]
a[i] = a[mid]
a[mid] = temp
print(''.join(a))
break
else:
count += 1
if count == len(a):
print(-1)
| 8 | PYTHON3 |
s=input().split('WUB')
for i in s:
if(i!=''):
print(i,end=' ') | 7 | PYTHON3 |
#------------------------------what is this I don't know....just makes my mess faster--------------------------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#----------------------------------Real game starts here--------------------------------------
'''
___________________THIS IS AESTROIX CODE________________________
KARMANYA GUPTA
'''
#_______________________________________________________________#
import math
def fact(x):
if x == 0:
return 1
else:
return x * fact(x-1)
def lower_bound(li, num): #return 0 if all are greater or equal to
answer = -1
start = 0
end = len(li)-1
while(start <= end):
middle = (end+start)//2
if li[middle] >= num:
answer = middle
end = middle - 1
else:
start = middle + 1
return answer #index where x is not less than num
def upper_bound(li, num): #return n-1 if all are small or equal
answer = -1
start = 0
end = len(li)-1
while(start <= end):
middle = (end+start)//2
if li[middle] <= num:
answer = middle
start = middle + 1
else:
end = middle - 1
return answer #index where x is not greater than num
def abs(x):
return x if x >=0 else -x
#_______________________________________________________________#
def binary_search(li, val, lb, ub):
ans = 0
while(lb <= ub):
mid = (lb+ub)//2
#print(mid, li[mid])
if li[mid] > val:
ub = mid-1
elif val > li[mid]:
lb = mid + 1
else:
ans = 1
break
return ans
def divisor(n):
for i in range(2, int(math.sqrt(n))+1):
if n%i == 0:
return i
return n
import math
for t in range(int(input())):
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(k):
a.sort()
b.sort()
if a[0] > b[-1]:
break
a[0], b[-1] = b[-1], a[0]
print(sum(a))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
char s[2][100];
int x[2];
int main() {
scanf("%s %s", s[0], s[1]);
for (int i = 0; i < 2; i++) {
if (s[i][0] == 'm') x[i] = 1;
if (s[i][0] == 't' && s[i][1] == 'u') x[i] = 2;
if (s[i][0] == 'w') x[i] = 3;
if (s[i][0] == 't' && s[i][1] == 'h') x[i] = 4;
if (s[i][0] == 'f') x[i] = 5;
if (s[i][0] == 's' && s[i][1] == 'a') x[i] = 6;
if (s[i][0] == 's' && s[i][1] == 'u') x[i] = 0;
}
if ((x[0] + 31) % 7 == x[1]) {
puts("YES");
return 0;
}
if ((x[0] + 30) % 7 == x[1]) {
puts("YES");
return 0;
}
if ((x[0] + 28) % 7 == x[1]) {
puts("YES");
return 0;
}
puts("NO");
return 0;
}
| 7 | CPP |
from sys import stdin
def help():
stri=stdin.readline().strip("\n")
n=int(stri)
arr=list(map(int,stdin.readline().split(" ")))
if(arr[0]<0):
sign=0
else:
sign=1
sumi=0
currmax=arr[0]
for i in range(1,n):
if(sign==0 and arr[i]<0):
currmax=max(arr[i],currmax)
elif(sign==1 and arr[i]>0):
currmax=max(arr[i],currmax)
else:
sumi+=currmax
if(arr[i]<0):
sign=0
else:
sign=1
currmax=arr[i]
sumi+=currmax
print(sumi)
for i in range(int(stdin.readline())):
help()
# def help(ii):
# # stri=stdin.readline().strip("\n")
# # row,col,r1,c1,r2,c2=map(int,stdin.readline().split(" "))
# arr=[[0]*row for i in range(col)]
# # print("Case #"+str(ii+1)+":",east,south)
# for i in range(int(stdin.readline())):
# help(i)
# row,col=map(int,stdin.readline().split(" "))
# def func(row,col):
# arr=[[0]*(col) for i in range(row)]
# arr[0][0]=1
# for i in range(row):
# for j in range(col):
# if(i+1==row and j+1==col):
# continue
# elif(i+1==row):
# arr[i][j+1]+=arr[i][j]
# elif(j+1==col):
# arr[i+1][j]+=arr[i][j]
# else:
# arr[i+1][j]+=arr[i][j]/2
# arr[i][j+1]+=arr[i][j]/2
# for i in range(row):
# print(*arr[i],sep="\t\t")
# func(8,8) | 9 | PYTHON3 |
n, k = map(int, input().split())
b = 0
score = list(map(int, input().split()))
k -= 1
x = int(score[k])
for a in score:
if a > 0:
if a >= x:
b += 1
print(b)
| 7 | PYTHON3 |
from sys import stdin
input = iter(stdin.readlines()).__next__
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
# maximum d such n % d == 0 and d <= k
ld = 1
d = 1
while d <= n ** 0.5 + 1:
if n % d == 0:
if d <= k:
ld = max(ld, d)
if n // d <= k:
ld = max(ld, n // d)
d += 1
print(n // ld)
| 10 | PYTHON3 |
d = dict(zip('v<^>', range(4)))
x, y = input().split()
t = int(input()) % 4
print('undefined' if t%2==0 else 'ccw' if t==(d[x]-d[y])%4 else 'cw') | 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 lb = 1000;
void vrikodara(long long n = 12) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(n) << fixed;
}
long long fun(vector<long long> a, vector<long long> b, long long sb,
long long sa) {
sort(a.begin(), a.end());
long long s = 0, p = 0;
vector<long long> v;
for (auto i : a) {
if (i < sb) {
s += i;
p = i;
} else
v.push_back(i);
}
long long sz = v.size();
if (sz) {
s += sb * sz;
} else {
s += sb - p;
}
return s;
}
void solve() {
long long m, n;
cin >> m >> n;
vector<long long> a(m), b(n);
for (long long i = 0; i < m; i++) cin >> a[i];
;
for (long long i = 0; i < n; i++) cin >> b[i];
;
long long ma = 0, mb = 0, sa = 0, sb = 0;
for (auto i : a) {
ma = max(ma, i);
sa += i;
}
for (auto i : b) {
mb = max(mb, i);
sb += i;
}
long long ans = min(fun(a, b, sb, sa), fun(b, a, sa, sb));
cout << ans << "\n";
}
int32_t main() {
vrikodara();
long long t = 1;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
u=int(input())
l=0
y=int(input())
e=0
for i in range(u-1):
j=y
y=int(input())
if y%10!=j%10:
l+=1
print(l+1)
| 7 | PYTHON3 |
s = input().split()
ans = 4
has = []
for i in s:
if i not in has:
ans -= 1
has.append(i)
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return l + rng() % (r - l + 1); }
const int N = 5555;
int n, m;
int f[N][N];
string a, b;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
;
cin >> a;
n = a.size();
a = " " + a;
cin >> b;
m = b.size();
b = " " + b;
for (int i = 1, _c = n; i <= _c; ++i) f[0][i] = -n - n;
for (int i = 0, _c = n - 1; i <= _c; ++i) {
int j = i + 1, t = m;
while (j && t) {
if (a[j] == b[t]) t--;
j--;
}
if (!t) {
for (int k = 0, _c = i + 1; k <= _c; ++k) {
if (j >= k - i + j - 1 + m && k - i + j - 1 + m >= 0) {
f[i + 1][k] = max(f[i + 1][k], f[j][k - i + j - 1 + m] + 1);
}
}
}
for (int k = 0, _c = i + 1; k <= _c; ++k)
f[i + 1][k] = max(f[i + 1][k], f[i][k]);
}
for (int i = 0, _c = n; i <= _c; ++i) {
cout << f[n][i] << " ";
}
}
| 11 | CPP |
X, t = [int(i) for i in input().split()]
print(max(X-t, 0))
| 0 | PYTHON3 |
from collections import deque
n, m = map(int, input().split())
hor = [1 if char == ">" else -1 for char in input()]
vert = [1 if char == "v" else -1 for char in input()]
def solve(n, m, hor, vert):
for r in range(n):
for c in range(m):
if not explore(n, m, hor, vert, (r,c)):
return False
return True
def explore(n, m, hor, vert, start_pos):
visited = [[0] * m for _ in range(n)]
count = 0
nodes = deque([start_pos])
visited[start_pos[0]][start_pos[1]] = 1
while nodes:
r, c = nodes.popleft()
count += 1
r_inc, c_inc = vert[c], hor[r]
for dr, dc in [(r + r_inc, c), (r, c + c_inc)]:
if 0 <= dr < n and 0 <= dc < m and not visited[dr][dc]:
nodes.append((dr, dc))
visited[dr][dc] = 1
return count == n*m
if solve(n, m, hor, vert):
print("YES")
else:
print("NO") | 8 | PYTHON3 |
import sys
import math
import bisect
import itertools
import random
import re
def solve(A):
ans = 0
for a in A:
ans |= a
return ans
def main():
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = solve(A) + solve(B)
print(ans)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#include<stdio.h>
int main(void)
{
float n,m;
while(scanf("%f %f",&n,&m)!=EOF){
if(n<35.50&&m<71.0){
printf("AAA\n");
}
else if(n<37.50&&m<77.0){
printf("AA\n");
}
else if(n<40.00&&m<83.0){
printf("A\n");
}
else if(n<43.00&&m<89.0){
printf("B\n");
}
else if(n<50.00&&m<105.0){
printf("C\n");
}
else if(n<55.00&&m<116.0){
printf("D\n");
}
else if(n<70.00&&m<148.0){
printf("E\n");
}
else printf("NA\n");
}
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n,m;
cin >> n;
string s;
map<string, int> ans;
rep(i,n){
cin >> s;
ans[s]++;
}
cin >> m;
rep(i,m){
cin >> s;
ans[s]--;
}
int maxs = 0;
for(auto [moji, suji]: ans){
if(suji > maxs)maxs = suji;
}
cout << maxs << endl;
return 0;
} | 0 | CPP |
raw = [int(x) for x in input().split(' ')]
k = raw[1]
instr = input()
letters = []
for l in instr:
if l not in letters:
letters.append(l)
letters.sort()
if k <= len(instr):
for i in range(k-1,-1,-1):
if instr[i] != letters[-1]:
repl = instr[:i]+letters[letters.index(instr[i])+1]+(k-i-1)*letters[0]
break
else:
repl = instr+(k-len(instr))*letters[0]
print(repl) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double inf = 1e100;
const int iinf = 1 << 30;
int a[1000][1000];
vector<int> v[1000], v2[1000], vv;
int dfs(int q) {
vv.push_back(q);
if (v[q].size() > 0)
return min(dfs(v[q][0]), a[q][v[q][0]]);
else
return iinf;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int x, y, c;
cin >> x >> y >> c;
int t = c / (2 * m);
int r = (c) % (2 * m - 2) + 1;
int res = 0;
if (r <= m) {
if (x >= r) {
res = x - r;
if (x <= y)
res += y - x;
else
res += m - x + m - y;
} else {
res = m - x + m - r;
if (x >= y)
res += x - y;
else
res += x + y - 2;
}
} else {
r = 2 * m - r;
if (x > r) {
res = x + r - 2;
if (x <= y)
res += y - x;
else
res += m - x + m - y;
} else {
res = r - x;
if (x >= y)
res += x - y;
else
res += x + y - 2;
}
}
if (x == y)
cout << c << endl;
else
cout << c + res << endl;
}
return 0;
}
| 7 | CPP |
a=[int(input()) for i in range(4)]
print(min(a[0],a[1])+min(a[2],a[3])) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char plusses[][31] = {
"..............................", "..............X...............",
".............XXX..............", "............XXXXX.............",
"...........XXXXXXX............", "..........XXXXXXXXX...........",
".........XXXXXXXXXXX..........", "........XXXXXXXXXXXXX.........",
".......XXXXXXXXXXXXXXX........", "......XXXXXXXXXXXXXXXXX.......",
".....XXXXXXXXXXXXXXXXXXX......", "....XXXXXXXXXXXXXXXXXXXXX.....",
"...XXXXXXXXXXXXXXXXXXXXXXX....", "..XXXXXXXXXXXXXXXXXXXXXXXXX...",
};
int v[] = {0, -1, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23};
void to_zero(int t) {
int j = 0;
while (t) {
printf("X.");
j += 2;
if (j >= 30) {
j = 0;
printf("\n%s\n", plusses[0]);
}
t--;
}
if (j == 0) return;
while (j > 0) {
printf("..");
j += 2;
if (j >= 30) j = 0;
}
printf("\n%s\n", plusses[0]);
}
void printchar(int c) {
to_zero(c);
printf("%s\n%s\n%s\n", plusses[1], plusses[1], plusses[0]);
}
int main() {
int c;
int last = 256;
while (true) {
c = getchar();
if (c < 33 || c > 122) break;
int t = last - c - 1;
if (t < 0) t += 256;
printchar(t);
last = c;
}
return 0;
}
| 13 | CPP |
fin = int(input())
results = ""
for k in range(fin):
fin1 = input()
if len(fin1) <= 10:
if k != fin - 1:
results += fin1 + "\n"
else:
results += fin1
else:
fin2 = fin1[0] + str(len(fin1) - 2) + fin1[-1]
if k!= fin - 1:
results += fin2 + "\n"
else:
results += fin2
print(results) | 7 | PYTHON3 |
from itertools import groupby
web_addresses_number = int(input())
prephix = "http://"
def split_address(address):
host = ""
path = ""
address = address[7:]
i = 0
while i < len(address) and address[i] != '/':
host += address[i]
i += 1
while i < len(address):
path += address[i]
i += 1
return (host, path)
hosts = {}
for i in range(web_addresses_number):
host, path = split_address(input())
if host in hosts:
hosts[host].add(path)
else:
hosts[host] = {path}
groups = []
hosts = {host:"+".join(sorted(hosts[host])) for host in hosts}
groping = groupby(sorted(hosts, key = lambda host: hosts[host]), key = lambda host: hosts[host])
for key, group in groping:
g = list(group)
if len(g) > 1:
groups.append(g)
print(len(groups))
[print(" ".join(map(lambda host: prephix + host, group))) for group in groups]
| 9 | PYTHON3 |
#from collections import Counter
#from collections import defaultdict
#import math
#n = int(input())
#n,m = map(int,input().split())
#l = list(map(int,input().split()))
#t = list(map(int,input().split()))
n,a,b,c = map(int,input().split())
l = list(set([a,b,c]))
k = []
for i in l:
if i <=n:
k.append(i)
l = k
l.sort()
t = [i//l[0] if i%l[0] == 0 else 0 for i in range(0,n+1)]
#print(t)
for x in l[1:]:
if t[x] == 0:
t[x] = 1
for i in range(x+1,n+1):
if t[i-x] !=0:
#print(x,i)
t[i] = max(t[i-x]+1,t[i])
# print(t)
print(t[n])
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.